Pseudoclassical description of scalar particle in non-abelian background and path-integral representations

Path-integral representations for a scalar particle propagator in non-Abelian external backgrounds are derived. To this aim, we generalize the procedure proposed by Gitman and Schvartsman of path-integral construction to any representation of SU(N) given in terms of antisymmetric generators. And for arbitrary representations of SU(N), we present an alternative construction by means of fermionic coherent states. From the path-integral representations we derive pseudoclassical actions for a scalar particle placed in non-Abelian backgrounds. These actions are classically analyzed and then quantized to prove their consistency.

Path integral representations in noncommutative quantum mechanics and noncommutative version of Berezin-Marinov action

It is known that the actions of field theories on a noncommutative space-time can be written as some modified (we call them theta-modified) classical actions already on the commutative space-time (introducing a star product). Then the quantization of such modified actions reproduces both space-time noncommutativity and the usual quantum mechanical features of the corresponding field theory. In the present article, we discuss the problem of constructing theta-modified actions for relativistic QM. We construct such actions for relativistic spinless and spinning particles. The key idea is to extract theta-modified actions of the relativistic particles from path-integral representations of the corresponding noncommutative field theory propagators. We consider the Klein-Gordon and Dirac equations for the causal propagators in such theories. Then we construct for the propagators path-integral representations. Effective actions in such representations we treat as theta-modified actions of the relativistic particles. To confirm the interpretation, we canonically quantize these actions. Thus, we obtain the Klein-Gordon and Dirac equations in the noncommutative field theories. The theta-modified action of the relativistic spinning particle is just a generalization of the Berezin-Marinov pseudoclassical action for the noncommutative case.

MODELING THE EVOLUTION OF COMPLEX NETWORKS THROUGH THE PATH-STAR TRANSFORMATION AND OPTIMAL MULTIVARIATE METHODS

The topology of real-world complex networks, such as in transportation and communication, is always changing with time. Such changes can arise not only as a natural consequence of their growth, but also due to major modi. cations in their intrinsic organization. For instance, the network of transportation routes between cities and towns ( hence locations) of a given country undergo a major change with the progressive implementation of commercial air transportation. While the locations could be originally interconnected through highways ( paths, giving rise to geographical networks), transportation between those sites progressively shifted or was complemented by air transportation, with scale free characteristics. In the present work we introduce the path-star transformation ( in its uniform and preferential versions) as a means to model such network transformations where paths give rise to stars of connectivity. It is also shown, through optimal multivariate statistical methods (i.e. canonical projections and maximum likelihood classification) that while the US highways network adheres closely to a geographical network model, its path-star transformation yields a network whose topological properties closely resembles those of the respective airport transportation network.

Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs

The assessment of routing protocols for mobile wireless networks is a difficult task, because of the networks` dynamic behavior and the absence of benchmarks. However, some of these networks, such as intermittent wireless sensors networks, periodic or cyclic networks, and some delay tolerant networks (DTNs), have more predictable dynamics, as the temporal variations in the network topology can be considered as deterministic, which may make them easier to study. Recently, a graph theoretic model-the evolving graphs-was proposed to help capture the dynamic behavior of such networks, in view of the construction of least cost routing and other algorithms. The algorithms and insights obtained through this model are theoretically very efficient and intriguing. However, there is no study about the use of such theoretical results into practical situations. Therefore, the objective of our work is to analyze the applicability of the evolving graph theory in the construction of efficient routing protocols in realistic scenarios. In this paper, we use the NS2 network simulator to first implement an evolving graph based routing protocol, and then to use it as a benchmark when comparing the four major ad hoc routing protocols (AODV, DSR, OLSR and DSDV). Interestingly, our experiments show that evolving graphs have the potential to be an effective and powerful tool in the development and analysis of algorithms for dynamic networks, with predictable dynamics at least. In order to make this model widely applicable, however, some practical issues still have to be addressed and incorporated into the model, like adaptive algorithms. We also discuss such issues in this paper, as a result of our experience.

EQUIVARIANT PATH FIELDS ON TOPOLOGICAL MANIFOLDS

A classical theorem of H. Hopf asserts that a closed connected smooth manifold admits a nowhere vanishing vector field if and only if its Euler characteristic is zero. R. Brown generalized Hopf`s result to topological manifolds, replacing vector fields with path fields. In this note, we give an equivariant analog of Brown`s theorem for locally smooth G-manifolds where G is a finite group.

Production and Delivery (Optimization of production system and reliability)

This thesis is done to solve two issues for Sayid Paper Mill Ltd Pakistan. Section one deals with a practical problem arise in SPM that is cutting a given set of raw paper rolls of known length and width, and a set of product paper rolls of known length (equal to the length of raw paper rolls) and width, practical cutting constraints on a single cutting machine, according to demand orders for all customers. To solve this problem requires to determine an optimal cutting schedule to maximize the overall cutting process profitability while satisfying all demands and cutting constraints. The aim of this part of thesis is to develop a mathematical model which solves this problem.Second section deals with a problem of delivering final product from warehouse to different destinations by finding shortest paths. It is an operational routing problem to decide the daily routes for sending trucks to different destination to deliver their final product. This industrial problem is difficult and includes aspect such as delivery to a single destination and multiple destinations with limited resources. The aim of this part of thesis is to develop a process which helps finding shortest path.

Optimization of cable cycles : a trade-off between reliability and cost

This paper elaborates the routing of cable cycle through available routes in a building in order to link a set of devices, in a most reasonable way. Despite of the similarities to other NP-hard routing problems, the only goal is not only to minimize the cost (length of the cycle) but also to increase the reliability of the path (in case of a cable cut) which is assessed by a risk factor. Since there is often a trade-off between the risk and length factors, a criterion for ranking candidates and deciding the most reasonable solution is defined. A set of techniques is proposed to perform an efficient and exact search among candidates. A novel graph is introduced to reduce the search-space, and navigate the search toward feasible and desirable solutions. Moreover, admissible heuristic length estimation helps to early detection of partial cycles which lead to unreasonable solutions. The results show that the method provides solutions which are both technically and financially reasonable. Furthermore, it is proved that the proposed techniques are very efficient in reducing the computational time of the search to a reasonable amount.

Type 2 Design M Starboard Side; SS War Path and SS War Song

Print No:77

Economia evolucionária e path dependence do investimento externo japonês: um estudo do Leste Asiático no período pré Segunda Guerra Mundial

A abertura da economia e o reinício das relações econômicas japonesas com o exterior e o processo de industrialização da economia japonesa na Era Meiji levaram o Japão a investir no exterior. Os investimentos japoneses no exterior cresceram preponderantemente no Leste Asiático, concentrando-se nessa área até o término da Segunda Guerra Mundial. A tese mostra que existem restrições de caráter institucional e histórico, que impõem limitações às empresas quanto ao leque de opções para investirem no exterior. Uma vez que as empresas japonesas fizeram a opção, impostas por aquelas restrições, de investir no Leste Asiático, feedbacks positivos, propiciados pelos eventos históricos e institucionais, geraram auto-reforços, levando a um resultado de inflexibilidade - lock-in - para sair dessa região. A tese comprova que explicar os investimentos externos japoneses pelo modelo de economia evolucionária, através do processo de path dependence, que incorpora o caráter institucional e histórico, é mais plausível do que as interpretações convencionais.

Money supply and capital accumulation on the transition path revisited

Fischer (1979) and Asako (1983) analyze the sign of the correlation between the growth rate of money and the rate of capital accumulation on the transition path. Both plug a CRRA utility (based on a Cobb-Douglas and a Leontief function, respectively) into Sidrauski's model - yet return contrasting results. The present analysis, by using a more general CES utility, presents both of those settings and conclusions as limiting cases, and generates economic gures more consistent with reality (for instance, the interest-rate elasticity of the money demands derived from those previous works is necessarily 1 and 0, respectively).

Low cost BIST techniques for linear and non-linear analog circuits

With the ever increasing demands for high complexity consumer electronic products, market pressures demand faster product development and lower cost. SoCbased design can provide the required design flexibility and speed by allowing the use of IP cores. However, testing costs in the SoC environment can reach a substantial percent of the total production cost. Analog testing costs may dominate the total test cost, as testing of analog circuits usually require functional verification of the circuit and special testing procedures. For RF analog circuits commonly used in wireless applications, testing is further complicated because of the high frequencies involved. In summary, reducing analog test cost is of major importance in the electronic industry today. BIST techniques for analog circuits, though potentially able to solve the analog test cost problem, have some limitations. Some techniques are circuit dependent, requiring reconfiguration of the circuit being tested, and are generally not usable in RF circuits. In the SoC environment, as processing and memory resources are available, they could be used in the test. However, the overhead for adding additional AD and DA converters may be too costly for most systems, and analog routing of signals may not be feasible and may introduce signal distortion. In this work a simple and low cost digitizer is used instead of an ADC in order to enable analog testing strategies to be implemented in a SoC environment. Thanks to the low analog area overhead of the converter, multiple analog test points can be observed and specific analog test strategies can be enabled. As the digitizer is always connected to the analog test point, it is not necessary to include muxes and switches that would degrade the signal path. For RF analog circuits, this is specially useful, as the circuit impedance is fixed and the influence of the digitizer can be accounted for in the design phase. Thanks to the simplicity of the converter, it is able to reach higher frequencies, and enables the implementation of low cost RF test strategies. The digitizer has been applied successfully in the testing of both low frequency and RF analog circuits. Also, as testing is based on frequency-domain characteristics, nonlinear characteristics like intermodulation products can also be evaluated. Specifically, practical results were obtained for prototyped base band filters and a 100MHz mixer. The application of the converter for noise figure evaluation was also addressed, and experimental results for low frequency amplifiers using conventional opamps were obtained. The proposed method is able to enhance the testability of current mixed-signal designs, being suitable for the SoC environment used in many industrial products nowadays.