Search

Quantifying the impact of a scholarly paper is of great significance, yet the effect of geographical distance of cited papers has not been explored. In this paper, we examine 30,596 papers published in Physical Review C, and identify the relationship between citations and geographical distances between author affiliations. Subsequently, a relative citation weight is applied to assess the impact of a scholarly paper. A higher-order weighted quantum PageRank algorithm is also developed to address the behavior of multiple step citation flow. Capturing the citation dynamics with higher-order dependencies reveals the actual impact of papers, including necessary self-citations that are sometimes excluded in prior studies. Quantum PageRank is utilized in this paper to help differentiating nodes whose PageRank values are identical. [ABSTRACT FROM AUTHOR]

In the past two decades, various research works have been conducted in the field of flexible electronic devices (FEDs). Researchers have focused their efforts on solving the existing challenges in the electronic, electrochemical, and mechanical behaviors of FEDs. The importance of flexible lithium-ion batteries (FLIBs) in the area of FEDs is evident; however, less attention has been paid to the mechanical behavior of FLIBs in comparison with the material and electrochemical characteristics. The present paper reviewed the research works in the FLIBs, focusing on their mechanical integrity and electrochemical performances. First, an introduction to FLIBs was presented, and the previous review papers published in this field were briefly introduced. Then, a detailed review of the available electrochemical and mechanical research works on FLIBs was presented. Moreover, the mechanical testing methods (tensile, compressive, indentation, fatigue, and adhesion) for the characterization of FLIBs' components, the research works on the simulation and modeling of the mechanical behavior of FLIBs, and a summary of the present situation and the future trend of research in this field were reviewed and presented. [ABSTRACT FROM AUTHOR]

Ensembles are a well established machine learning paradigm, leading to accurate and robust models, predominantly applied to predictive modeling tasks. Ensemble models comprise a finite set of diverse predictive models whose combined output is expected to yield an improved predictive performance as compared to an individual model. In this paper, we propose a new method for learning ensembles of process-based models of dynamic systems. The process-based modeling paradigm employs domain-specific knowledge to automatically learn models of dynamic systems from time-series observational data. Previous work has shown that ensembles based on sampling observational data (i.e., bagging and boosting), significantly improve predictive performance of process-based models. However, this improvement comes at the cost of a substantial increase of the computational time needed for learning. To address this problem, the paper proposes a method that aims at efficiently learning ensembles of process-based models, while maintaining their accurate long-term predictive performance. This is achieved by constructing ensembles with sampling domain-specific knowledge instead of sampling data. We apply the proposed method to and evaluate its performance on a set of problems of automated predictive modeling in three lake ecosystems using a library of process-based knowledge for modeling population dynamics. The experimental results identify the optimal design decisions regarding the learning algorithm. The results also show that the proposed ensembles yield significantly more accurate predictions of population dynamics as compared to individual process-based models. Finally, while their predictive performance is comparable to the one of ensembles obtained with the state-of-the-art methods of bagging and boosting, they are substantially more efficient. [ABSTRACT FROM AUTHOR]

The dispatching of hydro-thermal system is a nonlinear programming problem with multiple constraints and high dimensions and the solution techniques of the model have been a hotspot in research. Based on the advantage of that the artificial bee colony algorithm (ABC) can efficiently solve the high-dimensional problem, an improved artificial bee colony algorithm has been proposed to solve DHTS problem in this paper. The improvements of the proposed algorithm include two aspects. On one hand, local search can be guided in efficiency by the information of the global optimal solution and its gradient in each generation. The global optimal solution improves the search efficiency of the algorithm but loses diversity, while the gradient can weaken the loss of diversity caused by the global optimal solution. On the other hand, inspired by genetic algorithm, the nectar resource which has not been updated in limit generation is transformed to a new one by using selection, crossover and mutation, which can ensure individual diversity and make full use of prior information for improving the global search ability of the algorithm. The two improvements of ABC algorithm are proved to be effective via a classical numeral example at last. Among which the genetic operator for the promotion of the ABC algorithm’s performance is significant. The results are also compared with those of other state-of-the-art algorithms, the enhanced ABC algorithm has general advantages in minimum cost, average cost and maximum cost which shows its usability and effectiveness. The achievements in this paper provide a new method for solving the DHTS problems, and also offer a novel reference for the improvement of mechanism and the application of algorithms. [ABSTRACT FROM AUTHOR]

With the development of computer network bandwidth, packet classification algorithms which are able to deal with large-scale rule sets are in urgent need. Among the existing algorithms, researches on packet classification algorithms based on hierarchical trie have become an important packet classification research branch because of their widely practical use. Although hierarchical trie is beneficial to save large storage space, it has several shortcomings such as the existence of backtracking and empty nodes. This paper proposes a new packet classification algorithm, Hierarchical Trie Algorithm Based on Expectation-Maximization Clustering (HTEMC). Firstly, this paper uses the formalization method to deal with the packet classification problem by means of mapping the rules and data packets into a two-dimensional space. Secondly, this paper uses expectation-maximization algorithm to cluster the rules based on their aggregate characteristics, and thereby diversified clusters are formed. Thirdly, this paper proposes a hierarchical trie based on the results of expectation-maximization clustering. Finally, this paper respectively conducts simulation experiments and real-environment experiments to compare the performances of our algorithm with other typical algorithms, and analyzes the results of the experiments. The hierarchical trie structure in our algorithm not only adopts trie path compression to eliminate backtracking, but also solves the problem of low efficiency of trie updates, which greatly improves the performance of the algorithm. [ABSTRACT FROM AUTHOR]

Multi-robot task allocation is one of the main problems to address in order to design a multi-robot system, very especially when robots form coalitions that must carry out tasks before a deadline. A lot of factors affect the performance of these systems and among them, this paper is focused on the physical interference effect, produced when two or more robots want to access the same point simultaneously. To our best knowledge, this paper presents the first formal description of multi-robot task allocation that includes a model of interference. Thanks to this description, the complexity of the allocation problem is analyzed. Moreover, the main contribution of this paper is to provide the conditions under which the optimal solution of the aforementioned allocation problem can be obtained solving an integer linear problem. The optimal results are compared to previous allocation algorithms already proposed by the first two authors of this paper and with a new method proposed in this paper. The results obtained show how the new task allocation algorithms reach up more than an 80% of the median of the optimal solution, outperforming previous auction algorithms with a huge reduction of the execution time. [ABSTRACT FROM AUTHOR]

