Search is not available for this dataset
query
stringlengths
1
13.4k
pos
stringlengths
1
61k
neg
stringlengths
1
63.9k
query_lang
stringclasses
147 values
__index_level_0__
int64
0
3.11M
A note on the convergence analysis of a sparse grid multivariate probability density estimator
A note on the complexity of solving Poisson's equation for spaces of bounded mixed derivatives
On the Fundamental Limits of Recovering Tree Sparse Vectors From Noisy Linear Measurements
eng_Latn
700
Linearly constrained Bayesian matrix factorization for blind source separation
Unmixing of Hyperspectral Images using Bayesian Non-negative Matrix Factorization with Volume Prior
New exact solutions of Boiti-Leon-Manna-Pempinelli equation using extended F-expansion method
eng_Latn
701
An efficient algebraic multigrid preconditioned conjugate gradient solver
The Iterated Ritz Method : Basis , implementation and further development
Path collective variables without paths
eng_Latn
702
Lag weighted lasso for time series model
Oracle Properties and Finite Sample Inference of the Adaptive Lasso for Time Series Regression Models
Weighted Least-Squares Method for the Evaluation of Small-Angle X-ray Data Without Desmearing
eng_Latn
703
We describe a case of Gardnerella vaginalis colonization of the upper genital tract of the male partner of a woman with recurring bacterial vaginosis. G. vaginalis could not be cultured from the urethra but was cultured from semen. After treatment of the male partner with metronidazole, the woman had no more relapses o...
Owing to the fact that there are more microbial than human cells in our body and that humans contain more microbial than human genes, the microbiome has huge potential to influence human physiology, both in health and in disease. The use of next-generation sequencing technologies has helped to elucidate functional, qua...
Location awareness, providing the ability to identify the location of sensor, machine, vehicle, and wearable device, is a rapidly growing trend of hyper-connected society and one of the key ingredients for the Internet of Things (IoT) era. In order to make a proper reaction to the collected information from things , lo...
eng_Latn
704
We demonstrate the feasibility of constrained optimization approach for quantitative phase profiling. A high quality phase recovery from a near on axis hologram is made possible with the method.
Analysis of two-dimensional signals and systems foundation of scalar diffraction theory Fresnel and Fraunhofer diffraction wave-optics analysis of coherent optical systems frequency analysis of optical imaging systems wavefront modulation analog optical information processing holography. Appendices: delta function and ...
This chapter develops a theoretical analysis of the convex programming method for recovering a structured signal from independent random linear measurements. This technique delivers bounds for the sampling complexity that are similar to recent results for standard Gaussian measurements, but the argument applies to a mu...
eng_Latn
705
We present a new optimization procedure which is particularly suited for the solution of second-order kernel methods like e.g. Kernel-PCA. Common to these methods is that there is a cost function to be optimized, under a positive definite quadratic constraint, which bounds the solution. For example, in Kernel-PCA the c...
Note: Includes bibliographical references, 3 appendixes and 2 indexes.- Diskette v 2.06, 3.5''[1.44M] for IBM PC, PS/2 and compatibles [DOS] Reference Record created on 2004-09-07, modified on 2016-08-08
Berzelius failed to make use of Faraday's electrochemical laws in his laborious determination of equivalent weights.
eng_Latn
706
The electrocardiographic inverse problem of computing epicardial potentials from multi-electrode body-surface ECG measurements, is an ill-posed problem. Tikhonov regularization is commonly employed, which imposes penalty on the L2-norm of the potentials (zero-order) or their derivatives. Previous work has indicated sup...
Non-invasive reconstruction of infarcts inside the heart from ECG signals is an important and difficult problem due to the need to solve a severely ill-posed inverse problem. To overcome this ill-posedness, various sparse regularization techniques have been proposed and evaluated for detecting epicardial and transmural...
We derive sharp performance bounds for least squares regression with L regularization from parameter estimation accuracy and feature selection quality perspectives. The main result proved for L 1 regularization extends a similar result in [Ann. Statist. 35 (2007) 2313-2351] for the Dantzig selector. It gives an affirma...
eng_Latn
707
In this paper, we investigate the methodological issue of determining the number of state variables required for options pricing. After showing the inadequacy of the principal component analysis approach, which is commonly used in the literature, we adopt a nonparametric regression technique with nonlinear principal co...
Principal component analysis is one of the most widely applied tools in order to summarize common patterns of variation among variables. Several studies have investigated the ability of individual methods, or compared the performance of a number of methods, in determining the number of components describing common vari...
AnO(n 3) mathematically non-iterative heuristic procedure that needs no artificial variable is presented for solving linear programming problems. An optimality test is included. Numerical experiments depict the utility/scope of such a procedure.
eng_Latn
708
We provide a full characterization of the oblique projector U ( VU ) † V in the general case where the range of U and the null space of V are not complementary subspaces. We discuss the new result in the context of constrained least squares minimization which finds many applications in engineering and statistics.
A singular or rectangular matrix does not have an inverse in the usual sense. Nevertheless a matrix having properties which are closely akin to those of an inverse may be defined for such matrices. This matrix, the pseudoinverse or generalized inverse, has hitherto been uniquely defined for any given matrix. In this pa...
ABSTRACTUNC-45A is an ubiquitously expressed protein highly conserved throughout evolution. Most of what we currently know about UNC-45A pertains to its role as a regulator of the actomyosin system...
eng_Latn
709
This paper addresses the question of what exactly is an analogue of the preconditioned steepest descent (PSD) algorithm in the case of a symmetric indefinite system with an SPD preconditioner. We show that a basic PSD-like scheme for an SPD-preconditioned symmetric indefinite system is mathematically equivalent to the ...
A generalizeds-term truncated conjugate gradient method of least square type, proposed in [1a, b], is extended to a form more suitable for proving when the truncated version is identical to the full-term version. Advantages with keeping a control term in the truncated version is pointed out. A computationally efficient...
Background ::: Only 10% of the up to 15% of patients with advanced Parkinson’s disease (PD) eligible for deep brain stimulation (DBS) are referred to specialized centers. This survey evaluated the reasons for the reluctance of patients and referring physicians regarding DBS.
eng_Latn
710
Symmetric stochastic matrices width a width a dominant eigenvalue λ and the corresponding eigenvector α appears in many applications. Such matrices can be written as M=λ α αt+E¯.Thus β = λ α will be the structure vector. When the matrices in such families correspond to the treatments of a base design we can carry out a...
This work was partially supported by the Fundacao para a Ciencia e a Tecnologia (Portuguese Foundation for Science and Technology) through the project UID/MAT/00297/2013 (Centro de Matematica e Aplicacoes).
Berzelius failed to make use of Faraday's electrochemical laws in his laborious determination of equivalent weights.
eng_Latn
711
In this paper it was investigated if any genotypic footprints from the fat mass and obesity associated (FTO) SNP could be found in 600 MHz 1H CPMG NMR profiles of around 1,000 human plasma samples from healthy Danish twins. The problem was addressed with a combination of univariate and multivariate methods. The NMR dat...
We develop fast algorithms for estimation of generalized linear models with convex penalties. The models include linear regression, two-class logistic regression, and multi- nomial regression problems while the penalties include l1 (the lasso), l2 (ridge regression) and mixtures of the two (the elastic net). The algori...
We characterize stability under composition, inversion, and solution of ordinary differential equations for ultradifferentiable classes, and prove that all these stability properties are equivalent.
eng_Latn
712
Background ::: Recent high throughput technologies have been applied for collecting heterogeneous biomedical omics datasets. Computational analysis of the multi-omics datasets could potentially reveal deep insights for a given disease. Most existing clustering methods by multi-omics data assume strong consistency among...
Multi-view clustering, which seeks a partition of the data in multiple views that often provide complementary information to each other, has received considerable attention in recent years. In real life clustering problems, the data in each view may have considerable noise. However, existing clustering methods blindly ...
Purpose of Review ::: Metabolomics offers several opportunities for advancement in nutritional cancer epidemiology; however, numerous research gaps and challenges remain. This narrative review summarizes current research, challenges, and future directions for epidemiologic studies of nutritional metabolomics and cancer...
eng_Latn
713
Data in social and behavioral sciences are often hierarchically organized though seldom normal. They typically contain heterogeneous marginal skewnesses and kurtoses. With such data, the normal theory based likelihood ratio statistic is not reliable when evaluating a multilevel structural equation model. Statistics tha...
SUMMARY A fast Fisher scoring algorithm for maximum likelihood estimation in unbalanced mixed models with nested random effects is described. The algorithm uses explicit formulae for the inverse and the determinant of the covariance matrix, given by LaMotte (1972), and avoids inversion of large matrices. Description of...
In this short note we prove that if X is a separably rationally connected variety over an algebraically closed field of positive characteristic, then H^1(X, O_X)=0.
eng_Latn
714
We show a simple way how asymptotic convergence results can be conveyed from a simple Jacobi method to a block Jacobi method. Our pilot methods are the well known symmetric Jacobi method and the Paardekooper method for reducing a skew-symmetric matrix to the real Schur form. We show resemblance in the quadratic and cub...
The classical Jacobi algorithm is extended to an unified Lie algebraic approach. The conventional Jacobi algorithm minimize the distance to diagonality; they reduce the off-norm, i. e. the sum of squares of off-diagonal entries. Sorting the diagonal elements after each step would accelerate the convergence but, there a...
Background ::: With the trend toward pay-for-performance standards plus the increasing incidence and prevalence of periprosthetic joint infection (PJI), orthopaedic surgeons must reconsider all potential infection control measures. Both airborne and nonairborne bacterial contamination must be reduced in the operating r...
eng_Latn
715
This paper presents methods for the identification of noncausal two-dimensional rational systems from impulse response or output covariance data. Consideration of the general class of noncausal systems is motivated by the need for noncausal models in two-dimensional power spectrum estimation. The identification methods...
Publisher Summary Linear recursive processing is a practical solution to the main drawback of digital technology, which is its slowness for many real time signal processing applications. It seems reasonable to try natural generalizations of the various equivalent characterizations of linear recursive time invariant tra...
We consider the one-dimensional symmetric simple exclusion process with nearest neighbor jumps and we prove estimates on the decay of the correlation functions at long times.
eng_Latn
716
We consider the problem of computing the nearest matrix polynomial with a non-trivial Smith Normal Form. We show that computing the Smith form of a matrix polynomial is amenable to numeric computation as an optimization problem. Furthermore, we describe an effective optimization technique to find a nearby matrix polyno...
We develop a general framework for perturbation analysis of matrix polynomials. More specifically, we show that the normed linear space L m ( C n × n ) of n-by-n matrix polynomials of degree at most m provides a natural framework for perturbation analysis of matrix polynomials in L m ( C n × n ) . We present a family o...
The oxidative polymorphism of debrisoquine (DBQ) has been determined in 89 patients with colo-rectal cancer and in 556 normal control subjects. Four patients and 34 controls, with a metabolic ratio >12.6, were classified as poor metabolisers of DBQ (n.s.).
eng_Latn
717
Due to the ill-posedness of inverse problems, it is important to make use of most of the \textit{a priori} informations while solving such a problem. These informations are generally used as constraints to get the appropriate solution. In usual cases, constrains are turned into penalization of some characteristics of t...
Many formulations of visual reconstruction problems (e.g. optic flow, shape from shading, biomedical motion estimation from CT data) involve the recovery of a vector field. Often the solution is characterized via a generalized spline or regularization formulation using a smoothness constraint. This paper introduces a d...
this failure of Europanization in these countries is correlated with the preferences of the ruling elites in these countries.
eng_Latn
718
Subspace identification methods (SIM) have gone through tremendous development over the last decade. The SIM algorithms are attractive not only because of its numerical simplicity and stability, but also for its state space form that is very convenient for estimation, filtering, prediction, and control. A few drawbacks...
In this paper we reveal that the typical subspace identification algorithms use non-parsimonious model formulations, with extra terms in the model that appear to be non-causal. These terms are the ...
In this paper we reveal that the typical subspace identification algorithms use non-parsimonious model formulations, with extra terms in the model that appear to be non-causal. These terms are the ...
eng_Latn
719
FETI-DP methods for the optimal control problems of linear elasticity problems are considered and numerical results are presented.
The Toolkit for Advanced Optimization (TAO) focuses on the design and implementation of component-based optimization software for the solution of large-scale optimization applications on high-performance architectures. Their approach is motivated by the scattered support for parallel computations and lack of reuse of l...
Berzelius failed to make use of Faraday's electrochemical laws in his laborious determination of equivalent weights.
eng_Latn
720
This paper addresses the problem of approximate singular value decomposition of large dense matrices that arises naturally in many machine learning applications. We discuss two recently introduced sampling-based spectral decomposition techniques: the Nystrom and the Column-sampling methods. We present a theoretical com...
This paper examines the efficacy of sampling-based low-rank approximation techniques when applied to large dense kernel matrices. We analyze two common approximate singular value decomposition techniques, namely the Nystrom and Column sampling methods. We present a theoretical comparison between these two methods, prov...
Berzelius failed to make use of Faraday's electrochemical laws in his laborious determination of equivalent weights.
eng_Latn
721
We propose optimal dimensionality reduction techniques for the solution of goal-oriented linear-Gaussian inverse problems, where the quantity of interest (QoI) is a function of the inversion parameters. These approximations are suitable for large-scale applications. In particular, we study the approximation of the post...
The standard formulations of the Kalman filter (KF) and exten ded Kalman filter (EKF) require the storage and multiplication of matrices of size , where is the size of the state space, and the inversion of matrices of size , where is the size of the observation space. Thus when both and are large, implementation issues...
We prove that groups acting geometrically on delta-quasiconvex spaces contain no essential Baumslag-Solitar quotients as subgroups. This implies that they are translation discrete, meaning that the translation numbers of their nontorsion elements are bounded away from zero.
eng_Latn
722
Multiplicative updates are widely used for nonnegative matrix factorization (NMF) as an efficient computational method. In this paper, we consider a class of constrained optimization problems in which a polynomial function of the product of two matrices is minimized subject to the nonnegativity constraints. These probl...
For the purpose of selecting the best sites for installation of wind farms and for increasing the net yield of wind energy, the wind speed is required to be determined at different positions, within a domain of interest. This helps to determine the natural variance/uncertainty in the wind speed, which is very useful fo...
Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been applied in several applications, it does not always result in parts-based representations. In this paper, we show how explicitly incorporating...
eng_Latn
723
Outlier identification is important in many applications of multivariate analysis. Either because there is some specific interest in finding anomalous observations or as a pre-processing task before the application of some multivariate method, in order to preserve the results from possible harmful effects of those obse...
Outlier identification is important in many applications of multivariate analysis. Either because there is some specific interest in finding anomalous observations or as a pre-processing task before the application of some multivariate method, in order to preserve the results from possible harmful effects of those obse...
Outlier identification is important in many applications of multivariate analysis. Either because there is some specific interest in finding anomalous observations or as a pre-processing task before the application of some multivariate method, in order to preserve the results from possible harmful effects of those obse...
eng_Latn
724
The left and right inverse eigenvalue problem, which mainly arises in perturbation analysis of matrix eigenvalue and recursive matters, has some practical applications in engineer and scientific computation fields. In this paper, we give the solvability conditions of and the general expressions to the left and right in...
Let P, Q ∈ Cn×n be two normal {k+1}-potent matrices, i.e., PP � = PP, P k+1 = P, QQ � = QQ, Q k+1 = Q, k ∈ N. A matrix A ∈ C n×n is referred to as generalized reflexive with two normal {k + 1}-potent matrices P and Q if and only if A = PAQ. The set of all n × n generalized reflexive matrices which rely on the matrices ...
Berzelius failed to make use of Faraday's electrochemical laws in his laborious determination of equivalent weights.
eng_Latn
725
In this paper, we analyze an algorithm to compute a low-rank approximation of the similarity matrix S introduced by Blondel et al. in [1]. This problem can be reformulated as an optimization problem of a continuous function Φ(S)=tr(STM2(S)) where S is constrained to have unit Frobenius norm, and M2 is a non-negative li...
In this paper, we go over a number of optimization problems defined on a manifold in order to compare two matrices, possibly of different order. We consider several variants and show how these problems relate to various specific problems from the literature.
We prove that groups acting geometrically on delta-quasiconvex spaces contain no essential Baumslag-Solitar quotients as subgroups. This implies that they are translation discrete, meaning that the translation numbers of their nontorsion elements are bounded away from zero.
eng_Latn
726
We survey some computationally efficient formulas to estimate the number of integer or 0-1 points in polytopes. In many interesting cases, the formulas are asymptotically exact when the dimension of the polytopes grows. The polytopes are defined as the intersection of the non-negative orthant or the unit cube with an a...
We present three different upper bounds for Kronecker coefficients $g(\lambda,\mu,\nu)$ in terms of Kostka numbers, contingency tables and Littlewood--Richardson coefficients. We then give various examples, asymptotic applications, and compare them with existing lower bounds.
The oxidative polymorphism of debrisoquine (DBQ) has been determined in 89 patients with colo-rectal cancer and in 556 normal control subjects. Four patients and 34 controls, with a metabolic ratio >12.6, were classified as poor metabolisers of DBQ (n.s.).
eng_Latn
727
This article investigates a new procedure to estimate the influence of each variable of a given function defined on a high-dimensional space. More precisely, we are concerned with describing a function of a large number $p$ of parameters that depends only on a small number $s$ of them. Our proposed method is an unconst...
We derive the l! convergence rate simultaneously for Lasso and Dantzig estimators in a high-dimensional linear regression model under a mutual coherence assumption on the Gram matrix of the design and two di! erent assumptions on the noise: Gaussian noise and general noise with finite variance. Then we prove that simul...
Berzelius failed to make use of Faraday's electrochemical laws in his laborious determination of equivalent weights.
eng_Latn
728
The error analysis for computing the QR decomposition by Givens transformations was given originally by Wilkinson for n × n square matrices, and later by Gentleman for n × p ( p ⩽ n ) tall thin matrices. The derivations were sufficiently messy that results were quoted by analogy to the derivation of a specific case. A ...
Given an n x p matrix X with p < n, matrix triangularization, or triangularization in short, is to determine an n x n nonsingular matrix Al such that MX = [ R 0 where R is p x p upper triangular, and furthermore to compute the entries in R. By triangularization, many matrix problems are reduced to the simpler problem o...
The oxidative polymorphism of debrisoquine (DBQ) has been determined in 89 patients with colo-rectal cancer and in 556 normal control subjects. Four patients and 34 controls, with a metabolic ratio >12.6, were classified as poor metabolisers of DBQ (n.s.).
eng_Latn
729
Functional linear models are useful in longitudinal data analysis. They include many classical and recently proposed statistical models for longitudinal data and other functional data. Recently, smoothing spline and kernel methods have been proposed for estimating their coefficient functions nonparametrically but these...
The varying-coefficient model is flexible and powerful for modeling the dynamic changes of regression coefficients. It is important to identify significant covariates associated with response variables, especially for high-dimensional settings where the number of covariates can be larger than the sample size. We consid...
Berzelius failed to make use of Faraday's electrochemical laws in his laborious determination of equivalent weights.
eng_Latn
730
Hidden Markov Model (HMM) has already been used to classify EEG signals in the field of Brain Computer Interfaces (BCIs). In many conventional methods, the Expectation-Maximization (EM) algorithm is used to estimate the HMM parameters for EEG classification. The EM algorithm is an iterative method for finding Maximum L...
Convex optimization methods are widely used in the design and analysis of communication systems and signal processing algorithms. This tutorial surveys some of recent progress in this area. The tutorial contains two parts. The first part gives a survey of basic concepts and main techniques in convex optimization. Speci...
Berzelius failed to make use of Faraday's electrochemical laws in his laborious determination of equivalent weights.
eng_Latn
731
The computation of penalized quantile regression estimates is often computationally intensive in high dimensions. In this paper we propose a coordinate descent algorithm for computing the penalized smooth quantile regression (cdaSQR) with convex and nonconvex penalties. The cdaSQR approach is based on the approximation...
This paper considers robust modeling of the survival time for cancer patients. Accurate prediction can be helpful for developing therapeutic and care strategies. We propose a unified Expectation-Maximization approach combined with the L1-norm penalty to perform variable selection and obtain parameter estimation simulta...
We prove that groups acting geometrically on delta-quasiconvex spaces contain no essential Baumslag-Solitar quotients as subgroups. This implies that they are translation discrete, meaning that the translation numbers of their nontorsion elements are bounded away from zero.
eng_Latn
732
Consider the task of recovering an unknown $n$-vector from phaseless linear measurements. This task is the phase retrieval problem. Through the technique of lifting, this nonconvex problem may be convexified into a semidefinite rank-one matrix recovery problem, known as PhaseLift. Under a linear number of exact Gaussia...
Recent work has demonstrated the effectiveness of gradient descent for directly estimating high-dimensional signals via nonconvex optimization in a globally convergent manner using a proper initialization. However, the performance is highly sensitive in the presence of adversarial outliers that may take arbitrary value...
Holography has demonstrated potential to achieve a wide field of view, focus supporting, optical see-through augmented reality display in an eyeglasses form factor. Although phase modulating spatial light modulators are becoming available, the phase-only hologram generation algorithms are still imprecise resulting in s...
eng_Latn
733
Searching for structural similarities of proteins has a central role in bioinformatics. Most tasks of bioinformatics depends on investigating the homologous protein's sequence or structure these tasks vary from predicting the protein structure to determine sites in protein structure where drug can be attached. Protein ...
Two point sets {pi} and {p'i}; i = 1, 2,..., N are related by p'i = Rpi + T + Ni, where R is a rotation matrix, T a translation vector, and Ni a noise vector. Given {pi} and {p'i}, we present an algorithm for finding the least-squares solution of R and T, which is based on the singular value decomposition (SVD) of a 3 ...
Berzelius failed to make use of Faraday's electrochemical laws in his laborious determination of equivalent weights.
eng_Latn
734
For a nonnegative irreducible matrix A with spectral radius ϱ , this paper is concerned with the determination of the unique normalized Perron vector π which satisfies A π = ϱπ, π #&62; 0, Σ j π j = 1 . It is explained how to uncouple a large matrix A into two or more smaller matrices—say P 11 , P 22 ,…, P kk — such th...
For a nonnegative irreducible matrix A, this paper is concerned with the estimation and determination of the unique Perron root or spectral radius of A. We present a new method that utilizes the relation between Perron roots of the nonnegative matrix and its (generalized) Perron complement. Several numerical examples a...
For a nonnegative irreducible matrix A, this paper is concerned with the estimation and determination of the unique Perron root or spectral radius of A. We present a new method that utilizes the relation between Perron roots of the nonnegative matrix and its (generalized) Perron complement. Several numerical examples a...
eng_Latn
735
Gradient Descent for Gaussian Processes Variance Reduction
A key issue in Gaussian Process modeling is to decide on the locations where measurements are going to be taken. A good set of observations will provide a better model. Current state of the art selects such a set so as to minimize the posterior variance of the Gaussian Process by exploiting submodularity. We propose a ...
Given ?>0 andp?(0,1), we consider the following problem: findu such that $$\begin{gathered} - \Delta u + \lambda [u]_ + ^p = 0in\Omega , \hfill \\ u = 1on\partial \Omega , \hfill \\ \end{gathered} $$ whereΩ??2 is a smooth convex domain. We prove optimalH 1 andL ? error bounds for the standard continuous piecewise linea...
eng_Latn
736
Initial Study of the Theory of 3G-GDP
With the continuous development of society,population,resources and environmental problems have become increasingly prominent,and people have paid more attention to their welfare level changes.The traditional GDP accounting theory,because of its inherent defects,can not fully reflect the environmental costs of developm...
Surface reconstruction from point cloud is of great practical importance in computer graphics. Existing methods often realize reconstruction via a few phases with respective goals, whose integration may not give an optimal solution. In this paper, to avoid the inherent limitations of multi-phase processing in the prior...
kor_Hang
737
Ordinal Scaling for Clinical Scores with Inconsistent Intervals (900 Patients)
Clinical studies often have categories as outcome, like various levels of health or disease. Multinomial regression is suitable for analysis (see Chap. 28). However, if one or two outcome categories in a study are severely underpresented, multinomial regression is flawed, and ordinal regression including specific link ...
This paper considers the problem of tuning natural frequencies of a linear system by a memoryless controller. Using algebro-geometric methods it is shown how it is possible to improve current sufficiency conditions.The main result is an exact combinatorial characterization of the nilpotency index of the $\bmod 2$ cohom...
eng_Latn
738
Is verumontanum resection needed in transurethral resection of the prostate
Transurethral resection of the prostate is the mainstay for treatment of bladder outflow obstruction. It is a procedure that involves various complications and has a high success rate. In view of a recent publication presenting the effect of verumontanum resection on functional outcome and possible complications after ...
In the present paper, a future cone in the Minkowski space defined in terms of the square-norm of the residual vector for an ill-posed linear system to be solved, is used to derive a nonlinear system of ordinary differential equations. Then the forward Euler scheme is used to generate an iterative algorithm. Two critic...
eng_Latn
739
Q p spaces in strictly pseudoconvex domainsspaces in strictly pseudoconvex domains
We extend the definition ofQ p spaces from the unit disk to a strictly pseudoconvex domainD in ℂ n and show that several known properties are true also in the several variable case. We also provide some proofs and examples that are new even when restricted to the one-dimensional case.
This paper presents solutions to the entropy-constrained scalar quantizer (ECSQ) design problem for two sources commonly encountered in image and speech compression applications: sources having exponential and Laplacian probability density functions. We obtain the optimal ECSQ either with or without an additional const...
eng_Latn
740
Anxiety Sensitivity Among Anxious Children
Employed the Diagnostic Interview Schedule for Children to show that children diagnosed with an anxiety disorder score significantly higher on the Childhood Anxiety Sensitivity Index (CASI) than nondiagnosed children. Interviews and self-report measures regarding the child were completed by 201 children and their paren...
Matrix concentration inequalities have attracted much attention in diverse applications such as linear algebra, statistical estimation, combinatorial optimization, etc. In this paper, we present new Bernstein concentration inequalities depending only on the first moments of random matrices, whereas previous Bernstein i...
eng_Latn
741
On the Extension Value Calculation & Influence Factors of Prestressed Reinforcing Steel of Post-tensioning Method Construction
The post-tensioning method is analyzed briefly in this paper focusing on the construction risk by different construction sequence of prestressed reinforcing steel.And two methods to extension theoretical value of prestressed reinforcing steel are introduced according to the standard.Then,the practical extension calcula...
Automated understanding of spatio-temporal usage patterns of real-world applications are significant in urban planning. With the capability of smartphones collecting various information using inbuilt sensors, the smart city data is enriched with multiple contexts. Whilst tensor factorization has been successfully used ...
eng_Latn
742
Deformed density matrix, Density of entropy and Information problem
Quantum Mechanics at Planck scale is considered as a deformation of the conventional Quantum Mechanics. Similar to the earlier works of the author, the main object of deformation is the density matrix. On this basis a notion of the entropy density is introduced that is a matrix value used for a detail study of the Info...
Many data analysis problems involve an investigation of relationships between attributes in heterogeneous databases, where different prediction models can be more appropriate for different regions. We propose a technique of integrating global and local random subspace ensemble. We performed a comparison with other well...
eng_Latn
743
Effect of CNT and TiC hybrid reinforcement on the micro-mechano-tribo behaviour of aluminium matrix composites
Abstract In the present study Aluminium-3003 alloy metal matrix reinforced with single walled CNTs and TiC were fabricated with stir casting process. Aluminium matrix composites found many applications in aerospace and structural engineering. In this study wt.% of CNT is fixed as 0.5 wt.% and TiC content is varied from...
Automated understanding of spatio-temporal usage patterns of real-world applications are significant in urban planning. With the capability of smartphones collecting various information using inbuilt sensors, the smart city data is enriched with multiple contexts. Whilst tensor factorization has been successfully used ...
eng_Latn
744
Controlling orthogonality constraints for better NMF clustering
In this paper we study a variation of a Non-negative Matrix Factorization (NMF) called the Orthogonal NMF(ONMF). This special type of NMF was proposed in order to increase the quality of clustering results of standard NMF by imposing orthogonality on clustering indicator matrix and/or the matrix of basis vectors. We de...
We prove existence of solutions for a class of systems of subelliptic PDEs arising from Mean Field Game systems with H\"ormander diffusion. These results are motivated by the feedback synthesis Mean Field Game solutions and the Nash equilibria of a large class of $N$-player differential games.
eng_Latn
745
Nullspace Approach to Determine the Elementary Modes of Chemical Reaction Systems
The analysis of a chemical reaction network by elementary flux modes is a very elegant method to deal with the stationary states of the system. Each steady state of the network can be represented as a convex combination of these modes. They are elements of the nullspace of the stoichiometry matrix due to the imposed st...
Abstract Recently new optimal Krylov subspace methods have been discovered for normal matrices. In light of this, novel ways to quantify nonnormality are considered in connection with various families of matrices. We use as a criterion how, for a given matrix, these iterative methods introduced can be employed via, e.g...
eng_Latn
746
A Diagonal-Augmented quasi-Newton method with application to factorization machines
We present a novel quasi-Newton method for convex optimization, in which the Hessian estimates are based not only on the gradients, but also on the diagonal part of the true Hessian matrix (which can often be obtained with reasonable complexity). The new algorithm is based on the well known Broyden-Fletcher-Goldfarb-Sh...
Abstract The paper is concerned with a reduced SIR model for migrant workers. By using differential inequality technique and a novel argument, we derive a set of conditions to ensure that the endemic equilibrium of the model is globally exponentially stable. The obtained results complement with some existing ones. We a...
eng_Latn
747
Treatment of intractable hyperemesis gravidarum by ondansetron
Hyperemesis gravidarum is a disabling condition. It is not uncommon that patients request termination of pregnancy because of intolerable symptoms and psychological stress. We report a case in which termination of pregnancy was avoided by the use of ondansetron to treat the hyperemesis gravidarum.
In the present paper, a future cone in the Minkowski space defined in terms of the square-norm of the residual vector for an ill-posed linear system to be solved, is used to derive a nonlinear system of ordinary differential equations. Then the forward Euler scheme is used to generate an iterative algorithm. Two critic...
eng_Latn
748
Efficient Riemannian algorithms for optimization under unitary matrix constraint
In this paper we propose practical algorithms for optimization under unitary matrix constraint. This type of constrained optimization is needed in many signal processing applications. Steepest descent and conjugate gradient algorithms on the Lie group of unitary matrices are introduced. They exploit the Lie group prope...
We consider a system of uniform recurrence equations of dimension 1 and we show how its computation can be carried out using minimal memory size with several synchronous processors. This result is then applied to register minimization for digital circuits and parallel computation of task graphs.
eng_Latn
749
Spatial Filtering/Kernel Density Estimation
Kernel density estimation methods are described and their utility in applications in human geography is discussed. Unweighted and weighted kernel methods, and spatially adaptive methods, are described. Each is illustrated with an example of estimating infant mortality rates in a US city. These methods are briefly compa...
In this paper, aimed at the neutron transport equations of eigenvalue problem under 2-D cylindrical geometry on unstructured grid, the discrete scheme of Sn discrete ordinate and discontinuous finite is built, and the parallel computation for the scheme is realized on MPI systems. Numerical experiments indicate that th...
kor_Hang
750
Training-based SLM-realizable composite filter design
Majority-granted nonlinearity-based training for the synthesis of a composite filter is proposed. The motivation is the limited modulation capability of the spatial light modulator (SLM) which is incorporated as a design constraint in the form of a simple thresholding scheme. The technique is simple, and less computati...
A general purpose block LU preconditioner for saddle point problems is presented. A major difference between the approach presented here and that of other studies is that an explicit, accurate approximation of the Schur complement matrix is efficiently computed. This is used to obtain a preconditioner to the Schur comp...
eng_Latn
751
The reduction of complex dynamical systems using principal interaction patterns
Abstract A method of constructing low-dimensional nonlinear models capturing the main features of complex dynamical systems with many degrees of freedom is described. The system is projected onto a linear subspace spanned by only a few characteristic spatial structures called Principal Interaction Patterns (PIPs). The ...
Surface reconstruction from point cloud is of great practical importance in computer graphics. Existing methods often realize reconstruction via a few phases with respective goals, whose integration may not give an optimal solution. In this paper, to avoid the inherent limitations of multi-phase processing in the prior...
eng_Latn
752
Some remarks on the functional relation between canonical correlation analysis and partial least squares
ABSTRACTThis paper deals with the functional relation between multivariate methods of canonical correlation analysis (CCA), partial least squares (PLS) and also their kernelized versions. Both methods are determined by the solution of the respective optimization problem, and result in algorithms using spectral or singu...
Automated understanding of spatio-temporal usage patterns of real-world applications are significant in urban planning. With the capability of smartphones collecting various information using inbuilt sensors, the smart city data is enriched with multiple contexts. Whilst tensor factorization has been successfully used ...
eng_Latn
753
Bending of light Ray in radially varying refractive index If light passes near a massive object, the gravitational interaction causes a bending of the ray. This can be thought of as happening due to a change in the effective refrative index of the medium given by $$n(r) = 1 + 2 \frac{GM}{rc^2}$$ where $r$ is the distan...
How can gravity affect light? I understand that a black hole bends the fabric of space time to a point that no object can escape. I understand that light travels in a straight line along spacetime unless distorted by gravity. If spacetime is being curved by gravity then light should follow that bend in spacetime. In...
How exactly to compute the ridge regression penalty parameter given the constraint? The accepted answer in does a great job of showing that there is a one-to-one correspondence between $c$ and $\lambda$ in the two formulations of the ridge regression: $$ \underset{\beta}{min}(y-X\beta)^T(y-X\beta) + \lambda\beta^T\bet...
eng_Latn
754
How to use SVD for dimensionality reduction After reading several "tutorials" on SVD I am left still wondering how to use it for dimensionality reduction. Here is my confusion in an applied setting. If I limit svd to only considering the first two singular values / vectors and "recreate" the matrix, the dimensionality...
Relationship between SVD and PCA. How to use SVD to perform PCA? Principal component analysis (PCA) is usually explained via an eigen-decomposition of the covariance matrix. However, it can also be performed via singular value decomposition (SVD) of the data matrix $\mathbf X$. How does it work? What is the connection ...
Before running a ridge regression model, do I need to preform variable selection? I am currently constructing a model that uses last year's departmental information to predict employee churn for the current year. I have 55 features and 318 departments in my data set. A good portion of my independent variables are cor...
eng_Latn
755
The Variational Gaussian Approximation Revisited
Gaussian Processes for Machine Learning
Beam selection for performance-complexity optimization in high-dimensional MIMO systems
eng_Latn
756
Observational transversal study to relate functional status and age with the doublet or triplet chemotherapy based on capecitabine in advanced gastric cancer patients.
59 Background: The available evidence suggests that selection of treatment for advanced gastric cancer (AGC) correlates with age and ECOG PS. This study was conducted to analyze whether previously mentioned variables are relevant for the choice of doublet or triplet regimens with capecitabine and determining prognosis....
In the present paper, a future cone in the Minkowski space defined in terms of the square-norm of the residual vector for an ill-posed linear system to be solved, is used to derive a nonlinear system of ordinary differential equations. Then the forward Euler scheme is used to generate an iterative algorithm. Two critic...
eng_Latn
757
Actually, i have 540x46 matrix, (540 observations and 46 features) and after using PCA by considering 95% variance, it is reduced to 540x12 matrix. So, is it possible to know which 12 features from 46 are they? and order of these 12 features according to dominance level? I hope now question is clear and please let me...
I'm new to feature selection and I was wondering how you would use PCA to perform feature selection. Does PCA compute a relative score for each input variable that you can use to filter out noninformative input variables? Basically, I want to be able to order the original features in the data by variance or amount of i...
The new Top-Bar does not show reputation changes from Area 51.
eng_Latn
758
High electric fields in DC poled glasses examined with the LIPP technique
We have investigated the depletion layer generated in DC poled soda-lime glasses using the LIPP technique. The results are interpreted taking advantage of the chemical surface analysis already carried out.
Matrix concentration inequalities have attracted much attention in diverse applications such as linear algebra, statistical estimation, combinatorial optimization, etc. In this paper, we present new Bernstein concentration inequalities depending only on the first moments of random matrices, whereas previous Bernstein i...
eng_Latn
759
Cramér-Rao Bound for Line Constrained Trajectory Tracking
In this paper, target tracking constrained to short-term linear trajectories is explored. The problem is viewed as an extension of the matrix decomposition problem into low-rank and sparse components by incorporating an additional line constraint. The Cramer-Rao Bound (CRB) for the trajectory estimation is derived; num...
The purpose of the paper is to give a complete characterization of the continuity of lower envelopes in the infinite dimensional spaces in terms of the notion of c-regularity. As an application we introduce a variational unconstrained vector optimization problem for smooth functions and characterize when the variationa...
eng_Latn
760
Total variation projection with first order schemes
This paper proposes a new class of algorithms to compute the projection onto the set of images with a total variation bounded by a constant. The projection is computed on a dual formulation of the problem that is minimized using either a one-step gradient descent method or a multi-step Nesterov scheme. This yields iter...
We prove that a discrete series representations of metaplectic group over a non-archimedean local eld has a generic theta lift on the split odd orthogonal tower if and only if it is generic. Also, we determine the rst occurrence indices of such representations and describe the structure of their theta lifts.
eng_Latn
761
The method of micro-displacement measurement to improve the space resolution of array detector.
This paper introduces the method of micro-displacement measurement to improve the space resolution of limited size array detector. This method could also be applied in various research areas, especially in image measurement of nuclear detection.
Abstract We show how stability of models can be guaranteed when using the class of identification algorithms which have become known as ‘subspace methods’. In many of these methods the ‘ A ’ matrix is obtained (or can be obtained) as the product of a shifted matrix with a pseudo-inverse. We show that whenever the shift...
eng_Latn
762
A facile stereoselective synthesis of α-glycosyl ureas
α-Glycosyl ureas can be synthesised directly from tetra-O-benzyl glycosyl azides and isocyanates, using a one-pot procedure that is simple and general in scope. The benzyl protecting groups are easily removed from the urea products by catalytic hydrogenation. The synthesised α-glycosyl ureas represent a new class of ne...
In this paper we propose practical algorithms for optimization under unitary matrix constraint. This type of constrained optimization is needed in many signal processing applications. Steepest descent and conjugate gradient algorithms on the Lie group of unitary matrices are introduced. They exploit the Lie group prope...
eng_Latn
763
Robust hierarchical image representation using non-negative matrix factorisation with sparse code shrinkage preprocessing
When analysing patterns, our goals are (i) to find structure in the presence of noise, (ii) to decompose the observed structure into sub-components, and (iii) to use the components for pattern completion. Here, a novel loop architecture is introduced to perform these tasks in an unsupervised manner. The architecture co...
Consider arbitrary collections A = a_1,a_2,.. .,a_n of items and Q = q_1,q_2,...,q_m (1 leqslant mn leqslant n) of queries from a totally ordered universe. The multiple rank problem involves computing for every query qi the number of items in A that have a lesser value. Our contribution is to show that the problem at h...
eng_Latn
764
Dimension Reduction of Large-Scale Systems
In the past decades, model reduction has become an ubiquitous tool in analysis and simulation of dynamical systems, control design, circuit simulation, structural dynamics, CFD, and many other disciplines dealing with complex physical models. The aim of this book is to survey some of the most successful model reduction...
Many data analysis problems involve an investigation of relationships between attributes in heterogeneous databases, where different prediction models can be more appropriate for different regions. We propose a technique of integrating global and local random subspace ensemble. We performed a comparison with other well...
yue_Hant
765
Global minimization of the active contour model with TV-Inpainting and two-phase denoising
The active contour model [8,9,2] is one of the most well-known variational methods in image segmentation. In a recent paper by Bresson et al. [1], a link between the active contour model and the variational denoising model of Rudin-Osher-Fatemi (ROF) [10] was demonstrated. This relation provides a method to determine t...
We present a 4-approximation algorithm for the problem of placing the fewest guards on a 1.5D terrain so that every point of the terrain is seen by at least one guard. This improves on the currently best approximation factor of 5 (J. King, 2006). Unlike most of the previous techniques, our method is based on rounding t...
eng_Latn
766
Distribution and Evolution Characteristics of China's Iodine-rich Brines:3.Formation Condition of the Brines and Iodine Explonation Orienlation
Based on extensive literature,the paper deals with the distribution of China's iodine resources as well as the geological conditions for its formation.In combination with the evolution,storage types and distribution features of petroleum and natural gases,the author summarized the distribution of indine-rich brines and...
We present an incremental approach to 2-norm estimation for triangular matrices. Our investigation covers both dense and sparse matrices which can arise for example from a QR, a Cholesky or a LU factorization. If the explicit inverse of a triangular factor is available, as in the case of an implicit version of the LU f...
eng_Latn
767
New nonlinear algorithms for finite element analysis of 2D and 3D magnetic fields
New nonlinear algorithms are presented that use the given material B‐H curve directly, rather than converting it to a reluctivity ν=(H/B) vs B2 curve as is common. In addition to full Newton–Raphson iteration, also discussed are modified Newton–Raphson iteration, quasi‐Newton iteration, and line search algorithms. Full...
This paper proposes a novel technique for learning face features based on Bayesian regularized non-negative matrix factorization with Itakura-Saito (IS) divergence (B-NMF). In this paper, we show, the proposed technique not only explicitly incorporates the notion of ‘Bayesian regularized prior’ which imposes onto the f...
eng_Latn
768
Risk minimization in the presence of label noise
Matrix concentration inequalities have attracted much attention in diverse applications such as linear algebra, statistical estimation, combinatorial optimization, etc. In this paper, we present new Bernstein concentration inequalities depending only on the first moments of random matrices, whereas previous Bernstein i...
The paper is concemed with the design of robust guaranteed cost controller with H, - y disturbance attenuation performance for linear systems with norm bounded parameter uncertainties and disturbances.
eng_Latn
769
Algorithms for smoothing data on the sphere with tensor product splines
Algorithms are presented for fitting data on the sphere by using tensor product splines which satisfy certain boundary constraints. First we consider the least-squares problem when the knots are given. Then we discuss the construction of smoothing splines on the sphere. Here the knots are located automatically. A Fortr...
In this paper, we provide theoretical analysis for a cubic regularization of Newton method as applied to unconstrained minimization problem. For this scheme, we prove general local convergence results. However, the main contribution of the paper is related to global worst-case complexity bounds for different problem cl...
eng_Latn
770
A Local Level-Set Concept for Front Tracking on Arbitrary Grids
This paper proposes a general multi-dimensional front tracking concept for arbitrary physical problems. The tracking method is based on the level-set approach with a restricted dynamic definition range in the vicinity of the fronts. Special attention is drawn to the problem of the classical level-set method, i.e. accur...
Matrix concentration inequalities have attracted much attention in diverse applications such as linear algebra, statistical estimation, combinatorial optimization, etc. In this paper, we present new Bernstein concentration inequalities depending only on the first moments of random matrices, whereas previous Bernstein i...
eng_Latn
771
Comparison of Pressure/Flow Studies with Micturitional Urethral Pressure Profiles in the Diagnosis of Urinary Outflow Obstruction
Summary— Computer technology has made it possible significantly to improve the technique and interpretation of the micturitional urethral pressure profile (MUPP). Thirty-nine patients with lower urinary tract symptoms have been investigated by this technique and the results compared with those of standard pressure/flow...
This paper on performance analysis of parameter estimation is motivated by a practical consideration that the data length is finite. In particular, for time-varying systems, we study the properties of the well-known forgetting factor least-squares (FFLS) algorithm in detail in the stochastic framework, and derive upper...
eng_Latn
772
Solution phase isoelectric fractionation in the multi-compartment electrolyser: A divide and conquer strategy for the analysis of complex proteomes
Sample complexity frequently interferes with the analysis of low-abundance proteins by two-dimensional gel electrophoresis (2DGE). Ideally, high abundance proteins should be removed, allowing low-abundance proteins to be applied at much higher concentrations than is possible with the unfractionated sample. One approach...
This paper present a comparison of three main algorithms generating initial codebooks with reference to the convergence accuracy and speed. With both the elements considered, splitting methods are found to be more advantageous. Through a study of the common splitting method, an improved one-the orthogonal increment spl...
eng_Latn
773
Low frequency acoustic response of a periodic layer of spherical inclusions in an elastic solid to a normally incident plane longitudinal wave
The influence of particle mass density on the reflection and transmission spectra of a plane longitudinal wave normally incident on a periodic (square) array of identical spherical particles in a polyester matrix are measured at wavelengths which are comparable to the particle radius and the inter-particle distance. Th...
Matrix concentration inequalities have attracted much attention in diverse applications such as linear algebra, statistical estimation, combinatorial optimization, etc. In this paper, we present new Bernstein concentration inequalities depending only on the first moments of random matrices, whereas previous Bernstein i...
eng_Latn
774
Combination of weighted ℓ2, 1 minimization with unitary transformation for DOA estimation
Abstract Using the centro-symmetry property of uniform linear array (ULA), we propose an algorithm that combines the weighted l 2 , 1 minimization with the unitary transformation to improve the performance of DOA estimation. Exploiting the result of the unitary transformation, more credible weights can be obtained and ...
Abstract This article develops a solution methodology for project time compression problems in CPM/PERT type networks with convex or concave activity cost-duration functions. The proposed procedure actually approximates these relationships by piece-wise linear time-cost curves. The solution procedure is based on the Be...
eng_Latn
775
Method of convex rigid frames and applications in studies of multipartite quNit pure states
In this letter, we suggest a method of convex rigid frames in the studies of multipartite quNit pure states. We illustrate what the convex rigid frames are, and what is their method. As applications, we use this method to solve some basic problems and give some new results (three theorems): the problem of the partial s...
Abstract. One of the goals, in the context of nonparametric regression by smoothing spline functions, is to choose the optimal value for the smoothing parameter. In this paper, we deal with the cross validation method(CV), as a performance criteria for smoothing parameter selection. First, we implement a CV-based algor...
eng_Latn
776
An FPGA-based design for real-time Super Resolution Reconstruction
Since several decades, the camera spatial resolution is gradually increasing with the CMOS technology evolution. The image sensors provide more and more pixels, generating new constraints for the suitable optics. As an alternative, promising solutions propose Super Resolution (SR) image reconstruction to extend the ima...
In this paper, we investigate the problem of recovering positive semi-definite (PSD) matrix from 1-bit sensing. The measurement matrix is rank-1 and constructed by the outer product of a pair of vectors, whose entries are independent and identically distributed (i.i.d.) Gaussian variables. The recovery problem is solve...
eng_Latn
777
Weighted combination for multiple fixes
Fusion of multiple fixes is an important in determining signal source location. Various fusion algorithms for multiple fixes and fix with bearing have been developed. However, the result from the commonly used fusion algorithm, which is normalized by error covariance matrix, is largely affected by the size and orientat...
Abstract Necessary conditions and iterative computational algorithms are obtained for the problem of choosing feedback gains to optimize a linear control system with a quadratic cost function. The results are obtained in abstract terms and cover a wide range of practical problems. A design example is given
eng_Latn
778
Momentum Principal Skewness Analysis
Principal skewness analysis (PSA) has been introduced to the remote sensing community recently, which is equivalent to fast independent component analysis (FastICA) when skewness is considered as a non-Gaussian index. However, similar to FastICA, PSA also has the nonconvergence problem in searching for optimal projecti...
We prove that on an atomless probability space, the worst-case mean squared error of the Monte-Carlo estimator is minimal if the random points are chosen independently.
pol_Latn
779
A Model for Structural Vulnerability Analysis of Shipboard Power System Based on Complex Network Theory
A structural vulnerability analysis method of shipboard power system based on complex network is proposed in this paper. In this paper, the shipboard power system is modeled as a complex network, and topological characteristics of shipboard power grid are analyzed. Two structural vulnerability criterions, which are ele...
Surface reconstruction from point cloud is of great practical importance in computer graphics. Existing methods often realize reconstruction via a few phases with respective goals, whose integration may not give an optimal solution. In this paper, to avoid the inherent limitations of multi-phase processing in the prior...
kor_Hang
780
Electroreductive Deposition of Au Clusters Modified with an Anthraquinone Derivative
Anthraquinone derivative-modified Au clusters prepared by a substitution reaction of octyl thiolate-covered Au clusters with 1-(1,8-dithiaoctyl)anthracene-9,10-dione undergo a two-step one-electron reduction in aprotic solvents, resulting in the formation of an electroactive thin Au cluster film. Composite film formati...
Jointly Gaussian memoryless sources are observed at N distinct terminals. The goal is to efficiently encode the observations in a distributed fashion so as to enable reconstruction of any one of the observations, say the first one, at the decoder subject to a quadratic fidelity criterion. Our main result is a precise c...
eng_Latn
781
Naphthoquinone derivatives as tau aggregation inhibitors for the treatment of Alzheimer's and related neurodegenerative disorders
Neurodegenerative diseases (e.g., Alzheimer's disease) protein with the (e.g., tau) provides naphthoquinone type compound can be used to modulate the aggregation of. Structure Function Evaluation of oxidized and reduced forms naphthoquinone type compound such as menadione related compounds are disclosed. The present in...
For very large data sets, when the problem of classification is dimensionally large, it is known that the present neural network weight training algorithms take a very long time. It thus becomes of paramount importance to address the issue of weight training in multilayer continuous feed forward networks using back-pro...
eng_Latn
782
Polynomial-Time Random Generation of Uniform Real Matrices in the Spectral Norm Ball
Abstract This paper follows the line of research aimed to develop randomized algorithms for probabilistic analysis and design of control systems. In particular, a result for the generation of real matrix samples uniformly distributed in the spectral norm ball is presented. To this end, the distribution of the singular ...
This work investigates the global mosaic pattern and spatial entropy for one-dimensional cellular neural network (CNN). A novel method is developed to partition the parameter space into finitely many regions. The CNNs, with parameters in each region, have the same global pattern. An algorithm is also presented to evalu...
eng_Latn
783
The iodine number and the unsaturation number of fats
In order to determine the degree of unsaturation of fats and to study the kinetics of their hydrogenation, it is proposed to use instead of the iodine number an index which is called the unsaturation number and shows the total number of double bonds in 100 molecules of fatty acids.
We present an incremental approach to 2-norm estimation for triangular matrices. Our investigation covers both dense and sparse matrices which can arise for example from a QR, a Cholesky or a LU factorization. If the explicit inverse of a triangular factor is available, as in the case of an implicit version of the LU f...
eng_Latn
784
Modelling and analysis of a tricopter
Unmanned aerial vehicles (UAVs) can generally be defined as a “device used or intended to be used for flight in the air that has no on-board pilot”. Tricopter is one such UAV. Here we present new results to compute the kinematic and dynamic analysis for a tricopter mini-rotorcraft. The orientation and control of tricop...
Surface reconstruction from point cloud is of great practical importance in computer graphics. Existing methods often realize reconstruction via a few phases with respective goals, whose integration may not give an optimal solution. In this paper, to avoid the inherent limitations of multi-phase processing in the prior...
eng_Latn
785
On eigenstructure assignment by gain output feedback
In this paper, the eigenstructure assignment of linear multivariable control systems is studied from a geometric point of view. For the class of systems in which the number of outputs plus the number of inputs exceeds the number of states, genericity properties relative to this problem are derived. It is shown, without...
Matrix concentration inequalities have attracted much attention in diverse applications such as linear algebra, statistical estimation, combinatorial optimization, etc. In this paper, we present new Bernstein concentration inequalities depending only on the first moments of random matrices, whereas previous Bernstein i...
eng_Latn
786
A novel numerical method to determine the algebraic multiplicity of nonlinear eigenvalues
We generalize the algebraic multiplicity of the eigenvalues of nonlinear eigenvalue problems (NEPs) to the rational form and give the extension of the argument principle. In addition, we propose a novel numerical method to determine the algebraic multiplicity of the eigenvalues of the NEPs in a given region by the cont...
Abstract This paper is the first of a two part series that reviews and critiques several identification algorithms for fuzzy relational matrices. Part 1 reviews and evaluates algorithms that do not optimize or minimize a specified performance criteria [3,9,20,24]. It compliments and extends a recent comparative identif...
eng_Latn
787
FindMinimum, NMinimize, etc. with external process
What are the most common pitfalls awaiting new users?
Matrix doesn't shrink when put in fraction.
eng_Latn
788
Global Maximizer for log-likelihood
Negative logLikelihood Kalman filter
Global auth is dead! Long live universal login
kor_Hang
789
Fully Parallel Stochastic LDPC Decoders
Factor Graphs and the Sum Product Algorithm
Foundation review : The future of antibodies as cancer drugs
eng_Latn
790
Greedy Algorithms for Cone Constrained Optimization with Convergence Guarantees
Algorithms for Non-negative Matrix Factorization
Preservation and collection of biological evidence.
eng_Latn
791
Greed is good: algorithmic results for sparse approximation
A generalized uncertainty principle and sparse representation in pairs of bases
Entropy-Based Algorithms for Best Basis Selection
eng_Latn
792
Fast Eigenspace Approximation using Random Signals
Visualizing Large-scale and High-dimensional Data
Long-term potentiation and memory.
eng_Latn
793
Robust PCA via Nonconvex Rank Approximation
Robust principal component analysis?
The essence of three-phase AC/AC converter systems
kor_Hang
794
Global Convergence of ADMM in Nonconvex Nonsmooth Optimization
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
Model-Based Regression Testing: Process, Challenges and Approaches
eng_Latn
795
A Unified Alternating Direction Method of Multipliers by Majorization Minimization
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
Axial Plane Optical Microscopy
eng_Latn
796
online alternating direction method .
Model selection and estimation in regression with grouped variables
A new alternating minimization algorithm for total variation image reconstruction
eng_Latn
797
A Blind Source Separation Technique Using Second-Order Statistics
Matrix analysis
Leveraging the Exact Likelihood of Deep Latent Variable Models
kor_Hang
798
Enhanced Low-Rank Matrix Approximation
proximal splitting methods in signal processing ∗ .
Stiff person syndrome , startle and other immune-mediated movement disorders – new insights
eng_Latn
799