Search

Generalized linear models (GLMs) are used in high-dimensional machine learning, statistics, communications, and signal processing. In this paper we analyze GLMs when the data matrix is random, as relevant in problems such as compressed sensing, error-correcting codes, or benchmark models in neural networks. We evaluate the mutual information (or "free entropy") from which we deduce the Bayes-optimal estimation and generalization errors. Our analysis applies to the high-dimensional limit where both the number of samples and the dimension are large and their ratio is fixed. Nonrigorous predictions for the optimal errors existed for special cases of GLMs, e.g., for the perceptron, in the field of statistical physics based on the socalled replica method. Our present paper rigorously establishes those decades-old conjectures and brings forward their algorithmic interpretation in terms of performance of the generalized approximate message-passing algorithm. Furthermore, we tightly characterize, for many learning problems, regions of parameters for which this algorithm achieves the optimal performance and locate the associated sharp phase transitions separating learnable and nonlearnable regions. We believe that this random version of GLMs can serve as a challenging benchmark for multipurpose algorithms. [ABSTRACT FROM AUTHOR]

This paper which depended on the foundation of back strip method has established mathematic model to simulate stratum burial history, which considered the computation of stratum skeleton depth based on max depth and the equation-depth point on the procedure to recover stratum by stripping each layer, and put forward the enhanced restoration method taking layers group as studying object. Finally, the method has been applied to build the computer model and program automatic back strip algorithm successfully. Experiments have proved that the method is accurate, applicable, and extensible under the conditions of various complex strata. [ABSTRACT FROM AUTHOR]

This paper proposes a data-driven H∞ approach to simultaneous fault detection and control problem. This problem is formulated as a time domain H∞ optimization problem and its solution produces a data-driven H∞ controller/detector unit of modest complexity which is capable of achieving some control and fault detection objectives. The mathematical model is assumed to be unknown and only input/output data are used for controller/detector designing. The tradeoff between these objectives is established by tuning a scalar parameter and some weighting matrices. An easily implementable algorithm summarizes the methodology presented in the paper. The proposed algorithm is applied to a numerical example in order to illustrate its effectiveness. [ABSTRACT FROM AUTHOR]

An iterative QR-based soft feedback segment interference cancellation (QRSFSIC) detection and decoder algorithm for a Reed-Muller (RM) space-time turbo system is proposed in this paper. It forms the sufficient statistic for the minimum-mean-square error (MMSE) estimate according to QR decomposition-based soft feedback successive interference cancellation, stemmed from the a priori log-likelihood ratio (LLR) of encoded bits. Then, the signal originating from the symbols of the reliable segment, the symbol reliability metric, in terms of an a posteriori LLR of encoded bits which is larger than a certain threshold, is iteratively cancelled with the QRSFSIC in order to further obtain the residual signal for evaluating the symbols in the unreliable segment. This is done until the unreliable segment is empty, resulting in the extrinsic information for a RM turbo-coded bit with the greatest likelihood. Bridged by de-multiplexing and multiplexing, an iterative QRSFSIC detection is concatenated with an iterative trellis-based maximum a posteriori probability RM turbo decoder as if a principal Turbo detection and decoder is embedded with an iterative subordinate QRSFSIC detection and a RM turbo decoder, exchanging each other's detection and decoding soft-decision information iteratively. These three stages let the proposed algorithm approach the upper bound of the diversity. The simulation results also show that the proposed scheme outperforms the other suboptimum detectors considered in this paper. [ABSTRACT FROM AUTHOR]

Multiobjective evolutionary algorithm based on decomposition (MOEA/D) decomposes a multiobjective optimization problem into a set of scalar optimization subproblems and optimizes them in a collaborative manner. Subproblems and solutions are two sets of agents that naturally exist in MOEA/D. The selection of promising solutions for subproblems can be regarded as a matching between subproblems and solutions. Stable matching, proposed in economics, can effectively resolve conflicts of interests among selfish agents in the market. In this paper, we advocate the use of a simple and effective stable matching (STM) model to coordinate the selection process in MOEA/D. In this model, subproblem agents can express their preferences over the solution agents, and vice versa. The stable outcome produced by the STM model matches each subproblem with one single solution, and it tradeoffs convergence and diversity of the evolutionary search. Comprehensive experiments have shown the effectiveness and competitiveness of our MOEA/D algorithm with the STM model. We have also demonstrated that user-preference information can be readily used in our proposed algorithm to find a region that decision makers are interested in. [ABSTRACT FROM AUTHOR]