Traffic assignment and management objectives are considered as two significant parts in developing the emergency evacuation plan, which can directly influence the evacuation performance and efficiency. From the perspective of disaster response operators, the evacuation objective frequently is to minimize the total evacuation time to reduce losses, which may lead to an unreasonable and unfair phenomenon where people in highest risk areas may be forced to sacrifice their priorities of evacuation to improve the system evacuation efficiency. In this paper, considering both efficiency and social fairness in emergency evacuation, a weight function consisting of risk evaluation index as variable and the emphasis degree of managers on social fairness principle as coefficient was initially proposed and embedded in system optimal (SO) objective function. Combining the weight function and other constraints based on an extended cell transmission model (CTM), the linear program (LP) model was established to realize the simulation of dynamic traffic assignment in emergency evacuation. Employing this model, the impact of the management strategy of balancing both efficiency and social fairness on evacuation results was studied in the “Tianjin Explosions” case. In the end, the conclusion of “balancing social fairness is valuable during evacuation” was obtained. [ABSTRACT FROM AUTHOR]

In the context of generalized linear models (GLMs), interactions are automatically induced on the natural scale of the data. The conventional approach to measuring effects in GLMs based on significance testing (e.g. the Wald test or using deviance to assess model fit) is not always appropriate. The objective of this paper is to demonstrate the limitations of these conventional approaches and to explore alternative strategies for determining the importance of effects. The paper compares four approaches to determining the importance of effects in the GLM using 1) the Wald statistic, 2) change in deviance (model fitting criteria), 3) Bayesian GLM using vaguely informative priors and 4) Bayesian Model Averaging analysis. The main points in this paper are illustrated using an example study, which examines the risk factors for cyber abuse victimization, and are further examined using a simulation study. Analysis of our example dataset shows that, in terms of a logistic GLM, the conventional methods using the Wald test and the change in deviance can produce results that are difficult to interpret; Bayesian analysis of GLM is a suitable alternative, which is enhanced with prior knowledge about the direction of the effects; and Bayesian Model Averaging (BMA) is especially suited for new areas of research, particularly in the absence of theory. We recommend that social scientists consider including BMA in their standard toolbox for analysis of GLMs. [ABSTRACT FROM AUTHOR]

Radio propagation prediction simulation methods based on deterministic technique such as ray launching is extensively used to accomplish radio channel characterization. However, the superiority of the simulation depends on the number of rays launched and received. This paper presented the indoor three-dimensional (3D) Minimum Ray Launching Maximum Accuracy (MRLMA) technique, which is applicable for an efficient indoor radio wave propagation prediction. Utilizing the novel MRLMA technique in the simulation environment for ray lunching and tracing can drastically reduce the number of rays that need to be traced, and improve the efficiency of ray tracing. Implementation and justification of MRLMA presented in the paper. An indoor office 3D layouts are selected and simulations have been performed using the MRLMA and other reference techniques. Results showed that the indoor 3D MRLMA model is appropriate for wireless communications network systems design and optimization process with respect to efficiency, coverage, number of rays launching, number of rays received by the mobile station, and simulation time. [ABSTRACT FROM AUTHOR]

Distance sampling is a technique for estimating the abundance of animals or other objects in a region, allowing for imperfect detection. This paper evaluates the statistical efficiency of the method when its assumptions are met, both theoretically and by simulation. The theoretical component of the paper is a derivation of the asymptotic variance penalty for the distance sampling estimator arising from uncertainty about the unknown detection parameters. This asymptotic penalty factor is tabulated for several detection functions. It is typically at least 2 but can be much higher, particularly for steeply declining detection rates. The asymptotic result relies on a model which makes the strong assumption that objects are uniformly distributed across the region. The simulation study relaxes this assumption by incorporating over-dispersion when generating object locations. Distance sampling and strip transect estimators are calculated for simulated data, for a variety of overdispersion factors, detection functions, sample sizes and strip widths. The simulation results confirm the theoretical asymptotic penalty in the non-overdispersed case. For a more realistic overdispersion factor of 2, distance sampling estimation outperforms strip transect estimation when a half-normal distance function is correctly assumed, confirming previous literature. When the hazard rate model is correctly assumed, strip transect estimators have lower mean squared error than the usual distance sampling estimator when the strip width is close enough to its optimal value (± 75% when there are 100 detections; ± 50% when there are 200 detections). Whether the ecologist can set the strip width sufficiently accurately will depend on the circumstances of each particular study. [ABSTRACT FROM AUTHOR]

Penalized selection criteria like AIC or BIC are among the most popular methods for variable selection. Their theoretical properties have been studied intensively and are well understood, but making use of them in case of high-dimensional data is difficult due to the non-convex optimization problem induced by L0 penalties. In this paper we introduce an adaptive ridge procedure (AR), where iteratively weighted ridge problems are solved whose weights are updated in such a way that the procedure converges towards selection with L0 penalties. After introducing AR its specific shrinkage properties are studied in the particular case of orthogonal linear regression. Based on extensive simulations for the non-orthogonal case as well as for Poisson regression the performance of AR is studied and compared with SCAD and adaptive LASSO. Furthermore an efficient implementation of AR in the context of least-squares segmentation is presented. The paper ends with an illustrative example of applying AR to analyze GWAS data. [ABSTRACT FROM AUTHOR]

In the theory of belief functions, the approximation of a basic belief assignment (BBA) is for reducing the high computational cost especially when large number of focal elements are available. In traditional BBA approximation approaches, a focal element’s own characteristics such as the mass assignment and the cardinality, are usually used separately or jointly as criteria for the removal of focal elements. Besides the computational cost, the distance between the original BBA and the approximated one is also concerned, which represents the loss of information in BBA approximation. In this paper, an iterative approximation approach is proposed based on maximizing the closeness, i.e., minimizing the distance between the approximated BBA in current iteration and the BBA obtained in the previous iteration, where one focal element is removed in each iteration. The iteration stops when the desired number of focal elements is reached. The performance evaluation approaches for BBA approximations are also discussed and used to compare and evaluate traditional BBA approximations and the newly proposed one in this paper, which include traditional time-based way, closeness-based way and new proposed ones. Experimental results and related analyses are provided to show the rationality and efficiency of our proposed new BBA approximation. [ABSTRACT FROM AUTHOR]

