Search

The Warp code (and its framework of associated tools) was initially developed for particle-in-cell simulations of space-charge-dominated ion beams in accelerators, for heavy-ion-driven inertial fusion energy, and related experiments. It has found a broad range of applications, including nonneutral plasmas in traps, stray electron clouds in accelerators, laser-based acceleration, and the focusing of ion beams produced when short-pulse lasers irradiate foil targets. We summarize novel methods used in Warp, including: time-stepping conducive to diagnosis and particle injection; an interactive Python-Fortran-C structure that enables scripted and interactive user steering of runs; a variety of geometries (3-D $x$ , $y$ , $z$ ; 2-D $r$ , $z$ ; 2-D $x$ , $y$ ); electrostatic and electromagnetic field solvers; a cut-cell representation for internal boundaries; the use of warped coordinates for bent beam lines; adaptive mesh refinement, including a capability for time-dependent space-charge-limited flow from curved surfaces; models for accelerator lattice elements (magnetic or electrostatic quadrupole lenses, accelerating gaps, etc.) at user-selectable levels of detail; models for particle interactions with gas and walls; moment/envelope models that support sophisticated particle loading; a drift-Lorentz mover for rapid tracking through regions of strong and weak magnetic field; a Lorentz-boosted frame formulation with a Lorentz-invariant modification of the Boris mover; an electromagnetic solver with tunable dispersion and stride-based digital filtering; and a pseudospectral electromagnetic solver. Warp has proven useful for a wide range of applications, described very briefly herein. It is available as an open-source code under a BSD license. This paper describes material presented during the Prof. Charles K. (Ned) Birdsall Memorial Session of the 2013 IEEE Pulsed Power and Plasma Science Conference. In addition to our overview of the computational methods used in Warp, we summarize a few aspects of Ned's contributions to plasma simulation and to the careers of those he mentored. [ABSTRACT FROM PUBLISHER]

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]

Establishing causal relations between random variables from observational data is perhaps the most important challenge in today’s science. In remote sensing and geosciences, this is of special relevance to better understand the earth’s system and the complex interactions between the governing processes. In this paper, we focus on an observational causal inference, and thus, we try to estimate the correct direction of causation using a finite set of empirical data. In addition, we focus on the more complex bivariate scenario that requires strong assumptions and no conditional independence tests can be used. In particular, we explore the framework of (nondeterministic) additive noise models, which relies on the principle of independence between the cause and the generating mechanism. A practical algorithmic instantiation of such principle only requires: 1) two regression models in the forward and backward directions and 2) the estimation of statistical independence between the obtained residuals and the observations. The direction leading to more independent residuals is decided to be the cause. We instead propose a criterion that uses the sensitivity (derivative) of the dependence estimator, the sensitivity criterion allows to identify samples most affecting the dependence measure, and hence, the criterion is robust to spurious detections. We illustrate the performance in a collection of 28 geoscience causal inference problems, a database of radiative transfer models simulations and machine learning emulators in vegetation parameter modeling involving 182 problems, and assessing the impact of different regression models in a carbon cycle problem. The criterion achieves the state-of-the-art detection rates in all cases, and it is generally robust to noise sources and distortions. The presented approach confirms the validity in observational bivariate problems in the earth sciences. [ABSTRACT FROM AUTHOR]

This paper presents a theoretical investigation of the general problem of emergent irreducible information in networked populations of computable systems. In particular, we narrow our scope to study this problem in algorithmic networks composed of randomly generated Turing machines that follow a susceptible-infected-susceptible contagion model of imitation of the fittest neighbor. We show that there is a lower bound for the stationary prevalence (i.e., the average density of infected nodes by the fittest nodes) that triggers expected (local) emergent openendedness, that is, that triggers an unlimited increase of the expected local emergent algorithmic complexity (or information) of a node as the population size grows. In addition, we show that static networks with a power-law degree distribution following the Barabási-Albert model satisfy this lower bound and thus display expected (local) emergent open-endedness. [ABSTRACT FROM AUTHOR]

In this paper, a hydraulic turbine unit transfer function is represented, considering acceleration of the water column, velocity of the water and mechanical power. Using Matlab/Simulink software facilities, have been simulated the behaviour of the mechanical power, depending of the gate opening, with water starting time parameter affected by uncertainties. Step responses analyse are simulated in order to evaluate the performances with load affected by uncertainties and with different control algorithms. This paper can be used in power engineering and control systems fields as a guideline in order to modelling, simulate, analyse and tune the controller for hydraulic turbine unit. [ABSTRACT FROM AUTHOR]

