Epitaxial Growth of 150mm Silicon Epi\|Wafers for Advanced IC Applications

With the device feature's size miniaturization in very large scale integrated circuit and ultralarge scale integrated circuit towards the sub\|micron and beyond level, the next generation of IC device requires silicon wafers with more improved electrical characteristics and reliability as well as a high perfection of the wafer surface. Compared with the polished wafer with a relatively high density of crystal originated defects (e. g. COPs), silicon epi\|wafers can meet such high requirements. The current development of researches on the 150mm silicon epi\|wafers for advanced IC applications is described. The P/P\++ CMOS silicon epi\|wafers were fabricated on a PE2061 Epitaxial Reactor (made by Italian LPE Company). The material parameters of epi\|wafers, such as epi\|defects, uniformity of thickness and resistivity, transition width, and minority carrier generation lifetime for epi\|layer were characterized in detail. It is demonstrated that the 150mm silicon epi\|wafers on PE2061 can meet the stringent requirements for the advanced IC applications.

Multipath mitigation method for tracking Galileo signals

In order to improve the performance of multipath mitigation in tracking Galileo signals, a new multipath mitigation method named early-late strobe correlator （ELSC） is proposed. By applying the strobe correlator used widely in global positioning system （GPS） scenarios to Galileo E1 signals, it can be found that the strobe correlator has an undesirable level of performance when the delay of multipath signals is about 0. 5 chip. Combining several strobe correlators, the ELSC can effectively mitigate the multipath effect especially for the multipath signals with the 0. 5 chip delay. The multipath error envelopes between the strobe correlator and the ELSC are compared for Galileo E1 signals. The simulation results indicate that the ELSC performs excellently on multipath mitigation, and can be applied in both Galileo scenarios and GPS scenarios.

On-body propagation characterization based on FDTD method for 2.4/5.2/5.7 GHz wearable body sensor networks

The on-body path loss and time delay of radio propagation in 2. 4/5.2/5.7 GHz wearable body sensor networks （W-BSN） are studied using Remcom XFDTD, a simulation tool based on the finite-difference time- domain method. The simulation is performed in the environment of free space with a simplified three- dimensional human body model. Results show that the path loss at a higher radio frequency is significantly smaller. Given that the transmitter and the receiver are located on the body trunk, the path loss relevant to the proposed minimum equivalent surface distance follows a log-fitting parametric model, and the path loss exponents are 4. 7, 4. 1 and 4. 0 at frequencies of 2. 4, 5.2, 5.7 GHz, respectively. On the other hand, the first- arrival delays are less than 2 ns at all receivers, and the maximum time delay spread is about 10 ns. As suggested by the maximum time delay spread, transmission rates of W-BSN must be less than 10^8 symbol/s to avoid intersymbol interference from multiple-path delay.

Optimization method for evacuation zone with network reconfiguration based on dynamic simulation

Abstract： With a determinate danger zone and evacuation demand caused by an emergency, an optimization method for the evacuation zone with network reconfiguration based on dynamic simulation is proposed. The method contains three modules. First, the network in the evacuation zone is optimized by a model with the integrated strategy of lane reversal and intersection conflict elimination. Secondly, the dynamic evacuation simulation model based on the cell transmission model is applied to simulate the dynamic propagation process of evacuated vehicles in the network in the evacuation zone. The evacuation time for all evacuated vehicles leaving the danger zone is obtained and the setting of the current evacuation zone is fed back. Thirdly, the arrival distributions of evacuated vehicles at critical intersections of the evacuation zone are also obtained to estimate the delay at critical intersection to determine whether the intersection should be taken as the critical intersection in the next iteration. The evacuation zone is expanded gradually through iteration, and the reasonable evacuation zone and the optimal evacuation network is confirmed. Based on the survey of the parking lot and urban street network around Nanjing Olympic Sports Center, the models and the iterative algorithm were applied to obtain the optimal plan of the evacuation zone with network reconfiguration in an evacuation situation to verify the validity of the proposed method.

Application study of dynamic voltage scaling policies

Based on the fundamental relationship among the circuit power, the circuit delay and the supply voltage, four theorems associated with the application of dynamic voltage scaling （DVS） policies are proposed and proved. First, the existence characteristics of the optimal supply voltage for a single task are proved, which suggests that the optimal supply voltage for the single task should be selected only within a one-dimensional term, and the corresponding task end time by the optimal supply voltage should be identical with its deadline. Then, it is pointed out that the minimum energy consumption that the DVS policy can obtain when completing a single task is certainly lower than that of the dynamic power management （DPM） policy or the combined DVS＋DPM policy under the same conditions. Finally, the theorem of energy consumption minimization for a multi-task group is proposed, which declares that it is necessary to keep the processor in the execution state during the whole task period to obtain the minimum energy consumption, while satisfying the deadline constraints of any task.

三秦揽胜