The dynamics of the particle size distribution (PSD) of polydispersed fuel spray is important in the evaluation of the combustion process. A better understanding of the dynamics can provide a tool for selecting a PSD that will more effectively meet the needs of the system. In this paper, we present an efficient and elegant method for evaluating the dynamics of the PSD. New insights into the behaviour of polydispersed fuel spray were obtained. A simplified theoretical model was applied to the experimental data and a known approximation of the polydispersed fuel spray. This model can be applied to any distribution, not necessarily an experimental distribution or approximation, and involves a time-dependent function of the PSD. Such simplified models are particularly helpful in qualitatively understanding the effects of various sub-processes. Our main results show that during the self-ignition process, the radii of the droplets decreased as expected, and the number of smaller droplets increased in inverse proportion to the radius. An important novel result (visualised by graphs) demonstrates that the mean radius of the droplets initially increases for a relatively short period of time, which is followed by the expected decrease. Our modified algorithm is superior to the well-known 'parcel' approach because it is much more compact; it permits analytical study because the right-hand sides of the mathematical model are smooth, and thus eliminates the need for a numerical algorithm to transition from one parcel to another. Moreover, the method can provide droplet radii resolution dynamics because it can use step functions that accurately describe the evolution of the radii of the droplets. The method explained herein can be applied to any approximation of the PSD, and involves a comparatively negligible computation time. [ABSTRACT FROM AUTHOR]

This paper proposes and evaluates a near admissible heuristic search strategy and its application to a kind of flexible manufacturing system (FMS) scheduling in a Petri net framework. Petri nets can concisely model the strict precedence constraint, multiple kinds of resources, and concurrent activities. To cope with the complexities for scheduling of FMS with alternative routings, this paper proposes an admissible heuristic function based on the execution of P-timed Petri nets and presents an improved dynamic weighting A* strategy using the proposed heuristic function. The search scheme does not need to predict the depth of solution in advance and the quality of the search result is also controllable. Some numerical experiments are carried out to demonstrate usefulness of the algorithm. [ABSTRACT FROM AUTHOR]

The problem of determining the failure rate of a series system according to the failure rates of the component elements is solved in the literature, a reference in the field being the work [4]. There is no direct relationship between the failure rate of a parallel system and the failure rates of the component elements. In this paper we will deduce an exact relation between the failure rate of a parallel system and the failure rates of the component elements, their reliability and the reliability of the system. Starting from the exact relationship we will deduce a simpler relation of the failure rate of a parallel system by studying the asymptotic failure rate behaviour. [ABSTRACT FROM AUTHOR]

Modeling of a time-varying dynamical system provides insights into the functions of biological neural networks and contributes to the development of next-generation neural prostheses. In this paper, we have formulated a novel sparse multiwavelet-based generalized Laguerre-Volterra (sMGLV) modeling framework to identify the time-varying neural dynamics from multiple spike train data. First, the significant inputs are selected by using a group least absolute shrinkage and selection operator (LASSO) method, which can capture the sparsity within the neural system. Second, the multiwavelet-based basis function expansion scheme with an efficient forward orthogonal regression (FOR) algorithm aided by mutual information is utilized to rapidly capture the time-varying characteristics from the sparse model. Quantitative simulation results demonstrate that the proposed sMGLV model in this paper outperforms the initial full model and the state-of-the-art modeling methods in tracking performance for various time-varying kernels. Analyses of experimental data show that the proposed sMGLV model can capture the timing of transient changes accurately. The proposed framework will be useful to the study of how, when, and where information transmission processes across brain regions evolve in behavior. [ABSTRACT FROM AUTHOR]

gggggAssume that an n × n dot matrix is stored in consecutive n words of a computer with one word being n bit. This paper discusses eight operations to rotate or transpose the dot matrix in horizontal/vertical! slant direction. As is well known, such operations form a group. This paper presents a unified description of the algorithms, and it is shown that all eight algorithms can be derived by suit- ably setting the constants in the unified algorithm. Then it is shown that the algorithms can be transformed to each other by simple transformation rules for the constants, and those transformation rules are shown to form a group. The foregoing algorithms for the dot matrix are not unique, and there can be different descriptions for the algorithm producing the same result. Consequently, there can be various versions of the eight algorithms as well as versions of transformation rules. This paper shows that one of the two groups formed by the transformation rules is isomorphic to the group of algorithms, but the other is not isomorphic. [ABSTRACT FROM AUTHOR]

