Search

Traffic congestion in freeway network is a prevalent transportation problem and leads to a strong degradation of freeway network facilities. This paper proposes a new coordinated optimization approach for freeway network, aiming to relieve the traffic congestion in freeway network equipped with the coordinated traffic controllers. The challenge is how to solve the problem between the traffic control goals of each path and those of the network. In this paper, the bi-level programming theory is used to address this problem. More exactly, in the path level, the optimal control model is designed to relieve congestion in each path of the test network. Furthermore, in the network level, the optimal model considers the traffic equilibrium and cost optimization. The efficiency of the proposed approach is tested on a well-known traffic network calibrated by the field test data of freeway network. The results show that the proposed approach has positive effects in balancing traffic load and improving the service level of freeway networks.

In dynamic Positron Emission Tomography (PET), an estimate of the radio activity concentration is obtained from a series of frames of sinogram data taken at ranging in duration from 10 seconds to minutes under some criteria. So far, all the well-known reconstruction algorithms require known data statistical properties. It limits the speed of data acquisition, besides, it is unable to afford the separated information about the structure and the variation of shape and rate of metabolism which play a major role in improving the visualization of contrast for some requirement of the diagnosing in application. This paper presents a novel low rank-based activity map reconstruction scheme from emission sinograms of dynamic PET, termed as SLCR representing Sparse/Low Rank Constrained Reconstruction for Dynamic PET Imaging. In this method, the stationary background is formulated as a low rank component while variations between successive frames are abstracted to the sparse. The resulting nuclear norm and l 1 norm related minimization problem can also be efficiently solved by many recently developed numerical methods. In this paper, the linearized alternating direction method is applied. The effectiveness of the proposed scheme is illustrated on three data sets.

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.

The paper presents a new open-source visualization system, named ReVisE, aimed to provide interactive visualization of large datasets, which are results of complex numerical simulations. These datasets are hosted on a remote server or a supercomputer. The design of the system is briefly described. Dataset representation, proposed for interactive visualization and implemented in the system, is discussed. The effectiveness of our approach is confirmed by results of performance measurements on test and real-life large datasets. A comparison with other visualization systems is presented. Future plans of system development are outlined.

A new Interpolation based Reversible Data Hiding (IRDH) scheme is reported in this paper. For different applications of an IRDH scheme to the digital image, video, multimedia, big-data and biological data, the embedding capacity requirement usually varies. Disregarding this important consideration, existing IRDH schemes do not offer a better embedding rate-distortion performance for varying size payloads. To attain this varying capacity requirement with our proposed adaptive embedding, we formulate a capacity control parameter and propose to utilize it to determine a minimum set of embeddable bits in a pixel. Additionally, we use a logical (or bit-wise) correlation between the embeddable pixel and estimated versions of an embedded pixel. Thereby, while a higher range between an upper and lower limit of the embedding capacity is maintained, a given capacity requirement within that limit is also attained with a better-embedded image quality. Computational modeling of all new processes of the scheme is presented, and performance of the scheme is evaluated with a set of popular test-images. Experimental results of our proposed scheme compared to the prominent IRDH schemes have recorded a significantly better-embedding rate-distortion performance.

Dynamic solar shading has the potential to dramatically reduce the energy consumption in buildings while at the same time improving the thermal and visual comfort of its occupants. Many new typologies of shading systems that have appeared recently, but it is difficult to compare those new systems to existing typologies due to control algorithm being rule-based as opposed to performance driven. Since solar shading is a design problem, there is no single right answer. What is the metric to determine if a system has reached its optimal kinematic design? Shading solutions should come from a thorough iterative and comparative process. This paper provides an original and flexible framework for the design and performance optimization of dynamic shading systems based on interpolation of simulations and global minimization. The methodology departs from existing rule-based strategies and applies to existing and to complex shading systems with multiple degree-of-freedom mobility. The strategy for control is centered on meeting comfort targets for work plane illuminance while minimizing the energy needed to operate space. The energy demand for thermal comfort and work plane daylight quantity (illuminance) are evaluated with Radiance and EnergyPlus based on local weather data. Applied to a case study of three typologies of dynamic shading, the results of the methodology inform the usefulness and quality of each degree-of-freedom of the kinematic systems. The case study exemplifies the iterative benefits of the methodology by providing detailed analytics on the behavior of the shades. Designers of shading systems can use this framework to evaluate their design and compare them to existing shading systems. This allows creativity to be guided so that eventually building occupants benefit from the innovation in the field.