We present a finite difference time domain (FDTD) model for computation of A line scans in time domain optical coherence tomography (OCT). The OCT output signal is created using two different simulations for the reference and sample arms, with a successive computation of the interference signal with external software. In this paper we present the model applied to two different samples: a glass rod filled with water-sucrose solution at different concentrations and a peripheral nerve. This work aims to understand to what extent time domain OCT can be used for non-invasive, direct optical monitoring of peripheral nerve activity. [ABSTRACT FROM AUTHOR]

This paper investigates an improved genetic algorithm on multiple automated guided vehicle (multi-AGV) path planning. The innovations embody in two aspects. First, three-exchange crossover heuristic operators are used to produce more optimal offsprings for getting more information than with the traditional two-exchange crossover heuristic operators in the improved genetic algorithm. Second, double-path constraints of both minimizing the total path distance of all AGVs and minimizing single path distances of each AGV are exerted, gaining the optimal shortest total path distance. The simulation results show that the total path distance of all AGVs and the longest single AGV path distance are shortened by using the improved genetic algorithm. [ABSTRACT FROM AUTHOR]

This paper proposed a method to update the on-line health reference baseline of the On-Board Engine Model (OBEM) to maintain the effectiveness of an in-flight aircraft sensor Fault Detection and Isolation (FDI) system, in which a Hybrid Kalman Filter (HKF) was incorporated. Generated from a rapid in-flight engine degradation, a large health condition mismatch between the engine and the OBEM can corrupt the performance of the FDI. Therefore, it is necessary to update the OBEM online when a rapid degradation occurs, but the FDI system will lose estimation accuracy if the estimation and update are running simultaneously. To solve this problem, the health reference baseline for a nonlinear OBEM was updated using the proposed channel controller method. Simulations based on the turbojet engine Linear-Parameter Varying (LPV) model demonstrated the effectiveness of the proposed FDI system in the presence of substantial degradation, and the channel controller can ensure that the update process finishes without interference from a single sensor fault. [ABSTRACT FROM AUTHOR]

Recently the integrated modular avionics (IMA) architecture has been widely adopted by the avionics industry due to its strong partition mechanism. Although the IMA architecture can achieve effective cost reduction and reliability enhancement in the development of avionics systems, it results in a complex allocation and scheduling problem. All partitions in an IMA system should be integrated together according to a proper schedule such that their deadlines will be met even under the worst case situations. In order to help provide a proper scheduling table for all partitions in IMA systems, we study the schedulability of independent partitions on a multiprocessor platform in this paper. We firstly present an exact formulation to calculate the maximum scaling factor and determine whether all partitions are schedulable on a limited number of processors. Then with a Game Theory analogy, we design an approximation algorithm to solve the scheduling problem of partitions, by allowing each partition to optimize its own schedule according to the allocations of the others. Finally, simulation experiments are conducted to show the efficiency and reliability of the approach proposed in terms of time consumption and acceptance ratio. [ABSTRACT FROM AUTHOR]

Generating synthetic baseline populations is a fundamental step of agent-based modeling and simulation, which is growing fast in a wide range of socio-economic areas including transportation planning research. Traditionally, in many commercial and non-commercial microsimulation systems, the iterative proportional fitting (IPF) procedure has been used for creating the joint distribution of individuals when combining a reference joint distribution with target marginal distributions. Although IPF is simple, computationally efficient, and rigorously founded, it is unclear whether IPF well preserves the dependence structure of the reference joint table sufficiently when fitting it to target margins. In this paper, a novel method is proposed based on the copula concept in order to provide an alternative approach to the problem that IPF resolves. The dependency characteristic measures were computed and the results from the proposed method and IPF were compared. In most test cases, the proposed method outperformed IPF in preserving the dependence structure of the reference joint distribution. [ABSTRACT FROM AUTHOR]

Simulation has become an indispensable tool in the design and evaluation of mobile systems. By using mobility models that describe constituent movement, one can explore large systems, producing repeatable results for comparison between alternatives. In this paper, we show that a large class of mobility models—including all those in which nodal speed and distance or destination are chosen independently—have a transient period in which the average node speed decreases until converging to some long-term average. This speed decay provides an unsound basis for simulation studies that collect results averaged over time, complicating the experimental process. In this paper, we derive a general framework for describing this decay and apply it to a number of cases. Furthermore, this framework allows us to transform a given mobility model into a stationary one by initializing the simulation using the steady-state speed distribution and using the original speed distribution subsequently. This transformation completely eliminates the transient period and the decay in average node speed and, thus, provides sound models for the simulation of mobile systems. [ABSTRACT FROM AUTHOR]

Information carried by an image can be distorted due to different image processing steps introduced by different electronic means of storage and communication. Therefore, development of algorithms which can automatically assess a quality of the image in a way that is consistent with human evaluation is important. In this paper, an approach to image quality assessment (IQA) is proposed in which the quality of a given image is evaluated jointly by several IQA approaches. At first, in order to obtain such joint models, an optimisation problem of IQA measures aggregation is defined, where a weighted sum of their outputs, i.e., objective scores, is used as the aggregation operator. Then, the weight of each measure is considered as a decision variable in a problem of minimisation of root mean square error between obtained objective scores and subjective scores. Subjective scores reflect ground-truth and involve evaluation of images by human observers. The optimisation problem is solved using a genetic algorithm, which also selects suitable measures used in aggregation. Obtained multimeasures are evaluated on four largest widely used image benchmarks and compared against state-of-the-art full-reference IQA approaches. Results of comparison reveal that the proposed approach outperforms other competing measures. [ABSTRACT FROM AUTHOR]

In this paper, we introduce the R package gendist that computes the probability density function, the cumulative distribution function, the quantile function and generates random values for several generated probability distribution models including the mixture model, the composite model, the folded model, the skewed symmetric model and the arc tan model. These models are extensively used in the literature and the R functions provided here are flexible enough to accommodate various univariate distributions found in other R packages. We also show its applications in graphing, estimation, simulation and risk measurements. [ABSTRACT FROM AUTHOR]