This paper is a review of the use of particulate discrete element modeling (DEM) in geomechanics. The overall objective of the paper is to serve as an introduction to researchers and practitioners in geomechanics who are considering adopting DEM in their work or using the results of DEM simulations to guide other studies, for example, the development of constitutive models for continuum-based numerical analysis. It is hoped that prior converts to the use of DEM will also benefit from a relatively objective overview of current DEM use in geomechanics. The introductory sections present the background to the method and give an overview of the evolution of the use of particulate DEM in recent geotechnical research. The general principals of the algorithm are then presented, considering the types of particles typically used, the calculation of contact forces, and formulation of simulation boundary conditions. Some techniques available to interpret and postprocess of DEM results and provide the information to link the particle scale and overall response are outlined. Approaches used to validate and calibrate DEM models to verify that DEM simulation results representative of physical reality are discussed. An overview of the application of DEM modeling to field-scale problems is then presented. Finally the conclusions consider future developments in the area and emphasize the need to maintain quality in DEM simulations. [ABSTRACT FROM AUTHOR]

This paper presents an adaptive method for tracking the amplitude, phase, and frequency of a time-varying sinusoid in white noise. Although the conventional techniques like adaptive linear elements and discrete or fast Fourier transforms are still widely used in many applications, their accuracy and convergence speed pose serious limitations under sudden supply frequency drift, fundamental amplitude, or phase variations. This paper, therefore, proposes a fast and low-complexity multiobjective Gauss–Newton algorithm for estimating the fundamental phasor and frequency of the power signal instantly and accurately. Further, the learning parameters in the proposed algorithm are tuned iteratively to provide faster convergence and better accuracy. The proposed method can also be extended to include time-varying harmonics and interharmonics mixed with noise of low signal-to-noise ratio with a great degree of accuracy. Numerical and experimental results are presented in support of the effectiveness of the new approach. [ABSTRACT FROM AUTHOR]

This paper focuses on the optimization of a linear actuator by the “output space mapping (OSM)” method. The underlying objective of this work lies in the minimization of the time required for the achievement of this optimal design. Indeed, in addition to the sole costs of optimization processes strictly speaking, the time needed for the developpement of the models is taken into account. In the context of OSM, two different finite-element models of the same actuator are used. This paper presents these modeling solutions and considers their corresponding accuracy. Results of this multi-objective optimization method are presented and compared with those obtained by the sequential simplex (SS) method based solely on the fine model. Both approaches give similar results. However, the comparison of their performances clearly shows that the OSM algorithm is an effective technique for reducing the computation time of optimization studies, even in the case of relatively simple electromagnetic structures. Hence, this approach leads to an original and effective optimization methodology. [ABSTRACT FROM AUTHOR]

ABS methods have been studied a lot in last few years . This paper gives a review of work done by few researchers for applying ABS algorithm for different problems i.e; for solving determined or undetermined linear systems , linear least square optimization problem and integer equations and linear programming problems. [ABSTRACT FROM AUTHOR]

Purpose - The purpose of this paper is to provide a theoretical model for considering ease numerically in the clothing pattern. Classifying the pattern as a geometric Cartesian coordinate system, this model proposes the need to quantify the partly coincident variables of ease, which will enable greater control over garment fit and function, using traditional or CAD/CAM methods. Design/methodology/approach - The principles of pattern/garment dimensions are considered with support from analysis of literature and contributing factors to the variables of ease are categorised. These principles support a proposed theoretical model for considering pattern/garment dimensions, in the numeric format that they exist within the context of pattern construction. Findings - Pattern construction occurs in a 2D Cartesian coordinate system, guided by body dimensions and ease. This can be modelled in the form of an algorithm relating to the placement of cardinal points defining the pattern outline. Recognition of the numerical nature of the pattern, suggests the need to quantify the coincident variables of ease, to achieve greater control over garment fit and function. Research limitations/implications - Few sources exist enabling the recognition of ease requirements in the pattern/garment and when guidance on ease is presented, there is little rationale as to how it has been established, or what contributes to its definition. Originality/value - The paper shows how current methods of pattern construction can be modelled more effectively, recognising the geometric nature on which they are based. Modelling these relationships highlights where quantification can be provided, by existing knowledge or future research. [ABSTRACT FROM AUTHOR]

