成绞、复摇和摇纱机卷绕原理及简谐络交设计

针对成绞机、复摇机和摇纱机等六角形大卷绕的简谐络交特点,通过理论和公式,表达了络交与主要基本参数之间的关系、丝片实际成形状态等,提出了这类机器简谐络交速比的设计方法及理论依据。

Synchronous hybrid transport network design

Delay,as an inevitable real-world phenomenon,is usually ignored in transport network design.A model of urban hybrid transport system with stochastic delay was created on the basis of the idealized public transport system design.After formulating the total trip time cost composed of accessing time in the sub-region of the city,waiting time at the public transport station,and in-vehicle time in the public transit network,the analytical properties of the total trip time cost function were investigated.The results show that in the urban hybrid transport network design,the total trip time cost reaches its approximate minimum in a δ-neighbourhood of buffer time of 1.5 min,and that through modelling optimal delay in hybrid transport system,the maximal synchronization can be achieved and operational efficiency and passenger satisfaction can be improved.The proposed modelling and analytical investigations are attempts to contribute to more realistic modelling of future idealized public transport system that involves more practical constraints.

Experimental study of laser cladding process and prediction of process parameters by artificial neural network(ANN)

Laser cladding of powder mixture of TiN and SS304 is carried out on an SS304 substrate with the help of fibre laser.The experiments are performed on SS304,as per the Taguchi orthogonal array(L^(16))by different combinations of controllable parameters(microhardness and clad thickness).The microhardness and clad thickness are recorded at all the experimental runs and studied using Taguchi S/N ratio and the optimum controllable parametric combination is obtained.However,an artificial neural network(ANN)identifies different sets of optimal combinations from Taguchi method but they both got almost the same clad thickness and hardness values.The micro-hardness of cladded layer is found to be6.22 times(HV_(0.5)752)the SS304 hardness(HV_(0.5)121).The presence of nitride ceramics results in a higher micro hardness.The cladded surface is free from cracks and pores.The average clad thickness is found to be around 0.6 mm.

Evolution of Commercial Space near the Subway Stations of Community Type Based on Self-Organization Theory: A Case Study of Chengdu Wannianchang Subway Station

The subway stations of urban community type are not only main nodes in the urban traffic network, but also important places for peopled daily life. Widi the rapid development of urban metro and urban economy, the commercial space near tiie subway station has become the focus of urban planning and urban spatial development, and commercial self-oiganization pkys an important role in the development of commercial operations, commercial structures, and commercial scales, so how to make effective use of the inherent laws of the commercial space evolution, and further guide the rational development of community businesses needs more attention and research. This paper takes Chengdu Wannianchang Subway Station as an example to study the evolution stage, influencing factors, evolution characteristics and laws of the neatby commercial space. Moreover, suggestions were put forward such as coordinating competition and collaboration, optimizing space design and management, co-directional self-organization and heter-oiganizations, in order to provide a new reference for the healthy and ordedy development of the neighboring commefdal space near the subway stations of community type.

Differential space-time modulation based on orthogonal design for cooperative network

Differential modulation was widely used for wireless networks in which channel estimation was diffi-cult.Based on orthogonal design,a novel distributed differential space-time coding/decoding scheme forM-PSK modulations was proposed,which had a high code rate of 2/3 and second-order diversity for thetwo-user cooperative networks.The performance of decode-and-forward (DF) protocols was evaluated.Simulations show that the differential space-time modulation scheme in this paper has better bit error rate(BER) performance or higher code rate than the schemes proposed by Tarasak and Wang when interuserchannel states are good enough.The impacts of transmission error between two users for the whole systemBER performance were also investigated.

Design and Implementation of Not So Cooperative Caching System

