246 results
Search Results
2. A combinatorial algorithm for computing the rank of a generic partitioned matrix with 2×2 submatrices.
- Author
-
Hirai, Hiroshi and Iwamasa, Yuni
- Subjects
- *
MATRICES (Mathematics) , *ALGORITHMS , *MATHEMATICS , *GENERALIZATION , *BIPARTITE graphs - Abstract
In this paper, we consider the problem of computing the rank of a block-structured symbolic matrix (a generic partitioned matrix) A = (A α β x α β) , where A α β is a 2 × 2 matrix over a field F and x α β is an indeterminate for α = 1 , 2 , ⋯ , μ and β = 1 , 2 , ⋯ , ν . This problem can be viewed as an algebraic generalization of the bipartite matching problem and was considered by Iwata and Murota (SIAM J Matrix Anal Appl 16(3):719–734, 1995). Recent interests in this problem lie in the connection with non-commutative Edmonds' problem by Ivanyos et al. (Comput Complex 27:561–593, 2018) and Garg et al. (Found. Comput. Math. 20:223–290, 2020), where a result by Iwata and Murota implicitly states that the rank and non-commutative rank (nc-rank) are the same for this class of symbolic matrices. The main result of this paper is a simple and combinatorial O ((μ ν) 2 min { μ , ν }) -time algorithm for computing the symbolic rank of a (2 × 2) -type generic partitioned matrix of size 2 μ × 2 ν . Our algorithm is inspired by the Wong sequence algorithm by Ivanyos et al. for the nc-rank of a general symbolic matrix, and requires no blow-up operation, no field extension, and no additional care for bounding the bit-size. Moreover it naturally provides a maximum rank completion of A for an arbitrary field F . [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
3. The recursive quasi-orthogonal polynomial algorithm.
- Author
-
Sidki, S. and Sadaka, R.
- Subjects
- *
POLYNOMIALS , *ALGORITHMS , *ORTHOGONAL polynomials , *SCHUR complement , *MATHEMATICS - Abstract
Theory of quasi-orthogonal polynomials is significantly related to constructing vector Padé approximations. The present paper introduces an efficient procedure to compute adjacent families of quasi-orthogonal polynomials as defined in Sadaka (Appl. Numer. Math. 21:57–70, 1996) and Sadaka (Appl. Numer. Math. 24:483–499, 1997). The derived algorithm uses short recursive relations whose coefficients are written in terms of lower triangular block determinants. The strategy of computing such determinants is given and analyzed. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
4. On the analytical derivation of efficient sets in quad-and-higher criterion portfolio selection.
- Author
-
Qi, Yue and Steuer, Ralph E.
- Subjects
- *
DIVIDEND yield , *ALGORITHMS , *MATHEMATICS , *PARABOLOID , *SUSTAINABILITY - Abstract
This paper provides results in the area of the analytical derivation of the efficient set of a mean-variance portfolio selection problem that has more than three criteria. By "analytical" we mean derived by formula as opposed to being computed by algorithm. By "more than three criteria", we mean that beyond the mean and variance of regular portfolio selection, the problems addressed have two or more additional linear objectives. The additional objectives might include sustainability, dividend yield, liquidity, and R&D as extra objectives like these are being seen with greater frequency. While not all multiple criteria portfolio selection problems lend themselves to an analytical derivation, a certain class does and the problems in this class are covered by the mathematics of this paper. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
5. Numerical algorithms for the determinants of opposite-bordered and singly-bordered tridiagonal matrices.
- Author
-
Jia, Ji-Teng
- Subjects
- *
ALGORITHMS , *SYLVESTER matrix equations , *MATRICES (Mathematics) , *SYMBOLIC computation , *COMPETITION (Psychology) , *MATHEMATICS - Abstract
A recursive algorithm for the determinant evaluation of general opposite-bordered tridiagonal matrices has been proposed by Jia et al. (J Comput Appl Math 290:423–432, 2015). Since the algorithm is a symbolic algorithm, it never suffers from breakdown. However, it may be time-consuming when many symbolic names emerge during the symbolic computation. In this paper, without using symbolic computation, first we present a novel breakdown-free numerical algorithm for computing the determinant of an n-by-n opposite-bordered tridiagonal matrix, which does not require any extra memory storage for the implementation. Then, we present a cost-efficient algorithm for the determinants of opposite-bordered tridiagonal matrices based on the use of the combination of an elementary column operation and Sylvester's determinant identity. Furthermore, we provide some numerical results with simulations in Matlab implementation in order to demonstrate the accuracy and efficiency of the proposed algorithms, and their competitiveness with other existing algorithms. The corresponding results in this paper can be readily obtained for computing the determinants of singly-bordered tridiagonal matrices. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
6. Evaluating class and school effects on the joint student achievements in different subjects: a bivariate semiparametric model with random coefficients.
- Author
-
Masci, Chiara, Ieva, Francesca, Agasisti, Tommaso, and Paganoni, Anna Maria
- Subjects
- *
ACADEMIC achievement , *EXPECTATION-maximization algorithms , *DISTRIBUTION (Probability theory) , *ALGORITHMS , *MATHEMATICS students , *MATHEMATICS - Abstract
This paper proposes an innovative statistical method to measure the impact of the class/school on student achievements in multiple subjects. We propose a semiparametric model for a bivariate response variable with random coefficients, that are assumed to follow a discrete distribution with an unknown number of support points, together with an Expectation-Maximization algorithm—called BSPEM algorithm—to estimate its parameters. In the case study, we apply the BSPEM algorithm to data about Italian middle schools, considering students nested within classes, and we identify subpopulations of classes, standing on their effects on student achievements in reading and mathematics. The proposed model is extremely informative in exploring the correlation between multiple class effects, which are typical of the educational production function. The estimated class effects on reading and mathematics student achievements are then explained in terms of various class and school level characteristics selected by means of a LASSO regression. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
7. Proximal point algorithms based on S-iterative technique for nearly asymptotically quasi-nonexpansive mappings and applications.
- Author
-
Sahu, D. R., Kumar, Ajeet, and Kang, Shin Min
- Subjects
- *
NONEXPANSIVE mappings , *CONVEX sets , *ALGORITHMS , *POINT set theory , *MATHEMATICS - Abstract
In this paper, we combine the S-iteration process introduced by Agarwal et al. (J. Nonlinear Convex Anal., 8(1), 61–79 2007) with the proximal point algorithm introduced by Rockafellar (SIAM J. Control Optim., 14, 877–898 1976) to propose a new modified proximal point algorithm based on the S-type iteration process for approximating a common element of the set of solutions of convex minimization problems and the set of fixed points of nearly asymptotically quasi-nonexpansive mappings in the framework of CAT(0) spaces and prove the △-convergence of the proposed algorithm for solving common minimization problem and common fixed point problem. Our result generalizes, extends and unifies the corresponding results of Dhompongsa and Panyanak (Comput. Math. Appl., 56, 2572–2579 2008), Khan and Abbas (Comput. Math. Appl., 61, 109–116 2011), Abbas et al. (Math. Comput. Modelling, 55, 1418–1427 2012) and many more. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
8. Quick but Odd Growth of Cacti.
- Author
-
Kolay, Sudeshna, Lokshtanov, Daniel, Panolan, Fahad, and Saurabh, Saket
- Subjects
- *
GRAPH theory , *GEOMETRIC vertices , *ALGORITHMS , *INTEGERS , *MATHEMATICS - Abstract
Let $${\mathcal {F}}$$ be a family of graphs. Given an n-vertex input graph G and a positive integer k, testing whether G has a vertex subset S of size at most k, such that $$G-S$$ belongs to $${\mathcal {F}}$$ , is a prototype vertex deletion problem. These type of problems have attracted a lot of attention in recent times in the domain of parameterized complexity. In this paper, we study two such problems; when $${\mathcal {F}}$$ is either the family of forests of cacti or the family of forests of odd-cacti. A graph H is called a forest of cacti if every pair of cycles in H intersect on at most one vertex. Furthermore, a forest of cacti H is called a forest of odd cacti, if every cycle of H is of odd length. Let us denote by $${\mathcal {C}}$$ and $${{\mathcal {C}}}_\mathsf{odd}$$ , the families of forests of cacti and forests of odd cacti, respectively. The vertex deletion problems corresponding to $${\mathcal {C}}$$ and $${{\mathcal {C}}}_\mathsf{odd}$$ are called Diamond Hitting Set and Even Cycle Transversal, respectively. In this paper we design randomized algorithms with worst case run time $$12^k n^{\mathcal {O}(1)}$$ for both these problems. Our algorithms considerably improve the running time for Diamond Hitting Set and Even Cycle Transversal, compared to what is known about them. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
9. Correction to: convergence rates for Kaczmarz-type algorithms.
- Author
-
Popa, Constantin
- Subjects
- *
ALGORITHMS , *RATES , *MATHEMATICS , *EVIDENCE , *MATHEMATICAL equivalence - Abstract
We will refer to the paper "Convergence rates for Kaczmarz-type algorithms", published in Numerical Algorithms, 79(1)(2018), 1-17. It was observed by Dr. Mokhtar Abbasi (Department of Mathematics, University of Qom, Iran) that in the proof of Theorem 7, related to the linear convergence rate of the MREK algorithm it exists an inequality which is not always true. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
10. Ensemble learning algorithm based on multi-parameters for sleep staging.
- Author
-
Wang, Qiangqiang, Zhao, Dechun, Wang, Yi, and Hou, Xiaorong
- Subjects
- *
MACHINE learning , *SLEEP stages , *RANDOM forest algorithms , *LOGISTIC regression analysis , *ELECTROENCEPHALOGRAPHY , *BRAIN physiology , *ALGORITHMS , *DATABASES , *DECISION trees , *MATHEMATICS , *PHYSICS , *STATISTICAL sampling - Abstract
The aim of this study is to propose a high-accuracy and high-efficiency sleep staging algorithm using single-channel electroencephalograms (EEGs). The process consists four parts: signal preprocessing, feature extraction, feature selection, and classification algorithms. In the preconditioning of EEG, wavelet function and IIR filter are used for noise reduction. In feature selection, 15 feature algorithms in time domain, time-frequency domain, and nonlinearity are selected to obtain 30 feature parameters. Feature selection is very important for eliminating irrelevant and redundant features. Feature selection algorithms as Fisher score, Sequential Forward Selection (SFS), Sequential Floating Forward Selection (SFFS), and Fast Correlation-Based Filter Solution (FCBF) were used. The paper establishes a new ensemble learning algorithm based on stacking model. The basic layers are k-Nearest Neighbor (KNN), Random Forest (RF), Extremely Randomized Trees (ERT), Multi-layer Perceptron (MLP), and Extreme Gradient Boosting (XGBoost) and the second layer is a Logistic regression. Comparing classification of RF, Gradient Boosting Decision Tree (GBDT), and XGBoost, the accuracies and kappa coefficients are 96.67% and 0.96 using the proposed method. It is higher than other classification algorithms.The results show that the proposed method can accurately sleep staging using single-channel EEG and has a high ability to predict sleep staging. Graphical abstract. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
11. Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization.
- Author
-
Lu, Zhaosong, Zhou, Zirui, and Sun, Zhe
- Subjects
- *
SMOOTHNESS of functions , *ALGORITHMS , *EXTRAPOLATION , *CONVEX functions , *PROBLEM solving , *MATHEMATICS - Abstract
In this paper we consider a class of structured nonsmooth difference-of-convex (DC) minimization in which the first convex component is the sum of a smooth and nonsmooth functions while the second convex component is the supremum of possibly infinitely many convex smooth functions. We first propose an inexact enhanced DC algorithm for solving this problem in which the second convex component is the supremum of finitely many convex smooth functions, and show that every accumulation point of the generated sequence is an (α , η) -D-stationary point of the problem, which is generally stronger than an ordinary D-stationary point. In addition, inspired by the recent work (Pang et al. in Math Oper Res 42(1):95–118, 2017; Wen et al. in Comput Optim Appl 69(2):297–324, 2018), we propose two proximal DC algorithms with extrapolation for solving this problem. We show that every accumulation point of the solution sequence generated by them is an (α , η) -D-stationary point of the problem, and establish the convergence of the entire sequence under some suitable assumption. We also introduce a concept of approximate (α , η) -D-stationary point and derive iteration complexity of the proposed algorithms for finding an approximate (α , η) -D-stationary point. In contrast with the DC algorithm (Pang et al. 2017), our proximal DC algorithms have much simpler subproblems and also incorporate the extrapolation for possible acceleration. Moreover, one of our proximal DC algorithms is potentially applicable to the DC problem in which the second convex component is the supremum of infinitely many convex smooth functions. In addition, our algorithms have stronger convergence results than the proximal DC algorithm in Wen et al. (2018). [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
12. Two non-parameter iterative algorithms for identifying strong ℋ-tensors.
- Author
-
Xu, Yangyang, Zhao, Ruijuan, and Zheng, Bing
- Subjects
- *
HOMOGENEOUS polynomials , *ALGORITHMS , *MATHEMATICS - Abstract
The strong ℋ -tensors have important applications in many areas of science and engineering, e.g., the determination of positive definiteness for an even-order homogeneous polynomial form in the real field. In this paper, we propose two iterative algorithms with non-parameter for identifying strong ℋ -tensors, which overcome the drawback of choosing the best value of parameter 𝜖 in some existing algorithms given by Li et al. and Liu et al. (J. Comput. Appl. Math., 255, 1–14, 2014 and Comput. Appl. Math. 36, 1623–1635, 2017). Some numerical experiments are performed to illustrate the feasibility and effectiveness of our algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
13. The Fast Search Number of a Complete k-Partite Graph.
- Author
-
Xue, Yuan, Yang, Boting, Zhong, Farong, and Zilles, Sandra
- Subjects
- *
COMPUTER science , *ALGORITHMS , *BIPARTITE graphs , *SEARCH algorithms , *MATHEMATICS - Abstract
Research on graph searching has recently gained interest in computer science, mathematics, and physics. This paper studies fast searching of a fugitive in a graph, a model that was introduced by Dyer et al. (in: Fleischer, Xu (eds.) Algorithmic aspects in information and management, Springer, New York, 2008). We provide lower bounds and upper bounds on the fast search number (i.e., the minimum number of searchers required for capturing the fugitive) of complete k-partite graphs. We also investigate some special classes of complete k-partite graphs, such as complete bipartite graphs and complete split graphs. We solve the open problem of determining the fast search number of complete bipartite graphs, and present upper and lower bounds on the fast search number of complete split graphs. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
14. Worst-case topology optimization of self-weight loaded structures using semi-definite programming.
- Author
-
Holmberg, Erik, Thore, Carl-Johan, and Klarbring, Anders
- Subjects
- *
COMPUTER programming , *ALGORITHMS , *MATHEMATICAL optimization , *TOPOLOGY , *MATHEMATICS - Abstract
The paper concerns worst-case compliance optimization by finding the structural topology with minimum compliance for the loading due to the worst possible acceleration of the structure and attached non-structural masses. A main novelty of the paper is that it is shown how this min-max problem can be formulated as a non-linear semi-definite programming (SDP) problem involving a small-size constraint matrix and how this problem is solved numerically. Our SDP formulation is an extension of an eigenvalue problem seen previously in the literature; however, multiple eigenvalues naturally arise which makes the eigenvalue problem non-smooth, whereas the SDP problem presented in this paper provides a computationally tractable problem. Optimized designs, where the uncertain loading is due to acceleration of applied masses and the weight of the structure itself, are shown in two and three dimensions and we show that these designs satisfy optimality conditions that are also presented. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
15. An Efficient Method for Solving Systems of Linear Ordinary and Fractional Differential Equations.
- Author
-
Didgar, Mohsen and Ahmadi, Nafiseh
- Subjects
- *
LINEAR systems , *DIFFERENTIAL equations , *MATHEMATICS theorems , *ALGORITHMS , *MATHEMATICS - Abstract
This paper presents a reliable approach for solving linear systems of ordinary and fractional differential equations. First, the FDEs or ODEs of a system with initial conditions to be solved are transformed to Volterra integral equations. Then Taylor expansion for the unknown function and integration method are employed to reduce the resulting integral equations to a new system of linear equations for the unknown and its derivatives. The fractional derivatives are considered in the Riemann-Liouville sense. Some numerical illustrations are given to demonstrate the effectiveness of the proposed method in this paper. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
16. The Undirected Power Graph of a Finite Group.
- Author
-
Pourgholi, G. R., Yousefi-Azari, H., and Ashrafi, A. R.
- Subjects
- *
FINITE groups , *FC-groups , *MATHEMATICS theorems , *ALGORITHMS , *MATHEMATICS - Abstract
The power graph $${\fancyscript{P}}(G)$$ of a group $$G$$ is the graph which has a vertex set of the group elements and two elements are adjacent if one is a power of the other. Chakrabarty, Ghosh, and Sen proved the main properties of the undirected power graph of a finite group. The aim of this paper is to generalize some results of their work and presenting some counterexamples for one of the problems raised by these authors. It is also proved that the power graph of a $$p$$ -group is $$2$$ -connected if and only if the group is a cyclic or generalized quaternion group and if $$G$$ is a nilpotent group which is not of prime power order then the power graph $${\fancyscript{P}}(G)$$ is $$2$$ -connected. We also prove that the number of edges of the power graph of the simple groups is less than or equal to the number of edges in the power graph of the cyclic group of the same order. This partially answers to a question in an earlier paper. Finally, we give a complete classification of groups in which the power graph is a union of complete graphs sharing a common vertex. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
17. A new integrable convergence acceleration algorithm for computing Brezinski-Durbin-Redivo-Zaglia’s sequence transformation via pfaffians.
- Author
-
Chang, Xiang-Ke, He, Yi, Hu, Xing-Biao, and Li, Shi-Hao
- Subjects
- *
ALGORITHMS , *ALGEBRA , *INTEGERS , *MATHEMATICS , *APPROXIMATION theory - Abstract
In the literature, most known sequence transformations can be written as a ratio of two determinants. But, it is not always this case. One exception is that the sequence transformation proposed by Brezinski, Durbin, and Redivo-Zaglia cannot be expressed as a ratio of two determinants. Motivated by this, we will introduce a new algebraic tool—pfaffians, instead of determinants in the paper. It turns out that Brezinski-Durbin-Redivo-Zaglia’s transformation can be expressed as a ratio of two pfaffians. To the best of our knowledge, this is the first time to introduce pfaffians in the expressions of sequence transformations. Furthermore, an extended transformation of high order is presented in terms of pfaffians and a new convergence acceleration algorithm for implementing the transformation is constructed. Then, the Lax pair of the recursive algorithm is obtained which implies that the algorithm is integrable. Numerical examples with applications of the algorithm are also presented. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
18. Numerical algorithms for the determinant evaluation of general Hessenberg matrices.
- Author
-
Jia, Ji-Teng
- Subjects
- *
MATRICES (Mathematics) , *NUMERICAL analysis , *ALGORITHMS , *ALGEBRA software , *MATHEMATICS - Abstract
Hessenberg matrices frequently arise in many application areas and have been attracted much attention in recent years. In the current paper, we present two numerical algorithms of $$O(n^2)$$ for computing the determinant of an n-by- n general Hessenberg matrix. The algorithms are all suited for implementation using Computer Algebra Systems such as MATLAB and MAPLE. Some numerical examples are provided in order to demonstrate the performance of the proposed algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
19. Fast implementation of the Tukey depth.
- Author
-
Liu, Xiaohui
- Subjects
- *
MULTIVARIATE analysis , *COMBINATORICS , *ALGORITHMS , *COMPUTATIONAL complexity , *MATHEMATICS - Abstract
Tukey depth function is one of the most famous multivariate tools serving robust purposes. It is also very well known for its computability problems in dimensions $$p \ge 3$$ . In this paper, we address this computing issue by presenting two combinatorial algorithms. The first is naive and calculates the Tukey depth of a single point with complexity $$O\left( n^{p-1}\log (n)\right) $$ , while the second further utilizes the quasiconcave of the Tukey depth function and hence is more efficient than the first. Both require very minimal memory and run much faster than the existing ones. All experiments indicate that they compute the exact Tukey depth. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
20. Fine Tuning Explained? Multiverses and Cellular Automata.
- Author
-
Soler Gil, Francisco and Alfonseca, Manuel
- Subjects
- *
CELLULAR automata , *PARALLEL processing , *MACHINE theory , *MATHEMATICS , *ALGORITHMS - Abstract
The objective of this paper is analyzing to which extent the multiverse hypothesis provides a real explanation of the peculiarities of the laws and constants in our universe. First we argue in favor of the thesis that all multiverses except Tegmark's 'mathematical multiverse' are too small to explain the fine tuning, so that they merely shift the problem up one level. But the 'mathematical multiverse" is surely too large. To prove this assessment, we have performed a number of experiments with cellular automata of complex behavior, which can be considered as universes in the mathematical multiverse. The analogy between what happens in some automata (in particular Conway's 'Game of Life") and the real world is very strong. But if the results of our experiments can be extrapolated to our universe, we should expect to inhabit-in the context of the multiverse-a world in which at least some of the laws and constants of nature should show a certain time dependence. Actually, the probability of our existence in a world such as ours would be mathematically equal to zero. In consequence, the results presented in this paper can be considered as an inkling that the hypothesis of the multiverse, whatever its type, does not offer an adequate explanation for the peculiarities of the physical laws in our world. [ABSTRACT FROM AUTHOR]
- Published
- 2013
- Full Text
- View/download PDF
21. On the linear convergence of the alternating direction method of multipliers.
- Author
-
Luo, Zhi-Quan and Hong, Mingyi
- Subjects
- *
MULTIPLIERS (Mathematical analysis) , *ALGORITHMS , *LINEAR operators , *MATHEMATICS , *CONVEX functions - Abstract
We analyze the convergence rate of the alternating direction method of multipliers (ADMM) for minimizing the sum of two or more nonsmooth convex separable functions subject to linear constraints. Previous analysis of the ADMM typically assumes that the objective function is the sum of only two convex functions defined on two separable blocks of variables even though the algorithm works well in numerical experiments for three or more blocks. Moreover, there has been no rate of convergence analysis for the ADMM without strong convexity in the objective function. In this paper we establish the global R-linear convergence of the ADMM for minimizing the sum of any number of convex separable functions, assuming that a certain error bound condition holds true and the dual stepsize is sufficiently small. Such an error bound condition is satisfied for example when the feasible set is a compact polyhedron and the objective function consists of a smooth strictly convex function composed with a linear mapping, and a nonsmooth $$\ell _1$$ regularizer. This result implies the linear convergence of the ADMM for contemporary applications such as LASSO without assuming strong convexity of the objective function. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
22. On the theoretical link between LLL-reduction and Lambda-decorrelation.
- Author
-
Lannes, A.
- Subjects
- *
INTEGERS , *ALGORITHMS , *MATHEMATICS , *GLOBAL Positioning System , *LEAST squares - Abstract
The LLL algorithm, introduced by Lenstra et al. (Math Ann 261:515-534, ), plays a key role in many fields of applied mathematics. In particular, it is used as an effective numerical tool for preconditioning the integer least-squares problems arising in high-precision geodetic positioning and Global Navigation Satellite Systems (GNSS). In 1992, Teunissen developed a method for solving these nearest-lattice point (NLP) problems. This method is referred to as Lambda (for Least-squares AMBiguity Decorrelation Adjustment). The preconditioning stage of Lambda corresponds to its decorrelation algorithm. From an epistemological point of view, the latter was devised through an innovative statistical approach completely independent of the LLL algorithm. Recent papers pointed out some similarities between the LLL algorithm and the Lambda-decorrelation algorithm. We try to clarify this point in the paper. We first introduce a parameter measuring the orthogonality defect of the integer basis in which the NLP problem is solved, the LLL-reduced basis of the LLL algorithm, or the $$\Lambda $$-basis of the Lambda method. With regard to this problem, the potential qualities of these bases can then be compared. The $$\Lambda $$-basis is built by working at the level of the variance-covariance matrix of the float solution, while the LLL-reduced basis is built by working at the level of its inverse. As a general rule, the orthogonality defect of the $$\Lambda $$-basis is greater than that of the corresponding LLL-reduced basis; these bases are however very close to one another. To specify this tight relationship, we present a method that provides the dual LLL-reduced basis of a given $$\Lambda $$-basis. As a consequence of this basic link, all the recent developments made on the LLL algorithm can be applied to the Lambda-decorrelation algorithm. This point is illustrated in a concrete manner: we present a parallel $$\Lambda $$-type decorrelation algorithm derived from the parallel LLL algorithm of Luo and Qiao (Proceedings of the fourth international C $$^*$$ conference on computer science and software engineering. ACM Int Conf P Series. ACM Press, pp 93-101, ). [ABSTRACT FROM AUTHOR]
- Published
- 2013
- Full Text
- View/download PDF
23. A Randomized $$\mathrm {O}(\log n)$$ -Competitive Algorithm for the Online Connected Facility Location Problem.
- Author
-
San Felice, Mário, Williamson, David, and Lee, Orlando
- Subjects
- *
ALGORITHMS , *APPROXIMATION algorithms , *MATHEMATICAL bounds , *REGRET bounds (Mathematics) , *MATHEMATICS - Abstract
The Connected Facility Location (CFL) is a network design problem that arises from a combination of the Uncapacitated Facility Location (FL) and the Steiner Tree (ST) problems. The Online Connected Facility Location problem (OCFL) is an online version of the CFL. San Felice et al. (2014) presented a randomized algorithm for the OCFL and proved that it is $$\mathrm {O}(\log ^2 n)$$ -competitive, where n is the number of clients. That algorithm combines the sample-and-augment framework of Gupta, Kumar, Pál, and Roughgarden with previous algorithms for the Online Facility Location (OFL) and the Online Steiner Tree (OST) problems. In this paper we use a more precise analysis to show that the same algorithm is $$\mathrm {O}(\log n)$$ -competitive. Since there is a lower bound of $$\mathrm {\Omega }(\log n)$$ for this problem, our result achieves the best possible competitive ratio, asymptotically. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
24. A Method by Which to Assess the Scalability of Field-Based Fitness Tests of Cardiorespiratory Fitness Among Schoolchildren.
- Author
-
Domone, Sarah, Mann, Steven, Sandercock, Gavin, Wade, Matthew, and Beedie, Chris
- Subjects
- *
PHYSICAL fitness , *EXERCISE tests , *ALGORITHMS , *CARDIOPULMONARY system , *CHILDREN'S health , *MATHEMATICS , *MEDLINE , *ONLINE information services , *RESEARCH funding , *RUNNING , *WALKING , *SYSTEMATIC reviews , *EVIDENCE-based medicine , *RESEARCH methodology evaluation , *DESCRIPTIVE statistics , *CHILDREN ,RESEARCH evaluation - Abstract
Previous research has reported the validity and reliability of a range of field-based tests of children's cardiorespiratory fitness. These two criteria are critical in ensuring the integrity and credibility of data derived through such tests. However, the criterion of scalability has received little attention. Scalability determines the degree to which tests developed on small samples in controlled settings might demonstrate real-world value, and is of increasing interest to policymakers and practitioners. The present paper proposes a method by which the scalability of cardiorespiratory field-based tests suitable for school-aged children might be assessed. We developed an algorithm to estimate scalability based on a six-component model; delivery, evidence of operating at scale, effectiveness, costs, resource requirements and practical implementation. We tested the algorithm on data derived through a systematic review of research that has used relevant fitness tests. A total of 229 studies that had used field based cardiorespiratory fitness tests to measure children's fitness were identified. Initial analyses indicated that the 5-min run test did not meet accepted criteria for reliability, whilst the 6-min walk test likewise failed to meet the criteria for validity. Of the remainder, a total of 28 studies met the inclusion criteria, 22 reporting the 20-m shuttle-run and seven the 1-mile walk/run. Using the scalability algorithm we demonstrate that the 20-m shuttle run test is substantially more scalable than the 1-mile walk/run test, with tests scoring 34/48 and 25/48, respectively. A comprehensive analysis of scalability was prohibited by the widespread non-reporting of data, for example, those relating to cost-effectiveness. Of all sufficiently valid and reliable candidate tests identified, using our algorithm the 20-m shuttle run test was identified as the most scalable. We hope that the algorithm will prove useful in the examination of scalability in either new data relating to existing tests or in data pertaining to new tests. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
25. A new double sorting-based node splitting algorithm for R-tree.
- Author
-
Korotkov, A.
- Subjects
- *
ALGORITHMS , *SPATIAL data structures , *ONE-dimensional flow , *ALGEBRA , *FLUID dynamics , *MATHEMATICS - Abstract
A storing of spatial data and processing of spatial queries are important tasks for modern data-bases. The execution efficiency of spatial query depends on underlying index structure. R-tree is a well-known spatial index structure. Currently there exist various versions of R-tree, and one of the most common variations between them is node splitting algorithm. The problem of node splitting in one-dimensional R-tree may seem to be too trivial to be considered separately. One-dimensional intervals can be split on the base of their sorting. Some of the node splitting algorithms for R-tree with two or more dimensions comprise one-dimensional split as their part. However, under detailed consideration, existing algorithms for one-dimensional split do not perform ideally in some complicated cases. This paper introduces a novel one-dimensional node splitting algorithm based on two sortings that can handle such complicated cases better. Also this paper introduces node splitting algorithm for R-tree with two or more dimensions that is based on the one-dimensional algorithm mentioned above. The tests show significantly better behavior of the proposed algorithms in the case of highly overlapping data. [ABSTRACT FROM AUTHOR]
- Published
- 2012
- Full Text
- View/download PDF
26. BIBasis, a package for reduce and Macaulay2 computer algebra systems to compute Boolean involutive and Gröbner bases.
- Author
-
Zinin, M.
- Subjects
- *
ALGEBRA , *MATHEMATICAL analysis , *DIFFERENTIAL equations , *COMPUTERS , *MATHEMATICS , *ALGORITHMS , *USER interfaces - Abstract
In this paper, we describe the BIBasis package designed for REDUCE and Macaulay2 computer algebra systems, which allows one to compute Boolean involutive bases and Gröbner bases. The implementations and user interfaces of the package for both systems are described in the respective sections of the paper. Also, we present results of comparisons of BIBasis with other packages and algorithms for constructing Boolean Gröbner bases available in the computer algebra systems. [ABSTRACT FROM AUTHOR]
- Published
- 2012
- Full Text
- View/download PDF
27. Approximation algorithms for homogeneous polynomial optimization with quadratic constraints.
- Author
-
Simai He, Zhening Li, and Shuzhong Zhang
- Subjects
- *
APPROXIMATION theory , *ALGORITHMS , *POLYNOMIALS , *MATHEMATICAL optimization , *MATHEMATICAL analysis , *MATHEMATICS - Abstract
In this paper, we consider approximation algorithms for optimizing a generic multi-variate homogeneous polynomial function, subject to homogeneous quadratic constraints. Such optimization models have wide applications, e.g., in signal processing, magnetic resonance imaging (MRI), data training, approximation theory, and portfolio selection. Since polynomial functions are non-convex, the problems under consideration are all NP-hard in general. In this paper we shall focus on polynomial-time approximation algorithms. In particular, we first study optimization of a multi-linear tensor function over the Cartesian product of spheres. We shall propose approximation algorithms for such problem and derive worst-case performance ratios, which are shown to be dependent only on the dimensions of the model. The methods are then extended to optimize a generic multi-variate homogeneous polynomial function with spherical constraint. Likewise, approximation algorithms are proposed with provable approximation performance ratios. Furthermore, the constraint set is relaxed to be an intersection of co-centered ellipsoids; namely, we consider maximization of a homogeneous polynomial over the intersection of ellipsoids centered at the origin, and propose polynomial-time approximation algorithms with provable worst-case performance ratios. Numerical results are reported, illustrating the effectiveness of the approximation algorithms studied. [ABSTRACT FROM AUTHOR]
- Published
- 2010
- Full Text
- View/download PDF
28. Mingling: mixed-integer rounding with bounds.
- Author
-
Atamtürk, Alper and Günlük, Oktay
- Subjects
- *
INTEGER programming , *MATHEMATICAL programming , *MATHEMATICAL variables , *MATHEMATICS , *OPERATIONS research , *ALGORITHMS - Abstract
Mixed-integer rounding (MIR) is a simple, yet powerful procedure for generating valid inequalities for mixed-integer programs. When used as cutting planes, MIR inequalities are very effective for mixed-integer programming problems with unbounded integer variables. For problems with bounded integer variables, however, cutting planes based on lifting techniques appear to be more effective. This is not surprising as lifting techniques make explicit use of the bounds on variables, whereas the MIR procedure does not. In this paper we describe a simple procedure, which we call mingling, for incorporating variable bound information into MIR. By explicitly using the variable bounds, the mingling procedure leads to strong inequalities for mixed-integer sets with bounded variables. We show that facets of mixed-integer knapsack sets derived earlier by superadditive lifting techniques can be obtained by the mingling procedure. In particular, the mingling inequalities developed in this paper subsume the continuous cover and reverse continuous cover inequalities of Marchand and Wolsey (Math Program 85:15–33, 1999) as well as the continuous integer knapsack cover and pack inequalities of Atamtürk (Math Program 98:145–175, 2003; Ann Oper Res 139:21–38, 2005). In addition, mingling inequalities give a generalization of the two-step MIR inequalities of Dash and Günlük (Math Program 105:29–53, 2006) under some conditions. [ABSTRACT FROM AUTHOR]
- Published
- 2010
- Full Text
- View/download PDF
29. Visualization and clustering of categorical data with probabilistic self-organizing map.
- Author
-
Lebbah, Mustapha and Benabdeslem, Khalid
- Subjects
- *
PROBABILITY theory , *SELF-organizing maps , *ALGORITHMS , *DATA visualization , *MATHEMATICS - Abstract
This paper introduces a self-organizing map dedicated to clustering, analysis and visualization of categorical data. Usually, when dealing with categorical data, topological maps use an encoding stage: categorical data are changed into numerical vectors and traditional numerical algorithms (SOM) are run. In the present paper, we propose a novel probabilistic formalism of Kohonen map dedicated to categorical data where neurons are represented by probability tables. We do not need to use any coding to encode variables. We evaluate the effectiveness of our model in four examples using real data. Our experiments show that our model provides a good quality of results when dealing with categorical data. [ABSTRACT FROM AUTHOR]
- Published
- 2010
- Full Text
- View/download PDF
30. A unified exact method for solving different classes of vehicle routing problems.
- Author
-
Baldacci, Roberto and Mingozzi, Aristide
- Subjects
- *
VEHICLES , *DYNAMIC programming , *MATHEMATICAL optimization , *MATHEMATICAL programming , *ALGORITHMS , *MATHEMATICS - Abstract
This paper presents a unified exact method for solving an extended model of the well-known Capacitated Vehicle Routing Problem (CVRP), called the Heterogenous Vehicle Routing Problem (HVRP), where a mixed fleet of vehicles having different capacities, routing and fixed costs is used to supply a set of customers. The HVRP model considered in this paper contains as special cases: the Single Depot CVRP, all variants of the HVRP presented in the literature, the Site-Dependent Vehicle Routing Problem (SDVRP) and the Multi-Depot Vehicle Routing Problem (MDVRP). This paper presents an exact algorithm for the HVRP based on the set partitioning formulation. The exact algorithm uses three types of bounding procedures based on the LP-relaxation and on the Lagrangean relaxation of the mathematical formulation. The bounding procedures allow to reduce the number of variables of the formulation so that the resulting problem can be solved by an integer linear programming solver. Extensive computational results over the main instances from the literature of the different variants of HVRPs, SDVRP and MDVRP show that the proposed lower bound is superior to the ones presented in the literature and that the exact algorithm can solve, for the first time ever, several test instances of all problem types considered. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
31. On affine (non)equivalence of Boolean functions.
- Author
-
Gangopadhyay, Sugata, Sharma, Deepmala, Sarkar, Sumanta, and Maitra, Subhamoy
- Subjects
- *
DISTRIBUTION (Probability theory) , *ALGORITHMS , *AFFINAL relatives , *NONLINEAR theories , *ALGEBRA , *MATHEMATICS - Abstract
In this paper we construct a multiset S( f) of a Boolean function f consisting of the weights of the second derivatives of the function f with respect to all distinct two-dimensional subspaces of the domain. We refer to S( f) as the second derivative spectrum of f. The frequency distribution of the weights of these second derivatives is referred to as the weight distribution of the second derivative spectrum. It is demonstrated in this paper that this weight distribution can be used to distinguish affine nonequivalent Boolean functions. Given a Boolean function f on n variables we present an efficient algorithm having O( n22 n) time complexity to compute S( f). Using this weight distribution we show that all the 6-variable affine nonequivalent bents can be distinguished. We study the subclass of partial-spreads type bent functions known as PS ap type bents. Six different weight distributions are obtained from the set of PS ap bents on 8-variables. Using the second derivative spectrum we show that there exist 6 and 8 variable bent functions which are not affine equivalent to rotation symmetric bent functions. Lastly we prove that no non-quadratic Kasami bent function is affine equivalent to Maiorana–MacFarland type bent functions. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
32. The Analysis and the Representation of Balanced Complex Polytopes in 2D.
- Author
-
Vagnoni, Cristina and Zennaro, Marino
- Subjects
- *
GEOMETRY , *POLYTOPES , *ALGORITHMS , *MATRICES (Mathematics) , *MATHEMATICS , *HYPERSPACE - Abstract
In this paper, we deepen the theoretical study of the geometric structure of a balanced complex polytope (b.c.p.), which is the generalization of a real centrally symmetric polytope to the complex space. We also propose a constructive algorithm for the representation of its facets in terms of their associated linear functionals. The b.c.p.s are used, for example, as a tool for the computation of the joint spectral radius of families of matrices. For the representation of real polytopes, there exist well-known algorithms such as, for example, the Beneath–Beyond method. Our purpose is to modify and adapt this method to the complex case by exploiting the geometric features of the b.c.p. However, due to the significant increase in the difficulty of the problem when passing from the real to the complex case, in this paper, we confine ourselves to examine the two-dimensional case. We also propose an algorithm for the computation of the norm the unit ball of which is a b.c.p. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
33. On Tries, Contention Trees and Their Analysis.
- Author
-
Wagner, Stephan
- Subjects
- *
ALGORITHMS , *MATHEMATICS , *STOCHASTIC models , *MELLIN transform , *STOCHASTIC processes - Abstract
In this paper a survey on tries, a contention resolution algorithm, their similarities, dissimilarities, and their mathematical treatment, will be given. It has already been mentioned in some papers that tries and contention trees follow one common stochastic model, but still they are frequently treated as separate objects in the literature. Hence the aim of the current work is to contribute to the unification of the various results in that area and to exhibit the employed methods, which involve, among others, analytic poissonization/depoissonization and the Mellin transform. For the sake of the example, a new parameter in contention trees, the number of terminal frames, will be studied. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
34. Modeling an envelope generated by 3D volumetric NC tool motion.
- Author
-
Podshivalov, Lev and Fischer, Anath
- Subjects
- *
MANUFACTURING processes , *VISUALIZATION , *MATHEMATICS , *DIFFERENTIAL equations , *ALGORITHMS - Abstract
Simulation and verification of numerically controlled (NC) manufacturing processes require efficient visualization and analysis of the swept volume generated by the motion of freeform NC tools along complex 3D paths. State-of-the-art methods are either based on approximation techniques (thus lacking the level of accuracy required in NC manufacturing) or are based on analytical solutions with high computational complexity, which are not suitable for real-time applications. In addition, until recently, modeling the self-intersection of a generated volume was thought to be obstructed by seemingly complex mathematics. This paper proposes solving the sweeping problem by using the sweep-envelope differential equation (SEDE). This method has advantages over other methods in terms of low computational complexity and high accuracy. Moreover, this method includes efficient tools for self-intersection detection and modeling. In this paper, we present an enhanced self-intersection algorithm and apply the SEDE algorithm on a ball-end cutter that is swept along non-intersecting and self-intersecting cutter paths. [ABSTRACT FROM AUTHOR]
- Published
- 2008
- Full Text
- View/download PDF
35. A machine learning approach to algorithm selection for $\mathcal{NP}$ -hard optimization problems: a case study on the MPE problem.
- Author
-
Guo, Haipeng and Hsu, William
- Subjects
- *
MATHEMATICAL optimization , *ALGORITHMS , *METHODOLOGY , *ARTIFICIAL intelligence , *ALGEBRA , *MATHEMATICS - Abstract
Given one instance of an $\mathcal{NP}$ -hard optimization problem, can we tell in advance whether it is exactly solvable or not? If it is not, can we predict which approximate algorithm is the best to solve it? Since the behavior of most approximate, randomized, and heuristic search algorithms for $\mathcal{NP}$ -hard problems is usually very difficult to characterize analytically, researchers have turned to experimental methods in order to answer these questions. In this paper we present a machine learning-based approach to address the above questions. Models induced from algorithmic performance data can represent the knowledge of how algorithmic performance depends on some easy-to-compute problem instance characteristics. Using these models, we can estimate approximately whether an input instance is exactly solvable or not. Furthermore, when it is classified as exactly unsolvable, we can select the best approximate algorithm for it among a list of candidates. In this paper we use the MPE (most probable explanation) problem in probabilistic inference as a case study to validate the proposed methodology. Our experimental results show that the machine learning-based algorithm selection system can integrate both exact and inexact algorithms and provide the best overall performance comparing to any single candidate algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
36. Globally Convergent Optimization Algorithms on Riemannian Manifolds: Uniform Framework for Unconstrained and Constrained Optimization.
- Author
-
Yang, Y.
- Subjects
- *
RIEMANNIAN manifolds , *MANIFOLDS (Mathematics) , *DIFFERENTIAL geometry , *MATHEMATICAL optimization , *MATHEMATICAL analysis , *ACCELERATION of convergence in numerical analysis , *STOCHASTIC convergence , *ALGORITHMS , *MATHEMATICS - Abstract
This paper proposes several globally convergent geometric optimization algorithms on Riemannian manifolds, which extend some existing geometric optimization techniques. Since any set of smooth constraints in the Euclidean space Rn (corresponding to constrained optimization) and the Rn space itself (corresponding to unconstrained optimization) are both special Riemannian manifolds, and since these algorithms are developed on general Riemannian manifolds, the techniques discussed in this paper provide a uniform framework for constrained and unconstrained optimization problems. Unlike some earlier works, the new algorithms have less restrictions in both convergence results and in practice. For example, global minimization in the one-dimensional search is not required. All the algorithms addressed in this paper are globally convergent. For some special Riemannian manifold other than Rn, the newalgorithms are very efficient. Convergence rates are obtained. Applications are discussed. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
37. Computing the dimension of a semi-algebraic set.
- Author
-
Basu, S., Pollack, R., and Roy, M.-F.
- Subjects
- *
SET theory , *POLYNOMIALS , *ALGORITHMS , *COMPUTATIONAL complexity , *MATHEMATICS - Abstract
In this paper, we consider the problem of computing the real dimension of a given semi-algebraic subset of R k, where R is a real closed field. We prove that the dimension k′ of a semi-algebraic set described by s polynomials of degree d in k variables can be computed in time . This result slightly improves the result by Vorobjov, who described an algorithm with complexity bound (sd)O(k′(k−k′)) for the same problem. The complexity bound of the algorithm described in this paper has a better dependence on the number s of polynomials in the input. Bibliography: 22 titles. [ABSTRACT FROM AUTHOR]
- Published
- 2006
- Full Text
- View/download PDF
38. Automated proofs of upper bounds on the running time of splitting algorithms.
- Author
-
Fedin, S. and Kulikov, A.
- Subjects
- *
NP-complete problems , *POLYNOMIALS , *SET theory , *ALGORITHMS , *MATHEMATICS - Abstract
The splitting method is one of the most powerful and well-studied approaches to solving various NP-hard problems. The main idea of this method is to split the input instance of a problem into several simpler instances (further simplified by certain simplification rules) such that when the solution for each of them is found, one can construct the solution for the initial instance in polynomial time. There exists a huge number of papers describing algorithms of this type, and usually a considerable part of such a paper is devoted to case analysis. In this paper, we present a program that, given a set of simplification rules, automatically generates a proof of an upper bound on the running time of a splitting algorithm using these rules. As an example, we report the results of experiments with such a program for the SAT, MAXSAT, and (n, 3)- MAXSAT (the MAXSAT problem for the case where every variable in the formula appears at most three times) problems. Bibliography: 13 titles. [ABSTRACT FROM AUTHOR]
- Published
- 2006
- Full Text
- View/download PDF
39. Efficient BDDs for bounded arithmetic constraints.
- Author
-
Bartzis, Constantinos and Bultan, Tevfik
- Subjects
- *
INTEGER programming , *MATHEMATICAL programming , *MATHEMATICS , *ARITHMETIC , *ALGORITHMS , *ALGEBRA - Abstract
Symbolic model checkers use BDDs to represent arithmetic constraints over bounded integer variables. The size of such BDDs can in the worst case be exponential in the number and size (in bits) of the integer variables. In this paper we show how to construct linear-sized BDDs for linear integer arithmetic constraints. We present basic constructions for atomic equality and inequality constraints and generalize our complexity results for arbitrary linear arithmetic formulas. We also present three alternative ways of handling out-of-bounds transitions and discuss heterogeneous bounds on integer variables. We experimentally compare our approach to other BDD-based symbolic model checkers and demonstrate that the algorithms presented in this paper can be used to improve their performance significantly. [ABSTRACT FROM AUTHOR]
- Published
- 2006
- Full Text
- View/download PDF
40. A local minimax characterization for computing multiple nonsmooth saddle critical points.
- Author
-
Xudong Yao and Jianxin Zhou
- Subjects
- *
NONSMOOTH optimization , *HILBERT space , *BANACH spaces , *ALGORITHMS , *MATHEMATICAL programming , *MATHEMATICS - Abstract
This paper is concerned with characterizations of nonsmooth saddle critical points for numerical algorithm design. Most characterizations for nonsmooth saddle critical points in the literature focus on existence issue and are converted to solve global minimax problems. Thus they are not helpful for numerical algorithm design. Inspired by the results on computational theory and methods for finding multiple smooth saddle critical points in [14, 15, 19, 21, 23], a local minimax characterization for multiple nonsmooth saddle critical points in either a Hilbert space or a reflexive Banach space is established in this paper to provide a mathematical justification for numerical algorithm design. A local minimax algorithm for computing multiple nonsmooth saddle critical points is presented by its flow chart. [ABSTRACT FROM AUTHOR]
- Published
- 2005
- Full Text
- View/download PDF
41. Sufficient Optimality Criterion for Linearly Constrained, Separable Concave Minimization Problems.
- Author
-
Illés, T. and Nagy, Á B.
- Subjects
- *
LINEAR programming , *MATHEMATICAL programming , *MATRICES (Mathematics) , *BRANCH & bound algorithms , *ALGORITHMS , *MATHEMATICS - Abstract
A sufficient optimality criterion for linearly-constrained concave minimization problems is given in this paper. Our optimally criterion is based on the sensitivity analysis of the relaxed linear programming Problem. The main result is similar to that of Phillips and Rosen (Ref. 1); however, our proofs are simpler and constructive. In the Phillip and Rosen paper (Ref.1), they derived a sufficient optimality criterion for a slightly different linearly-constrained concave minimization problem using exponentially many linear programming problems. We introduce special test points and, using these for several cases, we are able to show optimally of the current basic solution. The sufficient optimality criterion described in this paper can be used as a stopping criterion for branch-and-bound algorithm developed for linearly-constrained concave minimization problems. [ABSTRACT FROM AUTHOR]
- Published
- 2005
- Full Text
- View/download PDF
42. Feature ranking and best feature subset using mutual information.
- Author
-
Cang, Shuang and Partridge, Derek
- Subjects
- *
ALGORITHMS , *ALGEBRA , *EQUATIONS , *MATHEMATICS - Abstract
A new algorithm for ranking the input features and obtaining the best feature subset is developed and illustrated in this paper. The asymptotic formula for mutual information and the expectation maximisation (EM) algorithm are used to developing the feature selection algorithm in this paper. We not only consider the dependence between the features and the class, but also measure the dependence among the features. Even for noisy data, this algorithm still works well. An empirical study is carried out in order to compare the proposed algorithm with the current existing algorithms. The proposed algorithm is illustrated by application to a variety of problems. [ABSTRACT FROM AUTHOR]
- Published
- 2004
- Full Text
- View/download PDF
43. Modeling Combinational Circuits Using Linear Word-level Structures.
- Author
-
Popel, D. V. and Yanushkevich, S. N.
- Subjects
- *
ELECTRIC circuits , *ARITHMETIC , *ALGORITHMS , *ELECTRIC lines , *ELECTRICITY , *MATHEMATICS - Abstract
In many applications of circuit design and synthesis, it is natural and in some instances essential to manipulate logic functions and model circuits using word-level representations and arithmetic operations in contrast to bit-level representations and logic operations. This paper reviews linear word-level structures and formulates their properties for combinational circuit modeling. The paper addresses the following problem: given a library of gates with their corresponding word-level representations such as linear arithmetic expressions or respective graph structures, find a word-level model of an arbitrary combinational circuit/netlist using that library of gates and minimizing memory allocation and time delay requirements. We present a comprehensive study on linearization assuming various circuit processing strategies. In particular, we develop a new approach to manipulate linear word-level representations by means of cascades. The practical applicability of linear structures and developed algorithms is strengthen by considering the problem of timing analysis. All this is supported by the experimental study on benchmark circuits. [ABSTRACT FROM AUTHOR]
- Published
- 2004
- Full Text
- View/download PDF
44. Sequential Penalty Algorithm for Nonlinear Constrained Optimization.
- Author
-
Zhang, J.L. and Zhang, X.S.
- Subjects
- *
ALGORITHMS , *MATHEMATICAL optimization , *NONLINEAR theories , *STOCHASTIC convergence , *MATHEMATICS , *MATHEMATICAL analysis - Abstract
In this paper, a new sequential penalty algorithm, based on the L[sub ∞] exact penalty function, is proposed for a general nonlinear constrained optimization problem. The algorithm has the following characteristics: it can start from an arbitrary initial point; the feasibility of the subproblem is guaranteed; the penalty parameter is adjusted automatically; global convergence without any regularity assumption is proved. The update formula of the penalty parameter is new. It is proved that the algorithm proposed in this paper behaves equivalently to the standard SQP method after sufficiently many iterations. Hence, the local convergence results of the standard SQP method can be applied to this algorithm. Preliminary numerical experiments show the efficiency and stability of the algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2003
- Full Text
- View/download PDF
45. Geometry-Based Symbolic Approximation for Fast Sequence Matching on Manifolds.
- Author
-
Anirudh, Rushil and Turaga, Pavan
- Subjects
- *
APPROXIMATION theory , *NON-Euclidean geometry , *ALGORITHMS , *MATHEMATICS , *GEODESICS - Abstract
In this paper, we consider the problem of fast and efficient indexing techniques for sequences evolving in non-Euclidean spaces. This problem has several applications in the areas of human activity analysis, where there is a need to perform fast search, and recognition in very high dimensional spaces. The problem is made more challenging when representations such as landmarks, contours, and human skeletons etc. are naturally studied in a non-Euclidean setting where even simple operations are much more computationally intensive than their Euclidean counterparts. We propose a geometry and data adaptive symbolic framework that is shown to enable the deployment of fast and accurate algorithms for activity recognition, dynamic texture recognition, motif discovery. Toward this end, we present generalizations of key concepts of piece-wise aggregation and symbolic approximation for the case of non-Euclidean manifolds. We show that one can replace expensive geodesic computations with much faster symbolic computations with little loss of accuracy in activity recognition and discovery applications. The framework is general enough to work across both Euclidean and non-Euclidean spaces, depending on appropriate feature representations without compromising on the ultra-low bandwidth, high speed and high accuracy. The proposed methods are ideally suited for real-time systems and low complexity scenarios. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
46. The Use of Continuous Wavelet Transform Based on the Fast Fourier Transform in the Analysis of Multi-channel Electrogastrography Recordings.
- Author
-
Komorowski, Dariusz and Pietraszek, Stanislaw
- Subjects
- *
ABDOMEN , *ALGORITHMS , *ELECTROMYOGRAPHY , *FASTING , *GASTROINTESTINAL motility , *INGESTION , *MATHEMATICS , *MUSCLE contraction , *SIGNAL processing , *TIME , *DATA analysis software , *DESCRIPTIVE statistics - Abstract
This paper presents the analysis of multi-channel electrogastrographic (EGG) signals using the continuous wavelet transform based on the fast Fourier transform (CWTFT). The EGG analysis was based on the determination of the several signal parameters such as dominant frequency (DF), dominant power (DP) and index of normogastria (NI). The use of continuous wavelet transform (CWT) allows for better visible localization of the frequency components in the analyzed signals, than commonly used short-time Fourier transform (STFT). Such an analysis is possible by means of a variable width window, which corresponds to the scale time of observation (analysis). Wavelet analysis allows using long time windows when we need more precise low-frequency information, and shorter when we need high frequency information. Since the classic CWT transform requires considerable computing power and time, especially while applying it to the analysis of long signals, the authors used the CWT analysis based on the fast Fourier transform (FFT). The CWT was obtained using properties of the circular convolution to improve the speed of calculation. This method allows to obtain results for relatively long records of EGG in a fairly short time, much faster than using the classical methods based on running spectrum analysis (RSA). In this study authors indicate the possibility of a parametric analysis of EGG signals using continuous wavelet transform which is the completely new solution. The results obtained with the described method are shown in the example of an analysis of four-channel EGG recordings, performed for a non-caloric meal. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
47. A multi-objective differential evolution approach based on ε-elimination uniform-diversity for mechanism design.
- Author
-
Gholaminezhad, I. and Jamali, A.
- Subjects
- *
PARTICLE swarm optimization , *ALGORITHMS , *MATHEMATICAL optimization , *TOPOLOGY , *MATHEMATICS - Abstract
In this paper, a new multi-objective uniform-diversity differential evolution (MUDE) algorithm is proposed and used for Pareto optimum design of mechanisms. The proposed algorithm uses a diversity preserving mechanism called the ε-elimination algorithm to improve the population diversity among the obtained Pareto front. The proposed algorithm is firstly tested on some constrained and unconstrained benchmarks proposed for the special session and competition on multi-objective optimizers held under IEEE CEC 2009. The inverted generational distance (IGD) measure is used to assess the performance of the algorithm. Secondly, the proposed algorithm has been used for multi-objective optimization of two different combinatorial case studies. The first case contains a two-degree of freedom leg mechanism with springs. Three conflicting objective functions that have been considered for Pareto optimization are namely, leg size, vertical actuating force, and the peak crank torque. The second case is a two-finger robot gripper mechanism with two conflicting objectives which are the difference between the maximum and minimum gripping force and the transmission ratio of actuated and experienced gripper forces. Comparisons of obtained Pareto fronts using the method of this work with those obtained in other references show significant improvements. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
48. Multi-objective particle swarm optimization with preference information and its application in electric arc furnace steelmaking process.
- Author
-
Feng, Lin, Mao, Zhizhong, Yuan, Ping, and Zhang, Bi
- Subjects
- *
PARTICLE swarm optimization , *ALGORITHMS , *MATHEMATICAL optimization , *TOPOLOGY , *MATHEMATICS - Abstract
In this paper, multi-objective particle swarm optimization with preference information (MOPSO-PI) has been proposed. In the proposed algorithm, the information entropy is employed for measuring the probability distribution of particles; the user's preference information is represented as the ranking of each particle through the possible matrix. The optimal procedure is guided by the preference information since the global best performance of particle is randomly chosen among non-dominated solutions with higher ranking value in each iteration. Finally, the MOPSO-PI is applied to optimize the steelmaking process; the power supply curve obtained reduces the electric energy consumption, shortens the smelting time and prolongs the lifespan of the furnace lining. The application results show the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
49. A Generalized Projective Reconstruction Theorem and Depth Constraints for Projective Factorization.
- Author
-
Nasihatkon, Behrooz, Hartley, Richard, and Trumpf, Jochen
- Subjects
- *
ALGORITHMS , *MATHEMATICS theorems , *MATHEMATICS , *CAMERAS , *IMAGING systems - Abstract
This paper presents a generalized version of the classic projective reconstruction theorem which helps to choose or assess depth constraints for projective depth estimation algorithms. The theorem shows that projective reconstruction is possible under a much weaker constraint than requiring all estimated projective depths to be nonzero. This result enables us to present classes of depth constraints under which any reconstruction of cameras and points projecting into given image points is projectively equivalent to the true camera-point configuration. It also completely specifies the possible wrong configurations allowed by other constraints. We demonstrate the application of the theorem by analysing several constraints used in the literature, as well as presenting new constraints with desirable properties. We mention some of the implications of our results on iterative depth estimation algorithms and projective reconstruction via rank minimization. Our theory is verified by running experiments on both synthetic and real data. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
50. Properties of Chip-Firing Games on Complete Graphs.
- Author
-
Wei Zhuang, Weihua Yang, Lianzhu Zhang, and Xiaofeng Guo
- Subjects
- *
GRAPH theory , *GRAPHIC methods , *MATHEMATICS theorems , *ALGORITHMS , *MATHEMATICS - Abstract
Björner, Lovász and Shor introduced a chip-firing game on a finite graph $$G$$ as follows. We put some chips on each vertex of $$G$$ , we say that a vertex is ready if it has at least as many chips as its degree, in which case we can fire it and the result is that it distributes one chip to each of its neighbors, this may cause other vertices to be ready, and so on. This game continues until no vertex can be fired. In this paper, we study chip-firing games on complete graphs. We obtain a sufficient and necessary condition for chip-firing games on complete graphs to be finite. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.