机载雷达二维自适应处理的空时结构方法比较

在机载雷达时空二维信号处理中，通常有三种处理结构：空时级联、时空级联和空时联合域结构。尽管联合域最优处理在实际中不大可能应用，但它有极为重要的理论价值，人们已将其有用概念和方法应用于空时级联或时空级联结构中，这时“级联”一词的含意已不再是“空、时频率响应之积”，因而它们的性能将大大提高。本文对比分析了空时结构中几种自适应算法的性能，并讨论了其实际应用的可能性。     

EVOKE: A Value-Driven Concept Selection Method for Early System Design

The development of new technologically advanced products requires the contribution from a range of skills and disciplines, which are often difficult to find within a single company or organization. Requirements establishment practices in Systems Engineering (SE), while ensuring coordination of activities and tasks across the supply network, fall short when it comes to facilitate knowledge sharing and negotiation during early system design. Empirical observations show that when system-level requirements are not available or not mature enough, engineers dealing with the development of long lead-time sub-systems tend to target local optima, rather than opening up the design space. This phenomenon causes design teams to generate solutions that do not embody the best possible configuration for the overall system. The aim of this paper is to show how methodologies for value-driven design may address this issue, facilitating early stage design iterations and the resolution of early stage design trade-offs. The paper describes how such methodologies may help gathering and dispatching relevant knowledge about the ‘design intent’ of a system to the cross-functional engineering teams, so to facilitate a more concurrent process for requirement elicitation in SE. The paper also describes EVOKE (Early Value Oriented design exploration with KnowledgE maturity), a concept selection method that allows benchmarking design options at sub-system level on the base of value-related information communicated by the system integrators. The use of EVOKE is exemplified in an industrial case study related to the design of an aero-engine component. EVOKE’s ability to raise awareness on the value contribution of early stage design concepts in the SE process has been further verified with industrial practitioners in ad-hoc design episodes.     

An Economic Model-Based Matching Approach Between Buyers and Sellers Through a Broker in an Open E-Marketplace

A broker in an open e-marketplace enables buyers and sellers to do business with each other. Although a broker plays an important role in e-marketplaces, theory and guidelines for matching between buyers and sellers in multi-attribute exchanges are limited. Therefore, a challenge for a broker’s responsibility is how to maximize a buyer’s total satisfaction degree as its goals under the consideration of trade-off between a buyer’s buying quantity and price paid to a seller, and other attributes. To solve this challenge, this paper proposes an economic model-based matching approach between a buyer’s requirements and a seller’s offers. The major contributions of this paper are that (i) a broker can model a seller’s price policy as per a buyer’s buying quantity through communication between a broker and a seller; (ii) due to each buyer’s different quantity demand, a broker models a buyer’s satisfaction degree as per a buyer’s buying quantity based on communication between a broker and a buyer; and (iii) to carry out a broker’s matching processes, an objective function and a set of constraints are generated to help a broker to maximize a buyer’s total satisfaction degree. Experimental results demonstrate the good performance of the proposed approach.     

Two Innovative Coalition Formation Models for Dynamic Task Allocation in Disaster Rescues

This paper addresses the problem of multi-objective coalition formation for task allocation. In disaster rescue, due to the dynamics of environments, heterogeneity and complexity of tasks as well as limited available agents, it is hard for the single-objective and single (task)-to-single (agent) task allocation approaches to handle task allocation in such circumstances. To this end, two multi-objective coalition formation for task allocation models are proposed for disaster rescues in this paper. First, through coalition formation, the proposed models enable agents to cooperatively perform complex tasks that cannot be completed by single agent. In addition, through adjusting the weights of multiple task allocation objectives, the proposed models can employ the linear programming to generate more adaptive task allocation plans, which can satisfy different task allocation requirements in disaster rescue. Finally, through employing the multi-stage task allocation mechanism of the dynamic programming, the proposed models can handle the dynamics of tasks and agents in disaster environments. Experimental results indicate that the proposed models have good performance on coalition formation for task allocation in disaster environments, which can generate suitable task allocation plans according to various objectives of task allocation.     

Study on the Centralization Strategy of the Blood Allocation Among Different Departments within a Hospital

By far, the researches on how to distribute blood products among different departments in hospital have not been further studied, though the problem of blood shortage and wastage that caused by improper blood allocation is severe, which may endanger patient’s lives and impose considerable costs on hospitals. In order to solve this problem, this paper mainly studies on how to distribute the blood items among different departments within a hospital and investigates the allocation approach with the novel management method by centralizing the inventory of several different departments. By integrating the blood inventory requirements of some departments, the hospital could reduce the rate of blood shortage and wastage effectively, release the pressure of the occupancy of resources and reduce the bullwhip effect of blood products. This paper illustrates the centralization principle in hospital and formulates the mixed integer programming model to work out the optimal allocation network scheme and the optimal inventory setting for every department. And the results of the numerical example demonstrate that this centralization method could considerably reduce blood shortage and wastage in hospital by about 72% and 90% respectively. Furthermore, it could decrease the total cost by about 108,540 RMB a month on blood supply chain management in the hospital and improve the effect of some certain surgeries by transfusing the fresh blood to patients.     