三秦揽胜延路饮白水杜康酒孟德豪饮唯杜康，杯中品味乾坤长。醇香一滴千古醉，潮头大风云飞扬。白水苍颉圣庙古柏咏悠悠古柏五千年，文字初祖溯有源。雨粟润泽中华地，轩辕苍颉天地间。延安大学文昌山祭路遥二首一、忆旧问鼎文坛饮誉归，乡友家宴相邀陪。没甚一语惊四座，...

闲情偶寄

题悬崖式盆景 根悬危崖势凌空．云卷云舒各不同。春置案头精神爽．闲趣尽在一盆中。

Lazy loading algorithm for traffic assignment of road networks under fixed charge condition

The measures of path charge are important considerations in traffic assignment of road networks. Factors, such as travel time, fixed charge and traffic congestion which affect road users＇ choices of trip paths, are analyzed. Travelers usually decide their trip paths based on their personal habits, preferences and the information at hand. By considering both deterministic and stochastic factors which affect the value of time （VOT） during the process of path choosing, a variational inequality model is proposed to describe the problem of traffic assignment. A lazy loading algorithm for traffic assignment is designed to solve the proposed model, and the calculation steps are given. Numerical experiment results show that compared with the all-or-nothing assignment, the proposed model and the algorithm can provide more optimal traffic assignments for road networks. The results of this study can be used to optimize traffic planning and management.

Adaptive clustering hierarchy routing for delay tolerant network

Adaptive clustering hierarchy routing(ACHR) establishes a clusters-based hierarchical hybrid routing algorithm with two-hop local visibility for delay tolerant network(DTN).The major contribution of ACHR is the combination of single copy scheme and multi-copy scheme and the combination of hop-by-hop and multi-hop mechanism ACHR,which has the advantages in simplicity,availability and well-expansibility.The result shows that it can take advantage of the random communication opportunities and local network connectivity,and achieves 1.6 times delivery ratio and 60% overhead compared with its counterpart.

Congestion aware routing algorithm for delay-disruption tolerance networks

There were many contradictory evaluation criteria to select next-hop in the delay-disruption tolerance networks(DTN).To solve this problem,an attribute hierarchical model was proposed,in which the predefined criteria were summarized as static identity attributes,forwarding desire attributes and delivery capability attributes(IDC).Based on this model,a novel multi-attributes congestion aware routing(MACAR) scheme with uncertain information for next-hop selection was presented,by adopting an decision theory to aggregate attributes with belief structure and computing partial ordering relations.The simulation results show that MACAR presents higher successful delivery rate,lower average delay and effectively alleviate congestion.

High Delivery Performance Opportunistic Routing Scheme for Delay Tolerant Networks

In Delay Tolerant Networks (DTNs), establishing routing path from a source node to a destination node may not be possible, so the opportunistic routings are widely used. The energy and buffer constraints are general in DTNs composed of the mobile phones or Pads. This paper proposes a novel opportunistic routing protocol, denoted by Large Opporturioty (LAOP), for the energy and buffer constrained DTNs. The objective of LAOP is to reach many receivers of a message with a small number of transmissions. By LAOP, the sender floods a message when the number of its neighbors is not less than a threshold. We compare the delivery performance of LAOP with other four widely used Delay or Disruption Tolerant Network (DTN) routing protocols, Direct Delivery, Epidemic routing, SprayAndWait and PRoPHET and demonstrate that LAOP can improve the delivery performance and decrease the delivery latency simultaneously.

H_∞ deconvolution filter design for time-delay linear continuous-time systems

Proposes an H_∞ deconvolution design for time-delay linear continuous-time systems. We first analyze the general structure and innovation structure of the H_∞ deconvolution filter. The deconvolution filter with innovation structure is made up of an output observer and a linear mapping, where the latter reflects the internal connection between the unknown input signal and the output estimate error. Based on the bounded real lemma, a time domain design approach and a sufficient condition for the existence of deconvolution filter are presented. The parameterization of the deconvolution filter can be completed by solving a Riccati equation. The proposed method is useful for the case that does not require statistical information about disturbances. At last, a numerical example is given to demonstrate the performance of the proposed filter.

PERFORMANCE OF CODED OFDM VIA VARIABLE GUARD INTERVAL

This letter presents the principles of Coded Orthogonal Frequency Division Multiplexing (COFDM) system and focuses on the effect of the Guard Interval (GI) on the systemperformance. The role of the GI parameter period to solve the problem of interferences that occur at the receiver is discussed. A new COFDM concept with a Variable GI (VGI) is proposed in order to improve the Bit Error Rate (BER) performance in the presence of multipaths with variable delays. A series of simulations have been carried out on the BER performance as a function of GI, maximum delay spread, and Signal-to-Noise Ratio (SNR), with QPSK as modulation scheme over multipath fading and Additive White Gaussian Noise (AWGN). The results show that the optimum values of the GI parameter approximately equal to the maximum delay spread, and the proposed system with VGI provides a better performance compared with the fixed length GI.

Effective multicasting algorithm for dynamic membership with delay constraint