Objective: To characterize the impact of widespread inventory management policies on stock-outs of essential drugs in Zambia’s health clinics and develop related recommendations. Methods: Daily clinic storeroom stock levels of artemether-lumefantrine (AL) products in 2009–2010 were captured in 145 facilities through photography and manual transcription of paper forms, then used to determine historical stock-out levels and estimate demand patterns. Delivery lead-times and estimates of monthly facility accessibility were obtained through worker surveys. A simulation model was constructed and validated for predictive accuracy against historical stock-outs, then used to evaluate various changes potentially affecting product availability. Findings: While almost no stock-outs of AL products were observed during Q4 2009 consistent with primary analysis, up to 30% of surveyed facilities stocked out of some AL product during Q1 2010 despite ample inventory being simultaneously available at the national warehouse. Simulation experiments closely reproduced these results and linked them to the use of average past monthly issues and failure to capture lead-time variability in current inventory control policies. Several inventory policy enhancements currently recommended by USAID | DELIVER were found to have limited impact on product availability. Conclusions: Inventory control policies widely recommended and used for distributing medicines in sub-Saharan Africa directly account for a substantial fraction of stock-outs observed in common situations involving demand seasonality and facility access interruptions. Developing central capabilities in peripheral demand forecasting and inventory control is critical. More rigorous independent peer-reviewed research on pharmaceutical supply chain management in low-income countries is needed. [ABSTRACT FROM AUTHOR]

As defined by IEEE 802.15.6 standard, channel sharing is a potential method to coordinate inter-network interference among Medical Body Area Networks (MBANs) that are close to one another. However, channel sharing opens up new vulnerabilities as selfish MBANs may manipulate their online channel requests to gain unfair advantage over others. In this paper, we address this issue by proposing a truthful online channel sharing algorithm and a companion protocol that allocates channel efficiently and truthfully by punishing MBANs for misreporting their channel request parameters such as time, duration and bid for the channel. We first present an online channel sharing scheme for unit-length channel requests and prove that it is truthful. We then generalize our model to settings with variable-length channel requests, where we propose a critical value based channel pricing and preemption scheme. A bid adjustment procedure prevents unbeneficial preemption by artificially raising the ongoing winner’s bid controlled by a penalty factor λ. Our scheme can efficiently detect selfish behaviors by monitoring a trust parameter α of each MBAN and punish MBANs from cheating by suspending their requests. Our extensive simulation results show our scheme can achieve a total profit that is more than 85% of the offline optimum method in the typical MBAN settings. [ABSTRACT FROM AUTHOR]

Background: System science approaches are increasingly used to explore complex public health problems. Quantitative methods, such as participatory dynamic simulation modelling, can mobilise knowledge to inform health policy decisions. However, the analytic and practical steps required to turn collaboratively developed, qualitative system maps into rigorous and policy-relevant quantified dynamic simulation models are not well described. This paper reports on the processes, interactions and decisions that occurred at the interface between modellers and end-user participants in an applied health sector case study focusing on diabetes in pregnancy. Methods: An analysis was conducted using qualitative data from a participatory dynamic simulation modelling case study in an Australian health policy setting. Recordings of participatory model development workshops and subsequent meetings were analysed and triangulated with field notes and other written records of discussions and decisions. Case study vignettes were collated to illustrate the deliberations and decisions made throughout the model development process. Results: The key analytic objectives and decision-making processes included: defining the model scope; analysing and refining the model structure to maximise local relevance and utility; reviewing and incorporating evidence to inform model parameters and assumptions; focusing the model on priority policy questions; communicating results and applying the models to policy processes. These stages did not occur sequentially; the model development was cyclical and iterative with decisions being re-visited and refined throughout the process. Storytelling was an effective strategy to both communicate and resolve concerns about the model logic and structure, and to communicate the outputs of the model to a broader audience. Conclusion: The in-depth analysis reported here examined the application of participatory modelling methods to move beyond qualitative conceptual mapping to the development of a rigorously quantified and policy relevant, complex dynamic simulation model. The analytic objectives and decision-making themes identified provide guidance for interpreting, understanding and reporting future participatory modelling projects and methods. [ABSTRACT FROM AUTHOR]

Among traditional Light Detection And Ranging (LIDAR) data representations such as raster grid, triangulated irregular network, point clouds and octree, the explicit 3D nature of voxel-based representation makes it a promising alternative. Despite the benefit of voxel-based representation, voxel-based algorithms have rarely been used for building detection. In this paper, a voxel segmentation-based 3D building detection algorithm is developed for separating building and nonbuilding voxels. The proposed algorithm first voxelizes the LIDAR point cloud into a grayscale voxel structure in which the grayscale of the voxel corresponds to the quantized mean intensity of the LIDAR points within the voxel. The voxelized dataset is segmented into multiple 3D-connected regions depending on the connectivity and grayscale similarity among voxels. The 3D-connected regions corresponding to the building roof and facade are detected sequentially according to characteristics such as their area, density, elevation difference and location. The obtained results for the detected buildings are evaluated by the LIDAR data provided by working group III/4 of ISPRS, which demonstrate a high rate of success. Average completeness, correctness, quality, and kappa coefficient indexes values of 90.0%, 96.0%, 88.1% and 88.7%, respectively, are obtained for buildings. [ABSTRACT FROM AUTHOR]

The current marketing landscape, apart from conventional approaches, consists of campaigns designed especially for launching information diffusion processes within online networks. Associated research is focused on information propagation models, campaign initialization strategies and factors affecting campaign dynamics. In terms of algorithms and performance evaluation, the final coverage represented by the fraction of activated nodes within a target network is usually used. It is not necessarily consistent with the real marketing campaigns using various characteristics and parameters related to coverage, costs, behavioral patterns and time factors for overall evaluation. This paper presents assumptions for a decision support system for multi-criteria campaign planning and evaluation with inputs from agent-based simulations. The results, which are delivered from a simulation model based on synthetic networks in a form of decision scenarios, are verified within a real network. Last, but not least, the study proposes a multi-objective campaign evaluation framework with several campaign evaluation metrics integrated. The results showed that the recommendations generated with the use of synthetic networks applied to real networks delivered results according to the decision makers’ expectation in terms of the used evaluation criteria. Apart from practical applications, the proposed multi-objective approach creates new evaluation possibilities for theoretical studies focused on information spreading processes within complex networks. [ABSTRACT FROM AUTHOR]

