Duality theory and forms of organizing

This paper presents results from a survey of organizing forms in Australia's largest public companies between 2000 and 2004. The study sought to identify trends in forms of organizing and the extent to which the uptake of new forms led to a decrease in traditional forms of organizing. The analysis revealed changes across the organizational dimensions of structures, processes and boundaries. While Australian firms were clearly interested in exploring new forms of organizing, uptake was not universal, nor at the expense of traditional forms of organizing. An admixture of traditional and new, or dual, forms of organizing emerged as the preferred response to environmental turbulence. This paper employs and extends duality theory to explain the changes that occurred in Australian public companies over the four year period. Duality theory is operationalized in terms of five duality characteristics, which are employed to assess the composition and balance of traditional and new fOlms of organizing. The paper proposes that a dualities aware perspective offers a potential way forward in managing the balance between ostensibly contradictory forces of continuity and change.

On duality in linear fractional programming

In this paper, a dual of a given linear fractional program is defined and the weak, direct and converse duality theorems are proved. Both the primal and the dual are linear fractional programs. This duality theory leads to necessary and sufficient conditions for the optimality of a given feasible solution. A unmerical example is presented to illustrate the theory in this connection. The equivalence of Charnes and Cooper dual and Dinkelbach’s parametric dual of a linear fractional program is also established.

Duality in Constrained DC-Optimization via Toland’s Duality Approach

2000 Mathematics Subject Classification: 90C48, 49N15, 90C25

Vector Theory of Spontaneous Lorentz Violation

Classical electromagnetism predicts two massless propagating modes, which are known as the two polarizations of the photon. On the other hand, if the Lorentz symmetry of classical electromagnetism is spontaneously broken, the new theory will still have two massless Nambu-Goldstone modes resembling the photon. If the Lorentz symmetry is broken by a bumblebee potential that allows for excitations out of the minimum, then massive modes arise. Furthermore, in curved spacetime, such massive modes will be created through a process other than the usual Higgs mechanism because of the dependence of the bumblebee potential on both the vector field and the metric tensor. Also, it is found that these massive modes do not propagate due to the extra constraints.

Dynamics of Spatial Game Theory Networks with Novel Modifications

Introduction: Advances in biotechnology have shed light on many biological processes. In biological networks, nodes are used to represent the function of individual entities within a system and have historically been studied in isolation. Network structure adds edges that enable communication between nodes. An emerging fieldis to combine node function and network structure to yield network function. One of the most complex networks known in biology is the neural network within the brain. Modeling neural function will require an understanding of networks, dynamics, andneurophysiology. It is with this work that modeling techniques will be developed to work at this complex intersection. Methods: Spatial game theory was developed by Nowak in the context of modeling evolutionary dynamics, or the way in which species evolve over time. Spatial game theory offers a two dimensional view of analyzingthe state of neighbors and updating based on the surroundings. Our work builds upon this foundation by studying evolutionary game theory networks with respect to neural networks. This novel concept is that neurons may adopt a particular strategy that will allow propagation of information. The strategy may therefore act as the mechanism for gating. Furthermore, the strategy of a neuron, as in a real brain, isimpacted by the strategy of its neighbors. The techniques of spatial game theory already established by Nowak are repeated to explain two basic cases and validate the implementation of code. Two novel modifications are introduced in Chapters 3 and 4 that build on this network and may reflect neural networks. Results: The introduction of two novel modifications, mutation and rewiring, in large parametricstudies resulted in dynamics that had an intermediate amount of nodes firing at any given time. Further, even small mutation rates result in different dynamics more representative of the ideal state hypothesized. Conclusions: In both modificationsto Nowak's model, the results demonstrate the network does not become locked into a particular global state of passing all information or blocking all information. It is hypothesized that normal brain function occurs within this intermediate range and that a number of diseases are the result of moving outside of this range.

Robust linear semi-infinite programming duality under uncertainty

In this paper, we propose a duality theory for semi-infinite linear programming problems under uncertainty in the constraint functions, the objective function, or both, within the framework of robust optimization. We present robust duality by establishing strong duality between the robust counterpart of an uncertain semi-infinite linear program and the optimistic counterpart of its uncertain Lagrangian dual. We show that robust duality holds whenever a robust moment cone is closed and convex. We then establish that the closed-convex robust moment cone condition in the case of constraint-wise uncertainty is in fact necessary and sufficient for robust duality. In other words, the robust moment cone is closed and convex if and only if robust duality holds for every linear objective function of the program. In the case of uncertain problems with affinely parameterized data uncertainty, we establish that robust duality is easily satisfied under a Slater type constraint qualification. Consequently, we derive robust forms of the Farkas lemma for systems of uncertain semi-infinite linear inequalities.