Not So Cooperative Caching(NSCC) considers a network comprised of selfish nodes; each is with caching capability and an objective of reducing its own access cost by fetching data from its local cache or from neighboring caches. These nodes would cooperate in caching and share cached content if and only if they each benefit. The challenges are to determine what objects to cache at each node and to implement the system in the context of Information Centric Networking(ICN). This work includes both a solution for the NSCC problem and a design and implementation of an NSCC system in Named Data Networking(NDN), a large effort that exemplifies ICN. Our design applies NDN synchronization protocol to facilitate the information exchange among nodes, adopts group key encryption to control data access within the NSCC group, and offers an error checker to detect error events in the system. Our approach is validated by deploying the system we developed on Planet Lab.

Intelligent Resources Management System Design in Information Centric Networking

Information centric networking(ICN) is a new network architecture that is centred on accessing content. It aims to solve some of the problems associated with IP networks, increasing content distribution capability and improving users' experience. To analyse the requests' patterns and fully utilize the universal cached contents, a novel intelligent resources management system is proposed, which enables effi cient cache resource allocation in real time, based on changing user demand patterns. The system is composed of two parts. The fi rst part is a fi ne-grain traffi c estimation algorithm called Temporal Poisson traffi c prediction(TP2) that aims at analysing the traffi c pattern(or aggregated user requests' demands) for different contents. The second part is a collaborative cache placement algorithm that is based on traffic estimated by TP2. The experimental results show that TP2 has better performance than other comparable traffi c prediction algorithms and the proposed intelligent system can increase the utilization of cache resources and improve the network capacity.

Simultaneous optimization of transit network and public bicycle station network

The traditional manner to design public transportation system is to sequentially design the transit network and public bicycle network. A new public transportation system design problem that simultaneously considers both bus network design and public bicycle network design is proposed. The chemical reaction optimization(CRO) is designed to solve the problem. A shortcoming of CRO is that, when the two-molecule collisions take place, the molecules are randomly picked from the container.Hence, we improve CRO by employing different mating strategies. The computational results confirm the benefits of the mating strategies. Numerical experiments are conducted on the Sioux-Falls network. A comparison with the traditional sequential modeling framework indicates that the proposed approach has a better performance and is more robust. The practical applicability of the approach is proved by employing a real size network.

ML and MAP Channel Estimation for Distributed OneWay Relay Networks with Orthogonal Training

In this letter,we investigate the individual channel estimation for the classical distributed-space-time-coding(DSTC) based one-way relay network(OWRN) under the superimposed training framework.Without resorting to the composite channel estimation,as did in traditional work,we directly estimate the individual channels from the maximum likelihood(ML) and the maximum a posteriori(MAP) estimators.We derive the closed-form ML estimators with the orthogonal training designing.Due to the complicated structure of the MAP in-channel estimator,we design an iterative gradient descent estimation process to find the optimal solutions.Numerical results are provided to corroborate our studies.

Real-time routing control design for traffic networks with multi-route choices

This work considers those road networks in which there are multi-route choices for bifurcation-destination(or origin-destination) pairs, and designs a real-time variable message sign(VMS)-based routing control strategy in the model predictive control(MPC) framework. The VMS route recommendation provided by the traffic management authority is directly considered as the control variable, and the routing control model is established, in which a multi-dimensional control vector is introduced to describe the influence of route recommendations on flow distribution. In the MPC framework, a system optimum routing strategy with the constraints regarding drivers' acceptability with recommended routes is designed, which can not only meet the traffic management authority's control requirement but also improve drivers' satisfaction with the route guidance system. The simulation carried out shows that the proposed routing control can effectively mitigate traffic congestion, reduces followers' time delay, and improves drivers' satisfaction with routing control in road networks.

Design of an unbuffered switch for network on-chip

In the complex multicore chip system,network on-chip(NoC)is viewed as a kind of system interconnection that can substitute the traditional interconnect networks,which will improve the system performance and communication efficiency.With regard to the complex and large scale NoC,simple and efficient routing nodes are the critical factors to achieve low-cost and low-congestion communication performance.This paper proposes an unbuffered switch architecture and makes detailed analysis of the mechanism of buffer in the switch architecture.According to the simulation results,the S-mesh using the unbuffered switch architecture is better in terms of the optimal performance in message latency than some typical NoC architectures,such as 2D-mesh,Fat-tree,Butterfly,Octagon and so on.The synthesis results of design compiler indicate that the unbuffered switch has obvious advantages of achieving cost and operating speed for the chips.

Research on Interactive Learning and Teaching based on Computer Network

This paper analyzes the basic interactivity connotation of network teaching from the interactive definition, function, types and level etc., and established the interaction quality evaluation index system from the four angles between student and media, the course content, teacher and peer interaction. Similarly, network instruction interaction also needs to carry on the design from the perspective of instructional design, and take full advantage of the Internet, and finally achieved good network interaction effect. Practice shows that, research on network interactive strategy significance.

Parameter sensitivity and inversion analysis of a concrete faced rock-fill dam based on HS-BPNN algorithm

Considering the complex nonlinear relationship between the material parameters of a concrete faced rock-fill dam(CFRD) and its displacements, the harmony search(HS) algorithm is used to optimize the back propagation neural network(BPNN), and the HS-BPNN algorithm is formed and applied for the inversion analysis of the parameters of rock-fill materials. The sensitivity of the parameters in the Duncan and Chang's E-B model is analyzed using the orthogonal test design. The case study shows that the parameters φ0, K, Rf, and Kb are sensitive to the deformation of the rock-fill dam and the inversion analysis for these parameters is performed by the HS-BPNN algorithm. Compared with the traditional BPNN, the HS-BPNN algorithm exhibits the advantages of high convergence precision, fast convergence rate, and strong stability.

Mixed-Vehicular Aggregated Transportation Network Design Considering En-route Recharge Service Provision for Electric Vehicles

This paper addresses the transportation network design problem （NDP） wherein the dis- tance limit and en-route recharge of electric vehicles are taken into account. Specifically, in this work, the network design problem aims to select the optimal planning policy from a set of infrastructure design scenarios considering both road expansions and charging station allocations under a specified construction budget. The user-equilibrium mixed-vehicular traffic assignment problem with en-route recharge （MVTAP-ER） is formulated into a novel convex optimization model and extended to a newly developed bi-level program of the aggregated NDP integrating recharge facility allocation （NDP-RFA）. In the algorithmic framework, a convex optimization technique and a tailored CA are adopted for, respectively, solving the subproblem MVTAP-ER and the primal problem NDP-RFA. Systematic ex- periments are conducted to test the efficacy of the proposed approaches. The results highlight the impacts of distance limits and budget levels on the project selection and evaluation, and the benefits of considering both road improvement policy and recharge service provision as compared to accounting for the latter only. The results also report that the two design objectives, to respectively minimize the total system travel time and vehicle miles travelled, are conflicting for certain scenarios.

BILEVEL PROGRAMMING MODEL AND SOLUTION METHOD FOR MIXED TRANSPORTATION NETWORK DESIGN PROBLEM

By handling the travel cost function artfully, the authors formulate the transportation mixed network design problem （MNDP） as a mixed-integer, nonlinear bilevel programming problem, in which the lower-level problem, comparing with that of conventional bilevel DNDP models, is not a side constrained user equilibrium assignment problem, but a standard user equilibrium assignment problem. Then, the bilevel programming model for MNDP is reformulated as a continuous version of bilevel programming problem by the continuation method. By virtue of the optimal-value function, the lower-level assignment problem can be expressed as a nonlinear equality constraint. Therefore, the bilevel programming model for MNDP can be transformed into an equivalent single-level optimization problem. By exploring the inherent nature of the MNDP, the optimal-value function for the lower- level equilibrium assignment problem is proved to be continuously differentiable and its functional value and gradient can be obtained efficiently. Thus, a continuously differentiable but still nonconvex optimization formulation of the MNDP is created, and then a locally convergent algorithm is proposed by applying penalty function method. The inner loop of solving the subproblem is mainly to implement an Ml-or-nothing assignment. Finally, a small-scale transportation network and a large-scale network are presented to verify the proposed model and algorithm.