978 resultados para Shortest path problem


Relevância:

20.00% 20.00%

Publicador:

Resumo:

The three main topics of this work are independent systems and chains of word equations, parametric solutions of word equations on three unknowns, and unique decipherability in the monoid of regular languages. The most important result about independent systems is a new method giving an upper bound for their sizes in the case of three unknowns. The bound depends on the length of the shortest equation. This result has generalizations for decreasing chains and for more than three unknowns. The method also leads to shorter proofs and generalizations of some old results. Hmelevksii’s theorem states that every word equation on three unknowns has a parametric solution. We give a significantly simplified proof for this theorem. As a new result we estimate the lengths of parametric solutions and get a bound for the length of the minimal nontrivial solution and for the complexity of deciding whether such a solution exists. The unique decipherability problem asks whether given elements of some monoid form a code, that is, whether they satisfy a nontrivial equation. We give characterizations for when a collection of unary regular languages is a code. We also prove that it is undecidable whether a collection of binary regular languages is a code.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

En option är ett finansiellt kontrakt som ger dess innehavare en rättighet (men medför ingen skyldighet) att sälja eller köpa någonting (till exempel en aktie) till eller från säljaren av optionen till ett visst pris vid en bestämd tidpunkt i framtiden. Den som säljer optionen binder sig till att gå med på denna framtida transaktion ifall optionsinnehavaren längre fram bestämmer sig för att inlösa optionen. Säljaren av optionen åtar sig alltså en risk av att den framtida transaktion som optionsinnehavaren kan tvinga honom att göra visar sig vara ofördelaktig för honom. Frågan om hur säljaren kan skydda sig mot denna risk leder till intressanta optimeringsproblem, där målet är att hitta en optimal skyddsstrategi under vissa givna villkor. Sådana optimeringsproblem har studerats mycket inom finansiell matematik. Avhandlingen "The knapsack problem approach in solving partial hedging problems of options" inför en ytterligare synpunkt till denna diskussion: I en relativt enkel (ändlig och komplett) marknadsmodell kan nämligen vissa partiella skyddsproblem beskrivas som så kallade kappsäcksproblem. De sistnämnda är välkända inom en gren av matematik som heter operationsanalys. I avhandlingen visas hur skyddsproblem som tidigare lösts på andra sätt kan alternativt lösas med hjälp av metoder som utvecklats för kappsäcksproblem. Förfarandet tillämpas även på helt nya skyddsproblem i samband med så kallade amerikanska optioner.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