The objective of this study is to establish a framework for analyzing infrastructure dynamics affecting the long-term steady state, and hence resilience in civil infrastructure systems. To this end, a multi-agent simulation model was created to capture important phenomena affecting the dynamics of coupled human-infrastructure systems and model the long-term performance regimes of infrastructure. The proposed framework captures the following three factors that shape the dynamics of coupled human-infrastructure systems: (i) engineered physical infrastructure; (ii) human actors; and (iii) chronic and acute stressors. A complex system approach was adopted to examine the long-term resilience of infrastructure based on the understanding of performance regimes, as well as tipping points at which shifts in the performance regime of infrastructure occur under the impact of external stressors and/or change in internal dynamics. The application of the proposed framework is demonstrated in a case of urban water distribution infrastructure using the data from a numerical case study network. The developed multi-agent simulation model was then used in examining the system resilience over a 100-year horizon under stressors such as population change and funding constraints. The results identified the effects of internal dynamics and external stressors on the resilience landscape of infrastructure systems. Furthermore, the results also showed the capability of the framework in capturing and simulating the underlying mechanisms affecting human-infrastructure dynamics, as well as long-term regime shifts and tipping point behaviors. Therefore, the integrated framework proposed in this paper enables building complex system-based theories for a more advanced understanding of civil infrastructure resilience. [ABSTRACT FROM AUTHOR]

Background: Micro-simulation models of risk-factors and chronic diseases are built increasingly often, and each model starts with an initial population. Constructing such populations when no survey data covering all variables are available is no trivial task, often requiring complex methods based on several (untested) assumptions. In this paper, we propose a method for evaluating the merits of construction methods, and apply this to one specific method: the construction method used in the DYNAMO-HIA model. Methods: The initial population constructed using the DYNAMO-HIA method is compared to another population constructed by starting a simulation with only newborns and simulating the course taken by one risk-factor and several diseases. In this simulation, the age- and sex-specific prevalence of the risk-factor is kept constant over time. Results: Our simulations show that, in general, the DYNAMO-HIA method clearly outperforms a method that assumes independence of the risk-factor and the prevalence of diseases and independence between all diseases. In many situations the DYNAMO-HIA method performs reasonably well, but in some the proportion with the risk-factor for those with a disease is under- or overestimated by as much as 10 percentage points. For determining comorbidity between diseases linked by a common causal disease or a common risk-factor it also performs reasonably well. However, the current method performs poorly for determining the comorbidity between one disease caused by the other. Conclusion: The DYNAMO-HIA methods perform reasonably well; they outperform a baseline assumption of independence between the risk-factor and diseases in the initial population. The method for determining the comorbidity between diseases that are causally linked needs improvement. Given the existing discrepancies for situations with high relative risks, however, developing more elaborate methods based on running simulation models to generate an initial population would be worthwhile. [ABSTRACT FROM AUTHOR]

The viral spread of digital misinformation has become so severe that the World Economic Forum considers it among the main threats to human society. This spread have been suggested to be related to the similarly problematized phenomenon of “echo chambers”, but the causal nature of this relationship has proven difficult to disentangle due to the connected nature of social media, whose causality is characterized by complexity, non-linearity and emergence. This paper uses a network simulation model to study a possible relationship between echo chambers and the viral spread of misinformation. It finds an “echo chamber effect”: the presence of an opinion and network polarized cluster of nodes in a network contributes to the diffusion of complex contagions, and there is a synergetic effect between opinion and network polarization on the virality of misinformation. The echo chambers effect likely comes from that they form the initial bandwagon for diffusion. These findings have implication for the study of the media logic of new social media. [ABSTRACT FROM AUTHOR]

Work spaces for assembly or maintenance operations are considered in the design stage of products. Maintenance space is a key factor in determining how well a product can be maintained. If the work space is sufficiently considered in the design stage, it will benefit both the user and the maintainer. From a maintenance perspective, this paper proposes a quantitative method to evaluate the maintenance space by virtual simulation and consideration of ergonomics. In this method, maintenance operations are concisely classified into three types. Based on the virtual simulation of the maintenance process and maintainer data, the swept volume of a hand is built using envelope theory. The operation range of the maintainer is derived by establishing a mathematical model for the upper limb. Combining the swept volume and operation range, the maintenance space can be quantitatively evaluated. A concise validation demonstrates that the proposed method is effective for evaluating the maintenance space to improve the space design. The proposed method could be applied to the space design of a complex product. [ABSTRACT FROM AUTHOR]

This paper proposes a discrete particle model based on the random-walk theory for simulating cement infiltration within open-cell structures to prevent osteoporotic proximal femur fractures. Model parameters consider the cement viscosity (high and low) and the desired direction of injection (vertical and diagonal). In vitro and in silico characterizations of augmented open-cell structures validated the computational model and quantified the improved mechanical properties (Young’s modulus) of the augmented specimens. The cement injection pattern was successfully predicted in all the simulated cases. All the augmented specimens exhibited enhanced mechanical properties computationally and experimentally (maximum improvements of 237.95 ± 12.91% and 246.85 ± 35.57%, respectively). The open-cell structures with high porosity fraction showed a considerable increase in mechanical properties. Cement augmentation in low porosity fraction specimens resulted in a lesser increase in mechanical properties. The results suggest that the proposed discrete particle model is adequate for use as a femoroplasty planning framework. [ABSTRACT FROM AUTHOR]

There is a current interest in quantifying time-varying connectivity (TVC) based on neuroimaging data such as fMRI. Many methods have been proposed, and are being applied, revealing new insight into the brain’s dynamics. However, given that the ground truth for TVC in the brain is unknown, many concerns remain regarding the accuracy of proposed estimates. Since there exist many TVC methods it is difficult to assess differences in time-varying connectivity between studies. In this paper, we present tvc_benchmarker, which is a Python package containing four simulations to test TVC methods. Here, we evaluate five different methods that together represent a wide spectrum of current approaches to estimating TVC (sliding window, tapered sliding window, multiplication of temporal derivatives, spatial distance and jackknife correlation). These simulations were designed to test each method’s ability to track changes in covariance over time, which is a key property in TVC analysis. We found that all tested methods correlated positively with each other, but there were large differences in the strength of the correlations between methods. To facilitate comparisons with future TVC methods, we propose that the described simulations can act as benchmark tests for evaluation of methods. Using tvc_benchmarker researchers can easily add, compare and submit their own TVC methods to evaluate its performance. [ABSTRACT FROM AUTHOR]