This paper proposes an effective heuristic algorithm The tree constructed by DDMR has the following characteristics： for dynamic multicast routing with delay-constrained DDMR. （1） multicast tree changes with the dynamic memberships; （2） the cost of the tree is as small as possible at each node addition/removal event; （3） all of the path delay meet a fixed delay constraint; （4） minimal perturbation to an existing tree. The proposed algorithm is based on “damage” and “usefulness” concepts proposed in previous work, and has a new parameter bf（Balancing Factor） for judging whether or not to rearrange a tree region when membership changes. Mutation operation in Genetic Algorithm （GA） is also employed to find an attached node for a new adding node. Simulation showed that our algorithm performs well and is better than static heuristic algorithms, in term of cost especially.

Improved sample filtering method for measuring end-to-end path capacity

By analyzing the effect of cross traffic (CT) enforced on packet delay, an improved path capacity measurement method, pcapminp algorithm, was proposed. With this method, path capacity was measured by filtering probe samples based on measured minimum packet-pair delay. The measurability of minimum packet-pair delay was also analyzed by simulation. The results show that, when comparing with pathrate, if the CT load is light, both pcapminp and pathrate have similar accuracy; but in the case of heavy CT load, pcapminp is more accurate than Pathrate. When CT load reaches 90%, pcapminp algorithm has only 5% measurement error, which is 10% lower than that of pathrate algorithm. At any CT load levels, the probe cost of pcapminp algorithm is two magnitudes smaller than that of pathrate, and the measurement duration is one magnitude shorter than that of pathrate algorithm.

Delays caused by motorized vehicles unable to clear intersections in China: Graphical analysis

In many Chinese cities,motorized vehicles （M-vehicles） move slowly at intersections due to the interference of a large number of non-motorized vehicles （NM-vehicles）.The slow movement makes a part of M-vehicles fail to leave intersections timely after the traffic signal tums red,and thereby conflicts between vehicles from two directions occur.The phenomenon was analyzed graphically by using the cumulative vehicle curve.Delays in three cases were modeled and compared：NM-vehicle priorities and M-vehicle priorities with all-red intervals unable to release all vehicles,and longer all-red intervals ensuring release all vehicles.Marginal delays caused by two illegal behaviors that occasionally happened in mixed traffic intersections were also investigated.It is concluded that increasing the speed of M-vehicles leaving intersections and postponing the entering of NM-vehicles are the keys in mathematics,although they are uneasy in disordered mixed traffic intersections due to a dilemma between efficiency and orders in reality.The results could provide implications for the traffic management in the cities maintaining a large number of M-and NM-vehicles.

Research on a High-Precision Delay Circuit in Data Acquisition Systems

This paper presents a novel precision delay circuit design for high-speed data acquisition systems. Many studies have suggested that various advanced electronic measurement apparatuses require that the delay circuit should have a high precision and a short delay interval. Practically, however, such measurement apparatuses are low in preci- sion and long in delay interval at present. The structure and function of a data acquisition system is introduced first; then the principle of ramp-based precision delay circuits and the digitally programmable delay generator is studied and the precision delay circuit is designed. The authors also demonstrated 8-bit programmable delay circuits with a timing pre- cision of 10 ps. Therefore the programmable precision delay circuit here presented has a higher precision, shorter inter- val and more detectable function than any other precision delay circuit.

OpenFIow Based Flow Slice Load Balancing

Today's data center networks are designed using densely interconnected hosts in the data center.There are multiple paths between source host and destination server.Therefore,how to balance traffic is key issue with the fast growth of network applications.Although lots of load balancing methods have been proposed,the traditional approaches cannot fully satisfy the requirement of load balancing in data center networks.The main reason is the lack of efficient ways to obtain network traffic statistics from each network device.As a solution,the OpenFlow protocol enables monitoring traffic statistics by a centralized controller.However,existing solutions based on OpenFlow present a difficult dilemma between load balancing and packet reordering.To achieve a balance between load balancing and packet reordering,we propose an OpenFlow based flow slice load balancing algorithm.Through introducing the idea of differentiated service,the scheme classifies Internet flows into two categories:the aggressive and the normal,and applies different splitting granularities to the two classes of flows.This scheme improves the performance of load balancing and also reduces the number of reordering packets.Using the trace-driven simulations,we show that the proposed scheme gains over 50%improvement over previous schemes under the path delay estimation errors,and is a practical and efficient algorithm.

Delay Analysis and Formulation Inference of Signalized Intersection for Traffic Congestion Conditions

Vehicle delay is an important measure to evaluate the signal timings of signalized intersections.When optimization the signal control parameters, delays of vehicles from all approach directions of an intersection should be considered. Based on the analysis of the vehicle delay on an approach of intersection, directed against the typical condition of a congested intersection-over-saturated condition, the paper has analyzed and inferred the intersection delay dynamic formulation, and has established the relation between intersection delay,the signal timings, vehicle arrival rate and the queue lengths, and that provides useful information for understanding vehicle delay of signalized intersection and for establishing performance index function of signal timing optimization.