All over the world power systems become bigger and bigger every day. New equipment is installed, new feeders are constructed, new power units are installed. Some old elements of the network, however, are not changed in time. As a result, “bottlenecks” for capacity transmission can occur. By locked power problem the situation when a power plant has installed capacity exceeding the power it can actually deliver is usually meant. Regime, scheme or even technical restrictions-related issues usually cause this kind of problem. It is really important, since from the regime point of view it is typical decision to have a mobile capacity reserve, in case of malfunctions. And, what can be even more significant, power plant owner (JSC Fortum in our case) losses his money because of selling less electrical energy. The goal of master`s thesis is to analyze the current state of Chelyabinsk power system and the CHP-3 (Combined Heat and Power plant) in particular in relation with it`s ability to deliver the whole capacity of the CHP in it`s existing state and also taking into consideration the prospect of power unit 3 installation by the fourth quarter of 2010. The thesis contains some general information about the UPS of Russia, CPS of Ural, power system of Chelyabinsk and the Chelyabinsk region itself. Then the CHP-3 is described from technical point of view with it`s equipment observation. Regimes for the nowadays power system and for the system after the power unit 3 installation are reviewed. The problems occurring are described and, finally, a solution is offered.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Through advances in technology, System-on-Chip design is moving towards integrating tens to hundreds of intellectual property blocks into a single chip. In such a many-core system, on-chip communication becomes a performance bottleneck for high performance designs. Network-on-Chip (NoC) has emerged as a viable solution for the communication challenges in highly complex chips. The NoC architecture paradigm, based on a modular packet-switched mechanism, can address many of the on-chip communication challenges such as wiring complexity, communication latency, and bandwidth. Furthermore, the combined benefits of 3D IC and NoC schemes provide the possibility of designing a high performance system in a limited chip area. The major advantages of 3D NoCs are the considerable reductions in average latency and power consumption. There are several factors degrading the performance of NoCs. In this thesis, we investigate three main performance-limiting factors: network congestion, faults, and the lack of efficient multicast support. We address these issues by the means of routing algorithms. Congestion of data packets may lead to increased network latency and power consumption. Thus, we propose three different approaches for alleviating such congestion in the network. The first approach is based on measuring the congestion information in different regions of the network, distributing the information over the network, and utilizing this information when making a routing decision. The second approach employs a learning method to dynamically find the less congested routes according to the underlying traffic. The third approach is based on a fuzzy-logic technique to perform better routing decisions when traffic information of different routes is available. Faults affect performance significantly, as then packets should take longer paths in order to be routed around the faults, which in turn increases congestion around the faulty regions. We propose four methods to tolerate faults at the link and switch level by using only the shortest paths as long as such path exists. The unique characteristic among these methods is the toleration of faults while also maintaining the performance of NoCs. To the best of our knowledge, these algorithms are the first approaches to bypassing faults prior to reaching them while avoiding unnecessary misrouting of packets. Current implementations of multicast communication result in a significant performance loss for unicast traffic. This is due to the fact that the routing rules of multicast packets limit the adaptivity of unicast packets. We present an approach in which both unicast and multicast packets can be efficiently routed within the network. While suggesting a more efficient multicast support, the proposed approach does not affect the performance of unicast routing at all. In addition, in order to reduce the overall path length of multicast packets, we present several partitioning methods along with their analytical models for latency measurement. This approach is discussed in the context of 3D mesh networks.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This work presents a formulation of the contact with friction between elastic bodies. This is a non linear problem due to unilateral constraints (inter-penetration of bodies) and friction. The solution of this problem can be found using optimization concepts, modelling the problem as a constrained minimization problem. The Finite Element Method is used to construct approximation spaces. The minimization problem has the total potential energy of the elastic bodies as the objective function, the non-inter-penetration conditions are represented by inequality constraints, and equality constraints are used to deal with the friction. Due to the presence of two friction conditions (stick and slip), specific equality constraints are present or not according to the current condition. Since the Coulomb friction condition depends on the normal and tangential contact stresses related to the constraints of the problem, it is devised a conditional dependent constrained minimization problem. An Augmented Lagrangian Method for constrained minimization is employed to solve this problem. This method, when applied to a contact problem, presents Lagrange Multipliers which have the physical meaning of contact forces. This fact allows to check the friction condition at each iteration. These concepts make possible to devise a computational scheme which lead to good numerical results.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper deals with the use of the conjugate gradient method of function estimation for the simultaneous identification of two unknown boundary heat fluxes in parallel plate channels. The fluid flow is assumed to be laminar and hydrodynamically developed. Temperature measurements taken inside the channel are used in the inverse analysis. The accuracy of the present solution approach is examined by using simulated measurements containing random errors, for strict cases involving functional forms with discontinuities and sharp-corners for the unknown functions. Three different types of inverse problems are addressed in the paper, involving the estimation of: (i) Spatially dependent heat fluxes; (ii) Time-dependent heat fluxes; and (iii) Time and spatially dependent heat fluxes.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper presents a study on the dynamics of the rattling problem in gearboxes under non-ideal excitation. The subject has being analyzed by a number of authors such as Karagiannis and Pfeiffer (1991), for the ideal excitation case. An interesting model of the same problem by Moon (1992) has been recently used by Souza and Caldas (1999) to detect chaotic behavior. We consider two spur gears with different diameters and gaps between the teeth. Suppose the motion of one gear to be given while the motion of the other is governed by its dynamics. In the ideal case, the driving wheel is supposed to undergo a sinusoidal motion with given constant amplitude and frequency. In this paper, we consider the motion to be a function of the system response and a limited energy source is adopted. Thus an extra degree of freedom is introduced in the problem. The equations of motion are obtained via a Lagrangian approach with some assumed characteristic torque curves. Next, extensive numerical integration is used to detect some interesting geometrical aspects of regular and irregular motions of the system response.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