Neural network was introduced to sneak circuit analysis (SCA) in previous works. However, it may generate suspect results which were hard to explain. To overcome the shortcomings, this paper proposed a novel neural network model based on circuit architecture, named CArNN, which is used as an individual of an ensemble. In CArNN, neurons represented system components, and weights represented the joints between components. Models of neurons are sigmoid functions. Clone selection algorithm was used to train CArNNs population. The trained antibodies were used as individuals of an ensemble. The inputs of CArNN are states of switches, and the outputs are states of functional components. Ensemble predicted all possible functions of circuit. The sneak circuits can be discovered by comparing the predicted and designed functions. The results revealed that CArNNs can exactly discover sneak circuits. [ABSTRACT FROM AUTHOR]

A Centroid Neural Network with Weighted Features (CNN-WF) is proposed and presented in this paper. The proposed CNN-WF is based on a Centroid Neural Network (CNN), an effective clustering tool that has been successfully applied to various problems. In order to evaluate the importance of each feature in a set of data, a feature weighting concept is introduced to the Centroid Neural Network in the proposed algorithm. The weight update equations for CNN-WF are derived by applying the Lagrange multiplier procedure to the objective function constructed for CNN-WF in this paper. The use of weighted features makes it possible to assess the importance of each feature and to reject features that can be considered as noise in data. Experiments on a synthetic data set and a typical image compression problem show that the proposed CNN-WF can assess the importance of each feature and the proposed CNN-WF outperforms conventional algorithms including the Self-Organizing Map (SOM) and CNN in terms of clustering accuracy. [ABSTRACT FROM AUTHOR]

An algorithm that is capable not only of tracking multiple targets but also of "track management"-meaning that it does not need to know the number of targets as a user input-is of considerable interest. In this paper we devise a recursive track-managed filter via a quantized state-space ("bin") model. In the limit, as the discretization implied by the bins becomes as refined as possible (infinitesimal bins) we find that the filter equations are identical to Mahier's probability hypothesis density (PHD) filter, a novel trackmanaged filtering scheme that is attracting increasing attention. Thus, one contribution of this paper is an interpretation of, if not the PHD itself, at least what the PHD is doing. This does offer some intuitive appeal, but has some practical use as well: with this model it is possible to identify the PHD's "target-death" problem, and also the statistical inference structures of the PHD filters. To obviate the target death problem, PHD originator Mahler developed a new "cardinalized" version of PHD (CPHD). The second contribution of this paper is to extend the "bin-occupancy" model such that the resulting recursive filter is identical to the cardinalized PHD filter. [ABSTRACT FROM AUTHOR]

Copyright of Transactions of Nanjing University of Aeronautics & Astronautics is the property of Editorial Department of Journal of Nanjing University of Aeronautics & Astronautics 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.)

Partitional clustering is an important part of cluster analysis. Based on various theories, numerous clustering algorithms have been developed, and new clustering algorithms continue to appear in the literature. It is known that Occam's razor plays a pivotal role in data-based models, and partitional clustering is categorized as a data-based model. However, no relation had previously been discovered between Occam's razor and partitional clustering, as we discuss in this paper. The three main contributions of this paper can be summarized as follows: 1) According to a novel definition of the mean, a unifying generative framework for partitional clustering algorithms, called a general c-means clustering model (GCM), is presented and studied. 2) Based on the local optimality test of the GCM, the connection between Occam's razor and partitional clustering is established for the first time. As its application, a comprehensive review of the existing objective function-based clustering algorithms is presented based on GCM. 3) Under a common assumption about partitional clustering, a theoretical guide for devising and implementing clustering algorithm is discovered. These conclusions are verified by numerical experimental results. [ABSTRACT FROM AUTHOR]

Purpose - This paper describes an approach for the automatic calculation of view factors between surfaces of arbitrary shape, when taking into account possible screening effects due to intermediate surfaces. Design/methodology/approach - The specifically developed numerical code is based on the utilization of boundary elements to fit the surfaces of an algorithm solving the shadow effect and on a Monte Carlo method for the numerical integrations. Findings - The code has been tested for a set of geometrical configurations. It was clearly shown that it obtains good results in terms of accuracy and computing time. Its accuracy increases when the mesh of radiative surfaces is finer. Research limitations/implications - The use of the code is limited to opaque surfaces separated by an isothermal semi-transparent medium which can be absorbent but not diffusing of the thermal radiation. Practical implications - The study of the radiative exchanges between opaque surfaces with shadow effects due to intermediate surfaces may have concrete practical applications by using this code. Indeed, the code has been used for an industrial application, in order to evaluate view factors inside an enclosure, in the framework of studies concerned with the thermal comfort inside cars. Originality/value - The originality of this paper lies in taking into account the surfaces of complex geometries by using a boundary elements approximation, the algorithm solving the shadow effect, based on the convexity of the quadrilateral in 2D or the polyhedron in 3D. [ABSTRACT FROM AUTHOR]

