As complexity and demand for new products grow, companies are realizing that their supply chains need to be more flexible. Currently, in supply chain system, users' reliance has driven a universal user expectation...
详细信息
As complexity and demand for new products grow, companies are realizing that their supply chains need to be more flexible. Currently, in supply chain system, users' reliance has driven a universal user expectation that all the information be readily availability whenever and wherever they want. Evaluating and thinking about managing such availability are therefore becoming one of the important factors to improve the performance of the supply chain system. So, how to effectively analyze and evaluate service availability of supply chain system is a challenging problem for investigators. In this paper, the architecture of web-based services of flexible supply chain system is interpreted elaborately, and then an imperfect coverage service model for this system is designed and analyzed exhaustively. The result achieved from this model can help designers find the right tradeoffs for achieving availability of users required while providing acceptable levels of performance.
The flowshop scheduling problem has been widely studied in the literature and many techniques have been applied to it, but few algorithms have been proposed to solve it using particle swarm optimization algorithm (PSO...
The flowshop scheduling problem has been widely studied in the literature and many techniques have been applied to it, but few algorithms have been proposed to solve it using particle swarm optimization algorithm (PSO) based algorithm. In this paper, an improved PSO algorithm (IPSO) based on the ldquoall differentrdquo constraint is proposed to solve the flowshop scheduling problem with the objective of minimizing makespan. It combines the particle swarm optimization algorithm with genetic operators together effectively. When a particle is going to stagnates, the mutation operator is used to search its neighborhood. The proposed algorithm is tested on different scale benchmarks and compared with the recently proposed efficient algorithms. The results show that both the solution quality and the convergent speed of the IPSO algorithm precede the other two recently proposed algorithms. It can be used to solve large scale flowshop scheduling problem effectively.
A framework of hiberarchy trusted network basedon the grade division was put forward,and thepartition rules of trusted attributes as well as themethods of grade division were explained in ***,the potential application...
详细信息
A framework of hiberarchy trusted network basedon the grade division was put forward,and thepartition rules of trusted attributes as well as themethods of grade division were explained in ***,the potential applications of this frameworkin trusted network were discussed,and the accessprocedure of terminals in hiberarchy trusted networkwas given based on the existing research *** show that by the proposed framework,notonly the safety and reliability of network can beensured,but also the flexibility of ways to accessnetwork is strengthened,and that the framework canprovide supports for interoperability of differentequipment suppliers.
This paper demonstrates the necessity of the use of PSC-CEA for dynamic policy triggering in the process of mobile IP switching; in the mean time, according to the characteristics of policy based network management, p...
详细信息
This paper demonstrates the necessity of the use of PSC-CEA for dynamic policy triggering in the process of mobile IP switching; in the mean time, according to the characteristics of policy based network management, propose a dynamic policy trigger model, and designs a mechanism which is used to update dynamic policy according to known information, experience and knowledge to satisfy the QoS of mobile services and use current network resource sufficiently.
Internet is a complex network with the characteristic of self-organized criticality. The cascading dynamics of Internet are presented and two reasons are pointed out, which may cause cascading failures. Different from...
详细信息
Internet is a complex network with the characteristic of self-organized criticality. The cascading dynamics of Internet are presented and two reasons are pointed out, which may cause cascading failures. Different from betweenness centrality, a congestion function to represent the extent of congestion is proposed. By introducing the concept of "delay time", the correlation between permanent removing and non-removing is built. And a new evaluation function of network efficiency based on congestion function is given in order to measure the damage of cascading failures. Moreover some effects of network structure and size, delay time on congestion propagation are also investigated, and cascading process composed of three phases and some factors affecting cascade propagation are uncovered.
CAD drawings reuse is of great importance in promoting design efficiency and productivity. The ability to retrieve CAD drawings is the core of drawings reuse task. Most of the existing drawings retrieval systems rely ...
详细信息
CAD drawings reuse is of great importance in promoting design efficiency and productivity. The ability to retrieve CAD drawings is the core of drawings reuse task. Most of the existing drawings retrieval systems rely only on text descriptions. Due to complexity of visual feature, a little system is based on content. A simplified topological relationship is proposed to describe visual features for dimension reduction. An effective topological relationship vector is constructed by graph spectra. A novel retrieval system based on visual contents, including topological relationships, shape, and directional relationships, is proposed. The experiments show that the proposed approach and system are superior to the text-based and traditional content-based retrieval systems.
To get large disk-like characteristics and offset the significant power demands of hard disk drives, we propose a fully functional hybrid archive system (called Pseudodisk) composed of an array of disks and a tape lib...
详细信息
To get large disk-like characteristics and offset the significant power demands of hard disk drives, we propose a fully functional hybrid archive system (called Pseudodisk) composed of an array of disks and a tape library. To get an energy conservation, low cost archive system, Pseudodisk uses data value model and utility function to guild data management. Two novel algorithms are proposed for data placement and data migration, which are referred to as utility-based data placement (UDP) and and system utility percentage (SUP) algorithms respectively. To validate the efficiency of the proposed archive system, we conduct the performance evaluation and the power-saving simulation.
The domain of Digital Libraries presents specific challenges for unsupervised information extraction to support both the automatic classification of documents and the enhancement of userspsila navigation in the digita...
详细信息
The domain of Digital Libraries presents specific challenges for unsupervised information extraction to support both the automatic classification of documents and the enhancement of userspsila navigation in the digital content. In this paper, we propose a combined use of machine learning techniques (i.e. Support Vector Machines) and Natural Language Processing techniques (i.e. Stanford NLP parser) to tackle the problem of unsupervised key-phrases extraction from scientific papers. The proposed method strongly depends on the robust structural properties of a scientific paper as well as on the lexical knowledge that we are able to mine from its text. For the experimental assessment we have use a subset of ACM papers in the Computer Science domain containing 400 documents. Preliminary evaluation of the approach shows promising result that improves - on the same data-set - on state-of-the-art Bayesian learning system KEA from a minimum 27% to a maximum 77% depending on KEA parameters tuning and specific evaluation set. Our assessment is performed by comparison with key-phrases assigned by human experts in the specific domain and freely available through ACM portal.
Geometric constraint problem can be transformed to an optimization problem which the objective function and constraints are non-convex functions. In this paper an evolutionary algorithm based on ant colony optimizatio...
详细信息
Geometric constraint problem can be transformed to an optimization problem which the objective function and constraints are non-convex functions. In this paper an evolutionary algorithm based on ant colony optimization algorithm and the immune system model is proposed to provide solution to the geometric constraints problem. In the new algorithm, affinity calculation process and pheromone trail lying is embedded to maintain diversity and carry out the global search and the local search in many directions rather than one direction around the same individual simultaneously. This new algorithm different with current optimization methods in that it gets the good solution by excluding bad solutions. The experimental results reported here will shed more light into how affects the hybrid algorithm's search power in solving geometric constraint problem.
暂无评论