Loading

Error: Cannot Load Popup Box

Hit List

Title:

eXitor: A TOOL FOR THE ASSISTED EDITION OF XML DOCUMENTS V. FRESNO-FERNÁNDEZ, S. MONTALVO-HERRANZ, J. PÉREZ-IGLESIAS AND

Author:

Description:

XML and its associated technologies are increasingly being used in Electronic Publishing. This fact is due to some of its inherent characteristics: (1) XML allows separating the contents and the presentation format. (2) XML allows giving a logical structure to information. (3) XML allows associating semantics to the logical structure. There is a...

XML and its associated technologies are increasingly being used in Electronic Publishing. This fact is due to some of its inherent characteristics: (1) XML allows separating the contents and the presentation format. (2) XML allows giving a logical structure to information. (3) XML allows associating semantics to the logical structure. There is a general agreement that these features will be very important for the development of the semantic web. In this context there is a demand for XML editors. A comparative analysis of current XML editors reveals that most of them have two general lacks. Firstly, using these editors requires deep knowledge of the XML syntax and its DTD or the XML-Schema particular vocabulary. Their interfaces do not guide to user in the edition process, e.g. by showing him/her the different possibilities available at any moment with respect to vocabulary. This drawback is especially discouraging for naïve users. Secondly, the validation of a document is made on request to specific commands or on saving it. In the worst case, these tools allow generating an invalid document that accumulates errors and overwhelms the user during their correction. In this paper, we describe an editor of XML documents, called eXitor, that shares the common features of the main XML editors, but tries to solve the two problems quoted above. With respect to the visibility of XML syntax, the editor supports both naïve and expert users. For the first kind of users, the user can Minimize

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2008-08-14

Source:

http://www.lite.etsii.urjc.es/paper34_elpub2003_rev.pdf

http://www.lite.etsii.urjc.es/paper34_elpub2003_rev.pdf Minimize

Document Type:

text

Language:

en

DDC:

070 News media, journalism & publishing *(computed)*

Rights:

Metadata may be used without restrictions as long as the oai identifier remains attached to it.

Metadata may be used without restrictions as long as the oai identifier remains attached to it. Minimize

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

www.elsevier.com/locate/pr Volumetric restrictions in single particle 3DEM reconstruction

Author:

Description:

3D electron microscopy aims at the reconstruction of density volumes corresponding to the electrostatic potential distribution of macromolecules. There are many factors limiting the resolution achievable when this technique is applied to biological macromolecules: microscope imperfections, molecule flexibility, lack of projections from certain d...

3D electron microscopy aims at the reconstruction of density volumes corresponding to the electrostatic potential distribution of macromolecules. There are many factors limiting the resolution achievable when this technique is applied to biological macromolecules: microscope imperfections, molecule flexibility, lack of projections from certain directions, unknown angular distribution, noise, etc. In this communication we explore the quality gain in the reconstruction by including a priori knowledge such as particle symmetry, occupied volume, known surface relief, density nonnegativity and similarity to a known volume in order to improve the quality of the reconstruction. If the reconstruction is represented as a series expansion, such constraints can be expressed by set of equations that the expansion coefficients must satisfy. In this work, these equation sets are specified and combined in a novel way with the ART + blobs reconstruction algorithm. The effect of each one on the reconstruction of a realistic phantom is explored. Finally, the application of these restrictions to 3D reconstructions from experimental data are studied. Minimize

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2010-03-06

Source:

http://biocomp.cnb.csic.es/~coss/Articulos/Sorzano2007d.pdf

http://biocomp.cnb.csic.es/~coss/Articulos/Sorzano2007d.pdf Minimize

Document Type:

text

Language:

en

Subjects:

Tomography ; Constrained reconstruction ; Electron microscopy ; Single particles

Tomography ; Constrained reconstruction ; Electron microscopy ; Single particles Minimize

DDC:

004 Data processing & computer science *(computed)*

Rights:

Metadata may be used without restrictions as long as the oai identifier remains attached to it.

Metadata may be used without restrictions as long as the oai identifier remains attached to it. Minimize

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

SUXAMETHONIUM INFUSION RATE AND OBSERVED FASCICULATIONS: A dose-response study

Description:

Suxamethonium chloride (Sch) was administered i.v. to 36 adult males at six rates: 0.25 mg s−1 to 20 mg s−1. The infusion was discontinued either when there was no muscular response to tetanic stimulation of the ulnar nerve or when Sch 120 mg was exceeded. Six additional patients received a 30-mg i.v. bolus dose. Fasciculations in six areas of t...