This paper describes a new Monte Carlo method based on a novel stochastic potential switching algorithm. This algorithm enables the equilibrium properties of a system with potential V to be computed using a Monte Carlo simulation for a system with a possibly less complex stochastically altered potential V. By proper choices of the stochastic switching and transition probabilities, it is shown that detailed balance can be strictly maintained with respect to the original potential V. The validity of the method is illustrated with a simple one-dimensional example. The method is then generalized to multidimensional systems with any additive potential, providing a framework for the design of more efficient algorithms to simulate complex systems. A near-critical Lennard-Jones fluid with more than 20 000 particles is used to illustrate the method. The new algorithm produced a much smaller dynamic scaling exponent compared to the Metropolis method and improved sampling efficiency by over an order of magnitude. [ABSTRACT FROM AUTHOR]

Recent contributions to the financial econometrics literature exploit high-frequency (HF) data to improve models for daily asset returns. This paper proposes a new class of dynamic extreme value models that profit from HF data when estimating the tails of daily asset returns. Our realized peaks-over-threshold approach provides estimates for the tails of the time-varying conditional return distribution. An in-sample fit to the S&P 500 index returns suggests that HF data convey information on daily extreme returns beyond that included in low frequency (LF) data. Finally, out-of-sample forecasts of conditional risk measures obtained with HF measures outperform those obtained with LF measures. [ABSTRACT FROM AUTHOR]

Machines are a key element in the production system and their failure causes irreparable effects in terms of cost and time. In this paper, a new multi-objective mathematical model for dynamic cellular manufacturing system (DCMS) is provided with consideration of machine reliability and alternative process routes. In this dynamic model, we attempt to resolve the problem of integrated family (part/machine cell) formation as well as the operators' assignment to the cells. The first objective minimizes the costs associated with the DCMS. The second objective optimizes the labor utilization and, finally, a minimum value of the variance of workload between different cells is obtained by the third objective function. Due to the NP-hard nature of the cellular manufacturing problem, the problem is initially validated by the GAMS software in small-sized problems, and then the model is solved by two well-known meta-heuristic methods including non-dominated sorting genetic algorithm and multi-objective particle swarm optimization in large-scaled problems. Finally, the results of the two algorithms are compared with respect to five different comparison metrics. [ABSTRACT FROM AUTHOR]

This paper aims to solve large continuous p-centre problems optimally by re-examining a recent relaxation-based algorithm. The algorithm is strengthened by adding four mathematically supported enhancements to improve its efficiency. This revised relaxation algorithm yields a massive reduction in computational time enabling for the first time larger data-sets to be solved optimally (e.g., up to 1323 nodes). The enhanced algorithm is also shown to be flexible as it can be easily adapted to optimally solve related practical location problems that are frequently faced by senior management when making strategic decisions. These include the -neighbour p-centre problem and the conditional p-centre problem. A scenario analysis using variable is also performed to provide further managerial insights. [ABSTRACT FROM AUTHOR]

In this paper, we present an interior point method for nonlinear programming that avoids the use of penalty function or filter. We use an adaptively perturbed primal dual interior point framework to computer trial steps and a central path technique is used to keep the iterate bounded away from 0 and not to deviate too much from the central path. A trust-funnel-like strategy is adopted to drive convergence. We also use second-order correction (SOC) steps to achieve fast local convergence by avoiding Maratos effect. Furthermore, the presented algorithm can avoid the blocking effect. It also does not suffer the blocking of productive steps that other trust-funnel-like algorithm may suffer. We show that, under second-order sufficient conditions and strict complementarity, the full Newton step (combined with an SOC step) will be accepted by the algorithm near the solution, and hence the algorithm is superlinearly local convergent. Numerical experiments results, which are encouraging, are reported. [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]

The results of testing formula simplification tools are presented in the first part of this paper. In the second part, an algorithm for constructing canonical forms of linear semi-algebraic formulas is described. The main result of the study is the definition of the canonical form of a linear semi-algebraic formula that has the property of uniqueness and other useful properties. An algorithm for constructing such a formula is described. [ABSTRACT FROM AUTHOR]

