5,067,462 research outputs found

    Potential estimates and quasilinear parabolic equations with measure data

    Get PDF
    In this paper, we study the existence and regularity of the quasilinear parabolic equations: utdiv(A(x,t,u))=B(u,u)+μu_t-\text{div}(A(x,t,\nabla u))=B(u,\nabla u)+\mu in RN+1\mathbb{R}^{N+1}, RN×(0,)\mathbb{R}^N\times(0,\infty) and a bounded domain Ω×(0,T)RN+1\Omega\times (0,T)\subset\mathbb{R}^{N+1}. Here N2N\geq 2, the nonlinearity AA fulfills standard growth conditions and BB term is a continuous function and μ\mu is a radon measure. Our first task is to establish the existence results with B(u,u)=±uq1uB(u,\nabla u)=\pm|u|^{q-1}u, for q>1q>1. We next obtain global weighted-Lorentz, Lorentz-Morrey and Capacitary estimates on gradient of solutions with B0B\equiv 0, under minimal conditions on the boundary of domain and on nonlinearity AA. Finally, due to these estimates, we solve the existence problems with B(u,u)=uqB(u,\nabla u)=|\nabla u|^q for q>1q>1.Comment: 120

    Profile

    Get PDF

    Super-Linear Convergence of Dual Augmented-Lagrangian Algorithm for Sparsity Regularized Estimation

    Full text link
    We analyze the convergence behaviour of a recently proposed algorithm for regularized estimation called Dual Augmented Lagrangian (DAL). Our analysis is based on a new interpretation of DAL as a proximal minimization algorithm. We theoretically show under some conditions that DAL converges super-linearly in a non-asymptotic and global sense. Due to a special modelling of sparse estimation problems in the context of machine learning, the assumptions we make are milder and more natural than those made in conventional analysis of augmented Lagrangian algorithms. In addition, the new interpretation enables us to generalize DAL to wide varieties of sparse estimation problems. We experimentally confirm our analysis in a large scale 1\ell_1-regularized logistic regression problem and extensively compare the efficiency of DAL algorithm to previously proposed algorithms on both synthetic and benchmark datasets.Comment: 51 pages, 9 figure

    TRECVID: benchmarking the effectiveness of information retrieval tasks on digital video

    Get PDF
    Many research groups worldwide are now investigating techniques which can support information retrieval on archives of digital video and as groups move on to implement these techniques they inevitably try to evaluate the performance of their techniques in practical situations. The difficulty with doing this is that there is no test collection or any environment in which the effectiveness of video IR or video IR sub-tasks, can be evaluated and compared. The annual series of TREC exercises has, for over a decade, been benchmarking the effectiveness of systems in carrying out various information retrieval tasks on text and audio and has contributed to a huge improvement in many of these. Two years ago, a track was introduced which covers shot boundary detection, feature extraction and searching through archives of digital video. In this paper we present a summary of the activities in the TREC Video track in 2002 where 17 teams from across the world took part

    Perturbation Theory for Antisymmetric Tensor Fields in Four Dimensions

    Full text link
    Perturbation theory for a class of topological field theories containing antisymmetric tensor fields is considered. These models are characterized by a supersymmetric structure which allows to establish their perturbative finiteness.Comment: 23 page

    Cyclic Low-Density MDS Array Codes

    Get PDF
    We construct two infinite families of low density MDS array codes which are also cyclic. One of these families includes the first such sub-family with redundancy parameter r > 2. The two constructions have different algebraic formulations, though they both have the same indirect structure. First MDS codes that are not cyclic are constructed and then by applying a certain mapping to their parity check matrices, non-equivalent cyclic codes with the same distance and density properties are obtained. Using the same proof techniques, a third infinite family of quasi-cyclic codes can be constructed

    Community building and virtual teamwork in an online learning environment

    Get PDF
    In the world of OTIS, an online Internet School for occupational therapists, students from four European countries were encouraged to work collaboratively through problem based learning by interacting with each other in a virtual semi-immersive environment. This paper aims to explore the issues that there was little interaction between students from different tutorial groups and virtual teamwork developed in each of the cross cultural tutorial groups. Synchronous data from European students was captured during tutorial sessions and peer booked meetings and evidence suggests that communities of interest were established. It is possible to conclude that collaborative systems can be designed, which encourage students to build trust and teamwork in a cross cultural online learning environment. </p

    The maximum of Brownian motion minus a parabola

    Full text link
    We derive a simple integral representation for the distribution of the maximum of Brownian motion minus a parabola, which can be used for computing the density and moments of the distribution, both for one-sided and two-sided Brownian motion.Comment: 7 pages, 4 figures, to appear in the Electronic Journal of Probabilit

    Color Ferromagnetism of Quark Matter ; a Possible Origin of Strong Magnetic Field in Magnetars

    Full text link
    We show a possibility that strong ``magnetic field'' 1015\sim 10^{15} G is produced by color ferromagnetic quark matter in neutron stars. In the quark matter a color magnetic field is generated spontaneously owing to Savvidy mechanism and a gluon condensate arises for the stabilization of the field. Since the quark matter is electrically charged in the neutron stars, the rotation of the quarks around the color magnetic field produces the strong ``magnetic field''.Comment: 7 page

    Cascading Failures in Power Grids - Analysis and Algorithms

    Full text link
    This paper focuses on cascading line failures in the transmission system of the power grid. Recent large-scale power outages demonstrated the limitations of percolation- and epid- emic-based tools in modeling cascades. Hence, we study cascades by using computational tools and a linearized power flow model. We first obtain results regarding the Moore-Penrose pseudo-inverse of the power grid admittance matrix. Based on these results, we study the impact of a single line failure on the flows on other lines. We also illustrate via simulation the impact of the distance and resistance distance on the flow increase following a failure, and discuss the difference from the epidemic models. We then study the cascade properties, considering metrics such as the distance between failures and the fraction of demand (load) satisfied after the cascade (yield). We use the pseudo-inverse of admittance matrix to develop an efficient algorithm to identify the cascading failure evolution, which can be a building block for cascade mitigation. Finally, we show that finding the set of lines whose removal has the most significant impact (under various metrics) is NP-Hard and introduce a simple heuristic for the minimum yield problem. Overall, the results demonstrate that using the resistance distance and the pseudo-inverse of admittance matrix provides important insights and can support the development of efficient algorithms
    corecore