Ellipse fitting is a highly researched and mature topic. Surprisingly, however, no existing method has thus far considered the data point eccentricity in its ellipse fitting procedure. Here, we introduce the concept of eccentricity of a data point, in analogy with the idea of ellipse eccentricity. We then show empirically that, irrespective of ellipse fitting method used, the root mean square error (RMSE) of a fit increases with the eccentricity of the data point set. The main contribution of the paper is based on the hypothesis that if the data point set were pre-processed to strategically add additional data points in regions of high eccentricity, then the quality of a fit could be improved. Conditional validity of this hypothesis is demonstrated mathematically using a model scenario. Based on this confirmation we propose an algorithm that pre-processes the data so that data points with high eccentricity are replicated. The improvement of ellipse fitting is then demonstrated empirically in real-world application of 3D reconstruction of a plant root system for phenotypic analysis. The degree of improvement for different underlying ellipse fitting methods as a function of data noise level is also analysed. We show that almost every method tested, irrespective of whether it minimizes algebraic error or geometric error, shows improvement in the fit following data augmentation using the proposed pre-processing algorithm. [ABSTRACT FROM AUTHOR]

This paper proposes a novel approach that uses meteorological information to predict the incidence of influenza in Galicia (Spain). It extends the Generalized Least Squares (GLS) methods in the multivariate framework to functional regression models with dependent errors. These kinds of models are useful when the recent history of the incidence of influenza are readily unavailable (for instance, by delays on the communication with health informants) and the prediction must be constructed by correcting the temporal dependence of the residuals and using more accessible variables. A simulation study shows that the GLS estimators render better estimations of the parameters associated with the regression model than they do with the classical models. They obtain extremely good results from the predictive point of view and are competitive with the classical time series approach for the incidence of influenza. An iterative version of the GLS estimator (called iGLS) was also proposed that can help to model complicated dependence structures. For constructing the model, the distance correlation measure was employed to select relevant information to predict influenza rate mixing multivariate and functional variables. These kinds of models are extremely useful to health managers in allocating resources in advance to manage influenza epidemics. [ABSTRACT FROM AUTHOR]

Spatial correlation between densely deployed sensor nodes in a wireless sensor network (WSN) can be exploited to reduce the power consumption through a proper source coding mechanism such as distributed source coding (DSC). In this paper, we propose the Decoding Delay-based Distributed Source Coding (D-DSC) to improve the energy efficiency of the classical DSC by employing the decoding delay concept which enables the use of the maximum correlated portion of sensor samples during the event estimation. In D-DSC, network is partitioned into clusters, where the clusterheads communicate their uncompressed samples carrying the side information, and the cluster members send their compressed samples. Sink performs joint decoding of the compressed and uncompressed samples and then reconstructs the event signal using the decoded sensor readings. Based on the observed degree of the correlation among sensor samples, the sink dynamically updates and broadcasts the varying compression rates back to the sensor nodes. Simulation results for the performance evaluation reveal that D-DSC can achieve reliable and energy-efficient event communication and estimation for practical signal detection/estimation applications having massive number of sensors towards the realization of Internet of Sensing Things (IoST). [ABSTRACT FROM AUTHOR]

In this work, a swarm behaviour for multi-rotor Unmanned Aerial Vehicles (UAVs) deployment will be presented. The main contribution of this behaviour is the use of a virtual device for quantitative sematectonic stigmergy providing more adaptable behaviours in complex environments. It is a fault tolerant highly robust behaviour that does not require prior information of the area to be covered, or to assume the existence of any kind of information signals (GPS, mobile communication networks …), taking into account the specific features of UAVs. This behaviour will be oriented towards emergency tasks. Their main goal will be to cover an area of the environment for later creating an ad-hoc communication network, that can be used to establish communications inside this zone. Although there are several papers on robotic deployment it is more difficult to find applications with UAV systems, mainly because of the existence of various problems that must be overcome including limitations in available sensory and on-board processing capabilities and low flight endurance. In addition, those behaviours designed for UAVs often have significant limitations on their ability to be used in real tasks, because they assume specific features, not easily applicable in a general way. Firstly, in this article the characteristics of the simulation environment will be presented. Secondly, a microscopic model for deployment and creation of ad-hoc networks, that implicitly includes stigmergy features, will be shown. Then, the overall swarm behaviour will be modeled, providing a macroscopic model of this behaviour. This model can accurately predict the number of agents needed to cover an area as well as the time required for the deployment process. An experimental analysis through simulation will be carried out in order to verify our models. In this analysis the influence of both the complexity of the environment and the stigmergy system will be discussed, given the data obtained in the simulation. In addition, the macroscopic and microscopic models will be compared verifying the number of predicted individuals for each state regarding the simulation. [ABSTRACT FROM AUTHOR]

Reactive navigation is a well-known paradigm for controlling an autonomous mobile robot, which suggests making all control decisions through some light processing of the current/recent sensor data. Among the many advantages of this paradigm are: 1) the possibility to apply it to robots with limited and low-priced hardware resources, and 2) the fact of being able to safely navigate a robot in completely unknown environments containing unpredictable moving obstacles. As a major disadvantage, nevertheless, the reactive paradigm may occasionally cause robots to get trapped in certain areas of the environment—typically, these conflicting areas have a large concave shape and/or are full of closely-spaced obstacles. In this last respect, an enormous effort has been devoted to overcome such a serious drawback during the last two decades. As a result of this effort, a substantial number of new approaches for reactive navigation have been put forward. Some of these approaches have clearly improved the way how a reactively-controlled robot can move among densely cluttered obstacles; some other approaches have essentially focused on increasing the variety of obstacle shapes and sizes that could be successfully circumnavigated; etc. In this paper, as a starting point, we choose the best existing reactive approach to move in densely cluttered environments, and we also choose the existing reactive approach with the greatest ability to circumvent large intricate-shaped obstacles. Then, we combine these two approaches in a way that makes the most of them. From the experimental point of view, we use both simulated and real scenarios of challenging complexity for testing purposes. In such scenarios, we demonstrate that the combined approach herein proposed clearly outperforms the two individual approaches on which it is built. [ABSTRACT FROM AUTHOR]

In this paper we evaluate the three main methods for correcting the susceptibility-induced artefact in diffusion-weighted magnetic-resonance (DW-MR) data, and assess how correction is affected by the susceptibility field’s interaction with motion. The susceptibility artefact adversely impacts analysis performed on the data and is typically corrected in post-processing. Correction strategies involve either registration to a structural image, the application of an acquired field-map or the use of additional images acquired with different phase-encoding. Unfortunately, the choice of which method to use is made difficult by the absence of any systematic comparisons of them. In this work we quantitatively evaluate these methods, by extending and employing a recently proposed framework that allows for the simulation of realistic DW-MR datasets with artefacts. Our analysis separately evaluates the ability for methods to correct for geometric distortions and to recover lost information in regions of signal compression. In terms of geometric distortions, we find that registration-based methods offer the poorest correction. Field-mapping techniques are better, but are influenced by noise and partial volume effects, whilst multiple phase-encode methods performed best. We use our simulations to validate a popular surrogate metric of correction quality, the comparison of corrected data acquired with AP and LR phase-encoding, and apply this surrogate to real datasets. Furthermore, we demonstrate that failing to account for the interaction of the susceptibility field with head movement leads to increased errors when analysing DW-MR data. None of the commonly used post-processing methods account for this interaction, and we suggest this may be a valuable area for future methods development. [ABSTRACT FROM AUTHOR]