This paper introduces a computational framework to analyze global identification of linearized DSGE models. A formal identification condition is established that relies on the restrictions linking the observationally equivalent state space representations and on the inherent constraints imposed by the model solution on the deep parameters. This condition is next used to develop an algorithm that checks global identification by searching for observationally equivalent model parametrizations. The algorithm is efficient as the identification conditions it employs shrink considerably the space of candidate deep parameter points and the model does not need to be solved at each of these points. The working of the algorithm is demonstrated with two examples. [ABSTRACT FROM AUTHOR]

We introduce a new algorithm of proper generalized decomposition (PGD) for parametric symmetric elliptic partial differential equations. For any given dimension, we prove the existence of an optimal subspace of at most that dimension which realizes the best approximation---in the mean parametric norm associated to the elliptic operator---of the error between the exact solution and the Galerkin solution calculated on the subspace. This is analogous to the best approximation property of the proper orthogonal decomposition (POD) subspaces, except that in our case the norm is parameter-dependent. We apply a deflation technique to build a series of approximating solutions on finite-dimensional optimal subspaces, directly in the online step, and we prove that the partial sums converge to the continuous solution in the mean parametric elliptic norm. We show that the standard PGD for the considered parametric problem is strongly related to the deflation algorithm introduced in this paper. This opens the possibility of computing the PGD expansion by directly solving the optimization problems that yield the optimal subspaces. [ABSTRACT FROM AUTHOR]