Background: Systems Biology continues to produce increasingly large models of complex biochemical reaction networks. In applications requiring, for example, parameter estimation, the use of agent-based modelling approaches, or real-time simulation, this growing model complexity can present a significant hurdle. Often, however, not all portions of a model are of equal interest in a given setting. In such situations methods of model reduction offer one possible approach for addressing the issue of complexity by seeking to eliminate those portions of a pathway that can be shown to have the least effect upon the properties of interest. Methods: In this paper a model reduction algorithm bringing together the complementary aspects of proper lumping and empirical balanced truncation is presented. Additional contributions include the development of a criterion for the selection of state-variable elimination via conservation analysis and use of an 'averaged' lumping inverse. This combined algorithm is highly automatable and of particular applicability in the context of 'controlled' biochemical networks. Results: The algorithm is demonstrated here via application to two examples; an 11 dimensional model of bacterial chemotaxis in Escherichia coli and a 99 dimensional model of extracellular regulatory kinase activation (ERK) mediated via the epidermal growth factor (EGF) and nerve growth factor (NGF) receptor pathways. In the case of the chemotaxis model the algorithm was able to reduce the model to 2 state-variables producing a maximal relative error between the dynamics of the original and reduced models of only 2.8% whilst yielding a 26 fold speed up in simulation time. For the ERK activation model the algorithm was able to reduce the system to 7 state-variables, incurring a maximal relative error of 4.8%, and producing an approximately 10 fold speed up in the rate of simulation. Indices of controllability and observability are additionally developed and demonstrated throughout the paper. These provide insight into the relative importance of individual reactants in mediating a biochemical system's input-output response even for highly complex networks. Conclusions: Through application, this paper demonstrates that combined model reduction methods can produce a significant simplification of complex Systems Biology models whilst retaining a high degree of predictive accuracy. In particular, it is shown that by combining the methods of proper lumping and empirical balanced truncation it is often possible to produce more accurate reductions than can be obtained by the use of either method in isolation [ABSTRACT FROM AUTHOR]

Model checking is a formal method for verifying whether the system satisfies a user-defined specification. Compared to simulation, model checking is restricted in capacity. On the other hand, simulation is weak in detecting bugs that require long and complex sequences of events to be exposed. This paper combines model checking and simulation in an abstraction-refinement scheme to mitigate the problems of both methods. Abstraction refinement iteratively constructs a simplified model to verify the original model. While a simplified model mitigates the weakness of model checking, the set of simplified error traces model helps guide simulation toward deep bugs. In abstraction refinement, concretization—a process of deriving an error trace in the original model from the abstract ones—is used to invalidate spurious abstract error traces or to refute a property. In this paper, we describe a novel concretization algorithm that combines simulation with satisfiability to efficiently refute properties with very long error traces. [ABSTRACT FROM AUTHOR]

This paper focuses on a lot merging–splitting problem in a semiconductor wafer fabrication facility in which a relatively large number of wafer types are produced according to orders with different due dates. In the fab, two or more lots can be merged into a single lot if routes and all processing conditions of the lots are the same for a number of subsequent operations, and the merged lot is split into the original lots at the point where the routes or processing conditions become different. We suggest lot merging–splitting algorithms to reduce the total tardiness of the orders and the cycle times of the lots. The suggested algorithms are evaluated through a series of simulation experiments and the result shows that the algorithms work better than a method used in a real fab. [ABSTRACT FROM PUBLISHER]

In this paper we introduce the transparent dead leaves (TDL) random field, a new germ-grain model in which the grains are combined according to a transparency principle. Informally, this model may be seen as the superposition of infinitely many semitransparent objects. It is therefore of interest in view of the modeling of natural images. Properties of this new model are established and a simulation algorithm is proposed. The main contribution of the paper is to establish a central limit theorem, showing that, when varying the transparency of the grain from opacity to total transparency, the TDL model ranges from the dead leaves model to a Gaussian random field. [ABSTRACT FROM AUTHOR]

This paper presents an online procedure for the automatic search of the maximum-torque-per-ampere operating region for a synchronous reluctance motor. The algorithm is based on a signal-injection method with a random-based perturbation pattern applied to a common direct-torque-controlled drive. Among motor parameters, only the stator resistance is required to perform the automatic procedure. Simulations and experimental results are presented in the paper, demonstrating the benefits of the proposed algorithm. The solution is easily extended to any ac drive. [ABSTRACT FROM PUBLISHER]