Haptics applications such as surgery simulations require collision detections that are more precise than others. An efficient collision detection method based on the clustering of bounding spheres was proposed in our prior study. This paper analyzes and compares the applied effects of the five most common subdivision surface methods on some 3D models for haptic collision detection. The five methods are Butterfly, Catmull-Clark, Mid-point, Loop, and LS3 (Least Squares Subdivision Surface). After performing a number of experiments, we have concluded that LS3 method is the most appropriate for haptic simulations. The more we applied surface subdivision, the more the collision detection results became precise. However, it is observed that the performance becomes better until a certain threshold and degrades afterward. In order to reduce the performance degradation, we adopted our prior work, which was the fast and precise collision detection method based on adaptive clustering. As a result, we obtained a notable improvement of the speed of collision detection. [ABSTRACT FROM AUTHOR]

This paper explores how information flow properties of a network affect the formation of categories shared between individuals, who are communicating through that network. Our work is based on the established multi-agent model of the emergence of linguistic categories grounded in external environment. We study how network information propagation efficiency and the direction of information flow affect categorization by performing simulations with idealized network topologies optimizing certain network centrality measures. We measure dynamic social adaptation when either network topology or environment is subject to change during the experiment, and the system has to adapt to new conditions. We find that both decentralized network topology efficient in information propagation and the presence of central authority (information flow from the center to peripheries) are beneficial for the formation of global agreement between agents. Systems with central authority cope well with network topology change, but are less robust in the case of environment change. These findings help to understand which network properties affect processes of social adaptation. They are important to inform the debate on the advantages and disadvantages of centralized systems. [ABSTRACT FROM AUTHOR]

In this paper, an adaptive fuzzy sliding mode controller is proposed to control a two-stage single-phase photovoltaic (PV) grid-connected inverter. Two key technologies are discussed in the presented PV system. An incremental conductance method with adaptive step is adopted to track the maximum power point (MPP) by controlling the duty cycle of the controllable power switch of the boost DC-DC converter. An adaptive fuzzy sliding mode controller with an integral sliding surface is developed for the grid-connected inverter where a fuzzy system is used to approach the upper bound of the system nonlinearities. The proposed strategy has strong robustness for the sliding mode control can be designed independently and disturbances can be adaptively compensated. Simulation results of a PV grid-connected system verify the effectiveness of the proposed method, demonstrating the satisfactory robustness and performance. [ABSTRACT FROM AUTHOR]

Solid waste management is a significant issue for sustainable development that involves the technical, socioeconomic, legal, ecological, political, and even cultural components. For this reason, systems analysis has been uniquely providing interdisciplinary support for policy analysis and decision making in solid waste management for the last few decades. Considering these challenges and accomplishments retrospectively, this paper presents a thorough literature review and in-depth discussions of systems analysis models that are promising for providing forward-looking, cost-effective, risk-informed, and environmentally benign decisions for sustainable solid waste management. To simplify the discussion, the spectrum of these systems analysis models was divided into three broadly based domains associated with fourteen categories, although some of them may be intertwined with each other. The first domain comprises systems engineering models including cost-benefit analysis, forecasting analysis, simulation analysis, optimization analysis, and integrated modeling system; the second domain introduces systems analysis platforms, such as management information systems/decision support systems/expert systems; and the third domain introduces system assessment tools including scenario development, material flow analysis, life-cycle assessment, risk assessment, environmental impact assessment, strategic environmental assessment, socioeconomic assessment, and sustainable assessment. While some models or tools may be elucidated with respect to multiple managerial purposes, such as integrated modeling system and sustainable assessment, others may cover extended foci of market-based instruments and regulatory requirements, such as socioeconomic assessment and environmental impact assessment. The authors use the term systems analysis as a placeholder for the disparate strands of research and practice at this intersection between environmental systems engineering and sustainability science. Given that the sustainable management is necessary at all phases of impact from the interactions among several prescribed paradigms, current and future solid waste management strategies in relation to systems analysis were particularly discussed. Such a critical review paper may aid the prediction of the possible challenges and the preparation of the appropriate tactics in dealing with large-scale complex solid waste management systems under normal operation and special conditions. It should lead the authors to echo some of their real world observational evidence in terms of cost-benefit-risk trade-off in decision analysis for solid waste management. [ABSTRACT FROM AUTHOR]

Some frame components, such as SYNC (frame synchronization) and RTS/CTS (Ready to Send/Clear to Send), are not taken into consideration when the traditional setting strategies conduct the optimization of SMAC (Sensor MAC) contention window size. This paper proposes mathematical models that allow the analysis of data packets forwarding delay within one SMAC virtual cluster. Simulation results in OMNeT++ show good agreements with the proposed mathematical models, validating the models’ correctness. The curve analyses of the models confirm the existence of delay-optimization-oriented contention window size that is closely related to the number of simultaneously contending nodes. Afterwards, it is shown that SYNC, RTS/CTS and EIFS (Extended InterFrame Space) have impacts on the optimal contention window size and expected delivery delay to various degrees, as well as throughput and energy efficiency. One ideal setting strategy of delay-optimization-oriented SMAC contention window size requires the combination of the network scale, SYNC, RTS/CTS and EIFS. Additionally, it is demonstrated that the proposed setting strategy makes contributions to the improvement in the existing SMAC extensions when they are integrated with each other, in terms of the end-to-end delay, throughput and energy consumption. [ABSTRACT FROM AUTHOR]

In this paper we consider the problem of restoration of a image contaminated by a mixture of Gaussian and impulse noises. We propose a new statistic called ROADGI which improves the well-known Rank-Ordered Absolute Differences (ROAD) statistic for detecting points contaminated with the impulse noise in this context. Combining ROADGI statistic with the method of weights optimization we obtain a new algorithm called Optimal Weights Mixed Filter (OWMF) to deal with the mixed noise. Our simulation results show that the proposed filter is effective for mixed noises, as well as for single impulse noise and for single Gaussian noise. [ABSTRACT FROM AUTHOR]