Cost and Service-Level-Based Model for a Seru Production System Formation Problem with Uncertain Demand

With increasing demand diversification and short product lifecycles, industries now encounter challenges of demand uncertainty. The Japanese seru production system has received increased attention owing to its high efficiency and flexibility. In this paper, the problem of seru production system formation under uncertain demand is researched. A multi-objective optimization model for a seru production system formation problem is developed to minimize the cost and maximize the service level of the system. The purpose of this paper is to formulate a robust production system that can respond efficiently to the stochastic demand. Sample average approximation (SAA) is used to approximate the expected objective of the stochastic programming. The non-dominated sorting genetic algorithm II (NSGA-II) is improved to solve the multi-objective optimization model. Numerical experiments are conducted to test the tradeoff between cost and service level, and how the performance of the seru production system varies with the number of product types, mean and deviation of product volume, and skill-level-based cost.     

Aristotle Said “Happiness is a State of Activity” — Predicting Mood Through Body Sensing with Smartwatches

We measure and predict states of Activation and Happiness using a body sensing application connected to smartwatches. Through the sensors of commercially available smartwatches we collect individual mood states and correlate them with body sensing data such as acceleration, heart rate, light level data, and location, through the GPS sensor built into the smartphone connected to the smartwatch. We polled users on the smartwatch for seven weeks four times per day asking for their mood state. We found that both Happiness and Activation are negatively correlated with heart beats and with the levels of light. People tend to be happier when they are moving more intensely and are feeling less activated during weekends. We also found that people with a lower Conscientiousness and Neuroticism and higher Agreeableness tend to be happy more frequently. In addition, more Activation can be predicted by lower Openness to experience and higher Agreeableness and Conscientiousness. Lastly, we find that tracking people’s geographical coordinates might play an important role in predicting Happiness and Activation. The methodology we propose is a first step towards building an automated mood tracking system, to be used for better teamwork and in combination with social network analysis studies.     

Products Ranking Through Aspect-Based Sentiment Analysis of Online Heterogeneous Reviews

With the rapid growth of online shopping platforms, more and more customers intend to share their shopping experience and product reviews on the Internet. Both large quantity and various forms of online reviews bring difficulties for potential consumers to summary all the heterogenous reviews for reference. This paper proposes a new ranking method through online reviews based on different aspects of the alternative products, which combines both objective and subjective sentiment values. Firstly, weights of these aspects are determined with LDA topic model to calculate the objective sentiment value of the product. During this process, the realistic meaning of each aspect is also summarized. Then, consumers’ personalized preferences are taken into consideration while calculating total scores of alternative products. Meanwhile, comparative superiority between every two products also contributes to their final scores. Therefore, a directed graph model is constructed and the final score of each product is computed by improved PageRank algorithm. Finally, a case study is given to illustrate the feasibility and effectiveness of the proposed method. The result demonstrates that while considering only objective sentiment values of the product, the ranking result obtained by our proposed method has a strong correlation with the actual sales orders. On the other hand, if consumers express subjective preferences towards a certain aspect, the final ranking is also consistent with the actual performance of alternative products. It provides a new research idea for online customer review mining and personalized recommendation.     

Clustering patents using non-exhaustive overlaps

Patent documents are unique external sources of information that reveal the core technology underlying new inventions.Patents also serve as a strategic data source that can be mined to discover state-of-the-art technical development and subsequently help guide R&D investments.This research incorporates an ontology schema to extract and represent patent concepts.A clustering algorithm with non-exhaustive overlaps is proposed to overcome deficiencies with exhaustive clustering methods used in patent mining and technology discovery.The non-exhaustive clustering approach allows for the clustering of patent documents with overlapping technical findings and claims,a feature that enables the grouping of patents that define related key innovations.Legal advisors can use this approach to study potential cases of patent infringement or devise strategies to avoid litigation.The case study demonstrates the use of non-exhaustive overlaps algorithm by clustering US and Japan radio frequency identification (RFID) patents and by analyzing the legal implications of automated discovery of patent infringement.     

On functional decomposition of multivariate polynomials with differentiation and homogenization

This paper gives a theoretical analysis for the algorithms to compute functional decomposition for multivariate polynomials based on differentiation and homogenization which were proposed by Ye,Dai,and Lam(1999) and were developed by Faugere,Perret(2006,2008,2009).The authors show that a degree proper functional decomposition for a set of randomly decomposable quartic homogenous polynomials can be computed using the algorithm with high probability.This solves a conjecture proposed by Ye,Dai,and Lam(1999).The authors also propose a conjecture which asserts that the decomposition for a set of polynomials can be computed from that of its homogenization and show that the conjecture is valid with high probability for quartic polynomials.Finally,the authors prove that the right decomposition factors for a set of polynomials can be computed from its right decomposition factor space.