A review of the catalytic preparation of mesophase pitch

Because of its high purity and excellent orientation, mesophase pitch is a superior precursor for high-performance car-bon materials. However, the preparation of top-notch mesophase pitch faces challenges. Catalytic polycondensation at low temperat-ures is more favorable for synthesizing mesophase pitch, because it circumvents the high-temperature free radical reaction of other thermal polycondensation approaches. The reaction is gentle and can be easily controlled. It has the potential to significantly im-prove the yield of mesophase pitch and easily introduce naphthenic characteristics into the molecules, catalytic polycondensation is therefore a preferred method of synthesizing highly spinnable mesophase pitch. This review provides a synopsis of the selective pre-treatment of the raw materials to prepare different mesophase pitches, and explains the reaction mechanism and associated research advances for different catalytic systems in recent years. Finally, how to manufacture high-quality mesophase pitch by using a cata-lyst-promoter system is summarized and proposed, which may provide a theoretical basis for the future design of high-quality pitch molecules.

A distributed on-demand bandwidth-constrained multicast routing protocol for wireless ad hoc networks

To meet the bandwidth requirement for the multicasting data flow in ad hoc networks, a distributed on- demand bandwidth-constrained multicast routing （BCMR） protocol for wireless ad hoc networks is proposed. With this protocol, the resource reservation table of each node will record the bandwidth requirements of data flows, which access itself, its neighbor nodes and hidden nodes, and every node calculates the remaining available bandwidth by deducting the bandwidth reserved in the resource reservation table from the total available bandwidth of the node. Moreover, the BCMR searches in a distributed manner for the paths with the shortest delay conditioned by the bandwidth constraint. Simulation results demonstrate the good performance of BCMR in terms of packet delivery reliability and the delay. BCMR can meet the requirements of real time communication and can be used in the multicast applications with low mobility in wireless ad hoc networks.

液压软管设计要点与安装注意事项

液压系统中液压软管的设计使用方法,以及设计中软管布路需要了解的一些注意事项。避免由于设计原因降低软管的使用寿命。

An Integratable Distributed Bragg Reflector Laser by Low-Energy Ion Implantation Induced Quantum Well Intermixing

An integratable distributed Bragg reflector laser is fabricated by low energy ion implantation induced quantum well intermixing.A 4 6nm quasi continuous wavelength tuning range is achieved by controlling phase current and grating current simultaneously,and side mode suppression ratio maintains over 30dB throughout the tuning range except a few mode jump points.

Fame:A Fast Detailed Placement Algorithm for Standard\| Cell Layout Based on Mixed Mincut and Enumeration

Rapid progress in manufacturing greatly challenges to the VLSI physical design in both speed and performance. A fast detailed placement algorithm, FAME is presented in this paper, according to these demands. It inherits the optimal positions of cells given by a global placer and exact position to each cell by local optimization. FM Mincut heuristic and local enumeration are used to optimize the total wirelength in y and x directions respectively, and a two way mixed optimizing flow is adopted to combine the two methods for a better performance. Furthermore, a better enumeration strategy is introduced to speed up the algorithm. An extension dealing with blockages in placement has also been discussed. Experimental results show that FAME runs 4 times faster than RITUAL and achieves a 5% short in total wirelength on average.

A Fast and Efficient Global Router for Congestion Optimization

An efficient parallel global router using random optimization that is independent of net ordering is proposed.Parallel approaches are described and strategies guaranteeing the routing quality are discussed.The wire length model is implemented on multiprocessor,which enables the algorithm to approach feasibility of large scale problems.Timing driven model on multiprocessor and wire length model on distributed processors are also presented.The parallel algorithm greatly reduces the run time of routing.The experimental results show good speedups with no degradation of the routing quality.

Cross Point Assignment Algorithm Under Consideration of Very Long Nets

A cross point assignment algorithm is proposed under consideration of very long nets (LCPA).It is to consider not only the cost of connection between cross points and pins and the exclusive cost among cross points on the boundary of a global routing cell,but also the cost of displacement among cross points of the same net.The experiment results show that the quality and speed in the following detailed routing are improved obviously,especially for very long nets.

Recursive bisection placement algorithm with the predicted wirelength

