Advanced Materials Research Vols. 433-440

Abstract: Currently, the required bandwidth of users tends to be diversity, i.e., coarse-granularity demands (e.g., terabit/circuit routing) and small-granularity demands (e.g., sub-rate traffic streams). Only employing traffic grooming or waveband switching may result in several traffic-diversity problems. Therefore, the traffic partition grooming technique with considering traffic transferring is proposed in this paper to solve the traffic-diversity problems, especially for achieving blocking probability reduction and port savings. Correspondingly, we devise the heuristic and Identified MG-IGAG (IMG-IGAG) algorithm based on Granularity-Layered Graph (GLG) since the problem of grooming is the NP-hard. The simulation results show that our IMG-IGAG is more effective and practical than other state-of-the-art methods.

Abstract: Evaluation of vehicle combination property involves multiple attributes of both a quantitative and qualitative nature with uncertainty, and there is incomplete information in the assessment process .Evidential reasoning(ER) method is introduced to transform quantitative and qualitative information to uniform distribution .With the ER ,the general values of assessment can be obtained through aggregating the lower attributes, then decision is made using utility theory. The example demonstrates the effectiveness of the ER method.

Abstract: Some previously proposed ways of improving the network load balance are reducing the link overload or reducing the node overload. Traffic load of a node or traffic load of a link can be characterized by betweenness of the node or betweenness of the edge respectively. Congestion mainly happens on nodes with maximum betweenness, so one way to improve the network load balance is mainly to minimize the maximum betweenness of node in the network. We present four edge addition strategies to minimize the maximum node betweenness by adding an edge. We do experiments on three benchmark networks to verify the effectiveness of the four edge addition strategies. By analyzing the experimental results, we confirm that adding an edge at the suitable location in the network can significantly minimize the maximum betweenness of node and improve the network load balance. It is very useful to mitigate the heavy burden of the most congested router only by adding one link with small cost without changing the network topology massively. Also, our work is helpful for service providers to optimize their network performance by adding an edge or to make good network planning by optimizing the existing network topology incrementally.

Abstract: Aiming at main challenges of Web mining and personalized service currently, basic K-Means algorithm of clustering techniques was researched, including algorithm flow and limitations. To solve shortcomings of pre-determining cluster number, heavily dependent on initial center selection and particularly sensitive to noise as well as edge data in basic K-Means algorithm, improved density-based adaptive K-Means algorithm was presented. It conducts steps of initial classification and K means iterative to reduce impact of above problems and improve clustering quality. Experiments on Web log clustering also verified its effectiveness.

Abstract: Along with deep-going researches and practical applications of Wireless Sensor Network, security issues contained therein are raising a growing concern. Based on a systematic analysis of the current intrusion detection system and with integration between the mechanism of artificial immune system and multi-agent technology, the paper provides with a new model of an intrusion detection system based on artificial immune system and multi-agent technology, and further introduces the functions of agents in the model as well as the process of antibody selection.

Abstract: A new method to correct a distorted image is proposed, which is based on the relationship between image magnification and distortion coefficient. Firstly, the image magnification is solved. Then, the image distorted coefficient can be obtained by simple linear operation. Ultimately, experiments are carried out, where the correction results obtained by the collinear points-based method are compared with the method proposed in this paper. The results show both provide good correction effects, but, the accuracy of the new proposed method is higher and the proposed method takes the advantages of simple algorithm, few known conditions and fast computing speed. The new method has great significance in engineering metrology and complex condition.

Abstract: In order to analyze and evaluate real-time performance of CAN bus with priority promotion algorithm (PPA), the OPNET model of CAN bus with PPA has been set up in this paper. Based on simulation experiments, the performances of average delay of PPA and Fixed Priority Scheduling (FPS) and Earliest Deadline First (EDF) algorithm are analyzed and the experiments also indicate that in a slight overload condition FPS algorithm makes the transmission delay of low priority data frame increased significantly, and even occurs the phenomenon that low priority data frame can not be sent at any times; EDF algorithm keeps the average delay of all the node at 2ms or so, the objective of scheduling information is achieved, but the average delay of hard real-time node is increased; compared to EDF algorithm, PPA increases the average delay of non real-time node appropriately through using different promotion weights, and reduces the average delay of hard real-time node. The results show that the PPA has the better scheduling and availability in real-time control system.

Abstract: The strict requirements on both performance and flexibility lead us to apply Dynamic Partial Reconfiguration (DPR) technology in embedded systems. However, existing DPR design flows are still immature, since previous works mainly focus on hardware designs while ignore software designs for DPR. To remedy this weakness, this paper proposes a hardware/software (HW/SW) co-design flow for DPR. The co-design flow aims at accelerating the process of DPR designs, and it merges software and hardware design flows to make them operate in parallel. Besides, in order to validate the effectiveness of our co-design flow, we implement a partial self-reconfigurable prototype system on Xilinx Virtex-5 platform and perform a set of experiments. Experimental results present that the reconfiguration overhead for partial reconfiguration is only 4.66% against global reconfiguration in our prototype. It’s also presented that our prototype can achieve a 23.6 × speedup over software algorithm solutions.

Abstract: Cluster structure is irrational and communication between cluster-head and sink node is single-hop in LEACH (Low-Energy Adaptive Clustering Hierarchy) for wireless sensor network. An improved algorithm based on wireless communication model and ant colony algorithm is proposed to solve these problems. In this paper a formula of clustering cost is proposed on the basis of wireless communication. At the same time, the ant colony algorithm and LEACH are combined to build pheromone in the entire network according to the distance between the neighboring cluster heads and their remaining energy in order to form multi-hop routing between them. Finally, the results of simulation show that the improved algorithm can balance energy consumption of nodes and prolong the lifetime of the whole network.

Abstract: The atomicity characteristic of traditional transaction processing makes entire transaction process to naught in case of specific event or error. To address problem of traditional transaction processing and combining with characteristics of Web service transaction processing, a Web service transaction coordination framework based on compensation was presented. The coordination algorithm and state transformation of long transaction were also provided. The framework mainly provides fault recovery of Web service to ensure atomicity of transaction and consistency of compensation. It permit participant submitting sub-transactions independently to deal with transaction fault with compensation, which can meet requirements of business transactions cross-enterprises.