In this paper, a mathematical model for the beacon-enabled mode of the IEEE 802.15.4 medium-access control (MAC) protocol is provided. A personal area network (PAN) composed of multiple nodes, which transmit data to a PAN coordinator through direct links or multiple hops, is considered. The application is query based: Upon reception of the beacon transmitted by the PAN coordinator, each node tries to transmit its packet using the superframe structure defined by the IEEE 802.15.4 protocol. Those nodes that do not succeed in accessing the channel discard the packet; at the next superframe, a new packet is generated. The aim of the paper is to develop a flexible mathematical tool able to study beacon-enabled 802.15.4 networks organized in different topologies. Both the contention access period (CAP) and the contention-free period defined by the standard are considered. The slotted carrier-sense multiple access with collision avoidance (CSMA/CA) algorithm used in the CAP portion of the superframe is analytically modeled. The model describes the probability of packet successful reception and access delay statistics. Moreover, both star and tree-based topologies are dealt with; a suitable comparison between these topologies is provided. The model is a useful tool for the design of MAC parameters and to select the better topology. The mathematical model is validated through simulation results. The model differs from those previously published by other authors in the literature as it precisely follows the MAC procedure defined by the standard in the context of the application scenario described. [ABSTRACT FROM AUTHOR]

The frequency scaling algorithm (FSA) was proposed to process the synthetic aperture radar (SAR) data acquired via the dechirp-on-receive approach. Some aspects of improving the FSA are investigated in this paper, based on which an extended FSA (EFSA) is presented. The general purpose of the EFSA is to reduce the effect of range spectrum shift of the intermediate processing results, which occurs during the scaling operation in the FSA, so as to achieve a more effective utilization of the processed bandwidth. The EFSA is implemented through time shifting the scaling and the inverse scaling functions used in the FSA and also the adjustment of the scaling factor. The derivation of the EFSA is detailed in this paper. Point target simulation in squinted imaging geometry indicates that the presented algorithm is more suitable for large-squint applications. [ABSTRACT FROM AUTHOR]