The Euler genus of a graph is a fundamental and well-studied parameter in graph theory and topology. Computing it has been shown to be NP-hard by Thomassen [J. Algorithms, 10 (1989), pp. 568{576; J. Combin. Theory, Ser. B, 57 (1993), pp. 196{206], and it is known to be fixed-parameter tractable. However, the approximability of the Euler genus is wide open. While the existence of an O(1)-approximation is not ruled out, only an O( p n)-approximation [J. Chen, S. P. Kanchi, and A. Kanevsky, Inform. Process. Lett., 61 (1997), pp. 317{322] is known even in bounded-degree graphs. In this paper we give a polynomial-time algorithm which, given a boundeddegree graph of Euler genus g, computes a drawing in a surface of Euler genus gO(1) · logO(1) n. Combined with the upper bound from [J. Chen, S. P. Kanchi, and A. Kanevsky, Inform. Process. Lett., 61 (1997), pp. 317{322], our result also implies a O(n1/2-α)-approximation for some constant α > 0. Using our algorithm for approximating the Euler genus as a subroutine, we obtain, in a uniform fashion, algorithms with approximation ratios of the form OPTO(1) · logO(1) n for several related problems on bounded-degree graphs. These include the problems of orientable genus, crossing number, and planar edge and vertex deletion. Our algorithm and proof of correctness for the crossing number problem are simpler compared to the long and difficult proof in the recent breakthrough by Chuzhoy [Proceedings of the ACM Symposium on Theory of Computing, 2011, pp. 303{312], while essentially obtaining a qualitatively similar result. For planar edge and vertex deletion problems our results are the first to obtain a bound of the form poly(OPT; log n). We also highlight some further applications of our results in the design of algorithms for graphs with small genus. Many such algorithms require that a drawing of the graph is given as part of the input. Our results imply that in several interesting cases, we can implement such algorithms even when the drawing is unknown. [ABSTRACT FROM AUTHOR]

Place descriptions in everyday communication or in online text provide a rich source of spatial knowledge about places. Such descriptions typically consist of references to places and spatial relationships between them. An important step to utilize such knowledge in information systems is georeferencing the referred places. Beside place name disambiguation, another challenge is that a significant proportion of place references in such descriptions are not official place names indexed by gazetteers, thus cannot be resolved easily. This paper presents a novel approach for georeferencing places from collective descriptions using place graphs, regardless of whether they are referred to by gazetteered names or not. The approach leverages spatial relation models for approximate locating and matching. Different models are proposed and evaluated using several metrics. [ABSTRACT FROM AUTHOR]

In this paper we present a new algorithmic realization of a projection-based scheme for general convex constrained optimization problem. The general idea is to transform the original optimization problem to a sequence of feasibility problems by iteratively constraining the objective function from above until the feasibility problem is inconsistent. For each of the feasibility problems one may apply any of the existing projection methods for solving it. In particular, the scheme allows the use of subgradient projections and does not require exact projections onto the constraints sets as in existing similar methods. We also apply the newly introduced concept of superiorization to optimization formulation and compare its performance to our scheme. We provide some numerical results for convex quadratic test problems as well as for real-life optimization problems coming from medical treatment planning. [ABSTRACT FROM AUTHOR]

The ziggurat method is a fast random variable generation method introduced by Marsaglia and Tsang in a series of papers. We discuss how the ziggurat method can be implemented for low-discrepancy sequences, and present algorithms and numerical results when the method is used to generate samples from the normal and gamma distributions. [ABSTRACT FROM AUTHOR]

Decision-tree induction algorithms are widely used in machine learning applications in which the goal is to extract knowledge from data and present it in a graphically intuitive way. The most successful strategy for inducing decision trees is the greedy top-down recursive approach, which has been continuously improved by researchers over the past 40 years. In this paper, we propose a paradigm shift in the research of decision trees: instead of proposing a new manually designed method for inducing decision trees, we propose automatically designing decision-tree induction algorithms tailored to a specific type of classification data set (or application domain). Following recent breakthroughs in the automatic design of machine learning algorithms, we propose a hyper-heuristic evolutionary algorithm called hyper-heuristic evolutionary algorithm for designing decision-tree algorithms (HEAD-DT) that evolves design components of top-down decision-tree induction algorithms. By the end of the evolution, we expect HEAD-DT to generate a new and possibly better decision-tree algorithm for a given application domain. We perform extensive experiments in 35 real-world microarray gene expression data sets to assess the performance of HEAD-DT, and compare it with very well known decision-tree algorithms such as C4.5, CART, and REPTree. Results show that HEAD-DT is capable of generating algorithms that significantly outperform the baseline manually designed decision-tree algorithms regarding predictive accuracy and F-measure. [ABSTRACT FROM AUTHOR]

In this paper, we introduce and analyze a general iterative algorithm for finding a common solution of a finite family of mixed equilibrium problems, a general system of generalized equilibria and a fixed point problem of nonexpansive mappings in a real Hilbert space. Under some appropriate conditions, we derive the strong convergence of the sequence generated by the proposed algorithm to a common solution, which also solves some optimization problem. The result presented in this paper improves and extends some corresponding ones in the earlier and recent literature. [ABSTRACT FROM AUTHOR]

Most of filtering algorithms can remove noise to a large extent, but make the image edge blurred and distorted as a result of implementing uniformly across the image and thus tending to modify both noise and noise-free pixels. When an image is covered with high density noise many original information of the image can't be seen and known. That means the image could be taken as a grey system. This paper proposes an algorithm for both image denoising and image edge preserving. The proposed method is based on noise recognition and grey theory. It consists of a novel model for noise removal using grey model. This method provides only "noise" pixels for processing. Computer simulations are carried out to assess the performance of the proposed method using test images which are corrupted by 20% and 50% salt & pepper noise, respectively. Experimental results are given to demonstrate the denoising performance of our algorithm. It gives better result in visual quality and numerical results in terms of both the mean square error and peak signal-to-noise ratio (PSNR) when compared to three other existing methods. The experimental results show the great potential of the proposed model. [ABSTRACT FROM AUTHOR]

Capacitated Facility Location Problem (CFLP) as one of the most important problems in operations research is nowadays widely used in real life. Although many researchers have studied the CFLP in a deterministic environment, their proposed models cannot satisfactorily accommodate various customer demands in the real world. Thus, this paper focuses on the CFLP random fuzzy environment using (α ,β)-cost minimization model under the Hurwicz criterion. Furthermore, it is proved that this model can deal with various CFLPs in random, fuzzy and random fuzzy environments. In order to solve this model, the simplex algorithm, fuzzy simulations and a firefly algorithm are integrated to produce a hybrid intelligent algorithm. Finally, some numerical examples are presented to illustrate the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

High accuracy surface modeling (HASM) is a novel surface modeling method. The well known preconditioned conjugate gradient (PCG) method is used to solve the equations produced by HASM. In this paper, in order to improve the convergence rate of PCG, we use two preconditioners: incomplete Cholesky decomposition conjugate gradient method (ICCG) and symmetric successive over relaxation-preconditioned conjugate gradient method (SSORCG), which have not previously been available for use with HASM. Furthermore, we give adequate storage scheme of the large sparse matrix and optimize the performance of sparse matrix-vector multiplication. We test the proposed method on a Dell OP990 machine. Numerical tests show that ICCG has the fastest convergence rate of HASM. We also find that both ICCG and SSORCG have much faster convergence rates than some available solvers. [ABSTRACT FROM AUTHOR]

A new combined numerical algorithm for solving inverse problems of epidemiology is described in this paper. The combined algorithm consists of optimization and iterative methods, and determines the parameters specific to a particular population by using the statistical information for a few previous years. The coefficients of the epidemiology model describe particular qualities of the population and the development of the disease. The inverse problem of parameter identification in a mathematical model is reduced to the problem of minimizing an objective function characterizing the square deviation of the statistical data from the experimental data. The combination of statistical and optimization algorithms demonstrates the identification of parameters with an appropriate relative accuracy of 30%. The results can be used by public health organizations to predict the infectious disease epidemic in a given region by comparing the data of simulation with historical data. [ABSTRACT FROM AUTHOR]

The block inverse iteration and block Newton’s methods proposed by the authors of this paper for computing invariant pairs of regular linear matrix pencils are generalized to the case of regular nonlinear matrix pencils. Numerical properties of the proposed methods are demonstrated with a typical quadratic eigenproblem. [ABSTRACT FROM AUTHOR]

The power system always has several variations in its profile due to random load changes or environmental effects such as device switching effects when generating further transients. Thus, an accurate mathematical model is important because most system parameters vary with time. Curve modeling of power generation is a significant tool for evaluating system performance, monitoring and forecasting. Several numerical techniques compete to fit the curves of empirical data such as wind, solar, and demand power rates. This paper proposes a new modified methodology presented as a parametric technique to determine the system’s modeling equations based on the Bode plot equations and the vector fitting (VF) algorithm by fitting the experimental data points. The modification is derived from the familiar VF algorithm as a robust numerical method. This development increases the application range of the VF algorithm for modeling not only in the frequency domain but also for all power curves. Four case studies are addressed and compared with several common methods. From the minimal RMSE, the results show clear improvements in data fitting over other methods. The most powerful features of this method is the ability to model irregular or randomly shaped data and to be applied to any algorithms that estimating models using frequency-domain data to provide state-space or transfer function for the model. [ABSTRACT FROM AUTHOR]

Copyright of Electronics & Control Systems is the property of National Aviation University 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 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]

In this paper, we propose an iteratively reweightedminimization algorithm (IRL1 algorithm) for solving the elasticminimization problem. We prove that any sequence generated by the IRL1 algorithm is bounded and asymptotically regular. We also prove that the sequence is convergent for any rationaland the limit is a stationary point of the elasticminimization problem. Moreover, under certain conditions, we present an error bound between the limit point of convergent sequence and the sparse solution of underdetermined linear system. Numerical experiments on sparse vector recovery are presented to demonstrate the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

The work is focused on the study of the tsunami source reconstruction problem based on the wave level observations. The problem within the linear shallow water model and the 'piston' model of tsunami wave generation is considered. This problem relates to the class of incorrectly posed problems, its study is based on the general approach described in [2]. In this paper a theorem on the solvability of the problem is proved and the results of numerical experiments for the Pacific Ocean confirming the efficiency of the proposed solution algorithms are presented. [ABSTRACT FROM AUTHOR]

A discrete element code with impact model has been developed and calibrated to simulate the dynamic behavior of rock materials, with special regard to rock fragmentation upon impact during rock-fall analysis. The paper summarizes the discrete element code, the calibration algorithms developed to identify the model microparameters, and the impact model. Experimental work on drop tests is then used to validate the code on modeling impact fragmentation. It has been found that the developed discrete element code and impact model can reasonably simulate rock fragmentation in drop tests. The use of the discrete element code and impact model can provide good reference results in evaluating impact fragmentation in rock-fall analysis. [ABSTRACT FROM AUTHOR]

Real life data sets often suffer from missing data. The neuro-rough-fuzzy systems proposed hitherto often cannot handle such situations. The paper presents a neuro-fuzzy system for data sets with missing values. The proposed solution is a complete neuro-fuzzy system. The system creates a rough fuzzy model from presented data (both full and with missing values) and is able to elaborate the answer for full and missing data examples. The paper also describes the dedicated clustering algorithm. The paper is accompanied by results of numerical experiments. [ABSTRACT FROM AUTHOR]