Search

Analysis of the slipstream development around the high-speed trains in tunnels would provide references for assessing the transient gust loads on trackside workers and trackside furniture in tunnels. This paper focuses on the computational analysis of the slipstream caused by high-speed trains passing through double-track tunnels with a cross-sectional area of 100 m2. Three-dimensional unsteady compressible Reynolds-averaged Navier-Stokes equations and a realizable k-ε turbulence model were used to describe the airflow characteristics around a high-speed train in the tunnel. The moving boundary problem was treated using the sliding mesh technology. Three cases were simulated in this paper, including two tunnel lengths and two different configurations of the train. The train speed in these three cases was 250 km/h. The accuracy of the numerical method was validated by the experimental data from full-scale tests, and reasonable consistency was obtained. The results show that the flow field around the high-speed trains can be divided into three distinct regions: the region in front of the train nose, the annular region and the wake region. The slipstream development along the two sides of train is not in balance and offsets to the narrow side in the double-track tunnels. Due to the piston effect, the slipstream has a larger peak value in the tunnel than in open air. The tunnel length, train length and length ratio affect the slipstream velocities; in particular, the velocities increase with longer trains. Moreover, the propagation of pressure waves also induces the slipstream fluctuations: substantial velocity fluctuations mainly occur in front of the train, and weaken with the decrease in amplitude of the pressure wave. [ABSTRACT FROM AUTHOR]

An end-to-end network traffic matrix is significantly helpful for network management and for Software Defined Networks (SDN). However, the end-to-end network traffic matrix's inferences and estimations are a challenging problem. Moreover, attaining the traffic matrix in high-speed networks for SDN is a prohibitive challenge. This paper investigates how to estimate and recover the end-to-end network traffic matrix in fine time granularity from the sampled traffic traces, which is a hard inverse problem. Different from previous methods, the fractal interpolation is used to reconstruct the finer-granularity network traffic. Then, the cubic spline interpolation method is used to obtain the smooth reconstruction values. To attain an accurate the end-to-end network traffic in fine time granularity, we perform a weighted-geometric-average process for two interpolation results that are obtained. The simulation results show that our approaches are feasible and effective. [ABSTRACT FROM AUTHOR]

The sampling of scale-free networks in Molecular Biology is usually achieved by growing networks from a seed using recursive algorithms with elementary moves which include the addition and deletion of nodes and bonds. These algorithms include the Barabási-Albert algorithm. Later algorithms, such as the Duplication-Divergence algorithm, the Solé algorithm and the iSite algorithm, were inspired by biological processes underlying the evolution of protein networks, and the networks they produce differ essentially from networks grown by the Barabási-Albert algorithm. In this paper the mean field analysis of these algorithms is reconsidered, and extended to variant and modified implementations of the algorithms. The degree sequences of scale-free networks decay according to a powerlaw distribution, namely P(k) ∼ k− γ, where γ is a scaling exponent. We derive mean field expressions for γ, and test these by numerical simulations. Generally, good agreement is obtained. We also found that some algorithms do not produce scale-free networks (for example some variant Barabási-Albert and Solé networks). [ABSTRACT FROM AUTHOR]

Anonymity, which is more and more important to multi-receiver schemes, has been taken into consideration by many researchers recently. To protect the receiver anonymity, in 2010, the first multi-receiver scheme based on the Lagrange interpolating polynomial was proposed. To ensure the sender’s anonymity, the concept of the ring signature was proposed in 2005, but afterwards, this scheme was proven to has some weakness and at the same time, a completely anonymous multi-receiver signcryption scheme is proposed. In this completely anonymous scheme, the sender anonymity is achieved by improving the ring signature, and the receiver anonymity is achieved by also using the Lagrange interpolating polynomial. Unfortunately, the Lagrange interpolation method was proven a failure to protect the anonymity of receivers, because each authorized receiver could judge whether anyone else is authorized or not. Therefore, the completely anonymous multi-receiver signcryption mentioned above can only protect the sender anonymity. In this paper, we propose a new completely anonymous multi-receiver signcryption scheme with a new polynomial technology used to replace the Lagrange interpolating polynomial, which can mix the identity information of receivers to save it as a ciphertext element and prevent the authorized receivers from verifying others. With the receiver anonymity, the proposed scheme also owns the anonymity of the sender at the same time. Meanwhile, the decryption fairness and public verification are also provided. [ABSTRACT FROM AUTHOR]