To obtain a better placement result, a partitioning-based placement algorithm with wirelength prediction called HJ-Pl is presented. A new method is proposed to estimate proximity of interconnects in a netlist, which is capable of predicting not only short interconnects but long interconnects accurately. The predicted wirelength is embedded into the partitioning tool of bisection-based global placement, which can guide our placement towards a solution with shorter interconnects. In addition, the timing objective can be handled within the algorithm by minimizing the critical path delay. Experimental results show that, compared to Capol0. 5, mPL6, and NTUplace, HJ-P1 outperforms these placers in terms of wirelength and run time. The improvements in terms of average wirelength over Capo10. 5, mPL6 and NPUplace are 13%, 3%, and 9% with only 19%, 91%, and 99% of their runtime, respectively. By integrating the predicted wirelength-driven clustering into Capo10. 5, the placer is able to reduce average wirelength by 3%. The timing-driven HJ-P1 can reduce the critical path delay by 23%.

MARS:A General Multilayer Area Router

Based on a ripped-up and rerouted methodology,a multilayer area detailed router is presented by using simulated evolution technique.A modified maze algorithm is also performed for the single net.

A Signal-Flow Driven Automatic Physical Synthesis Methodology for Analog Circuits

This paper introduces a novel automatic physical synthesis methodology for analog circuits based on the signal-flow analysis.Circuit analysis sub-system adopts the newly advanced methodology,circuit topology analysis,and circuit sensitivity analysis to generate layout constraints and control performance degradations.Considering the heuristic information about signal-flow,complexity of the methodology is less than the pure performance-driven methodology.And then these constraints are implemented in device generation,placement,and routing sub-systems separately,which makes the different constraints be satisfied at most easily implemented stages.Excellent circuit performance obtained by the methodology is demonstrated by practical circuit examples.

Location of anemometer along Lanzhou-Xinjiang railway

Using structured mesh to discretize the calculation region, the wind velocity and pressure distribution in front of the wind barrier under different embankment heights are investigated based on the Detached Eddy Simulation(DES) with standard SpalartAllmaras(SA) model. The Reynolds number is 4.0×105 in this calculation. The region is three-dimensional. Since the wind barrier and trains are almost invariable cross-sections, only 25 m along the track is modeled. The height of embankment ranges from 1 m to 5 m and the wind barrier is 3 m high. The results show that the wind speed changes obviously before the wind barrier on the horizontal plane, which is 4.5 m high above the track. The speed of wind reduces gradually while approaching the wind barrier. It reaches the minimum value at a distance about 5 m before the wind barrier, and increases dramatically afterwards. The speed of wind at this location is linear with the speed of far field. The train aerodynamic coefficients decrease sharply with the increment of the embankment height. And they take up the monotonicity. Meanwhile, when the height increases from 3 m to 5 m, they just change slightly. It is concluded that the optimum anemometer location is nearly 5 m in front of the wind barrier.

Cooperative co-evolution based distributed path planning of multiple mobile robots

This paper proposes novel multiple-mobile-robot collision avoidance path planning based on cooperative co-evolution,which can be executed fully distributed and in parallel. A real valued co-evolutionary algorithm is developed to coordinate the movement of multiple robots in 2D world, avoiding C-space or grid net searching. The collision avoidance is achieved by cooperatively co-evolving segments of paths and the time interval to pass them. Methods for constraint handling, which are developed for evolutionary algorithm, make the path planning easier. The effectiveness of the algorithm is demonstrated on a number of 2Dpath planning problems.

Analyzing Parabolic Profile Path for Underwater Towed-Cable

This article discusses the dynamic state analysis of underwater towed-cable when tow-ship changes its speed in a direction making parabolic profile path. A three-dimensional model of underwater towed system is studied. The established governing equations for the system have been solved using the central implicit finite-difference method. The obtained difference non-linear coupled equations are solved by Newton＇s method and satisfactory results were achieved. The solution of this problem has practical importance in the estimation of dynamic loading and motion, and hence it is directly applicable to the enhancement of safety and the effectiveness of the offshore activities.

A Novel Distributed LDoS Attack Scheme against Internet Routing

LDoS （Low-rate Denial of Service） attack, exploiting the flaws in the congestion avoidance mechanism of TCP protocol,is periodic, stealthy, and with high efficiency. Since BGP uses TCP as a transport protocol, it is subject to LDoS attacks as well. LDoS attacks can cause table reset, route flapping of BGP protocol. A deliberately constructed distributed low-rate DOS attacks can even generate surge of updates throughout the Internet. In this paper, we investigate the promotion of attack efficiency of this novel attack, and then propose an attack model to simulate the LDoS attack. Experiments prove that this attack model can exponentially lower the attack costs and improve the attack effect.

BALANCED TRUNCATED MODELS OF C INTERCONNECT CIRCUITS AND THEIR SIMULATION

The Balanced Truncation Method (BTM) is applied to an even distributed RC interconnect case by using Wang's closed-forms of even distributed RC interconnect models. The results show that extremely high order RC interconnect can be high-accurately approximated by only third order balanced model. Related simulations are executed in both time domain and frequency domain. The results may be applied to VLSI interconnect model reduction and design.

