Searcharxiv⌕ Search

arXiv subjects

Yong Deng

Publications and source records attributed to Yong Deng.

103 records · Page 6Linked to original sources
arXiv2014

A Physarum-Inspired Approach to Optimal Supply Chain Network Design at Minimum Total Cost with Demand Satisfaction

A supply chain is a system which moves products from a supplier to customers. The supply chains are ubiquitous. They play a key role in all economic activities. Inspired by biological principles of nutrients' distribution in protoplasmic networks of slime mould Physarum polycephalum we propose a novel algorithm for a supply chain design. The algorithm handles the supply networks where capacity investments and product flows are variables. The networks are constrained by a need to satisfy product demands. Two features of the slime mould are adopted in our algorithm. The first is the continuity of a flux during the iterative process, which is used in real-time update of the costs associated with the supply links. The second feature is adaptivity. The supply chain can converge to an equilibrium state when costs are changed. Practicality and flexibility of our algorithm is illustrated on numerical examples.

cs.NE↗
arXiv2014

Defuzzify firstly or finally: Dose it matter in fuzzy DEMATEL under uncertain environment?

Decision-Making Trial and Evaluation Laboratory (DEMATEL) method is widely used in many real applications. With the desirable property of efficient handling with the uncertain information in decision making, the fuzzy DEMATEL is heavily studied. Recently, Dytczak and Ginda suggested to defuzzify the fuzzy numbers firstly and then use the classical DEMATEL to obtain the final result. In this short paper, we show that it is not reasonable in some situations. The results of defuzzification at the first step are not coincide with the results of defuzzification at the final step.It seems that the alternative is to defuzzification in the final step in fuzzy DEMATEL.

cs.AI↗
arXiv2014

Generalized prisoner's dilemma

Prisoner's dilemma has been heavily studied. In classical model, each player chooses to either "Cooperate" or "Defect". In this paper, we generalize the prisoner's dilemma with a new alternative which is neither defect or cooperation. The classical model is the special case under the condition that the third state is not taken into consideration.

cs.GT↗
arXiv2014

Multi-fractal analysis of weighted networks

In many real complex networks, the fractal and self-similarity properties have been found. The fractal dimension is a useful method to describe fractal property of complex networks. Fractal analysis is inadequate if only taking one fractal dimension to study complex networks. In this case, multifractal analysis of complex networks are concerned. However, multifractal dimension of weighted networks are less involved. In this paper, multifractal dimension of weighted networks is proposed based on box-covering algorithm for fractal dimension of weighted networks (BCANw). The proposed method is applied to calculate the fractal dimensions of some real networks. Our numerical results indicate that the proposed method is efficient for analysis fractal property of weighted networks.

physics.soc-ph↗
arXiv2014

Parameter estimation based on interval-valued belief structures

Parameter estimation based on uncertain data represented as belief structures is one of the latest problems in the Dempster-Shafer theory. In this paper, a novel method is proposed for the parameter estimation in the case where belief structures are uncertain and represented as interval-valued belief structures. Within our proposed method, the maximization of likelihood criterion and minimization of estimated parameter's uncertainty are taken into consideration simultaneously. As an illustration, the proposed method is employed to estimate parameters for deterministic and uncertain belief structures, which demonstrates its effectiveness and versatility.

cs.AI↗
arXiv2014

A biologically inspired model for transshipment problem

Transshipment problem is one of the basic operational research problems. In this paper, our first work is to develop a biologically inspired mathematical model for a dynamical system, which is first used to solve minimum cost flow problem. It has lower computational complexity than Physarum Solver. Second, we apply the proposed model to solve the traditional transshipment problem. Compared with the conditional methods, experiment results show the provided model is simple, effective as well as handling problem in a continuous manner.

eess.SY↗
arXiv2013

A brief network analysis of Artificial Intelligence publication

