Input Space Regularization Stabilizes Pre-images for Kernel PCA De-noising
Abrahamsen, Trine Julie; Hansen, Lars Kai
2009-01-01
Solution of the pre-image problem is key to efficient nonlinear de-noising using kernel Principal Component Analysis. Pre-image estimation is inherently ill-posed for typical kernels used in applications and consequently the most widely used estimation schemes lack stability. For de...
Regularized Pre-image Estimation for Kernel PCA De-noising
Abrahamsen, Trine Julie; Hansen, Lars Kai
2011-01-01
The main challenge in de-noising by kernel Principal Component Analysis (PCA) is the mapping of de-noised feature space points back into input space, also referred to as “the pre-image problem”. Since the feature space mapping is typically not bijective, pre-image estimation is inherently illposed...
Cloninger, Alexander; Czaja, Wojciech; Doster, Timothy
2017-07-01
As the popularity of non-linear manifold learning techniques such as kernel PCA and Laplacian Eigenmaps grows, vast improvements have been seen in many areas of data processing, including heterogeneous data fusion and integration. One problem with the non-linear techniques, however, is the lack of an easily calculable pre-image. Existence of such pre-image would allow visualization of the fused data not only in the embedded space, but also in the original data space. The ability to make such comparisons can be crucial for data analysts and other subject matter experts who are the end users of novel mathematical algorithms. In this paper, we propose a pre-image algorithm for Laplacian Eigenmaps. Our method offers major improvements over existing techniques, which allow us to address the problem of noisy inputs and the issue of how to calculate the pre-image of a point outside the convex hull of training samples; both of which have been overlooked in previous studies in this field. We conclude by showing that our pre-image algorithm, combined with feature space rotations, allows us to recover occluded pixels of an imaging modality based off knowledge of that image measured by heterogeneous modalities. We demonstrate this data recovery on heterogeneous hyperspectral (HS) cameras, as well as by recovering LIDAR measurements from HS data.
Robust integral stabilization of regular linear systems
XU Chengzheng; FENG Dexing
2004-01-01
We consider regular systems with control and observation. We prove some necessary and sufficient condition for an exponentially stable regular system to admit an integral stabilizing controller. We propose also some robust integral controllers when they exist.
Stabilization, Pole Placement, and Regular Implementability
Belur, Madhu N.; Trentelman, H.L.
2002-01-01
In this paper, we study control by interconnection of linear differential systems. We give necessary and sufficient conditions for regular implementability of a given linear differential system. We formulate the problems of stabilization and pole placement as problems of finding a suitable, regularl
Stability Analysis for Regularized Least Squares Regression
Rudin, Cynthia
2005-01-01
We discuss stability for a class of learning algorithms with respect to noisy labels. The algorithms we consider are for regression, and they involve the minimization of regularized risk functionals, such as L(f) := 1/N sum_i (f(x_i)-y_i)^2+ lambda ||f||_H^2. We shall call the algorithm `stable' if, when y_i is a noisy version of f*(x_i) for some function f* in H, the output of the algorithm converges to f* as the regularization term and noise simultaneously vanish. We consider two flavors of...
Stability of C-regularized Semigroups
Miao LI; Quan ZHENG
2004-01-01
Let T = (T(t))t≥0 be a bounded C-regularized semigroup generated by A on a Banachspace X and R(C) be dense in X. We show that if there is a dense subspace Y of X such that forevery x ∈ Y, σu(A, Cx), the set of all points λ∈ iR to which (λ - A)-1Cx can not be extendedholomorphically, is at most countable and σr(A) ∩ iR = φ, then T is stable. A stability result for the case of R(C) being non-dense is also given. Our results generalize the work on the stability of strongly continuous semigroups.
Dynamic stabilization of regular linear systems
Weiss, G; Curtain, RF
We consider a general class of infinite-dimensional linear systems, called regular linear systems, for which convenient representations are known to exist both in time and in frequency domain, For this class of systems, we investigate the concepts of stabilizability and detectability, in particular,
Dynamic stabilization of regular linear systems
Weiss, G; Curtain, RF
1997-01-01
We consider a general class of infinite-dimensional linear systems, called regular linear systems, for which convenient representations are known to exist both in time and in frequency domain, For this class of systems, we investigate the concepts of stabilizability and detectability, in particular,
Regular implementability and its application to stabilization of system behaviors
Belur, M.N.; Trentelman, H.L.; Willems, J.C.
2001-01-01
In this paper we study control by interconnection of linear differential systems. We give necessary and sufficient conditions for regular implementability of a given linear differential system. We formulate the problems of stabilization and pole placement as problems of finding suitable, regularly i
Stability of the Regular Hayward Thin-Shell Wormholes
M. Sharif
2016-01-01
Full Text Available The aim of this paper is to construct regular Hayward thin-shell wormholes and analyze their stability. We adopt Israel formalism to calculate surface stresses of the shell and check the null and weak energy conditions for the constructed wormholes. It is found that the stress-energy tensor components violate the null and weak energy conditions leading to the presence of exotic matter at the throat. We analyze the attractive and repulsive characteristics of wormholes corresponding to ar>0 and ar<0, respectively. We also explore stability conditions for the existence of traversable thin-shell wormholes with arbitrarily small amount of fluid describing cosmic expansion. We find that the space-time has nonphysical regions which give rise to event horizon for 0
Stability of the Regular Hayward Thin-Shell Wormholes
Sharif, M
2016-01-01
The aim of this paper is to construct regular Hayward thin-shell wormholes and analyze their stability. We adopt Israel formalism to calculate surface stresses of the shell and check the null and weak energy conditions for the constructed wormholes. It is found that the stress-energy tensor components violate the null and weak energy conditions leading to the presence of exotic matter at the throat. We analyze the attractive and repulsive characteristics of wormholes corresponding to $a^r>0$ and $a^r<0$, respectively. We also explore stability conditions for the existence of traversable thin-shell wormholes with arbitrarily small amount of fluids describing cosmic expansion. We find that the spacetime has non-physical regions which give rise to event horizon for $0
Stabilization of the Regularity of Powers of An Ideal
Eisenbud, David
2010-01-01
When M is a finitely generated graded module over a standard graded algebra S and I is an ideal of S, it is known from work of Cutkosky, Herzog, Kodiyalam, R\\"omer, Trung and Wang that the Castelnuovo-Mumford regularity of I^mM has the form dm+e when m >> 0. We give an explicit bound on the m$for which this is true, under the hypotheses that I is generated in a single degree and M/IM has finite length, and we explore the phenomena that occur when these hypotheses are not satisfied. Finally, we prove a regularity bound for a reduced, equidimensional projective scheme of codimension 2 that is similar to the bound in the Eisenbud-Goto conjecture [1984], under the additional hypotheses that the scheme lies on a quadric and has nice singularities.
Removal of dispersant-stabilized carbon nanotubes by regular coagulants
Ni Liu; Changli Liu; Jing Zhang; Daohui Lin
2012-01-01
Coagulation followed by sedimentation,as a conventional technique in the water treatment plant,can be the first line of defense against exposures of carbon nanotubes(CNTs)to aquatic organisms and human beings,which has been rarely documented.This study investigated the removal of dispersant-stabilized CNT suspensions by poly aluminum chloride(PAC1)and KAI(SO4)2·12H2O (alum),with a focus on the effects of dispersant type,coagulant type and dosage.PAC1 performed better than alum in the removal of tannic acid-,humic acid-,and sodium dodecyl benzenesulfonate-stabilized CNTs,but worse for polyethylene glycol octylphenyl ether(TX100)-stabilized CNTs.Neither coagulant could effectively precipitate cetyltrimethyl ammonium bromide-stabilized CNTs.The removal by PAC1 first increased up to a plateau and then decreased with the continued increase of coagulant dosage.However,the removal rates leveled off but did not decrease after achieving their highest level with the continued addition of alum.The coagulation and flocculation of the CNT suspensions by PAC1 could be regulated mainly by the mechanism of adsorption charge neutralization,whereas the coagulation by alum mainly involved electrical double-layer compression.
Stability of phenolic compounds and antioxidant capacity of regular and decaffeinated coffees
2014-01-01
This study compared the regular and decaffeinated coffees in relation to antioxidant capacity, levels of some antioxidant molecules and stability of these parameters over a six-month period under different storage conditions. The regular coffee samples analyzed right after the industrial production showed higher antioxidant capacity (ORAC and DPPH), the same levels of phenolic compounds and higher levels of phenolic acids than decaffeinated coffee. After six months, the closed packs of both t...
Stability of Thin-Shell Wormholes from Regular ABG Black Hole
Sharif, M
2016-01-01
In this paper, we construct thin-shell wormholes from regular Ayon-Beato and Garcia black hole by employing cut and paste formalism and examine their stability. We analyze attractive and repulsive characteristics of wormholes corresponding to outward and inward-directed acceleration components, respectively. A general equation of state is assumed as a linear perturbation to explore stability of these constructed wormholes with and without cosmological constant. We consider linear, logarithmic and Chaplygin gas models for exotic matter and evaluate stability regions for different values of charge. For horizon-free case, it is found that the generalized Chaplygin gas model provides maximum stable regions in de Sitter background while the modified generalized Chaplygin gas and logarithmic gas yield maximum stable regions in anti-de Sitter spacetime.
Stability of thin-shell wormholes from a regular ABG black hole
Sharif, M.; Mumtaz, Saadia
2017-01-01
In this paper, we construct thin-shell wormholes from a regular Ayon-Beato-Garcia black hole by employing cut and paste formalism and examine their stability. We analyze attractive and repulsive characteristics of the respective thin-shell wormholes. A general equation of state is assumed as a linear perturbation to explore stability of these constructed wormholes with and without cosmological constant. We consider linear, logarithmic and Chaplygin gas models for exotic matter and evaluate stability regions for different values of charge. It is found that the generalized Chaplygin gas model provides maximum stable regions in the de Sitter background while the modified generalized Chaplygin gas and logarithmic gas yield maximum stable regions in the anti-de Sitter spacetime.
Influence of whitening and regular dentifrices on orthodontic clear ligature color stability.
Oliveira, Adauê S; Kaizer, Marina R; Salgado, Vinícius E; Soldati, Dener C; Silva, Roberta C; Moraes, Rafael R
2015-01-01
This study evaluated the effect of brushing orthodontic clear ligatures with a whitening dentifrice containing a blue pigment (Close Up White Now, Unilever, London, UK) on their color stability, when exposed to a staining agent. Ligatures from 3M Unitek (Monrovia, CA, USA) and Morelli (Sorocaba, SP, Brazil) were tested. Baseline color measurements were performed and nonstained groups (control) were stored in distilled water whereas test groups were exposed for 1 hour daily to red wine. Specimens were brushed daily using regular or whitening dentifrice. Color measurements were repeated after 7, 14, 21, and 28 days using a spectrophotometer based on the CIE L*a*b* system. Decreased luminosity (CIE L*), increased red discoloration (CIE a* axis), and increased yellow discoloration (CIE b* axis) were generally observed for ligatures exposed to the staining agent. Color variation was generally lower in specimens brushed with regular dentifrice, but ligatures brushed with whitening dentifrice were generally less red and less yellow than regular dentifrice. The whitening dentifrice led to blue discoloration trend, with visually detectable differences particularly apparent according to storage condition and ligature brand. The whitening dentifrice containing blue pigment did not improve the ligature color stability, but it decreased yellow discoloration and increased a blue coloration. The use of a whitening dentifrice containing blue pigment during orthodontic treatment might decrease the yellow discoloration of elastic ligatures. © 2015 Wiley Periodicals, Inc.
Increasing stability and accuracy of the lattice Boltzmann scheme: recursivity and regularization
Malaspinas, Orestis
2015-01-01
In the present paper a lattice Boltzmann scheme is presented which exhibits an increased stability and accuracy with respect to standard single- or multi-relaxation-time (MRT) approaches. The scheme is based on a single-relaxation-time model where a special regularization procedure is applied. This regularization is based on the fact that, for a-thermal flows, there exists a recursive way to express the velocity distribution function at any order (in the Hermite series sense) in terms of the density, velocity, and stress tensor. A linear stability analysis is conducted which shows enhanced dispersion/dissipation relations with respect to existing models. The model is then validated on two (one 2D and one 3D) moderately high Reynolds number simulations ($\\mathrm{Re}\\sim 1000$) at moderate Mach numbers ($\\mathrm{Ma}\\sim 0.5$). In both cases the results are compared with an MRT model and an enhanced accuracy and stability is shown by the present model.
Shen, Wenxian; Shen, Zhongwei
2017-03-01
The present paper is devoted to the investigation of various properties of transition fronts in one-dimensional nonlocal equations in heterogeneous media of ignition type, whose existence has been established by the authors of the present paper in a previous work. It is first shown that transition fronts are continuously differentiable in space with uniformly bounded and uniformly Lipschitz continuous space partial derivative. This is the first time that space regularity of transition fronts in nonlocal equations is ever studied. It is then shown that transition fronts are uniformly steep. Finally, asymptotic stability, in the sense of exponentially attracting front-like initial data, of transition fronts is studied.
Stability of regular energy density in Palatini f(R) gravity
Sharif, M.; Yousaf, Z. [University of the Punjab, Department of Mathematics, Lahore (Pakistan)
2015-02-01
The present work explores the effects of the three-parametric f(R) model on the stability of the regular energy density of planar fluid configurations with the Palatini f(R) formalism. For this purpose, we develop a link between the Weyl scalar and structural properties of the system by evaluating a couple of differential equations. We also see the effects of Palatini f(R) terms in the formulation of structure scalars obtained by orthogonal splitting of the Riemann tensor in general relativity. We then identify the parameters which produce energy density irregularities in expansive and expansion-free dissipative as well as non-dissipative matter distributions. It is found that particular combinations of the matter variables lead to irregularities in an initially homogeneous fluid distribution. We conclude that Palatini f(R) extra corrections tend to decrease the inhomogeneity, thereby imparting stability to the self-gravitating system. (orig.)
Frostad, Per; Mjaavatn, Per Egil; Pijl, Sip Jan
2011-01-01
The study focuses the stability of friendships of students with special educational needs in regular schools, compared to regular students. The sample consisted of 114 students (M age = 14,4); 22 students (19.3%) were identified by the school as SEN students. The results show that on average, SEN students had fewer stable friendships than their…
Stabilizing dual-energy X-ray computed tomography reconstructions using patch-based regularization
Tracey, Brian H
2014-01-01
Recent years have seen growing interest in exploiting dual- and multi-energy measurements in computed tomography (CT) in order to characterize material properties as well as object shape. Material characterization is performed by decomposing the scene into constitutive basis functions, such as Compton scatter and photoelectric absorption functions. While well motivated physically, the joint recovery of the spatial distribution of photoelectric and Compton properties is severely complicated by the fact that the data are several orders of magnitude more sensitive to Compton scatter coefficients than to photoelectric absorption, so small errors in Compton estimates can create large artifacts in the photoelectric estimate. To address these issues, we propose a model-based iterative approach which uses patch-based regularization terms to stabilize inversion of photoelectric coefficients, and solve the resulting problem though use of computationally attractive Alternating Direction Method of Multipliers (ADMM) solu...
PRE-IMAGE ENTROPY OF NONAUTONOMOUS DYNAMICAL SYSTEMS
Xianjiu HUANG; Xi WEN; Fanping ZENG
2008-01-01
The authors define and study topological pre-image entropy for the non-autonomous discrete dynamical systems given by a sequence {fi}∞/i=1 of continuous self-maps of a compact topological space.The basic properties and the invariant with respect to equiconjugacy of pre-image entropy for the non-autonomous discrete dynamical systems are obtained.
Braverman, E., E-mail: maelena@ucalgary.ca; Chan, B. [Department of Mathematics and Statistics, University of Calgary, 2500 University Drive N.W., Calgary AB T2N 1N4 (Canada)
2014-03-15
Investigating a method of chaos control for one-dimensional maps, where the intervention is proportional to the difference between a fixed value and a current state, we demonstrate that stabilization is possible in one of the two following cases: (1) for small values, the map is increasing and the slope of the line connecting the points on the line with the origin is decreasing; (2) the chaotic map is locally Lipschitz. Moreover, in the latter case we prove that any point of the map can be stabilized. In addition, we study pulse stabilization when the intervention occurs each m-th step and illustrate that stabilization is possible for the first type of maps. In the context of population dynamics, we notice that control with a positive target, even if stabilization is not achieved, leads to persistent solutions and prevents extinction in models which experience the Allee effect.
Braverman, E.; Chan, B.
2014-03-01
Investigating a method of chaos control for one-dimensional maps, where the intervention is proportional to the difference between a fixed value and a current state, we demonstrate that stabilization is possible in one of the two following cases: (1) for small values, the map is increasing and the slope of the line connecting the points on the line with the origin is decreasing; (2) the chaotic map is locally Lipschitz. Moreover, in the latter case we prove that any point of the map can be stabilized. In addition, we study pulse stabilization when the intervention occurs each m-th step and illustrate that stabilization is possible for the first type of maps. In the context of population dynamics, we notice that control with a positive target, even if stabilization is not achieved, leads to persistent solutions and prevents extinction in models which experience the Allee effect.
The pre-image problem in kernel methods.
Kwok, James Tin-yau; Tsang, Ivor Wai-hung
2004-11-01
In this paper, we address the problem of finding the pre-image of a feature vector in the feature space induced by a kernel. This is of central importance in some kernel applications, such as on using kernel principal component analysis (PCA) for image denoising. Unlike the traditional method which relies on nonlinear optimization, our proposed method directly finds the location of the pre-image based on distance constraints in the feature space. It is noniterative, involves only linear algebra and does not suffer from numerical instability or local minimum problems. Evaluations on performing kernel PCA and kernel clustering on the USPS data set show much improved performance.
Korobenko, L; Braverman, E
2014-11-01
Two competing populations in spatially heterogeneous but temporarily constant environment are investigated: one is subject to regular movements to lower density areas (random diffusion) while the dispersal of the other is in the direction of the highest per capita available resources (carrying capacity driven diffusion). The growth of both species is subject to the same general growth law which involves Gilpin-Ayala, Gompertz and some other equations as particular cases. The growth rate, carrying capacity and dispersal rate are the same for both population types, the only difference is the dispersal strategy. The main result of the paper is that the two species cannot coexist (unless the environment is spatially homogeneous), and the carrying capacity driven diffusion strategy is evolutionarily stable in the sense that the species adopting this strategy cannot be invaded by randomly diffusing population. Moreover, once the invasive species inhabits some open nonempty domain, it would spread over any available area bringing the native species diffusing randomly to extinction. One of the important technical results used in the proofs can be interpreted in the form that the limit solution of the equation with a regular diffusion leads to lower total population fitness than the ideal free distribution.
On pre-image iterations for speech enhancement.
Leitner, Christina; Pernkopf, Franz
2015-01-01
In this paper, we apply kernel PCA for speech enhancement and derive pre-image iterations for speech enhancement. Both methods make use of a Gaussian kernel. The kernel variance serves as tuning parameter that has to be adapted according to the SNR and the desired degree of de-noising. We develop a method to derive a suitable value for the kernel variance from a noise estimate to adapt pre-image iterations to arbitrary SNRs. In experiments, we compare the performance of kernel PCA and pre-image iterations in terms of objective speech quality measures and automatic speech recognition. The speech data is corrupted by white and colored noise at 0, 5, 10, and 15 dB SNR. As a benchmark, we provide results of the generalized subspace method, of spectral subtraction, and of the minimum mean-square error log-spectral amplitude estimator. In terms of the scores of the PEASS (Perceptual Evaluation Methods for Audio Source Separation) toolbox, the proposed methods achieve a similar performance as the reference methods. The speech recognition experiments show that the utterances processed by pre-image iterations achieve a consistently better word recognition accuracy than the unprocessed noisy utterances and than the utterances processed by the generalized subspace method.
Godoy-Lorite, Antonia; Guimerà, Roger; Sales-Pardo, Marta
2016-01-01
In social networks, individuals constantly drop ties and replace them by new ones in a highly unpredictable fashion. This highly dynamical nature of social ties has important implications for processes such as the spread of information or of epidemics. Several studies have demonstrated the influence of a number of factors on the intricate microscopic process of tie replacement, but the macroscopic long-term effects of such changes remain largely unexplored. Here we investigate whether, despite the inherent randomness at the microscopic level, there are macroscopic statistical regularities in the long-term evolution of social networks. In particular, we analyze the email network of a large organization with over 1,000 individuals throughout four consecutive years. We find that, although the evolution of individual ties is highly unpredictable, the macro-evolution of social communication networks follows well-defined statistical patterns, characterized by exponentially decaying log-variations of the weight of social ties and of individuals' social strength. At the same time, we find that individuals have social signatures and communication strategies that are remarkably stable over the scale of several years.
Stability estimates for the regularized inversion of the truncated Hilbert transform
Alaifari, Rima; Defrise, Michel; Katsevich, Alexander
2016-06-01
In limited data computerized tomography, the 2D or 3D problem can be reduced to a family of 1D problems using the differentiated backprojection method. Each 1D problem consists of recovering a compactly supported function f\\in {L}2({ F }), where { F } is a finite interval from its partial Hilbert transform data. When the Hilbert transform is measured on a finite interval { G } that only overlaps but does not cover { F }, this inversion problem is known to be severely ill-posed (Alaifari et al 2015 SIAM J. Math. Anal. 47 797-824). In this paper, we study the reconstruction of f restricted to the overlap region { F }\\cap { G }. We show that with this restriction and by assuming prior knowledge on the L 2 norm or on the variation of f, better stability with Hölder continuity (typical for mildly ill-posed problems) can be obtained.
Dimauro, Ivan; Sgura, Antonella; Pittaluga, Monica; Magi, Fiorenza; Fantini, Cristina; Mancinelli, Rosa; Sgadari, Antonio; Fulle, Stefania; Caporossi, Daniela
2017-06-23
Physical activity has been demonstrated to be effective in the prevention and treatment of different chronic conditions, including type 2 diabetes (T2D). In particular, several studies highlighted how the beneficial effects of physical activity may be related to the stability of the DNA molecule, such as longer telomeric ends. Here we analyze the effect of exercise training on telomere length, spontaneous and H2O2-induced DNA damage, as well as the apoptosis level in leukocytes from untrained or trained T2D patients vs. age-matched control subjects (CS) (57-66 years). Moreover, expression analysis of selected genes belonging to DNA repair systems, cell cycle control, antioxidant and defence systems was performed. Subjects that participated in a regular exercise program showed a longer telomere sequence than untrained counterparts. Moreover, ex vivo treatment of leukocytes with H2O2 highlighted that: (1) oxidative DNA damage induced similar telomere attrition in all groups; (2) in T2D subjects, physical activity seemed to prevent a significant increase of genomic oxidative DNA damage induced by chronic exposure to pro-oxidant stimulus, and (3) decreased the sensitivity of leukocytes to apoptosis. Finally, the gene expression analysis in T2D subjects suggested an adaptive response to prolonged exercise training that improved the response of specific genes.
Planning JWST NIRSpec MSA spectroscopy using NIRCam pre-images
Beck, Tracy L.; Ubeda, Leonardo; Kassin, Susan A.; Gilbert, Karoline; Karakla, Diane M.; Reid, I. N.; Blair, William P.; Keyes, Charles D.; Soderblom, D. R.; Peña-Guerrero, Maria A.
2016-07-01
The Near-Infrared Spectrograph (NIRSpec) is the work-horse spectrograph at 1-5microns for the James Webb Space Telescope (JWST). A showcase observing mode of NIRSpec is the multi-object spectroscopy with the Micro-Shutter Arrays (MSAs), which consist of a quarter million tiny configurable shutters that are 0. ''20×0. ''46 in size. The NIRSpec MSA shutters can be opened in adjacent rows to create flexible and positionable spectroscopy slits on prime science targets of interest. Because of the very small shutter width, the NIRSpec MSA spectral data quality will benefit significantly from accurate astrometric knowledge of the positions of planned science sources. Images acquired with the Hubble Space Telescope (HST) have the optimal relative astrometric accuracy for planning NIRSpec observations of 5-10 milli-arcseconds (mas). However, some science fields of interest might have no HST images, galactic fields can have moderate proper motions at the 5mas level or greater, and extragalactic images with HST may have inadequate source information at NIRSpec wavelengths beyond 2 microns. Thus, optimal NIRSpec spectroscopy planning may require pre-imaging observations with the Near-Infrared Camera (NIRCam) on JWST to accurately establish source positions for alignment with the NIRSpec MSAs. We describe operational philosophies and programmatic considerations for acquiring JWST NIRCam pre-image observations for NIRSpec MSA spectroscopic planning within the same JWST observing Cycle.
Lamoth, Claudine J. C.; van Heuvelen, Marieke J. G.
2012-01-01
With age postural control deteriorates and increases the risk for falls. Recent research has suggested that in contrast to persons with superior balance control (dancer's athletes), with pathology and aging, predictability and regularity of sway patterns increase and stability decreases implying a l
Areej M. Abduldaim
2013-01-01
Full Text Available We introduced and studied -regular modules as a generalization of -regular rings to modules as well as regular modules (in the sense of Fieldhouse. An -module is called -regular if for each and , there exist and a positive integer such that . The notion of -pure submodules was introduced to generalize pure submodules and proved that an -module is -regular if and only if every submodule of is -pure iff is a -regular -module for each maximal ideal of . Many characterizations and properties of -regular modules were given. An -module is -regular iff is a -regular ring for each iff is a -regular ring for finitely generated module . If is a -regular module, then .
Rocchio MA; Belisle CD; Greenwood BC; Cotugno MC; Szumita PM
2013-01-01
Megan A Rocchio, Caryn D Belisle, Bonnie C Greenwood, Michael C Cotugno, Paul M SzumitaDepartment of Pharmacy, Brigham and Women's Hospital, Boston, MA, USABackground: Regular human insulin 100 units added to a sufficient quantity of 0.9% sodium chloride, to yield a total volume of 100 mL within a polyvinylchloride bag, is accepted to be stable for 24 hours due to physical denaturation and chemical modification. The objective of this study was to evaluate the extended stability of suc...
Rocchio MA
2013-10-01
Full Text Available Megan A Rocchio, Caryn D Belisle, Bonnie C Greenwood, Michael C Cotugno, Paul M SzumitaDepartment of Pharmacy, Brigham and Women's Hospital, Boston, MA, USABackground: Regular human insulin 100 units added to a sufficient quantity of 0.9% sodium chloride, to yield a total volume of 100 mL within a polyvinylchloride bag, is accepted to be stable for 24 hours due to physical denaturation and chemical modification. The objective of this study was to evaluate the extended stability of such extemporaneously prepared regular human insulin, stored under refrigeration, to the maximum beyond-use-date allowed by United States Pharmacopeia chapter 797.Methods: At time “0” three admixtures of regular human insulin were prepared by withdrawing 1 mL of regular human insulin with a concentration of 100 units/mL and adding it to a sufficient quantity of 0.9% sodium chloride for injection in a polyvinylchloride bag to yield a total volume of 100 mL. The three admixtures were stored under refrigeration (2°C–8°C [36°F–46°F], and one sample of each admixture was withdrawn and tested in duplicate at 0, 6, 24, 48, 72, 144, 168, 192, 216, 240, 312, and 336 hours. Utilizing high performance liquid chromatography, each sample underwent immediate testing. The time points were stable if the mean concentration of the samples exceeded 90% of the equilibrium concentration at 6 hours.Results: The equilibrium concentration was 0.89 units/mL. Time points were stable if the mean concentration was at least 0.80 units/mL. All time points retained at least 90% of the equilibrium concentration, with the exception of hour 168 (0.79 ± 0.03 units/mL. At 192 hours the mean concentration was 0.88 ± 0.03 units/mL. At 336 hours the mean concentration was 0.91 ± 0.02 units/mL.Conclusion: Based on these results, regular human insulin 100 units added to 0.9% sodium chloride for injection in a polyvinylchloride bag to yield a total volume of 100 mL is stable for up to 336 hours
Godoy-Lorite, Antonia; Sales-Pardo, Marta
2016-01-01
In social networks, individuals constantly drop ties and replace them by new ones in a highly unpredictable fashion. This highly dynamical nature of social ties has important implications for processes such as the spread of information or of epidemics. Several studies have demonstrated the influence of a number of factors on the intricate microscopic process of tie replacement, but the macroscopic long-term effects of such changes remain largely unexplored. Here we investigate whether, despite the inherent randomness at the microscopic level, there are macroscopic statistical regularities in the long-term evolution of social networks. In particular, we analyze the email network of a large organization with over 1,000 individuals throughout four consecutive years. We find that, although the evolution of individual ties is highly unpredictable, the macro-evolution of social communication networks follows well-defined statistical laws, characterized by exponentially decaying log-variations of the weight of socia...
The Vlasov-Navier-Stokes system in a 2D pipe: existence and stability of regular equilibria
Glass, Olivier; Han-Kwan, Daniel; Moussa, Ayman
2016-01-01
In this paper, we study the Vlasov-Navier-Stokes system in a 2D pipe with partially absorbing boundary conditions. We show the existence of stationary states for this system near small Poiseuille flows for the fluid phase, for which the kinetic phase is not trivial. We prove the asymptotic stability of these states with respect to appropriately compactly supported perturbations. The analysis relies on geometric control conditions which help to avoid any concentration phenomenon for the kineti...
2012-04-01
a trade-off between static and dynamic stability is evident. 1. Introduction Requirements for rapid increase in thrust for take-off and climb ...injected through spray bars and is atomized by shearing due to the turbine exhaust flow. It then evaporates and mixes with the available oxygen. The mixture...exit through a converging/diverging nozzle with extensive film cooling and a variable throat area located downstream of the afterburner exit. The
Rasmussen, Peter Mondrup; Abrahamsen, Trine Julie; Madsen, Kristoffer Hougaard
2012-01-01
We investigate the use of kernel principal component analysis (PCA) and the inverse problem known as pre-image estimation in neuroimaging: i) We explore kernel PCA and pre-image estimation as a means for image denoising as part of the image preprocessing pipeline. Evaluation of the denoising...... base these illustrations on two fMRI BOLD data sets — one from a simple finger tapping experiment and the other from an experiment on object recognition in the ventral temporal lobe....
Tóth, L Fejes; Ulam, S; Stark, M
1964-01-01
Regular Figures concerns the systematology and genetics of regular figures. The first part of the book deals with the classical theory of the regular figures. This topic includes description of plane ornaments, spherical arrangements, hyperbolic tessellations, polyhedral, and regular polytopes. The problem of geometry of the sphere and the two-dimensional hyperbolic space are considered. Classical theory is explained as describing all possible symmetrical groupings in different spaces of constant curvature. The second part deals with the genetics of the regular figures and the inequalities fo
Lamoth, Claudine J C; van Heuvelen, Marieke J G
2012-03-01
With age postural control deteriorates and increases the risk for falls. Recent research has suggested that in contrast to persons with superior balance control (dancer's athletes), with pathology and aging, predictability and regularity of sway patterns increase and stability decreases implying a less adaptive form of postural control. The aim of the present study was to determine, whether patterns of body sway of elderly (N=13) who practice a sport which challenges postural control (ice speed-skating), are more similar to that of young subjects (N=10) than to that of inactive elderly (N=10). Trunk patterns were measured with a tri-axial accelerometer. Data were recorded during quiet upright stance with (1) eyes open, (2) limited vision, and (3) while performing a dual task. Anterior-posterior and medio-lateral acceleration time-series were analyzed. Differences in postural control were quantified in terms of the magnitude of the acceleration (root mean square), the smoothness (mean power frequency), the predictability (sample entropy) and the local stability (largest Lyapunov exponent). Postural control of ice-skating elderly differed from that of sedentary elderly. As anticipated, postural control of the ice-skating elderly was similar to that of young adults. For anterior-posterior accelerations, the skating elderly and the younger subjects had significant higher stability and lower regularity than the non-skating elderly in all tasks. These results imply that sport activities such as ice-skating are beneficial for elderly people. It might, at least partly, counteract the age related changes in postural control.
Decker Leslie M
2012-02-01
Full Text Available Abstract Background Wearing a harness during treadmill walking ensures the subject's safety and is common practice in biomedical engineering research. However, the extent to which such practice influences gait is unknown. This study investigated harness-related changes in gait patterns, as evaluated from lower extremity kinematics during treadmill walking. Findings Healthy subjects (n = 10 walked on a treadmill at their preferred speed for 3 minutes with and without wearing a harness (LiteGait®, Mobility Research, Inc.. In the former condition, no weight support was provided to the subjects. Lower extremity kinematics was assessed in the sagittal plane from the mean (meanRoM, standard deviation (SDRoM and coefficient of variation (CoVRoM of the hip, knee, and ankle ranges of motion (RoM, as well as from the sample entropy (SampEn and the largest Lyapunov exponent (LyE of the joints' angles. Wearing the harness increased the meanRoM of the hip, the SDRoM and the CoVRoM of the knee, and the SampEn and the LyE of the ankle. In particular, the harness effect sizes for both the SampEn and the LyE of the ankle were large, likely reflecting a meaningful decline in the neuromuscular stabilizing control of this joint. Conclusions Wearing a harness during treadmill walking marginally influences lower extremity kinematics, resulting in more or less subtle changes in certain kinematic variables. However, in cases where differences in gait patterns would be expressed through modifications in these variables, having subjects walk with a harness may mask or reinforce such differences.
Preservation of local linearity by neighborhood subspace scaling for solving the pre-image problem
Sheng-kai YANG; Jian-yi MENG; Hai-bin SHEN
2014-01-01
An important issue involved in kernel methods is the pre-image problem. However, it is an ill-posed problem, as the solution is usually nonexistent or not unique. In contrast to direct methods aimed at minimizing the distance in feature space, indirect methods aimed at constructing approximate equivalent models have shown outstanding performance. In this paper, an indirect method for solving the pre-image problem is proposed. In the proposed algorithm, an inverse mapping process is constructed based on a novel framework that preserves local linearity. In this framework, a local nonlinear transformation is implicitly conducted by neighborhood subspace scaling transformation to preserve the local linearity between feature space and input space. By extending the inverse mapping process to test samples, we can obtain pre-images in input space. The proposed method is non-iterative, and can be used for any kernel functions. Experimental results based on image denoising using kernel principal component analysis (PCA) show that the proposed method outperforms the state-of-the-art methods for solving the pre-image problem.
一类非奇异黑洞的热力学稳定性%Thermodynamic Stability of the Regular Black Hole
马孟森; 马亚琴
2015-01-01
黑洞也是一种热力学系统，则对于黑洞通常的热力学定律也应该成立。基于此，研究了巴丁黑洞的热力学量及其热力学稳定性。结果表明巴丁黑洞的熵应该仍然是贝肯斯坦-霍金熵，但是巴丁黑洞的质量不再是该系统的内能。利用重新定义的巴丁黑洞内能，计算了热容量和热力学曲率，以此分析了巴丁黑洞的热力学稳定性和相变。%Black hole is a type of thermodynamic system, thus the usual thermodynamic laws should be established. On the basis of this belief, we study thermodynamics of Bardeen black hole. It is shown that the entropy of the black hole still obeys the Bekenstein-Hawking area law, however, the black hole mass M can no longer be considered as the internal energy of the black hole thermodynamic system. Using this redefined internal energy of regular black holes in the first law, we calculate the heat capacity and thermodynamic curvature to understand the stability of the Bardeen black holes.
Hansen, Lars Kai; Rasmussen, Carl Edward; Svarer, C.
1994-01-01
Regularization, e.g., in the form of weight decay, is important for training and optimization of neural network architectures. In this work the authors provide a tool based on asymptotic sampling theory, for iterative estimation of weight decay parameters. The basic idea is to do a gradient descent...... in the estimated generalization error with respect to the regularization parameters. The scheme is implemented in the authors' Designer Net framework for network training and pruning, i.e., is based on the diagonal Hessian approximation. The scheme does not require essential computational overhead in addition...... to what is needed for training and pruning. The viability of the approach is demonstrated in an experiment concerning prediction of the chaotic Mackey-Glass series. The authors find that the optimized weight decays are relatively large for densely connected networks in the initial pruning phase, while...
Coxeter, H S M
1973-01-01
Polytopes are geometrical figures bounded by portions of lines, planes, or hyperplanes. In plane (two dimensional) geometry, they are known as polygons and comprise such figures as triangles, squares, pentagons, etc. In solid (three dimensional) geometry they are known as polyhedra and include such figures as tetrahedra (a type of pyramid), cubes, icosahedra, and many more; the possibilities, in fact, are infinite! H. S. M. Coxeter's book is the foremost book available on regular polyhedra, incorporating not only the ancient Greek work on the subject, but also the vast amount of information
Regularized Reduced Order Models
Wells, David; Xie, Xuping; Iliescu, Traian
2015-01-01
This paper puts forth a regularization approach for the stabilization of proper orthogonal decomposition (POD) reduced order models (ROMs) for the numerical simulation of realistic flows. Two regularized ROMs (Reg-ROMs) are proposed: the Leray ROM (L-ROM) and the evolve-then-filter ROM (EF-ROM). These new Reg-ROMs use spatial filtering to smooth (regularize) various terms in the ROMs. Two spatial filters are used: a POD projection onto a POD subspace (Proj) and a new POD differential filter (DF). The four Reg-ROM/filter combinations are tested in the numerical simulation of the one-dimensional Burgers equation with a small diffusion coefficient and the three-dimensional flow past a circular cylinder at a low Reynolds number (Re = 100). Overall, the most accurate Reg-ROM/filter combination is EF-ROM-DF. Furthermore, the DF generally yields better results than Proj. Finally, the four Reg-ROM/filter combinations are computationally efficient and generally more accurate than the standard Galerkin ROM.
Regularizing portfolio optimization
Still, Susanne; Kondor, Imre
2010-07-01
The optimization of large portfolios displays an inherent instability due to estimation error. This poses a fundamental problem, because solutions that are not stable under sample fluctuations may look optimal for a given sample, but are, in effect, very far from optimal with respect to the average risk. In this paper, we approach the problem from the point of view of statistical learning theory. The occurrence of the instability is intimately related to over-fitting, which can be avoided using known regularization methods. We show how regularized portfolio optimization with the expected shortfall as a risk measure is related to support vector regression. The budget constraint dictates a modification. We present the resulting optimization problem and discuss the solution. The L2 norm of the weight vector is used as a regularizer, which corresponds to a diversification 'pressure'. This means that diversification, besides counteracting downward fluctuations in some assets by upward fluctuations in others, is also crucial because it improves the stability of the solution. The approach we provide here allows for the simultaneous treatment of optimization and diversification in one framework that enables the investor to trade off between the two, depending on the size of the available dataset.
Regular Black Holes with Cosmological Constant
MO Wen-Juan; CAI Rong-Gen; SU Ru-Keng
2006-01-01
We present a class of regular black holes with cosmological constant Λ in nonlinear electrodynamics. Instead of usual singularity behind black hole horizon, all fields and curvature invariants are regular everywhere for the regular black holes. Through gauge invariant approach, the linearly dynamical stability of the regular black hole is studied. In odd-parity sector, we find that the Λ term does not appear in the master equations of perturbations, which shows that the regular black hole is stable under odd-parity perturbations. On the other hand, for the even-parity sector, the master equations are more complicated than the case without the cosmological constant. We obtain the sufficient conditions for stability of the regular black hole. We also investigate the thermodynamic properties of the regular black hole, and find that those thermodynamic quantities do not satisfy the differential form of first law of black hole thermodynamics. The reason for violating the first law is revealed.
Yong Hua LI; Hai Bin KAN; Bing Jun YU
2004-01-01
In this paper, a special kind of partial algebras called projective partial groupoids is defined.It is proved that the inverse image of all projections of a fundamental weak regular *-semigroup under the homomorphism induced by the maximum idempotent-separating congruence of a weak regular *-semigroup has a projective partial groupoid structure. Moreover, a weak regular *-product which connects a fundamental weak regular *-semigroup with corresponding projective partial groupoid is defined and characterized. It is finally proved that every weak regular *-product is in fact a weak regular *-semigroup and any weak regular *-semigroup is constructed in this way.
Vyas, Nidhi [Department of Physics, Motilal Nehru National Institute of Technology, Allahabad 211 004 (India); Ojha, Animesh K., E-mail: animesh@mnnit.ac.in [Department of Physics, Motilal Nehru National Institute of Technology, Allahabad 211 004 (India)
2011-04-28
Graphical abstract: We have examined the gas phase structural stability of Ala-M{sup +}.(W){sub n=0-5} and ZAla-M{sup +}.(W){sub n=0-5} (M{sup +} = Li{sup +}, Na{sup +}, K{sup +}) complexes. We found that the five water molecules are needed to stabilize the -OO coordinated structure of ZAla-M{sup +} over the -NO/OH coordinated structure of Ala-M{sup +}. The negative and large values of entropies of hydrated species also confirm that hydrated species are more stable over the nonhydrated species. Display Omitted Research highlights: {yields} Effect of regular hydration on gas phase structural stability of differently coordinated Ala-M{sup +} and ZAla-M{sup +} (M{sup +} = Li{sup +}, Na{sup +}, K{sup +}) complexes has been studied. {yields} Five water molecules are needed to stabilize the -OO coordinated structure of ZAla-M{sup +} over-NO/OH coordinated structures of Ala-M{sup +} complex. {yields} Planarity of the ZAla-M{sup +} complexes does not change by the addition of five water molecules. {yields} Loss of entropy by the stepwise addition of water molecules confirms that the hydrated species are more stable. - Abstract: In the present study, we have examined the effect of coordination of metal cations (M{sup +} = Li{sup +}, Na{sup +}, K{sup +}) and water molecules (W) on the gas phase structural stability of D-alanine (Ala) and zwitterionic alanine (ZAla). The -NO/OH and -OO coordinated structures of Ala-M{sup +}.(W){sub n=0-5} and ZAla-M{sup +}.(W){sub n=0-5}, respectively were optimized in gas phase at B3LYP/6-311++G(d,p) level of theory. In complexes, Ala-Li{sup +} and Ala-Na{sup +} the structures where Li{sup +} and Na{sup +} coordinated to -NO/OO modes of Ala were more stable. However, in case of Ala-K{sup +}, the structure where K{sup +} coordinated to -OH mode was found to be more stable. Stepwise addition of water molecules changes the order of stability of hydrate species of Ala-M{sup +} and ZAla-M{sup +} complexes and we found that five water molecules
P Dutt; Akhlaq Husain; A S Vasudeva Murthy; C S Upadhyay
2015-05-01
This is the first of a series of papers devoted to the study of ℎ- spectral element methods for solving three dimensional elliptic boundary value problems on non-smooth domains using parallel computers. In three dimensions there are three different types of singularities namely; the vertex, the edge and the vertex-edge singularities. In addition, the solution is anisotropic in the neighbourhoods of the edges and vertex-edges. To overcome the singularities which arise in the neighbourhoods of vertices, vertex-edges and edges, we use local systems of coordinates. These local coordinates are modified versions of spherical and cylindrical coordinate systems in their respective neighbourhoods. Away from these neighbourhoods standard Cartesian coordinates are used. In each of these neighbourhoods we use a geometrical mesh which becomes finer near the corners and edges. The geometrical mesh becomes a quasi-uniform mesh in the new system of coordinates. We then derive differentiability estimates in these new set of variables and state our main stability estimate theorem using a non-conforming ℎ- spectral element method whose proof is given in a separate paper.
Muhammad H. Al-Malack
2016-07-01
Full Text Available Fuel oil flyash (FFA produced in power and water desalination plants firing crude oils in the Kingdom of Saudi Arabia is being disposed in landfills, which increases the burden on the environment, therefore, FFA utilization must be encouraged. In the current research, the effect of adding FFA on the engineering properties of two indigenous soils, namely sand and marl, was investigated. FFA was added at concentrations of 5%, 10% and 15% to both soils with and without the addition of Portland cement. Mixtures of the stabilized soils were thoroughly evaluated using compaction, California Bearing Ratio (CBR, unconfined compressive strength (USC and durability tests. Results of these tests indicated that stabilized sand mixtures could not attain the ACI strength requirements. However, marl was found to satisfy the ACI strength requirement when only 5% of FFA was added together with 5% of cement. When the FFA was increased to 10% and 15%, the mixture’s strength was found to decrease to values below the ACI requirements. Results of the Toxicity Characteristics Leaching Procedure (TCLP, which was performed on samples that passed the ACI requirements, indicated that FFA must be cautiously used in soil stabilization.
Energy functions for regularization algorithms
Delingette, H.; Hebert, M.; Ikeuchi, K.
1991-01-01
Regularization techniques are widely used for inverse problem solving in computer vision such as surface reconstruction, edge detection, or optical flow estimation. Energy functions used for regularization algorithms measure how smooth a curve or surface is, and to render acceptable solutions these energies must verify certain properties such as invariance with Euclidean transformations or invariance with parameterization. The notion of smoothness energy is extended here to the notion of a differential stabilizer, and it is shown that to void the systematic underestimation of undercurvature for planar curve fitting, it is necessary that circles be the curves of maximum smoothness. A set of stabilizers is proposed that meet this condition as well as invariance with rotation and parameterization.
NOETHERIAN GR-REGULAR RINGS ARE REGULAR
LIHUISHI
1994-01-01
It is proved that for a left Noetherian z-graded ring A,if every finitely generated graded A-module has finite projective dimension(i.e-,A is gr-regular)then every finitely generated A-module has finite projective dimension(i.e.,A is regular).Some applications of this result to filtered rings and some classical cases are also given.
Regular Expression Pocket Reference
Stubblebine, Tony
2007-01-01
This handy little book offers programmers a complete overview of the syntax and semantics of regular expressions that are at the heart of every text-processing application. Ideal as a quick reference, Regular Expression Pocket Reference covers the regular expression APIs for Perl 5.8, Ruby (including some upcoming 1.9 features), Java, PHP, .NET and C#, Python, vi, JavaScript, and the PCRE regular expression libraries. This concise and easy-to-use reference puts a very powerful tool for manipulating text and data right at your fingertips. Composed of a mixture of symbols and text, regular exp
Dimensional regularization is generic
Fujikawa, Kazuo
2016-01-01
The absence of the quadratic divergence in the Higgs sector of the Standard Model in the dimensional regularization is usually regarded to be an exceptional property of a specific regularization. To understand what is going on in the dimensional regularization, we illustrate how to reproduce the results of the dimensional regularization for the $\\lambda\\phi^{4}$ theory in the more conventional regularization such as the higher derivative regularization; the basic postulate involved is that the quadratically divergent induced mass, which is independent of the scale change of the physical mass, is kinematical and unphysical. This is consistent with the derivation of the Callan-Symanzik equation, which is a comparison of two theories with slightly different masses, for the $\\lambda\\phi^{4}$ theory without encountering the quadratic divergence. We thus suggest that the dimensional regularization is generic in a bottom-up approach starting with a successful low-energy theory. We also define a modified version of t...
Nada S. Abdelwahab
2017-05-01
Full Text Available The present work concerns with the development of stability indicating the RP-HPLC method for simultaneous determination of guaifenesin (GUF and pseudoephedrine hydrochloride (PSH in the presence of guaifenesin related substance (Guaiacol. GUC, and in the presence of syrup excepients with minimum sample pre-treatment. In the developed RP-HPLC method efficient chromatographic separation was achieved for GUF, PSH, GUC and syrup excepients using ODS column as a stationary phase and methanol: water (50:50, v/v, pH = 4 with orthophosphoric acid as a mobile phase with a flow rate of 1 mL min−1 and UV detection at 210 nm. The chromatographic run time was approximately 10 min. Calibration curves were drawn relating the integrated area under peak to the corresponding concentrations of PSH, GUF and GUC in the range of 1–8, 1–20, 0.4–8 μg mL−1, respectively. The developed method has been validated and met the requirements delineated by ICH guidelines with respect to linearity, accuracy, precision, specificity and robustness. The validated method was successfully applied for determination of the studied drugs in triaminic chest congestion® syrup; moreover its results were statistically compared with those obtained by the official method and no significant difference was found between them.
Brendel, Jutta; Stoll, Britta; Lange, Sita J; Sharma, Kundan; Lenz, Christof; Stachler, Aris-Edda; Maier, Lisa-Katharina; Richter, Hagen; Nickel, Lisa; Schmitz, Ruth A; Randau, Lennart; Allers, Thorsten; Urlaub, Henning; Backofen, Rolf; Marchfelder, Anita
2014-03-07
The clustered regularly interspaced short palindromic repeats/CRISPR-associated (CRISPR-Cas) system is a prokaryotic defense mechanism against foreign genetic elements. A plethora of CRISPR-Cas versions exist, with more than 40 different Cas protein families and several different molecular approaches to fight the invading DNA. One of the key players in the system is the CRISPR-derived RNA (crRNA), which directs the invader-degrading Cas protein complex to the invader. The CRISPR-Cas types I and III use the Cas6 protein to generate mature crRNAs. Here, we show that the Cas6 protein is necessary for crRNA production but that additional Cas proteins that form a CRISPR-associated complex for antiviral defense (Cascade)-like complex are needed for crRNA stability in the CRISPR-Cas type I-B system in Haloferax volcanii in vivo. Deletion of the cas6 gene results in the loss of mature crRNAs and interference. However, cells that have the complete cas gene cluster (cas1-8b) removed and are transformed with the cas6 gene are not able to produce and stably maintain mature crRNAs. crRNA production and stability is rescued only if cas5, -6, and -7 are present. Mutational analysis of the cas6 gene reveals three amino acids (His-41, Gly-256, and Gly-258) that are essential for pre-crRNA cleavage, whereas the mutation of two amino acids (Ser-115 and Ser-224) leads to an increase of crRNA amounts. This is the first systematic in vivo analysis of Cas6 protein variants. In addition, we show that the H. volcanii I-B system contains a Cascade-like complex with a Cas7, Cas5, and Cas6 core that protects the crRNA.
Brendel, Jutta; Stoll, Britta; Lange, Sita J.; Sharma, Kundan; Lenz, Christof; Stachler, Aris-Edda; Maier, Lisa-Katharina; Richter, Hagen; Nickel, Lisa; Schmitz, Ruth A.; Randau, Lennart; Allers, Thorsten; Urlaub, Henning; Backofen, Rolf; Marchfelder, Anita
2014-01-01
The clustered regularly interspaced short palindromic repeats/CRISPR-associated (CRISPR-Cas) system is a prokaryotic defense mechanism against foreign genetic elements. A plethora of CRISPR-Cas versions exist, with more than 40 different Cas protein families and several different molecular approaches to fight the invading DNA. One of the key players in the system is the CRISPR-derived RNA (crRNA), which directs the invader-degrading Cas protein complex to the invader. The CRISPR-Cas types I and III use the Cas6 protein to generate mature crRNAs. Here, we show that the Cas6 protein is necessary for crRNA production but that additional Cas proteins that form a CRISPR-associated complex for antiviral defense (Cascade)-like complex are needed for crRNA stability in the CRISPR-Cas type I-B system in Haloferax volcanii in vivo. Deletion of the cas6 gene results in the loss of mature crRNAs and interference. However, cells that have the complete cas gene cluster (cas1–8b) removed and are transformed with the cas6 gene are not able to produce and stably maintain mature crRNAs. crRNA production and stability is rescued only if cas5, -6, and -7 are present. Mutational analysis of the cas6 gene reveals three amino acids (His-41, Gly-256, and Gly-258) that are essential for pre-crRNA cleavage, whereas the mutation of two amino acids (Ser-115 and Ser-224) leads to an increase of crRNA amounts. This is the first systematic in vivo analysis of Cas6 protein variants. In addition, we show that the H. volcanii I-B system contains a Cascade-like complex with a Cas7, Cas5, and Cas6 core that protects the crRNA. PMID:24459147
Robust Sparse Analysis Regularization
Vaiter, Samuel; Dossal, Charles; Fadili, Jalal
2011-01-01
This paper studies the properties of L1-analysis regularization for the resolution of linear inverse problems. Most previous works consider sparse synthesis priors where the sparsity is measured as the L1 norm of the coefficients that synthesize the signal in a given dictionary. In contrast, the more general analysis regularization minimizes the L1 norm of the correlations between the signal and the atoms in the dictionary. The corresponding variational problem includes several well-known regularizations such as the discrete total variation and the fused lasso. We first prove that a solution of analysis regularization is a piecewise affine function of the observations. Similarly, it is a piecewise affine function of the regularization parameter. This allows us to compute the degrees of freedom associated to sparse analysis estimators. Another contribution gives a sufficient condition to ensure that a signal is the unique solution of the analysis regularization when there is no noise in the observations. The s...
Regular Motions of Resonant Asteroids
Ferraz-Mello, S.
1990-11-01
RESUMEN. Se revisan resultados analiticos relativos a soluciones regulares del problema asteroidal eliptico promediados en la vecindad de una resonancia con jupiten Mencionamos Ia ley de estructura para libradores de alta excentricidad, la estabilidad de los centros de liberaci6n, las perturbaciones forzadas por la excentricidad de jupiter y las 6rbitas de corotaci6n. ABSTRAC This paper reviews analytical results concerning the regular solutions of the elliptic asteroidal problem averaged in the neighbourhood of a resonance with jupiter. We mention the law of structure for high-eccentricity librators, the stability of the libration centers, the perturbations forced by the eccentricity ofjupiter and the corotation orbits. Key words: ASThROIDS
Goyvaerts, Jan
2009-01-01
This cookbook provides more than 100 recipes to help you crunch data and manipulate text with regular expressions. Every programmer can find uses for regular expressions, but their power doesn't come worry-free. Even seasoned users often suffer from poor performance, false positives, false negatives, or perplexing bugs. Regular Expressions Cookbook offers step-by-step instructions for some of the most common tasks involving this tool, with recipes for C#, Java, JavaScript, Perl, PHP, Python, Ruby, and VB.NET. With this book, you will: Understand the basics of regular expressions through a
Regularization in kernel learning
Mendelson, Shahar; 10.1214/09-AOS728
2010-01-01
Under mild assumptions on the kernel, we obtain the best known error rates in a regularized learning scenario taking place in the corresponding reproducing kernel Hilbert space (RKHS). The main novelty in the analysis is a proof that one can use a regularization term that grows significantly slower than the standard quadratic growth in the RKHS norm.
Regular database update logics
Spruit, Paul; Wieringa, Roel; Meyer, John-Jules
2001-01-01
We study regular first-order update logic (FUL), which is a variant of regular dynamic logic in which updates to function symbols as well as to predicate symbols are possible. We fi1rst study FUL without making assumptions about atomic updates. Second, we look at relational algebra update logic (RAU
Regularization by External Variables
Bossolini, Elena; Edwards, R.; Glendinning, P. A.
2016-01-01
Regularization was a big topic at the 2016 CRM Intensive Research Program on Advances in Nonsmooth Dynamics. There are many open questions concerning well known kinds of regularization (e.g., by smoothing or hysteresis). Here, we propose a framework for an alternative and important kind of regula...... of regularization, by external variables that shadow either the state or the switch of the original system. The shadow systems are derived from and inspired by various applications in electronic control, predator-prey preference, time delay, and genetic regulation....
Regularized maximum correntropy machine
Wang, Jim Jing-Yan
2015-02-12
In this paper we investigate the usage of regularized correntropy framework for learning of classifiers from noisy labels. The class label predictors learned by minimizing transitional loss functions are sensitive to the noisy and outlying labels of training samples, because the transitional loss functions are equally applied to all the samples. To solve this problem, we propose to learn the class label predictors by maximizing the correntropy between the predicted labels and the true labels of the training samples, under the regularized Maximum Correntropy Criteria (MCC) framework. Moreover, we regularize the predictor parameter to control the complexity of the predictor. The learning problem is formulated by an objective function considering the parameter regularization and MCC simultaneously. By optimizing the objective function alternately, we develop a novel predictor learning algorithm. The experiments on two challenging pattern classification tasks show that it significantly outperforms the machines with transitional loss functions.
Regular Expression Containment
Henglein, Fritz; Nielsen, Lasse
2011-01-01
We present a new sound and complete axiomatization of regular expression containment. It consists of the conventional axiomatiza- tion of concatenation, alternation, empty set and (the singleton set containing) the empty string as an idempotent semiring, the fixed- point rule E* = 1 + E × E......* for Kleene-star, and a general coin- duction rule as the only additional rule. Our axiomatization gives rise to a natural computational inter- pretation of regular expressions as simple types that represent parse trees, and of containment proofs as coercions. This gives the axiom- atization a Curry......-Howard-style constructive interpretation: Con- tainment proofs do not only certify a language-theoretic contain- ment, but, under our computational interpretation, constructively transform a membership proof of a string in one regular expres- sion into a membership proof of the same string in another regular expression. We...
Regularities of Multifractal Measures
Hun Ki Baek
2008-05-01
First, we prove the decomposition theorem for the regularities of multifractal Hausdorff measure and packing measure in $\\mathbb{R}^d$. This decomposition theorem enables us to split a set into regular and irregular parts, so that we can analyze each separately, and recombine them without affecting density properties. Next, we give some properties related to multifractal Hausdorff and packing densities. Finally, we extend the density theorem in [6] to any measurable set.
T. (A)LVAREZ
2012-01-01
For a closed linear relation in a Banach space the concept of regularity is introduced and studied.It is shown that many of the results of Mbekhta and other authors for operators remain valid in the context of multivalued linear operators.We also extend the punctured neighbourhood theorem for operators to linear relations and as an application we obtain a characterization of semiFredholm linear relations which are regular.
Regularized Structural Equation Modeling.
Jacobucci, Ross; Grimm, Kevin J; McArdle, John J
A new method is proposed that extends the use of regularization in both lasso and ridge regression to structural equation models. The method is termed regularized structural equation modeling (RegSEM). RegSEM penalizes specific parameters in structural equation models, with the goal of creating easier to understand and simpler models. Although regularization has gained wide adoption in regression, very little has transferred to models with latent variables. By adding penalties to specific parameters in a structural equation model, researchers have a high level of flexibility in reducing model complexity, overcoming poor fitting models, and the creation of models that are more likely to generalize to new samples. The proposed method was evaluated through a simulation study, two illustrative examples involving a measurement model, and one empirical example involving the structural part of the model to demonstrate RegSEM's utility.
Faupin, Jeremy; Møller, Jacob Schach; Skibsted, Erik
2011-01-01
We study regularity of bound states pertaining to embedded eigenvalues of a self-adjoint operator H, with respect to an auxiliary operator A that is conjugate to H in the sense of Mourre. We work within the framework of singular Mourre theory which enables us to deal with confined massless Pauli–......–Fierz models, our primary example, and many-body AC-Stark Hamiltonians. In the simpler context of regular Mourre theory, our results boil down to an improvement of results obtained recently in [8, 9]....
Manifold Regularized Reinforcement Learning.
Li, Hongliang; Liu, Derong; Wang, Ding
2017-01-27
This paper introduces a novel manifold regularized reinforcement learning scheme for continuous Markov decision processes. Smooth feature representations for value function approximation can be automatically learned using the unsupervised manifold regularization method. The learned features are data-driven, and can be adapted to the geometry of the state space. Furthermore, the scheme provides a direct basis representation extension for novel samples during policy learning and control. The performance of the proposed scheme is evaluated on two benchmark control tasks, i.e., the inverted pendulum and the energy storage problem. Simulation results illustrate the concepts of the proposed scheme and show that it can obtain excellent performance.
Annotation of Regular Polysemy
Martinez Alonso, Hector
Regular polysemy has received a lot of attention from the theory of lexical semantics and from computational linguistics. However, there is no consensus on how to represent the sense of underspecified examples at the token level, namely when annotating or disambiguating senses of metonymic words...
Sparse structure regularized ranking
Wang, Jim Jing-Yan
2014-04-17
Learning ranking scores is critical for the multimedia database retrieval problem. In this paper, we propose a novel ranking score learning algorithm by exploring the sparse structure and using it to regularize ranking scores. To explore the sparse structure, we assume that each multimedia object could be represented as a sparse linear combination of all other objects, and combination coefficients are regarded as a similarity measure between objects and used to regularize their ranking scores. Moreover, we propose to learn the sparse combination coefficients and the ranking scores simultaneously. A unified objective function is constructed with regard to both the combination coefficients and the ranking scores, and is optimized by an iterative algorithm. Experiments on two multimedia database retrieval data sets demonstrate the significant improvements of the propose algorithm over state-of-the-art ranking score learning algorithms.
Wen LIU; Jing LIN
2011-01-01
In this paper,we define a class of strongly connected digraph,called the k-walk-regular digraph,study some properties of it,provide its some algebraic characterization and point out that the O-walk-regular digraph is the same as the walk-regular digraph discussed BY Liu and Lin in 2010 and the D-walk-regular digraph is identical with the weakly distance-regular digraph defined by Comellas et al in 2004.
Landweber iterative regularization for nearfield acoustic holography
BI Chuanxing; CHEN Xinzhao; ZHOU Rong; CHEN Jian
2006-01-01
On the basis of the distributed source boundary point method (DSBPM)-based nearfield acoustic holography (NAH), Landweber iterative regularization method is proposed to stabilize the NAH reconstruction process, control the influence of measurement errors on the reconstructed results and ensure the validity of the reconstructed results. And a new method, the auxiliary surface method, is proposed to determine the optimal iterative number for optimizing the regularization effect. Here, the optimal number is determined by minimizing the relative error between the calculated pressure on the auxiliary surface corresponding to each iterative number and the measured pressure. An experiment on a speaker is investigated to demonstrate the high sensitivity of the reconstructed results to measurement errors and to validate the chosen method of the optimal iterative number and the Landweber iterative regularization method for controlling the influence of measurement errors on the reconstructed results.
Nonlinear electrodynamics and regular black holes
Sajadi, S. N.; Riazi, N.
2017-03-01
In this work, an exact regular black hole solution in General Relativity is presented. The source is a nonlinear electromagnetic field with the algebraic structure T00=T11 for the energy-momentum tensor, partially satisfying the weak energy condition but not the strong energy condition. In the weak field limit, the EM field behaves like the Maxwell field. The solution corresponds to a charged black hole with q≤0.77 m. The metric, the curvature invariants, and the electric field are regular everywhere. The BH is stable against small perturbations of spacetime and using the Weinhold metric, geometrothermodynamical stability has been investigated. Finally we investigate the idea that the observable universe lives inside a regular black hole. We argue that this picture might provide a viable description of universe.
Annotation of Regular Polysemy
Martinez Alonso, Hector
Regular polysemy has received a lot of attention from the theory of lexical semantics and from computational linguistics. However, there is no consensus on how to represent the sense of underspecified examples at the token level, namely when annotating or disambiguating senses of metonymic words...... like “London” (Location/Organization) or “cup” (Container/Content). The goal of this dissertation is to assess whether metonymic sense underspecification justifies incorporating a third sense into our sense inventories, thereby treating the underspecified sense as independent from the literal...
Ubeda, Leonardo; Beck, Tracy L.
2016-06-01
Most future observations that will propose to obtain NIRSpec spectroscopy (such as all MSA observations, as well as crowded-field observations using the IFU and FS) will requiere high spatial resolution images of the science field previous to performing the spectroscopy. This is due to the fact that the standard NIRSpec target acquisition (TA) procedure needs to acquiere reference starswith a position RMS of less than 20mas. NIRSpec TA uses 8-20 reference stars with accurate astromerty (<5mas), calculates centroids of the individual stars on the detector, transforms their pixel coordinate positions into positions on the sky, and iterates on the telescope pointing and slew until the position RMS of the reference stars is less than 20mas.For some planned observations, very high spatial resolution HST images (either ACS/WFC or WFC3/UVIS/IR) might be already available and, in other cases, NIRCam observations will be performed.In this study we describe in detail the proposed method to generate a high resolution mosaic of the NIRSpec field of view for any given observation. We show several examples of a variety of science cases. We also describe the creation of catalogs of sources.These two data products will be crucial for the success of any NIRSpec observation.
From regular modules to von Neumann regular rings via coordinatization
Leonard Daus
2014-07-01
Full Text Available In this paper we establish a very close link (in terms of von Neu- mann's coordinatization between regular modules introduced by Zel- manowitz, on one hand, and von Neumann regular rings, on the other hand: we prove that the lattice L^{fg}(M of all finitely generated submodules of a finitely generated regular module M, over an arbitrary ring, can be coordinatized as the lattice of all principal right ideals of some von Neumann regular ring S.
Modular Regularization Algorithms
Jacobsen, Michael
2004-01-01
The class of linear ill-posed problems is introduced along with a range of standard numerical tools and basic concepts from linear algebra, statistics and optimization. Known algorithms for solving linear inverse ill-posed problems are analyzed to determine how they can be decomposed into indepen......The class of linear ill-posed problems is introduced along with a range of standard numerical tools and basic concepts from linear algebra, statistics and optimization. Known algorithms for solving linear inverse ill-posed problems are analyzed to determine how they can be decomposed...... into independent modules. These modules are then combined to form new regularization algorithms with other properties than those we started out with. Several variations are tested using the Matlab toolbox MOORe Tools created in connection with this thesis. Object oriented programming techniques are explained...... and used to set up the illposed problems in the toolbox. Hereby, we are able to write regularization algorithms that automatically exploit structure in the ill-posed problem without being rewritten explicitly. We explain how to implement a stopping criteria for a parameter choice method based upon...
Structure for Regular Inclusions
Pitts, David R
2012-01-01
We study pairs (C,D) of unital C*-algebras where D is an abelian C*-subalgebra of C which is regular in C. When D is a MASA in C, there exists a unique completely positive unital map E of C into the injective envelope I(D) of D whose restriction to D is the identity on D. We show that the left kernel of E is the unique closed two-sided ideal of C maximal with respect to having trivial intersection with D. We introduce a new class of well behaved state extensions, the compatible states; we identify compatible states when D is a MASA in C in terms of groups constructed from local dynamics near a pure state on D. When C is separable, D is a MASA in C, and the pair (C,D) is regular, the set of pure states on D with unique state extensions to C is dense in D. The map E can be used as a substitute for a conditional expectation in the construction of coordinates for C relative to D. We show that certain classes of compatible states have natural groupoid operations, and we show that constructions of Kumjian and Renau...
Quality of regularization methods
Bouwman, J.
1998-01-01
The solution of ill-posed problems is non-trivial in the sense that frequently applied methods like least-squares fail. The ill-posedness of the problem is refiected by very small changes in the input data which may result in very large changes in the output data. Hence, some sort of stabilization
Quality of regularization methods
Bouwman, J.
1998-01-01
The solution of ill-posed problems is non-trivial in the sense that frequently applied methods like least-squares fail. The ill-posedness of the problem is refiected by very small changes in the input data which may result in very large changes in the output data. Hence, some sort of stabilization o
Evolutionary internalized regularities.
Schwartz, R
2001-08-01
Roger Shepard's proposals and supporting experiments concerning evolutionary internalized regularities have been very influential in the study of vision and in other areas of psychology and cognitive science. This paper examines issues concerning the need, nature, explanatory role, and justification for postulating such internalized constraints. In particular, I seek further clarification from Shepard on how best to understand his claim that principles of kinematic geometry underlie phenomena of motion perception. My primary focus is on the ecological validity of Shepard's kinematic constraint in the context of ordinary motion perception. First, I explore the analogy Shepard draws between internalized circadian rhythms and the supposed internalization of kinematic geometry. Next, questions are raised about how to interpret and justify applying results from his own and others' experimental studies of apparent motion to more everyday cases of motion perception in richer environments. Finally, some difficulties with Shepard's account of the evolutionary development of his kinematic constraint are considered.
Adaptive Regularization of Neural Classifiers
Andersen, Lars Nonboe; Larsen, Jan; Hansen, Lars Kai
1997-01-01
We present a regularization scheme which iteratively adapts the regularization parameters by minimizing the validation error. It is suggested to use the adaptive regularization scheme in conjunction with optimal brain damage pruning to optimize the architecture and to avoid overfitting. Furthermo...
Bambi, Cosimo
2013-01-01
The formation of spacetime singularities is a quite common phenomenon in General Relativity and it is regulated by specific theorems. It is widely believed that spacetime singularities do not exist in Nature, but that they represent a limitation of the classical theory. While we do not yet have any solid theory of quantum gravity, toy models of black hole solutions without singularities have been proposed. So far, there are only non-rotating regular black holes in the literature. These metrics can be hardly tested by astrophysical observations, as the black hole spin plays a fundamental role in any astrophysical process. In this letter, we apply the Newman-Janis algorithm to the Hayward and to the Bardeen black hole metrics. In both cases, we obtain a family of rotating solutions. Every solution corresponds to a different matter configuration. Each family has one solution with special properties, which can be written in Kerr-like form in Boyer-Lindquist coordinates. These special solutions are of Petrov type ...
Bambi, Cosimo, E-mail: bambi@fudan.edu.cn; Modesto, Leonardo, E-mail: lmodesto@fudan.edu.cn
2013-04-25
The formation of spacetime singularities is a quite common phenomenon in General Relativity and it is regulated by specific theorems. It is widely believed that spacetime singularities do not exist in Nature, but that they represent a limitation of the classical theory. While we do not yet have any solid theory of quantum gravity, toy models of black hole solutions without singularities have been proposed. So far, there are only non-rotating regular black holes in the literature. These metrics can be hardly tested by astrophysical observations, as the black hole spin plays a fundamental role in any astrophysical process. In this Letter, we apply the Newman–Janis algorithm to the Hayward and to the Bardeen black hole metrics. In both cases, we obtain a family of rotating solutions. Every solution corresponds to a different matter configuration. Each family has one solution with special properties, which can be written in Kerr-like form in Boyer–Lindquist coordinates. These special solutions are of Petrov type D, they are singularity free, but they violate the weak energy condition for a non-vanishing spin and their curvature invariants have different values at r=0 depending on the way one approaches the origin. We propose a natural prescription to have rotating solutions with a minimal violation of the weak energy condition and without the questionable property of the curvature invariants at the origin.
Ensemble manifold regularization.
Geng, Bo; Tao, Dacheng; Xu, Chao; Yang, Linjun; Hua, Xian-Sheng
2012-06-01
We propose an automatic approximation of the intrinsic manifold for general semi-supervised learning (SSL) problems. Unfortunately, it is not trivial to define an optimization function to obtain optimal hyperparameters. Usually, cross validation is applied, but it does not necessarily scale up. Other problems derive from the suboptimality incurred by discrete grid search and the overfitting. Therefore, we develop an ensemble manifold regularization (EMR) framework to approximate the intrinsic manifold by combining several initial guesses. Algorithmically, we designed EMR carefully so it 1) learns both the composite manifold and the semi-supervised learner jointly, 2) is fully automatic for learning the intrinsic manifold hyperparameters implicitly, 3) is conditionally optimal for intrinsic manifold approximation under a mild and reasonable assumption, and 4) is scalable for a large number of candidate manifold hyperparameters, from both time and space perspectives. Furthermore, we prove the convergence property of EMR to the deterministic matrix at rate root-n. Extensive experiments over both synthetic and real data sets demonstrate the effectiveness of the proposed framework.
Regular Bisimple ω2-semigroups
汪立民; 商宇
2008-01-01
@@ The regular semigroups S with an idempotent set Es = {e0,e1,…,en,…} such that e0 ＞ e1 ＞…＞ en ＞… is called a regular ω-semigroup. In [5] Reilly determined the structure of a regular bisimple ω-semigroup as BR(G,θ),which is the classical Bruck-Reilly extension of a group G.
Completely regular fuzzifying topological spaces
A. K. Katsaras
2005-12-01
Full Text Available Some of the properties of the completely regular fuzzifying topological spaces are investigated. It is shown that a fuzzifying topology ÃÂ„ is completely regular if and only if it is induced by some fuzzy uniformity or equivalently by some fuzzifying proximity. Also, ÃÂ„ is completely regular if and only if it is generated by a family of probabilistic pseudometrics.
On regular rotating black holes
Torres, R.; Fayos, F.
2017-01-01
Different proposals for regular rotating black hole spacetimes have appeared recently in the literature. However, a rigorous analysis and proof of the regularity of this kind of spacetimes is still lacking. In this note we analyze rotating Kerr-like black hole spacetimes and find the necessary and sufficient conditions for the regularity of all their second order scalar invariants polynomial in the Riemann tensor. We also show that the regularity is linked to a violation of the weak energy conditions around the core of the rotating black hole.
Constrained and regularized system identification
Tor A. Johansen
1998-04-01
Full Text Available Prior knowledge can be introduced into system identification problems in terms of constraints on the parameter space, or regularizing penalty functions in a prediction error criterion. The contribution of this work is mainly an extension of the well known FPE (Final Production Error statistic to the case when the system identification problem is constrained and contains a regularization penalty. The FPECR statistic (Final Production Error with Constraints and Regularization is of potential interest as a criterion for selection of both regularization parameters and structural parameters such as order.
On regular rotating black holes
Torres, Ramon
2016-01-01
Different proposals for regular rotating black hole spacetimes have appeared recently in the literature. However, a rigorous analysis and proof of the regularity of this kind of spacetimes is still lacking. In this note we analyze rotating Kerr-like black hole spacetimes and find the necessary and sufficient conditions for the regularity of all their second order scalar invariants polynomial in the Riemann tensor. We also show that the regularity is linked to a violation of the weak energy conditions around the core of the rotating black hole.
CHEN Huan Yin; LI Fu An
2002-01-01
In this paper, we investigate ideals of regular rings and give several characterizations for an ideal to satisfy the comparability. In addition, it is shown that, if Ⅰ is a minimal two-sided ideal of a regular ring R, then Ⅰ satisfies the comparability if and only if Ⅰ is separative. Furthermore, we prove that, for ideals with stable range one, Roth's problem has an affirmative solution. These extend the corresponding results on unit-regularity and one-sided unit-regularity.
Regularly timed events amid chaos
Blakely, Jonathan N.; Cooper, Roy M.; Corron, Ned J.
2015-11-01
We show rigorously that the solutions of a class of chaotic oscillators are characterized by regularly timed events in which the derivative of the solution is instantaneously zero. The perfect regularity of these events is in stark contrast with the well-known unpredictability of chaos. We explore some consequences of these regularly timed events through experiments using chaotic electronic circuits. First, we show that a feedback loop can be implemented to phase lock the regularly timed events to a periodic external signal. In this arrangement the external signal regulates the timing of the chaotic signal but does not strictly lock its phase. That is, phase slips of the chaotic oscillation persist without disturbing timing of the regular events. Second, we couple the regularly timed events of one chaotic oscillator to those of another. A state of synchronization is observed where the oscillators exhibit synchronized regular events while their chaotic amplitudes and phases evolve independently. Finally, we add additional coupling to synchronize the amplitudes, as well, however in the opposite direction illustrating the independence of the amplitudes from the regularly timed events.
Online co-regularized algorithms
Ruijter, T. de; Tsivtsivadze, E.; Heskes, T.
2012-01-01
We propose an online co-regularized learning algorithm for classification and regression tasks. We demonstrate that by sequentially co-regularizing prediction functions on unlabeled data points, our algorithm provides improved performance in comparison to supervised methods on several UCI benchmarks
Online co-regularized algorithms
Ruijter, T. de; Tsivtsivadze, E.; Heskes, T.
2012-01-01
We propose an online co-regularized learning algorithm for classification and regression tasks. We demonstrate that by sequentially co-regularizing prediction functions on unlabeled data points, our algorithm provides improved performance in comparison to supervised methods on several UCI benchmarks
Nonconvex Regularization in Remote Sensing
Tuia, Devis; Flamary, Remi; Barlaud, Michel
2016-11-01
In this paper, we study the effect of different regularizers and their implications in high dimensional image classification and sparse linear unmixing. Although kernelization or sparse methods are globally accepted solutions for processing data in high dimensions, we present here a study on the impact of the form of regularization used and its parametrization. We consider regularization via traditional squared (2) and sparsity-promoting (1) norms, as well as more unconventional nonconvex regularizers (p and Log Sum Penalty). We compare their properties and advantages on several classification and linear unmixing tasks and provide advices on the choice of the best regularizer for the problem at hand. Finally, we also provide a fully functional toolbox for the community.
Conservative regularization of compressible flow
Krishnaswami, Govind S; Thyagaraja, Anantanarayanan
2015-01-01
Ideal Eulerian flow may develop singularities in vorticity w. Navier-Stokes viscosity provides a dissipative regularization. We find a local, conservative regularization - lambda^2 w times curl(w) of compressible flow and compressible MHD: a three dimensional analogue of the KdV regularization of the one dimensional kinematic wave equation. The regulator lambda is a field subject to the constitutive relation lambda^2 rho = constant. Lambda is like a position-dependent mean-free path. Our regularization preserves Galilean, parity and time-reversal symmetries. We identify locally conserved energy, helicity, linear and angular momenta and boundary conditions ensuring their global conservation. Enstrophy is shown to remain bounded. A swirl velocity field is identified, which transports w/rho and B/rho generalizing the Kelvin-Helmholtz and Alfven theorems. A Hamiltonian and Poisson bracket formulation is given. The regularized equations are used to model a rotating vortex, channel flow, plane flow, a plane vortex ...
Approximate Sparse Regularized Hyperspectral Unmixing
Chengzhi Deng
2014-01-01
Full Text Available Sparse regression based unmixing has been recently proposed to estimate the abundance of materials present in hyperspectral image pixel. In this paper, a novel sparse unmixing optimization model based on approximate sparsity, namely, approximate sparse unmixing (ASU, is firstly proposed to perform the unmixing task for hyperspectral remote sensing imagery. And then, a variable splitting and augmented Lagrangian algorithm is introduced to tackle the optimization problem. In ASU, approximate sparsity is used as a regularizer for sparse unmixing, which is sparser than l1 regularizer and much easier to be solved than l0 regularizer. Three simulated and one real hyperspectral images were used to evaluate the performance of the proposed algorithm in comparison to l1 regularizer. Experimental results demonstrate that the proposed algorithm is more effective and accurate for hyperspectral unmixing than state-of-the-art l1 regularizer.
ZOU Zhi-Yun; MAO Bao-Hua; HAO Hai-Ming; GAO Jian-Zhi; YANG Jie-Jiao
2009-01-01
According to the deficiencies in Watts and Strogatz's small-world network model, we present a new regular model to establish the small-world network. Besides the property of the small-world, this model has other properties such as accuracy in controlling the average shortest path length L, and the average clustering coefficient C, also regular network topology as well as enhanced network robustness. This method improves the construction of the small-world network essentially, so that the regular small-world network closely resembles the actual network. We also present studies on the relationships among the quantities of a variety of edges, L and C in regular small-world network in detail. This research lays the foundation for the establishment of the regular small-world network and acts as a good guidance for further research of this model and its applications.
A regularized GMRES method for inverse blackbody radiation problem
Wu Jieer
2013-01-01
Full Text Available The inverse blackbody radiation problem is focused on determining temperature distribution of a blackbody from measured total radiated power spectrum. This problem consists of solving a first kind of Fredholm integral equation and many numerical methods have been proposed. In this paper, a regularized GMRES method is presented to solve the linear ill-posed problem caused by the discretization of such an integral equation. This method projects the orignal problem onto a lower dimensional subspaces by the Arnoldi process. Tikhonov regularization combined with GCV criterion is applied to stabilize the numerical iteration process. Three numerical examples indicate the effectiveness of the regularized GMRES method.
A Criterion for Regular Sequences
D P Patil; U Storch; J Stückrad
2004-05-01
Let be a commutative noetherian ring and $f_1,\\ldots,f_r \\in R$. In this article we give (cf. the Theorem in $\\mathcal{x}$2) a criterion for $f_1,\\ldots,f_r$ to be regular sequence for a finitely generated module over which strengthens and generalises a result in [2]. As an immediate consequence we deduce that if $V(g_1,\\ldots,g_r) \\subseteq V(f_1,\\ldots,f_r)$ in Spec and if $f_1,\\ldots,f_r$ is a regular sequence in , then $g_1,\\ldots,g_r$ is also a regular sequence in .
Regularized kernel PCA for the efficient parameterization of complex geological models
Vo, Hai X.; Durlofsky, Louis J.
2016-10-01
The use of geological parameterization procedures enables high-fidelity geomodels to be represented in terms of relatively few variables. Such parameterizations are particularly useful when the subspace representation is constructed to implicitly capture the key geological features that appear in prior geostatistical realizations. In this case, the parameterization can be used very effectively within a data assimilation framework. In this paper, we extend and apply geological parameterization techniques based on kernel principal component analysis (KPCA) for the representation of complex geomodels characterized by non-Gaussian spatial statistics. KPCA involves the application of PCA in a high-dimensional feature space and the subsequent reverse mapping of the feature-space model back to physical space. This reverse mapping, referred to as the pre-image problem, can be challenging because it (formally) involves a nonlinear minimization. In this work, a new explicit pre-image procedure, which avoids many of the problems with existing approaches, is introduced. To achieve (ensemble-level) flow responses in close agreement with those from reference geostatistical realizations, a bound-constrained, regularized version of KPCA, referred to as R-KPCA, is also introduced. R-KPCA can be viewed as a post-processing of realizations generated using KPCA. The R-KPCA representation is incorporated into an adjoint-gradient-based data assimilation procedure, and its use for history matching a complex deltaic fan system is demonstrated. Matlab code for the KPCA and R-KPCA procedures is provided online as Supplementary Material.
Huanyin CHEN
2009-01-01
The necessary and sufficient conditions under which a ring satisfies regular power-substitution are investigated. It is shown that a ring R satisfies regular power-substitution if and only if a(-～)b in R implies that there exist n ∈ N and a U ∈ GLn(R) such that aU =Ub if and only if for any regular x ∈ R there exist m,n ∈ N and U ∈ GLn(R) such that xmIn = xmUxm, where a(-～)b means that there exists x, y, z ∈ R such that a = ybx, b = xaz and x = xyx = xzx. It is proved that every directly finite simple ring satisfies regular power-substitution. Some applications for stably free R-modules are also obtained.
NONCONVEX REGULARIZATION FOR SHAPE PRESERVATION
CHARTRAND, RICK [Los Alamos National Laboratory
2007-01-16
The authors show that using a nonconvex penalty term to regularize image reconstruction can substantially improve the preservation of object shapes. The commonly-used total-variation regularization, {integral}|{del}u|, penalizes the length of the object edges. They show that {integral}|{del}u|{sup p}, 0 < p < 1, only penalizes edges of dimension at least 2-p, and thus finite-length edges not at all. We give numerical examples showing the resulting improvement in shape preservation.
Regularization with a pruning prior
Goutte, Cyril; Hansen, Lars Kai
1997-01-01
We investigate the use of a regularization priorthat we show has pruning properties. Analyses areconducted both using a Bayesian framework and withthe generalization method, on a simple toyproblem. Results are thoroughly compared withthose obtained with a traditional weight decay.......We investigate the use of a regularization priorthat we show has pruning properties. Analyses areconducted both using a Bayesian framework and withthe generalization method, on a simple toyproblem. Results are thoroughly compared withthose obtained with a traditional weight decay....
Regular and Periodic Tachyon Kinks
Bazeia, D.; Menezes, R.; Ramos, J. G.
2004-01-01
We search for regular tachyon kinks in an extended model, which includes the tachyon action recently proposed to describe the tachyon field. The extended model that we propose adds a new contribution to the tachyon action, and seems to enrich the present scenario for the tachyon field. We have found stable tachyon kinks of regular profile, which may appropriately lead to the singular kink found by Sen sometime ago. Also, under specific conditions we may find periodic array of kink-antikink co...
Shervin Sahebi
2014-05-01
Full Text Available $R$ is called commuting regular ring (resp. semigroupif for each $x,y\\in R$ there exists $a\\in R$ such that$xy=yxayx$. In this paper, we introduce the concept ofcommuting $\\pi$-regular rings (resp. semigroups andstudy various properties of them.
Condition Number Regularized Covariance Estimation.
Won, Joong-Ho; Lim, Johan; Kim, Seung-Jean; Rajaratnam, Bala
2013-06-01
Estimation of high-dimensional covariance matrices is known to be a difficult problem, has many applications, and is of current interest to the larger statistics community. In many applications including so-called the "large p small n" setting, the estimate of the covariance matrix is required to be not only invertible, but also well-conditioned. Although many regularization schemes attempt to do this, none of them address the ill-conditioning problem directly. In this paper, we propose a maximum likelihood approach, with the direct goal of obtaining a well-conditioned estimator. No sparsity assumption on either the covariance matrix or its inverse are are imposed, thus making our procedure more widely applicable. We demonstrate that the proposed regularization scheme is computationally efficient, yields a type of Steinian shrinkage estimator, and has a natural Bayesian interpretation. We investigate the theoretical properties of the regularized covariance estimator comprehensively, including its regularization path, and proceed to develop an approach that adaptively determines the level of regularization that is required. Finally, we demonstrate the performance of the regularized estimator in decision-theoretic comparisons and in the financial portfolio optimization setting. The proposed approach has desirable properties, and can serve as a competitive procedure, especially when the sample size is small and when a well-conditioned estimator is required.
Condition Number Regularized Covariance Estimation*
Won, Joong-Ho; Lim, Johan; Kim, Seung-Jean; Rajaratnam, Bala
2012-01-01
Estimation of high-dimensional covariance matrices is known to be a difficult problem, has many applications, and is of current interest to the larger statistics community. In many applications including so-called the “large p small n” setting, the estimate of the covariance matrix is required to be not only invertible, but also well-conditioned. Although many regularization schemes attempt to do this, none of them address the ill-conditioning problem directly. In this paper, we propose a maximum likelihood approach, with the direct goal of obtaining a well-conditioned estimator. No sparsity assumption on either the covariance matrix or its inverse are are imposed, thus making our procedure more widely applicable. We demonstrate that the proposed regularization scheme is computationally efficient, yields a type of Steinian shrinkage estimator, and has a natural Bayesian interpretation. We investigate the theoretical properties of the regularized covariance estimator comprehensively, including its regularization path, and proceed to develop an approach that adaptively determines the level of regularization that is required. Finally, we demonstrate the performance of the regularized estimator in decision-theoretic comparisons and in the financial portfolio optimization setting. The proposed approach has desirable properties, and can serve as a competitive procedure, especially when the sample size is small and when a well-conditioned estimator is required. PMID:23730197
Lavrentiev regularization method for nonlinear ill-posed problems
Kinh, N V
2002-01-01
In this paper we shall be concerned with Lavientiev regularization method to reconstruct solutions x sub 0 of non ill-posed problems F(x)=y sub o , where instead of y sub 0 noisy data y subdelta is an element of X with absolut(y subdelta-y sub 0) X is an accretive nonlinear operator from a real reflexive Banach space X into itself. In this regularization method solutions x subalpha supdelta are obtained by solving the singularly perturbed nonlinear operator equation F(x)+alpha(x-x*)=y subdelta with some initial guess x*. Assuming certain conditions concerning the operator F and the smoothness of the element x*-x sub 0 we derive stability estimates which show that the accuracy of the regularized solutions is order optimal provided that the regularization parameter alpha has been chosen properly.
Quotient Complexity of Regular Languages
Janusz Brzozowski
2009-07-01
Full Text Available The past research on the state complexity of operations on regular languages is examined, and a new approach based on an old method (derivatives of regular expressions is presented. Since state complexity is a property of a language, it is appropriate to define it in formal-language terms as the number of distinct quotients of the language, and to call it "quotient complexity". The problem of finding the quotient complexity of a language f(K,L is considered, where K and L are regular languages and f is a regular operation, for example, union or concatenation. Since quotients can be represented by derivatives, one can find a formula for the typical quotient of f(K,L in terms of the quotients of K and L. To obtain an upper bound on the number of quotients of f(K,L all one has to do is count how many such quotients are possible, and this makes automaton constructions unnecessary. The advantages of this point of view are illustrated by many examples. Moreover, new general observations are presented to help in the estimation of the upper bounds on quotient complexity of regular operations.
Ratanpal B S; Sharma Jaita
2016-03-01
The charged anisotropic star on paraboloidal space-time is reported by choosing a particular form of radial pressure and electric field intensity. The non-singular solution of Einstein–Maxwell system of equation has been derived and it is shown that the model satisfies all the physical plausibility conditions. It is observed that in the absence of electric field intensity, the model reducesto a particular case of uncharged Sharma and Ratanpal model. It is also observed that the parameter used in the electric field intensity directly affects mass of the star.
Efficient Hyperelastic Regularization for Registration
Darkner, Sune; Hansen, Michael Sass; Larsen, Rasmus;
2011-01-01
For most image registration problems a smooth one-to-one mapping is desirable, a diffeomorphism. This can be obtained using priors such as volume preservation, certain kinds of elasticity or both. The key principle is to regularize the strain of the deformation which can be done through penalizat......For most image registration problems a smooth one-to-one mapping is desirable, a diffeomorphism. This can be obtained using priors such as volume preservation, certain kinds of elasticity or both. The key principle is to regularize the strain of the deformation which can be done through...... penalization of the eigen values of the stress tensor. We present a computational framework for regularization of image registration for isotropic hyper elasticity. We formulate an efficient and parallel scheme for computing the principal stain based for a given parameterization by decomposing the left Cauchy...
Regular algebra and finite machines
Conway, John Horton
2012-01-01
World-famous mathematician John H. Conway based this classic text on a 1966 course he taught at Cambridge University. Geared toward graduate students of mathematics, it will also prove a valuable guide to researchers and professional mathematicians.His topics cover Moore's theory of experiments, Kleene's theory of regular events and expressions, Kleene algebras, the differential calculus of events, factors and the factor matrix, and the theory of operators. Additional subjects include event classes and operator classes, some regulator algebras, context-free languages, communicative regular alg
Regularized Statistical Analysis of Anatomy
Sjöstrand, Karl
2007-01-01
This thesis presents the application and development of regularized methods for the statistical analysis of anatomical structures. Focus is on structure-function relationships in the human brain, such as the connection between early onset of Alzheimer’s disease and shape changes of the corpus cal...
Regularization in Matrix Relevance Learning
Schneider, Petra; Bunte, Kerstin; Stiekema, Han; Hammer, Barbara; Villmann, Thomas; Biehl, Michael
2010-01-01
A In this paper, we present a regularization technique to extend recently proposed matrix learning schemes in learning vector quantization (LVQ). These learning algorithms extend the concept of adaptive distance measures in LVQ to the use of relevance matrices. In general, metric learning can displa
Singularities of slice regular functions
Stoppato, Caterina
2010-01-01
Beginning in 2006, G. Gentili and D.C. Struppa developed a theory of regular quaternionic functions with properties that recall classical results in complex analysis. For instance, in each Euclidean ball centered at 0 the set of regular functions coincides with that of quaternionic power series converging in the same ball. In 2009 the author proposed a classification of singularities of regular functions as removable, essential or as poles and studied poles by constructing the ring of quotients. In that article, not only the statements, but also the proving techniques were confined to the special case of balls centered at 0. In a subsequent paper, F. Colombo, G. Gentili, I. Sabadini and D.C. Struppa (2009) identified a larger class of domains, on which the theory of regular functions is natural and not limited to quaternionic power series. The present article studies singularities in this new context, beginning with the construction of the ring of quotients and of Laurent-type expansions at points other than ...
Regular inference as vertex coloring
Costa Florêncio, C.; Verwer, S.
2012-01-01
This paper is concerned with the problem of supervised learning of deterministic finite state automata, in the technical sense of identification in the limit from complete data, by finding a minimal DFA consistent with the data (regular inference). We solve this problem by translating it in its enti
Regularized Generalized Structured Component Analysis
Hwang, Heungsun
2009-01-01
Generalized structured component analysis (GSCA) has been proposed as a component-based approach to structural equation modeling. In practice, GSCA may suffer from multi-collinearity, i.e., high correlations among exogenous variables. GSCA has yet no remedy for this problem. Thus, a regularized extension of GSCA is proposed that integrates a ridge…
Regular inference as vertex coloring
Costa Florêncio, C.; Verwer, S.
2012-01-01
This paper is concerned with the problem of supervised learning of deterministic finite state automata, in the technical sense of identification in the limit from complete data, by finding a minimal DFA consistent with the data (regular inference). We solve this problem by translating it in its
2011-01-20
... meeting of the Board will be held at the offices of the Farm Credit Administration in McLean, Virginia, on...Lean, Virginia 22102. SUPPLEMENTARY INFORMATION: This meeting of the Board will be open to the ] public... CORPORATION Farm Credit System Insurance Corporation Board Regular Meeting SUMMARY: Notice is hereby given of...
Sparse regularization in limited angle tomography
Frikel, Jürgen
2011-01-01
We investigate the reconstruction problem of limited angle tomography. Such problems arise naturally in applications like digital breast tomosynthesis, dental tomography, electron microscopy etc. Since the acquired tomographic data is highly incomplete, the reconstruction problem is severely ill-posed and the traditional reconstruction methods, such as filtered backprojection (FBP), do not perform well in such situations. To stabilize the reconstruction procedure additional prior knowledge about the unknown object has to be integrated into the reconstruction process. In this work, we propose the use of the sparse regularization technique in combination with curvelets. We argue that this technique gives rise to an edge-preserving reconstruction. Moreover, we show that the dimension of the problem can be significantly reduced in the curvelet domain. To this end, we give a characterization of the kernel of limited angle Radon transform in terms of curvelets and derive a characterization of solutions obtained thr...
Recursively-regular subdivisions and applications
Rafel Jaume
2016-05-01
Full Text Available We generalize regular subdivisions (polyhedral complexes resulting from the projection of the lower faces of a polyhedron introducing the class of recursively-regular subdivisions. Informally speaking, a recursively-regular subdivision is a subdivision that can be obtained by splitting some faces of a regular subdivision by other regular subdivisions (and continue recursively. We also define the finest regular coarsening and the regularity tree of a polyhedral complex. We prove that recursively-regular subdivisions are not necessarily connected by flips and that they are acyclic with respect to the in-front relation. We show that the finest regular coarsening of a subdivision can be efficiently computed, and that whether a subdivision is recursively regular can be efficiently decided. As an application, we also extend a theorem known since 1981 on illuminating space by cones and present connections of recursive regularity to tensegrity theory and graph-embedding problems.
General inverse problems for regular variation
Damek, Ewa; Mikosch, Thomas Valentin; Rosinski, Jan
2014-01-01
Regular variation of distributional tails is known to be preserved by various linear transformations of some random structures. An inverse problem for regular variation aims at understanding whether the regular variation of a transformed random object is caused by regular variation of components ...
Physical model of dimensional regularization
Schonfeld, Jonathan F.
2016-12-15
We explicitly construct fractals of dimension 4-ε on which dimensional regularization approximates scalar-field-only quantum-field theory amplitudes. The construction does not require fractals to be Lorentz-invariant in any sense, and we argue that there probably is no Lorentz-invariant fractal of dimension greater than 2. We derive dimensional regularization's power-law screening first for fractals obtained by removing voids from 3-dimensional Euclidean space. The derivation applies techniques from elementary dielectric theory. Surprisingly, fractal geometry by itself does not guarantee the appropriate power-law behavior; boundary conditions at fractal voids also play an important role. We then extend the derivation to 4-dimensional Minkowski space. We comment on generalization to non-scalar fields, and speculate about implications for quantum gravity. (orig.)
Maximum mutual information regularized classification
Wang, Jim Jing-Yan
2014-09-07
In this paper, a novel pattern classification approach is proposed by regularizing the classifier learning to maximize mutual information between the classification response and the true class label. We argue that, with the learned classifier, the uncertainty of the true class label of a data sample should be reduced by knowing its classification response as much as possible. The reduced uncertainty is measured by the mutual information between the classification response and the true class label. To this end, when learning a linear classifier, we propose to maximize the mutual information between classification responses and true class labels of training samples, besides minimizing the classification error and reducing the classifier complexity. An objective function is constructed by modeling mutual information with entropy estimation, and it is optimized by a gradient descend method in an iterative algorithm. Experiments on two real world pattern classification problems show the significant improvements achieved by maximum mutual information regularization.
Central charges in regular mechanics
Cabo-Montes de Oca, Alejandro; Villanueva, V M
1997-01-01
We consider the algebra associated to a group of transformations which are symmetries of a regular mechanical system (i.e. system free of constraints). For time dependent coordinate transformations we show that a central extension may appear at the classical level which is coordinate and momentum independent. A cochain formalism naturally arises in the argument and extends the usual configuration space cochain concepts to phase space.
Fast regularized image interpolation method
Hongchen Liu; Yong Feng; Linjing Li
2007-01-01
The regularized image interpolation method is widely used based on the vector interpolation model in which down-sampling matrix has very large dimension and needs large storage consumption and higher computation complexity. In this paper, a fast algorithm for image interpolation based on the tensor product of matrices is presented, which transforms the vector interpolation model to matrix form. The proposed algorithm can extremely reduce the storage requirement and time consumption. The simulation results verify their validity.
Efficient Hyperelastic Regularization for Registration
Darkner, Sune; Hansen, Michael S; Larsen, Rasmus;
2011-01-01
For most image registration problems a smooth one-to-one mapping is desirable, a diffeomorphism. This can be obtained using priors such as volume preservation, certain kinds of elasticity or both. The key principle is to regularize the strain of the deformation which can be done through penalizat......For most image registration problems a smooth one-to-one mapping is desirable, a diffeomorphism. This can be obtained using priors such as volume preservation, certain kinds of elasticity or both. The key principle is to regularize the strain of the deformation which can be done through...... penalization of the eigen values of the stress tensor. We present a computational framework for regularization of image registration for isotropic hyper elasticity. We formulate an efficient and parallel scheme for computing the principal stain based for a given parameterization by decomposing the left Cauchy...... elastic priors such at the Saint Vernant Kirchoff model, the Ogden material model or Riemanian elasticity. We exemplify the approach through synthetic registration and special tests as well as registration of different modalities; 2D cardiac MRI and 3D surfaces of the human ear. The artificial examples...
Montessori, A; Falcucci, G; Prestininzi, P; La Rocca, M; Succi, S
2014-05-01
We investigate the accuracy and performance of the regularized version of the single-relaxation-time lattice Boltzmann equation for the case of two- and three-dimensional lid-driven cavities. The regularized version is shown to provide a significant gain in stability over the standard single-relaxation time, at a moderate computational overhead.
From Dimensional to Cut-Off Regularization
Dillig, M
2006-01-01
We extent the standard approach of dimensional regularization of Feynman diagrams: we replace the transition to lower dimensions by a 'natural' cut-off regulator. Introducing an external regulator of mass Lambda^(2e), we regain in the limit e -> 0 and e > 0 the results of dimensional and cut-off regularization, respectively. We demonstrate the versatility and adequacy of the different regularization schemes for practical examples (such as non covariant regularization, the axial anomaly or regularization in effective field theories).
Regularized degenerate multi-solitons
Correa, Francisco
2016-01-01
We report complex PT-symmetric multi-soliton solutions to the Korteweg de-Vries equation that asymptotically contain one-soliton solutions, with each of them possessing the same amount of finite real energy. We demonstrate how these solutions originate from degenerate energy solutions of the Schroedinger equation. Technically this is achieved by the application of Darboux-Crum transformations involving Jordan states with suitable regularizing shifts. Alternatively they may be constructed from a limiting process within the context Hirota's direct method or on a nonlinear superposition obtained from multiple Baecklund transformations. The proposed procedure is completely generic and also applicable to other types of nonlinear integrable systems.
Academic Training Lecture - Regular Programme
PH Department
2011-01-01
Regular Lecture Programme 9 May 2011 ACT Lectures on Detectors - Inner Tracking Detectors by Pippa Wells (CERN) 10 May 2011 ACT Lectures on Detectors - Calorimeters (2/5) by Philippe Bloch (CERN) 11 May 2011 ACT Lectures on Detectors - Muon systems (3/5) by Kerstin Hoepfner (RWTH Aachen) 12 May 2011 ACT Lectures on Detectors - Particle Identification and Forward Detectors by Peter Krizan (University of Ljubljana and J. Stefan Institute, Ljubljana, Slovenia) 13 May 2011 ACT Lectures on Detectors - Trigger and Data Acquisition (5/5) by Dr. Brian Petersen (CERN) from 11:00 to 12:00 at CERN ( Bldg. 222-R-001 - Filtration Plant )
Regularization methods in Banach spaces
Schuster, Thomas; Hofmann, Bernd; Kazimierski, Kamil S
2012-01-01
Regularization methods aimed at finding stable approximate solutions are a necessary tool to tackle inverse and ill-posed problems. Usually the mathematical model of an inverse problem consists of an operator equation of the first kind and often the associated forward operator acts between Hilbert spaces. However, for numerous problems the reasons for using a Hilbert space setting seem to be based rather on conventions than on an approprimate and realistic model choice, so often a Banach space setting would be closer to reality. Furthermore, sparsity constraints using general Lp-norms or the B
Tikhonov regularization-based operational transfer path analysis
Cheng, Wei; Lu, Yingying; Zhang, Zhousuo
2016-06-01
To overcome ill-posed problems in operational transfer path analysis (OTPA), and improve the stability of solutions, this paper proposes a novel OTPA based on Tikhonov regularization, which considers both fitting degrees and stability of solutions. Firstly, fundamental theory of Tikhonov regularization-based OTPA is presented, and comparative studies are provided to validate the effectiveness on ill-posed problems. Secondly, transfer path analysis and source contribution evaluations for numerical cases studies on spherical radiating acoustical sources are comparatively studied. Finally, transfer path analysis and source contribution evaluations for experimental case studies on a test bed with thin shell structures are provided. This study provides more accurate transfer path analysis for mechanical systems, which can benefit for vibration reduction by structural path optimization. Furthermore, with accurate evaluation of source contributions, vibration monitoring and control by active controlling vibration sources can be effectively carried out.
Regularization of Instantaneous Frequency Attribute Computations
Yedlin, M. J.; Margrave, G. F.; Van Vorst, D. G.; Ben Horin, Y.
2014-12-01
We compare two different methods of computation of a temporally local frequency:1) A stabilized instantaneous frequency using the theory of the analytic signal.2) A temporally variant centroid (or dominant) frequency estimated from a time-frequency decomposition.The first method derives from Taner et al (1979) as modified by Fomel (2007) and utilizes the derivative of the instantaneous phase of the analytic signal. The second method computes the power centroid (Cohen, 1995) of the time-frequency spectrum, obtained using either the Gabor or Stockwell Transform. Common to both methods is the necessity of division by a diagonal matrix, which requires appropriate regularization.We modify Fomel's (2007) method by explicitly penalizing the roughness of the estimate. Following Farquharson and Oldenburg (2004), we employ both the L curve and GCV methods to obtain the smoothest model that fits the data in the L2 norm.Using synthetic data, quarry blast, earthquakes and the DPRK tests, our results suggest that the optimal method depends on the data. One of the main applications for this work is the discrimination between blast events and earthquakesFomel, Sergey. " Local seismic attributes." , Geophysics, 72.3 (2007): A29-A33.Cohen, Leon. " Time frequency analysis theory and applications." USA: Prentice Hall, (1995).Farquharson, Colin G., and Douglas W. Oldenburg. "A comparison of automatic techniques for estimating the regularization parameter in non-linear inverse problems." Geophysical Journal International 156.3 (2004): 411-425.Taner, M. Turhan, Fulton Koehler, and R. E. Sheriff. " Complex seismic trace analysis." Geophysics, 44.6 (1979): 1041-1063.
Regularity and prediction of ground pressure in Haigou Gold Mine
Meifeng Cai; Shuhua Hao; Hongguang Ji
2008-01-01
Previous mining excavation in upper sublevels left several mined-out areas in Haigou gold mine. To ensure safety of the main and auxiliary shafts and mining production in deeper sublevels, systematical studies on regularity, prediction, and control of ground pressure in the mine were carded out. Through 3D-numerical modeling and in-situ monitoring of acoustic emission, pressure and displacement, the ground pressure activity and the stability status of surrounding rock masses and the two shafts were assessed.Based on in-situ monitoring practice in Haigou mine, 4 modes to judge rock stability according to the monitoring information of acoustic emission, pressure, and displacement were presented.
A generalized regular form for multivariable sliding mode control
Perruquetti W.
2001-01-01
Full Text Available The paper shows how to compute a diffeomorphic state space transformation in order to put the initial mutivariable nonlinear model into an appropriate regular form . This form is an extension of the one proposed by Lukyanov and Utkin [9], and constitutes a guidance for a “natural” choice of the sliding surface. Then stabilization is achieved via a sliding mode strategy. In order to overcome the chattering phenomenon, a new nonlinear gain is introduced.
A generalized regular form for multivariable sliding mode control
W. Perruquetti
2001-01-01
Full Text Available The paper shows how to compute a diffeomorphic state space transformation in order to put the initial mutivariable nonlinear model into an appropriate regular form. This form is an extension of the one proposed by Lukyanov and Utkin [9], and constitutes a guidance for a “natural” choice of the sliding surface. Then stabilization is achieved via a sliding mode strategy. In order to overcome the chattering phenomenon, a new nonlinear gain is introduced.
A generalized regular form for multivariable sliding mode control
Perruquetti, W.; Richard, J. P.; P. Borne
2001-01-01
The paper shows how to compute a diffeomorphic state space transformation in order to put the initial mutivariable nonlinear model into an appropriate regular form . This form is an extension of the one proposed by Lukyanov and Utkin [9], and constitutes a guidance for a “natural” choice of the sliding surface. Then stabilization is achieved via a sliding mode strategy. In order to overcome the chattering phenomenon, a new nonlinear gain is introduced.
New Conservative Schemes for Regularized Long Wave Equation
Tingchun Wang; Luming Zhang
2006-01-01
In this paper, two finite difference schemes are presented for initial-boundary value problems of Regularized Long-Wave(RLW) equation. They all have the advantages that there are discrete energies which are conserved. Convergence and stability of difference solutions with order O(h2 +τ2) are proved in the energy norm. Numerical experiment results demonstrate the effectiveness of the proposed schemes.
HE Chundong; ZHANG Yongbin; BI Chuanxing; CHEN Xinzhao
2012-01-01
The regularization technique for stabilizing the reconstruction based on the nearfield acoustic holography （NAH） was investigated on the basis of the equivalent source method. In order to obtain higher regularization effect, a regularization method based on the idea of partial optimization was proposed, which inherits the advantages of the Tikhonov and another regularization method-truncated singular value decomposition （TSVD）. Through the numerical simulation, it is proved that the proposed method is stabler than the Tikhonov, and more precise than the TSVD. Finally the validity and the feasibility of the proposed method are demonstrated by an experiment carried out in a semi-anechoic room with two speakers.
Generalization performance of regularized neural network models
Larsen, Jan; Hansen, Lars Kai
1994-01-01
Architecture optimization is a fundamental problem of neural network modeling. The optimal architecture is defined as the one which minimizes the generalization error. This paper addresses estimation of the generalization performance of regularized, complete neural network models. Regularization...
A FAST CONVERGENT METHOD OF ITERATED REGULARIZATION
Huang Xiaowei; Wu Chuansheng; Wu Di
2009-01-01
This article presents a fast convergent method of iterated regularization based on the idea of Landweber iterated regularization, and a method for a-posteriori choice by the Morozov discrepancy principle and the optimum asymptotic convergence order of the regularized solution is obtained. Numerical test shows that the method of iterated regu-larization can quicken the convergence speed and reduce the calculation burden efficiently.
Weakly and Strongly Regular Near-rings
N.Argac; N.J.Groenewald
2005-01-01
In this paper, we prove some basic properties of left weakly regular near-rings.We give an affirmative answer to the question whether a left weakly regular near-ring with left unity and satisfying the IFP is also right weakly regular. In the last section, we use among others left 0-prime and left completely prime ideals to characterize strongly regular near-rings.
MAXIMAL POINTS OF A REGULAR TRUTH FUNCTION
Every canonical linearly separable truth function is a regular function, but not every regular truth function is linearly separable. The most...promising method of determining which of the regular truth functions are linearly separable r quires finding their maximal and minimal points. In this...report is developed a quick, systematic method of finding the maximal points of any regular truth function in terms of its arithmetic invariants. (Author)
Natural frequency of regular basins
Tjandra, Sugih S.; Pudjaprasetya, S. R.
2014-03-01
Similar to the vibration of a guitar string or an elastic membrane, water waves in an enclosed basin undergo standing oscillatory waves, also known as seiches. The resonant (eigen) periods of seiches are determined by water depth and geometry of the basin. For regular basins, explicit formulas are available. Resonance occurs when the dominant frequency of external force matches the eigen frequency of the basin. In this paper, we implement the conservative finite volume scheme to 2D shallow water equation to simulate resonance in closed basins. Further, we would like to use this scheme and utilizing energy spectra of the recorded signal to extract resonant periods of arbitrary basins. But here we first test the procedure for getting resonant periods of a square closed basin. The numerical resonant periods that we obtain are comparable with those from analytical formulas.
Regularized degenerate multi-solitons
Correa, Francisco; Fring, Andreas
2016-09-01
We report complex {P}{T} -symmetric multi-soliton solutions to the Korteweg de-Vries equation that asymptotically contain one-soliton solutions, with each of them possessing the same amount of finite real energy. We demonstrate how these solutions originate from degenerate energy solutions of the Schrödinger equation. Technically this is achieved by the application of Darboux-Crum transformations involving Jordan states with suitable regularizing shifts. Alternatively they may be constructed from a limiting process within the context Hirota's direct method or on a nonlinear superposition obtained from multiple Bäcklund transformations. The proposed procedure is completely generic and also applicable to other types of nonlinear integrable systems.
Modeling polycrystals with regular polyhedra
Paulo Rangel Rios
2006-06-01
Full Text Available Polycrystalline structure is of paramount importance to materials science and engineering. It provides an important example of a space-filling irregular network structure that also occurs in foams as well as in certain biological tissues. Therefore, seeking an accurate description of the characteristics of polycrystals is of fundamental importance. Recently, one of the authors (MEG published a paper in which a method was devised of representation of irregular networks by regular polyhedra with curved faces. In Glicksman's method a whole class of irregular polyhedra with a given number of faces, N, is represented by a single symmetrical polyhedron with N curved faces. This paper briefly describes the topological and metric properties of these special polyhedra. They are then applied to two important problems of irregular networks: the dimensionless energy 'cost' of irregular networks, and the derivation of a 3D analogue of the von Neumann-Mullins equation for the growth rate of grains in a polycrystal.
REGULARITY FOR CERTAIN QUASILINEARELLIPTIC SYSTEMS OF DIVERGENCESTRUCTURE
周树清; 冉启康
2001-01-01
The regularity of the gradient of H lder continuous solutions of quasi-linear elliptic systems of the form -Dj(aij(x, u, Du)Diuk) = -Difik + gkis investigated. Partial regularity and ε-regularity are shown to hold under the structural assumption-Dj(aij(x,u, Du)) = hi ∈ L∞.
Technology Corner: A Regular Expression Training App
Nick Flor
2012-12-01
Full Text Available Regular expressions enable digital forensic analysts to find information in files. The best way for an analyst to become proficient in writing regular expressions is to practice. This paper presents the code for an app that allows an analyst to practice writing regular expressions.
Counting Rooted Nearly 2-regular Planar Maps
郝荣霞; 蔡俊亮
2004-01-01
The number of rooted nearly 2-regular maps with the valency of rootvertex, the number of non-rooted vertices and the valency of root-face as three parameters is obtained. Furthermore, the explicit expressions of the special cases including loopless nearly 2-regular maps and simple nearly 2-regular maps in terms of the above three parameters are derived.
On the Construction of Regular Orthocryptogroups
Xiang Zhi KONG
2002-01-01
The aim of this paper is to study regular orthocryptogroups. After obtaining some charac-terizations of such semigroups, we establish the construction theorem of regular orthocryptogroups. Asan application, we give the construction theorem of right quasi-normal orthocryptogroups and studyhomomorphisms between two regular orthocryptogroups.
REGULAR RELATIONS AND MONOTONE NORMAL ORDERED SPACES
XU XIAOQUAN; LIU YINGMING
2004-01-01
In this paper the classical theorem of Zareckii about regular relations is generalized and an intrinsic characterization of regularity is obtained. Based on the generalized Zareckii theorem and the intrinsic characterization of regularity, the authors give a characterization of monotone normality of ordered spaces. A new proof of the UrysohnNachbin lemma is presented which is quite different from the classical one.
Regular Pentagons and the Fibonacci Sequence.
French, Doug
1989-01-01
Illustrates how to draw a regular pentagon. Shows the sequence of a succession of regular pentagons formed by extending the sides. Calculates the general formula of the Lucas and Fibonacci sequences. Presents a regular icosahedron as an example of the golden ratio. (YP)
Effect of regularization parameters on geophysical reconstruction
Zhou Hui; Wang Zhaolei; Qiu Dongling; Li Guofa; Shen Jinsong
2009-01-01
In this paper we discuss the edge-preserving regularization method in the reconstruction of physical parameters from geophysical data such as seismic and ground-penetrating radar data.In the regularization method a potential function of model parameters and its corresponding functions are introduced.This method is stable and able to preserve boundaries, and protect resolution.The effect of regularization depends to a great extent on the suitable choice of regularization parameters.The influence of the edge-preserving parameters on the reconstruction results is investigated and the relationship between the regularization parameters and the error of data is described.
Learning regularized LDA by clustering.
Pang, Yanwei; Wang, Shuang; Yuan, Yuan
2014-12-01
As a supervised dimensionality reduction technique, linear discriminant analysis has a serious overfitting problem when the number of training samples per class is small. The main reason is that the between- and within-class scatter matrices computed from the limited number of training samples deviate greatly from the underlying ones. To overcome the problem without increasing the number of training samples, we propose making use of the structure of the given training data to regularize the between- and within-class scatter matrices by between- and within-cluster scatter matrices, respectively, and simultaneously. The within- and between-cluster matrices are computed from unsupervised clustered data. The within-cluster scatter matrix contributes to encoding the possible variations in intraclasses and the between-cluster scatter matrix is useful for separating extra classes. The contributions are inversely proportional to the number of training samples per class. The advantages of the proposed method become more remarkable as the number of training samples per class decreases. Experimental results on the AR and Feret face databases demonstrate the effectiveness of the proposed method.
Ideal regularization for learning kernels from labels.
Pan, Binbin; Lai, Jianhuang; Shen, Lixin
2014-08-01
In this paper, we propose a new form of regularization that is able to utilize the label information of a data set for learning kernels. The proposed regularization, referred to as ideal regularization, is a linear function of the kernel matrix to be learned. The ideal regularization allows us to develop efficient algorithms to exploit labels. Three applications of the ideal regularization are considered. Firstly, we use the ideal regularization to incorporate the labels into a standard kernel, making the resulting kernel more appropriate for learning tasks. Next, we employ the ideal regularization to learn a data-dependent kernel matrix from an initial kernel matrix (which contains prior similarity information, geometric structures, and labels of the data). Finally, we incorporate the ideal regularization to some state-of-the-art kernel learning problems. With this regularization, these learning problems can be formulated as simpler ones which permit more efficient solvers. Empirical results show that the ideal regularization exploits the labels effectively and efficiently.
Regularity extraction from non-adjacent sounds
Alexandra eBendixen
2012-05-01
Full Text Available The regular behavior of sound sources helps us to make sense of the auditory environment. Regular patterns may, for instance, convey information on the identity of a sound source (such as the acoustic signature of a train moving on the rails. Yet typically, this signature overlaps in time with signals emitted from other sound sources. It is generally assumed that auditory regularity extraction cannot operate upon this mixture of signals because it only finds regularities between adjacent sounds. In this view, the auditory environment would be grouped into separate entities by means of readily available acoustic cues such as separation in frequency and location. Regularity extraction processes would then operate upon the resulting groups. Our new experimental evidence challenges this view. We presented two interleaved sound sequences which overlapped in frequency range and shared all acoustic parameters. The sequences only differed in their underlying regular patterns. We inserted deviants into one of the sequences to probe whether the regularity was extracted. In the first experiment, we found that these deviants elicited the mismatch negativity (MMN component. Thus the auditory system was able to find the regularity between the non-adjacent sounds. Regularity extraction was not influenced by sequence cohesiveness as manipulated by the relative duration of tones and silent inter-tone-intervals. In the second experiment, we showed that a regularity connecting non-adjacent sounds was discovered only when the intervening sequence also contained a regular pattern, but not when the intervening sounds were randomly varying. This suggests that separate regular patterns are available to the auditory system as a cue for identifying signals coming from distinct sound sources. Thus auditory regularity extraction is not necessarily confined to a processing stage after initial sound grouping, but may precede grouping when other acoustic cues are unavailable.
Thin-shell wormholes from the regular Hayward black hole
Halilsoy, M.; Ovgun, A.; Mazharimousavi, S.H. [Eastern Mediterranean University, Department of Physics, Mersin 10 (Turkey)
2014-03-15
We revisit the regular black hole found by Hayward in 4-dimensional static, spherically symmetric spacetime. To find a possible source for such a spacetime we resort to the nonlinear electrodynamics in general relativity. It is found that a magnetic field within this context gives rise to the regular Hayward black hole. By employing such a regular black hole we construct a thin-shell wormhole for the case of various equations of state on the shell. We abbreviate a general equation of state by p = ψ(σ) where p is the surface pressure which is a function of the mass density (σ). In particular, linear, logarithmic, Chaplygin, etc. forms of equations of state are considered. In each case we study the stability of the thin shell against linear perturbations.We plot the stability regions by tuning the parameters of the theory. It is observed that the role of the Hayward parameter is to make the TSW more stable. Perturbations of the throat with small velocity condition are also studied. The matter of our TSWs, however, remains exotic. (orig.)
New Regularization Method in Electrical Impedance Tomography
侯卫东; 莫玉龙
2002-01-01
Image reconstruction in elecrical impedance tomography(EIT)is a highly ill-posed inverse problem,Regularization techniques must be used in order to solve the problem,In this paper,a new regularization method based on the spatial filtering theory is proposed.The new regularized reconstruction for EIT is independent of the estimation of impedance distribution,so it can be implemented more easily than the maxiumum a posteriori(MAP) method.The regularization level in our proposed method varies spatially so as to be suited to the correlation character of the object's impedance distribution.We implemented our regularization method with two dimensional computer simulations.The experimental results indicate that the quality of the reconstructed impedance images with the descibed regularization method based on spatial filtering theory is better than that with Tikhonov method.
Regularized Laplacian Estimation and Fast Eigenvector Approximation
Perry, Patrick O
2011-01-01
Recently, Mahoney and Orecchia demonstrated that popular diffusion-based procedures to compute a quick \\emph{approximation} to the first nontrivial eigenvector of a data graph Laplacian \\emph{exactly} solve certain regularized Semi-Definite Programs (SDPs). In this paper, we extend that result by providing a statistical interpretation of their approximation procedure. Our interpretation will be analogous to the manner in which $\\ell_2$-regularized or $\\ell_1$-regularized $\\ell_2$-regression (often called Ridge regression and Lasso regression, respectively) can be interpreted in terms of a Gaussian prior or a Laplace prior, respectively, on the coefficient vector of the regression problem. Our framework will imply that the solutions to the Mahoney-Orecchia regularized SDP can be interpreted as regularized estimates of the pseudoinverse of the graph Laplacian. Conversely, it will imply that the solution to this regularized estimation problem can be computed very quickly by running, e.g., the fast diffusion-base...
Total variation regularization with bounded linear variations
Makovetskii, Artyom; Voronin, Sergei; Kober, Vitaly
2016-09-01
One of the most known techniques for signal denoising is based on total variation regularization (TV regularization). A better understanding of TV regularization is necessary to provide a stronger mathematical justification for using TV minimization in signal processing. In this work, we deal with an intermediate case between one- and two-dimensional cases; that is, a discrete function to be processed is two-dimensional radially symmetric piecewise constant. For this case, the exact solution to the problem can be obtained as follows: first, calculate the average values over rings of the noisy function; second, calculate the shift values and their directions using closed formulae depending on a regularization parameter and structure of rings. Despite the TV regularization is effective for noise removal; it often destroys fine details and thin structures of images. In order to overcome this drawback, we use the TV regularization for signal denoising subject to linear signal variations are bounded.
Hidden Regular Variation: Detection and Estimation
Mitra, Abhimanyu
2010-01-01
Hidden regular variation defines a subfamily of distributions satisfying multivariate regular variation on $\\mathbb{E} = [0, \\infty]^d \\backslash \\{(0,0, ..., 0) \\} $ and models another regular variation on the sub-cone $\\mathbb{E}^{(2)} = \\mathbb{E} \\backslash \\cup_{i=1}^d \\mathbb{L}_i$, where $\\mathbb{L}_i$ is the $i$-th axis. We extend the concept of hidden regular variation to sub-cones of $\\mathbb{E}^{(2)}$ as well. We suggest a procedure of detecting the presence of hidden regular variation, and if it exists, propose a method of estimating the limit measure exploiting its semi-parametric structure. We exhibit examples where hidden regular variation yields better estimates of probabilities of risk sets.
A multiplicative regularization for force reconstruction
Aucejo, M.; De Smet, O.
2017-02-01
Additive regularizations, such as Tikhonov-like approaches, are certainly the most popular methods for reconstructing forces acting on a structure. These approaches require, however, the knowledge of a regularization parameter, that can be numerically computed using specific procedures. Unfortunately, these procedures are generally computationally intensive. For this particular reason, it could be of primary interest to propose a method able to proceed without defining any regularization parameter beforehand. In this paper, a multiplicative regularization is introduced for this purpose. By construction, the regularized solution has to be calculated in an iterative manner. In doing so, the amount of regularization is automatically adjusted throughout the resolution process. Validations using synthetic and experimental data highlight the ability of the proposed approach in providing consistent reconstructions.
Regular Disjunction-Free Default Theories
Xi-ShunZhao
2004-01-01
In this paper, the class of regular disjunction-free default theories is introduced and investigated. A transformation from regular default theories to normal default theories is established. The initial theory and the transformed theory have the same extensions when restricted to old variables. Hence, regular default theories enjoy some similar properties (e.g., existence of extensions, semi-monotonicity) as normal default theories. Then, a new algorithm for credulous reasoning of regular theories is developed. This algorithm runs in a time not more than O(1.45n), where n is the number of defaults. In case of regular prerequisite-free or semi-2CNF default theories, the credulous reasoning can be solved in polynomial time. However, credulous reasoning for semi-Horn default theories is shown to be NP-complete although it is tractable for Horn default theories. Moreover, skeptical reasoning for regular unary default theories is co-NP-complete.
Regular Disjunction-Free Default Theories
Xi-Shun Zhao
2004-01-01
In this paper, the class of regular disjunction-free default theories is introduced and investigated.A transformation from regular default theories to normal default theories is established. The initial theory and the transformed theory have the same extensions when restricted to old variables. Hence, regular default theories enjoy some similar properties (e.g., existence of extensions, semi-monotonicity) as normal default theories. Then,a new algorithm for credulous reasoning of regular theories is developed. This algorithm runs in a time not more than O(1.45n), where n is the number of defaults. In case of regular prerequisite-free or semi-2CNF default theories, the credulous reasoning can be solved in polynomial time. However, credulous reasoning for semi-Horn default theories is shown to be NP-complete although it is tractable for Horn default theories. Moreover, skeptical reasoning for regular unary default theories is co-NP-complete.
Holwerda, B. W.; Bouwens, R. J.; Trenti, M.; Kenworthy, M. A.
2016-08-01
The James Webb Space Telescope (JWST) will be an exquisite new near-infrared observatory with imaging and multi-object spectroscopy through ESA’s NIRspec instrument with its unique Micro-Shutter Array (MSA), allowing for slits to be positioned on astronomical targets by opening specific 0‧‧.2-wide micro shutter doors. To ensure proper Target Acquisition (TA), the on-sky position of the MSA needs to be verified before spectroscopic observations start. An onboard centroiding program registers the position of pre-identified guide stars in a TA image, a short pre-spectroscopy exposure without dispersion (image mode) through the MSA with all shutters open. The outstanding issue is the availability of Galactic stars in the right luminosity range for TA relative to typical high redshift targets. We explore this here using the stars and z˜8 candidate galaxies identified in the source extractor catalogs of Brightest of Reionizing Galaxies survey (BoRG[z8]), a pure-parallel program with Hubble Space Telescope Wide-Field Camera 3. We find that (a) a single WFC3 field contains enough Galactic stars to satisfy the NIRspec astrometry requirement (20 milli-arcseconds), provided its and the NIRspec TA’s are mlim>24.5 AB in WFC3 F125W, (b) a single WFC3 image can therefore serve as the pre-image if need be, (c) a WFC3 mosaic and accompanying TA image satisfy the astrometry requirement at ˜23 AB mag in WFC3 F125W, (d) no specific Galactic latitude requires deeper TA imaging due to a lack of Galactic stars, and (e) a depth of ˜24 AB mag in WFC3 F125W is needed if a guide star in the same MSA quadrant as a target is required. We take the example of a BoRG identified z˜8 candidate galaxy and require a Galactic star within 20‧‧ of it. In this case, a depth of 25.5 AB in F125W is required (with ˜97% confidence).
Regularization Techniques for Linear Least-Squares Problems
Suliman, Mohamed
2016-04-01
Linear estimation is a fundamental branch of signal processing that deals with estimating the values of parameters from a corrupted measured data. Throughout the years, several optimization criteria have been used to achieve this task. The most astonishing attempt among theses is the linear least-squares. Although this criterion enjoyed a wide popularity in many areas due to its attractive properties, it appeared to suffer from some shortcomings. Alternative optimization criteria, as a result, have been proposed. These new criteria allowed, in one way or another, the incorporation of further prior information to the desired problem. Among theses alternative criteria is the regularized least-squares (RLS). In this thesis, we propose two new algorithms to find the regularization parameter for linear least-squares problems. In the constrained perturbation regularization algorithm (COPRA) for random matrices and COPRA for linear discrete ill-posed problems, an artificial perturbation matrix with a bounded norm is forced into the model matrix. This perturbation is introduced to enhance the singular value structure of the matrix. As a result, the new modified model is expected to provide a better stabilize substantial solution when used to estimate the original signal through minimizing the worst-case residual error function. Unlike many other regularization algorithms that go in search of minimizing the estimated data error, the two new proposed algorithms are developed mainly to select the artifcial perturbation bound and the regularization parameter in a way that approximately minimizes the mean-squared error (MSE) between the original signal and its estimate under various conditions. The first proposed COPRA method is developed mainly to estimate the regularization parameter when the measurement matrix is complex Gaussian, with centered unit variance (standard), and independent and identically distributed (i.i.d.) entries. Furthermore, the second proposed COPRA
Regularity effect in prospective memory during aging
Geoffrey Blondelle
2016-10-01
Full Text Available Background: Regularity effect can affect performance in prospective memory (PM, but little is known on the cognitive processes linked to this effect. Moreover, its impacts with regard to aging remain unknown. To our knowledge, this study is the first to examine regularity effect in PM in a lifespan perspective, with a sample of young, intermediate, and older adults. Objective and design: Our study examined the regularity effect in PM in three groups of participants: 28 young adults (18–30, 16 intermediate adults (40–55, and 25 older adults (65–80. The task, adapted from the Virtual Week, was designed to manipulate the regularity of the various activities of daily life that were to be recalled (regular repeated activities vs. irregular non-repeated activities. We examine the role of several cognitive functions including certain dimensions of executive functions (planning, inhibition, shifting, and binding, short-term memory, and retrospective episodic memory to identify those involved in PM, according to regularity and age. Results: A mixed-design ANOVA showed a main effect of task regularity and an interaction between age and regularity: an age-related difference in PM performances was found for irregular activities (older < young, but not for regular activities. All participants recalled more regular activities than irregular ones with no age effect. It appeared that recalling of regular activities only involved planning for both intermediate and older adults, while recalling of irregular ones were linked to planning, inhibition, short-term memory, binding, and retrospective episodic memory. Conclusion: Taken together, our data suggest that planning capacities seem to play a major role in remembering to perform intended actions with advancing age. Furthermore, the age-PM-paradox may be attenuated when the experimental design is adapted by implementing a familiar context through the use of activities of daily living. The clinical
Ambiguities in Pauli-Villars regularization
Kleiss, Ronald H P
2014-01-01
We investigate regularization of scalar one-loop integrals in the Pauli- Villars subtraction scheme. The results depend on the number of sub- tractions, in particular the finite terms that survive after the diver- gences have been absorbed by renormalization. Therefore the process of Pauli-Villars regularization is ambiguous. We discuss how these am- biguities may be resolved by applying an asymptotically large number of subtractions, which results in a regularization that is automatically valid in any number of dimensions.
Regularized brain reading with shrinkage and smoothing
Wehbe, Leila; Ramdas, Aaditya; Steorts, Rebecca C.; Shalizi, Cosma Rohilla
2014-01-01
Functional neuroimaging measures how the brain responds to complex stimuli. However, sample sizes are modest, noise is substantial, and stimuli are high dimensional. Hence, direct estimates are inherently imprecise and call for regularization. We compare a suite of approaches which regularize via shrinkage: ridge regression, the elastic net (a generalization of ridge regression and the lasso), and a hierarchical Bayesian model based on small area estimation (SAE). We contrast regularization w...
Branch Processes of Regular Magnetic Monopole
MO Shu-Fan; REN Ji-Rong; ZHU Tao
2009-01-01
In this paper, by making use of Duan's topological current theory, the branch process of regular magnetic monopoles is discussed in detail Regular magnetic monopoles are found generating or annihilating at the limit point and encountering, splitting, or merging at the bifurcation point and the degenerate point systematically of the vector order parameter field φ(x).Furthermore, it is also shown that when regular magnetic monopoles split or merge at the degenerate point of field function φ, the total topological charges of the regular magnetic monopoles axe still unchanged.
Iterative Regularization with Minimum-Residual Methods
Jensen, Toke Koldborg; Hansen, Per Christian
2007-01-01
We study the regularization properties of iterative minimum-residual methods applied to discrete ill-posed problems. In these methods, the projection onto the underlying Krylov subspace acts as a regularizer, and the emphasis of this work is on the role played by the basis vectors of these Krylov...... subspaces. We provide a combination of theory and numerical examples, and our analysis confirms the experience that MINRES and MR-II can work as general regularization methods. We also demonstrate theoretically and experimentally that the same is not true, in general, for GMRES and RRGMRES their success...... as regularization methods is highly problem dependent....
Iterative regularization with minimum-residual methods
Jensen, Toke Koldborg; Hansen, Per Christian
2006-01-01
We study the regularization properties of iterative minimum-residual methods applied to discrete ill-posed problems. In these methods, the projection onto the underlying Krylov subspace acts as a regularizer, and the emphasis of this work is on the role played by the basis vectors of these Krylov...... subspaces. We provide a combination of theory and numerical examples, and our analysis confirms the experience that MINRES and MR-II can work as general regularization methods. We also demonstrate theoretically and experimentally that the same is not true, in general, for GMRES and RRGMRES - their success...... as regularization methods is highly problem dependent....
Ideal-comparability over Regular Rings
Huan Yin CHEN; Miao Sen CHEN
2006-01-01
We introduce the concept of ideal-comparability condition for regular rings. Let I be an ideal of a regular ring R. If R satisfies the Ⅰ-comparability condition, then R is one-sided unit-regular if and only if so is R/I. Also, we show that a regular ring R satisfies the general comparability if and only if the following hold: (1) R/I satisfies the general comparability; (2) R satisfies the general Ⅰ-comparability condition; (3) The natural map B(R) → B(R/I) is surjective.
Local and Nonlocal Regularization to Image Interpolation
Yi Zhan
2014-01-01
Full Text Available This paper presents an image interpolation model with local and nonlocal regularization. A nonlocal bounded variation (BV regularizer is formulated by an exponential function including gradient. It acts as the Perona-Malik equation. Thus our nonlocal BV regularizer possesses the properties of the anisotropic diffusion equation and nonlocal functional. The local total variation (TV regularizer dissipates image energy along the orthogonal direction to the gradient to avoid blurring image edges. The derived model efficiently reconstructs the real image, leading to a natural interpolation which reduces blurring and staircase artifacts. We present experimental results that prove the potential and efficacy of the method.
Regularization and error assignment to unfolded distributions
Zech, Gunter
2011-01-01
The commonly used approach to present unfolded data only in graphical formwith the diagonal error depending on the regularization strength is unsatisfac-tory. It does not permit the adjustment of parameters of theories, the exclusionof theories that are admitted by the observed data and does not allow the com-bination of data from different experiments. We propose fixing the regulariza-tion strength by a p-value criterion, indicating the experimental uncertaintiesindependent of the regularization and publishing the unfolded data in additionwithout regularization. These considerations are illustrated with three differentunfolding and smoothing approaches applied to a toy example.
Bit-coded regular expression parsing
Nielsen, Lasse; Henglein, Fritz
2011-01-01
Regular expression parsing is the problem of producing a parse tree of a string for a given regular expression. We show that a compact bit representation of a parse tree can be produced efficiently, in time linear in the product of input string size and regular expression size, by simplifying...... the DFA-based parsing algorithm due to Dub ´e and Feeley to emit the bits of the bit representation without explicitly materializing the parse tree itself. We furthermore show that Frisch and Cardelli’s greedy regular expression parsing algorithm can be straightforwardly modified to produce bit codings...
The regularity of quotient paratopological groups
Banakh, Taras
2010-01-01
Let $H$ be a closed subgroup of a regular abelian paratopological group $G$. The group reflexion $G^\\flat$ of $G$ is the group $G$ endowed with the strongest group topology, weaker that the original topology of $G$. We show that the quotient $G/H$ is Hausdorff (and regular) if $H$ is closed (and locally compact) in $G^\\flat$. On the other hand, we construct an example of a regular abelian paratopological group $G$ containing a closed discrete subgroup $H$ such that the quotient $G/H$ is Hausdorff but not regular.
Two vortex-blob regularization models for vortex sheet motion
Sohn, Sung-Ik
2014-04-01
Evolving vortex sheets generally form singularities in finite time. The vortex blob model is an approach to regularize the vortex sheet motion and evolve past singularity formation. In this paper, we thoroughly compare two such regularizations: the Krasny-type model and the Beale-Majda model. It is found from a linear stability analysis that both models have exponentially decaying growth rates for high wavenumbers, but the Beale-Majda model has a faster decaying rate than the Krasny model. The Beale-Majda model thus gives a stronger regularization to the solution. We apply the blob models to the two example problems: a periodic vortex sheet and an elliptically loaded wing. The numerical results show that the solutions of the two models are similar in large and small scales, but are fairly different in intermediate scales. The sheet of the Beale-Majda model has more spiral turns than the Krasny-type model for the same value of the regularization parameter δ. We give numerical evidences that the solutions of the two models agree for an increasing amount of spiral turns and tend to converge to the same limit as δ is decreased. The inner spiral turns of the blob models behave differently with the outer turns and satisfy a self-similar form. We also examine irregular motions of the sheet at late times and find that the irregular motions shrink as δ is decreased. This fact suggests a convergence of the blob solution to the weak solution of infinite regular spiral turns.
On global regular solutions to magnetohydrodynamics in axi-symmetric domains
Nowakowski, Bernard; Zajączkowski, Wojciech M.
2016-12-01
We consider mhd equations in three-dimensional axially symmetric domains under the Navier boundary conditions for both velocity and magnetic fields. We prove the existence of global, regular axi-symmetric solutions and examine their stability in the class of general solutions to the mhd system. As a consequence, we show the existence of global, regular solutions to the mhd system which are close in suitable norms to axi-symmetric solutions.
Zhan, Qin; Yuan, Yuan; Fan, Xiangtao; Huang, Jianyong; Xiong, Chunyang; Yuan, Fan
2016-06-01
Digital image correlation (DIC) is essentially implicated in a class of inverse problem. Here, a regularization scheme is developed for the subset-based DIC technique to effectively inhibit potential ill-posedness that likely arises in actual deformation calculations and hence enhance numerical stability, accuracy and precision of correlation measurement. With the aid of a parameterized two-dimensional Butterworth window, a regularized subpixel registration strategy is established, in which the amount of speckle information introduced to correlation calculations may be weighted through equivalent subset size constraint. The optimal regularization parameter associated with each individual sampling point is determined in a self-adaptive way by numerically investigating the curve of 2-norm condition number of coefficient matrix versus the corresponding equivalent subset size, based on which the regularized solution can eventually be obtained. Numerical results deriving from both synthetic speckle images and actual experimental images demonstrate the feasibility and effectiveness of the set of newly-proposed regularized DIC algorithms.
SUI Da-shan; CUI Zhen-shan
2008-01-01
The interfacial heat transfer coefficient(IHTC) between the casting and the mould is essential to the numerical simulation as one of boundary conditions. A new inverse method was presented according to the Tikhonov regularization theory. A regularized functional was established and the regularization parameter was deduced. The functional was solved to determine the interfacial heat transfer coefficient by using the sensitivity coefficient and Newton-Raphson iteration method. The temperature measurement experiment was done to ZL102 sand mold casting, and the appropriate mathematical model of the IHTC was established. Moreover, the regularization method was used to determinate the IHTC. The results indicate that the regularization method is very efficient in overcoming the ill-posedness of the inverse heat conduction problem(IHCP), and ensuring the accuracy and stability of the solutions.
Continuum regularization of quantum field theory
Bern, Z.
1986-04-01
Possible nonperturbative continuum regularization schemes for quantum field theory are discussed which are based upon the Langevin equation of Parisi and Wu. Breit, Gupta and Zaks made the first proposal for new gauge invariant nonperturbative regularization. The scheme is based on smearing in the ''fifth-time'' of the Langevin equation. An analysis of their stochastic regularization scheme for the case of scalar electrodynamics with the standard covariant gauge fixing is given. Their scheme is shown to preserve the masslessness of the photon and the tensor structure of the photon vacuum polarization at the one-loop level. Although stochastic regularization is viable in one-loop electrodynamics, two difficulties arise which, in general, ruins the scheme. One problem is that the superficial quadratic divergences force a bottomless action for the noise. Another difficulty is that stochastic regularization by fifth-time smearing is incompatible with Zwanziger's gauge fixing, which is the only known nonperturbaive covariant gauge fixing for nonabelian gauge theories. Finally, a successful covariant derivative scheme is discussed which avoids the difficulties encountered with the earlier stochastic regularization by fifth-time smearing. For QCD the regularized formulation is manifestly Lorentz invariant, gauge invariant, ghost free and finite to all orders. A vanishing gluon mass is explicitly verified at one loop. The method is designed to respect relevant symmetries, and is expected to provide suitable regularization for any theory of interest. Hopefully, the scheme will lend itself to nonperturbative analysis. 44 refs., 16 figs.
Regular Decompositions for H(div) Spaces
Kolev, Tzanio [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States). Center for Applied Scientific Computing; Vassilevski, Panayot [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States). Center for Applied Scientific Computing
2012-01-01
We study regular decompositions for H(div) spaces. In particular, we show that such regular decompositions are closely related to a previously studied “inf-sup” condition for parameter-dependent Stokes problems, for which we provide an alternative, more direct, proof.
Adaptive regularization of noisy linear inverse problems
Hansen, Lars Kai; Madsen, Kristoffer Hougaard; Lehn-Schiøler, Tue
2006-01-01
In the Bayesian modeling framework there is a close relation between regularization and the prior distribution over parameters. For prior distributions in the exponential family, we show that the optimal hyper-parameter, i.e., the optimal strength of regularization, satisfies a simple relation: T...
12 CFR 725.3 - Regular membership.
2010-01-01
... 12 Banks and Banking 6 2010-01-01 2010-01-01 false Regular membership. 725.3 Section 725.3 Banks and Banking NATIONAL CREDIT UNION ADMINISTRATION REGULATIONS AFFECTING CREDIT UNIONS NATIONAL CREDIT UNION ADMINISTRATION CENTRAL LIQUIDITY FACILITY § 725.3 Regular membership. (a) A natural person...
Fast and compact regular expression matching
Bille, Philip; Farach-Colton, Martin
2008-01-01
We study 4 problems in string matching, namely, regular expression matching, approximate regular expression matching, string edit distance, and subsequence indexing, on a standard word RAM model of computation that allows logarithmic-sized words to be manipulated in constant time. We show how...
Regularity of harmonic maps with the potential
CHU; Yuming
2006-01-01
The aim of this work is to prove the partial regularity of the harmonic maps with potential. The main difficulty caused by the potential is how to find the equation satisfied by the scaling function. Under the assumption on the potential we can obtain the equation, however, for a general potential, even if it is smooth, the partial regularity is still open.
On the Equivalence of Regularization Schemes
YANG Ji-Feng
2002-01-01
We illustrate via the sunset diagram that dimensional regularization ‘deforms' the nonlocal contentsof multi-loop diagrams with its equivalence to cutoff regularization scheme recovered only after sub-divergence wassubtracted. Then we employed a differential equation approach for calculating loop diagrams to verify that dimensionalare argued especially in nonperturbativc perspective.
Regular Event Structures and Finite Petri Nets
Nielsen, M.; Thiagarajan, P.S.
2002-01-01
We present the notion of regular event structures and conjecture that they correspond exactly to finite 1-safe Petri nets. We show that the conjecture holds for the conflict-free case. Even in this restricted setting, the proof is non-trivial and involves a natural subclass of regular event...
Regularity Re-Revisited: Modality Matters
Tsapkini, Kyrana; Jarema, Gonia; Kehayia, Eva
2004-01-01
The issue of regular-irregular past tense formation was examined in a cross-modal lexical decision task in Modern Greek, a language where the orthographic and phonological overlap between present and past tense stems is the same for both regular and irregular verbs. The experiment described here is a follow-up study of previous visual lexical…
Regularization algorithms based on total least squares
Hansen, Per Christian; O'Leary, Dianne P.
1996-01-01
Discretizations of inverse problems lead to systems of linear equations with a highly ill-conditioned coefficient matrix, and in order to compute stable solutions to these systems it is necessary to apply regularization methods. Classical regularization methods, such as Tikhonov's method or trunc...
A regularized stationary mean-field game
Yang, Xianjin
2016-04-19
In the thesis, we discuss the existence and numerical approximations of solutions of a regularized mean-field game with a low-order regularization. In the first part, we prove a priori estimates and use the continuation method to obtain the existence of a solution with a positive density. Finally, we introduce the monotone flow method and solve the system numerically.
Regularized Image Reconstruction for Ultrasound Attenuation Transmission Tomography
I. Peterlik
2008-06-01
Full Text Available The paper is focused on ultrasonic transmission tomography as a potential medical imaging modality, namely for breast cancer diagnosis. Ultrasound attenuation coefficient is one of the tissue parameters which are related to the pathological tissue state. A technique to reconstruct images of attenuation distribution is presented. Furthermore, an alternative to the commonly used filtered backprojection or algebraic reconstruction techniques is proposed. It is based on regularization of the image reconstruction problem which imposes smoothness in the resulting images while preserving edges. The approach is analyzed on synthetic data sets. The results show that it stabilizes the image restoration by compensating for main sources of estimation errors in this imaging modality.
Minimal regular 2-graphs and applications
FAN; Hongbing; LIU; Guizhen; LIU; Jiping
2006-01-01
A 2-graph is a hypergraph with edge sizes of at most two. A regular 2-graph is said to be minimal if it does not contain a proper regular factor. Let f2(n) be the maximum value of degrees over all minimal regular 2-graphs of n vertices. In this paper, we provide a structure property of minimal regular 2-graphs, and consequently, prove that f2(n) = n+3-i/3where 1 ≤i≤6, i=n (mod 6) andn≥ 7, which solves a conjecture posed by Fan, Liu, Wu and Wong. As applications in graph theory, we are able to characterize unfactorable regular graphs and provide the best possible factor existence theorem on degree conditions. Moreover, f2(n) and the minimal 2-graphs can be used in the universal switch box designs, which originally motivated this study.
Regular Expression Matching and Operational Semantics
Rathnayake, Asiri; 10.4204/EPTCS.62.3
2011-01-01
Many programming languages and tools, ranging from grep to the Java String library, contain regular expression matchers. Rather than first translating a regular expression into a deterministic finite automaton, such implementations typically match the regular expression on the fly. Thus they can be seen as virtual machines interpreting the regular expression much as if it were a program with some non-deterministic constructs such as the Kleene star. We formalize this implementation technique for regular expression matching using operational semantics. Specifically, we derive a series of abstract machines, moving from the abstract definition of matching to increasingly realistic machines. First a continuation is added to the operational semantics to describe what remains to be matched after the current expression. Next, we represent the expression as a data structure using pointers, which enables redundant searches to be eliminated via testing for pointer equality. From there, we arrive both at Thompson's lock...
A linear functional strategy for regularized ranking.
Kriukova, Galyna; Panasiuk, Oleksandra; Pereverzyev, Sergei V; Tkachenko, Pavlo
2016-01-01
Regularization schemes are frequently used for performing ranking tasks. This topic has been intensively studied in recent years. However, to be effective a regularization scheme should be equipped with a suitable strategy for choosing a regularization parameter. In the present study we discuss an approach, which is based on the idea of a linear combination of regularized rankers corresponding to different values of the regularization parameter. The coefficients of the linear combination are estimated by means of the so-called linear functional strategy. We provide a theoretical justification of the proposed approach and illustrate them by numerical experiments. Some of them are related with ranking the risk of nocturnal hypoglycemia of diabetes patients.
On regularizations of the Dirac delta distribution
Hosseini, Bamdad; Nigam, Nilima; Stockie, John M.
2016-01-01
In this article we consider regularizations of the Dirac delta distribution with applications to prototypical elliptic and hyperbolic partial differential equations (PDEs). We study the convergence of a sequence of distributions SH to a singular term S as a parameter H (associated with the support size of SH) shrinks to zero. We characterize this convergence in both the weak-* topology of distributions and a weighted Sobolev norm. These notions motivate a framework for constructing regularizations of the delta distribution that includes a large class of existing methods in the literature. This framework allows different regularizations to be compared. The convergence of solutions of PDEs with these regularized source terms is then studied in various topologies such as pointwise convergence on a deleted neighborhood and weighted Sobolev norms. We also examine the lack of symmetry in tensor product regularizations and effects of dissipative error in hyperbolic problems.
Quantitative regularities in floodplain formation
Nevidimova, O.
2009-04-01
Quantitative regularities in floodplain formation Modern methods of the theory of complex systems allow to build mathematical models of complex systems where self-organizing processes are largely determined by nonlinear effects and feedback. However, there exist some factors that exert significant influence on the dynamics of geomorphosystems, but hardly can be adequately expressed in the language of mathematical models. Conceptual modeling allows us to overcome this difficulty. It is based on the methods of synergetic, which, together with the theory of dynamic systems and classical geomorphology, enable to display the dynamics of geomorphological systems. The most adequate for mathematical modeling of complex systems is the concept of model dynamics based on equilibrium. This concept is based on dynamic equilibrium, the tendency to which is observed in the evolution of all geomorphosystems. As an objective law, it is revealed in the evolution of fluvial relief in general, and in river channel processes in particular, demonstrating the ability of these systems to self-organization. Channel process is expressed in the formation of river reaches, rifts, meanders and floodplain. As floodplain is a periodically flooded surface during high waters, it naturally connects river channel with slopes, being one of boundary expressions of the water stream activity. Floodplain dynamics is inseparable from the channel dynamics. It is formed at simultaneous horizontal and vertical displacement of the river channel, that is at Y=Y(x, y), where х, y - horizontal and vertical coordinates, Y - floodplain height. When dу/dt=0 (for not lowering river channel), the river, being displaced in a horizontal plane, leaves behind a low surface, which flooding during high waters (total duration of flooding) changes from the maximum during the initial moment of time t0 to zero in the moment tn. In a similar manner changed is the total amount of accumulated material on the floodplain surface
Solution of inverse heat conduction problem using the Tikhonov regularization method
Duda, Piotr
2017-02-01
It is hard to solve ill-posed problems, as calculated temperatures are very sensitive to errors made while calculating "measured" temperatures or performing real-time measurements. The errors can create temperature oscillation, which can be the cause of an unstable solution. In order to overcome such difficulties, a variety of techniques have been proposed in literature, including regularization, future time steps and smoothing digital filters. In this paper, the Tikhonov regularization is applied to stabilize the solution of the inverse heat conduction problem. The impact on the inverse solution stability and accuracy is demonstrated.
Multiple graph regularized protein domain ranking
Wang, Jim Jing-Yan
2012-11-19
Background: Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods.Results: To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods.Conclusion: The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. 2012 Wang et al; licensee BioMed Central Ltd.
J-regular rings with injectivities
Shen, Liang
2010-01-01
A ring $R$ is called a J-regular ring if R/J(R) is von Neumann regular, where J(R) is the Jacobson radical of R. It is proved that if R is J-regular, then (i) R is right n-injective if and only if every homomorphism from an $n$-generated small right ideal of $R$ to $R_{R}$ can be extended to one from $R_{R}$ to $R_{R}$; (ii) R is right FP-injective if and only if R is right (J, R)-FP-injective. Some known results are improved.
Low power implementation of datapath using regularity
LAI Li-ya; LIU Peng
2005-01-01
Datapath accounts for a considerable part of power consumption in VLSI circuit design. This paper presents a method for physical implementation of datapath to achieve low power consumption. Regularity is a characteristic of datapath and the key of the proposed method, where synthesis is tightly combined with placement to make full use of regularity, so that low power consumption is achieved. In This paper, a new concept of Synthesis In Relative Placement (SIRP) is given to deal with the semi-regularity in some datapath. Experimental results of a sample circuit validated the proposed method.
REGULARIZATION OF SINGULAR SYSTEMS BY OUTPUT FEEDBACK
De-lin Chu; Da-yong Cai
2000-01-01
Problem of regularization of a singular system by derivative and proportional output feedback is studied. Necessary and sufficient conditions are obtained under which a singular system can be regularized into a closed-loop system that is regular and of index at most one. The reduced form is given that can easily explore the system properties as well as the feedback to be determined. The main results of the present paper are based on orthogonal transformations. Therefore, they can be implemented by numerically stable ways.
Limitations on Dimensional Regularization in Renyi Entropy
Bao, Ning
2016-01-01
Dimensional regularization is a common method used to regulate the UV divergence of field theoretic quantities. When it is used in the context of Renyi entropy, however, it is important to consider whether such a procedure eliminates the statistical interpretation thereof as a measure of entanglement of states living on a Hilbert space. We therefore examine the dimensionally regularized Renyi entropy of a 4d unitary CFT and show that it admits no underlying Hilbert space in the state-counting sense. This gives a concrete proof that dimensionally regularized Renyi entropy cannot always be obtained as a limit of the Renyi entropy of some finite-dimensional quantum system.
Iterative Regularization with Minimum-Residual Methods
Jensen, Toke Koldborg; Hansen, Per Christian
2007-01-01
We study the regularization properties of iterative minimum-residual methods applied to discrete ill-posed problems. In these methods, the projection onto the underlying Krylov subspace acts as a regularizer, and the emphasis of this work is on the role played by the basis vectors of these Krylov...... subspaces. We provide a combination of theory and numerical examples, and our analysis confirms the experience that MINRES and MR-II can work as general regularization methods. We also demonstrate theoretically and experimentally that the same is not true, in general, for GMRES and RRGMRES their success...
Could Regular Pot Smoking Harm Vision?
... fullstory_162441.html Could Regular Pot Smoking Harm Vision? Study suggests that it might slow signaling among ... may be linked to a limited degree of vision impairment, a new French study suggests. The finding ...
Regular-fat dairy and human health
Astrup, Arne; Bradley, Beth H Rice; Brenna, J Thomas
2016-01-01
In recent history, some dietary recommendations have treated dairy fat as an unnecessary source of calories and saturated fat in the human diet. These assumptions, however, have recently been brought into question by current research on regular fat dairy products and human health. In an effort...... dairy foods have on human health. The emerging scientific evidence indicates that the consumption of regular fat dairy foods is not associated with an increased risk of cardiovascular disease and inversely associated with weight gain and the risk of obesity. Dairy foods, including regular-fat milk...... to disseminate, explore and discuss the state of the science on the relationship between regular fat dairy products and health, symposia were programmed by dairy industry organizations in Europe and North America at The Eurofed Lipids Congress (2014) in France, The Dairy Nutrition Annual Symposium (2014...
The regularization of Old English weak verbs
Marta Tío Sáenz
2015-07-01
Full Text Available This article deals with the regularization of non-standard spellings of the verbal forms extracted from a corpus. It addresses the question of what the limits of regularization are when lemmatizing Old English weak verbs. The purpose of such regularization, also known as normalization, is to carry out lexicological analysis or lexicographical work. The analysis concentrates on weak verbs from the second class and draws on the lexical database of Old English Nerthus, which has incorporated the texts of the Dictionary of Old English Corpus. As regards the question of the limits of normalization, the solution adopted are, in the first place, that when it is necessary to regularize, normalization is restricted to correspondences based on dialectal and diachronic variation and, secondly, that normalization has to be unidirectional.
On π-regularity of General Rings
CHEN WEI-XING; CUI SHU-YING
2010-01-01
A general ring means an associative ring with or without identity. An idempotent e in a general ring I is called left (right) semicentral if for every x∈ I,xe = exe (ex = exe). And I is called semiabelian ff every idempotent in I is left or right semicentral. It is proved that a semiabelian general ring I is π-regular if and only ff the set N(I) of nilpotent elements in I is an ideal of I and I/N(I) is regular. It follows that if I is a semiabelian general ring and K is an ideal of I,then I is π-regular if and only if both K and I/K are r-regular. Based on this we prove that every semiabelian GVNL-ring is an SGVNL-ring. These generalize several known results on the relevant subject. Furthermore we give a characterization of a semiabelian GVNL-ring.
A Biordered Set Representation of Regular Semigroups
Bing Jun YU; Mang XU
2005-01-01
In this paper, for an arbitrary regular biordered set E, by using biorder-isomorphisms between the ω-ideals of E, we construct a fundamental regular semigroup WE called NH-semigroup of E, whose idempotent biordered set is isomorphic to E. We prove further that WE can be used to give a new representation of general regular semigroups in the sense that, for any regular semigroup S with the idempotent biordered set isomorphic to E, there exists a homomorphism from S to WE whose kernel is the greatest idempotent-separating congruence on S and the image is a full symmetric subsemigroup of WE. Moreover, when E is a biordered set of a semilattice E0, WE is isomorphic to the Munn-semigroup TE0; and when E is the biordered set of a band B, WE is isomorphic to the Hall-semigroup WB.
Regularities and Radicals in Near-rings
N.J. Groenewald
2002-01-01
Let F be a regularity for near-rings and F(R) the largest FR-regular ideal in R. In the first part of this paper, we introduce the concepts of maximal Fmodular ideals and F-primitive near-rings to characterize F(R) for any near-ring regularity F. Under certain conditions, F(R) is equal to the intersection of all the maximal F-modular ideals of R. As examples, we apply this to the different analogs of the Brown-McCoy radicals and also the Behrens radicals. In the last part of this paper, we show that for certain regularities, the class of F-primitive near-rings forms a special class.
Spectral partitioning of random regular blockmodels
Barucca, Paolo
2016-01-01
Graph partitioning problems emerge in a wide variety of complex systems, ranging from biology to finance, but can be rigorously analyzed and solved only for a few graph ensembles. Here, an ensemble of random graphs with regular block structure is introduced, for which analytical results can be obtained. In particular, the spectral density of such random regular blockmodels is computed exactly for a modular, bipartite and core-periphery structure. McKay's law for random regular graphs is found analytically to apply also for regular modular and bipartite structures when blocks are homogeneous. In core-periphery structures, where blocks are intrinsically heterogeneous, a new law is found to apply for the spectral density. Exact solution to the inference problem is provided for the models discussed. All analytical results show perfect agreement with numerical experiments. Final discussion summarizes results and outlines the relevance of the results for the solution of graph partitioning problems in other graph en...
Comparability for ideals of regular rings
CHEN Huanyin
2005-01-01
In this paper we investigate necessary and sufficient conditions under which the ideals possess comparability structure. For regular rings, we prove that every square matrix over ideals satisfying general comparability admits a diagonal reduction by quasi invertible matrices.
Regularity of optimal transport maps and applications
Philippis, Guido
2013-01-01
In this thesis, we study the regularity of optimal transport maps and its applications to the semi-geostrophic system. The first two chapters survey the known theory, in particular there is a self-contained proof of Brenier’ theorem on existence of optimal transport maps and of Caffarelli’s Theorem on Holder continuity of optimal maps. In the third and fourth chapter we start investigating Sobolev regularity of optimal transport maps, while in Chapter 5 we show how the above mentioned results allows to prove the existence of Eulerian solution to the semi-geostrophic equation. In Chapter 6 we prove partial regularity of optimal maps with respect to a generic cost functions (it is well known that in this case global regularity can not be expected). More precisely we show that if the target and source measure have smooth densities the optimal map is always smooth outside a closed set of measure zero.
On Comparison of Adaptive Regularization Methods
Sigurdsson, Sigurdur; Larsen, Jan; Hansen, Lars Kai
2000-01-01
, a very flexible regularization may substitute the need for selection procedures. This paper investigates recently suggested adaptive regularization schemes. Some methods focus directly on minimizing an estimate of the generalization error (either algebraic or empirical), whereas others start from...... different criteria, e.g., the Bayesian evidence. The evidence expresses basically the probability of the model, which is conceptually different from generalization error; however, asymptotically for large training data sets they will converge. First the basic model definition, training and generalization...
*-Regular Leavitt Path Algebras of Arbitrary Graphs
Gonzalo ARANDA PINO; Kulumani RANGASWAMY; Lia VA(S)
2012-01-01
If K is a field with involution and E an arbitrary graph,the involution from K naturally induces an involution of the Leavitt path algebra LK(E).We show that the involution on LK(E) is proper if the involution on K is positive-definite,even in the case when the graph E is not necessarily finite or row-finite.It has been shown that the Leavitt path algebra LK(E) is regular if and only if E is acyclic.We give necessary and sufficient conditions for LK(E) to be *-regular (i.e.,regular with proper involution).This characterization of *-regularity of a Leavitt path algebra is given in terms of an algebraic property of K,not just a graph-theoretic property of E.This differs from the.known characterizations of various other algebraic properties of a Leavitt path algebra in terms of graphtheoretic properties of E alone.As a corollary,we show that Handelman's conjecture (stating that every *-regular ring is unit-regular) holds for Leavitt path algebras.Moreover,its generalized version for rings with local units also continues to hold for Leavitt path algebras over arbitrary graphs.
The Least Regular Order with Respect to a Regular Congruence on Ordered Γ-Semigroups
Manoj SIRIPITUKDET; Aiyared IAMPAN
2012-01-01
The motivation mainly comes from the conditions of congruences to be regular that are of importance and interest in ordered semigroups.In 1981,Sen has introduced the concept of the Γ-semigroups.We can see that any semigroup can be considered as a Γ-semigroup.In this paper,we introduce and characterize the concept of the regular congruences on ordered Γ-semigroups and prove the following statements on an ordered Γ-semigroup M:(1) Every ordered semilattice congruences is a regular congruence.(2) There exists the least regular order on the T-semigroup M/p with respect to a regular congruence p on M.(3) The regular congruences are not ordered semilattice congruences in general.
Wesselink, J.M.; Berkhoff, A.P.
2008-01-01
In this paper, real-time results are given for broadband multichannel active noise control using the regularized modified filtered-error algorithm. As compared to the standard filtered-error algorithm, the improved convergence rate and stability of the algorithm are obtained by using an inner-outer
A Construction for P-Regular Semigroups
无
2000-01-01
@@A regular semigroup S with a special involution *, i.e., a unaryoperation on S satisfying (x*)*=x, xx*x=x, (xy)*=y*x* x, y S, is called a regular *-semigroup［1］. It has been shown by Yamada［2］ that a regular semigroup S is a regular *-semigroup if and only if ithas a P-system, that is to say, there is a subset P ofE(S) such that (c.1) (1) ( p, q P) pq E(S), pqp P; (2) ( a S) ( | a+ V(a)) aP1a+, a+P1a P.As a generalization of regular *-semigroup and orthodox semigroup,Yamada［3］ defined P-regular semigroup. Let S be a regularsemigroup. A subset P of E(S) is called a C-set in S if (c.2) (1) ( p, q P) pq E(S), pqp P; (2) ( a S) ( a+ V(a)) aP1a+, a+P1a P. In this case, (S,P) forms a P-regular semigroup, innotation S(P). The element a+ in(c.2) (2) is called a P-inverse of a. The set of all P-inverses of a is denoted by VP(a). S(P) is said to bestrongly, meanwhile P is called a strong C-set in S, ifVP(p) P for all p P. A partial groupoid E as well as its partial subgroupoid Pforms a P-regular partial band and is denoted by E(P) if itis exactly the subalgebra of the idempotents in some P-regularsemigroup S(P). In this case, S(P) is called an adjacentsemigroup E(P). All P-regular partial bands are obtained inZhang and He［4］.
Counting colorings of a regular graph
Galvin, David
2012-01-01
At most how many (proper) q-colorings does a regular graph admit? Galvin and Tetali conjectured that among all n-vertex, d-regular graphs with 2d|n, none admits more q-colorings than the disjoint union of n/2d copies of the complete bipartite graph K_{d,d}. In this note we give asymptotic evidence for this conjecture, giving an upper bound on the number of proper q-colorings admitted by an n-vertex, d-regular graph of the form a^n b^{n(1+o(1))/d} (where a and b depend on q and where o(1) goes to 0 as d goes to infinity) that agrees up to the o(1) term with the count of q-colorings of n/2d copies of K_{d,d}. An auxiliary result is an upper bound on the number of colorings of a regular graph in terms of its independence number. For example, we show that for all even q and fixed \\epsilon > 0 there is \\delta=\\delta(\\epsilon,q) such that the number of proper q-colorings admitted by an n-vertex, d-regular graph with no independent set of size n(1-\\epsilon)/2 is at most (a-\\delta)^n.
Modified sparse regularization for electrical impedance tomography.
Fan, Wenru; Wang, Huaxiang; Xue, Qian; Cui, Ziqiang; Sun, Benyuan; Wang, Qi
2016-03-01
Electrical impedance tomography (EIT) aims to estimate the electrical properties at the interior of an object from current-voltage measurements on its boundary. It has been widely investigated due to its advantages of low cost, non-radiation, non-invasiveness, and high speed. Image reconstruction of EIT is a nonlinear and ill-posed inverse problem. Therefore, regularization techniques like Tikhonov regularization are used to solve the inverse problem. A sparse regularization based on L1 norm exhibits superiority in preserving boundary information at sharp changes or discontinuous areas in the image. However, the limitation of sparse regularization lies in the time consumption for solving the problem. In order to further improve the calculation speed of sparse regularization, a modified method based on separable approximation algorithm is proposed by using adaptive step-size and preconditioning technique. Both simulation and experimental results show the effectiveness of the proposed method in improving the image quality and real-time performance in the presence of different noise intensities and conductivity contrasts.
Regular Expression Matching and Operational Semantics
Asiri Rathnayake
2011-08-01
Full Text Available Many programming languages and tools, ranging from grep to the Java String library, contain regular expression matchers. Rather than first translating a regular expression into a deterministic finite automaton, such implementations typically match the regular expression on the fly. Thus they can be seen as virtual machines interpreting the regular expression much as if it were a program with some non-deterministic constructs such as the Kleene star. We formalize this implementation technique for regular expression matching using operational semantics. Specifically, we derive a series of abstract machines, moving from the abstract definition of matching to increasingly realistic machines. First a continuation is added to the operational semantics to describe what remains to be matched after the current expression. Next, we represent the expression as a data structure using pointers, which enables redundant searches to be eliminated via testing for pointer equality. From there, we arrive both at Thompson's lockstep construction and a machine that performs some operations in parallel, suitable for implementation on a large number of cores, such as a GPU. We formalize the parallel machine using process algebra and report some preliminary experiments with an implementation on a graphics processor using CUDA.
Regularities, Natural Patterns and Laws of Nature
Stathis Psillos
2014-02-01
Full Text Available The goal of this paper is to sketch an empiricist metaphysics of laws of nature. The key idea is that there are regularities without regularity-enforcers. Differently put, there are natural laws without law-makers of a distinct metaphysical kind. This sketch will rely on the concept of a natural pattern and more significantly on the existence of a network of natural patterns in nature. The relation between a regularity and a pattern will be analysed in terms of mereology. Here is the road map. In section 2, I will briefly discuss the relation between empiricism and metaphysics, aiming to show that an empiricist metaphysics is possible. In section 3, I will offer arguments against stronger metaphysical views of laws. Then, in section 4 I will motivate nomic objectivism. In section 5, I will address the question ‘what is a regularity?’ and will develop a novel answer to it, based on the notion of a natural pattern. In section 6, I will raise the question: ‘what is a law of nature?’, the answer to which will be: a law of nature is a regularity that is characterised by the unity of a natural pattern.
Mining High Utility Itemsets with Regular Occurrence
Komate Amphawan
2016-09-01
Full Text Available High utility itemset mining (HUIM plays an important role in the data mining community and in a wide range of applications. For example, in retail business it is used for finding sets of sold products that give high profit, low cost, etc. These itemsets can help improve marketing strategies, make promotions/ advertisements, etc. However, since HUIM only considers utility values of items/itemsets, it may not be sufficient to observe product-buying behavior of customers such as information related to “regular purchases of sets of products having a high profit margin”. To address this issue, the occurrence behavior of itemsets (in the term of regularity simultaneously with their utility values was investigated. Then, the problem of mining high utility itemsets with regular occurrence (MHUIR to find sets of co-occurrence items with high utility values and regular occurrence in a database was considered. An efficient single-pass algorithm, called MHUIRA, was introduced. A new modified utility-list structure, called NUL, was designed to efficiently maintain utility values and occurrence information and to increase the efficiency of computing the utility of itemsets. Experimental studies on real and synthetic datasets and complexity analyses are provided to show the efficiency of MHUIRA combined with NUL in terms of time and space usage for mining interesting itemsets based on regularity and utility constraints.
On a correspondence between regular and non-regular operator monotone functions
Gibilisco, P.; Hansen, Frank; Isola, T.
2009-01-01
We prove the existence of a bijection between the regular and the non-regular operator monotone functions satisfying a certain functional equation. As an application we give a new proof of the operator monotonicity of certain functions related to the Wigner-Yanase-Dyson skew information.......We prove the existence of a bijection between the regular and the non-regular operator monotone functions satisfying a certain functional equation. As an application we give a new proof of the operator monotonicity of certain functions related to the Wigner-Yanase-Dyson skew information....
Shadow of rotating regular black holes
Abdujabbarov, Ahmadjon; Ahmedov, Bobomurat; Ghosh, Sushant G
2016-01-01
We study the shadows cast by the different types of rotating regular black holes viz. Ay\\'on-Beato-Garc\\'ia {(ABG)}, Hayward, and Bardeen. These black holes have in addition to the total mass ($M$) and rotation parameter ($a$), different parameters as electric charge ($Q$), deviation parameter ($g$), and magnetic charge ($g_{*}$), respectively. Interestingly, the size of the shadow is affected by these parameters in addition to the rotation parameter. We found that the radius of the shadow in each case decreases monotonically and the distortion parameter increases when the value of these parameters increase. A comparison with the standard Kerr case is also investigated. We have also studied the influence of the plasma environment around regular black holes to discuss its shadow. The presence of the plasma affects the apparent size of the regular black hole's shadow to be increased due to two effects (i) gravitational redshift of the photons and (ii) radial dependence of plasma density.
Fractional Regularization Term for Variational Image Registration
Rafael Verdú-Monedero
2009-01-01
Full Text Available Image registration is a widely used task of image analysis with applications in many fields. Its classical formulation and current improvements are given in the spatial domain. In this paper a regularization term based on fractional order derivatives is formulated. This term is defined and implemented in the frequency domain by translating the energy functional into the frequency domain and obtaining the Euler-Lagrange equations which minimize it. The new regularization term leads to a simple formulation and design, being applicable to higher dimensions by using the corresponding multidimensional Fourier transform. The proposed regularization term allows for a real gradual transition from a diffusion registration to a curvature registration which is best suited to some applications and it is not possible in the spatial domain. Results with 3D actual images show the validity of this approach.
Obregón, O; Ryan, M P; Obregon, Octavio; Quevedo, Hernando; Ryan, Michael P.
2004-01-01
We construct a family of time and angular dependent, regular S-brane solutions which corresponds to a simple analytical continuation of the Zipoy-Voorhees 4-dimensional vacuum spacetime. The solutions are asymptotically flat and turn out to be free of singularities without requiring a twist in space. They can be considered as the simplest non-singular generalization of the singular S0-brane solution. We analyze the properties of a representative of this family of solutions and show that it resembles to some extent the asymptotic properties of the regular Kerr S-brane. The R-symmetry corresponds, however, to the general Lorentzian symmetry. Several generalizations of this regular solution are derived which include a charged S-brane and an additional dilatonic field.
Robust super-resolution without regularization
Pham, T Q [Canon Information Systems Research Australia, 1 Thomas Holt drive, North Ryde, NSW 2113 (Australia); Vliet, L J v [Quantitative Imaging Group, Department of Imaging Science and Technology, Faculty of Applied Sciences, Delft University of Technology, Lorentzweg 1, 2628 CJ Delft (Netherlands); Schutte, K [Electro-Optics Group, TNO Defence, Security and Safety, PO Box 96864, 2509 JG The Hague (Netherlands)
2008-07-15
Super-resolution restoration is the problem of restoring a high-resolution scene from multiple degraded low-resolution images under motion. Due to imaging blur and noise, this problem is ill-posed. Additional constraints such as smoothness of the solution (i.e. regularization) is often required to obtain a stable solution. While regularizing the cost function is a standard practice in image restoration, we propose a restoration algorithm that does not require this extra regularization term. The robustness of the algorithm is achieved by a robust error norm that does not response to intensity outliers. With the outliers suppressed, our solution behaves similarly to a maximum-likelihood solution under the presence of Gaussian noise. The effectiveness of our algorithm is demonstrated with super-resolution restoration of real infrared image sequences under severe aliasing and intensity outliers.
Implementing regularization implicitly via approximate eigenvector computation
Mahoney, Michael W
2010-01-01
Regularization is a powerful technique for extracting useful information from noisy data. Typically, it is implemented by adding some sort of norm constraint to an objective function and then exactly optimizing the modified objective function. This procedure typically leads to optimization problems that are computationally more expensive than the original problem, a fact that is clearly problematic if one is interested in large-scale applications. On the other hand, a large body of empirical work has demonstrated that heuristics, and in some cases approximation algorithms, developed to speed up computations sometimes have the side-effect of performing regularization implicitly. Thus, we consider the question: What is the regularized optimization objective that an approximation algorithm is exactly optimizing? We address this question in the context of computing approximations to the smallest nontrivial eigenvector of a graph Laplacian; and we consider three random-walk-based procedures: one based on the heat ...
Regularization and Migration Policy in Europe
Philippe de Bruycker
2001-05-01
Full Text Available The following pages present, in a general way, the contents of Regularization of illegal immigrants in the European Union, which includes a comparative synthesis and statistical information for each of the eight countries involved; a description of actions since the beginning of the year 2000; and a systematic analysis of the different categories of foreigners, the types of regularization carried out, and the rules that have governed these actions.In relation to regularization, the author considers the political coherence of the actions taken by the member states as well as how they relate to two ever more crucial aspects of immigration policy –the integration of legal resident immigrants and the fight againstillegal immigration in the context of a control of migratory flows.
Width Distributions for Convex Regular Polyhedra
Finch, Steven R
2011-01-01
The mean width is a measure on three-dimensional convex bodies that enjoys equal status with volume and surface area [Rota]. As the phrase suggests, it is the mean of a probability density f. We verify formulas for mean widths of the regular tetrahedron and the cube. Higher-order moments of f_tetra and f_cube have not been examined until now. Assume that each polyhedron has edges of unit length. We deduce that the mean square width of the regular tetrahedron is 1/3+(3+sqrt(3))/(3*pi) and the mean square width of the cube is 1+4/pi.
Interaction of Regular and Chaotic States
De Pace, A; Weidenmüller, H A
2006-01-01
Modelling the chaotic states in terms of the Gaussian Orthogonal Ensemble of random matrices (GOE), we investigate the interaction of the GOE with regular bound states. The eigenvalues of the latter may or may not be embedded in the GOE spectrum. We derive a generalized form of the Pastur equation for the average Green's function. We use that equation to study the average and the variance of the shift of the regular states, their spreading width, and the deformation of the GOE spectrum non-perturbatively. We compare our results with various perturbative approaches.
Regular transport dynamics produce chaotic travel times.
Villalobos, Jorge; Muñoz, Víctor; Rogan, José; Zarama, Roberto; Johnson, Neil F; Toledo, Benjamín; Valdivia, Juan Alejandro
2014-06-01
In the hope of making passenger travel times shorter and more reliable, many cities are introducing dedicated bus lanes (e.g., Bogota, London, Miami). Here we show that chaotic travel times are actually a natural consequence of individual bus function, and hence of public transport systems more generally, i.e., chaotic dynamics emerge even when the route is empty and straight, stops and lights are equidistant and regular, and loading times are negligible. More generally, our findings provide a novel example of chaotic dynamics emerging from a single object following Newton's laws of motion in a regularized one-dimensional system.
No finite $5$-regular matchstick graph exists
2014-01-01
A graph $G=(V,E)$ is called a unit-distance graph in the plane if there is an injective embedding of $V$ in the plane such that every pair of adjacent vertices are at unit distance apart. If additionally the corresponding edges are non-crossing and all vertices have the same degree $r$ we talk of a regular matchstick graph. Due to Euler's polyhedron formula we have $r\\le 5$. The smallest known $4$-regular matchstick graph is the so called Harborth graph consisting of $52$ vertices. In this ar...
Learning Rates for -Regularized Kernel Classifiers
Hongzhi Tong
2013-01-01
Full Text Available We consider a family of classification algorithms generated from a regularization kernel scheme associated with -regularizer and convex loss function. Our main purpose is to provide an explicit convergence rate for the excess misclassification error of the produced classifiers. The error decomposition includes approximation error, hypothesis error, and sample error. We apply some novel techniques to estimate the hypothesis error and sample error. Learning rates are eventually derived under some assumptions on the kernel, the input space, the marginal distribution, and the approximation error.
Estrada, Ernesto; de la Pena, Jose A.
2013-01-01
Let G be a graph with set of vertices 1,...,n and adjacency matrix A of size nxn. Let d(i,j)=d, we say that f_d:N->N is a d-function on G if for every pair of vertices i,j and k>=d, we have a_ij^(k)=f_d(k). If this function f_d exists on G we say that G is d-walk regular. We prove that G is d-walk regular if and only if for every pair of vertices i,j at distance
Stability of large-area molecular junctions
Akkerman, Hylke B.; Kronemeijer, Auke J.; Harkema, Jan; van Hal, Paul A.; Smits, Edsger C. P.; de Leeuw, Dago M.; Blom, Paul W. M.
The stability of molecular junctions is crucial for any application of molecular electronics. Degradation of molecular junctions when exposed to ambient conditions is regularly observed. In this report the stability of large-area molecular junctions under ambient conditions for more than two years
Toe Structure Stability of Sloping Breakwater
吴中; 嵇才苏
2003-01-01
Based on physical model tests, the rubble mound toe structure stability under the action of both regular and irregular waves is studied. Test results show that wave height and water depth at the toe structure are the most important factors affecting the stability of toe berm stone, and that irregular waves cause greater damage to the toe structure than regular waves. Analyses prove that the Gerding formula agrees better with our test results than the Meer formula. Tests on two different types of main armors also indicate that the shape and composition of the main armor have effect on the stability of the toe structure.
Regular and context-free nominal traces
Mezzetti, Gianluca
2016-01-01
Two kinds of automata are presented, for recognising new classes of regular and context-free nominal languages. We compare their expressive power with analogous proposals in the literature, showing that they express novel classes of languages. Although many properties of classical languages hold ...
Neural Classifier Construction using Regularization, Pruning
Hintz-Madsen, Mads; Hansen, Lars Kai; Larsen, Jan;
1998-01-01
In this paper we propose a method for construction of feed-forward neural classifiers based on regularization and adaptive architectures. Using a penalized maximum likelihood scheme, we derive a modified form of the entropic error measure and an algebraic estimate of the test error. In conjunction...
Deconvolution and Regularization with Toeplitz Matrices
Hansen, Per Christian
2002-01-01
of these discretized deconvolution problems, with emphasis on methods that take the special structure of the matrix into account. Wherever possible, analogies to classical DFT-based deconvolution problems are drawn. Among other things, we present direct methods for regularization with Toeplitz matrices, and we show...
The moduli space of regular stable maps
Robbin, Joel; Salamon, Dietmar; 10.1007/s00209-007-0237-x
2012-01-01
The moduli space of regular stable maps with values in a complex manifold admits naturally the structure of a complex orbifold. Our proof uses the methods of differential geometry rather than algebraic geometry. It is based on Hardy decompositions and Fredholm intersection theory in the loop space of the target manifold.
Regular conformal system for Einstein equations
Choquet-Bruhat, Y.; Novello, M.
1987-06-21
We give a system of partial differential equations satisfied by a metric g conformal to an Einstein metric and by the conformal factor ..omega.., regular system in the sense that it does not contain negative powers of ..omega... We use the ideas of Friedrich but we obtain here a hyperbolic system in the sense of Leray, by a different method.
Optimal Regularizing Effect for Scalar Conservation Laws
Golse, François
2011-01-01
We investigate the regularity of bounded weak solutions of scalar conservation laws with uniformly convex flux in space dimension one, satisfying an entropy condition with entropy production term that is a signed Radon measure. The proof is based on the kinetic formulation of scalar conservation laws and on an interaction estimate in physical space.
Bayesian regularization of diffusion tensor images
Frandsen, Jesper; Hobolth, Asger; Østergaard, Leif;
2007-01-01
several directions. The measured diffusion coefficients and thereby the diffusion tensors are subject to noise, leading to possibly flawed representations of the three dimensional fibre bundles. In this paper we develop a Bayesian procedure for regularizing the diffusion tensor field, fully utilizing...
Regularity of rotational travelling water waves.
Escher, Joachim
2012-04-13
Several recent results on the regularity of streamlines beneath a rotational travelling wave, along with the wave profile itself, will be discussed. The survey includes the classical water wave problem in both finite and infinite depth, capillary waves and solitary waves as well. A common assumption in all models to be discussed is the absence of stagnation points.
Contour Propagation With Riemannian Elasticity Regularization
Bjerre, Troels; Hansen, Mads Fogtmann; Sapru, W.;
2011-01-01
the planning CT onto the rescans and correcting to reflect actual anatomical changes. For deformable registration, a free-form, multi-level, B-spline deformation model with Riemannian elasticity, penalizing non-rigid local deformations, and volumetric changes, was used. Regularization parameters was defined...
NOTE ON REGULAR D-OPTIMAL MATRICES
李乔良
2003-01-01
Let A be aj ×d (0,1) matrix. It is known that ifj = 2k-1is odd, then det(AAT) ≤(j+1)((j+1)d/4j)j; ifj is even, then det(AAT) ≤ (j+1)((j+2)d/4(j+1))j. A is called a regularD-optimal matrix if it satisfies the equality of the above bounds. In this note, it is proved thatifj = 2k - 1 is odd, then A is a regular D-optimal matrix if and only if A is the adjacent matrixof a (2k - 1, k, (j + 1)d/4j)-BIBD; if j ＝ 2k is even, then A is a regular D-optimal matrix ifand only if A can be obtained from the adjacent matrix B of a (2k + 1, k + 1, (j + 2)d/4(j + 1))-BIBD by deleting any one row from B. Three 21 × 42 regular D-optimal matrices, which wereunknown in [11], are also provided.
A Note on Left Regular Semiring
N. Sulochana
2016-08-01
Full Text Available In this paper we have focused on the additive and multiplicative identity „e‟ and determine the additive and multiplicative semigroups. Here we established that, A semiring S in which (S, + and (S, • are left singular semigroups, then S is a left regular semiring. We have framed an example for this proposition by considering a two element set
Tikhonov Regularization and Total Least Squares
Golub, G. H.; Hansen, Per Christian; O'Leary, D. P.
2000-01-01
formulation involves a least squares problem, can be recast in a total least squares formulation suited for problems in which both the coefficient matrix and the right-hand side are known only approximately. We analyze the regularizing properties of this method and demonstrate by a numerical example that...
Creativity Workshops in the Regular Classroom.
Mildrum, Nancy King
2000-01-01
This article describes implementation of a creativity curriculum, Ten Lessons in Creativity, with gifted and typical students in elementary and middle school settings. It discusses creativity instruction as a bridge between gifted and regular education, ways that creativity workshops affirm the highly creative child, creativity and self-esteem,…
Regularization of turbulence - a comprehensive modeling approach
Geurts, B. J.
2011-12-01
Turbulence readily arises in numerous flows in nature and technology. The large number of degrees of freedom of turbulence poses serious challenges to numerical approaches aimed at simulating and controlling such flows. While the Navier-Stokes equations are commonly accepted to precisely describe fluid turbulence, alternative coarsened descriptions need to be developed to cope with the wide range of length and time scales. These coarsened descriptions are known as large-eddy simulations in which one aims to capture only the primary features of a flow, at considerably reduced computational effort. Such coarsening introduces a closure problem that requires additional phenomenological modeling. A systematic approach to the closure problem, know as regularization modeling, will be reviewed. Its application to multiphase turbulent will be illustrated in which a basic regularization principle is enforced to physically consistently approximate momentum and scalar transport. Examples of Leray and LANS-alpha regularization are discussed in some detail, as are compatible numerical strategies. We illustrate regularization modeling to turbulence under the influence of rotation and buoyancy and investigate the accuracy with which particle-laden flow can be represented. A discussion of the numerical and modeling errors incurred will be given on the basis of homogeneous isotropic turbulence.
Coprime factorization for regular linear systems
Curtain, R; Weiss, G; Weiss, M
1996-01-01
Mild sufficient conditions are given for the existence of a doubly coprime factorization of the transfer function of a regular linear system, as well as formulae for such a factorization. The results are illustrated by two examples of delay systems, one of which has infinitely many unstable poles. C
Annotation of regular polysemy and underspecification
Martínez Alonso, Héctor; Pedersen, Bolette Sandford; Bel, Núria
2013-01-01
We present the result of an annotation task on regular polysemy for a series of seman- tic classes or dot types in English, Dan- ish and Spanish. This article describes the annotation process, the results in terms of inter-encoder agreement, and the sense distributions obtained with two methods...
Strategies of Teachers in the Regular Classroom
De Leeuw, Renske Ria; De Boer, Anke Aaltje
2016-01-01
It is known that regular schoolteachers have difficulties in educating students with social, emotional and behavioral difficulties (SEBD), mainly because of their disruptive behavior. In order to manage the disruptive behavior of students with SEBD many advices and strategies are provided in educational literature. However, very little is known…
Strategies of teachers in the regular classroom
de Leeuw, Renske Ria; de Boer, Anke Aaltje
2016-01-01
It is known that regular schoolteachers have difficulties in educating students with social, emotional and behavioral difficulties (SEBD), mainly because of their disruptive behavior. In order to manage the disruptive behavior of students with SEBD many advices and strategies are provided in educati
On the regularity in some variational problems
Ragusa, Maria Alessandra; Tachikawa, Atsushi
2017-01-01
Our main goal is the study some regularity results where are considered estimates in Morrey spaces for the derivatives of local minimizers of variational integrals of the form 𝒜 (u ,Ω )= ∫Ω F (x ,u ,D u ) dx where Ω is a bounded domain in ℝm and the integrand F have some different forms.
Regular-fat dairy and human health
Astrup, Arne; Bradley, Beth H Rice; Brenna, J Thomas;
2016-01-01
to disseminate, explore and discuss the state of the science on the relationship between regular fat dairy products and health, symposia were programmed by dairy industry organizations in Europe and North America at The Eurofed Lipids Congress (2014) in France, The Dairy Nutrition Annual Symposium (2014...
Regular Submanifolds in Conformal Space Qnp
Changxiong NIE; Chuanxi WU
2012-01-01
The authors study the regular submanifolds in the conformal space Qnp and introduce the submanifold theory in the conformal space Qnp.The first variation formula of the Willmore volume functional of pseudo-Riemannian submanifolds in the conformal space Qnp is given.Finally,the conformal isotropic submanifolds in the conformal space Qnp are classified.
On the regularization procedure in classical electrodynamics
Yaremko, Yu
2003-01-01
We consider the self-action problem in classical electrodynamics. A strict geometrical sense of commonly used renormalization of mass is made. A regularization procedure is proposed which relies on energy-momentum and angular momentum balance equations. We correct the expression for angular momentum tensor obtained by us in a previous paper (2002 J. Phys. A: Math. Gen. 35 831).
The canonical controller and its regularity
Willems, Jan C.; Belur, Madhu N.; Anak Agung Julius, A.A.J.; Trentelman, Harry L.
2003-01-01
This paper deals with properties of canonical controllers. We first specify the behavior that they implement. It follows that a canonical controller implements the desired controlled behavior if and only if the desired behavior is implementable. We subsequently investigate the regularity of the cont
Generalisation of Regular and Irregular Morphological Patterns.
Prasada, Sandeep; and Pinker, Steven
1993-01-01
When it comes to explaining English verbs' patterns of regular and irregular generalization, single-network theories have difficulty with the former, rule-only theories with the latter process. Linguistic and psycholinguistic evidence, based on observation during experiments and simulations in morphological pattern generation, independently call…
Output regulation problem for a class of regular hyperbolic systems
Xu, Xiaodong; Dubljevic, Stevan
2016-01-01
This paper investigates the output regulation problem for a class of regular first-order hyperbolic partial differential equation (PDE) systems. A state feedback and an error feedback regulator are considered to force the output of the hyperbolic PDE plant to track a periodic reference trajectory generated by a neutrally stable exosystem. A new explanation is given to extend the results in the literature to solve the regulation problem associated with the first-order hyperbolic PDE systems. Moreover, in order to provide the closed-loop stability condition for the solvability of the regulator problems, the design of stabilising feedback gain and its dual problem design of stabilising output injection gain are considered in this paper. This paper develops an easy method to obtain an adjustable stabilising feedback gain and stabilising output injection gain with the aid of the operator Riccati equation.
Optimal analysis of structures by concepts of symmetry and regularity
Kaveh, Ali
2013-01-01
Optimal analysis is defined as an analysis that creates and uses sparse, well-structured and well-conditioned matrices. The focus is on efficient methods for eigensolution of matrices involved in static, dynamic and stability analyses of symmetric and regular structures, or those general structures containing such components. Powerful tools are also developed for configuration processing, which is an important issue in the analysis and design of space structures and finite element models. Different mathematical concepts are combined to make the optimal analysis of structures feasible. Canonical forms from matrix algebra, product graphs from graph theory and symmetry groups from group theory are some of the concepts involved in the variety of efficient methods and algorithms presented. The algorithms elucidated in this book enable analysts to handle large-scale structural systems by lowering their computational cost, thus fulfilling the requirement for faster analysis and design of future complex systems. The ...
Gravitational Quasinormal Modes of Regular Phantom Black Hole
Jin Li
2017-01-01
Full Text Available We investigate the gravitational quasinormal modes (QNMs for a type of regular black hole (BH known as phantom BH, which is a static self-gravitating solution of a minimally coupled phantom scalar field with a potential. The studies are carried out for three different spacetimes: asymptotically flat, de Sitter (dS, and anti-de Sitter (AdS. In order to consider the standard odd parity and even parity of gravitational perturbations, the corresponding master equations are derived. The QNMs are discussed by evaluating the temporal evolution of the perturbation field which, in turn, provides direct information on the stability of BH spacetime. It is found that in asymptotically flat, dS, and AdS spacetimes the gravitational perturbations have similar characteristics for both odd and even parities. The decay rate of perturbation is strongly dependent on the scale parameter b, which measures the coupling strength between phantom scalar field and the gravity. Furthermore, through the analysis of Hawking radiation, it is shown that the thermodynamics of such regular phantom BH is also influenced by b. The obtained results might shed some light on the quantum interpretation of QNM perturbation.
Liu, Jinzhen; Ling, Lin; Li, Gang
2013-07-01
A Tikhonov regularization method in the inverse problem of electrical impedance tomography (EIT) often results in a smooth distribution reconstruction, with which we can barely make a clear separation between the inclusions and background. The recently popular total variation (TV)regularization method including the lagged diffusivity (LD) method can sharpen the edges, and is robust to noise in a small convergence region. Therefore, in this paper, we propose a novel regularization method combining the Tikhonov and LD regularization methods. Firstly, we clarify the implementation details of the Tikhonov, LD and combined methods in two-dimensional open EIT by performing the current injection and voltage measurement on one boundary of the imaging object. Next, we introduce a weighted parameter to the Tikhonov regularization method aiming to explore the effect of the weighted parameter on the resolution and quality of reconstruction images with the inclusion at different depths. Then, we analyze the performance of these algorithms with noisy data. Finally, we evaluate the effect of the current injection pattern on reconstruction quality and propose a modified current injection pattern.The results indicate that the combined regularization algorithm with stable convergence is able to improve the reconstruction quality with sharp contrast and more robust to noise in comparison to the Tikhonov and LD regularization methods solely. In addition, the results show that the current injection pattern with a bigger driver angle leads to a better reconstruction quality.
ZHANG; Xiaoxia; GUO; Maozheng
2005-01-01
In this paper, it is shown that the regular representation and regular covariant representation of the crossed products A×α G correspond to the twisted multiplicative unitary operators, where A is a Woronowicz C*-algebra acted upon by a discrete group G. Meanwhile, it is also shown that the regular covariant C*-algebra is the Woronowicz C*-algebra which corresponds to a multiplicative unitary. Finally, an explicit description of the multiplicative unitary operator for C(SUq(2))×α Z is given in terms of those of the Woronowicz C*-algebra C(SUq(2)) and the discrete group G.
An analysis of electrical impedance tomography with applications to Tikhonov regularization
Jin, Bangti
2012-01-16
This paper analyzes the continuum model/complete electrode model in the electrical impedance tomography inverse problem of determining the conductivity parameter from boundary measurements. The continuity and differentiability of the forward operator with respect to the conductivity parameter in L p-norms are proved. These analytical results are applied to several popular regularization formulations, which incorporate a priori information of smoothness/sparsity on the inhomogeneity through Tikhonov regularization, for both linearized and nonlinear models. Some important properties, e.g., existence, stability, consistency and convergence rates, are established. This provides some theoretical justifications of their practical usage. © EDP Sciences, SMAI, 2012.
Calibration of the Volatility in Option Pricing Using the Total Variation Regularization
Yu-Hua Zeng
2014-01-01
Full Text Available In market transactions, volatility, which is a very important risk measurement in financial economics, has significantly intimate connection with the future risk of the underlying assets. Identifying the implied volatility is a typical PDE inverse problem. In this paper, based on the total variation regularization strategy, a bivariate total variation regularization model is proposed to estimate the implied volatility. We not only prove the existence of the solution, but also provide the necessary condition of the optimal control problem—Euler-Lagrange equation. The stability and convergence analyses for the proposed approach are also given. Finally, numerical experiments have been carried out to show the effectiveness of the method.
Model regularization for seismic traveltime tomography with an edge-preserving smoothing operator
Zhang, Xiong; Zhang, Jie
2017-03-01
The solutions of the seismic first-arrival traveltime tomography are generally non-unique, and the Tikhonov model regularization for the inversion is commonly used to stabilize the inversion. However, the Tikhonov regularization for traveltime tomography often produces a low-resolution velocity model. To sharpen the velocity edges for the traveltime tomographic results and fit data at the same time, we should apply the edge-preserving concepts to regularize the inversion. In this study, we develop a new model regularization method by introducing an edge-preserving smoothing operator to detect the model edges in traveltime tomography. This edge-preserving smoothing operator is previously used in processing seismic images for enhancing resolution. We design three synthetic velocity models with sharp interfaces and with or without velocity gradients to study the performance of the regularization method with the edge-preserving smoothing operator. The new edge-preserving regularization not only sharpens the model edges but also maintains the smoothness of the velocity gradient in the layer.
White, Jeremy T.; Langevin, Christian D.; Hughes, Joseph D.
2010-01-01
Calibration of highly‐parameterized numerical models typically requires explicit Tikhonovtype regularization to stabilize the inversion process. This regularization can take the form of a preferred parameter values scheme or preferred relations between parameters, such as the preferred equality scheme. The resulting parameter distributions calibrate the model to a user‐defined acceptable level of model‐to‐measurement misfit, and also minimize regularization penalties on the total objective function. To evaluate the potential impact of these two regularization schemes on model predictive ability, a dataset generated from a synthetic model was used to calibrate a highly-parameterized variable‐density SEAWAT model. The key prediction is the length of time a synthetic pumping well will produce potable water. A bi‐objective Pareto analysis was used to explicitly characterize the relation between two competing objective function components: measurement error and regularization error. Results of the Pareto analysis indicate that both types of regularization schemes affect the predictive ability of the calibrated model.
Regularization and Iterative Methods for Monotone Variational Inequalities
Xiubin Xu
2010-01-01
Full Text Available We provide a general regularization method for monotone variational inequalities, where the regularizer is a Lipschitz continuous and strongly monotone operator. We also introduce an iterative method as discretization of the regularization method. We prove that both regularization and iterative methods converge in norm.
Power-law regularities in human language
Mehri, Ali; Lashkari, Sahar Mohammadpour
2016-11-01
Complex structure of human language enables us to exchange very complicated information. This communication system obeys some common nonlinear statistical regularities. We investigate four important long-range features of human language. We perform our calculations for adopted works of seven famous litterateurs. Zipf's law and Heaps' law, which imply well-known power-law behaviors, are established in human language, showing a qualitative inverse relation with each other. Furthermore, the informational content associated with the words ordering, is measured by using an entropic metric. We also calculate fractal dimension of words in the text by using box counting method. The fractal dimension of each word, that is a positive value less than or equal to one, exhibits its spatial distribution in the text. Generally, we can claim that the Human language follows the mentioned power-law regularities. Power-law relations imply the existence of long-range correlations between the word types, to convey an especial idea.
Towards lattice-regularized Quantum Gravity
Diakonov, Dmitri
2011-01-01
Using the Cartan formulation of General Relativity, we construct a well defined lattice-regularized theory capable to describe large non-perturbative quantum fluctuations of the frame field (or the metric) and of the spin connection. To that end we need to present the tetrad by a composite field built as a bilinear combination of fermion fields. The theory is explicitly invariant under local Lorentz transformations and, in the continuum limit, under general covariant transformations, or diffeomorphisms. Being well defined for large and fast varying fields at the ultraviolet cutoff, the theory simultaneously has chances of reproducing standard General Relativity in the infrared continuum limit. The present regularization of quantum gravity opens new possibilities of its unification with the Standard Model.
Basic analysis of regularized series and products
Jorgenson, Jay A
1993-01-01
Analytic number theory and part of the spectral theory of operators (differential, pseudo-differential, elliptic, etc.) are being merged under amore general analytic theory of regularized products of certain sequences satisfying a few basic axioms. The most basic examples consist of the sequence of natural numbers, the sequence of zeros with positive imaginary part of the Riemann zeta function, and the sequence of eigenvalues, say of a positive Laplacian on a compact or certain cases of non-compact manifolds. The resulting theory is applicable to ergodic theory and dynamical systems; to the zeta and L-functions of number theory or representation theory and modular forms; to Selberg-like zeta functions; andto the theory of regularized determinants familiar in physics and other parts of mathematics. Aside from presenting a systematic account of widely scattered results, the theory also provides new results. One part of the theory deals with complex analytic properties, and another part deals with Fourier analys...
Extreme values, regular variation and point processes
Resnick, Sidney I
1987-01-01
Extremes Values, Regular Variation and Point Processes is a readable and efficient account of the fundamental mathematical and stochastic process techniques needed to study the behavior of extreme values of phenomena based on independent and identically distributed random variables and vectors It presents a coherent treatment of the distributional and sample path fundamental properties of extremes and records It emphasizes the core primacy of three topics necessary for understanding extremes the analytical theory of regularly varying functions; the probabilistic theory of point processes and random measures; and the link to asymptotic distribution approximations provided by the theory of weak convergence of probability measures in metric spaces The book is self-contained and requires an introductory measure-theoretic course in probability as a prerequisite Almost all sections have an extensive list of exercises which extend developments in the text, offer alternate approaches, test mastery and provide for enj...
Tracking magnetogram proper motions by multiscale regularization
Jones, Harrison P.
1995-01-01
Long uninterrupted sequences of solar magnetograms from the global oscillations network group (GONG) network and from the solar and heliospheric observatory (SOHO) satellite will provide the opportunity to study the proper motions of magnetic features. The possible use of multiscale regularization, a scale-recursive estimation technique which begins with a prior model of how state variables and their statistical properties propagate over scale. Short magnetogram sequences are analyzed with the multiscale regularization algorithm as applied to optical flow. This algorithm is found to be efficient, provides results for all the spatial scales spanned by the data and provides error estimates for the solutions. It is found that the algorithm is less sensitive to evolutionary changes than correlation tracking.
Chiral Perturbation Theory With Lattice Regularization
Ouimet, P P A
2005-01-01
In this work, alternative methods to regularize chiral perturbation theory are discussed. First, Long Distance Regularization will be considered in the presence of the decuplet of the lightest spin 32 baryons for several different observables. This serves motivation and introduction to the use of the lattice regulator for chiral perturbation theory. The mesonic, baryonic and anomalous sectors of chiral perturbation theory will be formulated on a lattice of space time points. The consistency of the lattice as a regulator will be discussed in the context of the meson and baryon masses. Order a effects will also be discussed for the baryon masses, sigma terms and magnetic moments. The work will close with an attempt to derive an effective Wess-Zumino-Witten Lagrangian for Wilson fermions at non-zero a. Following this discussion, there will be a proposal for a phenomenologically useful WZW Lagrangian at non-zero a.
Testing the Equivalence of Regular Languages
Marco Almeida
2009-07-01
Full Text Available The minimal deterministic finite automaton is generally used to determine regular languages equality. Antimirov and Mosses proposed a rewrite system for deciding regular expressions equivalence of which Almeida et al. presented an improved variant. Hopcroft and Karp proposed an almost linear algorithm for testing the equivalence of two deterministic finite automata that avoids minimisation. In this paper we improve the best-case running time, present an extension of this algorithm to non-deterministic finite automata, and establish a relationship between this algorithm and the one proposed in Almeida et al. We also present some experimental comparative results. All these algorithms are closely related with the recent coalgebraic approach to automata proposed by Rutten.
Least square regularized regression in sum space.
Xu, Yong-Li; Chen, Di-Rong; Li, Han-Xiong; Liu, Lu
2013-04-01
This paper proposes a least square regularized regression algorithm in sum space of reproducing kernel Hilbert spaces (RKHSs) for nonflat function approximation, and obtains the solution of the algorithm by solving a system of linear equations. This algorithm can approximate the low- and high-frequency component of the target function with large and small scale kernels, respectively. The convergence and learning rate are analyzed. We measure the complexity of the sum space by its covering number and demonstrate that the covering number can be bounded by the product of the covering numbers of basic RKHSs. For sum space of RKHSs with Gaussian kernels, by choosing appropriate parameters, we tradeoff the sample error and regularization error, and obtain a polynomial learning rate, which is better than that in any single RKHS. The utility of this method is illustrated with two simulated data sets and five real-life databases.
Effort variation regularization in sound field reproduction
Stefanakis, Nick; Jacobsen, Finn; Sarris, Ioannis
2010-01-01
. Specifically, it is suggested that the phase differential of the source driving signals should be in agreement with the phase differential of the desired sound pressure field. The performance of the suggested method is compared with that of conventional effort regularization, wave field synthesis (WFS......In this paper, active control is used in order to reproduce a given sound field in an extended spatial region. A method is proposed which minimizes the reproduction error at a number of control positions with the reproduction sources holding a certain relation within their complex strengths......), and adaptive wave field synthesis (AWFS), both under free-field conditions and in reverberant rooms. It is shown that effort variation regularization overcomes the problems associated with small spaces and with a low ratio of direct to reverberant energy, improving thus the reproduction accuracy...
Totally Corrective Boosting for Regularized Risk Minimization
Shen, Chunhua; Barnes, Nick
2010-01-01
Consideration of the primal and dual problems together leads to important new insights into the characteristics of boosting algorithms. In this work, we propose a general framework that can be used to design new boosting algorithms. A wide variety of machine learning problems essentially minimize a regularized risk functional. We show that the proposed boosting framework, termed CGBoost, can accommodate various loss functions and different regularizers in a totally-corrective optimization fashion. We show that, by solving the primal rather than the dual, a large body of totally-corrective boosting algorithms can actually be efficiently solved and no sophisticated convex optimization solvers are needed. We also demonstrate that some boosting algorithms like AdaBoost can be interpreted in our framework--even their optimization is not totally corrective. We empirically show that various boosting algorithms based on the proposed framework perform similarly on the UCIrvine machine learning datasets [1] that we hav...
Nesterenko, Mikhail
2009-01-01
We define and explore the concept of ideal stabilization. The program is ideally stabilizing if its every state is legitimate. Ideal stabilization allows the specification designer to prescribe with arbitrary degree of precision not only the fault-free program behavior but also its recovery operation. Specifications may or may not mention all possible states. We identify approaches to designing ideal stabilization to both kinds of specifications. For the first kind, we state the necessary condition for an ideally stabilizing solution. On the basis of this condition we prove that there is no ideally stabilizing solution to the leader election problem. We illustrate the utility of the concept by providing examples of well-known programs and proving them ideally stabilizing. Specifically, we prove ideal stabilization of the conflict manager, the alternator, the propagation of information with feedback and the alternating bit protocol.
Regular black hole in three dimensions
Myung, Yun Soo; Yoon, Myungseok
2008-01-01
We find a new black hole in three dimensional anti-de Sitter space by introducing an anisotropic perfect fluid inspired by the noncommutative black hole. This is a regular black hole with two horizons. We compare thermodynamics of this black hole with that of non-rotating BTZ black hole. The first-law of thermodynamics is not compatible with the Bekenstein-Hawking entropy.
A short proof of increased parabolic regularity
Stephen Pankavich
2015-08-01
Full Text Available We present a short proof of the increased regularity obtained by solutions to uniformly parabolic partial differential equations. Though this setting is fairly introductory, our new method of proof, which uses a priori estimates and an inductive method, can be extended to prove analogous results for problems with time-dependent coefficients, advection-diffusion or reaction diffusion equations, and nonlinear PDEs even when other tools, such as semigroup methods or the use of explicit fundamental solutions, are unavailable.
Regular aspirin use and lung cancer risk
Cummings K
2002-11-01
Full Text Available Abstract Background Although a large number of epidemiological studies have examined the role of aspirin in the chemoprevention of colon cancer and other solid tumors, there is a limited body of research focusing on the association between aspirin and lung cancer risk. Methods We conducted a hospital-based case-control study to evaluate the role of regular aspirin use in lung cancer etiology. Study participants included 868 cases with primary, incident lung cancer and 935 hospital controls with non-neoplastic conditions who completed a comprehensive epidemiological questionnaire. Participants were classified as regular aspirin users if they had taken the drug at least once a week for at least one year. Results Results indicated that lung cancer risk was significantly lower for aspirin users compared to non-users (adjusted OR = 0.57; 95% CI 0.41–0.78. Although there was no clear evidence of a dose-response relationship, we observed risk reductions associated with greater frequency of use. Similarly, prolonged duration of use and increasing tablet years (tablets per day × years of use was associated with reduced lung cancer risk. Risk reductions were observed in both sexes, but significant dose response relationships were only seen among male participants. When the analyses were restricted to former and current smokers, participants with the lowest cigarette exposure tended to benefit most from the potential chemopreventive effect of aspirin. After stratification by histology, regular aspirin use was significantly associated with reduced risk of small cell lung cancer and non-small cell lung cancer. Conclusions Overall, results from this hospital-based case-control study suggest that regular aspirin use may be associated with reduced risk of lung cancer.
Bouncing cosmology inspired by regular black holes
Neves, J. C. S.
2017-09-01
In this article, we present a bouncing cosmology inspired by a family of regular black holes. This scale-dependent cosmology deviates from the cosmological principle by means of a scale factor which depends on the time and the radial coordinate as well. The model is isotropic but not perfectly homogeneous. That is, this cosmology describes a universe almost homogeneous only for large scales, such as our observable universe.
Regular black hole in three dimensions
Myung, Yun Soo; Yoon, Myungseok
2008-01-01
We find a new black hole in three dimensional anti-de Sitter space by introducing an anisotropic perfect fluid inspired by the noncommutative black hole. This is a regular black hole with two horizons. We compare thermodynamics of this black hole with that of non-rotating BTZ black hole. The first-law of thermodynamics is not compatible with the Bekenstein-Hawking entropy.
Stream Processing Using Grammars and Regular Expressions
Rasmussen, Ulrik Terp
Kleenex, a language for expressing high-performance streaming string processing programs as regular grammars with embedded semantic actions, and its compilation to streaming string transducers with worst-case linear-time performance. Its underlying theory is based on transducer decomposition into oracle...... is based on a bottom-up tabulation algorithm reformulated using least fixed points and evaluated using an instance of the chaotic iteration scheme by Cousot and Cousot....
Sparse regularization for force identification using dictionaries
Qiao, Baijie; Zhang, Xingwu; Wang, Chenxi; Zhang, Hang; Chen, Xuefeng
2016-04-01
The classical function expansion method based on minimizing l2-norm of the response residual employs various basis functions to represent the unknown force. Its difficulty lies in determining the optimum number of basis functions. Considering the sparsity of force in the time domain or in other basis space, we develop a general sparse regularization method based on minimizing l1-norm of the coefficient vector of basis functions. The number of basis functions is adaptively determined by minimizing the number of nonzero components in the coefficient vector during the sparse regularization process. First, according to the profile of the unknown force, the dictionary composed of basis functions is determined. Second, a sparsity convex optimization model for force identification is constructed. Third, given the transfer function and the operational response, Sparse reconstruction by separable approximation (SpaRSA) is developed to solve the sparse regularization problem of force identification. Finally, experiments including identification of impact and harmonic forces are conducted on a cantilever thin plate structure to illustrate the effectiveness and applicability of SpaRSA. Besides the Dirac dictionary, other three sparse dictionaries including Db6 wavelets, Sym4 wavelets and cubic B-spline functions can also accurately identify both the single and double impact forces from highly noisy responses in a sparse representation frame. The discrete cosine functions can also successfully reconstruct the harmonic forces including the sinusoidal, square and triangular forces. Conversely, the traditional Tikhonov regularization method with the L-curve criterion fails to identify both the impact and harmonic forces in these cases.
Computational Topology for Regular Closed Sets
project, The I-TANGO; :; Peters, T J; Bisceglio, J.; Ferguson, D. R.; Hoffmann, C.M.; Maekawa, T.; Patrikalakis, N.M.; Sakkalis, T.; N F Stewart
2004-01-01
The Boolean algebra of regular closed sets is prominent in topology, particularly as a dual for the Stone-Cech compactification. This algebra is also central for the theory of geometric computation, as a representation for combinatorial operations on geometric sets. However, the issue of computational approximation introduces unresolved subtleties that do not occur within "pure" topology. One major effort towards reconciling this mathematical theory with computational practice is our ongoing ...
Hyperspectral Image Recovery via Hybrid Regularization
Arablouei, Reza; de Hoog, Frank
2016-12-01
Natural images tend to mostly consist of smooth regions with individual pixels having highly correlated spectra. This information can be exploited to recover hyperspectral images of natural scenes from their incomplete and noisy measurements. To perform the recovery while taking full advantage of the prior knowledge, we formulate a composite cost function containing a square-error data-fitting term and two distinct regularization terms pertaining to spatial and spectral domains. The regularization for the spatial domain is the sum of total-variation of the image frames corresponding to all spectral bands. The regularization for the spectral domain is the l1-norm of the coefficient matrix obtained by applying a suitable sparsifying transform to the spectra of the pixels. We use an accelerated proximal-subgradient method to minimize the formulated cost function. We analyze the performance of the proposed algorithm and prove its convergence. Numerical simulations using real hyperspectral images exhibit that the proposed algorithm offers an excellent recovery performance with a number of measurements that is only a small fraction of the hyperspectral image data size. Simulation results also show that the proposed algorithm significantly outperforms an accelerated proximal-gradient algorithm that solves the classical basis-pursuit denoising problem to recover the hyperspectral image.
Charge-regularization effects on polyelectrolytes
Muthukumar, Murugappan
2012-02-01
When electrically charged macromolecules are dispersed in polar solvents, their effective net charge is generally different from their chemical charges, due to competition between counterion adsorption and the translational entropy of dissociated counterions. The effective charge changes significantly as the experimental conditions change such as variations in solvent quality, temperature, and the concentration of added small electrolytes. This charge-regularization effect leads to major difficulties in interpreting experimental data on polyelectrolyte solutions and challenges in understanding the various polyelectrolyte phenomena. Even the most fundamental issue of experimental determination of molar mass of charged macromolecules by light scattering method has been difficult so far due to this feature. We will present a theory of charge-regularization of flexible polyelectrolytes in solutions and discuss the consequences of charge-regularization on (a) experimental determination of molar mass of polyelectrolytes using scattering techniques, (b) coil-globule transition, (c) macrophase separation in polyelectrolyte solutions, (c) phase behavior in coacervate formation, and (d) volume phase transitions in polyelectrolyte gels.
Regularization Parameter Selections via Generalized Information Criterion.
Zhang, Yiyun; Li, Runze; Tsai, Chih-Ling
2010-03-01
We apply the nonconcave penalized likelihood approach to obtain variable selections as well as shrinkage estimators. This approach relies heavily on the choice of regularization parameter, which controls the model complexity. In this paper, we propose employing the generalized information criterion (GIC), encompassing the commonly used Akaike information criterion (AIC) and Bayesian information criterion (BIC), for selecting the regularization parameter. Our proposal makes a connection between the classical variable selection criteria and the regularization parameter selections for the nonconcave penalized likelihood approaches. We show that the BIC-type selector enables identification of the true model consistently, and the resulting estimator possesses the oracle property in the terminology of Fan and Li (2001). In contrast, however, the AIC-type selector tends to overfit with positive probability. We further show that the AIC-type selector is asymptotically loss efficient, while the BIC-type selector is not. Our simulation results confirm these theoretical findings, and an empirical example is presented. Some technical proofs are given in the online supplementary material.
High-order regularization in lattice-Boltzmann equations
Mattila, Keijo K.; Philippi, Paulo C.; Hegele, Luiz A.
2017-04-01
A lattice-Boltzmann equation (LBE) is the discrete counterpart of a continuous kinetic model. It can be derived using a Hermite polynomial expansion for the velocity distribution function. Since LBEs are characterized by discrete, finite representations of the microscopic velocity space, the expansion must be truncated and the appropriate order of truncation depends on the hydrodynamic problem under investigation. Here we consider a particular truncation where the non-equilibrium distribution is expanded on a par with the equilibrium distribution, except that the diffusive parts of high-order non-equilibrium moments are filtered, i.e., only the corresponding advective parts are retained after a given rank. The decomposition of moments into diffusive and advective parts is based directly on analytical relations between Hermite polynomial tensors. The resulting, refined regularization procedure leads to recurrence relations where high-order non-equilibrium moments are expressed in terms of low-order ones. The procedure is appealing in the sense that stability can be enhanced without local variation of transport parameters, like viscosity, or without tuning the simulation parameters based on embedded optimization steps. The improved stability properties are here demonstrated using the perturbed double periodic shear layer flow and the Sod shock tube problem as benchmark cases.
Yildiz, Cemil; ABBAS, Fadhil
2011-01-01
The concepts of fuzzy regular-I-closed set and fuzzy semi-I-regular set in fuzzy ideal topological spaces are investigated and some of their properties are obtained. Key words: Topological, Spaces, Fuzzy, Regular, Sets
Yanmin Wang; Guobiao Liang; Zhidong Pan
2010-01-01
A modified regularization algorithm with a more proper operator was proposed for the inversion of partide size distribution(PSD)from light-scattering data in a laser particle sizer based on the Mie scattering principle.The Generalized Cross-Validation(GCV)method and the L-curve method were used for determining the regularization parameter.The Successive Over-Relaxation(SOR)iterative method was used to increase the exactness and stability of the converged result.The simulated results based on the modified algorithm are in a good agreement with the experimental data measured for nine standard particulate samples,their mixtures as well as three natural particulate materials with irregular shapes,indicating that this modified regularization method is not only feasible but also effective for the simulation of PSD from corresponding light-scattering data.
Chen, Xueli; Yang, Defu; Zhang, Qitan; Liang, Jimin
2014-05-01
Even though bioluminescence tomography (BLT) exhibits significant potential and wide applications in macroscopic imaging of small animals in vivo, the inverse reconstruction is still a tough problem that has plagued researchers in a related area. The ill-posedness of inverse reconstruction arises from insufficient measurements and modeling errors, so that the inverse reconstruction cannot be solved directly. In this study, an l1/2 regularization based numerical method was developed for effective reconstruction of BLT. In the method, the inverse reconstruction of BLT was constrained into an l1/2 regularization problem, and then the weighted interior-point algorithm (WIPA) was applied to solve the problem through transforming it into obtaining the solution of a series of l1 regularizers. The feasibility and effectiveness of the proposed method were demonstrated with numerical simulations on a digital mouse. Stability verification experiments further illustrated the robustness of the proposed method for different levels of Gaussian noise.
Jozwiak, G; Masalska, A; Gotszalk, T; Ritz, I; Steigmann, H
2011-01-01
The problem of an accurate tip radius and shape characterization is very important for determination of surface mechanical and chemical properties on the basis of the scanning probe microscopy measurements. We think that the most favorable methods for this purpose are blind tip reconstruction methods, since they do not need any calibrated characterizers and might be performed on an ordinary SPM setup. As in many other inverse problems also in case of these methods the stability of the solution in presence of vibrational and electronic noise needs application of so called regularization techniques. In this paper the novel regularization technique (Regularized Blind Tip Reconstruction - RBTR) for blind tip reconstruction algorithm is presented. It improves the quality of the solution in presence of isotropic and anisotropic noise. The superiority of our approach is proved on the basis of computer simulations and analysis of images of the Budget Sensors TipCheck calibration standard. In case of characterization ...
Total variation regularization in measurement and image space for PET reconstruction
Burger, M
2014-09-18
© 2014 IOP Publishing Ltd. The aim of this paper is to test and analyse a novel technique for image reconstruction in positron emission tomography, which is based on (total variation) regularization on both the image space and the projection space. We formulate our variational problem considering both total variation penalty terms on the image and on an idealized sinogram to be reconstructed from a given Poisson distributed noisy sinogram. We prove existence, uniqueness and stability results for the proposed model and provide some analytical insight into the structures favoured by joint regularization. For the numerical solution of the corresponding discretized problem we employ the split Bregman algorithm and extensively test the approach in comparison to standard total variation regularization on the image. The numerical results show that an additional penalty on the sinogram performs better on reconstructing images with thin structures.
Convergence and fluctuations of Regularized Tyler estimators
Kammoun, Abla
2015-10-26
This article studies the behavior of regularized Tyler estimators (RTEs) of scatter matrices. The key advantages of these estimators are twofold. First, they guarantee by construction a good conditioning of the estimate and second, being a derivative of robust Tyler estimators, they inherit their robustness properties, notably their resilience to the presence of outliers. Nevertheless, one major problem that poses the use of RTEs in practice is represented by the question of setting the regularization parameter p. While a high value of p is likely to push all the eigenvalues away from zero, it comes at the cost of a larger bias with respect to the population covariance matrix. A deep understanding of the statistics of RTEs is essential to come up with appropriate choices for the regularization parameter. This is not an easy task and might be out of reach, unless one considers asymptotic regimes wherein the number of observations n and/or their size N increase together. First asymptotic results have recently been obtained under the assumption that N and n are large and commensurable. Interestingly, no results concerning the regime of n going to infinity with N fixed exist, even though the investigation of this assumption has usually predated the analysis of the most difficult N and n large case. This motivates our work. In particular, we prove in the present paper that the RTEs converge to a deterministic matrix when n → ∞ with N fixed, which is expressed as a function of the theoretical covariance matrix. We also derive the fluctuations of the RTEs around this deterministic matrix and establish that these fluctuations converge in distribution to a multivariate Gaussian distribution with zero mean and a covariance depending on the population covariance and the parameter.
Regular physical exercise: way to healthy life.
Siddiqui, N I; Nessa, A; Hossain, M A
2010-01-01
Any bodily activity or movement that enhances and maintains overall health and physical fitness is called physical exercise. Habit of regular physical exercise has got numerous benefits. Exercise is of various types such as aerobic exercise, anaerobic exercise and flexibility exercise. Aerobic exercise moves the large muscle groups with alternate contraction and relaxation, forces to deep breath, heart to pump more blood with adequate tissue oxygenation. It is also called cardiovascular exercise. Examples of aerobic exercise are walking, running, jogging, swimming etc. In anaerobic exercise, there is forceful contraction of muscle with stretching, usually mechanically aided and help to build up muscle strength and muscle bulk. Examples are weight lifting, pulling, pushing, sprinting etc. Flexibility exercise is one type of stretching exercise to improve the movements of muscles, joints and ligaments. Walking is a good example of aerobic exercise, easy to perform, safe, effective, does not require any training or equipment and less chance of injury. Regular 30 minutes brisk walking in the morning with 150 minutes per week is a good exercise. Regular exercise improves the cardiovascular status, reduces the risk of cardiac disease, high blood pressure and cerebrovascular disease. It reduces body weight, improves insulin sensitivity, helps in glycemic control, prevents obesity and diabetes mellitus. It is helpful for relieving anxiety, stress, brings a sense of well being and overall physical fitness. Global trend is mechanization, labor savings and leading to epidemic of long term chronic diseases like diabetes mellitus, cardiovascular diseases etc. All efforts should be made to create public awareness promoting physical activity, physically demanding recreational pursuits and providing adequate facilities.
Invariant Regularization of Supersymmetric Chiral Gauge Theory
Suzuki, H
1999-01-01
We present a regularization scheme which respects the supersymmetry and the maximal background gauge covariance in supersymmetric chiral gauge theories. When the anomaly cancellation condition is satisfied, the effective action in the superfield background field method automatically restores the gauge invariance without counterterms. The scheme also provides a background gauge covariant definition of composite operators that is especially useful in analyzing anomalies. We present several applications: The minimal consistent gauge anomaly; the super-chiral anomaly and the superconformal anomaly; as the corresponding anomalous commutators, the Konishi anomaly and an anomalous supersymmetric transformation law of the supercurrent (the ``central extension'' of N=1 supersymmetry algebra) and of the R-current.
Total-variation regularization with bound constraints
Chartrand, Rick [Los Alamos National Laboratory; Wohlberg, Brendt [Los Alamos National Laboratory
2009-01-01
We present a new algorithm for bound-constrained total-variation (TV) regularization that in comparison with its predecessors is simple, fast, and flexible. We use a splitting approach to decouple TV minimization from enforcing the constraints. Consequently, existing TV solvers can be employed with minimal alteration. This also makes the approach straightforward to generalize to any situation where TV can be applied. We consider deblurring of images with Gaussian or salt-and-pepper noise, as well as Abel inversion of radiographs with Poisson noise. We incorporate previous iterative reweighting algorithms to solve the TV portion.
Regularizing mappings of Lévy measures
Barndorff-Nielsen, Ole Eiler; Thorbjørnsen, Steen
2006-01-01
In this paper we introduce and study a regularizing one-to-one mapping from the class of one-dimensional Lévy measures into itself. This mapping appeared implicitly in our previous paper [O.E. Barndorff-Nielsen, S. Thorbjørnsen, A connection between free and classical infinite divisibility, Inf....... Dim. Anal. Quant. Probab. 7 (2004) 573–590], where we introduced a one-to-one mapping from the class of one-dimensional infinitely divisible probability measures into itself. Based on the investigation of in the present paper, we deduce further properties of . In particular it is proved that maps...
Multichannel image regularization using anisotropic geodesic filtering
Grazzini, Jacopo A [Los Alamos National Laboratory
2010-01-01
This paper extends a recent image-dependent regularization approach introduced in aiming at edge-preserving smoothing. For that purpose, geodesic distances equipped with a Riemannian metric need to be estimated in local neighbourhoods. By deriving an appropriate metric from the gradient structure tensor, the associated geodesic paths are constrained to follow salient features in images. Following, we design a generalized anisotropic geodesic filter; incorporating not only a measure of the edge strength, like in the original method, but also further directional information about the image structures. The proposed filter is particularly efficient at smoothing heterogeneous areas while preserving relevant structures in multichannel images.
Homology of powers of regular ideals
2003-01-01
For a commutative ring R with an ideal I, generated by a finite regular sequence, we construct differential graded algebras which provide R-free resolutions of I^s and of R/I^s for s>0 and which generalise the Koszul resolution. We derive these from a certain multiplicative double complex. By means of a Cartan-Eilenberg spectral sequence we express Tor_*^R(R/I,R/I^s) and Tor_*^R(R/I, I^s) in terms of exact sequences and find that they are free as R/I-modules. Except for R/I, their product str...
The regular state in higher order gravity
Cotsakis, Spiros; Kadry, Seifedine; Trachilis, Dimitrios
2016-08-01
We consider the higher-order gravity theory derived from the quadratic Lagrangian R + 𝜖R2 in vacuum as a first-order (ADM-type) system with constraints, and build time developments of solutions of an initial value formulation of the theory. We show that all such solutions, if analytic, contain the right number of free functions to qualify as general solutions of the theory. We further show that any regular analytic solution which satisfies the constraints and the evolution equations can be given in the form of an asymptotic formal power series expansion.
Regular collision of dilatonic inflating branes
Leeper, E; Maartens, R
2005-01-01
We demonstrate that a two brane system with a bulk scalar field driving power-law inflation on the branes has an instability in the radion. We solve for the resulting trajectory of the brane, and find that the instability can lead to collision. Brane quantities such as the scale factor are shown to be regular at this collision. In addition we describe the system using a low energy expansion. The low energy expansion accurately reproduces the known exact solution, but also identifies an alternative solution for the bulk metric and brane trajectory.
Limit cycle walking on a regularized ground
Jacobs, Henry O
2012-01-01
The singular nature of contact problems, such as walking, makes them difficult to analyze mathematically. In this paper we will "regularize" the contact problem of walking by approximating the ground with a smooth repulsive potential energy and a smooth dissipative friction force. Using this model we are able to prove the existence of a limit cycle for a periodically perturbed system which consists of three masses connected by springs. In particular, this limit cycle exists in a symmetry reduced phase. In the unreduced phase space, the motion of the masses resembles walking.
Two-pass greedy regular expression parsing
Grathwohl, Niels Bjørn Bugge; Henglein, Fritz; Nielsen, Lasse;
2013-01-01
We present new algorithms for producing greedy parses for regular expressions (REs) in a semi-streaming fashion. Our lean-log algorithm executes in time O(mn) for REs of size m and input strings of size n and outputs a compact bit-coded parse tree representation. It improves on previous algorithms......-based prototype indicates that the superior performance of our lean-log algorithm can also be observed in practice; it is also surprisingly competitive with RE tools not performing full parsing, such as Grep....
Accretion onto some well-known regular black holes
Jawad, Abdul; Shahzad, M.U. [COMSATS Institute of Information Technology, Department of Mathematics, Lahore (Pakistan)
2016-03-15
In this work, we discuss the accretion onto static spherically symmetric regular black holes for specific choices of the equation of state parameter. The underlying regular black holes are charged regular black holes using the Fermi-Dirac distribution, logistic distribution, nonlinear electrodynamics, respectively, and Kehagias-Sftesos asymptotically flat regular black holes. We obtain the critical radius, critical speed, and squared sound speed during the accretion process near the regular black holes. We also study the behavior of radial velocity, energy density, and the rate of change of the mass for each of the regular black holes. (orig.)
Accretion onto Some Well-Known Regular Black Holes
Jawad, Abdul
2016-01-01
In this work, we discuss the accretion onto static spherical symmetric regular black holes for specific choices of equation of state parameter. The underlying regular black holes are charged regular black hole using Fermi-Dirac Distribution, logistic distribution, nonlinear electrodynamics, respectively and Kehagias-Sftesos asymptotically flat regular black hole. We obtain the critical radius, critical speed and squared sound speed during the accretion process near the regular black holes. We also study the behavior of radial velocity, energy density and rate of change of mass for each regular black holes.
Comparison of Synchronization Ability of Four Types of Regular Coupled Networks
WANG Hai-Xia; LU Qi-Shao; SHI Xia
2012-01-01
We investigate the synchronization ability of four types of regular coupled networks. By introducing the proper error variables and Lyapunov functions, we turn the stability of synchronization manifold into that of null solution of error equations, further, into the negative definiteness of some symmetric matrices, thus we get the sufficient synchronization stability conditions. To test the valid of the results, we take the Chua's circuit as an example. Although the theoretical synchronization thresholds appear to be very conservative, they provide new insights about the influence of topology and scale of networks on synchronization, and that the theoretical results and our numerical simulations are consistent.
On Landweber-Kaczmarz methods for regularizing systems of ill-posed equations in Banach spaces
Leitão, A.; Marques Alves, M.
2012-10-01
In this paper, iterative regularization methods of Landweber-Kaczmarz type are considered for solving systems of ill-posed equations modeled (finitely many) by operators acting between Banach spaces. Using assumptions of uniform convexity and smoothness on the parameter space, we are able to prove a monotony result for the proposed method, as well as to establish convergence (for exact data) and stability results (in the noisy data case).
Multiple graph regularized nonnegative matrix factorization
Wang, Jim Jing-Yan
2013-10-01
Non-negative matrix factorization (NMF) has been widely used as a data representation method based on components. To overcome the disadvantage of NMF in failing to consider the manifold structure of a data set, graph regularized NMF (GrNMF) has been proposed by Cai et al. by constructing an affinity graph and searching for a matrix factorization that respects graph structure. Selecting a graph model and its corresponding parameters is critical for this strategy. This process is usually carried out by cross-validation or discrete grid search, which are time consuming and prone to overfitting. In this paper, we propose a GrNMF, called MultiGrNMF, in which the intrinsic manifold is approximated by a linear combination of several graphs with different models and parameters inspired by ensemble manifold regularization. Factorization metrics and linear combination coefficients of graphs are determined simultaneously within a unified object function. They are alternately optimized in an iterative algorithm, thus resulting in a novel data representation algorithm. Extensive experiments on a protein subcellular localization task and an Alzheimer\\'s disease diagnosis task demonstrate the effectiveness of the proposed algorithm. © 2013 Elsevier Ltd. All rights reserved.
Regularized Semiparametric Estimation for Ordinary Differential Equations.
Li, Yun; Zhu, Ji; Wang, Naisyin
2015-07-01
Ordinary differential equations (ODEs) are widely used in modeling dynamic systems and have ample applications in the fields of physics, engineering, economics and biological sciences. The ODE parameters often possess physiological meanings and can help scientists gain better understanding of the system. One key interest is thus to well estimate these parameters. Ideally, constant parameters are preferred due to their easy interpretation. In reality, however, constant parameters can be too restrictive such that even after incorporating error terms, there could still be unknown sources of disturbance that lead to poor agreement between observed data and the estimated ODE system. In this paper, we address this issue and accommodate short-term interferences by allowing parameters to vary with time. We propose a new regularized estimation procedure on the time-varying parameters of an ODE system so that these parameters could change with time during transitions but remain constants within stable stages. We found, through simulation studies, that the proposed method performs well and tends to have less variation in comparison to the non-regularized approach. On the theoretical front, we derive finite-sample estimation error bounds for the proposed method. Applications of the proposed method to modeling the hare-lynx relationship and the measles incidence dynamic in Ontario, Canada lead to satisfactory and meaningful results.
Tomographic laser absorption spectroscopy using Tikhonov regularization.
Guha, Avishek; Schoegl, Ingmar
2014-12-01
The application of tunable diode laser absorption spectroscopy (TDLAS) to flames with nonhomogeneous temperature and concentration fields is an area where only few studies exist. Experimental work explores the performance of tomographic reconstructions of species concentration and temperature profiles from wavelength-modulated TDLAS measurements within the plume of an axisymmetric McKenna burner. Water vapor transitions at 1391.67 and 1442.67 nm are probed using calibration-free wavelength modulation spectroscopy with second harmonic detection (WMS-2f). A single collimated laser beam is swept parallel to the burner surface, where scans yield pairs of line-of-sight (LOS) data at multiple radial locations. Radial profiles of absorption data are reconstructed using Tikhonov regularized Abel inversion, which suppresses the amplification of experimental noise that is typically observed for reconstructions with high spatial resolution. Based on spectral data reconstructions, temperatures and mole fractions are calculated point-by-point. Here, a least-squares approach addresses difficulties due to modulation depths that cannot be universally optimized due to a nonuniform domain. Experimental results show successful reconstructions of temperature and mole fraction profiles based on two-transition, nonoptimally modulated WMS-2f and Tikhonov regularized Abel inversion, and thus validate the technique as a viable diagnostic tool for flame measurements.
Regularized multiple criteria linear programs for classification
SHI Yong; TIAN YingJie; CHEN XiaoJun; ZHANG Peng
2009-01-01
Although multiple criteria mathematical program (MCMP), as an alternative method of classification, has been used in various real-life data mining problems, its mathematical structure of solvability is still challengeable. This paper proposes a regularized multiple criteria linear program (RMCLP) for two classes of classification problems. It first adds some regularization terms in the objective function of the known multiple criteria linear program (MCLP) model for possible existence of solution. Then the paper describes the mathematical framework of the solvability. Finally, a series of experimental tests are conducted to illustrate the performance of the proposed RMCLP with the existing methods: MCLP, multiple criteria quadratic program (MCQP), and support vector machine (SVM). The results of four publicly available datasets and a real-life credit dataset all show that RMCLP is a competitive method in classification. Furthermore, this paper explores an ordinal RMCLP (ORMCLP) model for ordinal multi-group problems. Comparing ORMCLP with traditional methods such as One-Against-One, One-Against-The rest on large-scale credit card dataset, experimental results show that both ORMCLP and RMCLP perform well.
Supporting Regularized Logistic Regression Privately and Efficiently.
Wenfa Li
Full Text Available As one of the most popular statistical and machine learning models, logistic regression with regularization has found wide adoption in biomedicine, social sciences, information technology, and so on. These domains often involve data of human subjects that are contingent upon strict privacy regulations. Concerns over data privacy make it increasingly difficult to coordinate and conduct large-scale collaborative studies, which typically rely on cross-institution data sharing and joint analysis. Our work here focuses on safeguarding regularized logistic regression, a widely-used statistical model while at the same time has not been investigated from a data security and privacy perspective. We consider a common use scenario of multi-institution collaborative studies, such as in the form of research consortia or networks as widely seen in genetics, epidemiology, social sciences, etc. To make our privacy-enhancing solution practical, we demonstrate a non-conventional and computationally efficient method leveraging distributing computing and strong cryptography to provide comprehensive protection over individual-level and summary data. Extensive empirical evaluations on several studies validate the privacy guarantee, efficiency and scalability of our proposal. We also discuss the practical implications of our solution for large-scale studies and applications from various disciplines, including genetic and biomedical studies, smart grid, network analysis, etc.
Supporting Regularized Logistic Regression Privately and Efficiently.
Li, Wenfa; Liu, Hongzhe; Yang, Peng; Xie, Wei
2016-01-01
As one of the most popular statistical and machine learning models, logistic regression with regularization has found wide adoption in biomedicine, social sciences, information technology, and so on. These domains often involve data of human subjects that are contingent upon strict privacy regulations. Concerns over data privacy make it increasingly difficult to coordinate and conduct large-scale collaborative studies, which typically rely on cross-institution data sharing and joint analysis. Our work here focuses on safeguarding regularized logistic regression, a widely-used statistical model while at the same time has not been investigated from a data security and privacy perspective. We consider a common use scenario of multi-institution collaborative studies, such as in the form of research consortia or networks as widely seen in genetics, epidemiology, social sciences, etc. To make our privacy-enhancing solution practical, we demonstrate a non-conventional and computationally efficient method leveraging distributing computing and strong cryptography to provide comprehensive protection over individual-level and summary data. Extensive empirical evaluations on several studies validate the privacy guarantee, efficiency and scalability of our proposal. We also discuss the practical implications of our solution for large-scale studies and applications from various disciplines, including genetic and biomedical studies, smart grid, network analysis, etc.
Supporting Regularized Logistic Regression Privately and Efficiently
Li, Wenfa; Liu, Hongzhe; Yang, Peng; Xie, Wei
2016-01-01
As one of the most popular statistical and machine learning models, logistic regression with regularization has found wide adoption in biomedicine, social sciences, information technology, and so on. These domains often involve data of human subjects that are contingent upon strict privacy regulations. Concerns over data privacy make it increasingly difficult to coordinate and conduct large-scale collaborative studies, which typically rely on cross-institution data sharing and joint analysis. Our work here focuses on safeguarding regularized logistic regression, a widely-used statistical model while at the same time has not been investigated from a data security and privacy perspective. We consider a common use scenario of multi-institution collaborative studies, such as in the form of research consortia or networks as widely seen in genetics, epidemiology, social sciences, etc. To make our privacy-enhancing solution practical, we demonstrate a non-conventional and computationally efficient method leveraging distributing computing and strong cryptography to provide comprehensive protection over individual-level and summary data. Extensive empirical evaluations on several studies validate the privacy guarantee, efficiency and scalability of our proposal. We also discuss the practical implications of our solution for large-scale studies and applications from various disciplines, including genetic and biomedical studies, smart grid, network analysis, etc. PMID:27271738
Regularized Laplace-Fourier-Domain Full Waveform Inversion Using a Weighted l 2 Objective Function
Jun, Hyunggu; Kwon, Jungmin; Shin, Changsoo; Zhou, Hongbo; Cogan, Mike
2016-09-01
Full waveform inversion (FWI) can be applied to obtain an accurate velocity model that contains important geophysical and geological information. FWI suffers from the local minimum problem when the starting model is not sufficiently close to the true model. Therefore, an accurate macroscale velocity model is essential for successful FWI, and Laplace-Fourier-domain FWI is appropriate for obtaining such a velocity model. However, conventional Laplace-Fourier-domain FWI remains an ill-posed and ill-conditioned problem, meaning that small errors in the data can result in large differences in the inverted model. This approach also suffers from certain limitations related to the logarithmic objective function. To overcome the limitations of conventional Laplace-Fourier-domain FWI, we introduce a weighted l 2 objective function, instead of the logarithmic objective function, as the data-domain objective function, and we also introduce two different model-domain regularizations: first-order Tikhonov regularization and prior model regularization. The weighting matrix for the data-domain objective function is constructed to suitably enhance the far-offset information. Tikhonov regularization smoothes the gradient, and prior model regularization allows reliable prior information to be taken into account. Two hyperparameters are obtained through trial and error and used to control the trade-off and achieve an appropriate balance between the data-domain and model-domain gradients. The application of the proposed regularizations facilitates finding a unique solution via FWI, and the weighted l 2 objective function ensures a more reasonable residual, thereby improving the stability of the gradient calculation. Numerical tests performed using the Marmousi synthetic dataset show that the use of the weighted l 2 objective function and the model-domain regularizations significantly improves the Laplace-Fourier-domain FWI. Because the Laplace-Fourier-domain FWI is improved, the
Regularized Laplace-Fourier-Domain Full Waveform Inversion Using a Weighted l 2 Objective Function
Jun, Hyunggu; Kwon, Jungmin; Shin, Changsoo; Zhou, Hongbo; Cogan, Mike
2017-03-01
Full waveform inversion (FWI) can be applied to obtain an accurate velocity model that contains important geophysical and geological information. FWI suffers from the local minimum problem when the starting model is not sufficiently close to the true model. Therefore, an accurate macroscale velocity model is essential for successful FWI, and Laplace-Fourier-domain FWI is appropriate for obtaining such a velocity model. However, conventional Laplace-Fourier-domain FWI remains an ill-posed and ill-conditioned problem, meaning that small errors in the data can result in large differences in the inverted model. This approach also suffers from certain limitations related to the logarithmic objective function. To overcome the limitations of conventional Laplace-Fourier-domain FWI, we introduce a weighted l 2 objective function, instead of the logarithmic objective function, as the data-domain objective function, and we also introduce two different model-domain regularizations: first-order Tikhonov regularization and prior model regularization. The weighting matrix for the data-domain objective function is constructed to suitably enhance the far-offset information. Tikhonov regularization smoothes the gradient, and prior model regularization allows reliable prior information to be taken into account. Two hyperparameters are obtained through trial and error and used to control the trade-off and achieve an appropriate balance between the data-domain and model-domain gradients. The application of the proposed regularizations facilitates finding a unique solution via FWI, and the weighted l 2 objective function ensures a more reasonable residual, thereby improving the stability of the gradient calculation. Numerical tests performed using the Marmousi synthetic dataset show that the use of the weighted l 2 objective function and the model-domain regularizations significantly improves the Laplace-Fourier-domain FWI. Because the Laplace-Fourier-domain FWI is improved, the
The Nature of Stability in Replicating Systems
Addy Pross
2011-02-01
Full Text Available We review the concept of dynamic kinetic stability, a type of stability associated specifically with replicating entities, and show how it differs from the well-known and established (static kinetic and thermodynamic stabilities associated with regular chemical systems. In the process we demonstrate how the concept can help bridge the conceptual chasm that continues to separate the physical and biological sciences by relating the nature of stability in the animate and inanimate worlds, and by providing additional insights into the physicochemical nature of abiogenesis.
COUNTING ROOTED NEAR-4-REGULAR EULERIAN MAPS ON SOME SURFACES
RenHan; LiuYanpei
1999-01-01
In this article the rooted planar near-4-regular Eulerian trails are enumerated and an explicit formula for such maps is presented. Further, the rooted near-4-regular Eulerian maps on the torus are counted in an exact way.
A distance regular graph of type E1 Ed
无
2000-01-01
In this note, the distance regular graph of type E1 Ed is considered and some characterization of the type graph is given. The results generalize the characterization of tight distance regular graphs.
The Penrose singularity theorem in regularity $C^{1,1}$
Kunzinger, Michael; Vickers, James A
2015-01-01
We extend the validity of the Penrose singularity theorem to spacetime metrics of regularity $C^{1,1}$. The proof is based on regularisation techniques, combined with recent results in low regularity causality theory.
On stability of discontinuous systems via vector Lyapunov functions
无
2007-01-01
This paper deals with the stability of systems with discontinuous righthand side (with solutions in Filippov's sense) via locally Lipschitz continuous and regular vector Lyapunov functions. A new type of "set-valued derivative" of vector Lyapunov functions is introduced, some generalized comparison principles on dis(c)ontinuous systems are shown. Furthermore, Lyapunov stability theory is developed for a class of discontinuous systems based on locally Lipschitz continuous and regular vector Lyapunov functions.
Laplacian embedded regression for scalable manifold regularization.
Chen, Lin; Tsang, Ivor W; Xu, Dong
2012-06-01
Semi-supervised learning (SSL), as a powerful tool to learn from a limited number of labeled data and a large number of unlabeled data, has been attracting increasing attention in the machine learning community. In particular, the manifold regularization framework has laid solid theoretical foundations for a large family of SSL algorithms, such as Laplacian support vector machine (LapSVM) and Laplacian regularized least squares (LapRLS). However, most of these algorithms are limited to small scale problems due to the high computational cost of the matrix inversion operation involved in the optimization problem. In this paper, we propose a novel framework called Laplacian embedded regression by introducing an intermediate decision variable into the manifold regularization framework. By using ∈-insensitive loss, we obtain the Laplacian embedded support vector regression (LapESVR) algorithm, which inherits the sparse solution from SVR. Also, we derive Laplacian embedded RLS (LapERLS) corresponding to RLS under the proposed framework. Both LapESVR and LapERLS possess a simpler form of a transformed kernel, which is the summation of the original kernel and a graph kernel that captures the manifold structure. The benefits of the transformed kernel are two-fold: (1) we can deal with the original kernel matrix and the graph Laplacian matrix in the graph kernel separately and (2) if the graph Laplacian matrix is sparse, we only need to perform the inverse operation for a sparse matrix, which is much more efficient when compared with that for a dense one. Inspired by kernel principal component analysis, we further propose to project the introduced decision variable into a subspace spanned by a few eigenvectors of the graph Laplacian matrix in order to better reflect the data manifold, as well as accelerate the calculation of the graph kernel, allowing our methods to efficiently and effectively cope with large scale SSL problems. Extensive experiments on both toy and real
Burns, Daniel; Wang, Zuoqin
2008-01-01
In this article we discuss the role of stability functions in geometric invariant theory and apply stability function techniques to problems in toric geometry. In particular we show how one can use these techniques to recover results of Burns-Guillemin-Uribe and Shiffman-Tate-Zelditch on asymptotic properties of sections of holomorphic line bundles over toric varieties.
Adjacent strong edge colorings and total colorings of regular graphs
WOODALL; Douglas; R
2009-01-01
It is conjectured that χas(G) = χt(G) for every k-regular graph G with no C5 component (k 2). This conjecture is shown to be true for many classes of graphs, including: graphs of type 1; 2-regular, 3-regular and (|V (G)| - 2)-regular graphs; bipartite graphs; balanced complete multipartite graphs; k-cubes; and joins of two matchings or cycles.
Completely Regular Semigroups with Generalized Strong Semilattice Decompositions
Xiangzhi Kong; K.P. Shum
2005-01-01
The concept of ρG-strong semilattice of semigroups is introduced. By using this concept, we study Green's relation H on a completely regular semigroup S. Necessary and sufficient conditions for S/H to be a regular band or a right quasi-normal band are obtained. Important results of Petrich and Reilly on regular cryptic semigroups are generalized and enriched. In particular, characterization theorems of regular cryptogroups and normal cryptogroups are obtained.
Regularity properties of a class of hybrid methods
DaxueCHEN; AiguoXIAO
2000-01-01
The existence of spurious steady solutions and period-2 solutions in constant timestep is studied. The concepts of Rill-regularity and R-regularity of a class of hybrid methods for dynamical systems of ordinary differential equations are introduced and studied.Some conditions guaranteeing R-regularity and R-regularity of such methods applied to dynamical systems of ordinary differential equations with some important structures are given.
Invariant Regularization of Supersymmetric Chiral Gauge Theory
Hayashi, T; Okuyama, K; Suzuki, H; Hayashi, Takuya; Ohshima, Yoshihisa; Okuyama, Kiyoshi; Suzuki, Hiroshi
1998-01-01
We formulate a manifestly supersymmetric gauge-covariant regularization of supersymmetric chiral gauge theories. In our scheme, the effective action in the superfield background-field method above one-loop is always supersymmetric and gauge invariant. The gauge anomaly has the covariant form and can emerge only in one-loop diagrams with all the external lines are the background gauge superfield. We also present several illustrative applications in the one-loop approximation: The self-energy part of the chiral multiplet and the gauge multiplet; the super-chiral anomaly and the superconformal anomaly; as the corresponding anomalous commutators, the Konishi anomaly and the anomalous supersymmetric transformation law of the supercurrent (the ``central extension'' of N=1 supersymmetry algebra) and of the R-current.
Generalized equations of state and regular universes
Contreras, Felipe; González, Esteban
2015-01-01
We found non singular solutions for universes filled with a fluid which obey a Generalized Equation of State of the form $P(\\rho)=-A\\rho+\\gamma\\rho^{\\lambda}$. An emergent universe is obtained if $A=1$ and $\\lambda =1/2$. If the matter source is reinterpret as that of a scalar matter field with some potential, the corresponding potential is derived. For a closed universe, an exact bounce solution is found for $A=1/3$ and the same $\\lambda $. We also explore how the composition of theses universes can be interpreted in terms of known fluids. It is of interest to note that accelerated solutions previously found for the late time evolution also represent regular solutions at early times.
Transient Lunar Phenomena: Regularity and Reality
Crotts, Arlin P S
2007-01-01
Transient lunar phenomena (TLPs) have been reported for centuries, but their nature is largely unsettled. A review of TLP reports shows regularities in the observations; a key question is whether this structure is imposed by human observer effects, terrestrial atmospheric effects or processes tied to the lunar surface. I interrogate an extensive TLP catalog to determine if human factors determine the distribution of TLP reports. I divide the sample according to variables which should produce varying results if determining factors involve humans e.g., historical epoch or geographical location of the observer, not reflecting phenomena tied to the lunar surface. Regardless of how we split the ample, the results are similar: ~50% of the reports involve crater Aristarchus nd vicinity, ~16% from Plato, ~6% from other recent, major impacts, plus a few at Grimaldi. Mare Crisium produces a robust signal for three of five averages of up to 7% of the reports (however, Crisium is an extended feature). The consistency in ...
Explicit formulas for regularized products and series
Jorgenson, Jay; Goldfeld, Dorian
1994-01-01
The theory of explicit formulas for regularized products and series forms a natural continuation of the analytic theory developed in LNM 1564. These explicit formulas can be used to describe the quantitative behavior of various objects in analytic number theory and spectral theory. The present book deals with other applications arising from Gaussian test functions, leading to theta inversion formulas and corresponding new types of zeta functions which are Gaussian transforms of theta series rather than Mellin transforms, and satisfy additive functional equations. Their wide range of applications includes the spectral theory of a broad class of manifolds and also the theory of zeta functions in number theory and representation theory. Here the hyperbolic 3-manifolds are given as a significant example.
Generalized equations of state and regular universes
Contreras, F.; Cruz, N.; González, E.
2016-05-01
We found non singular solutions for universes filled with a fluid which obey a Generalized Equation of State of the form P(ρ) = - Aρ + γρλ. An emergent universe is obtained if A =1 and λ = 1/2. If the matter source is reinterpret as that of a scalar matter field with some potential, the corresponding potential is derived. For a closed universe, an exact bounce solution is found for A = 1/3 and the same λ. We also explore how the composition of theses universes ean be interpreted in terms of known fluids. It is of interest to note that accelerated solutions previously found for the late time evolution also represent regular solutions at early times.
Trapping in dendrimers and regular hyperbranched polymers
Wu, Bin; Zhang, Zhongzhi; Chen, Guanrong
2012-01-01
Dendrimers and regular hyperbranched polymers are two classic families of macromolecules, which can be modeled by Cayley trees and Vicsek fractals, respectively. In this paper, we study the trapping problem in Cayley trees and Vicsek fractals with different underlying geometries, focusing on a particular case with a perfect trap located at the central node. For both networks, we derive the exact analytic formulas in terms of the network size for the average trapping time (ATT)---the average of node-to-trap mean first-passage time over the whole networks. The obtained closed-form solutions show that for both Cayley trees and Vicsek fractals, the ATT display quite different scalings with various system sizes, which implies that the underlying structure plays a key role on the efficiency of trapping in polymer networks. Moreover, the dissimilar scalings of ATT may allow to differentiate readily between dendrimers and hyperbranched polymers.
Regularization destriping of remote sensing imagery
R. Basnayake
2017-07-01
Full Text Available We illustrate the utility of variational destriping for ocean color images from both multispectral and hyperspectral sensors. In particular, we examine data from a filter spectrometer, the Visible Infrared Imaging Radiometer Suite (VIIRS on the Suomi National Polar Partnership (NPP orbiter, and an airborne grating spectrometer, the Jet Population Laboratory's (JPL hyperspectral Portable Remote Imaging Spectrometer (PRISM sensor. We solve the destriping problem using a variational regularization method by giving weights spatially to preserve the other features of the image during the destriping process. The target functional penalizes the neighborhood of stripes (strictly, directionally uniform features while promoting data fidelity, and the functional is minimized by solving the Euler–Lagrange equations with an explicit finite-difference scheme. We show the accuracy of our method from a benchmark data set which represents the sea surface temperature off the coast of Oregon, USA. Technical details, such as how to impose continuity across data gaps using inpainting, are also described.
Regularization destriping of remote sensing imagery
Basnayake, Ranil; Bollt, Erik; Tufillaro, Nicholas; Sun, Jie; Gierach, Michelle
2017-07-01
We illustrate the utility of variational destriping for ocean color images from both multispectral and hyperspectral sensors. In particular, we examine data from a filter spectrometer, the Visible Infrared Imaging Radiometer Suite (VIIRS) on the Suomi National Polar Partnership (NPP) orbiter, and an airborne grating spectrometer, the Jet Population Laboratory's (JPL) hyperspectral Portable Remote Imaging Spectrometer (PRISM) sensor. We solve the destriping problem using a variational regularization method by giving weights spatially to preserve the other features of the image during the destriping process. The target functional penalizes the neighborhood of stripes (strictly, directionally uniform features) while promoting data fidelity, and the functional is minimized by solving the Euler-Lagrange equations with an explicit finite-difference scheme. We show the accuracy of our method from a benchmark data set which represents the sea surface temperature off the coast of Oregon, USA. Technical details, such as how to impose continuity across data gaps using inpainting, are also described.
A regularity lemma and twins in words
Axenovich, Maria; Puzynina, Svetlana
2012-01-01
For a word $S$, let $f(S)$ be the largest integer $m$ such that there are two disjoints identical (scattered) subwords of length $m$. Let $f(n, \\Sigma) = \\min \\{f(S): S \\text{is of length} n, \\text{over alphabet} \\Sigma \\}$. Here, it is shown that \\[2f(n, \\{0,1\\}) = n-o(n)\\] using the regularity lemma for words. I.e., any binary word of length $n$ can be split into two identical subwords (referred to as twins) and, perhaps, a remaining subword of length $o(n)$. A similar result is proven for $k$ identical subwords of a word over an alphabet with at most $k$ letters.
Regular phantom black holes as gravitational lenses
Eiroa, Ernesto F
2015-01-01
The distortion of the spacetime structure in the surroundings of black holes affects the trajectories of light rays. As a consequence, black holes can act as gravitational lenses. Observations of type Ia supernovas, show that our Universe is in accelerated expansion. The usual explanation is that the Universe is filled with a negative pressure fluid called dark energy, which accounts for 70 % of its total density, which can be modeled by a self-interacting scalar field with a potential. We consider a class of spherically symmetric regular phantom black holes as gravitational lenses. We study large deflection angles, using the strong deflection limit, corresponding to an asymptotic logarithmic approximation. In this case, photons passing close to the photon sphere of the black hole experiment several loops around it before they emerge towards the observer, giving place to two infinite sets of relativistic images. Within this limit, we find analytical expressions for the positions and the magnifications of thes...
Local orientational mobility in regular hyperbranched polymers
Dolgushev, Maxim; Fürstenberg, Florian; Guérin, Thomas
2016-01-01
We study the dynamics of local bond orientation in regular hyperbranched polymers modeled by Vicsek fractals. The local dynamics is investigated through the temporal autocorrelation functions of single bonds and the corresponding relaxation forms of the complex dielectric susceptibility. We show that the dynamic behavior of single segments depends on their remoteness from the periphery rather than on the size of the whole macromolecule. Remarkably, the dynamics of the core segments (which are most remote from the periphery) shows a scaling behavior that differs from the dynamics obtained after structural average. We analyze the most relevant processes of single segment motion and provide an analytic approximation for the corresponding relaxation times. Furthermore, we describe an iterative method to calculate the orientational dynamics in the case of very large macromolecular sizes.
Vertex-antimagic Labelings of Regular Graphs
Ali AHMAD; Kashif ALI; Martin BA(C)A; Petr KOV(A)(R); Andrea SEMANI(C)OV(A)-FE(N)OV(C)(I)KOV(A)
2012-01-01
Let G =(V,E) be a finite,simple and undirected graph with p vertices and q edges.An (a,d)-vertex-antimagic total labeling of G is a bijection f from V(G).∪E(G) onto the set of consecutive integers 1,2,...,p + q,such that the vertex-weights form an arithmetic progression with the initial term a and difference d,where the vertex-weight of x is the sum of the value f(x) assigned to the vertex x together with all values f(xy) assigned to edges xy incident to x.Such labeling is called super if the smallest possible labels appear on the vertices.In this paper,we study the properties of such labelings and examine their existence for 2r-regular graphs when the difference d is 0,1,...,r + 1.
Regularized canonical correlation analysis with unlabeled data
Xi-chuan ZHOU; Hai-bin SHEN
2009-01-01
In standard canonical correlation analysis (CCA), the data from definite datasets are used to estimate their canonical correlation. In real applications, for example in bilingual text retrieval, it may have a great portion of data that we do not know which set it belongs to. This part of data is called unlabeled data, while the rest from definite datasets is called labeled data. We propose a novel method called regularized canonical correlation analysis (RCCA), which makes use of both labeled and unlabeled samples. Specifically, we learn to approximate canonical correlation as if all data were labeled. Then. we describe a generalization of RCCA for the multi-set situation. Experiments on four real world datasets, Yeast, Cloud, Iris, and Haberman, demonstrate that,by incorporating the unlabeled data points, the accuracy of correlation coefficients can be improved by over 30%.
Robust Clustering Using Outlier-Sparsity Regularization
Forero, Pedro A; Giannakis, Georgios B
2011-01-01
Notwithstanding the popularity of conventional clustering algorithms such as K-means and probabilistic clustering, their clustering results are sensitive to the presence of outliers in the data. Even a few outliers can compromise the ability of these algorithms to identify meaningful hidden structures rendering their outcome unreliable. This paper develops robust clustering algorithms that not only aim to cluster the data, but also to identify the outliers. The novel approaches rely on the infrequent presence of outliers in the data which translates to sparsity in a judiciously chosen domain. Capitalizing on the sparsity in the outlier domain, outlier-aware robust K-means and probabilistic clustering approaches are proposed. Their novelty lies on identifying outliers while effecting sparsity in the outlier domain through carefully chosen regularization. A block coordinate descent approach is developed to obtain iterative algorithms with convergence guarantees and small excess computational complexity with res...
The Anomaly Structure of Regularized Supergravity
Butter, Daniel
2014-01-01
On-shell Pauli-Villars regularization of the one-loop divergences of supergravity theories is used to study the anomaly structure of supergravity and the cancellation of field theory anomalies under a $U(1)$ gauge transformation and under the T-duality group of modular transformations in effective supergravity theories with three K\\"ahler moduli $T^i$ obtained from orbifold compactification of the weakly coupled heterotic string. This procedure requires constraints on the chiral matter representations of the gauge group that are consistent with known results from orbifold compactifications. Pauli-Villars regulator fields allow for the cancellation of all quadratic and logarithmic divergences, as well as most linear divergences. If all linear divergences were canceled, the theory would be anomaly free, with noninvariance of the action arising only from Pauli-Villars masses. However there are linear divergences associated with nonrenormalizable gravitino/gaugino interactions that cannot be canceled by PV fields...
Thermodynamics of regular accelerating black holes
Astorino, Marco
2017-03-01
Using the covariant phase space formalism, we compute the conserved charges for a solution, describing an accelerating and electrically charged Reissner-Nordstrom black hole. The metric is regular provided that the acceleration is driven by an external electric field, in spite of the usual string of the standard C-metric. The Smarr formula and the first law of black hole thermodynamics are fulfilled. The resulting mass has the same form of the Christodoulou-Ruffini irreducible mass. On the basis of these results, we can extrapolate the mass and thermodynamics of the rotating C-metric, which describes a Kerr-Newman-(A)dS black hole accelerated by a pulling string.
Homological Pisot Substitutions and Exact Regularity
Barge, Marcy; Jones, Leslie; Sadun, Lorenzo
2010-01-01
We consider one-dimensional substitution tiling spaces where the dilatation (stretching factor) is a degree d Pisot number, and where the first rational Cech cohomology is d-dimensional. We construct examples of such "homological Pisot" substitutions that do not have pure discrete spectra. These examples are not unimodular, and we conjecture that the coincidence rank must always divide a power of the norm of the dilatation. To support this conjecture, we show that homological Pisot substitutions exhibit an Exact Regularity Property (ERP), in which the number of occurrences of a patch for a return length is governed strictly by the length. The ERP puts strong constraints on the measure of any cylinder set in the corresponding tiling space.
Regularization for Atmospheric Temperature Retrieval Problems
Velez-Reyes, Miguel; Galarza-Galarza, Ruben
1997-01-01
Passive remote sensing of the atmosphere is used to determine the atmospheric state. A radiometer measures microwave emissions from earth's atmosphere and surface. The radiance measured by the radiometer is proportional to the brightness temperature. This brightness temperature can be used to estimate atmospheric parameters such as temperature and water vapor content. These quantities are of primary importance for different applications in meteorology, oceanography, and geophysical sciences. Depending on the range in the electromagnetic spectrum being measured by the radiometer and the atmospheric quantities to be estimated, the retrieval or inverse problem of determining atmospheric parameters from brightness temperature might be linear or nonlinear. In most applications, the retrieval problem requires the inversion of a Fredholm integral equation of the first kind making this an ill-posed problem. The numerical solution of the retrieval problem requires the transformation of the continuous problem into a discrete problem. The ill-posedness of the continuous problem translates into ill-conditioning or ill-posedness of the discrete problem. Regularization methods are used to convert the ill-posed problem into a well-posed one. In this paper, we present some results of our work in applying different regularization techniques to atmospheric temperature retrievals using brightness temperatures measured with the SSM/T-1 sensor. Simulation results are presented which show the potential of these techniques to improve temperature retrievals. In particular, no statistical assumptions are needed and the algorithms were capable of correctly estimating the temperature profile corner at the tropopause independent of the initial guess.
Discriminative Elastic-Net Regularized Linear Regression.
Zhang, Zheng; Lai, Zhihui; Xu, Yong; Shao, Ling; Wu, Jian; Xie, Guo-Sen
2017-03-01
In this paper, we aim at learning compact and discriminative linear regression models. Linear regression has been widely used in different problems. However, most of the existing linear regression methods exploit the conventional zero-one matrix as the regression targets, which greatly narrows the flexibility of the regression model. Another major limitation of these methods is that the learned projection matrix fails to precisely project the image features to the target space due to their weak discriminative capability. To this end, we present an elastic-net regularized linear regression (ENLR) framework, and develop two robust linear regression models which possess the following special characteristics. First, our methods exploit two particular strategies to enlarge the margins of different classes by relaxing the strict binary targets into a more feasible variable matrix. Second, a robust elastic-net regularization of singular values is introduced to enhance the compactness and effectiveness of the learned projection matrix. Third, the resulting optimization problem of ENLR has a closed-form solution in each iteration, which can be solved efficiently. Finally, rather than directly exploiting the projection matrix for recognition, our methods employ the transformed features as the new discriminate representations to make final image classification. Compared with the traditional linear regression model and some of its variants, our method is much more accurate in image classification. Extensive experiments conducted on publicly available data sets well demonstrate that the proposed framework can outperform the state-of-the-art methods. The MATLAB codes of our methods can be available at http://www.yongxu.org/lunwen.html.
Lower bound for the regularity index of fat points
Van Thien, Phan
2016-01-01
The problem to find an upper bound for the regularity index of fat points has been dealt with by many authors. In this paper we give a lower bound for the regularity index of fat points. It is useful for determining the regularity index.
Regular implementation in the space of compactly supported functions
Napp Avelli, D.; Shankar, Shiva; Trentelman, H.L.
2008-01-01
This article extends results on regular implementability in [P. Rocha, Canonical controllers and regular implementation of nd behaviors, in: Proceedings of the 16th IFAC World Congress, 20051 and [H.L. Trentelman, D. Napp Avelli, On the regular implementability of nD systems, Systems Control Lett. 5
On the Lipschitz Regularity in Signal Singularity Detection
LUO Li-chun
2003-01-01
The concepts of Lipschitz regularity and Hlder one are reviewed. They are not equivalent except for α＜1. A modification for Definition 1 on Lipschitz regularity in Ref.[1], which is not rigorous, is offered. Two propositions on Hlder regularity are given and proven.
The Iterated Regularization With Perturbed Operators and Noisy Data
陈宏; 侯宗义
1994-01-01
The method of iterated Tikhonov regularization with perturbed operators and noisy data for solving operators equations of the first kind is investigated. The rates of convergence of regularization approximation are achieved by using generalized Arcangeli’s method for the choice of the regularization parameter.
Brown, Joyceanne; And Others
1991-01-01
This survey of 201 regular education teachers found that the most frequently used prereferral strategies used to facilitate classroom adjustment and achievement were consultation with other professionals, parent conferences, and behavior management techniques. Elementary teachers implemented more strategies than secondary-level teachers.…
Regularity of weak solutions to the Landau-Lifshitz system in bounded regular domains
Kevin Santugini-Repiquet
2007-10-01
Full Text Available In this paper, we study the regularity, on the boundary, of weak solutions to the Landau-Lifshitz system in the framework of the micromagnetic model in the quasi-static approximation. We establish the existence of global weak solutions to the Landau-Lifshitz system whose tangential space gradient on the boundary is square integrable.
STABILIZED NUMERICAL APPROXIMATIONS OF THE BACKWARD PROBLEM OF A PARABOLIC EQUATION
韩厚德; 胡刚
2001-01-01
In this paper, the backward problem ora parabolic equation is considered. Three new stability estimates are given. Based on the new stability estimates, a regularization method is proposed for which error estimates are available. The regularization method can be used for the numerical approximations of the original problem which will be shown by the numerical examples.
无
2011-01-01
"Stable"will be a key word for China’s economy in 2012.That’s the beat set at the annual Central Economic Work Conference held in Beijing on December 12-14,which reviewed this year’s development and mapped out plans for the next year.Policymakers at the conference decided to keep macroeconomic policies stable,seek a stable and relatively fast economic growth,stabilize consumer prices and maintain social stability in 2012.On the basis of stability,the government will transform the development model,deepen reform and improve people’s livelihood.
Online System Identification Method Using Modified Regularized Exponential Forgetting
Ján VACHÁLEK
2013-12-01
Full Text Available The paper deals with the use of regularized exponential forgetting (REF in the process of online system identification. The deployment of this type of forgetting strategy is advantageous for very long runs with small changes in the identified input parameters (in the range of 100 000 steps. In these cases, the classical methods of forgetting, such as an exponential (EF or directional forgetting (DF lack the required quality and reach the limit of numerical stability of the calculations of system parameters, which may lead to the early termination of system identification procedure. To avoid this undesirable effect and maintain sufficient primary information about the identified system, a modified REF method is used that employs alternative covariance matrix (ACM formulation to store the primary information of the identified system (REFACM and prevents the numerical destabilization of the identification process. The quality of the modified REFACM forgetting method —along with its validation and comparison with REZ to verify its properties—is performed using standard tests.
MRI reconstruction with joint global regularization and transform learning.
Tanc, A Korhan; Eksioglu, Ender M
2016-10-01
Sparsity based regularization has been a popular approach to remedy the measurement scarcity in image reconstruction. Recently, sparsifying transforms learned from image patches have been utilized as an effective regularizer for the Magnetic Resonance Imaging (MRI) reconstruction. Here, we infuse additional global regularization terms to the patch-based transform learning. We develop an algorithm to solve the resulting novel cost function, which includes both patchwise and global regularization terms. Extensive simulation results indicate that the introduced mixed approach has improved MRI reconstruction performance, when compared to the algorithms which use either of the patchwise transform learning or global regularization terms alone.
UNI-VECTOR-SENSOR DIRECTION FINDING WITH REGULARIZED ESPRIT
无
2008-01-01
The regularized Least-Squares Estimation method of Signal Parameters via Rotational Invariance Techniques (LS-ESPRIT) is herein proposed for Direction-Of-Arrival (DOA) estimation of non-Gaussian sources with only one acoustic vector-sensor. The Second-Order Statistics (SOS) and Higher-Order Statistics (HOS) of data are fused within a regularization framework. The steering vectors can be blindly identified by the regularized ESPRIT, from which the aim of DOA estimation can be achieved. Several variants of the regularized ESPRIT are discussed. A suboptimal scheme for determination of the regularization parameters is also given.
Iterative implementation of the adaptive regularization yields optimality
MA; Qinghua; WANG; Yanfei
2005-01-01
The adaptive regularization method is first proposed by Ryzhikov et al. for the deconvolution in elimination of multiples. This method is stronger than the Tikhonov regularization in the sense that itis adaptive, i.e. it eliminates the small eigenvalues of theadjoint operator when it is nearly singular. We will show in this paper that the adaptive regularization can be implemented iterately. Some properties of the proposed non-stationary iterated adaptive regularization method are analyzed. The rate of convergence for inexact data is proved. Therefore the iterative implementation of the adaptive regularization can yield optimality.
Regularization of Kepler Problem in $\\kappa$-spacetime
Guha, Partha; S., Zuhair N
2016-01-01
In this paper we regularize the Kepler problem on $\\kappa$-spacetime in several different ways. First, we perform a Moser-type regularization and then we proceed for the Ligon-Schaaf regularization to our problem. In particular, generalizing Heckman-de Laat (J. Symplectic Geom. 10, (2012), 463-473) in the noncommutative context we show that the Ligon-Schaaf regularization map follows from an adaptation of the Moser regularization can be generalized to the Kepler problem on $\\kappa$-spacetime.
Error analysis for matrix elastic-net regularization algorithms.
Li, Hong; Chen, Na; Li, Luoqing
2012-05-01
Elastic-net regularization is a successful approach in statistical modeling. It can avoid large variations which occur in estimating complex models. In this paper, elastic-net regularization is extended to a more general setting, the matrix recovery (matrix completion) setting. Based on a combination of the nuclear-norm minimization and the Frobenius-norm minimization, we consider the matrix elastic-net (MEN) regularization algorithm, which is an analog to the elastic-net regularization scheme from compressive sensing. Some properties of the estimator are characterized by the singular value shrinkage operator. We estimate the error bounds of the MEN regularization algorithm in the framework of statistical learning theory. We compute the learning rate by estimates of the Hilbert-Schmidt operators. In addition, an adaptive scheme for selecting the regularization parameter is presented. Numerical experiments demonstrate the superiority of the MEN regularization algorithm.
Learning rates of lq coefficient regularization learning with gaussian kernel.
Lin, Shaobo; Zeng, Jinshan; Fang, Jian; Xu, Zongben
2014-10-01
Regularization is a well-recognized powerful strategy to improve the performance of a learning machine and l(q) regularization schemes with 0 regularization leads to a smooth estimator, while l(1) regularization leads to a sparse estimator. Then how the generalization capability of l(q) regularization learning varies with q is worthy of investigation. In this letter, we study this problem in the framework of statistical learning theory. Our main results show that implementing l(q) coefficient regularization schemes in the sample-dependent hypothesis space associated with a gaussian kernel can attain the same almost optimal learning rates for all 0 regularization learning are asymptotically identical for all 0 < q < ∞. Our finding tentatively reveals that in some modeling contexts, the choice of q might not have a strong impact on the generalization capability. From this perspective, q can be arbitrarily specified, or specified merely by other nongeneralization criteria like smoothness, computational complexity or sparsity.
Hahonou, Eric Komlavi
international intervention in Niger. Their main objective is to secure their own strategic, economic and political interests by strengthening the Nigerien authorities through direct intervention and capacity building activities. For western states reinforcing state security institutions and stabilizing elite...
Seligmann, Hervé
2015-09-01
During RNA transcription, DNA nucleotides A,C,G, T are usually matched by ribonucleotides A, C, G and U. However occasionally, this rule does not apply: transcript-DNA homologies are detectable only assuming systematic exchanges between ribonucleotides. Nine symmetric (X ↔ Y, e.g. A ↔ C) and fourteen asymmetric (X ↔ Y ↔ Z, e.g. A ↔ C ↔ G) exchanges exist, called swinger transcriptions. Putatively, polymerases occasionally stabilize in unspecified swinger conformations, possibly similar to transient conformations causing punctual misinsertions. This predicts chimeric transcripts, part regular, part swinger-transformed, reflecting polymerases switching to swinger polymerization conformation(s). Four chimeric Genbank transcripts (three from human mitochondrion and one murine cytosolic) are described here: (a) the 5' and 3' extremities reflect regular polymerization, the intervening sequence exchanges systematically between ribonucleotides (swinger rule G ↔ U, transcript (1), with sharp switches between regular and swinger sequences; (b) the 5' half is 'normal', the 3' half systematically exchanges ribonucleotides (swinger rule C ↔ G, transcript (2), with an intercalated sequence lacking homology; (c) the 3' extremity fits A ↔ G exchanges (10% of transcript length), the 5' half follows regular transcription; the intervening region seems a mix of regular and A ↔ G transcriptions (transcript 3); (d) murine cytosolic transcript 4 switches to A ↔ U + C ↔ G, and is fused with A ↔ U + C ↔ G swinger transformed precursor rRNA. In (c), each concomitant transcript 5' and 3' extremities match opposite genome strands. Transcripts 3 and 4 combine transcript fusions with partial swinger transcriptions. Occasional (usually sharp) switches between regular and swinger transcriptions reveal greater coding potential than detected until now, suggest stable polymerase swinger conformations.
Random Matrices and Lyapunov Coefficients Regularity
Gallavotti, Giovanni
2017-02-01
Analyticity and other properties of the largest or smallest Lyapunov exponent of a product of real matrices with a "cone property" are studied as functions of the matrices entries, as long as they vary without destroying the cone property. The result is applied to stability directions, Lyapunov coefficients and Lyapunov exponents of a class of products of random matrices and to dynamical systems. The results are not new and the method is the main point of this work: it is is based on the classical theory of the Mayer series in Statistical Mechanics of rarefied gases.
Bryngelson, Spencer H.; Freund, Jonathan B.
2016-07-01
Elastic capsules flowing in small enough tubes, such as red blood cells in capillaries, are well known to line up into regular single-file trains. The stability of such trains in somewhat wider channels, where this organization is not observed, is studied in a two-dimensional model system that includes full coupling between the viscous flow and suspended capsules. A diverse set of linearly amplifying disturbances, both long-time asymptotic (modal) and transient (nonmodal) perturbations, is identified and analyzed. These have a range of amplification rates and their corresponding forms are wavelike, typically dominated by one of five principal perturbation classes: longitudinal and transverse translations, tilts, and symmetric and asymmetric shape distortions. Finite-amplitude transiently amplifying perturbations are shown to provide a mechanism that can bypass slower asymptotic modal linear growth and precipitate the onset of nonlinear effects. Direct numerical simulations are used to verify the linear analysis and track the subsequent transition of the regular capsule trains into an apparently chaotic flow.
Determinants of Scanpath Regularity in Reading.
von der Malsburg, Titus; Kliegl, Reinhold; Vasishth, Shravan
2015-09-01
Scanpaths have played an important role in classic research on reading behavior. Nevertheless, they have largely been neglected in later research perhaps due to a lack of suitable analytical tools. Recently, von der Malsburg and Vasishth (2011) proposed a new measure for quantifying differences between scanpaths and demonstrated that this measure can recover effects that were missed with the traditional eyetracking measures. However, the sentences used in that study were difficult to process and scanpath effects accordingly strong. The purpose of the present study was to test the validity, sensitivity, and scope of applicability of the scanpath measure, using simple sentences that are typically read from left to right. We derived predictions for the regularity of scanpaths from the literature on oculomotor control, sentence processing, and cognitive aging and tested these predictions using the scanpath measure and a large database of eye movements. All predictions were confirmed: Sentences with short words and syntactically more difficult sentences elicited more irregular scanpaths. Also, older readers produced more irregular scanpaths than younger readers. In addition, we found an effect that was not reported earlier: Syntax had a smaller influence on the eye movements of older readers than on those of young readers. We discuss this interaction of syntactic parsing cost with age in terms of shifts in processing strategies and a decline of executive control as readers age. Overall, our results demonstrate the validity and sensitivity of the scanpath measure and thus establish it as a productive and versatile tool for reading research.
Regularities development of entrepreneurial structures in regions
Julia Semenovna Pinkovetskaya
2012-12-01
Full Text Available Consider regularities and tendencies for the three types of entrepreneurial structures — small enterprises, medium enterprises and individual entrepreneurs. The aim of the research was to confirm the possibilities of describing indicators of aggregate entrepreneurial structures with the use of normal law distribution functions. Presented proposed by the author the methodological approach and results of construction of the functions of the density distribution for the main indicators for the various objects: the Russian Federation, regions, as well as aggregates ofentrepreneurial structures, specialized in certain forms ofeconomic activity. All the developed functions, as shown by the logical and statistical analysis, are of high quality and well-approximate the original data. In general, the proposed methodological approach is versatile and can be used in further studies of aggregates of entrepreneurial structures. The received results can be applied in solving a wide range of problems justify the need for personnel and financial resources at the federal, regional and municipal levels, as well as the formation of plans and forecasts of development entrepreneurship and improvement of this sector of the economy.
Information theoretic regularization in diffuse optical tomography.
Panagiotou, Christos; Somayajula, Sangeetha; Gibson, Adam P; Schweiger, Martin; Leahy, Richard M; Arridge, Simon R
2009-05-01
Diffuse optical tomography (DOT) retrieves the spatially distributed optical characteristics of a medium from external measurements. Recovering the parameters of interest involves solving a nonlinear and highly ill-posed inverse problem. This paper examines the possibility of regularizing DOT via the introduction of a priori information from alternative high-resolution anatomical modalities, using the information theory concepts of mutual information (MI) and joint entropy (JE). Such functionals evaluate the similarity between the reconstructed optical image and the prior image while bypassing the multimodality barrier manifested as the incommensurate relation between the gray value representations of corresponding anatomical features in the two modalities. By introducing structural information, we aim to improve the spatial resolution and quantitative accuracy of the solution. We provide a thorough explanation of the theory from an imaging perspective, accompanied by preliminary results using numerical simulations. In addition we compare the performance of MI and JE. Finally, we have adopted a method for fast marginal entropy evaluation and optimization by modifying the objective function and extending it to the JE case. We demonstrate its use on an image reconstruction framework and show significant computational savings.
Global regularity for minimal sets and counterexamples
Liang, Xiangyu
2011-01-01
We discuss the global regularity for 2 dimensional minimal sets, that is, whether all global minimal sets in $\\R^n$ are cones or not. Every minimal set looks like a minimal cone $C$ at infinity, hence the main point is to use the topological properties of a minimal set at large scale to control its topology at smaller scales. Such arguments depend on the cone $C$, thus we have to discuss them one by one. Recall that this is the idea to prove that 1-dimensional Almgren-minimal sets in $\\R^n$, and 2-dimensional Mumford-Shah minimal sets in $\\R^3$ are cones. In this article we discuss three types of 2-dimensional minimal sets: Almgren-minimal set in $\\R^3$ whose blow-in limit is a $\\T$ set; topological minimal sets in $\\R^4$ whose blow-in limit is a $\\T$ set; and Almgren minimal sets in $\\R^4$ whose blow-in limit is the union $P_\\theta$ of two almost orthogonal planes. For the first one we eliminate an existing potential counterexample that was proposed by several people, and show that a real counterexample shou...
Manifold Regularized Experimental Design for Active Learning.
Zhang, Lining; Shum, Hubert P H; Shao, Ling
2016-12-02
Various machine learning and data mining tasks in classification require abundant data samples to be labeled for training. Conventional active learning methods aim at labeling the most informative samples for alleviating the labor of the user. Many previous studies in active learning select one sample after another in a greedy manner. However, this is not very effective because the classification models has to be retrained for each newly labeled sample. Moreover, many popular active learning approaches utilize the most uncertain samples by leveraging the classification hyperplane of the classifier, which is not appropriate since the classification hyperplane is inaccurate when the training data are small-sized. The problem of insufficient training data in real-world systems limits the potential applications of these approaches. This paper presents a novel method of active learning called manifold regularized experimental design (MRED), which can label multiple informative samples at one time for training. In addition, MRED gives an explicit geometric explanation for the selected samples to be labeled by the user. Different from existing active learning methods, our method avoids the intrinsic problems caused by insufficiently labeled samples in real-world applications. Various experiments on synthetic datasets, the Yale face database and the Corel image database have been carried out to show how MRED outperforms existing methods.
Sparsity-regularized HMAX for visual recognition.
Xiaolin Hu
Full Text Available About ten years ago, HMAX was proposed as a simple and biologically feasible model for object recognition, based on how the visual cortex processes information. However, the model does not encompass sparse firing, which is a hallmark of neurons at all stages of the visual pathway. The current paper presents an improved model, called sparse HMAX, which integrates sparse firing. This model is able to learn higher-level features of objects on unlabeled training images. Unlike most other deep learning models that explicitly address global structure of images in every layer, sparse HMAX addresses local to global structure gradually along the hierarchy by applying patch-based learning to the output of the previous layer. As a consequence, the learning method can be standard sparse coding (SSC or independent component analysis (ICA, two techniques deeply rooted in neuroscience. What makes SSC and ICA applicable at higher levels is the introduction of linear higher-order statistical regularities by max pooling. After training, high-level units display sparse, invariant selectivity for particular individuals or for image categories like those observed in human inferior temporal cortex (ITC and medial temporal lobe (MTL. Finally, on an image classification benchmark, sparse HMAX outperforms the original HMAX by a large margin, suggesting its great potential for computer vision.
Flip to Regular Triangulation and Convex Hull.
Gao, Mingcen; Cao, Thanh-Tung; Tan, Tiow-Seng
2017-02-01
Flip is a simple and local operation to transform one triangulation to another. It makes changes only to some neighboring simplices, without considering any attribute or configuration global in nature to the triangulation. Thanks to this characteristic, several flips can be independently applied to different small, non-overlapping regions of one triangulation. Such operation is favored when designing algorithms for data-parallel, massively multithreaded hardware, such as the GPU. However, most existing flip algorithms are designed to be executed sequentially, and usually need some restrictions on the execution order of flips, making them hard to be adapted to parallel computation. In this paper, we present an in depth study of flip algorithms in low dimensions, with the emphasis on the flexibility of their execution order. In particular, we propose a series of provably correct flip algorithms for regular triangulation and convex hull in 2D and 3D, with implementations for both CPUs and GPUs. Our experiment shows that our GPU implementation for constructing these structures from a given point set achieves up to two orders of magnitude of speedup over other popular single-threaded CPU implementation of existing algorithms.
Wave dynamics of regular and chaotic rays
McDonald, S.W.
1983-09-01
In order to investigate general relationships between waves and rays in chaotic systems, I study the eigenfunctions and spectrum of a simple model, the two-dimensional Helmholtz equation in a stadium boundary, for which the rays are ergodic. Statistical measurements are performed so that the apparent randomness of the stadium modes can be quantitatively contrasted with the familiar regularities observed for the modes in a circular boundary (with integrable rays). The local spatial autocorrelation of the eigenfunctions is constructed in order to indirectly test theoretical predictions for the nature of the Wigner distribution corresponding to chaotic waves. A portion of the large-eigenvalue spectrum is computed and reported in an appendix; the probability distribution of successive level spacings is analyzed and compared with theoretical predictions. The two principal conclusions are: 1) waves associated with chaotic rays may exhibit randomly situated localized regions of high intensity; 2) the Wigner function for these waves may depart significantly from being uniformly distributed over the surface of constant frequency in the ray phase space.
On bigraded regularities of Rees algebra
RAMAKRISHNA NANDURI
2017-09-01
For any homogeneous ideal $I$ in $K[x_{1}, . . . , x_{n}]$ of analytic spread $\\ell$, we show that for the Rees algebra $R(I)$, $\\rm{reg^{syz}_ {(0,1)}}\\sl(R(I)) = \\rm{reg^{T}_{(0,1)}}\\sl(R(I))$. We compute a formula for the (0, 1)-regularity of $R(I)$, which is a bigraded analog of Theorem1.1 of Aramova and Herzog $(\\it{Am. J. Math.} \\bf{122(4)} (2000) 689–719)$ and Theorem 2.2of Römer $(\\it{Ill. J. Math.} \\bf{45(4)} (2001) 1361–1376)$ to $R(I)$. We show that if the defect sequence, $e_{k} := {\\rm reg}(I^k)− k \\rho(I)$, is weakly increasing for $k\\geq\\rm{reg^{syz}_{(0,1)}}\\sl(R(I))$, then $\\rm{reg}\\sl(I^{j}) = j\\rho(I) + e$ for $j\\geq \\rm{reg^{syz}_{(0,1)}}\\sl(R(I)) + \\ell$, where $\\ell = {\\rm min}\\{\\mu(J)\\mid J \\subseteq I$ a graded minimal reduction of $I\\}$. This is an improvement of Corollary 5.9(i) of [16].
Keller, Kai Johannes
2010-01-01
The present work contains a consistent formulation of the methods of dimensional regularization (DimReg) and minimal subtraction (MS) in Minkowski position space. The methods are implemented into the framework of perturbative Algebraic Quantum Field Theory (pAQFT). The developed methods are used to solve the Epstein-Glaser recursion for the construction of time-ordered products in all orders of causal perturbation theory. A solution is given in terms of a forest formula in the sense of Zimmer...
Bisnovatyi-Kogan, G S
2015-01-01
In this paper we review a recently developed approximate method for investigation of dynamics of compressible ellipsoidal figures. Collapse and subsequent behaviour are described by a system of ordinary differential equations for time evolution of semi-axes of a uniformly rotating, three-axis, uniform-density ellipsoid. First, we apply this approach to investigate dynamic stability of non-spherical bodies. We solve the equations that describe, in a simplified way, the Newtonian dynamics of a self-gravitating non-rotating spheroidal body. We find that, after loss of stability, a contraction to a singularity occurs only in a pure spherical collapse, and deviations from spherical symmetry prevent the contraction to the singularity through a stabilizing action of nonlinear non-spherical oscillations. The development of instability leads to the formation of a regularly or chaotically oscillating body, in which dynamical motion prevents the formation of the singularity. We find regions of chaotic and regular pulsat...
OCReP: An Optimally Conditioned Regularization for pseudoinversion based neural training.
Cancelliere, Rossella; Gai, Mario; Gallinari, Patrick; Rubini, Luca
2015-11-01
In this paper we consider the training of single hidden layer neural networks by pseudoinversion, which, in spite of its popularity, is sometimes affected by numerical instability issues. Regularization is known to be effective in such cases, so that we introduce, in the framework of Tikhonov regularization, a matricial reformulation of the problem which allows us to use the condition number as a diagnostic tool for identification of instability. By imposing well-conditioning requirements on the relevant matrices, our theoretical analysis allows the identification of an optimal value for the regularization parameter from the standpoint of stability. We compare with the value derived by cross-validation for overfitting control and optimization of the generalization performance. We test our method for both regression and classification tasks. The proposed method is quite effective in terms of predictivity, often with some improvement on performance with respect to the reference cases considered. This approach, due to analytical determination of the regularization parameter, dramatically reduces the computational load required by many other techniques.
SUI Da-shan; CUI Zhen-shan
2007-01-01
The accurate material physical properties, initial and boundary conditions are indispensable to the numerical simulation in the casting process, and they are related to the simulation accuracy directly.The inverse heat conduction method can be used to identify the mentioned above parameters based on the temperature measurement data.This paper presented a new inverse method according to Tikhonov regularization theory.A regularization functional was established and the regularization parameter was deduced, the Newton-Raphson iteration method was used to solve the equations.One detailed case was solved to identify the thermal conductivity and specific heat of sand mold and interfacial heat transfer coefficient (IHTC) at the meantime.This indicates that the regularization method is very efficient in decreasing the sensitivity to the temperature measurement data, overcoming the illposedness of the inverse heat conduction problem (IHCP) and improving the stability and accuracy of the results.As a general inverse method, it can be used to identify not only the material physical properties but also the initial and boundary conditions' parameters.
Li, Jin [Chongqing University, Department of Physics, Chongqing (China); Lin, Kai [Universidade de Sao Paulo, Instituto de Fisica, CP 66318, Sao Paulo (Brazil); Yang, Nan [Huazhong University of Science and Technology, Department of Physics, Wuhan (China)
2015-03-01
Based on a regular exact black hole (BH) from nonlinear electrodynamics (NLED) coupled to general relativity, we investigate the stability of such BH through the Quasinormal Modes (QNMs) of electromagnetic (EM) field perturbations and its thermodynamics through Hawking radiation. In perturbation theory, we can deduce the effective potential from a nonlinear EM field. The comparison of the potential function between regular and RN BHs could predict similar QNMs. The QNM frequencies tell us the effect of the magnetic charge q, the overtone n, and the angular momentum number l on the dynamic evolution of NLED EM field. Furthermore we also discuss the cases of near-extreme conditions of such a magnetically charged regular BH. The corresponding QNM spectrum illuminates some special properties in the near-extreme cases. For the thermodynamics, we employ the Hamilton-Jacobi method to calculate the near-horizon Hawking temperature of the regular BH and reveal the relationship between the classical parameters of the black hole and its quantum effects. (orig.)
Elementary Particle Spectroscopy in Regular Solid Rewrite
Trell, Erik
2008-10-01
The Nilpotent Universal Computer Rewrite System (NUCRS) has operationalized the radical ontological dilemma of Nothing at All versus Anything at All down to the ground recursive syntax and principal mathematical realisation of this categorical dichotomy as such and so governing all its sui generis modalities, leading to fulfilment of their individual terms and compass when the respective choice sequence operations are brought to closure. Focussing on the general grammar, NUCRS by pure logic and its algebraic notations hence bootstraps Quantum Mechanics, aware that it "is the likely keystone of a fundamental computational foundation" also for e.g. physics, molecular biology and neuroscience. The present work deals with classical geometry where morphology is the modality, and ventures that the ancient regular solids are its specific rewrite system, in effect extensively anticipating the detailed elementary particle spectroscopy, and further on to essential structures at large both over the inorganic and organic realms. The geodetic antipode to Nothing is extension, with natural eigenvector the endless straight line which when deployed according to the NUCRS as well as Plotelemeian topographic prescriptions forms a real three-dimensional eigenspace with cubical eigenelements where observed quark-skewed quantum-chromodynamical particle events self-generate as an Aristotelean phase transition between the straight and round extremes of absolute endlessness under the symmetry- and gauge-preserving, canonical coset decomposition SO(3)×O(5) of Lie algebra SU(3). The cubical eigen-space and eigen-elements are the parental state and frame, and the other solids are a range of transition matrix elements and portions adapting to the spherical root vector symmetries and so reproducibly reproducing the elementary particle spectroscopy, including a modular, truncated octahedron nano-composition of the Electron which piecemeal enter into molecular structures or compressed to each
In Kang, Suk; Khambampati, Anil Kumar; Jeon, Min Ho; Kim, Bong Seok; Kim, Kyung Youn
2016-02-01
Electrical impedance tomography (EIT) is a non-invasive imaging technique that can be used as a bed-side monitoring tool for human thorax imaging. EIT has high temporal resolution characteristics but at the same time it suffers from poor spatial resolution due to ill-posedness of the inverse problem. Often regularization methods are used as a penalty term in the cost function to stabilize the sudden changes in resistivity. In human thorax monitoring, with conventional regularization methods employing Tikhonov type regularization, the reconstructed image is smoothed between the heart and the lungs, that is, it makes it difficult to distinguish the exact boundaries of the lungs and the heart. Sometimes, obtaining structural information of the object prior to this can be incorporated into the regularization method to improve the spatial resolution along with helping create clear and distinct boundaries between the objects. However, the boundary of the heart is changed rapidly due to the cardiac cycle hence there is no information concerning the exact boundary of the heart. Therefore, to improve the spatial resolution for human thorax monitoring during the cardiac cycle, in this paper, a sub-domain based regularization method is proposed assuming the lungs and part of background region is known. In the proposed method, the regularization matrix is modified anisotropically to include sub-domains as prior information, and the regularization parameter is assigned with different weights to each sub-domain. Numerical simulations and phantom experiments for 2D human thorax monitoring are performed to evaluate the performance of the proposed regularization method. The results show a better reconstruction performance with the proposed regularization method.
Zhong, Chen; Batty, Michael; Manley, Ed; Wang, Jiaqiu; Wang, Zijia; Chen, Feng; Schmitt, Gerhard
2016-01-01
To discover regularities in human mobility is of fundamental importance to our understanding of urban dynamics, and essential to city and transport planning, urban management and policymaking. Previous research has revealed universal regularities at mainly aggregated spatio-temporal scales but when we zoom into finer scales, considerable heterogeneity and diversity is observed instead. The fundamental question we address in this paper is at what scales are the regularities we detect stable, explicable, and sustainable. This paper thus proposes a basic measure of variability to assess the stability of such regularities focusing mainly on changes over a range of temporal scales. We demonstrate this by comparing regularities in the urban mobility patterns in three world cities, namely London, Singapore and Beijing using one-week of smart-card data. The results show that variations in regularity scale as non-linear functions of the temporal resolution, which we measure over a scale from 1 minute to 24 hours thus reflecting the diurnal cycle of human mobility. A particularly dramatic increase in variability occurs up to the temporal scale of about 15 minutes in all three cities and this implies that limits exist when we look forward or backward with respect to making short-term predictions. The degree of regularity varies in fact from city to city with Beijing and Singapore showing higher regularity in comparison to London across all temporal scales. A detailed discussion is provided, which relates the analysis to various characteristics of the three cities. In summary, this work contributes to a deeper understanding of regularities in patterns of transit use from variations in volumes of travellers entering subway stations, it establishes a generic analytical framework for comparative studies using urban mobility data, and it provides key points for the management of variability by policy-makers intent on for making the travel experience more amenable.
Chen Zhong
Full Text Available To discover regularities in human mobility is of fundamental importance to our understanding of urban dynamics, and essential to city and transport planning, urban management and policymaking. Previous research has revealed universal regularities at mainly aggregated spatio-temporal scales but when we zoom into finer scales, considerable heterogeneity and diversity is observed instead. The fundamental question we address in this paper is at what scales are the regularities we detect stable, explicable, and sustainable. This paper thus proposes a basic measure of variability to assess the stability of such regularities focusing mainly on changes over a range of temporal scales. We demonstrate this by comparing regularities in the urban mobility patterns in three world cities, namely London, Singapore and Beijing using one-week of smart-card data. The results show that variations in regularity scale as non-linear functions of the temporal resolution, which we measure over a scale from 1 minute to 24 hours thus reflecting the diurnal cycle of human mobility. A particularly dramatic increase in variability occurs up to the temporal scale of about 15 minutes in all three cities and this implies that limits exist when we look forward or backward with respect to making short-term predictions. The degree of regularity varies in fact from city to city with Beijing and Singapore showing higher regularity in comparison to London across all temporal scales. A detailed discussion is provided, which relates the analysis to various characteristics of the three cities. In summary, this work contributes to a deeper understanding of regularities in patterns of transit use from variations in volumes of travellers entering subway stations, it establishes a generic analytical framework for comparative studies using urban mobility data, and it provides key points for the management of variability by policy-makers intent on for making the travel experience more
Linear System Identification via Atomic Norm Regularization
Shah, Parikshit; Tang, Gongguo; Recht, Benjamin
2012-01-01
This paper proposes a new algorithm for linear system identification from noisy measurements. The proposed algorithm balances a data fidelity term with a norm induced by the set of single pole filters. We pose a convex optimization problem that approximately solves the atomic norm minimization problem and identifies the unknown system from noisy linear measurements. This problem can be solved efficiently with standard, freely available software. We provide rigorous statistical guarantees that explicitly bound the estimation error (in the H_2-norm) in terms of the stability radius, the Hankel singular values of the true system and the number of measurements. These results in turn yield complexity bounds and asymptotic consistency. We provide numerical experiments demonstrating the efficacy of our method for estimating linear systems from a variety of linear measurements.
Gauge invariant Pauli-Villars regularization for chiral fermion
Okuyama, K; Okuyama, Kiyoshi; Suzuki, Hiroshi
1996-01-01
We re-examine the generalized Pauli--Villars regularization proposed by Frolov and Slavnov, a possible gauge invariant Lagrangian-level regularization for a chiral fermion. When a chiral fermion belongs to a (pseudo-)real representation of the gauge group, the formulation always provides a complete gauge invariant regularization; a chiral fermion in an anomaly free complex representation seems to be only partially regularized. For the pseudo-real representation, the formulation requires an infinite number of regulator fields, while for the real representation only a finite number of regulator fields is sufficient. For both cases, being gauge invariant, the regularization gives a transverse vacuum polarization tensor without any gauge variant counter terms. The covariant (or gauge invariant) form of the fermion number and the conformal anomalies are obtained in this regularization.
Regular Bases At Non-isolated Points And Metrization Theorems
Lin, Fucai; Junnila, Heikki
2011-01-01
In this paper, we define the spaces with a regular base at non-isolated points and discuss some metrization theorems. We firstly show that a space $X$ is a metrizable space, if and only if $X$ is a regular space with a $\\sigma$-locally finite base at non-isolated points, if and only if $X$ is a perfect space with a regular base at non-isolated points, if and only if $X$ is a $\\beta$-space with a regular base at non-isolated points. In addition, we also discuss the relations between the spaces with a regular base at non-isolated points and some generalized metrizable spaces. Finally, we give an affirmative answer for a question posed by F. C. Lin and S. Lin in \\cite{LL}, which also shows that a space with a regular base at non-isolated points has a point-countable base.
Characterization of Chain as a Regular Semi Group
R. Kehinde
2008-01-01
Full Text Available Problem Statement: There are some special classes of semi group namely: regular and eventually regular, abundant, orthodox, quasi-adequate. The objective of this study were to: (i Define a new class of semi group on a Poset and give related examples (ii Study and establish conditions that characterized Chain as a regular semi group. Approach: Tests of some of characteristics of semi group like associativity, commutativity, and regular semi group were carried out on this new class. Results: Conditions were obtained that showed it is associative and regular. Conclusion: Hence the results suggest that since Chain is regular, there are many other things we can still do this with class of semi group such as: (i Whether one can characterize all the Green's equivalences and their starred analogues (ii Whether one can characterize all the congruencies of the given semi group (iii Whether one characterize all the subsemigroups of the given semi group.
J.L.LIONS
1999-01-01
A new algorithm for the stabilization of (possibly turbulent, chaotic) distributed systems, governed by linear or non linear systems of equations is presented. The SPA (Stabilization Parallel Algorithm) is based on a systematic parallel decomposition of the problem (related to arbitrarily overlapping decomposition of domains) and on a penalty argument. SPA is presented here for the case of linear parabolic equations: with distrjbuted or boundary control. It extends to practically all linear and non linear evolution equations, as it will be presented in several other publications.
How to regularize a symplectic-energy-momentum integrator
Shibberu, Yosi
2005-01-01
We identify ghost trajectories of symplectic-energy-momentum (SEM) integration and show that the ghost trajectories are not time reversible. We explain how SEM integration can be regularized, in a SEM preserving manner, so that it is time reversible. We describe an algorithm for implementing the regularized SEM integrator. Simulation results for the pendulum are given. Coordinate invariance of the regularized SEM integrator is briefly discussed.
R-Unipotent Congruences on Eventually Regular Semigroups
Yanfeng Luo; Xiaoling Li
2007-01-01
A semigroup S is called an eventually regular semigroup if for every a ∈ S,there exists a positive integer n such that an is regular. In this paper, the R-unipotent,inverse semigroup and group congruences on an eventually regular semigroup S are described by means of certain congruence pairs (ξ, K), where ξ is a normal congruence on the subsemigroup generated by E(S), and K is a normal subsemigroup of S.
Semilattices of Nil-extensions of Simple Regular Semigroups
Stojan Bogdanovi(c); Miroslav (C)iri(c); Melanija Mitrovi(c)
2003-01-01
Semigroups decomposable into a semilattice of Archimedean semigroups, having certain additional properties such as the intra-, left, right and complete π-regularity, have been investigated in many papers. In the present paper, we study the π-regular ones. Among other things, we characterize them as semilattices of nil-extensions of simple regular semigroups. The obtained results generalize some results given by Munn, Putcha, Shevrin, Bogdanovic, Ciric, and others.
Thermodynamical stability of the Bardeen black hole
Bretón, Nora [Dpto. de Física, Centro de Investigación y de Estudios Avanzados del I. P. N., Apdo. 14-740, D.F. (Mexico); Perez Bergliaffa, Santiago E. [Dpto. de Física, U. Estado do Rio de Janeiro (Brazil)
2014-01-14
We analyze the stability of the regular magnetic Bardeen black hole both thermodynamically and dynamically. For the thermodynamical analysis we consider a microcanonical ensemble and apply the turning point method. This method allows to decide a change in stability (or instability) of a system, requiring only the assumption of smoothness of the area functional. The dynamical stability is asserted using criteria based on the signs of the Lagrangian and its derivatives. It turns out from our analysis that the Bardeen black hole is both thermodynamically and dynamically stable.
Quasinormal modes of gravitational field perturbation of regular phantom black holes
Li, Jin; Wen, Hao
2016-01-01
We study the gravitational quasi-normal modes (QNMs) for a kind of regular black hole named as phantom black hole (BH), which is a solution of a self-gravitating minimally coupled scalar field with an arbitrary potential.The parameter conditions of such BH are investigated in asymptotically flat, de sitter (dS), and anti de sitter (AdS) spacetimes separately. Considering the standard odd parity and even parity of gravitational perturbation, the corresponding master equations are derived and quasi-normal perturbation are discussed in asymptotically flat and dS spacetimes. The dynamic evolution of the perturbation field indicates the stability of gravitational perturbation directly. On the whole in asymptotically flat and dS spacetimes, the gravitational perturbations have the similar characteristics for odd and even parities. The decay speed of perturbation is strongly dependent on the scale $b$. Furthermore through the analysis of Hawking radiation, the thermodynamics of such regular phantom black hole is als...
Wall and Anti-Wall in the Randall-Sundrum Model and A New Infrared Regularization
Ichinose, S
2000-01-01
An approach to find the field equation solution of the Randall-Sundrum model with the $S^1/Z_2$ extra axis is presented. We closely examine the infrared singularity. The vacuum is set by the 5 dimensional Higgs field. Both the domain-wall and the anti-domain-wall naturally appear, at the ends of the extra compact axis, by taking a {\\it new infrared regularization}. The stability is guaranteed from the outset by the kink boundary condition. A {\\it continuous} (infrared-)regularized solution, which is a truncated {\\it Fourier series} of a {\\it discontinuous} solution, is utilized.The ultraviolet-infrared relation appears in the leading order of the solution.
Hamiltonian Cycles in Regular 2-Connected Claw-Free Graphs
李明楚
2003-01-01
A known result by Jackson Bill is that every 2-connected k-regular graph on at most 3k vertices is Hamiltonian. In this paper,it is proved that every 2-connected k-regular claw-free graph on at most 5k(k≥10)vertices is Hamiltonian. Moreover, the bound 5k is best possible. A counterexample of a 2-connected k-regular claw-free non-Hamiltonian graph on 5k+1 vertices is given, and it is conjectured that every 3-connected k-regular claw-free graph on at most 12k-7 vertices is Hamiltonian.
Regular Maps of Graphs of Order 4p
Jin Xin ZHOU; Yan Quan FENG
2012-01-01
A 2-cell embedding f:X → S of a graph X into a closed orientable surface S can be described combinatorially by a pair M =(X; p) called a map,where p is a product of disjoint cycle permutations each of which is the permutation of the arc set of X initiated at the same vertex following the orientation of S.It is well known that the automorphism group of M acts semi-regularly on the arc set of X and if the action is regular,then the map Mand the embedding f are called regular.Let p and q be primes.Duet al.[J.Algebraic Combin.,19,123-141 (2004)] classified the regular maps of graphs of order pq.In this paper all pairwise non-isomorphic regular maps of graphs of order 4p are constructed explicitly and the genera of such regular maps are computed.As a result,there are twelve sporadic and six infinite families of regular maps of graphs of order 4p; two of the infinite families are regular maps with the complete bipartite graphs K2p,2p as underlying graphs and the other four infinite families are regular balanced Cayley maps on the groups Z4p,Z22 × Zp and D4p.
Study on design of the regular concave surface profiles
2001-01-01
Regular concave surface profiles are adopted in many friction surfaces. But up to now,this is seldom tutored by the theory of lubrication. To design them, a model of the regular depthoptimization was provided. To determine the other size, two propositions are given. At same time,two main effect factors on lubrication were discussed in detail. A lubrication test for different regu-lar concave surface profiles was performed on a pin and ring tester. On the basis of theory analy-sis and experiment, a principle to design regular concave surface profiles is provided.
Keller, Kai Johannes
2010-04-15
The present work contains a consistent formulation of the methods of dimensional regularization (DimReg) and minimal subtraction (MS) in Minkowski position space. The methods are implemented into the framework of perturbative Algebraic Quantum Field Theory (pAQFT). The developed methods are used to solve the Epstein-Glaser recursion for the construction of time-ordered products in all orders of causal perturbation theory. A solution is given in terms of a forest formula in the sense of Zimmermann. A relation to the alternative approach to renormalization theory using Hopf algebras is established. (orig.)
Jespersen, Jesper
2004-01-01
It is demonstrated that full employment and sustainable development not necessarily are conflicting goals. On the other hand macroeconomic stability cannot be obtained without a deliberate labour sharing policy and a shift in the composition of private consumption away from traditional material...
Kohyama, Hiroaki
2015-01-01
We study the regularization dependence on the quenched Schwinger-Dyson equations in general gauge by applying the two types of regularizations, the four and three dimensional momentum cutoffs. The obtained results indicate that the solutions are not drastically affected by the choice of two different cutoff prescriptions. We then think that both the regularizations can nicely be adopted in the analyses for the Schwinger-Dyson equations.
Full L1-regularized Traction Force Microscopy over whole cells.
Suñé-Auñón, Alejandro; Jorge-Peñas, Alvaro; Aguilar-Cuenca, Rocío; Vicente-Manzanares, Miguel; Van Oosterwyck, Hans; Muñoz-Barrutia, Arrate
2017-08-10
Traction Force Microscopy (TFM) is a widespread technique to estimate the tractions that cells exert on the surrounding substrate. To recover the tractions, it is necessary to solve an inverse problem, which is ill-posed and needs regularization to make the solution stable. The typical regularization scheme is given by the minimization of a cost functional, which is divided in two terms: the error present in the data or data fidelity term; and the regularization or penalty term. The classical approach is to use zero-order Tikhonov or L2-regularization, which uses the L2-norm for both terms in the cost function. Recently, some studies have demonstrated an improved performance using L1-regularization (L1-norm in the penalty term) related to an increase in the spatial resolution and sensitivity of the recovered traction field. In this manuscript, we present a comparison between the previous two regularization schemes (relying in the L2-norm for the data fidelity term) and the full L1-regularization (using the L1-norm for both terms in the cost function) for synthetic and real data. Our results reveal that L1-regularizations give an improved spatial resolution (more important for full L1-regularization) and a reduction in the background noise with respect to the classical zero-order Tikhonov regularization. In addition, we present an approximation, which makes feasible the recovery of cellular tractions over whole cells on typical full-size microscope images when working in the spatial domain. The proposed full L1-regularization improves the sensitivity to recover small stress footprints. Moreover, the proposed method has been validated to work on full-field microscopy images of real cells, what certainly demonstrates it is a promising tool for biological applications.
Chvetsov, Alevei V.; Sandison, George A.; Schwartz, Jeffrey L.; Rengan, Ramesh
2015-11-01
The main objective of this article is to improve the stability of reconstruction algorithms for estimation of radiobiological parameters using serial tumor imaging data acquired during radiation therapy. Serial images of tumor response to radiation therapy represent a complex summation of several exponential processes as treatment induced cell inactivation, tumor growth rates, and the rate of cell loss. Accurate assessment of treatment response would require separation of these processes because they define radiobiological determinants of treatment response and, correspondingly, tumor control probability. However, the estimation of radiobiological parameters using imaging data can be considered an inverse ill-posed problem because a sum of several exponentials would produce the Fredholm integral equation of the first kind which is ill posed. Therefore, the stability of reconstruction of radiobiological parameters presents a problem even for the simplest models of tumor response. To study stability of the parameter reconstruction problem, we used a set of serial CT imaging data for head and neck cancer and a simplest case of a two-level cell population model of tumor response. Inverse reconstruction was performed using a simulated annealing algorithm to minimize a least squared objective function. Results show that the reconstructed values of cell surviving fractions and cell doubling time exhibit significant nonphysical fluctuations if no stabilization algorithms are applied. However, after applying a stabilization algorithm based on variational regularization, the reconstruction produces statistical distributions for survival fractions and doubling time that are comparable to published in vitro data. This algorithm is an advance over our previous work where only cell surviving fractions were reconstructed. We conclude that variational regularization allows for an increase in the number of free parameters in our model which enables development of more
The Corona Limit of Penrose Tilings Is a Regular Decagon
Akiyama, Shigeki; Imai, Katsunobu
2016-01-01
Part 2: Regular Papers; International audience; We define and study the corona limit of a tiling, by investigating the signal propagations on cellular automata (CA) on tilings employing the simple growth CA. In particular, the corona limit of Penrose tilings is the regular decagon.
A Gradient Regularization Method in Crosswell Seismic Tomography
Wang Shoudong
2006-01-01
Crosswell seismic tomography can be used to study the lateral variation of reservoirs, reservoir properties and the dynamic movement of fluids. In view of the instability of crosswell seismic tomography, the gradient method was improved by introducing regularization, and a gradient regularization method in presented in this paper. This method was verified by processing numerical simulation data and physical model data.
Analytic regularization of the Yukawa model at finite temperature
Malbouisson, A P C; Svaiter, N F
1996-01-01
We analyse the one-loop fermionic contribution for the scalar effective potential in the temperature dependent Yukawa model. In order to regularize the model a mix between dimensional and analytic regularization procedures is used. We find a general expression for the fermionic contribution in arbitrary spacetime dimension. It is found that in D=3 this contribution is finite.
Comments on "Regularization ambiguities and local gauge symmetries"
Casana, R
2004-01-01
We study the regularization ambiguities in an exact renormalized (1+1)-dimensional field theory. We show a relation between the regularization ambiguities and the coupling parameters of the theory as well as their role in the implementation of a local gauge symmetry at quantum level.
Comments on Regularization Ambiguities and Local Gauge Symmetries
Casana, R.; Pimentel, B. M.
We study the regularization ambiguities in an exact renormalized (1 +1)-dimensional field theory. We show a relation between the regularization ambiguities and the coupling parameters of the theory as well as their role in the implementation of a local gauge symmetry at quantum level.
Morrey Regularity of the Solution to the Dirichlet Problem
无
2000-01-01
@@To study the local regularity of solutions to second orderelliptic partial differential equations, Morrey in ［1］ introduced somefunction spaces, which are called the Morrey spaces today. Since then, manymathematicians have studied regularities of solutions to some kinds of secondorder elliptic equations in Morrey spaces.
Regularized Kernel Forms of Minimum Squared Error Method
XU Jian-hua; ZHANG Xue-gong; LI Yan-da
2006-01-01
Minimum squared error (MSE) algorithm is one of the classical pattern recognition and regression analysis methods,whose objective is to minimize the squared error summation between the output of linear function and the desired output.In this paper,the MSE algorithm is modified by using kernel functions satisfying the Mercer condition and regularization technique; and the nonlinear MSE algorithms based on kernels and regularization term,that is,the regularized kernel forms of MSE algorithm,are proposed.Their objective functions include the squared error summation between the output of nonlinear function based on kernels and the desired output and a proper regularization term.The regularization technique can handle ill-posed problems,reduce the solution space,and control the generalization.Three squared regularization terms are utilized in this paper.In accordance with the probabilistic interpretation of regularization terms,the difference among three regularization terms is given in detail.The synthetic and real data are used to analyze the algorithm performance.
A Splitting Algorithm for Directional Regularization and Sparsification
Rakêt, Lars Lau; Nielsen, Mads
2012-01-01
be computed pointwise and are easily implemented on massively parallel processors. Furthermore the splitting method allows for the computation of solutions to a large number of more advanced directional regularization problems. In particular we are able to handle robust, non-convex data terms, and to define...... a 0-harmonic regularization energy where we sparsify directions by means of an L0 norm....
Towards selecting a finite-range regularization scale
Young, Ross D; Leinweber, Derek B
2009-01-01
Extensive studies have demonstrated that finite-range regularization (FRR) offers significantly improved chiral extrapolations for lattice QCD. These studies have typically relied on selecting the finite-regularization scale based upon phenomenological input. Here we report on a preliminary investigation of a procedure to determine a preferred range of FRR scale based on nonperturbative lattice results -- without any phenomenological prejudice.
47 CFR 76.614 - Cable television system regular monitoring.
2010-10-01
... 47 Telecommunication 4 2010-10-01 2010-10-01 false Cable television system regular monitoring. 76.614 Section 76.614 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) BROADCAST RADIO SERVICES MULTICHANNEL VIDEO AND CABLE TELEVISION SERVICE Technical Standards § 76.614 Cable television system regular monitoring. Cable television...
On the Regularity of Shear Thickening Viscous Fluids
Francesca CRISPO
2009-01-01
The aim of this note is to improve the regularity results obtained by H. Beirao da Veiga in 2008 for a class of p-fluid flows in a cubic domain. The key idea is exploiting the better regularity of solutions in the tangential directions with respect to the normal one, by appealing to anisotropic Sobolev embeddings.
Regular linear systems and their reciprocals : applications to Riccati equations
Curtain, RF
2003-01-01
For a regular linear system with zero in the resolvent set of the generator we introduce its reciprocal system, which has bounded generators. We show that there are close relationships between key system theoretic properties of such regular linear systems and their reciprocals. To illustrate the use
Vanishing non-local regularization of a scalar conservation law
Jerome Droniou
2003-11-01
Full Text Available We prove that the solution to the regularization of a scalar conservation law by a fractional power of the Laplacian converges, as the regularization vanishes, to the entropy solution of the hyperbolic problem. We also give an error estimate when the initial condition has bounded variation.
Spectral Characterizations of Some Distance-Regular Graphs
van Dam, E.R.; Haemers, W.H.
2000-01-01
When can one see from the spectrum of a graph whether it is distance-regular or not?We give some new results for when this is the case.As a consequence we find (among others) that the following distance-regular graphs are uniquely determined by their spectrum: The collinearity graphs of the generali
Patterns of Buyer Behavior: Regularities, Models, and Extensions
Mark Uncles; Andrew Ehrenberg; Kathy Hammond
1995-01-01
Many empirical regularities in the buying behavior of consumers have been linked together into a comprehensive model, the Dirichlet. In this paper we list some of the well-established regularities, show how they are theoretically intertwined, and illustrate how this approach to modeling can assist the marketing analyst.
Mu-calculus-based deontic logic for regular actions
Broersen, Jan; Wieringa, Roelf J.; Meyer, John-Jules; Demolombe, R.; Hilpinen, R.
This paper introduces deontic logic of regular actions as a fragment of the modal mu calculus Semantic characterizations of deontic notions for regular actions are given in terms of conditions on mu calculus structures and mu calculus formulas capturing this semantics are constructed
Strictly-regular number system and data structures
Elmasry, Amr Ahmed Abd Elmoneim; Jensen, Claus; Katajainen, Jyrki
2010-01-01
We introduce a new number system that we call the strictly-regular system, which efficiently supports the operations: digit-increment, digit-decrement, cut, concatenate, and add. Compared to other number systems, the strictly-regular system has distinguishable properties. It is superior to the re...
Chimeric mitochondrial peptides from contiguous regular and swinger RNA
Hervé Seligmann
2016-01-01
Full Text Available Previous mass spectrometry analyses described human mitochondrial peptides entirely translated from swinger RNAs, RNAs where polymerization systematically exchanged nucleotides. Exchanges follow one among 23 bijective transformation rules, nine symmetric exchanges (X ↔ Y, e.g. A ↔ C and fourteen asymmetric exchanges (X → Y → Z → X, e.g. A → C → G → A, multiplying by 24 DNA's protein coding potential. Abrupt switches from regular to swinger polymerization produce chimeric RNAs. Here, human mitochondrial proteomic analyses assuming abrupt switches between regular and swinger transcriptions, detect chimeric peptides, encoded by part regular, part swinger RNA. Contiguous regular- and swinger-encoded residues within single peptides are stronger evidence for translation of swinger RNA than previously detected, entirely swinger-encoded peptides: regular parts are positive controls matched with contiguous swinger parts, increasing confidence in results. Chimeric peptides are 200× rarer than swinger peptides (3/100,000 versus 6/1000. Among 186 peptides with >8 residues for each regular and swinger parts, regular parts of eleven chimeric peptides correspond to six among the thirteen recognized, mitochondrial protein-coding genes. Chimeric peptides matching partly regular proteins are rarer and less expressed than chimeric peptides matching non-coding sequences, suggesting targeted degradation of misfolded proteins. Present results strengthen hypotheses that the short mitogenome encodes far more proteins than hitherto assumed. Entirely swinger-encoded proteins could exist.
Chimeric mitochondrial peptides from contiguous regular and swinger RNA.
Seligmann, Hervé
2016-01-01
Previous mass spectrometry analyses described human mitochondrial peptides entirely translated from swinger RNAs, RNAs where polymerization systematically exchanged nucleotides. Exchanges follow one among 23 bijective transformation rules, nine symmetric exchanges (X ↔ Y, e.g. A ↔ C) and fourteen asymmetric exchanges (X → Y → Z → X, e.g. A → C → G → A), multiplying by 24 DNA's protein coding potential. Abrupt switches from regular to swinger polymerization produce chimeric RNAs. Here, human mitochondrial proteomic analyses assuming abrupt switches between regular and swinger transcriptions, detect chimeric peptides, encoded by part regular, part swinger RNA. Contiguous regular- and swinger-encoded residues within single peptides are stronger evidence for translation of swinger RNA than previously detected, entirely swinger-encoded peptides: regular parts are positive controls matched with contiguous swinger parts, increasing confidence in results. Chimeric peptides are 200 × rarer than swinger peptides (3/100,000 versus 6/1000). Among 186 peptides with > 8 residues for each regular and swinger parts, regular parts of eleven chimeric peptides correspond to six among the thirteen recognized, mitochondrial protein-coding genes. Chimeric peptides matching partly regular proteins are rarer and less expressed than chimeric peptides matching non-coding sequences, suggesting targeted degradation of misfolded proteins. Present results strengthen hypotheses that the short mitogenome encodes far more proteins than hitherto assumed. Entirely swinger-encoded proteins could exist.
Monodromy groups of parameterized linear differential equations with regular singularities
Mitschi, Claude
2011-01-01
We study the notion of regular singularities for parameterized complex ordinary linear differential systems, prove an analogue of the Schlesinger theorem for systems with regular singularities and solve both a parameterized version of the weak Riemann-Hilbert Problem and a special case of the inverse problem in parameterized Picard-Vessiot theory.
Some Characterizations of Left Weakly Regular Ordered Semigroups
TANC JIAN; XIE XIANG-YUN
2011-01-01
In this paper,the notion of left weakly regular ordered semigroups is introduced.Furthermore,left weakly regular ordered semigroups are characterized by the properties of their left ideals,right ideals and (generalized) bi-ideals,and also by the properties of their fuzzy left ideals,fuzzy right ideals and fuzzy (generalized) bi-ideals.
Endemic infections are always possible on regular networks
Del Genio, Charo I
2013-01-01
We study the dependence of the largest component in regular networks on the clustering coefficient, showing that its size changes smoothly without undergoing a phase transition. We explain this behaviour via an analytical approach based on the network structure, and provide an exact equation describing the numerical results. Our work indicates that intrinsic structural properties always allow the spread of epidemics on regular networks.
Existence and regularity of positive solutions for an elliptic system
Abdelouahed El Khalil
2002-12-01
Full Text Available In this paper, we study the existence and regularity of positive solution for an elliptic system on a bounded and regular domain. The non linearities in this equation are functions of Caratheodory type satisfying some exponential growth conditions.
Adaptive Regularization of Neural Networks Using Conjugate Gradient
Goutte, Cyril; Larsen, Jan
1998-01-01
Andersen et al. (1997) and Larsen et al. (1996, 1997) suggested a regularization scheme which iteratively adapts regularization parameters by minimizing validation error using simple gradient descent. In this contribution we present an improved algorithm based on the conjugate gradient technique........ Numerical experiments with feedforward neural networks successfully demonstrate improved generalization ability and lower computational cost...
Working for legality: employment and migrant regularization in Europe
Chauvin, S.; Garcés-Mascareñas, B.; Kraler, A.
2013-01-01
Recent programs to regularize undocumented migrants suggest the increasing role of employment as a requirement for foreigners to legally reside in Europe. Taking as illustrations the cases of Spain, France, Austria, Belgium and Germany, this article examines how regularization policies frame work. E
The Regularity Estimates for the Elliptic Equations in Orlicz Classes
TAO Xiang-xing; FANG Yi
2012-01-01
The purpose of this paper is to give the element proof of the regularity estimates in Orlicz classes for the second order derivatives of the solutions to the general second order elliptic equations.The global regularities in Orlicz for the second order derivatives of the solutions of the Dirichlet problems are also given.
On the Generating Power of Regularly Controlled Bidirectional Grammars
Asveld, Peter R.J.; Hogendorp, Jan Anne
1989-01-01
RCB-grammars or regularly controlled bidirectional grammars are context-free grammars of which the rules can be used in a productive and in a reductive fashion. In addition, the application of these rules is controlled by a regular language. Several modes of derivation can be distinguished for this
On the generating power of regularly controlled bidirection grammars
Asveld, P.R.J.; Hogendorp, J.A.
1991-01-01
RCB-grammars or regularly controlled bidirectional grammars are context-free grammars of which the rules can be used in a productive and in a reductive fashion. In addition, the application of these rules is controlled by a regular language. Several modes of derivation can be distinguished for this
Existence and regularity of a global attractor for doubly nonlinear parabolic equations
Abderrahmane El Hachimi
2002-05-01
Full Text Available In this paper we consider a doubly nonlinear parabolic partial differential equation $$ frac{partial eta (u}{partial t}-Delta _{p}u+f(x,t,u=0 quad hbox{in }Omega imesmathbb{R}^{+}, $$ with Dirichlet boundary condition and initial data given. We prove the existence of a global compact attractor by using a dynamical system approach. Under additional conditions on the nonlinearities $Beta$, $f$, and on $p$, we prove more regularity for the global attractor and obtain stabilization results for the solutions.
Regular black hole metrics and the weak energy condition
Balart, Leonardo, E-mail: leonardo.balart@ufrontera.cl [I.C.B. – Institut Carnot de Bourgogne, UMR 5209, CNRS, Faculté des Sciences Mirande, Université de Bourgogne, 9 Avenue Alain Savary, BP 47870, 21078 Dijon Cedex (France); Departamento de Ciencias Físicas, Facultad de Ingeniería y Ciencias, Universidad de La Frontera, Casilla 54-D, Temuco (Chile); Vagenas, Elias C., E-mail: elias.vagenas@ku.edu.kw [Theoretical Physics Group, Department of Physics, Kuwait University, P.O. Box 5969, Safat 13060 (Kuwait)
2014-03-07
In this work we construct a family of spherically symmetric, static, charged regular black hole metrics in the context of Einstein-nonlinear electrodynamics theory. The construction of the charged regular black hole metrics is based on three requirements: (a) the weak energy condition should be satisfied, (b) the energy–momentum tensor should have the symmetry T{sub 0}{sup 0}=T{sub 1}{sup 1}, and (c) these metrics have to asymptotically behave as the Reissner–Nordström black hole metric. In addition, these charged regular black hole metrics depend on two parameters which for specific values yield regular black hole metrics that already exist in the literature. Furthermore, by relaxing the third requirement, we construct more general regular black hole metrics which do not behave asymptotically as a Reissner–Nordström black hole metric.
Regularized Regression and Density Estimation based on Optimal Transport
Burger, M.
2012-03-11
The aim of this paper is to investigate a novel nonparametric approach for estimating and smoothing density functions as well as probability densities from discrete samples based on a variational regularization method with the Wasserstein metric as a data fidelity. The approach allows a unified treatment of discrete and continuous probability measures and is hence attractive for various tasks. In particular, the variational model for special regularization functionals yields a natural method for estimating densities and for preserving edges in the case of total variation regularization. In order to compute solutions of the variational problems, a regularized optimal transport problem needs to be solved, for which we discuss several formulations and provide a detailed analysis. Moreover, we compute special self-similar solutions for standard regularization functionals and we discuss several computational approaches and results. © 2012 The Author(s).
RECONSTRUCTION STABILITY OF NEARFIELD ACOUSTIC HOLOGRAPHY
Bi Chuanxing; Chen Xinzhao; Zhou Rong; Chen Jian
2005-01-01
The distributed source boundary point method (DSBPM) is used as the spatial transform algorithm for realizing nearfield acoustic holography (NAH), the sensitivity of the reconstructed solution to the measurement errors is analyzed, and the regularization method is proposed to stabilize the reconstruction process, control the influence of the measurement errors and get a better approximate solution. An oscillating sphere is investigated as a numerical example, the influence of the measurement errors on the reconstruction solution is demonstrated, and the feasibility and validity of the regularization method are validated.
Dashan SUI; Zhenshan CUI
2009-01-01
The inverse heat conduction method is one of methods to identify the casting simu-lation parameters. A new inverse method was presented according to the Tikhonov regularization theory. One appropriate regularized functional was established, and the functional was solved by the sensitivity coefficient and Newton-Raphson iteration method. Moreover, the orthogonal experimental design was used to estimate the ap-propriate initial value and variation domain of each variable to decrease the number of iteration and improve the identification accuracy and efficiency. It illustrated a detailed case of AI SiTMg sand mold casting and the temperature measurement ex- periment was done. The physical properties of sand mold and the interfacial heat transfer coefficient were identified at the meantime. The results indicated that the new regularization method was efficient in overcoming the ill-posedness of the inverse heat conduction problem and improving the stability and accuracy of the solutions.
Stabilization of cat paw trajectory during locomotion.
Klishko, Alexander N; Farrell, Bradley J; Beloozerova, Irina N; Latash, Mark L; Prilutsky, Boris I
2014-09-15
We investigated which of cat limb kinematic variables during swing of regular walking and accurate stepping along a horizontal ladder are stabilized by coordinated changes of limb segment angles. Three hypotheses were tested: 1) animals stabilize the entire swing trajectory of specific kinematic variables (performance variables); and 2) the level of trajectory stabilization is similar between regular and ladder walking and 3) is higher for forelimbs compared with hindlimbs. We used the framework of the uncontrolled manifold (UCM) hypothesis to quantify the structure of variance of limb kinematics in the limb segment orientation space across steps. Two components of variance were quantified for each potential performance variable, one of which affected it ("bad variance," variance orthogonal to the UCM, VORT) while the other one did not ("good variance," variance within the UCM, VUCM). The analysis of five candidate performance variables revealed that cats during both locomotor behaviors stabilize 1) paw vertical position during the entire swing (VUCM > VORT, except in mid-hindpaw swing of ladder walking) and 2) horizontal paw position in initial and terminal swing (except for the entire forepaw swing of regular walking). We also found that the limb length was typically stabilized in midswing, whereas limb orientation was not (VUCM ≤ VORT) for both limbs and behaviors during entire swing. We conclude that stabilization of paw position in early and terminal swing enables accurate and stable locomotion, while stabilization of vertical paw position in midswing helps paw clearance. This study is the first to demonstrate the applicability of the UCM-based analysis to nonhuman movement.
Wide range tuning of resonant frequency for a vortex core in a regular triangle magnet.
Yakata, Satoshi; Tanaka, Terumitsu; Kiseki, Kohei; Matsuyama, Kimihide; Kimura, Takashi
2013-12-20
A magnetic vortex structure stabilized in a micron or nano-sized ferromagnetic disk has a strong potential as a unit cell for spin-based nano-electronic devices because of negligible magnetostatic interaction and superior thermal stability. Moreover, various intriguing fundamental physics such as bloch point reversal and symmetry breaking can be induced in the dynamical behaviors in the magnetic vortex. The static and dynamic properties of the magnetic vortex can be tuned by the disk dimension and/or the separation distance between the disks. However, to realize these modifications, the preparations of other devices with different sample geometries are required. Here, we experimentally demonstrate that, in a regular-triangle Permalloy dot, the dynamic properties of a magnetic vortex are greatly modified by the application of the in-plane magnetic field. The obtained wide range tunability based on the asymmetric position dependence of the core potential provides attractive performances in the microwave spintronic devices.
Learning regularization parameters for general-form Tikhonov
Chung, Julianne; Español, Malena I.
2017-07-01
Computing regularization parameters for general-form Tikhonov regularization can be an expensive and difficult task, especially if multiple parameters or many solutions need to be computed in real time. In this work, we assume training data is available and describe an efficient learning approach for computing regularization parameters that can be used for a large set of problems. We consider an empirical Bayes risk minimization framework for finding regularization parameters that minimize average errors for the training data. We first extend methods from Chung et al (2011 SIAM J. Sci. Comput. 33 3132-52) to the general-form Tikhonov problem. Then we develop a learning approach for multi-parameter Tikhonov problems, for the case where all involved matrices are simultaneously diagonalizable. For problems where this is not the case, we describe an approach to compute near-optimal regularization parameters by using operator approximations for the original problem. Finally, we propose a new class of regularizing filters, where solutions correspond to multi-parameter Tikhonov solutions, that requires less data than previously proposed optimal error filters, avoids the generalized SVD, and allows flexibility and novelty in the choice of regularization matrices. Numerical results for 1D and 2D examples using different norms on the errors show the effectiveness of our methods.
Semisupervised Support Vector Machines With Tangent Space Intrinsic Manifold Regularization.
Sun, Shiliang; Xie, Xijiong
2016-09-01
Semisupervised learning has been an active research topic in machine learning and data mining. One main reason is that labeling examples is expensive and time-consuming, while there are large numbers of unlabeled examples available in many practical problems. So far, Laplacian regularization has been widely used in semisupervised learning. In this paper, we propose a new regularization method called tangent space intrinsic manifold regularization. It is intrinsic to data manifold and favors linear functions on the manifold. Fundamental elements involved in the formulation of the regularization are local tangent space representations, which are estimated by local principal component analysis, and the connections that relate adjacent tangent spaces. Simultaneously, we explore its application to semisupervised classification and propose two new learning algorithms called tangent space intrinsic manifold regularized support vector machines (TiSVMs) and tangent space intrinsic manifold regularized twin SVMs (TiTSVMs). They effectively integrate the tangent space intrinsic manifold regularization consideration. The optimization of TiSVMs can be solved by a standard quadratic programming, while the optimization of TiTSVMs can be solved by a pair of standard quadratic programmings. The experimental results of semisupervised classification problems show the effectiveness of the proposed semisupervised learning algorithms.
Fractional norm regularization: learning with very few relevant features.
Kaban, Ata
2013-06-01
Learning in the presence of a large number of irrelevant features is an important problem in high-dimensional tasks. Previous studies have shown that L1-norm regularization can be effective in such cases while L2-norm regularization is not. Furthermore, work in compressed sensing suggests that regularization by nonconvex (e.g., fractional) semi-norms may outperform L1-regularization. However, for classification it is largely unclear when this may or may not be the case. In addition, the nonconvex problem is harder to solve than the convex L1 problem. In this paper, we provide a more in-depth analysis to elucidate the potential advantages and pitfalls of nonconvex regularization in the context of logistic regression where the regularization term employs the family of Lq semi-norms. First, using results from the phenomenon of concentration of norms and distances in high dimensions, we gain intuition about the working of sparse estimation when the dimensionality is very high. Second, using the probably approximately correct (PAC)-Bayes methodology, we give a data-dependent bound on the generalization error of Lq-regularized logistic regression, which is applicable to any algorithm that implements this model, and may be used to predict its generalization behavior from the training set alone. Third, we demonstrate the usefulness of our approach by experiments and applications, where the PAC-Bayes bound is used to guide the choice of semi-norm in the regularization term. The results support the conclusion that the optimal choice of regularization depends on the relative fraction of relevant versus irrelevant features, and a fractional norm with a small exponent is most suitable when the fraction of relevant features is very small.
Hahonou, Eric Komlavi
international intervention in Niger. Their main objective is to secure their own strategic, economic and political interests by strengthening the Nigerien authorities through direct intervention and capacity building activities. For western states reinforcing state security institutions and stabilizing elite...... rule constitute the only realistic path to defend their own interests. The report suggests that international support of Nigerien security forces could be counter-productive for the re-establishment of state authority and legitimacy in the long-term. Brutal repression and violation of human rights...
Regularity for solutions of non local parabolic equations
Lara, Héctor A Chang
2011-01-01
We study the regularity of solutions of parabolic fully nonlinear nonlocal equations. We proof $C^\\a$ regularity in space and time and for translation invariant equations and under different assumptions on the kernels $C^{1,\\a}$ in space and time regularity. The proofs rely on a weak parabolic ABP inspired in recent work done by L. Silvestre and the classic ideas of K. Tso and L. Wang. Our results remain uniform as $\\s\\to2$ allowing us to understand the non local theory as an extension to the classical one.
Regularity for solutions of non local, non symmetric equations
Lara, Hector Chang
2011-01-01
We study the regularity for solutions of fully nonlinear integro differential equations with respect to nonsymmetric kernels. More precisely, we assume that our operator is elliptic with respect to a family of integro differential linear operators where the symmetric part of the kernels have a fixed homogeneity $\\sigma$ and the skew symmetric part have strictly smaller homogeneity $\\tau$. We prove a weak ABP estimate and $C^{1,\\alpha}$ regularity. Our estimates remain uniform as we take $\\sigma \\to 2$ and $\\tau \\to 1$ so that this extends the regularity theory for elliptic differential equations with dependence on the gradient.
VIBRATING VELOCITY RECONSTRUCTION USING IBEM AND TIKHONOV REGULARIZATION
无
2003-01-01
The inverse problem to determine the vibrating velocity from known exterior field measurement pressure, involves the solution of a discrete ill-posed problem. To facilitate the computation of a meaningful approximate solution possible, the indirect boundary element method (IBEM) code for investigating vibration velocity reconstruction and Tikhonov regularization method by means of singular value decomposition (SVD) are used. The amount of regularization is determined by a regularization parameter. Its optimal value is given by the L-curve approach. Numerical results indicate the reconstructed normal surface velocity is a good approximation to the real source.
Maximal regularity of second order delay equations in Banach spaces
无
2010-01-01
We give necessary and sufficient conditions of Lp-maximal regularity(resp.B sp ,q-maximal regularity or F sp ,q-maximal regularity) for the second order delay equations:u″(t)=Au(t) + Gu’t + F u t + f(t), t ∈ [0, 2π] with periodic boundary conditions u(0)=u(2π), u′(0)=u′(2π), where A is a closed operator in a Banach space X,F and G are delay operators on Lp([-2π, 0];X)(resp.Bsp ,q([2π, 0];X) or Fsp,q([-2π, 0;X])).
Regularization theory for ill-posed problems selected topics
Lu, Shuai
2013-01-01
Thismonograph is a valuable contribution to thehighly topical and extremly productive field ofregularisationmethods for inverse and ill-posed problems. The author is an internationally outstanding and acceptedmathematicianin this field. In his book he offers a well-balanced mixtureof basic and innovative aspects.He demonstrates new,differentiatedviewpoints, and important examples for applications. The bookdemontrates thecurrent developments inthe field of regularization theory,such as multiparameter regularization and regularization in learning theory. The book is written for graduate and PhDs
Generalization Performance of Regularized Ranking With Multiscale Kernels.
Zhou, Yicong; Chen, Hong; Lan, Rushi; Pan, Zhibin
2016-05-01
The regularized kernel method for the ranking problem has attracted increasing attentions in machine learning. The previous regularized ranking algorithms are usually based on reproducing kernel Hilbert spaces with a single kernel. In this paper, we go beyond this framework by investigating the generalization performance of the regularized ranking with multiscale kernels. A novel ranking algorithm with multiscale kernels is proposed and its representer theorem is proved. We establish the upper bound of the generalization error in terms of the complexity of hypothesis spaces. It shows that the multiscale ranking algorithm can achieve satisfactory learning rates under mild conditions. Experiments demonstrate the effectiveness of the proposed method for drug discovery and recommendation tasks.
ON REGULARITY THEOREMS FOR LINEARLY INVARIANT FAMILIES OF HARMONIC FUNCTIONS
E. G. Ganenkova
2015-05-01
Full Text Available The classical theorem of growth regularity in the class S of analytic and univalent in the unit disc ∆ functions ƒ describes the growth character of different functionals of ƒ Є S and z Є ∆ as z tends to δ∆. Earlier the authors proved the theorems of growth and decrease regularity for harmonic and sense-preserving in ∆ functions which generalized the classical result for the class S. In the presented paper we establish new properties of harmonic sense-preserving functions, connected with the regularity theorems. The effects both common for analytic and harmonic case and specific for harmonic functions are displayed.
Universality in the flooding of regular islands by chaotic states.
Bäcker, Arnd; Ketzmerick, Roland; Monastra, Alejandro G
2007-06-01
We investigate the structure of eigenstates in systems with a mixed phase space in terms of their projection onto individual regular tori. Depending on dynamical tunneling rates and the Heisenberg time, regular states disappear and chaotic states flood the regular tori. For a quantitative understanding we introduce a random matrix model. The resulting statistical properties of eigenstates as a function of an effective coupling strength are in very good agreement with numerical results for a kicked system. We discuss the implications of these results for the applicability of the semiclassical eigenfunction hypothesis.
Closedness type regularity conditions in convex optimization and beyond
Sorin-Mihai Grad
2016-09-01
Full Text Available The closedness type regularity conditions have proven during the last decade to be viable alternatives to their more restrictive interiority type counterparts, in both convex optimization and different areas where it was successfully applied. In this review article we de- and reconstruct some closedness type regularity conditions formulated by means of epigraphs and subdifferentials, respectively, for general optimization problems in order to stress that they arise naturally when dealing with such problems. The results are then specialized for constrained and unconstrained convex optimization problems. We also hint towards other classes of optimization problems where closedness type regularity conditions were successfully employed and discuss other possible applications of them.
Wissocq, Gauthier; Gourdain, Nicolas; Malaspinas, Orestis; Eyssartier, Alexandre
2017-02-01
This paper reports the investigations done to adapt the Characteristic Boundary Conditions (CBC) to the Lattice-Boltzmann formalism for high Reynolds number applications. Three CBC formalisms are implemented and tested in an open source LBM code: the baseline local one-dimension inviscid (BL-LODI) approach, its extension including the effects of the transverse terms (CBC-2D) and a local streamline approach in which the problem is reformulated in the incident wave framework (LS-LODI). Then all implementations of the CBC methods are tested for a variety of test cases, ranging from canonical problems (such as 2D plane and spherical waves and 2D vortices) to a 2D NACA profile at high Reynolds number (Re =105), representative of aeronautic applications. The LS-LODI approach provides the best results for pure acoustics waves (plane and spherical waves). However, it is not well suited to the outflow of a convected vortex for which the CBC-2D associated with a relaxation on density and transverse waves provides the best results. As regards numerical stability, a regularized adaptation is necessary to simulate high Reynolds number flows. The so-called regularized FD (Finite Difference) adaptation, a modified regularized approach where the off-equilibrium part of the stress tensor is computed thanks to a finite difference scheme, is the only tested adaptation that can handle the high Reynolds computation.
Chen, Xueli, E-mail: xlchen@xidian.edu.cn, E-mail: jimleung@mail.xidian.edu.cn; Yang, Defu; Zhang, Qitan; Liang, Jimin, E-mail: xlchen@xidian.edu.cn, E-mail: jimleung@mail.xidian.edu.cn [School of Life Science and Technology, Xidian University, Xi' an 710071 (China); Engineering Research Center of Molecular and Neuro Imaging, Ministry of Education (China)
2014-05-14
Even though bioluminescence tomography (BLT) exhibits significant potential and wide applications in macroscopic imaging of small animals in vivo, the inverse reconstruction is still a tough problem that has plagued researchers in a related area. The ill-posedness of inverse reconstruction arises from insufficient measurements and modeling errors, so that the inverse reconstruction cannot be solved directly. In this study, an l{sub 1/2} regularization based numerical method was developed for effective reconstruction of BLT. In the method, the inverse reconstruction of BLT was constrained into an l{sub 1/2} regularization problem, and then the weighted interior-point algorithm (WIPA) was applied to solve the problem through transforming it into obtaining the solution of a series of l{sub 1} regularizers. The feasibility and effectiveness of the proposed method were demonstrated with numerical simulations on a digital mouse. Stability verification experiments further illustrated the robustness of the proposed method for different levels of Gaussian noise.
On a regularized family of models for homogeneous incompressible two-phase flows
Gal, Ciprian G
2014-01-01
We consider a general family of regularized models for incompressible two-phase flows based on the Allen-Cahn formulation in n-dimensional compact Riemannian manifolds for n=2,3. The system we consider consists of a regularized family of Navier-Stokes equations (including the Navier-Stokes-{\\alpha}-like model, the Leray-{\\alpha} model, the Modified Leray-{\\alpha} model, the Simplified Bardina model, the Navier-Stokes-Voight model and the Navier-Stokes model) for the fluid velocity suitably coupled with a convective Allen-Cahn equation for the (phase) order parameter. We give a unified analysis of the entire three-parameter family of two-phase models using only abstract mapping properties of the principal dissipation and smoothing operators, and then use assumptions about the specific form of the parametrizations, leading to specific models, only when necessary to obtain the sharpest results. We establish existence, stability and regularity results, and some results for singular perturbations, which as special...
Hirota, Makoto; Morrison, Philip J.
2016-05-01
Linear stability of inviscid, parallel, and stably stratified shear flow is studied under the assumption of smooth strictly monotonic profiles of shear flow and density, so that the local Richardson number is positive everywhere. The marginally unstable modes are systematically found by solving a one-parameter family of regular Sturm-Liouville problems, which can determine the stability boundaries more efficiently than solving the Taylor-Goldstein equation directly. By arguing for the non-existence of a marginally unstable mode, we derive new sufficient conditions for stability, which generalize the Rayleigh-Fjørtoft criterion for unstratified shear flows.
Prot, Olivier; SantolíK, OndřEj; Trotignon, Jean-Gabriel; Deferaudy, Hervé
2006-06-01
An entropy regularization algorithm (ERA) has been developed to compute the wave-energy density from electromagnetic field measurements. It is based on the wave distribution function (WDF) concept. To assess its suitability and efficiency, the algorithm is applied to experimental data that has already been analyzed using other inversion techniques. The FREJA satellite data that is used consists of six spectral matrices corresponding to six time-frequency points of an ELF hiss-event spectrogram. The WDF analysis is performed on these six points and the results are compared with those obtained previously. A statistical stability analysis confirms the stability of the solutions. The WDF computation is fast and without any prespecified parameters. The regularization parameter has been chosen in accordance with the Morozov's discrepancy principle. The Generalized Cross Validation and L-curve criterions are then tentatively used to provide a fully data-driven method. However, these criterions fail to determine a suitable value of the regularization parameter. Although the entropy regularization leads to solutions that agree fairly well with those already published, some differences are observed, and these are discussed in detail. The main advantage of the ERA is to return the WDF that exhibits the largest entropy and to avoid the use of a priori models, which sometimes seem to be more accurate but without any justification.
Towards the Right Hamiltonian for Singular Perturbations via Regularization and Extension Theory
Neidhardt, Hagen; Zagrebnov, Valentin
For singular potentials in quantum mechanics it can happen that the Schrödinger operator is not esssentially self-adjoint on a natural domain, i.e., each self-adjoint extension is a candidate for the right physical Hamiltonian. Traditional way to single out this Hamiltonian is the removing cut-offs for regularizing potential. Connecting regularization and extension theory we develop an abstract operator method to treat the problem of the right Hamiltonian. We show that, using the notion of the maximal (with respect to the perturbation) Friedrichs extension of unperturbed operator, one can classify the above problem as wellposed or ill-posed depending on intersection of the quadratic form domain of perturbation and deficiency subspace corresponding to restriction of unperturbed operator to stability domain. If this intersection is trivial, then the right Hamiltonian is unique: it coincides with the form sum of perturbation and the Friedrich extension of the unperturbed operator restricted to the stability domain. Otherwise it is not unique: the family of “right Hamiltonians” can be described in terms of symmetric extensions reducing the ill-posed problem to the well-posed problem.
Increased Hepato-Splanchnic Vasoconstriction in Diabetics during Regular Hemodialysis.
Werner Ribitsch
Full Text Available Ultrafiltration (UF of excess fluid activates numerous compensatory mechanisms during hemodialysis (HD. The increase of both total peripheral and splanchnic vascular resistance is considered essential in maintaining hemodynamic stability. The aim of this study was to evaluate the extent of UF-induced changes in hepato-splanchnic blood flow and resistance in a group of maintenance HD patients during regular dialysis.Hepato-splanchnic flow resistance index (RI and hepato-splanchnic perfusion index (QI were measured in 12 chronic HD patients using a modified, non-invasive Indocyaningreen (ICG dilution method. During a midweek dialysis session we determined RI, QI, ICG disappearance rate (kICG, plasma volume (Vp, hematocrit (Hct, mean arterial blood pressure (MAP and heart rate (HR at four times in hourly intervals (t1 to t4. Dialysis settings were standardized and all patient studies were done in duplicate.In the whole study group mean UF volume was 1.86 ± 0.46 L, Vp dropped from 3.65 ± 0.77L at t1 to 3.40 ± 0.78L at t4, and all patients remained hemodynamically stable. In all patients RI significantly increased from 12.40 ± 4.21 mmHg∙s∙m2/mL at t1 to 14.94 ± 6.36 mmHg∙s∙m2/mL at t4 while QI significantly decreased from 0.61 ± 0.22 at t1 to 0.52 ± 0.20 L/min/m2 at t4, indicating active vasoconstriction. In diabetic subjects, however, RI was significantly larger than in non-diabetics at all time points. QI was lower in diabetic subjects.In chronic HD-patients hepato-splanchnic blood flow substantially decreases during moderate UF as a result of an active splanchnic vasoconstriction. Our data indicate that diabetic HD-patients are particularly prone to splanchnic ischemia and might therefore have an increased risk for bacterial translocation, endotoxemia and systemic inflammation.
Local conservative regularizations of compressible MHD and neutral flows
Krishnaswami, Govind S; Thyagaraja, Anantanarayanan
2016-01-01
Ideal systems like MHD and Euler flow may develop singularities in vorticity (w = curl v). Viscosity and resistivity provide dissipative regularizations of the singularities. In this paper we propose a minimal, local, conservative, nonlinear, dispersive regularization of compressible flow and ideal MHD, in analogy with the KdV regularization of the 1D kinematic wave equation. This work extends and significantly generalizes earlier work on incompressible Euler and ideal MHD. It involves a micro-scale cutoff length lambda which is a function of density, unlike in the incompressible case. In MHD, it can be taken to be of order the electron collisionless skin depth c/omega_pe. Our regularization preserves the symmetries of the original systems, and with appropriate boundary conditions, leads to associated conservation laws. Energy and enstrophy are subject to a priori bounds determined by initial data in contrast to the unregularized systems. A Hamiltonian and Poisson bracket formulation is developed and applied ...
Spelling-stress regularity effects are intact in developmental dyslexia.
Mundy, Ian R; Carroll, Julia M
2013-01-01
The current experiment investigated conflicting predictions regarding the effects of spelling-stress regularity on the lexical decision performance of skilled adult readers and adults with developmental dyslexia. In both reading groups, lexical decision responses were significantly faster and significantly more accurate when the orthographic structure of a word ending was a reliable as opposed to an unreliable predictor of lexical stress assignment. Furthermore, the magnitude of this spelling-stress regularity effect was found to be equivalent across reading groups. These findings are consistent with intact phoneme-level regularity effects also observed in dyslexia. The paper discusses how findings of intact spelling-sound regularity effects at both prosodic and phonemic levels, as well as other similar results, can be reconciled with the obvious difficulties that people with dyslexia experience in other domains of phonological processing.
A Regularized Algorithm for the Proximal Split Feasibility Problem
Zhangsong Yao
2014-01-01
Full Text Available The proximal split feasibility problem has been studied. A regularized method has been presented for solving the proximal split feasibility problem. Strong convergence theorem is given.
Regular n-simplices in Rn with vertices in Zn
XIA Jianguo; QIN Hourong
2004-01-01
In this paper the Ⅰ and Ⅱ regular n-simplices are introduced. We prove that the sufficient and necessary conditions for existence of an Ⅰ regular n-simplex in Rn are that if n is even then n= 4m(m + 1), and if n is odd then n= 4m + 1 with that n + 1 can be expressed as a sum of two integral squares or n = 4m - 1, and that the sufficient and necessary condition for existence of a Ⅱ regular n-simplex in Rn is n= 2m2 - 1 or n= 4m(m+1)(m ( ) N). The connection between regular n-simplex in Rn and combinational design is given.
Mini-Stroke vs. Regular Stroke: What's the Difference?
... How is a ministroke different from a regular stroke? Answers from Jerry W. Swanson, M.D. When ... brain, spinal cord or retina, which may cause stroke-like symptoms but does not damage brain cells ...
Liouville and Toda dyonic branes: regularity and BPS limit
Gal'tsov, Dmitri V.; Orlov, Dmitri G.
2005-01-01
We reconsider dyonic p-brane solutions derivable from Liouville and Toda integrable systems and investigate their geometric structure. It is shown that the non-BPS non-black dyonic branes are not regular on the horizon.
Automatic Constraint Detection for 2D Layout Regularization
Jiang, Haiyong
2015-09-18
In this paper, we address the problem of constraint detection for layout regularization. As layout we consider a set of two-dimensional elements where each element is represented by its bounding box. Layout regularization is important for digitizing plans or images, such as floor plans and facade images, and for the improvement of user created contents, such as architectural drawings and slide layouts. To regularize a layout, we aim to improve the input by detecting and subsequently enforcing alignment, size, and distance constraints between layout elements. Similar to previous work, we formulate the layout regularization as a quadratic programming problem. In addition, we propose a novel optimization algorithm to automatically detect constraints. In our results, we evaluate the proposed framework on a variety of input layouts from different applications, which demonstrates our method has superior performance to the state of the art.
Kaluza-Klein thresholds and regularization (in)dependence
Kubo, Jisuke; Terao, Haruhiko; Zoupanos, George
2000-05-15
We present a method to control the regularization scheme dependence in the running of couplings in Kaluza-Klein theories. Specifically we consider the scalar theory in five dimensions, assuming that one dimension is compactified, and we study various regularization schemes in order to analyze concretely the regularization scheme dependence of the Kaluza-Klein threshold effects. We find that in one-loop order, although the {beta}-functions are different for the different schemes, the net difference in the running of the coupling among the different schemes is very small for the entire range of energies. Our results have been extended to include more than one radius, and the gauge coupling unification is re-examined. Strings are also used as a regulator. We obtain a particular regularization scheme of the effective field theory which can accurately describe the string Kaluza-Klein threshold effects.
Weak monotonicity inequality and partial regularity for harmonic maps
沈尧天; 严树森
1999-01-01
The notion of locally weak monotonicity inequality for weakly harmonic maps is introduced and various results on this class of maps are obtained. For example, the locally weak monotonicity inequality is nearly equivalent to the ε-regularity.
Lipschitz regularity results for nonlinear strictly elliptic equations and applications
Ley, Olivier; Nguyen, Vinh Duc
2017-10-01
Most of Lipschitz regularity results for nonlinear strictly elliptic equations are obtained for a suitable growth power of the nonlinearity with respect to the gradient variable (subquadratic for instance). For equations with superquadratic growth power in gradient, one usually uses weak Bernstein-type arguments which require regularity and/or convex-type assumptions on the gradient nonlinearity. In this article, we obtain new Lipschitz regularity results for a large class of nonlinear strictly elliptic equations with possibly arbitrary growth power of the Hamiltonian with respect to the gradient variable using some ideas coming from Ishii-Lions' method. We use these bounds to solve an ergodic problem and to study the regularity and the large time behavior of the solution of the evolution equation.
The lattice generated by some subvarieties of completely regular semigroups
2008-01-01
Using a construction theorem of cryptogroups and congruence methods, we determine an 18-element lattice, generated by {NOBG, ROBG, OBG, NBA, RBA, BA}, of subvarieties of completely regular semigroups.
Dimensional regularization and renormalization of non-commutative QFT
Gurau, R
2007-01-01
Using the recently introduced parametric representation of non-commutative quantum field theory, we implement here the dimensional regularization and renormalization of the vulcanized $\\Phi^{\\star 4}_4$ model on the Moyal space.
BILINGUAL AND REGULAR CLASS STUDENTS’ ATTITUDES TOWARDS ENGLISH
Nihta Liando
2013-01-01
Full Text Available This article presents the results of the study investigating the relationship between the students’ attitudes towards English and their English achievements in bilingual and regular classes and investigating the differences. The study was conducted in a junior high school in Manado. There are 30 Year VIII students in each bilingual class and each regular class. The results are as follows. First, there is a significant correlation between the students’ attitudes towards English and their achievements. Second, there is a significant difference in their English achievements between bilingual class students and regular students. Third, female students have higher English achievements than male students. Bilingual class students have more positive attitudes and higher English learning achievements than regular class students.
dental services and attitudes towards its regular utilization among ...
responsible for 6.1million days of admission related ill health ... 2Department of Preventive Medicine and Primary Care, Faculty of the Clinical Sciences, University of Ibadan ... among civil servants and their attitudes towards its regular use.
NOVEL REGULARIZED BOUNDARY INTEGRAL EQUATIONS FOR POTENTIAL PLANE PROBLEMS
ZHANG Yao-ming; L(U) He-xiang; WANG Li-min
2006-01-01
The universal practices have been centralizing on the research of regularization to the direct boundary integal equations (DBIEs). The character is elimination of singularities by using the simple solutions. However, up to now the research of regularization to the first kind integral equations for plane potential problems has never been found in previous literatures. The presentation is mainly devoted to the research on the regularization of the singular boundaryintegral equations with indirect unknowns. A novel view and idea is presented herein, in which the regularized boundary integral equations with indirect unknowns without including the Cauchy principal value (CPV) and Hadamard-finite-part (HFP) integrals are established for the plane potential problems.With some numerical results, it is shown that the better accuracy and higher efficiency,especially on the boundary, can be achieved by the present system.
On almost regularity and π-normality of topological spaces
Saad Thabit, Sadeq Ali; Kamarulhaili, Hailiza
2012-05-01
π-Normality is a weaker version of normality. It was introduced by Kalantan in 2008. π-Normality lies between normality and almost normality (resp. quasi-normality). The importance of this topological property is that it behaves slightly different from normality and almost normality (quasi-normality). π-Normality is neither a productive nor a hereditary property in general. In this paper, some properties of almost regular spaces are presented. In particular, a few results on almost regular spaces are improved. Some relationships between almost regularity and π-normality are presented. π-Generalized closed sets are used to obtain a characterization and preservation theorems of π-normal spaces. Also, we investigate that an almost regular Lindelöf space (resp. with σ-locally finite base) is not necessarily π-normal by giving two counterexamples. An almost normality of the Rational Sequence topology is proved.
Searching massive data streams using multipattern regular expressions
J. Stewart; J. Uckelman
2011-01-01
This paper describes the design and implementation of lightgrep, a multipattern regular expression search tool that efficiently searches massive data streams. lightgrep addresses several shortcomings of existing digital forensic tools by taking advantage of recent developments in automata theory. Th
On E-solid Regular Semigroups］With Inverse Transversals
无
2000-01-01
@@Let S be a regular semigroup. An inverse subsemigroupS of S is called an %inverse transversal % if S contains an unique inverse x for each x S.In this case, I=e E(S) | ee{=e and=g E(S) | g{ g=g,are left and right regular subbands of S, respectively,where E(S) denotes the set of idempotents inS. Denote E=E(S). A regular semigroup S is called E-solid ifR|E(S)L|E(S)=L|E(S)R|E(S).A regular semigroup S is E-solid if and only ifthere is an inversecongruence on S over completely simple semigroups(i.e. every idempotent class e is a completelysimple semigroup), and named a % coextension of inverse semigroup by completely simple semigroups
Automatic Constraint Detection for 2D Layout Regularization.
Jiang, Haiyong; Nan, Liangliang; Yan, Dong-Ming; Dong, Weiming; Zhang, Xiaopeng; Wonka, Peter
2016-08-01
In this paper, we address the problem of constraint detection for layout regularization. The layout we consider is a set of two-dimensional elements where each element is represented by its bounding box. Layout regularization is important in digitizing plans or images, such as floor plans and facade images, and in the improvement of user-created contents, such as architectural drawings and slide layouts. To regularize a layout, we aim to improve the input by detecting and subsequently enforcing alignment, size, and distance constraints between layout elements. Similar to previous work, we formulate layout regularization as a quadratic programming problem. In addition, we propose a novel optimization algorithm that automatically detects constraints. We evaluate the proposed framework using a variety of input layouts from different applications. Our results demonstrate that our method has superior performance to the state of the art.
catering for children with special needs in the regular classroom
Elizabeth Egbochuku
are overcrowded and over populated with little or no attention paid to the special child. Furthermore ... children who cannot benefit maximally from the regular classroom teaching/learning ... done by parents, teachers, siblings and classmates.
Estimating signal loss in regularized GRACE gravity field solutions
Swenson, S. C.; Wahr, J. M.
2011-05-01
Gravity field solutions produced using data from the Gravity Recovery and Climate Experiment (GRACE) satellite mission are subject to errors that increase as a function of increasing spatial resolution. Two commonly used techniques to improve the signal-to-noise ratio in the gravity field solutions are post-processing, via spectral filters, and regularization, which occurs within the least-squares inversion process used to create the solutions. One advantage of post-processing methods is the ability to easily estimate the signal loss resulting from the application of the spectral filter by applying the filter to synthetic gravity field coefficients derived from models of mass variation. This is a critical step in the construction of an accurate error budget. Estimating the amount of signal loss due to regularization, however, requires the execution of the full gravity field determination process to create synthetic instrument data; this leads to a significant cost in computation and expertise relative to post-processing techniques, and inhibits the rapid development of optimal regularization weighting schemes. Thus, while a number of studies have quantified the effects of spectral filtering, signal modification in regularized GRACE gravity field solutions has not yet been estimated. In this study, we examine the effect of one regularization method. First, we demonstrate that regularization can in fact be performed as a post-processing step if the solution covariance matrix is available. Regularization then is applied as a post-processing step to unconstrained solutions from the Center for Space Research (CSR), using weights reported by the Centre National d'Etudes Spatiales/Groupe de Recherches de geodesie spatiale (CNES/GRGS). After regularization, the power spectra of the CSR solutions agree well with those of the CNES/GRGS solutions. Finally, regularization is performed on synthetic gravity field solutions derived from a land surface model, revealing that in
Torsion theories of pseudo-regular S-systems
无
2002-01-01
The concept of pseudo-regular S-system is introduced. A torsion theory τu = ( Us, Us) with its torsion class Us consisting of pseudo-regular S-systems is constructed. Its corresponding quasi-filter is completely described. A number of results on the relations between τu and two special torsion theories, the stable and Larnbek torsion theories, are obtained.
Finite Deformations of Conformal Field Theories Using Analytically Regularized Connections
von Gussich, Alexander; Sundell, Per
1996-01-01
We study some natural connections on spaces of conformal field theories using an analytical regularization method. The connections are based on marginal conformal field theory deformations. We show that the analytical regularization preserves conformal invariance and leads to integrability of the marginal deformations. The connections are shown to be flat and to generate well-defined finite parallel transport. These finite parallel transports yield formulations of the deformed theories in the...
Total Variation Regularization of Matrix-Valued Images
Oddvar Christiansen
2007-01-01
Blomgren and Chan in 1998. We treat the diffusion matrix D implicitly as the product D=LLT, and work with the elements of L as variables, instead of working directly on the elements of D. This ensures positive definiteness of the tensor during the regularization flow, which is essential when regularizing DTI. We perform numerical experiments on both synthetical data and 3D human brain DTI, and measure the quantitative behavior of the proposed model.
Borderline personality disorder and regularly drinking alcohol before sex.
Thompson, Ronald G; Eaton, Nicholas R; Hu, Mei-Chen; Hasin, Deborah S
2017-07-01
Drinking alcohol before sex increases the likelihood of engaging in unprotected intercourse, having multiple sexual partners and becoming infected with sexually transmitted infections. Borderline personality disorder (BPD), a complex psychiatric disorder characterised by pervasive instability in emotional regulation, self-image, interpersonal relationships and impulse control, is associated with substance use disorders and sexual risk behaviours. However, no study has examined the relationship between BPD and drinking alcohol before sex in the USA. This study examined the association between BPD and regularly drinking before sex in a nationally representative adult sample. Participants were 17 491 sexually active drinkers from Wave 2 of the National Epidemiologic Survey on Alcohol and Related Conditions. Logistic regression models estimated effects of BPD diagnosis, specific borderline diagnostic criteria and BPD criterion count on the likelihood of regularly (mostly or always) drinking alcohol before sex, adjusted for controls. Borderline personality disorder diagnosis doubled the odds of regularly drinking before sex [adjusted odds ratio (AOR) = 2.26; confidence interval (CI) = 1.63, 3.14]. Of nine diagnostic criteria, impulsivity in areas that are self-damaging remained a significant predictor of regularly drinking before sex (AOR = 1.82; CI = 1.42, 2.35). The odds of regularly drinking before sex increased by 20% for each endorsed criterion (AOR = 1.20; CI = 1.14, 1.27) DISCUSSION AND CONCLUSIONS: This is the first study to examine the relationship between BPD and regularly drinking alcohol before sex in the USA. Substance misuse treatment should assess regularly drinking before sex, particularly among patients with BPD, and BPD treatment should assess risk at the intersection of impulsivity, sexual behaviour and substance use. [Thompson Jr RG, Eaton NR, Hu M-C, Hasin DS Borderline personality disorder and regularly drinking alcohol
Viscous Regularization of the Euler Equations and Entropy Principles
Guermond, Jean-Luc
2014-03-11
This paper investigates a general class of viscous regularizations of the compressible Euler equations. A unique regularization is identified that is compatible with all the generalized entropies, à la [Harten et al., SIAM J. Numer. Anal., 35 (1998), pp. 2117-2127], and satisfies the minimum entropy principle. A connection with a recently proposed phenomenological model by [H. Brenner, Phys. A, 370 (2006), pp. 190-224] is made. © 2014 Society for Industrial and Applied Mathematics.