Minimum Amount of Slop Cut in Batch Distillation

The pulse-control operation technique which alternates between total reflux operation and total efflux operation in batch distillation was studied along with the minimum amount of slop cut. Total reflux time was confirmed by dynamic simulation, and total efflux time was adopted by statistic method. For the mixture of hexane and cyclohexane and the traditional constant reflux ratio operation strategy, the amount of slop cut is 1.8-2.1 times of the minimum amount of slop cut; whereas for the pulse-control operation strategy, it is 1. 2 -1.4 times of the minimum amount of slop cut. So compared with the traditional constant reflux ratio operation, the pulse-control operation can decrease the amount of slop cut and operation time, and meanwhile, enhance separation efficiency and yield.

A New Approach to Multi-user Detection in DS-CDMA

A graph model is constructed for the Multi-user Detection of DS-CDMA system. Based on it, a Hopfield-like algorithm is put forward for the implementation of optimum receiver. Compared with the Hopfield approach, it has a higher computational complexity but better performance.

Mining Protein Complexes from PPI Networks Using the Minimum Vertex Cut

Evidence shows that biological systems are composed of separable functional modules. Identifying protein complexes is essential for understanding the principles of cellular functions. Many methods have been proposed to mine protein complexes from protein-protein interaction networks. However, the performances of these algorithms are not good enough since the protein-protein interactions detected from experiments are not complete and have noise. This paper presents an analysis of the topological properties of protein complexes to show that although proteins from the same complex are more highly connected than proteins from different complexes, many protein complexes are not very dense （density ≥0.8）. A method is then given to mine protein complexes that are relatively dense （density ≥0.4）. In the first step, a topology property is used to identify proteins that are probably in a same complex. Then, a possible boundary is calculated based on a minimum vertex cut for the protein complex. The final complex is formed by the proteins within the boundary. The method is validated on a yeast protein-protein interaction network. The results show that this method has better performance in terms of sensitivity and specificity compared with other methods. The functional consistency is also good.

Analysis of traffic safety in airport aircraft activity areas based on bayesian networks and fault trees

To assess road traffic safety risk in civil aviation airports and develop effective accident prevention measures,this study proposed a risk assessment method based on accident tree and Bayesian network for airport aircraft activity areas.It identified influencing factors in the aircraft activity area from the perspectives of person-vehicle-road-environment-management and analyzed their relationships.The Bayesian network was utilized to determine initial probabilities for each influencing factor.Findings indicated a relatively high overall safety level in the airport's road traffic system.Accident trees were employed to qualitatively and quantitatively analyze common human-vehicle accident patterns.The initial probabilities obtained from the Bayesian network served as basic event probabilities in the accident tree to determine the occurrence probability of the top event.Taking a 4F airport in China as an example,accident cause analysis identified five important risk sources in human-vehicle accidents,including blind spots for special vehicles,illegal driving by drivers,pedestrians violating regulations,passengers entering restricted areas,and blind spots at intersections.Corresponding safety management measures were formulated.The study concluded that the integration of Bayesian networks and accident trees effectively determines accident probabilities and offers specific solutions,thus playing a crucial role in enhancing road traffic safety management within aviation airports.

A Study on the Degree of Barrier Coverage in Wireless Sensor Networks

Recently, the barrier coverage was proposed and received much attention in wireless sensor network (WSN), and the degree of the barrier coverage, one of the critical parameters of WSN, must be re-studied due to the difference between the barrier coverage and blanket coverage. In this paper, we propose two algorithms, namely, local tree based no-way and back (LTNWB) algorithm and sensor minimum cut sets (SMCS) algorithm, for the opened and closed belt regions to determine the degree of the barrier coverage of WSN. Our main objective is to minimize the complexity of these algorithms. For the opened belt region, both algorithms work well, and for the closed belt region, they will still come into existence while some restricted conditions are taken into consideration. Finally, the simulation results demonstrate the feasibility of the proposed algorithms.

Inverse Maximum Flow Problem Under the Combination of the Weighted l_(2)Norm and the Weighted Hamming Distance

The idea of the inverse optimization problem is to adjust the values of the parameters so that the observed feasible solutions are indeed optimal.The modification cost is measured by different norms,such asl1,l2,l∞norms and the Hamming distance,and the goal is to adjust the parameters as little as possible.In this paper,we consider the inverse maximum flow problem under the combination of the weighted l2 norm and the weighted Hamming distance,i.e.,the modification cost is fixed in a given interval and depends on the modification out of the given interval.We present a combinatorial algorithm which can be finished in O(nm)to solve it due to the minimum cut of the residual network.