196 resultados para Polynomially solvable
Resumo:
During the third part of the Atlantic Expedition 1969 from 10° S to 60° N along 30° W, measurements of the complete size distribution of atmospheric aeosols over the whole size range from about 10**-7 to 10**-2 cm radius were made. This was possibe by the simultaneous operation of different methods which are critically discussed. The results obtained are the first of its kind and are of general interest despite some methodical shortcomings. North of the equator the ship passed through air masses of west African origin and the influence of Sahara dust on the Marine aerosols could be documented in a unique way. The Sahara dust component was restricted to the size range of 10**-5 to 10**-3 radius. Throughout the voyage particles up to 10**-2 radius were always found to be present, similar to findings over continents. Of special interest is the observation that the size distribution extends to very small particles, suggesting continuous aerosol production over the ocean.
Resumo:
Abstract The proliferation of wireless sensor networks and the variety of envisioned applications associated with them has motivated the development of distributed algorithms for collaborative processing over networked systems. One of the applications that has attracted the attention of the researchers is that of target localization where the nodes of the network try to estimate the position of an unknown target that lies within its coverage area. Particularly challenging is the problem of estimating the target’s position when we use received signal strength indicator (RSSI) due to the nonlinear relationship between the measured signal and the true position of the target. Many of the existing approaches suffer either from high computational complexity (e.g., particle filters) or lack of accuracy. Further, many of the proposed solutions are centralized which make their application to a sensor network questionable. Depending on the application at hand and, from a practical perspective it could be convenient to find a balance between localization accuracy and complexity. Into this direction we approach the maximum likelihood location estimation problem by solving a suboptimal (and more tractable) problem. One of the main advantages of the proposed scheme is that it allows for a decentralized implementation using distributed processing tools (e.g., consensus and convex optimization) and therefore, it is very suitable to be implemented in real sensor networks. If further accuracy is needed an additional refinement step could be performed around the found solution. Under the assumption of independent noise among the nodes such local search can be done in a fully distributed way using a distributed version of the Gauss-Newton method based on consensus. Regardless of the underlying application or function of the sensor network it is al¬ways necessary to have a mechanism for data reporting. While some approaches use a special kind of nodes (called sink nodes) for data harvesting and forwarding to the outside world, there are however some scenarios where such an approach is impractical or even impossible to deploy. Further, such sink nodes become a bottleneck in terms of traffic flow and power consumption. To overcome these issues instead of using sink nodes for data reporting one could use collaborative beamforming techniques to forward directly the generated data to a base station or gateway to the outside world. In a dis-tributed environment like a sensor network nodes cooperate in order to form a virtual antenna array that can exploit the benefits of multi-antenna communications. In col-laborative beamforming nodes synchronize their phases in order to add constructively at the receiver. Some of the inconveniences associated with collaborative beamforming techniques is that there is no control over the radiation pattern since it is treated as a random quantity. This may cause interference to other coexisting systems and fast bat-tery depletion at the nodes. Since energy-efficiency is a major design issue we consider the development of a distributed collaborative beamforming scheme that maximizes the network lifetime while meeting some quality of service (QoS) requirement at the re¬ceiver side. Using local information about battery status and channel conditions we find distributed algorithms that converge to the optimal centralized beamformer. While in the first part we consider only battery depletion due to communications beamforming, we extend the model to account for more realistic scenarios by the introduction of an additional random energy consumption. It is shown how the new problem generalizes the original one and under which conditions it is easily solvable. By formulating the problem under the energy-efficiency perspective the network’s lifetime is significantly improved. Resumen La proliferación de las redes inalámbricas de sensores junto con la gran variedad de posi¬bles aplicaciones relacionadas, han motivado el desarrollo de herramientas y algoritmos necesarios para el procesado cooperativo en sistemas distribuidos. Una de las aplicaciones que suscitado mayor interés entre la comunidad científica es la de localization, donde el conjunto de nodos de la red intenta estimar la posición de un blanco localizado dentro de su área de cobertura. El problema de la localization es especialmente desafiante cuando se usan niveles de energía de la seal recibida (RSSI por sus siglas en inglés) como medida para la localization. El principal inconveniente reside en el hecho que el nivel de señal recibida no sigue una relación lineal con la posición del blanco. Muchas de las soluciones actuales al problema de localization usando RSSI se basan en complejos esquemas centralizados como filtros de partículas, mientas que en otras se basan en esquemas mucho más simples pero con menor precisión. Además, en muchos casos las estrategias son centralizadas lo que resulta poco prácticos para su implementación en redes de sensores. Desde un punto de vista práctico y de implementation, es conveniente, para ciertos escenarios y aplicaciones, el desarrollo de alternativas que ofrezcan un compromiso entre complejidad y precisión. En esta línea, en lugar de abordar directamente el problema de la estimación de la posición del blanco bajo el criterio de máxima verosimilitud, proponemos usar una formulación subóptima del problema más manejable analíticamente y que ofrece la ventaja de permitir en¬contrar la solución al problema de localization de una forma totalmente distribuida, convirtiéndola así en una solución atractiva dentro del contexto de redes inalámbricas de sensores. Para ello, se usan herramientas de procesado distribuido como los algorit¬mos de consenso y de optimización convexa en sistemas distribuidos. Para aplicaciones donde se requiera de un mayor grado de precisión se propone una estrategia que con¬siste en la optimización local de la función de verosimilitud entorno a la estimación inicialmente obtenida. Esta optimización se puede realizar de forma descentralizada usando una versión basada en consenso del método de Gauss-Newton siempre y cuando asumamos independencia de los ruidos de medida en los diferentes nodos. Independientemente de la aplicación subyacente de la red de sensores, es necesario tener un mecanismo que permita recopilar los datos provenientes de la red de sensores. Una forma de hacerlo es mediante el uso de uno o varios nodos especiales, llamados nodos “sumidero”, (sink en inglés) que actúen como centros recolectores de información y que estarán equipados con hardware adicional que les permita la interacción con el exterior de la red. La principal desventaja de esta estrategia es que dichos nodos se convierten en cuellos de botella en cuanto a tráfico y capacidad de cálculo. Como alter¬nativa se pueden usar técnicas cooperativas de conformación de haz (beamforming en inglés) de manera que el conjunto de la red puede verse como un único sistema virtual de múltiples antenas y, por tanto, que exploten los beneficios que ofrecen las comu¬nicaciones con múltiples antenas. Para ello, los distintos nodos de la red sincronizan sus transmisiones de manera que se produce una interferencia constructiva en el recep¬tor. No obstante, las actuales técnicas se basan en resultados promedios y asintóticos, cuando el número de nodos es muy grande. Para una configuración específica se pierde el control sobre el diagrama de radiación causando posibles interferencias sobre sis¬temas coexistentes o gastando más potencia de la requerida. La eficiencia energética es una cuestión capital en las redes inalámbricas de sensores ya que los nodos están equipados con baterías. Es por tanto muy importante preservar la batería evitando cambios innecesarios y el consecuente aumento de costes. Bajo estas consideraciones, se propone un esquema de conformación de haz que maximice el tiempo de vida útil de la red, entendiendo como tal el máximo tiempo que la red puede estar operativa garantizando unos requisitos de calidad de servicio (QoS por sus siglas en inglés) que permitan una decodificación fiable de la señal recibida en la estación base. Se proponen además algoritmos distribuidos que convergen a la solución centralizada. Inicialmente se considera que la única causa de consumo energético se debe a las comunicaciones con la estación base. Este modelo de consumo energético es modificado para tener en cuenta otras formas de consumo de energía derivadas de procesos inherentes al funcionamiento de la red como la adquisición y procesado de datos, las comunicaciones locales entre nodos, etc. Dicho consumo adicional de energía se modela como una variable aleatoria en cada nodo. Se cambia por tanto, a un escenario probabilístico que generaliza el caso determinista y se proporcionan condiciones bajo las cuales el problema se puede resolver de forma eficiente. Se demuestra que el tiempo de vida de la red mejora de forma significativa usando el criterio propuesto de eficiencia energética.
Resumo:
The algorithms and graphic user interface software package ?OPT-PROx? are developed to meet food engineering needs related to canned food thermal processing simulation and optimization. The adaptive random search algorithm and its modification coupled with penalty function?s approach, and the finite difference methods with cubic spline approximation are utilized by ?OPT-PROx? package (http://tomakechoice. com/optprox/index.html). The diversity of thermal food processing optimization problems with different objectives and required constraints are solvable by developed software. The geometries supported by the ?OPT-PROx? are the following: (1) cylinder, (2) rectangle, (3) sphere. The mean square error minimization principle is utilized in order to estimate the heat transfer coefficient of food to be heated under optimal condition. The developed user friendly dialogue and used numerical procedures makes the ?OPT-PROx? software useful to food scientists in research and education, as well as to engineers involved in optimization of thermal food processing.
Resumo:
This paper uses the metaphor of a pressure cooker to highlight how water problems in Spain are highly geographical and sectorial in nature, with some specific hotspots which raise the temperature of the whole water complex system, turning many potentially solvable water problems into ?wicked problems?. The paper discusses the tendency for water governance to be hydrocentric, when often the drivers and in turn the ?solutions? to Spanish water problems lie outside the water sphere. The paper analyzes of the current water governance system by looking at water governance as both a process, and its key attributes like participation, trans- parency, equity and rule of law, as well as an analysis of water governance as an outcome by looking at efficiency and sustainability of water use in Spain. It concludes on the need to have a deeper knowledge on the interactions of water governance as a process and as an outcome and potential synergies and arguing that water governance is an inherently political process which calls for strengthening the capacity of the system by looking at the interactions of these different governance attributes.
Resumo:
We obtain a diagonal solution of the dual reflection equation for the elliptic A(n-1)((1)) solid-on-solid model. The isomorphism between the solutions of the reflection equation and its dual is studied. (C) 2004 American Institute of Physics.
Resumo:
A group is termed parafree if it is residually nilpotent and has the same nilpotent quotients as a given free group. Since free groups are residually nilpotent, they are parafree. Nonfree parafree groups abound and they all have many properties in common with free groups. Finitely presented parafree groups have solvable word problems, but little is known about the conjugacy and isomorphism problems. The conjugacy problem plays an important part in determining whether an automorphism is inner, which we term the inner automorphism problem. We will attack these and other problems about parafree groups experimentally, in a series of papers, of which this is the first and which is concerned with the isomorphism problem. The approach that we take here is to distinguish some parafree groups by computing the number of epimorphisms onto selected finite groups. It turns out, rather unexpectedly, that an understanding of the quotients of certain groups leads to some new results about equations in free and relatively free groups. We touch on this only lightly here but will discuss this in more depth in a future paper.
Resumo:
Wigner functions play a central role in the phase space formulation of quantum mechanics. Although closely related to classical Liouville densities, Wigner functions are not positive definite and may take negative values on subregions of phase space. We investigate the accumulation of these negative values by studying bounds on the integral of an arbitrary Wigner function over noncompact subregions of the phase plane with hyperbolic boundaries. We show using symmetry techniques that this problem reduces to computing the bounds on the spectrum associated with an exactly solvable eigenvalue problem and that the bounds differ from those on classical Liouville distributions. In particular, we show that the total "quasiprobability" on such a region can be greater than 1 or less than zero. (C) 2005 American Institute of Physics.
Resumo:
The central elements of the algebra of monodromy matrices associated with the Z(n) R-matrix are studied. When the crossing parameter w takes a special rational value w = n/N, where N and n are positive coprime integers, the center is substantially larger than that in the generic case for which the quantum determinant provides the center. In the trigonometric limit, the situation corresponds to the quantum group at roots of unity. This is a higher rank generalization of the recent results by Belavin and Jimbo. (c) 2004 Elsevier B.V. All rights reserved.
Resumo:
In this work we investigate the energy gap between the ground state and the first excited state in a model of two single-mode Bose-Einstein condensates coupled via Josephson tunnelling. The ene:rgy gap is never zero when the tunnelling interaction is non-zero. The gap exhibits no local minimum below a threshold coupling which separates a delocalized phase from a self-trapping phase that occurs in the absence of the external potential. Above this threshold point one minimum occurs close to the Josephson regime, and a set of minima and maxima appear in the Fock regime. Expressions for the position of these minima and maxima are obtained. The connection between these minima and maxima and the dynamics for the expectation value of the relative number of particles is analysed in detail. We find that the dynamics of the system changes as the coupling crosses these points.
Resumo:
Previous research suggests that chimpanzees understand single invisible displacement. However, this Piagetian task may be solvable through the use of simple search strategies rather than through mentally representing the past trajectory of an object. Four control conditions were thus administered to two chimpanzees in order to separate associative search strategies from performance based on mental representation. Strategies involving experimenter cue-use, search at the last or first box visited by the displacement device, and search at boxes adjacent to the displacement device were systematically controlled for. Chimpanzees showed no indications of utilizing these simple strategies, suggesting that their capacity to mentally represent single invisible displacements is comparable to that of 18-24-month-old children.
Resumo:
We construct the Drinfeld twists (or factorizing F-matrices) of the supersymmetric model associated with quantum superalgebra U-q(gl(m vertical bar n)), and obtain the completely symmetric representations of the creation operators of the model in the F-basis provided by the F-matrix. As an application of our general results, we present the explicit expressions of the Bethe vectors in the F-basis for the U-q(gl(2 vertical bar 1))-model (the quantum t-J model).
Resumo:
In this thesis we study at perturbative level correlation functions of Wilson loops (and local operators) and their relations to localization, integrability and other quantities of interest as the cusp anomalous dimension and the Bremsstrahlung function. First of all we consider a general class of 1/8 BPS Wilson loops and chiral primaries in N=4 Super Yang-Mills theory. We perform explicit two-loop computations, for some particular but still rather general configuration, that confirm the elegant results expected from localization procedure. We find notably full consistency with the multi-matrix model averages, obtained from 2D Yang-Mills theory on the sphere, when interacting diagrams do not cancel and contribute non-trivially to the final answer. We also discuss the near BPS expansion of the generalized cusp anomalous dimension with L units of R-charge. Integrability provides an exact solution, obtained by solving a general TBA equation in the appropriate limit: we propose here an alternative method based on supersymmetric localization. The basic idea is to relate the computation to the vacuum expectation value of certain 1/8 BPS Wilson loops with local operator insertions along the contour. Also these observables localize on a two-dimensional gauge theory on S^2, opening the possibility of exact calculations. As a test of our proposal, we reproduce the leading Luscher correction at weak coupling to the generalized cusp anomalous dimension. This result is also checked against a genuine Feynman diagram approach in N=4 super Yang-Mills theory. Finally we study the cusp anomalous dimension in N=6 ABJ(M) theory, identifying a scaling limit in which the ladder diagrams dominate. The resummation is encoded into a Bethe-Salpeter equation that is mapped to a Schroedinger problem, exactly solvable due to the surprising supersymmetry of the effective Hamiltonian. In the ABJ case the solution implies the diagonalization of the U(N) and U(M) building blocks, suggesting the existence of two independent cusp anomalous dimensions and an unexpected exponentation structure for the related Wilson loops.
Resumo:
This research was originally undertaken to aid the Jamaican government and the World Bank in making funding decisions relative to improvement of road systems and traffic control in Jamaica. An investigation of the frequency and causes of road accidents and an evaluation of their impact on the Jamaican economy were carried out, and a model system which might be applied was developed. It is believed that the importance of road accident economic and manpower losses to the survival of developing countries, such as Jamaica, cannot be overemphasized. It is suggested that the World Bank, in cooperation with national governments, has a role to play in alleviating this serious problem. Data was collected from such organizations as the Jamaica Ministry of Construction, Police Department, the World Bank, and the World Health Organization. A variety of methodologies were utilized to organize this data in useful and understandable forms. The most important conclusion of this research is that solvable problems in road systems and in traffic control result in the unnecessary loss of useful citizens, in both developed and developing countries. However, a lack of information and understanding regarding the impact of high rates of road accident death and injury on the national economy and stability of a country results in an apparent lack of concern. Having little internal expertise in the field of road accident prevention, developing countries usually hire consultants to help them address this problem. In the case of Jamaica, this practice has resulted in distrust and hard feelings between the Jamaican authorities and major organizations involved in the field. Jamaican officials have found confusing the recommendations of most experts contracted to study traffic safety. The attempts of foreign consultants to utilize a technological approach (the use of coding systems and computers), methods which do not appear cost-effective for Jamaica, have resulted in the expenditure of limited funds for studies which offer no feasible approach to the problem. This funding limitation, which hampers research and road improvement, could be alleviated by such organizations as the World Bank. The causes of high accident rates are many, it was found. Formulation of a plan to address this serious problem must take into account the current failure to appreciate the impact of a high level of road accidents on national economy and stability, inability to find a feasible approach to the problem, and inadequate funding. Such a plan is discussed in detail in the main text of this research.
Resumo:
The problem of separating structured information representing phenomena of differing natures is considered. A structure is assumed to be independent of the others if can be represented in a complementary subspace. When the concomitant subspaces are well separated the problem is readily solvable by a linear technique. Otherwise, the linear approach fails to correctly discriminate the required information. Hence, a non-extensive approach is proposed. The resulting nonlinear technique is shown to be suitable for dealing with cases that cannot be tackled by the linear one.
Resumo:
The general ordinary quasi-differential expression M of n-th order with complex coefficients and its formal adjoint M + are considered over a regoin (a, b) on the real line, −∞ ≤ a < b ≤ ∞, on which the operator may have a finite number of singular points. By considering M over various subintervals on which singularities occur only at the ends, restrictions of the maximal operator generated by M in L2|w (a, b) which are regularly solvable with respect to the minimal operators T0 (M ) and T0 (M + ). In addition to direct sums of regularly solvable operators defined on the separate subintervals, there are other regularly solvable restrications of the maximal operator which involve linking the various intervals together in interface like style.