Analytical CT reconstruction is popular in practice because of its computational efficiency, but it suffers from low reconstruction quality when an insufficient number of projections are used. To address this issue, this paper presents a new analytical method of backprojection Wiener deconvolution (BPWD). BPWD executes backprojection first, and then applies a Wiener deconvolution to the whole backprojected image. The Wiener filter is derived from a ramp filter, enabling the proposed approach to perform reconstruction and denoising simultaneously. The use of a filter after backprojection does not differentiate between real sampled projections and interpolated ones, introducing reconstruction errors. Therefore a weighted ramp filter was applied to increase the contribution of real sampled projections in the reconstruction, thus improving reconstruction quality. Experiments on synthetic data and real phase-contrast x-ray images showed that the proposed approach yields better reconstruction quality compared to the classical filtered backprojection (FBP) method, with comparable reconstruction speed Refereed/Peer-reviewed

Rectangular caverns are increasingly used in underground engineering projects, the failure mechanism of rectangular cavern wall rock is significantly different as a result of the cross-sectional shape and variations in wall stress distributions. However, the conventional computational method always results in a long-winded computational process and multiple displacement solutions of internal rectangular wall rock. This paper uses a Laurent series complex method to obtain a mapping function expression based on complex variable function theory and conformal transformation. This method is combined with the Schwarz-Christoffel method to calculate the mapping function coefficient and to determine the rectangular cavern wall rock deformation. With regard to the inverse mapping concept, the mapping relation between the polar coordinate system within plane ς and a corresponding unique plane coordinate point inside the cavern wall rock is discussed. The disadvantage of multiple solutions when mapping from the plane to the polar coordinate system is addressed. This theoretical formula is used to calculate wall rock boundary deformation and displacement field nephograms inside the wall rock for a given cavern height and width. A comparison with ANSYS numerical software results suggests that the theoretical solution and numerical solution exhibit identical trends, thereby demonstrating the method's validity. This method greatly improves the computing accuracy and reduces the difficulty in solving for cavern boundary and internal wall rock displacements. The proposed method provides a theoretical guide for controlling cavern wall rock deformation failure.

The availability of digital X-ray detectors, together with advances in reconstruction algorithms, creates an opportunity for bringing 3D capabilities to conventional radiology systems. The downside is that reconstruction algorithms for non-standard acquisition protocols are generally based on iterative approaches that involve a high computational burden. The development of new flexible X-ray systems could benefit from computer simulations, which may enable performance to be checked before expensive real systems are implemented. The development of simulation/reconstruction algorithms in this context poses three main difficulties. First, the algorithms deal with large data volumes and are computationally expensive, thus leading to the need for hardware and software optimizations. Second, these optimizations are limited by the high flexibility required to explore new scanning geometries, including fully configurable positioning of source and detector elements. And third, the evolution of the various hardware setups increases the effort required for maintaining and adapting the implementations to current and future programming models. Previous works lack support for completely flexible geometries and/or compatibility with multiple programming models and platforms. In this paper, we present FUX-Sim, a novel X-ray simulation/reconstruction framework that was designed to be flexible and fast. Optimized implementation for different families of GPUs (CUDA and OpenCL) and multi-core CPUs was achieved thanks to a modularized approach based on a layered architecture and parallel implementation of the algorithms for both architectures. A detailed performance evaluation demonstrates that for different system configurations and hardware platforms, FUX-Sim maximizes performance with the CUDA programming model (5 times faster than other state-of-the-art implementations). Furthermore, the CPU and OpenCL programming models allow FUX-Sim to be executed over a wide range of hardware platforms.