The estimation of the correct number of dimensions is a long-standing problem in psychometrics. Several methods have been proposed, such as parallel analysis (PA), Kaiser-Guttman’s eigenvalue-greater-than-one rule, multiple average partial procedure (MAP), the maximum-likelihood approaches that use fit indexes as BIC and EBIC and the less used and studied approach called very simple structure (VSS). In the present paper a new approach to estimate the number of dimensions will be introduced and compared via simulation to the traditional techniques pointed above. The approach proposed in the current paper is called exploratory graph analysis (EGA), since it is based on the graphical lasso with the regularization parameter specified using EBIC. The number of dimensions is verified using the walktrap, a random walk algorithm used to identify communities in networks. In total, 32,000 data sets were simulated to fit known factor structures, with the data sets varying across different criteria: number of factors (2 and 4), number of items (5 and 10), sample size (100, 500, 1000 and 5000) and correlation between factors (orthogonal, .20, .50 and .70), resulting in 64 different conditions. For each condition, 500 data sets were simulated using lavaan. The result shows that the EGA performs comparable to parallel analysis, EBIC, eBIC and to Kaiser-Guttman rule in a number of situations, especially when the number of factors was two. However, EGA was the only technique able to correctly estimate the number of dimensions in the four-factor structure when the correlation between factors were .7, showing an accuracy of 100% for a sample size of 5,000 observations. Finally, the EGA was used to estimate the number of factors in a real dataset, in order to compare its performance with the other six techniques tested in the simulation study. [ABSTRACT FROM AUTHOR]

The rapid worldwide evolution of LEDs as light sources has brought new challenges, which means that new methods are needed and new algorithms have to be developed. Since the majority of LED luminaries are of the multi-source type, established methods for the design of light engines cannot be used in the design of LED light engines. This is because in the latter case what is involved is not just the design of a good reflector or projector lens, but the design of several lenses which have to work together in order to achieve satisfactory results. Since lenses can also be bought off the shelf from several manufacturers, it should be possible to combine together different off the shelf lenses in order to design a good light engine. However, with so many different lenses to choose from, it is almost impossible to find an optimal combination by hand, which means that some optimization algorithms need to be applied. In order for them to work properly, it is first necessary to describe the input data (i.e. spatial light distribution) in a functional form using as few as possible parameters. In this paper the focus is on the approximation of the input data, and the implementation of the well-known mathematical procedure for the separation of linear and nonlinear parameters, which can provide a substantial increase in performance. [ABSTRACT FROM AUTHOR]

The deployment of large number of femtocell base stations allows us to extend the coverage and efficiently utilize resources in a low cost manner. However, the small cell size of femtocell networks can result in frequent handovers to the mobile user, and consequently throughput degradation. Thus, in this paper, we propose predictive association control schemes to improve the system’s effective throughput. Our design focuses on reducing handover frequency without impacting on throughput. The proposed schemes determine handover decisions that contribute most to the network throughput and are proper for distributed implementations. The simulation results show significant gains compared with existing methods in terms of handover frequency and network throughput perspective. [ABSTRACT FROM AUTHOR]

In this paper, we present a novel image mosaicking method that is based on Speeded-Up Robust Features (SURF) of line segments, aiming to achieve robustness to incident scaling, rotation, change in illumination, and significant affine distortion between images in a panoramic series. Our method involves 1) using a SURF detection operator to locate feature points; 2) rough matching using SURF features of directed line segments constructed via the feature points; and 3) eliminating incorrectly matched pairs using RANSAC (RANdom SAmple Consensus). Experimental results confirm that our method results in high-quality panoramic mosaics that are superior to state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Although frequent fluctuations in domestic hog prices seriously affect the stability and robustness of the hog supply chain, hog futures (an effective hedging instrument) have not been listed in China. To better understand hog futures market hedging, it is important to study the steady state of intersubjective bidding. This paper uses evolutionary game theory to construct a game model between hedgers and speculators in the hog futures market, and replicator dynamic equations are then used to obtain the steady state between the two trading entities. The results show that the steady state is one in which hedgers adopt a “buy” strategy and speculators adopt a “do not speculate” strategy, but this type of extreme steady state is not easily realized. Thus, to explore the rational proportion of hedgers and speculators in the evolutionary stabilization strategy, bidding processes were simulated using weekly average hog prices from 2006 to 2015, such that the conditions under which hedgers and speculators achieve a steady state could be analyzed. This task was performed to achieve the stability critical point, and we show that only when the value of λ is satisfied and the conditions of hog futures price changes and futures price are satisfied can hedgers and speculators achieve a rational proportion and a stable hog futures market. This market can thus provide a valuable reference for the development of the Chinese hog futures market and the formulation and guidance of relevant departmental policies. [ABSTRACT FROM AUTHOR]

In recent years, renewable energy sources have been considered the most encouraging resources for grid and off-grid power generation. This paper presents an improved current control strategy for a three-phase photovoltaic grid-connected inverter (GCI) under unbalanced and nonlinear load conditions. It is challenging to suppress the harmonic content in the output current below a pre-set value in the GCI. It is also difficult to compensate for unbalanced loads even when the grid is under disruption due to total harmonic distortion (THD) and unbalanced loads. The primary advantage and objective of this method is to effectively compensate for the harmonic current content of the grid current and microgrid without the use of any compensation devices, such as active and passive filters. This method leads to a very low THD in both the GCI currents and the current exchanged with the grid. The control approach is designed to control the active and reactive power and harmonic current compensation, and it also corrects the system unbalance. The proposed control method features the synchronous reference frame (SRF) method. Simulation results are presented to demonstrate the effective performance of the proposed method. [ABSTRACT FROM AUTHOR]

Next-generation sequencing technologies have made RNA sequencing (RNA-seq) a popular choice for measuring gene expression level. To reduce the noise of gene expression measures and compare them between several conditions or samples, normalization is an essential step to adjust for varying sample sequencing depths and other unwanted technical effects. In this paper, we develop a novel global scaling normalization method by employing the available knowledge of housekeeping genes. We formulate the problem from the hypothesis testing perspective and find an optimal scaling factor that minimizes the deviation between the empirical and the nominal type I error. Applying our approach to various simulation studies and real examples, we demonstrate that it is more accurate and robust than the state-of-the-art alternatives in detecting differentially expression genes. [ABSTRACT FROM AUTHOR]