Dynamic Multi-Attribute Decision-Making Method with Double Reference Points and Its Application

To better reflect the psychological behavior characteristics of loss aversion,this paper builds a double reference point decision making method for dynamic multi-attribute decision-making(DMADM)problem,taking bottom-line and target as reference pints.First,the gain/loss function is given,and the state is divided according to the relationship between the gain/loss value and the reference point.Second,the attitude function is constructed based on the results of state division to establish the utility function.Third,the comprehensive utility value is calculated as the basis for alternatives classification and ranking.Finally,the new method is used to evaluate the development level of smart cities.The results show that the new method can judge the degree to which the alternatives meet the requirements of the decision-maker.While the new method can effectively screen out the unsatisfactory alternatives,the ranking results of other alternatives are consistent with those of traditional methods.

Regulation of neural stem cell fate decisions by mitochondrial dynamics

Stem cells possess the ability to divide symmetrically or asymmet- rically to allow for maintenance of the stem cell pool or become committed progenitors and differentiate into various cell lineages. The unique self-renewal capabilities and pluripotency of stem cells are integral to tissue regeneration and repair （Oh et al., 2014）. Mul- tiple mechanisms including intracellular programs and extrinsic cues are reported to regulate neural stem cell （NSC） fate （Bond et al., 2015）. A recent study, published in Cell Stern Cell, identified a novel mechanism whereby mitochondrial dynamics drive NSC fate （Khacho et al., 2016）.

Dynamic data-sharing based user recruitment in mobile crowdsensing

Mobile crowdsensing(MCS) has become an emerging paradigm to solve urban sensing problems by leveraging the ubiquitous sensing capabilities of the crowd. One critical issue in MCS is how to recruit users to fulfill more sensing tasks with budget restriction, while sharing data among tasks can be a credible way to improve the efficiency. The data-sharing based user recruitment problem under budget constraint in a realistic scenario is studied, where multiple tasks require homogeneous data but have various spatio-temporal execution ranges, meanwhile users suffer from uncertain future positions. The problem is formulated in a manner of probability by predicting user mobility, then a dynamic user recruitment algorithm is proposed to solve it. In the algorithm a greedy-adding-and-substitution(GAS) heuristic is repeatedly implemented by updating user mobility prediction in each time slot to gradually achieve the final solution. Extensive simulations are conducted using a real-world taxi trace dataset, and the results demonstrate that the approach can fulfill more tasks than existing methods.

A Nonparametric Approach to Foreground Detection in Dynamic Backgrounds

Foreground detection is a fundamental step in visual surveillance.However,accurate foreground detection is still a challenging task especially in dynamic backgrounds.In this paper,we present a nonparametric approach to foreground detection in dynamic backgrounds.It uses a history of recently pixel values to estimate background model.Besides,the adaptive threshold and spatial coherence are introduced to enhance robustness against false detections.Experimental results indicate that our approach achieves better performance in dynamic backgrounds compared with several approaches.

A Novel Incremental Attribute Reduction Algorithm Based on Intuitionistic Fuzzy Partition Distance

Attribute reduction,also known as feature selection,for decision information systems is one of the most pivotal issues in machine learning and data mining.Approaches based on the rough set theory and some extensions were proved to be efficient for dealing with the problemof attribute reduction.Unfortunately,the intuitionistic fuzzy sets based methods have not received much interest,while these methods are well-known as a very powerful approach to noisy decision tables,i.e.,data tables with the low initial classification accuracy.Therefore,this paper provides a novel incremental attribute reductionmethod to dealmore effectivelywith noisy decision tables,especially for highdimensional ones.In particular,we define a new reduct and then design an original attribute reduction method based on the distance measure between two intuitionistic fuzzy partitions.It should be noted that the intuitionistic fuzzypartitiondistance iswell-knownas aneffectivemeasure todetermine important attributes.More interestingly,an incremental formula is also developed to quickly compute the intuitionistic fuzzy partition distance in case when the decision table increases in the number of objects.This formula is then applied to construct an incremental attribute reduction algorithm for handling such dynamic tables.Besides,some experiments are conducted on real datasets to show that our method is far superior to the fuzzy rough set based methods in terms of the size of reduct and the classification accuracy.