The scientific demand for more accurate modeling of the climate system calls for more computing power to support higher resolutions, inclusion of more component models, more complicated physics schemes, and larger ensembles. As the recent improvements in computing power mostly come from the increasing number of nodes in a system and the integration of heterogeneous accelerators, how to scale the computing problems onto more nodes and various kinds of accelerators has become a challenge for the model development. This paper describes our efforts on developing a highly scalable framework for performing global atmospheric modeling on heterogeneous supercomputers equipped with various accelerators, such as GPU (Graphic Processing Unit), MIC (Many Integrated Core), and FPGA (Field Programmable Gate Arrays) cards. We propose a generalized partition scheme of the problem domain, so as to keep a balanced utilization of both CPU resources and accelerator resources. With optimizations on both computing and memory access patterns, we manage to achieve around 8 to 20 times speedup when comparing one hybrid GPU or MIC node with one CPU node with 12 cores. Using a customized FPGA-based data-flow engines, we see the potential to gain another 5 to 8 times improvement on performance. On heterogeneous supercomputers, such as Tianhe-1A and Tianhe-2, our framework is capable of achieving ideally linear scaling efficiency, and sustained double-precision performances of 581 Tflops on Tianhe-1A (using 3750 nodes) and 3.74 Pflops on Tianhe-2 (using 8644 nodes). Our study also provides an evaluation on the programming paradigm of various accelerator architectures (GPU, MIC, FPGA) for performing global atmospheric simulation, to form a picture about both the potential performance benefits and the programming efforts involved.

Online users nowadays are facing serious information overload problem. In recent years, recommender systems have been widely studied to help people find relevant information. Adaptive social recommendation is one of these systems in which the connections in the online social networks are optimized for the information propagation so that users can receive interesting news or stories from their leaders. Validation of such adaptive social recommendation methods in the literature assumes uniform distribution of users' activity frequency. In this paper, our empirical analysis shows that the distribution of online users' activity is actually heterogenous. Accordingly, we propose a more realistic multi-agent model in which users' activity frequency are drawn from a power-law distribution. We find that previous social recommendation methods lead to serious delay of information propagation since many users are connected to inactive leaders. To solve this problem, we design a new similarity measure which takes into account users' activity frequencies. With this similarity measure, the average delay is significantly shortened and the recommendation accuracy is largely improved.

In the fourth generation or next generation networks, services of non-real-time variable bit rate (NRT-VBR) and best effort (BE) will dominate over 85% of the total traffic in the networks. In this paper, we study the power saving mechanism of NRT-VBR and BE services for mobile handsets (MHs) to prolong their battery lifetime (i.e., the sustained operation duration) in the fourth generation networks. Because the priority of NRT-VBR and BE is lower than that of real-time VBR (RT-VBR) or guaranteed bit rate (GBR) services, we investigate an extended sleep mode for lower priority services (e.g., NRT-VBR and BE) in an MH to conserve the energy. The extended sleep mode is used when the MH wakes up from the sleep mode but it cannot obtain the bandwidth from base station (BS). The proposed mechanism, named extra power saving scheme (EPSS), uses the M/M/k/k Markovian queuing model to estimate the extended sleep duration to let MHs conserve their battery energy when the networks traffic is congested. To study the performance of EPSS, an accurate analysis model of energy is presented and validated by taking a series of simulations. Numerical experiments show that EPSS can achieve 43% extra energy conservation at most when downlink resource is saturated. We conclude that the energy of MHs can be conserved further by applying EPSS when the traffic load is saturated. The effect of energy saving becomes more obvious when the portion of NRT-VBR and BE services is greater than that of RT-VBR and GBR services.

This paper aims to obtain the approximate solution of time-fractional advection-dispersion equation (FADE) involving Jumarie’s modification of Riemann-Liouville derivative by the fractional variational iteration method (FVIM). FVIM provides an analytical approximate solution in the form of a convergent series. Some examples are given and the results indicate that the FVIM is of high accuracy, more efficient, and more convenient for solving time FADEs.