TRIZ is one of the well-known tools, based on analytical methods for creative problem solving. This thesis suggests adapted version of contradiction matrix, a powerful tool of TRIZ and few principles based on concept of original TRIZ. It is believed that the proposed version would aid in problem solving, especially those encountered in chemical process industries with unit operations. In addition, this thesis would help fresh process engineers to recognize importance of various available methods for creative problem solving and learn TRIZ method of creative problem solving. This thesis work mainly provides idea on how to modify TRIZ based method according to ones requirements to fit in particular niche area and solve problems efficiently in creative way. Here in this case, the contradiction matrix developed is based on review of common problems encountered in chemical process industry, particularly in unit operations and resolutions are based on approaches used in past to handle those issues.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The power rating of wind turbines is constantly increasing; however, keeping the voltage rating at the low-voltage level results in high kilo-ampere currents. An alternative for increasing the power levels without raising the voltage level is provided by multiphase machines. Multiphase machines are used for instance in ship propulsion systems, aerospace applications, electric vehicles, and in other high-power applications including wind energy conversion systems. A machine model in an appropriate reference frame is required in order to design an efficient control for the electric drive. Modeling of multiphase machines poses a challenge because of the mutual couplings between the phases. Mutual couplings degrade the drive performance unless they are properly considered. In certain multiphase machines there is also a problem of high current harmonics, which are easily generated because of the small current path impedance of the harmonic components. However, multiphase machines provide special characteristics compared with the three-phase counterparts: Multiphase machines have a better fault tolerance, and are thus more robust. In addition, the controlled power can be divided among more inverter legs by increasing the number of phases. Moreover, the torque pulsation can be decreased and the harmonic frequency of the torque ripple increased by an appropriate multiphase configuration. By increasing the number of phases it is also possible to obtain more torque per RMS ampere for the same volume, and thus, increase the power density. In this doctoral thesis, a decoupled d–q model of double-star permanent-magnet (PM) synchronous machines is derived based on the inductance matrix diagonalization. The double-star machine is a special type of multiphase machines. Its armature consists of two three-phase winding sets, which are commonly displaced by 30 electrical degrees. In this study, the displacement angle between the sets is considered a parameter. The diagonalization of the inductance matrix results in a simplified model structure, in which the mutual couplings between the reference frames are eliminated. Moreover, the current harmonics are mapped into a reference frame, in which they can be easily controlled. The work also presents methods to determine the machine inductances by a finite-element analysis and by voltage-source inverters on-site. The derived model is validated by experimental results obtained with an example double-star interior PM (IPM) synchronous machine having the sets displaced by 30 electrical degrees. The derived transformation, and consequently, the decoupled d–q machine model, are shown to model the behavior of an actual machine with an acceptable accuracy. Thus, the proposed model is suitable to be used for the model-based control design of electric drives consisting of double-star IPM synchronous machines.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Kombinatorisk optimering handlar om att hitta en bra eller rent av den bästa möjliga lösningen från ett känt antal lösningar eller kombinationer. Ofta är antalet lösningar så enormt att en genomgång av alla olika lösningar inte är möjlig. En av huvudorsakerna till att det forskas inom kombinatorisk optimering är att liknande frågeställningar eller problem uppkommer inom så många olika områden. Påståendet stämmer speciellt bra för kvadratiska tilldelningsproblem(eng. Quadratic Assignment Problem). Sådana problem uppstår då man försöker beskriva en stor mängd tillämpade frågeställningar. Vilken gate skall väljas för flygen på större flygplatser för att minimera den totala väg människorna behöver gå och bagaget förflyttas? Var skall olika avdelningar på en fabrik placeras för att minimera materialförflyttningar mellan avdelningarna? Hur ser ett optimalt tangentbord ut för olika språk? Var skall komponenterna placeras på ett kretskort? De här är alla frågor som kan besvaras genom att lösa kvadratiska tilldelningsproblem. Kvadratiska tilldelningsproblem är dock mycket svåra att lösa. Det beror på att problemet i den standardform det matematiskt formuleras i huvudsak består av produkter av binära variabler. I denna avhandling har problemet omformulerats till en linjär diskret form som innehåller färre variabler. Med omformuleringen har bland annat flera tidigare olösta kvadratiska tilldelningsproblem kunnat lösas till globalt optimum, den bästa möjliga lösningen, för första gången någonsin.