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]

Generating a reliable computer-simulated synthetic population is necessary for knowledge processing and decision-making analysis in agent-based systems in order to measure, interpret and describe each target area and the human activity patterns within it. In this paper, both synthetic reconstruction (SR) and combinatorial optimisation (CO) techniques are discussed for generating a reliable synthetic population for a certain geographic region (in Australia) using aggregated- and disaggregated-level information available for such an area. A CO algorithm using the quadratic function of population estimators is presented in this paper in order to generate a synthetic population while considering a two-fold nested structure for the individuals and households within the target areas. The baseline population in this study is generated from the confidentialised unit record files (CURFs) and 2006 Australian census tables. The dynamics of the created population is then projected over five years using a dynamic micro-simulation model for individual- and household-level demographic transitions. This projection is then compared with the 2011 Australian census. A prediction interval is provided for the population estimates obtained by the bootstrapping method, by which the variability structure of a predictor can be replicated in a bootstrap distribution. [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]

The uplink of navigation data as satellite ephemeris is a complex satellite range scheduling problem. Large–scale optimal problems cannot be tackled using traditional heuristic methods, and the efficiency of standard genetic algorithm is unsatisfactory. We propose a multi-objective immune genetic algorithm (IGA) for uplink scheduling of navigation constellation. The method focuses on balance traffic and maximum task objects based on satellite-ground index encoding method, individual diversity evaluation and memory library. Numerical results show that the multi–hierarchical encoding method can improve the computation efficiency, the fuzzy deviation toleration method can speed up convergence, and the method can achieve the balance target with a negligible loss in task number (approximately 2.98%). The proposed algorithm is a general method and thus can be used in similar problems. [ABSTRACT FROM AUTHOR]

In this paper, the performance of an individual aiming at guiding a self-organized group is numerically investigated. A collective behavioural model is adopted, accounting for the mutual repulsion, attraction and orientation experienced by the individuals. Moreover, these represent a set of solid particles which are supposed to be immersed in a fictitious viscous fluid. In particular, the lattice Boltzmann and Immersed boundary methods are used to predict the fluid dynamics, whereas the effect of the hydrodynamic forces on particles is accounted for by solving the equation of the solid motion through the time discontinuous Galerkin scheme. Numerical simulations are carried out by involving the individuals in a dichotomous process. On the one hand, an aspirant leader (AL) additional individual is added to the system. AL is forced to move along a prescribed direction which intersects the group. On the other hand, these tend to depart from an obstacle represented by a rotating lamina which is placed in the fluid domain. A numerical campaign is carried out by varying the fluid viscosity and, as a consequence, the hydrodynamic field. Moreover, scenarios characterized by different values of the size of the group are investigated. In order to estimate the AL's performance, a proper parameter is introduced, depending on the number of individuals following AL. Present findings show that the sole collective behavioural equations are insufficient to predict the AL's performance, since the motion is drastically affected by the presence of the surrounding fluid. With respect to the existing literature, the proposed numerical model is enriched by accounting for the presence of the encompassing fluid, thus computing the hydrodynamic forces arising when the individuals move. [ABSTRACT FROM AUTHOR]

Assessing the accuracy of predictive models is critical because predictive models have been increasingly used across various disciplines and predictive accuracy determines the quality of resultant predictions. Pearson product-moment correlation coefficient (r) and the coefficient of determination (r2) are among the most widely used measures for assessing predictive models for numerical data, although they are argued to be biased, insufficient and misleading. In this study, geometrical graphs were used to illustrate what were used in the calculation of r and r2 and simulations were used to demonstrate the behaviour of r and r2 and to compare three accuracy measures under various scenarios. Relevant confusions about r and r2, has been clarified. The calculation of r and r2 is not based on the differences between the predicted and observed values. The existing error measures suffer various limitations and are unable to tell the accuracy. Variance explained by predictive models based on cross-validation (VEcv) is free of these limitations and is a reliable accuracy measure. Legates and McCabe’s efficiency (E1) is also an alternative accuracy measure. The r and r2 do not measure the accuracy and are incorrect accuracy measures. The existing error measures suffer limitations. VEcv and E1 are recommended for assessing the accuracy. The applications of these accuracy measures would encourage accuracy-improved predictive models to be developed to generate predictions for evidence-informed decision-making. [ABSTRACT FROM AUTHOR]

Demersal Seining is an active fishing method applying two long seine ropes and a seine net. Demersal seining relies on fish responding to the seine rope as it moves during the fishing process. The seine ropes and net are deployed in a specific pattern encircling an area on the seabed. In some variants of demersal seining the haul-in procedure includes a towing phase where the fishing vessel moves forward before starting to winch in the seine ropes. The initial seine rope encircled area, the gradual change in it during the haul-in process and the fish's reaction to the moving seine ropes play an important role in the catch performance of demersal seine fishing. The current study investigates this subject by applying computer simulation models for demersal seine fishing. The demersal seine fishing is dynamic in nature and therefore a dynamic model, SeineSolver is applied for simulating the physical behaviour of the seine ropes during the fishing process. Information about the seine rope behaviour is used as input to another simulation tool, SeineFish that predicts the catch performance of the demersal seine fishing process. SeineFish implements a simple model for how fish at the seabed reacts to an approaching seine rope. Here, the SeineSolver and SeineFish tools are applied to investigate catching performance for a Norwegian demersal seine fishery targeting cod (Gadus morhua) in the coastal zone. The effect of seine rope layout pattern and the duration of the towing phase are investigated. Among the four different layout patterns investigated, the square layout pattern was predicted to perform best; catching 69%-86% more fish than would be obtained with the rectangular layout pattern. Inclusion of a towing phase in the fishing process was found to increase the catch performance for all layout patterns. For the square layout pattern, inclusion of a towing phase of 15 or 35 minutes increased the catch performance by respectively 37% and 48% compared to fishing without a towing phase. These results highlights the importance of the selected seine rope layout pattern and the duration of the towing phase when fishermen try to maximize the catch performance of their fishery. To our knowledge this is the first time the combination of models for the physical behaviour of seine ropes and for fish behaviour in response to seine rope movements have been applied to predict catch performance for demersal seining. [ABSTRACT FROM AUTHOR]

We describe a general Godunov-type splitting for numerical simulations of the Fisher–Kolmogorov–Petrovski–Piskunov growth and diffusion equation on a world map with Neumann boundary conditions. The procedure is semi-implicit, hence quite stable. Our principal application for this solver is modeling human population dispersal over geographical maps with changing paleovegetation and paleoclimate in the late Pleistocene. As a proxy for carrying capacity we use Net Primary Productivity (NPP) to predict times for human arrival in the Americas. [ABSTRACT FROM AUTHOR]