The Vector Evaluated Particle Swarm Optimisation algorithm is widely used to solve multiobjective optimisation problems. This algorithm optimises one objective using a swarm of particles where their movements are guided by the best solution found by another swarm. However, the best solution of a swarm is only updated when a newly generated solution has better fitness than the best solution at the objective function optimised by that swarm, yielding poor solutions for the multiobjective optimisation problems. Thus, an improved Vector Evaluated Particle Swarm Optimisation algorithm is introduced by incorporating the nondominated solutions as the guidance for a swarm rather than using the best solution from another swarm. In this paper, the performance of improved Vector Evaluated Particle Swarm Optimisation algorithm is investigated using performance measures such as the number of nondominated solutions found, the generational distance, the spread, and the hypervolume. The results suggest that the improved Vector Evaluated Particle Swarm Optimisation algorithm has impressive performance compared with the conventional Vector Evaluated Particle Swarm Optimisation algorithm.

The aim of this paper is to present new existence theorems for solutions of vector equilibrium problems, by using weak interior type conditions and weak convexity assumptions.

This paper presents a propagation dynamics model for congestion propagation in complex networks of airspace. It investigates the application of an epidemiology model to complex networks by comparing the similarities and differences between congestion propagation and epidemic transmission. The model developed satisfies the constraints of actual motion in airspace, based on the epidemiology model. Exploiting the constraint that the evolution of congestion cluster in the airspace is always dynamic and heterogeneous, the SIR epidemiology model (one of the classical models in epidemic spreading) with logistic increase is applied to congestion propagation and shown to be more accurate in predicting the evolution of congestion peak than the model based on probability, which is common to predict the congestion propagation. Results from sample data show that the model not only predicts accurately the value and time of congestion peak, but also describes accurately the characteristics of congestion propagation. Then, a numerical study is performed in which it is demonstrated that the structure of the networks have different effects on congestion propagation in airspace. It is shown that in regions with severe congestion, the adjustment of dissipation rate is more significant than propagation rate in controlling the propagation of congestion.

A computational method of reduced complexity is developed for simulating vascular hemodynamics by combination of one-dimensional (1D) wave propagation models for the blood vessels with zero-dimensional (0D) lumped models for the microcirculation. Despite the reduced dimension, current algorithms used to solve the model equations and simulate pressure and flow are rather complex, thereby limiting acceptance in the medical field. This complexity mainly arises from the methods used to combine the 1D and the 0D model equations. In this paper a numerical method is presented that no longer requires additional coupling methods and enables random combinations of 1D and 0D models using pressure as only state variable. The method is applied to a vascular tree consisting of 60 major arteries in the body and the head. Simulated results are realistic. The numerical method is stable and shows good convergence.

Differential evolution (DE) is a population based evolutionary algorithm widely used for solving multidimensional global optimization problems over continuous spaces, and has been successfully used to solve several kinds of problems. In this paper, differential evolution is used for quantitative interpretation of self-potential data in geophysics. Six parameters are estimated including the electrical dipole moment, the depth of the source, the distance from the origin, the polarization angle and the regional coefficients. This study considers three kinds of data from Turkey: noise-free data, contaminated synthetic data, and Field example. The differential evolution and the corresponding model parameters are constructed as regards the number of the generations. Then, we show the vibration of the parameters at the vicinity of the low misfit area. Moreover, we show how the frequency distribution of each parameter is related to the number of the DE iteration. Experimental results show the DE can be used for solving the quantitative interpretation of self-potential data efficiently compared with previous methods.