Spatial Analysis of Commuting Mode Choice in Guangzhou, China

Metropolitan cities in China are commonly confronted with unresolved traffic congestion issues, primarily due to rapidly increasing traffic demand. Group disparity between commuting mode choice and its spatial distribution on road networks has enabled us to examine the factors that give rise to the discrepancies and the fundamental spatial causes of traffic congestion. In recent years, mi- cro-perspective, individual, and behavior-based spatial analysis have mushroomed and been facilitated with effective tools such as tem- poral geographic information systems （T-GIS）. It is difficult to study the interrelations between transport and space on the basis of commuting mode choice since the mode choice data are invisible in a specific space such as a particular road network. Therefore, in the field of transport, the classical origin destination （OD） four-stage model （FSM） is usually employed to calculate data when studying commuting mode choice. Based on the relative principles of T-GIS and the platform of ArcGIS, this paper considers Guangzhou as a case study and develops a spatio-temporal tool to examine the daily activities of residents. Meanwhile, the traffic volume distribution in rush hours, which was analyzed according to commuting modes and how they were reflected in the road network, was scrutinized with data extracted from travel diaries. Moreover, efforts were made to explain the relationship between traffic demand and urban spatial structure. Based on the investigation, this research indicates that traffic volumes in divergent groups and on the road networks is driven by： l） the socio-economie characteristics of travelers; 2） a jobs-housing imbalance under suburbanization; 3） differences in the spatial supply of transport modes; 4） the remains of the Danwei （work unit） system and market development in China; and 5） the transition of urban spatial structure and other factors.

Attack Resistant Trust Management Model Based on Beta Function for Distributed Routing in Internet of Things

With the rapid development of Internet of Things (IoT),the issue of trust in distributed routing systems has attracted more research attention.The existing trust management frameworks,however,suffer from some possible attacks in hostile environments,such as false accusation,collusion,on-off,and conflicting behavior.Therefore,more comprehensive models should be proposed to predict the trust level of nodes on potential routes more precisely,and to defeat several kinds of possible attacks.This paper makes an attempt to design an attack-resistant trust management model based on beta function for distributed routing strategy in IoT.Our model can evaluate and propagate reputation in distributed routing systems.We first describe possible attacks on existing systems.Our model is then proposed to establish reliable trust relations between self-organized nodes and defeat possible attacks in distributed routing systems.We also propose a theoretical basis and skeleton of our model.Finally,some performance evaluations and security analyses are provided to show the effectiveness and robustness of our model compared with the existing systems.

A distributed routing algorithm based-on simplified topology in LEO satellite networks

In this paper, a distributed muting strategy based on simplified topology （DRBST） was proposed for LEO satellite networks. The topology of LEO satellite networks was simplified aiming at minimizing intersatellite links handover number. To optimize the route based on the simplified topology, we considered not only the transmission delay but also the queuing delay and the processing delay, which were analyzed using Markov chain and determined using a novel methodology. The DRBST algorithm was simulated in a LEO satellite networks model built using OPNET. The simulation results demonstrate that the low complexity DRBST algorithm can guarantee end-to-end delay bound. Moreover, the muting protocol cost is much less than traditional algorithms.

Modeling a magneto-rheological soft starter for use with belt conveyors

The theory of magnetic circuit design, the constitutive equations of a magneto-theological fluid, and the load properties of belt conveyors were used to design a magneto-rheological soft starter test-bed. The magnetic field distribution in the working gap was analyzed and the current-speed relationship was investigated. A mathematical model for the time response was deduced. The results show that a linear relationship between current and magnetic field is seen when the magnetic materials are not saturated and the magnetic field is uniform in the working section. The rotation speed of the driven shaft changes linearly with increasing time. The response is rapid and can be as short as milliseconds. This meets the starting requirements of belt conveyors.

Research on the Best Routing Algorithm of Terminal Distribution Based on the Random Factor of Road Hustling Degree

Dijkstra algorithm is a basic algorithm to analyze the vehicle routing problem (VRP) in the terminal distribution of logistics center. According to the actual client demands of service speed and quality, the conceptions of economical distance of delivery and the best routing algorithm were given on the base of the Dijkstra algorithm with consideration of a coefficient of the road hustle degree. Economical distance of delivery is the shortest physical distance between two customers. It is the value of goods delivery in shortest distance when concerning factors such as the road length, the hustle degree, the driveway quantity, and the type of the road. The improved algorithm is being used in the development and application of a distribution path information system in the terminal distribution of logistics center. The simulation and practical case prove that the algorithm is effective and reasonable.