Suxamethonium chloride (Sch) was administered i.v. to 36 adult males at six rates: 0.25 mg s−1 to 20 mg s−1. The infusion was discontinued either when there was no muscular response to tetanic stimulation of the ulnar nerve or when Sch 120 mg was exceeded. Six additional patients received a 30-mg i.v. bolus dose. Fasciculations in six areas of the body were scored from 0 to 3 and summated as a total fasciculation score. The times to first fasciculation, twitch suppression and tetanus suppression were inversely related to the infusion rates. Fasciculations in the six areas and the total fasciculation score were related directly to the rate of infusion. Total fasciculation scores in the 30-mg bolus group and the 5-mg s−1 and 20-mg s−1 infusion groups were not significantly different. Minimize

Publisher:

Oxford University Press

Year of Publication:

1979-03-01 00:00:00.0

Document Type:

TEXT

Language:

en

Subjects:

Clinical Investigations

Clinical Investigations Minimize

Rights:

Copyright (C) 1979, Oxford University Press

Copyright (C) 1979, Oxford University Press Minimize

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

On the transfer of energy towards infinity in the theory of weak turbulence for the nonlinear Schr\"odinger equation

Author:

Description:

We study the mathematical properties of a kinetic equation which describes the long time behaviour of solutions to the weak turbulence equation associated to the cubic nonlinear Schr\"odinger equation. In particular, we give a precise definition of weak solutions and prove global existence of solutions for all initial data with finite mass. We a...

We study the mathematical properties of a kinetic equation which describes the long time behaviour of solutions to the weak turbulence equation associated to the cubic nonlinear Schr\"odinger equation. In particular, we give a precise definition of weak solutions and prove global existence of solutions for all initial data with finite mass. We also prove that any nontrivial initial datum yields the instantaneous onset of a condensate, i.e. a Dirac mass at the origin for any positive time. Furthermore we show that the only stationary solutions with finite total measure are Dirac masses at the origin. We finally construct solutions with finite energy, which is transferred to infinity in a self-similar manner. Minimize

Year of Publication:

2014-10-08

Document Type:

text

Subjects:

Mathematical Physics ; 35Q20 ; 35B40 ; 35C06 ; 35D30 ; 45G05

Mathematical Physics ; 35Q20 ; 35B40 ; 35C06 ; 35D30 ; 45G05 Minimize

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Ant foraging and minimal paths in simple graphs

Author:

Description:

Ants are known to be able to find paths of minimal length between the nest and food sources. The deposit of pheromones while they search for food and their chemotactical response to them has been proposed as a crucial element in the mechanism for finding minimal paths. We investigate both individual and collective behavior of ants in some simple...

Ants are known to be able to find paths of minimal length between the nest and food sources. The deposit of pheromones while they search for food and their chemotactical response to them has been proposed as a crucial element in the mechanism for finding minimal paths. We investigate both individual and collective behavior of ants in some simple networks representing basic mazes. The character of the graphs considered is such that it allows a fully rigorous mathematical treatment via analysis of some markovian processes in terms of which the evolution can be represented. Our analytical and computational results show that in order for the ants to follow shortest paths between nest and food, it is necessary to superimpose to the ants' random walk the chemotactic reinforcement. It is also needed a certain degree of persistence so that ants tend to move preferably without changing their direction much. It is also important the number of ants, since we will show that the speed for finding minimal paths increases very fast with it. ; Comment: 39 pages, 13 figures Minimize

Year of Publication:

2011-03-08

Document Type:

text

Subjects:

Quantitative Biology - Populations and Evolution ; 92Bxx

Quantitative Biology - Populations and Evolution ; 92Bxx Minimize

DDC:

590 Animals (Zoology) *(computed)*

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Quantum recurrence of a subspace and operator-valued Schur functions

Author:

Description:

A notion of monitored recurrence for discrete-time quantum processes was recently introduced in [Commun. Math. Phys., DOI 10.1007/s00220-012-1645-2] (see also arXiv:1202.3903) taking the initial state as an absorbing one. We extend this notion of monitored recurrence to absorbing subspaces of arbitrary finite dimension. The generating function a...