Spectral theory of operators in Hilbert space. [Lecture notes]

Bibliography: leaf [205]

Fundamental points of potential theory.

Errata corrige, 1 leaf between p. 318 and 319.

Impact of Energy Expenditure Rate Constraints on the performance of Multihop Wireless Mesh Networks

In this article we study the problem of joint congestion control, routing and MAC layer scheduling in multi-hop wireless mesh network, where the nodes in the network are subjected to maximum energy expenditure rates. We model link contention in the wireless network using the contention graph and we model energy expenditure rate constraint of nodes using the energy expenditure rate matrix. We formulate the problem as an aggregate utility maximization problem and apply duality theory in order to decompose the problem into two sub-problems namely, network layer routing and congestion control problem and MAC layer scheduling problem. The source adjusts its rate based on the cost of the least cost path to the destination where the cost of the path includes not only the prices of the links in it but also the prices associated with the nodes on the path. The MAC layer scheduling of the links is carried out based on the prices of the links. We study the e�ects of energy expenditure rate constraints of the nodes on the optimal throughput of the network.

Distribution of Healthcare resources II.Study and Comparison of a Linear Programming Problem and its Dual. Resolution and Evaluation of a Practical Case and its Programming using Excel and Win QSB.

[EN]This research had as primary objective to model different types of problems using linear programming and apply different methods so as to find an adequate solution to them. To achieve this objective, a linear programming problem and its dual were studied and compared. For that, linear programming techniques were provided and an introduction of the duality theory was given, analyzing the dual problem and the duality theorems. Then, a general economic interpretation was given and different optimal dual variables like shadow prices were studied through the next practical case: An aesthetic surgery hospital wanted to organize its monthly waiting list of four types of surgeries to maximize its daily income. To solve this practical case, we modelled the linear programming problem following the relationships between the primal problem and its dual. Additionally, we solved the dual problem graphically, and then we found the optimal solution of the practical case posed through its dual, following the different theorems of the duality theory. Moreover, how Complementary Slackness can help to solve linear programming problems was studied. To facilitate the solution Solver application of Excel and Win QSB programme were used.

Variétés de drapeaux et opérateurs différentiels

Soit G un groupe algébrique semi-simple sur un corps de caractéristique 0. Ce mémoire discute d'un théorème d'annulation de la cohomologie supérieure du faisceau D des opérateurs différentiels sur une variété de drapeaux de G. On démontre que si P est un sous-groupe parabolique de G, alors H^i(G/P,D)=0 pour tout i>0. On donne en fait trois preuves indépendantes de ce théorème. La première preuve est de Hesselink et n'est valide que dans le cas où le sous-groupe parabolique est un sous-groupe de Borel. Elle utilise un argument de suites spectrales et le théorème de Borel-Weil-Bott. La seconde preuve est de Kempf et n'est valide que dans le cas où le radical unipotent de P agit trivialement sur son algèbre de Lie. Elle n'utilise que le théorème de Borel-Weil-Bott. Enfin, la troisième preuve est attribuée à Elkik. Elle est valide pour tout sous-groupe parabolique mais utilise le théorème de Grauert-Riemenschneider. On présente aussi une construction détaillée du faisceau des opérateurs différentiels sur une variété.

Simulation de la nage anguilliforme

Ce document traite premièrement des diverses tentatives de modélisation et de simulation de la nage anguilliforme puis élabore une nouvelle technique, basée sur la méthode de la frontière immergée généralisée et la théorie des poutres de Reissner-Simo. Cette dernière, comme les équations des fluides polaires, est dérivée de la mécanique des milieux continus puis les équations obtenues sont discrétisées afin de les amener à une résolution numérique. Pour la première fois, la théorie des schémas de Runge-Kutta additifs est combinée à celle des schémas de Runge-Kutta-Munthe-Kaas pour engendrer une méthode d’ordre de convergence formel arbitraire. De plus, les opérations d’interpolation et d’étalement sont traitées d’un nouveau point de vue qui suggère l’usage des splines interpolatoires nodales en lieu et place des fonctions d’étalement traditionnelles. Enfin, de nombreuses vérifications numériques sont faites avant de considérer les simulations de la nage.