Dynamic-decision-based Real-time Dispatch for Reducing Constraint Violations

This paper proposes a dynamic-decision-based realtime dispatch method to coordinate the economic objective with multiple types of security dispatch objectives while reducing constraint violations in the process of adjusting the system operation point to the optimum.In each decision moment,the following tasks are executed in turn:①locally linearizing the system model at the current operation point with the online model identification by using measurements;②narrowing down the gaps between unsatisfied security requirements and their security thresholds in order of priority;③minimizing the generation cost;④minimizing the security indicators within their security thresholds.Compared with the existing real-time dispatch strategies,the proposed method can adjust the deviations caused by unpredictable power flow fluctuations,avoid dispatch bias caused by model parameter errors,and reduce the constraint violations in the dispatch decision process.The effectiveness of the proposed method is verified with the IEEE 39-bus system.

A Dynamic Emergency Decision-Making Method Based on Group Decision Making with Uncertainty Information

In emergency decision making(EDM),it is necessary to generate an effective alternative quickly.Case-based reasoning(CBR)has been applied to EDM;however,choosing the most suitable case from a set of similar cases after case retrieval remains challenging.This study proposes a dynamic method based on case retrieval and group decision making(GDM),called dynamic casebased reasoning group decision making(CBRGDM),for emergency alternative generation.In the proposed method,first,similar historical cases are identified through case similarity measurement.Then,evaluation information provided by group decision makers for similar cases is aggregated based on regret theory,and comprehensive perceived utilities for the similar cases are obtained.Finally,the most suitable historical case is obtained from the case similarities and the comprehensive perceived utilities for similar historical cases.The method is then applied to an example of a gas explosion in a coal company in China.The results show that the proposed method is feasible and effective in EDM.The advantages of the proposed method are verified based on comparisons with existing methods.In particular,dynamic CBRGDM can adjust the emergency alternative according to changing emergencies.The results of application of dynamic CBRGDM to a gas explosion and comparison with existing methods verify its feasibility and practicability.

Dynamic Conflict Analysis Decision ModellingTheory and Its Application

This paper gives a few of classes of fundamental concepts that describe dynamic conflictdecision analysis and selection and applies dynamic conflict decision analysis in stock investment andbusiness.

Dynamic multiple criteria group decision-making method based on intuitionistic fuzzy information

In the decision-making process,the decision information provided by decision makers over alter-natives may take the form of intuitionistic fuzzy numbers and come from different periods.The weight of information on decision makers,criteria,periods is usually completely unknown.To this issue,we first utilise hesitation degree information and introduce the concept of confi-dence degree function to determine the decision maker’s weights.Then we aggregate individual evaluation information into group evaluation information through intuitionistic fuzzy number weighted arithmetic averaging operator.We construct a nonlinear optimisation model to gain the criterion weights and apply the aggregate operator to gain the integrated rating value of alternatives in different periods,calculating the deviations of the integrated rating values with respect to their average.Then the period weights are been obtained by using the entropy method.According to the closeness coefficient between alternatives and ideal solution to sort the alternatives and select the optimal one.

OPTIMAL PRICING AND INVENTORY POLICY WITH ORDER CANCELATIONS UNDER THE CASH-ON-DELIVERY PAYMENT SCHEME

Considering a periodic review system where the online seller allows the customers to pay when the products are delivered to them(referred as cash-on-delivery payment scheme in this paper),the authors investigate the seller's joint pricing and inventory control policy with a finite planning horizon.In particular,the authors incorporate the customers' possible order cancellation behavior with the cash-on-delivery scheme.It can be proven that the base-stock list price policy is optimal under mild conditions.The authors also analyze the impact of the customers' forward looking behavior on the optimal policy.