In this paper, we present an illustration to the history of Artificial Intelligence(AI) with a statistical analysis of publish since 1940. We collected and mined through the IEEE publish data base to analysis the geological and chronological variance of the activeness of research in AI. The connections between different institutes are showed. The result shows that the leading community of AI research are mainly in the USA, China, the Europe and Japan. The key institutes, authors and the research hotspots are revealed. It is found that the research institutes in the fields like Data Mining, Computer Vision, Pattern Recognition and some other fields of Machine Learning are quite consistent, implying a strong interaction between the community of each field. It is also showed that the research of Electronic Engineering and Industrial or Commercial applications are very active in California. Japan is also publishing a lot of papers in robotics. Due to the limitation of data source, the result might be overly influenced by the number of published articles, which is to our best improved by applying network keynode analysis on the research community instead of merely count the number of publish.

cs.AI↗
arXiv2013

A Visibility Graph Averaging Aggregation Operator

The problem of aggregation is considerable importance in many disciplines. In this paper, a new type of operator called visibility graph averaging (VGA) aggregation operator is proposed. This proposed operator is based on the visibility graph which can convert a time series into a graph. The weights are obtained according to the importance of the data in the visibility graph. Finally, the VGA operator is used in the analysis of the TAIEX database to illustrate that it is practical and compared with the classic aggregation operators, it shows its advantage that it not only implements the aggregation of the data purely, but also conserves the time information, and meanwhile, the determination of the weights is more reasonable.

cs.AI↗
arXiv2013

A generalized evidence distance

Dempster-Shafer theory of evidence (D-S theory) is widely used in uncertain information process. The basic probability assignment(BPA) is a key element in D-S theory. How to measure the distance between two BPAs is an open issue. In this paper, a new method to measure the distance of two BPAs is proposed. The proposed method is a generalized of existing evidence distance. Numerical examples are illustrated that the proposed method can overcome the shortcomings of existing methods.

cs.AI↗
arXiv2013

A new information dimension of complex networks

The fractal and self-similarity properties are revealed in many real complex networks. However, the classical information dimension of complex networks is not practical for real complex networks. In this paper, a new information dimension to characterize the dimension of complex networks is proposed. The difference of information for each box in the box-covering algorithm of complex networks is considered by this measure. The proposed method is applied to calculate the fractal dimensions of some real networks. Our results show that the proposed method is efficient for fractal dimension of complex networks.

cs.SI↗
arXiv2013

An Adaptive Amoeba Algorithm for Shortest Path Tree Computation in Dynamic Graphs

This paper presents an adaptive amoeba algorithm to address the shortest path tree (SPT) problem in dynamic graphs. In dynamic graphs, the edge weight updates consists of three categories: edge weight increases, edge weight decreases, the mixture of them. Existing work on this problem solve this issue through analyzing the nodes influenced by the edge weight updates and recompute these affected vertices. However, when the network becomes big, the process will become complex. The proposed method can overcome the disadvantages of the existing approaches. The most important feature of this algorithm is its adaptivity. When the edge weight changes, the proposed algorithm can recognize the affected vertices and reconstruct them spontaneously. To evaluate the proposed adaptive amoeba algorithm, we compare it with the Label Setting algorithm and Bellman-Ford algorithm. The comparison results demonstrate the effectiveness of the proposed method.

cs.NE↗
arXiv2013

Ranking basic belief assignments in decision making under uncertain environment

Dempster-Shafer theory (D-S theory) is widely used in decision making under the uncertain environment. Ranking basic belief assignments (BBAs) now is an open issue. Existing evidence distance measures cannot rank the BBAs in the situations when the propositions have their own ranking order or their inherent measure of closeness. To address this issue, a new ranking evidence distance (RED) measure is proposed. Compared with the existing evidence distance measures including the Jousselme's distance and the distance between betting commitments, the proposed RED measure is much more general due to the fact that the order of the propositions in the systems is taken into consideration. If there is no order or no inherent measure of closeness in the propositions, our proposed RED measure is reduced to the existing evidence distance. Numerical examples show that the proposed RED measure is an efficient alternative to rank BBAs in decision making under uncertain environment.

cs.AI↗