A notion of monitored recurrence for discrete-time quantum processes was recently introduced in [Commun. Math. Phys., DOI 10.1007/s00220-012-1645-2] (see also arXiv:1202.3903) taking the initial state as an absorbing one. We extend this notion of monitored recurrence to absorbing subspaces of arbitrary finite dimension. The generating function approach leads to a connection with the well-known theory of operator-valued Schur functions. This is the cornerstone of a spectral characterization of subspace recurrence that generalizes some of the main results in the above mentioned paper. The spectral decomposition of the unitary step operator driving the evolution yields a spectral measure, which we project onto the subspace to obtain a new spectral measure that is purely singular iff the subspace is recurrent, and consists of a pure point spectrum with a finite number of masses precisely when all states in the subspace have a finite expected return time. This notion of subspace recurrence also links the concept of expected return time to an Aharonov-Anandan phase that, in contrast to the case of state recurrence, can be non-integer. Even more surprising is the fact that averaging such geometrical phases over the absorbing subspace yields an integer with a topological meaning, so that the averaged expected return time is always a rational number. Moreover, state recurrence can occasionally give higher return probabilities than subspace recurrence, a fact that reveals once more the counterintuitive behavior of quantum systems. All these phenomena are illustrated with explicit examples, including as a natural application the analysis of site recurrence for coined walks. ; Comment: 40 pages, 8 figures Minimize

Year of Publication:

2013-02-28

Document Type:

text

Subjects:

Quantum Physics ; Mathematical Physics

Quantum Physics ; Mathematical Physics Minimize

DDC:

512 Algebra *(computed)*

Content Provider:

My Lists:

My Tags:

Notes:

Title:

On the accuracy of the Debye shielding

Author:

Description:

The expression for the Debye shielding in plasma physics is usually derived under the assumptions that the plasma particles are weakly coupled, so their kinetic energy is much larger than the potential energy between them, and that the velocity distributions of the plasma species are Maxwellian. The first assumption also establishes that the pla...

The expression for the Debye shielding in plasma physics is usually derived under the assumptions that the plasma particles are weakly coupled, so their kinetic energy is much larger than the potential energy between them, and that the velocity distributions of the plasma species are Maxwellian. The first assumption also establishes that the plasma parameter ND, the number of particles within a sphere with a Debye radius should be greater than 1, and determines the difference between weakly and strongly coupled plasmas. Under such assumptions, Poisson's equation can be linearised, and a simple analytic expression obtained for the electrostatic potential. However, textbooks rarely discuss the accuracy of this approximation. In this work we compare the linearised solution with the exact one, obtained numerically, and show that the linearisation, which underestimates the exact solution, is reasonably good even for ND ~ 40. We give quantitative criteria to set the limit of the approximation when the number of particles is very small, or the distance to the test charge too short. ; Comment: This is a didactical paper that is meant as a complement to material found in usual plasma physics textbooks Minimize

Year of Publication:

2012-02-10

Document Type:

text

Subjects:

Physics - Plasma Physics ; Physics - Classical Physics

Physics - Plasma Physics ; Physics - Classical Physics Minimize

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Defensive k-alliances in graphs

Author:

Description:

Let $\Gamma=(V,E)$ be a simple graph. For a nonempty set $X\subseteq V$, and a vertex $v\in V$, $\delta_{X}(v)$ denotes the number of neighbors $v$ has in $X$. A nonempty set $S\subseteq V$ is a \emph{defensive $k$-alliance} in $\Gamma=(V,E)$ if $\delta_S(v)\ge \delta_{\bar{S}}(v)+k,$ $\forall v\in S.$ The defensive $k$-alliance number of $\Gamm...

Let $\Gamma=(V,E)$ be a simple graph. For a nonempty set $X\subseteq V$, and a vertex $v\in V$, $\delta_{X}(v)$ denotes the number of neighbors $v$ has in $X$. A nonempty set $S\subseteq V$ is a \emph{defensive $k$-alliance} in $\Gamma=(V,E)$ if $\delta_S(v)\ge \delta_{\bar{S}}(v)+k,$ $\forall v\in S.$ The defensive $k$-alliance number of $\Gamma$, denoted by $a_k(\Gamma)$, is defined as the minimum cardinality of a defensive $k$-alliance in $\Gamma$. We study the mathematical properties of $a_k(\Gamma)$. Minimize

Year of Publication:

2006-11-07

Document Type:

text

Subjects:

Mathematics - Combinatorics ; 05C69 ; 05A20 ; 05C50

Mathematics - Combinatorics ; 05C69 ; 05A20 ; 05C50 Minimize

Content Provider:

My Lists:

My Tags:

Notes:

Title:

On the adjacency dimension of graphs

Author:

Description:

A generator of a metric space is a set $S$ of points in the space with the property that every point of the space is uniquely determined by its distances from the elements of $S$. Given a simple graph $G=(V,E)$, we define the distance function $d_{G,2}:V\times V\rightarrow \mathbb{N}\cup \{0\}$, as $d_{G,2}(x,y)=\min\{d_G(x,y),2\},$ where $d_G(x...

A generator of a metric space is a set $S$ of points in the space with the property that every point of the space is uniquely determined by its distances from the elements of $S$. Given a simple graph $G=(V,E)$, we define the distance function $d_{G,2}:V\times V\rightarrow \mathbb{N}\cup \{0\}$, as $d_{G,2}(x,y)=\min\{d_G(x,y),2\},$ where $d_G(x,y)$ is the length of a shortest path between $x$ and $y$ and $\mathbb{N}$ is the set of positive integers. Then $(V,d_{G,2 })$ is a metric space. We say that a set $S\subseteq V$ is a $k$-adjacency generator for $G$ if for every two vertices $x,y\in V$, there exist at least $k$ vertices $w_1,w_2,.,w_k\in S$ such that $$d_{G,2}(x,w_i)\ne d_{G,2}(y,w_i),\; \mbox{for every}\; i\in \{1,.,k\}.$$ A minimum cardinality $k$-adjacency generator is called a $k$-adjacency basis of $G$ and its cardinality, the $k$-adjacency dimension of $G$. In this article we study the problem of finding the $k$-adjacency dimension of a graph. We give some necessary and sufficient conditions for the existence of a $k$-adjacency basis of an arbitrary graph $G$ and we obtain general results on the $k$-adjacency dimension, including general bounds and closed formulae for some families of graphs. In particular, we obtain closed formulae for the $k$-adjacency dimension of join graphs $G+H$ in terms of the $k$-adjacency dimension of $G$ and $H$. These results concern the $k$-metric dimension, as join graphs have diameter two. As we can expect, the obtained results will become important tools for the study of the $k$-metric dimension of lexicographic product graphs and corona product graphs. Minimize

Year of Publication:

2015-01-19

Document Type:

text

Subjects:

Mathematics - Combinatorics

Mathematics - Combinatorics Minimize

DDC:

511 General principles of mathematics *(computed)*

Content Provider:

My Lists:

My Tags:

Notes:

Title:

The $k$-metric dimension of the lexicographic product of graphs

Author:

Description:

Given a simple and connected graph $G=(V,E)$, and a positive integer $k$, a set $S\subseteq V$ is said to be a $k$-metric generator for $G$, if for any pair of different vertices $u,v\in V$, there exist at least $k$ vertices $w_1,w_2,.,w_k\in S$ such that $d_G(u,w_i)\ne d_G(v,w_i)$, for every $i\in \{1,.,k\}$, where $d_G(x,y)$ denotes the distan...

Given a simple and connected graph $G=(V,E)$, and a positive integer $k$, a set $S\subseteq V$ is said to be a $k$-metric generator for $G$, if for any pair of different vertices $u,v\in V$, there exist at least $k$ vertices $w_1,w_2,.,w_k\in S$ such that $d_G(u,w_i)\ne d_G(v,w_i)$, for every $i\in \{1,.,k\}$, where $d_G(x,y)$ denotes the distance between $x$ and $y$. The minimum cardinality of a $k$-metric generator is the $k$-metric dimension of $G$. A set $S\subseteq V$ is a $k$-adjacency generator for $G$ if any two different vertices $x,y\in V(G)$ satisfy $|((N_G(x)\triangledown N_G(y))\cup\{x,y\})\cap S|\ge k$, where $N_G(x)\triangledown N_G(y)$ is the symmetric difference of the neighborhoods of $x$ and $y$. The minimum cardinality of any $k$-adjacency generator is the $k$-adjacency dimension of $G$. In this article we obtain tight bounds and closed formulae for the $k$-metric dimension of the lexicographic product of graphs in terms of the $k$-adjacency dimension of the factor graphs. ; Comment: 18 pages Minimize

Year of Publication:

2014-10-27

Document Type:

text

Subjects:

Mathematics - Combinatorics ; 05C12 ; 05C76

Mathematics - Combinatorics ; 05C12 ; 05C76 Minimize

DDC:

511 General principles of mathematics *(computed)*

Content Provider:

My Lists:

My Tags:

Notes:

Currently in BASE: 70,471,478 Documents of 3,410 Content Sources

http://www.base-search.net