The honeybee dance “language” is one of the most popular examples of information transfer in the animal world. Today, more than 60 years after its discovery it still remains unknown how follower bees decode the information contained in the dance. In order to build a robotic honeybee that allows a deeper investigation of the communication process we have recorded hundreds of videos of waggle dances. In this paper we analyze the statistics of visually captured high-precision dance trajectories of European honeybees (Apis mellifera carnica). The trajectories were produced using a novel automatic tracking system and represent the most detailed honeybee dance motion information available. Although honeybee dances seem very variable, some properties turned out to be invariant. We use these properties as a minimal set of parameters that enables us to model the honeybee dance motion. We provide a detailed statistical description of various dance properties that have not been characterized before and discuss the role of particular dance components in the commmunication process.

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.

Interference resulting from Cognitive Radios (CRs) is the most important aspect of cognitive radio networks that leads to degradation in Quality of Service (QoS) in both primary and CR systems. Power control is one of the efficient techniques that can be used to reduce interference and satisfy the Signal-to-Interference Ratio (SIR) constraint among CRs. This paper proposes a new distributed power control algorithm based on game theory approach in cognitive radio networks. The proposal focuses on the channel status of cognitive radio users to improve system performance. A new cost function for SIR-based power control via a sigmoid weighting factor is introduced. The existence of Nash Equilibrium and convergence of the algorithm are also proved. The advantage of the proposed algorithm is the possibility to utilize and implement it in a distributed manner. Simulation results show considerable savings on Nash Equilibrium power compared to relevant algorithms while reduction in achieved SIR is insignificant.

The application of Preventive Maintenance (PM) and Statistical Process Control (SPC) are important practices to achieve high product quality, small frequency of failures, and cost reduction in a production process. However there are some points that have not been explored in depth about its joint application. First, most SPC is performed with the X-bar control chart which does not fully consider the variability of the production process. Second, many studies of design of control charts consider just the economic aspect while statistical restrictions must be considered to achieve charts with low probabilities of false detection of failures. Third, the effect of PM on processes with different failure probability distributions has not been studied. Hence, this paper covers these points, presenting the Economic Statistical Design (ESD) of joint X-bar-S control charts with a cost model that integrates PM with general failure distribution. Experiments showed statistically significant reductions in costs when PM is performed on processes with high failure rates and reductions in the sampling frequency of units for testing under SPC.

In this paper we describe the repeated replacement method (RRM), a new meshfree method for computational fluid dynamics (CFD). RRM simulates fluid flow by modeling compressible fluids' tendency to evolve towards a state of constant density, velocity, and pressure. To evolve a fluid flow simulation forward in time, RRM repeatedly "chops out" fluid from active areas and replaces it with new "flattened" fluid cells with the same mass, momentum, and energy. We call the new cells "flattened" because we give them constant density, velocity, and pressure, even though the chopped-out fluid may have had gradients in these primitive variables. RRM adaptively chooses the sizes and locations of the areas it chops out and replaces. It creates more and smaller new cells in areas of high gradient, and fewer and larger new cells in areas of lower gradient. This naturally leads to an adaptive level of accuracy, where more computational effort is spent on active areas of the fluid, and less effort is spent on inactive areas. We show that for common test problems, RRM produces results similar to other high-resolution CFD methods, while using a very different mathematical framework. RRM does not use Riemann solvers, flux or slope limiters, a mesh, or a stencil, and it operates in a purely Lagrangian mode. RRM also does not evaluate numerical derivatives, does not integrate equations of motion, and does not solve systems of equations.

We describe in this paper the experimental procedure, the data treatment and the quantification of the black body correction: an experimental approach to compensate for scattering and systematic biases in quantitative neutron imaging based on experimental data. The correction algorithm is based on two steps; estimation of the scattering component and correction using an enhanced normalization formula. The method incorporates correction terms into the image normalization procedure, which usually only includes open beam and dark current images (open beam correction). Our aim is to show its efficiency and reproducibility: we detail the data treatment procedures and quantitatively investigate the effect of the correction. Its implementation is included within the open source CT reconstruction software MuhRec. The performance of the proposed algorithm is demonstrated using simulated and experimental CT datasets acquired at the ICON and NEUTRA beamlines at the Paul Scherrer Institut.