Channel order estimation is a critical step in most blind single-input multiple-output (SIMO) channel identification/equalization algorithms. Several methods for estimating either the true channel order or its most significant part (the so-called effective channel order) have been recently proposed, but a solution able to work in practical scenarios (low or moderate signal-to-noise ratios (SNR5) and channels with small leading and/or trailing coefficients) has not been found yet. In this paper, a new criterion for effective channel order detection of SIMO channels is presented. The method is based on the fact that the cost function typically used in blind identification algorithms decreases monotonically with the estimated channel order, whereas for blind equalization algorithms, the cost function increases monotonically. In this paper, it is shown that a straightforward combination of both cost functions attains its minimum at the correct channel order even for moderate SNRS. The proposed method is able to work with small data sets, colored signals, and channels with small head and tail taps, which is a common problem in communication applications. The improvement of the proposed criterion over a number of existing algorithms is demonstrated through simulations. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the properties of the sampled version of the fictitious play algorithm, familiar from game theory, for games with identical payoffs, and propose a heuristic based on fictitious play as a solution procedure for discrete optimization problems of the form max {u(y) y = (y1,…yn ∈ y1 x … x yn} i.e., in which the feasible region is a Cartesian product of finite sets y1 i ∈ N = (1, …, n). The contributions of this paper are twofold. In the first part of the paper, we broaden the existing results on convergence properties of the fictitious play algorithm on games with identical payoffs to include an approximate fictitious play algorithm that allows for errors in players 'best replies. Moreover, we introduce sampling-based approximate fictitious play that possesses the above convergence properties, and at the same time provides a computationally efficient method for implementing fictitious play. In the second part of the paper, we motivate the use of algorithms based on sampled fictitious play to solve optimization problems in the above form with particular focus on the problems in which the objective function u(·) comes from a "black box," such as a simulation model, where significant computational effort is required for each function evaluation. [ABSTRACT FROM AUTHOR]

The problem in this paper is motivated by physical problems concerned with the case when a class of continuous and equimeasurable densities of a string is given then how to find minimal frequencies among these given densities, that is, what kind of densities minimize the frequencies. By taking Dirichlet eigenvalues into account, given a certain weight function ω, we will show the minimizer of the mth eigenvalue is the m-degree continuous symmetrical decreasing rearrangement of ω. The main result of this paper can be viewed as complementary to Schwarz’s work (Schwarz in J. Math. Mech. 10:401-422, 1961). [ABSTRACT FROM AUTHOR]

In this paper, we propose a procedure for detecting multiple change-points in a mean-shift model, where the number of change-points is allowed to increase with the sample size. A theoretic justification for our new method is also given. We first convert the change-point problem into a variable selection problem by partitioning the data sequence into several segments. Then, we apply a modified variance inflation factor regression algorithm to each segment in sequential order. When a segment that is suspected of containing a change-point is found, we use a weighted cumulative sum to test if there is indeed a change-point in this segment. The proposed procedure is implemented in an algorithm which, compared to two popular methods via simulation studies, demonstrates satisfactory performance in terms of accuracy, stability and computation time. Finally, we apply our new algorithm to analyze two real data examples. [ABSTRACT FROM AUTHOR]

This paper considers "critical path" networks which are used for the planning and scheduling of projects that consist of well defined sequences of individual activities. When the number of activities is large, it becomes difficult to prepare a network for the project as one unit, and it may also be difficult to store the network in the high speed memory of a digital computer. Also, in the cases where there are two or more independent projects, which are weakly inter-related by common activities, the problem of efficient scheduling of all the projects becomes quite difficult. This paper presents a method to "tear" or "decompose" a project network into several subnetworks, schedule the subnetworks and then to put the subnetworks back together. A computational algorithm is first given for time-only networks; then two computational formulations are given for cost-time network of project subnetworks. The latter essentially generalize the algorithm due to Fulkerson, in order to handle piecewise linear, convex, cost-time curves for some or all of the activities. [ABSTRACT FROM AUTHOR]

This paper gives a detailed description of an algorithm for the solution of a specialized Linear Programming model, to be called the Machine Loading model. It is a generalization of the Transportation Problem, in that weighting factors are applied to the individual elements which form the row and column sums. For the Machine Loading model, the simplex method reduces to a specialized algorithm which generalizes the stepping stone method of the Transportation Problem [2], [3]. With the resulting generalized stepping stone method, it becomes practicable to solve many large-scale problems for which the direct application of the simplex method would be impracticable. The present paper is restricted to a discussion of the following topics: (I) the general characteristics of the model and its topological features; (ii) a detailed solution algorithm, including a consideration of degenerate cases and the use of a computer; (iii) a more restrictive capacitated model and the corresponding modifications to the solution algorithm; and (iv) the complete illustrative solution of a numerical example. The purpose is to aid interested readers in gaining familiarity with the algorithm and facility in the solution of numerical problems. No derivations or proofs will be included. [ABSTRACT FROM AUTHOR]

In this paper a simple four-point, in terms of time, but eight-value in total, identification method has been developed for the second-order linear Nomoto steering model. The algorithm intrinsically uses the zigzag test data in that it inherited some principles of the well-known procedure for the first-order model, from which it is essentially derived. The performance evaluation was then conducted with both simulated and real data. However, the results of these early, unprecedented efforts are far from satisfactory. Some potential sources of difficulties have been discussed. This calls for further research and improvement in order to provide a practical application of the method. [ABSTRACT FROM AUTHOR]

A mixed-model assembly line is a type of production line where different models of a product are assembled on. Mixed-model assembly lines can respond to unanticipated changes in product demands quickly without keeping so many inventories. Designing mixed-model assembly line involves solving the traditional problems of the assembly line design (consists of balancing problem, determining cycle time, and the number and sequence of stations) in addition of determining the sequence of products in assembly line. The main goal of this paper is presenting a method in order to determine the sequence of products in mixed-model assembly line by considering Just-in-Time systems. Moreover, supplying some required components from feeding lines is considered. A mathematical model is presented which is capable of specifying the sequence of products in the mixed-model assembly line by considering main criteria and keeping feeding lines balanced. Mathematical model can be used for solving small-size problems. Because the combinatorial nature of sequencing problems typically provides an intractable search space for problems of 'real world' size, the search heuristics of simulated annealing and ant colony algorithms are presented and used to find solutions for several problem sets. Experimentations show that the simulated annealing approach outperforms the ant colony approach in objective function performance. [ABSTRACT FROM AUTHOR]

Based on information theory, the single neuron adaptive control problem for stochastic systems with non-Gaussian noises is investigated in this paper. Here, the statistic information of the output within a receding window rather than the output value is used for the tracking problem. Firstly, the single neuron controller structure, which has the ability of self-learning and self-adaptation, is established. Then, an improved performance criterion is given to train the weights of the single neuron. Furthermore, the mean-square convergent condition of the proposed control algorithm is formulated. Finally, comparative simulation results are presented to show that the proposed algorithm is superior to the PID controller. The contributions of this work are twofold: (1) the optimal control algorithm is formulated in the data-driven framework, which needn't the precise system model that is usually difficult to obtain; (2) the control problem of non-Gaussian systems can be effectively dealt with by the simple single neuron controller under improved minimum entropy criterion. [ABSTRACT FROM AUTHOR]

This paper is devoted to the perfect simulation of a stationary process with an at most countable state space. The process is specified through a kernel, prescribing the probability of the next state conditional to the whole past history. We follow the seminal work of Comets, Fernández and Ferrari (2002), who gave sufficient conditions for the construction of a perfect simulation algorithm. We define backward coalescence times for these kind of processes, which allow us to construct perfect simulation algorithms under weaker conditions than in Comets, Fermindez and Ferrari (2002). We discuss how to construct backward coalescence times (I) by means of information depths, taking into account some a priori knowledge about the histories that occur; and (ii) by identifying suitable coalescing events. [ABSTRACT FROM AUTHOR]

In this paper, on the basis of the theories and methods of Watson's perceptual model and rational dither modulation (RDM), a hybrid quantization-based watermarking in the discrete wavelet transform (DWT) and discrete cosine transform (DCT) domains is studied. In the design of the quantization-based watermarking, quantization step-size plays an important role in many watermarking algorithms. RDM at both the embedder and decoder adopts a gain-invariant adaptive quantization step-size. Therefore, we investigated combining the modified Watson's perceptual model with RDM. Its improved robustness is due to the embedding in the high entropy region of low-frequency sub-band image and adaptive control of its quantization step-size. The Euclidean distance decoder is used to extract the watermark data. The performance of the proposed scheme is analytically calculated and verified by simulation. Experimental results confirm the imperceptibility of the proposed watermarking and its higher robustness against attacks compared to alternative watermarking methods in the literature. [ABSTRACT FROM AUTHOR]

When selecting construction design-build teams, subjective multi-evaluator decision making can be controversial and can lead to project delay, loss of public trust, and increased legal fees. This paper introduces a mathematical algorithm that supports multi-evaluator selection decisions by detecting and reducing the effect of possible uncertainty in the scores given by the evaluators. The algorithm was coded and tested using several scenarios. The study results show that the model is robust and capable of extracting the maximum knowledge from the scores given by evaluators with varying degrees of expertise. Simulation results show that the proposed model performed better than the simple averaging method 89% of the time. The outcome of this research provides the decision maker with a justified basis to proceed with the selection decision. [ABSTRACT FROM AUTHOR]

Resistance spot welding is a major metal connecting method in vehicle and other domestic electronic domains. Among all the welding techniques, the spot welding inverter is an important direction at the present time. The high nonlinearity and strongly coupled multiple parameters in the resistance spot welding process challenge the classical control theory based on some specific conditions and ideal assumptions, which in real practice obstacle the high-quality welding. This paper put the fuzzy neural network into a constant-current-controlled spot welding inverter, where the welding current peak and its variation are adopted as the input parameters and the duty ratio of the switches is regarded as the output. Eventually a five-layer feed-forward network was constructed, back propagation (BP) algorithm was applied to revise the adjustable parameters in the network, and a mathematical model was established to obtain the training samples serving for the network. The ultimate precision could reach 1.75%, the relative control error is 2.28% with strong external disturbances, the overmodulation is 3.35%, and the total modulating period is seven switching period, which indicated that the proposed algorithm has good performance. [ABSTRACT FROM AUTHOR]

Although the recently proposed single-implicit-equation-based input voltage equations (IVEs) for the independent double-gate (IDG) MOSFET promise faster computation time than the earlier proposed coupled-equations-based IVEs, it is not clear how those equations could be solved inside a circuit simulator as the conventional Newton–Raphson (NR)-based root finding method will not always converge due to the presence of discontinuity at the G-zero point (GZP) and nonremovable singularities in the trigonometric IVE. In this paper, we propose a unique algorithm to solve those IVEs, which combines the Ridders algorithm with the NR-based technique in order to provide assured convergence for any bias conditions. Studying the IDG MOSFET operation carefully, we apply an optimized initial guess to the NR component and a minimized solution space to the Ridders component in order to achieve rapid convergence, which is very important for circuit simulation. To reduce the computation budget further, we propose a new closed-form solution of the IVEs in the near vicinity of the GZP. The proposed algorithm is tested with different device parameters in the extended range of bias conditions and successfully implemented in a commercial circuit simulator through its Verilog-A interface. [ABSTRACT FROM PUBLISHER]

Electronically controlled air suspension systems have been used in vehicles to improve ride comfort and handling safety by adjusting vehicle height. This paper proposes a new nonlinear controller to adjust the height of the vehicle sprung mass (height control) and to regulate the roll and pitch angles of the vehicle body (leveling control) by an air suspension system. A sliding mode control algorithm is designed to improve the tracking accuracy of the control and to overcome nonlinearities and uncertainties in the air suspension system. A mathematical model of the air suspension system is formulated in a nonlinear affine form to describe the dynamic behavior of the system and to derive the control algorithm. The sliding mode observer is also designed to estimate the pressures inside four air springs. The effectiveness and performance of the proposed control algorithm are verified by simulations and actual vehicle tests. [ABSTRACT FROM PUBLISHER]

This correspondence paper presents an algorithm in which the independent components of link lengths are used as a medium to analyze the forward kinematics of a six-degree-of-freedom Stewart platform. The link lengths are firstly transformed into independent components through independent component analysis. Then, the value of positional variables is computed by using the Nelder–Mead algorithm by taking advantage of the relationships between the independent components and the positional variables. Simulations have been conducted to test the proposed algorithm. The experimental results show that the proposed algorithm can achieve a better performance than the other published algorithms. [ABSTRACT FROM PUBLISHER]

In this paper, we share our experience with merger simulations using a Random Coefficient Logit model on the demand side and assuming a static Bertrand game on the supply side. Drawing largely from our work in Knittel and Metaxoglou (2008), we show that different demand estimates obtained from different combinations of optimization algorithms and starting values lead to substantial differences in post-merger market outcomes using metrics such as industry profits, and change in consumer welfare and prices. [ABSTRACT FROM AUTHOR]

This paper presents an improved mathematical model, to calculate power and energy losses within asynchronous machine(ASM) which operates in harmonic regime(HR) and respectively the simulations done on presented model basis on technological lines(TL) composed by asynchronous motors with known characteristics, made in Romania. After a brief review of some aspects regarding operation of ASM in HR, in the second part of the paper is presented the algorithm and mathematical model applied on energetic performances simulation of ASM which operates in HR. The third part presents the result of simulations done based on mathematical model to a known structure power consumer, respectively S.C. „CONGIPS" S.A. from city of Oradea. The last part of the paper expresses the resulted conclusions of the analysis. [ABSTRACT FROM AUTHOR]

A trimming mean eliminates the extreme observations by removing observations from each end of the ordered sample. In this paper, we adopted the Hogg's and Brys's tail weight measures. In addition, a new algorithm was proposed as a linear estimator based on the quartile; we used a quartile to divide the data into three and four groups. Then two new estimators were proposed. These classes of linear estimators were examined via simulation method over a variety of asymmetric distributions. Sample sizes 50, 100, 150, and 200 were generated using R program. The results of 50 were tabulated, since we have similar results for the other sizes. These results were tabulated for 7 asymmetric distributions with total trimmed proportions 0.10 and 0.20 on both sides, respectively. The results for these estimators were ordered based on their relative efficiency. [ABSTRACT FROM AUTHOR]

This paper deals with beamforming in wireless relay networks with perfect channel information at the relays, receiver, and transmitter if there is a direct link between the transmitter and receiver. It is assumed that every node in the network has its own power constraint. A two-step amplify-and-forward protocol is used, in which the transmitter and relays not only use match filters to form a beam at the receiver but also adaptively adjust their transmit powers according to the channel strength information. For networks with no direct link, an algorithm is proposed to analytically find the exact solution with linear (in network size) complexity. It is shown that the transmitter should always use its maximal power while the optimal power of a relay can take any value between zero and its maxima. Also, this value depends on the quality of all other channels in addition to the relay's own. Despite this coupling fact, distributive strategies are proposed in which, with the aid of a low-rate receiver broadcast, a relay needs only its own channel information to implement the optimal power control. Then, beamforming in networks with a direct link is considered. When the direct link exists during the first step only, the optimal power control is the same as that of networks with no direct link. For networks with a direct link during the second step only and both steps, recursive numerical algorithms are proposed. Simulation shows that network beamforming achieves the maximal diversity order and outperforms other existing schemes. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new maximum-likelihood (ML) target localization approach which uses quantized sensor data as well as wireless channel statistics in a wireless sensor network. The novelty of our approach comes from the fact that statistics of imperfect wireless channels between sensors and the fusion center along with some physical layer design parameters are incorporated in the localization algorithm. We call this approach "channel-aware target localization." ML target location estimators are derived for different wireless channel models and receiver architectures. Furthermore, we derive the Cramér-Rao lower bounds (CRLBs) for our proposed channel-aware ML location estimators. Simulation results are presented to show that the performance of the channel-aware ML location estimators are quite close to their theoretical performance bounds even with relatively small number of sensors and their performance is superior compared to that of the channel-unaware ML estimators. [ABSTRACT FROM AUTHOR]

A linear frequency-modulated continuous-wave (LFMCW) synthetic aperture radar (SAR) is a highly miniaturized SAR that is suitable for use on a small unmanned aerial vehicle. In squint stripmap mode, the LFMCW SAR image quality is degraded by the presence of nonlinearities in the transmitted signal, combined with the large bandwidth introduced by the frequency scaling in the nonlinear frequency scaling (NLFS) algorithm. This paper proposes an extension of the NLFS algorithm called the Doppler-centroid-dependent frequency scaling algorithm. The algorithm introduces a new Doppler-centroid-dependent scaling factor to decrease the introduced bandwidth, effectively removing the range frequency aliasing, without extra computational load. Nonlinearity correction is performed at the same time as range cell migration correction. The validity of the proposed algorithm is demonstrated with point target simulation results. [ABSTRACT FROM AUTHOR]

In this paper, an algorithm that acquires the intermediate goals between the initial and goal states is proposed for an agent executing multiple tasks. We demonstrate the algorithm in the problem of rearranging multiple objects. The result shows that the moving distance to transfer the entire objects to their goal configuration is 1/15 of that without using intermediate goals. We experiment using a real robot to confirm that the intermediate goal can be adapted to a real environment. Our experimental results showed that an agent could adapt the intermediate goals, which were acquired in the simulation, to the experimental environment. [ABSTRACT FROM AUTHOR]

This paper describes a practical algorithm based on Monte Carlo simulation for the pricing of multi- dimensional American (i.e., continuously exercisable) and Bermudan (i.e., discretely exercisable) options. The method generates both lower and upper bounds for the Bermudan option price and hence gives valid confidence intervals for the true value. Lower bounds can be generated using any number of primal algorithms. Upper bounds are generated using a new Monte Carlo algorithm based on the duality representation of the Bermudan value function suggested independently in Haugh and Kogan (2004) and Rogers (2002). Our proposed algorithm can handle virtually any type of process dynamics, factor structure, and payout specification. Computational results for a variety of multifactor equity and interest-rate options demonstrate the simplicity and efficiency of the proposed algorithm. In particular, we use the proposed method to examine and verify the tightness of frequently used exercise rules in Bermudan swaption markets. [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]

This paper explores the normative theory of simulation within the context of an optimization algorithm for a linear programming model of the experimental setting. The simulation is viewed as a random generalized mathematical function which provides an uncertain evaluation of any policy within a specified constraint set. A sequential experimental design aimed at identifying the feasible levels of the policy variables which provide the optimal level of expected response is presented and analyzed. The results of numerical tests of the proposed procedure are discussed. [ABSTRACT FROM AUTHOR]

This paper considers the problem of finding minimal length tree networks on the unit sphere Φ of a given point set (V) where distance is measured along great circular arcs. The related problems of finding a Steiner Minimal Tree SMT (V) and of finding a Minimum Spanning Tree MST(V) are treated through a simplicial decomposition technique based on computing the Delaunay Triangulation DT (V) and the Voronoi Diagram VD(V) of the given point set. O (N log N) algorithms for computing DT(V), VD(V), and WST(V) as well as an O(N log N) heuristic for finding a sub-optimal SMT(V) solution are presented, together with experimental results for randomly distributed points on Φ. [ABSTRACT FROM AUTHOR]

This paper presents an extremely efficient method for antenna design and optimization. Traditionally, antenna optimization relies on nature-inspired heuristic algorithms, which are time-consuming due to their blind-search nature. In contrast, design of experiments (DOE) uses a completely different framework from heuristic algorithms, reducing the design cycle by formulating the surrogates of a design problem. However, the number of required simulations grows exponentially if a full factorial design is used. In this paper, a much more efficient technique is presented to achieve substantial time savings. By using orthogonal fractional experiments, only a small subset of the full factorial design is required, yet the resultant response surface models are still effective. The capability of orthogonal fractional experiments is demonstrated through three examples, including two tag antennas for radio-frequency identification (RFID) applications and one internal antenna for long-term-evolution (LTE) handheld devices. In these examples, orthogonal fractional experiments greatly improve the efficiency of DOE, thereby facilitating the antenna design with less simulation runs. [ABSTRACT FROM AUTHOR]

The Artificial Bee Colony (ABC) algorithm is a recently introduced swarm intelligence algorithm that has been successfully applied on numerous and diverse optimization problems. However, one major problem with ABC is its premature convergence to local optima, which often originates from its insufficient degree of explorative search capability. This paper introduces ABC with Improved Explorations (ABC-IX), a novel algorithm that modifies both the selection and perturbation operations of the basic ABC algorithm in an explorative way. First, an explorative selection scheme based on simulated annealing allows ABC-IX to probabilistically accept both better and worse candidate solutions, whereas the basic ABC can accept better solutions only. Second, a self-adaptive strategy enables ABC-IX to automatically adapt the perturbation rate, separately for each candidate solution, to customize the degree of explorations and exploitations around it. ABC-IX is evaluated on several benchmark numerical optimization problems and results are compared with a number of state-of-the-art evolutionary and swarm intelligence algorithms. Results show that ABC-IX often performs better optimization than most other algorithms in comparison on most of the problems. [ABSTRACT FROM AUTHOR]

This paper focuses on retrieving the atmospheric duct structure from radar sea clutter returns by the adjoint approach with the regularization technique. The adjoint is derived from the split-step Fourier parabolic equation method, and the regularization term is constructed by the background refractivity field. To ensure successful implementations of the regularization, the L-curve criterion is used to find the optimal regularization parameter. The feasibility of the proposed method is validated by the numerical simulations of different noise-level clutter returns, as well as a real clutter profile measured by the S-Band Space Range Radar located in Wallops Island. In the process of inversions, the refractivity profile is first obtained by genetic algorithm, and then it is used as the background field for the adjoint method. The retrieved results indicate that, with an appropriate regularization parameter, the structure of the background refractivity profile can be improved by the proposed method. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Mechanical Engineering / Strojniški Vestnik is the property of University of Ljubljana, Faculty of Mechanical Engineering, Journal of Mechanical Engineering and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

This paper deals with the mathematical modeling and algorithms for the problem of oil pollution. For solving this task, we derive the adjoint problem for the advection-diffusion equation describing the propagation of oil slick after an accident, which we call the main problem. We prove a fundamental equality between the solutions of the main and the adjoint problems. Based on this equality, we propose a novel method for the identification of the pollution source location and the accident time of oil emission. This approach is illustrated on an example for an accident in the offshore of the central part of the Vietnamese coast. Numerical simulations demonstrate the effectiveness of the proposed method. Besides, the method is verified for 1D model of substance propagation. [ABSTRACT FROM AUTHOR]

SUMMARY To simulate seismic wave propagation in the spherical Earth, the Earth's curvature has to be taken into account. This can be done by solving the seismic wave equation in spherical coordinates by numerical methods. In this paper, we use an optimized, collocated-grid finite-difference scheme to solve the anisotropic velocity-stress equation in spherical coordinates. To increase the efficiency of the finite-difference algorithm, we use a non-uniform grid to discretize the computational domain. The grid varies continuously with smaller spacing in low velocity layers and thin layer regions and with larger spacing otherwise. We use stress-image setting to implement the free surface boundary condition on the stress components. To implement the free surface boundary condition on the velocity components, we use a compact scheme near the surface. If strong velocity gradient exists near the surface, a lower-order scheme is used to calculate velocity difference to stabilize the calculation. The computational domain is surrounded by complex-frequency shifted perfectly matched layers implemented through auxiliary differential equations (ADE CFS-PML) in a local Cartesian coordinate. We compare the simulation results with the results from the normal mode method in the isotropic and anisotropic models and verify the accuracy of the finite-difference method. [ABSTRACT FROM AUTHOR]

Copyright of Revista Politécnica is the property of Politechnico Colombian Jaime Isaza Cadavid and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In this paper a model selection algorithm for a nonlinear system identification method is proposed to study functional magnetic resonance imaging (fMRI) effective connectivity. Unlike most other methods, this method does not need a pre-defined structure/model for effective connectivity analysis. Instead, it relies on selecting significant nonlinear or linear covariates for the differential equations to describe the mapping relationship between brain output (fMRI response) and input (experiment design). These covariates, as well as their coefficients, are estimated based on a least angle regression (LARS) method. In the implementation of the LARS method, Akaike's information criterion corrected (AICc) algorithm and the leave-one-out (LOO) cross-validation method were employed and compared for model selection. Simulation comparison between the dynamic causal model (DCM), nonlinear identification method, and model selection method for modelling the single-input-single-output (SISO) and multiple-input multiple-output (MIMO) systems were conducted. Results show that the LARS model selection method is faster than DCM and achieves a compact and economic nonlinear model simultaneously. To verify the efficacy of the proposed approach, an analysis of the dorsal and ventral visual pathway networks was carried out based on three real datasets. The results show that LARS can be used for model selection in an fMRI effective connectivity study with phase-encoded, standard block, and random block designs. It is also shown that the LOO cross-validation method for nonlinear model selection has less residual sum squares than the AICc algorithm for the study. [ABSTRACT FROM AUTHOR]

In this paper, a model-based fault prognosis method is developed for hybrid systems with multiple incipient faults. The concept of augmented global analytical redundancy relations is proposed for the identification of degradation of components, such as sensors and actuators, which cannot be described by physical parameters. In addition, multiple incipient faults are considered in a complex hybrid system, and these faults can develop during a mode when the faults are not detectable. The unknown degradation characteristic of each incipient fault is identified with the closest matching one of some prescribed dynamic models. The resultant degradation model will serve as a base for prognosis. In the process of fault detection and isolation, the degradation models and faults are identified using a multiple-adaptive-hybrid-particle-swarm-optimization algorithm. The proposed methodology and algorithm are verified with simulation as well as experiments. [ABSTRACT FROM PUBLISHER]