No description available.

ITC/USA 2008 Conference Proceedings / The Forty-Fourth Annual International Telemetering Conference and Technical Exhibition / October 27-30, 2008 / Town and Country Resort & Convention Center, San Diego, California / A common concern in telemetry post-processing environments is adequate disk storage capacity to house captured and post-processed telemetry data. In today's network environments there are many storage solutions that can be deployed to address storage needs. Recent trends in storage systems reveal movement to implement security services in storage systems. After reviewing storage options appropriate for telemetry post-processing environments; the security services such systems typically offer will also be discussed and contrasted with other third party security services that might be implemented directly on top of a networked storage system.

International Telemetering Conference Proceedings / October 26-29, 1998 / Town & Country Resort Hotel and Convention Center, San Diego, California / The necessity to acquire and analyze data dates back to the beginning of science itself. Long ago, a scientist may have run experiments and noted the results on a piece of paper. These notes became the data. The method was crude, but effective. As experiments got more complex, the need for better methodologies arose. Scientists began using computers to gather, analyze, and store the data. This method worked well for most types of data acquisition. As the amount of data being collected increased, larger computers, faster processors, and faster storage devices were used in order to keep up with the demand. This method was more refined, but still did not meet the needs of the scientific community. Requirements began to change in the data acquisition arena. More people wanted access to the data in real time. Companies producing large data acquisition systems began to move toward a network-based solution. This architecture featured a specialized computer called the server, which contained all of the data acquisition hardware. The server handled requests from multiple clients and handled the data flow to the network, data displays, and the archive medium. While this solution worked well to satisfy most requirements, it fell short in meeting others. The ability to have multiple computers working together across a local or wide area network (LAN or WAN) was not addressed. In addition, this architecture inherently had a single point of failure. If the server machine went down, all data from all sources was lost. Today, we see that the requirements for data acquisition systems include features only dreamed of five years ago. These new systems are linked around the world by wide area networks. They may include code to command satellites or handle 250 Mbps download rates. They must produce data for dozens of users at once, be customizable by the end user, and they must run on personal computers (PCs)! Systems like these cannot work using the traditional client/server model of the past. The data acquisition industry demands systems with far more features than were traditionally available. These systems must provide more reliability and interoperability, and be available at a fraction of the cost. To this end, we must use commercial-off-the-shelf (COTS) computers that operate faster than the mainframe computers of only a decade ago. These computers must run software that is smart, reliable, scalable, and easy to use. All of these requirements can be met by a network of PCs running the Windows NT operating system.

Šis darbas yra skirtas šiuolaikinės atomo trikdžių teorijos matematinio aparato, paremto efektinių operatorių formalizmu, plėtojimui. Darbe nuosekliai ir sistemingai, pradedant nuo pačių bendriausių principų, nagrinėjami Foko erdvės apribojimo į redukavimo grupių neredukuotinus poerdvius metodai bei pateikiama neredukuotinų tenzorinių operatorių, charakterizuojančių fizikines ir efektines sąveikas, klasifikacija bendrais ir tam tikrais atskirais atvejais. Gautos išraiškos ir iš jų išplaukiančios išvados yra grindžiamos matematine kalba. Dauguma esminių rezultatų yra suformuluoti teoremų pavidalu. Disertaciją sudaro 101 puslapis, 5 skyriai, 4 priedai, 40 lentelių ir 9 paveikslėliai. Pagrindiniai rezultatai, pateikti disertacijoje, yra publikuoti fizikos ir matematikos mokslų žurnaluose. / The principal goals of the thesis are subjected to general methods and forms of effective operators by the nowadays demands of theoretical application of many-body perturbation theory to atomic physics. The present theoretical research follows up step by step by systematic observation of various possibilities to restrict the Fock space operators to their irreducible subspaces and the classification of irreducible tensor operators which represent the physical as well as the effective interactions. To ground the results of the thesis, the symbolic preparation of obtained expressions is strictly proved mathematically. Most of the main results are listed in theorems. The doctoral dissertation contains 101 pages, 5 sections, 4 appendices, 40 tables and 9 figures. The main results described in the present dissertation have been published in journals of physical and mathematical sciences.

The principal goals of the thesis are subjected to general methods and forms of effective operators by the nowadays demands of theoretical application of many-body perturbation theory to atomic physics. The present theoretical research follows up step by step by systematic observation of various possibilities to restrict the Fock space operators to their irreducible subspaces and the classification of irreducible tensor operators which represent the physical as well as the effective interactions. To ground the results of the thesis, the symbolic preparation of obtained expressions is strictly proved mathematically. Most of the main results are listed in theorems. The doctoral dissertation contains 101 pages, 5 sections, 4 appendices, 40 tables and 9 figures. The main results described in the present dissertation have been published in journals of physical and mathematical sciences. / Šis darbas yra skirtas šiuolaikinės atomo trikdžių teorijos matematinio aparato, paremto efektinių operatorių formalizmu, plėtojimui. Darbe nuosekliai ir sistemingai, pradedant nuo pačių bendriausių principų, nagrinėjami Foko erdvės apribojimo į redukavimo grupių neredukuotinus poerdvius metodai bei pateikiama neredukuotinų tenzorinių operatorių, charakterizuojančių fizikines ir efektines sąveikas, klasifikacija bendrais ir tam tikrais atskirais atvejais. Gautos išraiškos ir iš jų išplaukiančios išvados yra grindžiamos matematine kalba. Dauguma esminių rezultatų yra suformuluoti teoremų pavidalu. Disertaciją sudaro 101 puslapis, 5 skyriai, 4 priedai, 40 lentelių ir 9 paveikslėliai. Pagrindiniai rezultatai, pateikti disertacijoje, yra publikuoti fizikos ir matematikos mokslų žurnaluose.

Ce mémoire traite des structures affines et de leur rapport à la géométrie de l'information. Nous y introduisons la notion de T-plongement. Il permet de montrer que l'ensemble des structures affines complètes du tore T^2 est une courbe projective de RP^2. En substituant à la contrainte topologique (compacité) une contrainte dynamique (action canonique de Aff_0(1) dans le démi-plan de Poincaré H^2)on démontre que l'ensemble S des structures Aff_0(1)-invariantes dans H^2 est une surface projective connexe dans RP^5 ne contenant aucun point complet. Un de mes résultats remarquables concerne la classification des éléments de S pour la relation d'isomorphisme.Nous exploitons un outil récent: la KV-cohomologie. Outre le rôle fondamental joué par la KV-cohomologie dans l'étude des points rigides dans certains modules des structures affines, elle nous a permis d'aborder avec succès une problématique qui est au centre de la géométrie de l'information. Cette problématique concerne la détermination des structures affines invariantes dans les variétés modèles statistiques qui sont invariantes par toute transformation non singulière de l'espace des paramètres. Celles-ci ont une signification pertinente en statistique. / This dissertation deals with modules of affinely flat structure and with their relationships between these structures and the information geometry. The so-called T-embedding is used to prove that the set of complete locally flat structures is an irreducible projective curve in RP^2. In the same way we prove that the set S of Aff_0(1)-invariant locally flat structure in H^2 is a connected projective surface in RP^5, which does not contain any complete point. We also give the classification up to isomorphism of S. We use the KV-cohomology to study the rigidity problem for locally flat structures. The main concern of information geometry is the study of geometrical invariants in statistical models. We perform the KV-cohomology to bring in control this problem.

Au cours de cette thèse, nous avons étudié des modèles de partitions aléatoires issus de la théorie des représentations des groupes symétriques et des groupes de Chevalley finis classiques, en particulier les groupes GL(n,Fq). Nous avons démontré des résultats de concentration gaussienne pour :- les q-mesures de Plancherel (de type A), qui correspondent à l'action de GL(n,Fq) sur la variété des drapeaux complets de (Fq)^n, et sont liées à la théorie des représentations des algèbres d'Hecke des groupes symétriques.- l'analogue en type B du modèle précédent, correspondant à l'action de Sp(2n,Fq) sur la variété des drapeaux totalement isotropes complets dans (Fq)^2n.- les mesures de Schur-Weyl, qui correspondent aux actions commutantes de GL(N,C) et Sn sur l'espace des n-tenseurs d'un espace vectoriel de dimension N.- et les mesures de Gelfand, qui correspondent à la représentation du groupe symétrique qui est la somme directe sans multiplicité de toutes les représentations irréductibles de Sn.Dans chaque cas, nous avons établi une loi des grands nombres et un théorème central limite tout à fait semblable à la loi des grands nombres de Logan-Shepp-Kerov-Vershik (1977) et au théorème central limite de Kerov (1993) pour les mesures de Plancherel des groupes symétriques.Nos résultats peuvent presque tous être traduits en termes de combinatoire des mots, et d'autre part, les techniques employées sont inspirées des techniques de la théorie des matrices aléatoires. Ainsi, on a calculé pour chaque modèle l'espérance de fonctions polynomiales sur les partitions, qui jouent un rôle tout à fait analogue aux polynômes traciaux en théorie des matrices aléatoires. L'outil principal des preuves est ainsi une algèbre d'observables de diagrammes de Young, qu'on peut aussi interpréter comme algèbre de permutations partielles. Nous avons tenté de généraliser cette construction au cas d'autres groupes et algèbres, et nous avons construit une telle généralisation dans le cas des algèbres d'Hecke des groupes symétriques. Ces constructions rentrent dans le cadre très abstrait des fibrés de semi-groupes par des semi-treillis ; dans le même contexte, on peut formaliser des problèmes combinatoires sur les permutations, par exemple le problème du calcul des nombres de Hurwitz / During this thesis, we have studied models of random partitions stemming from the representation theory of the symmetric groups and the classical finite Chevalley groups, in particular the groups GL(n,Fq). We have shown results of gaussian concentration in the case of:- q-Plancherel measures (of type A), that correspond to the action of GL(n,Fq) on the variety of complete flags of (Fq)^n, and are related to the representation theory of the Hecke algebras of the symmetric groups.- the analogue in type B of the aforementioned model, that corresponds to the action of Sp(2n,Fq) on the variety of complete totally isotropic flags in (Fq)^2n.- Schur-Weyl measures, that correspond to the two commuting actions of GL(N,C) and Sn on the space of n-tensors of a vector space of dimension N.- Gelfand measures, that correspond to the representation of the symmetric group which is the multiplicity-free direct sum of all irreducible representations of Sn.In each case, we have established a law of large numbers and a central limit theorem similar to the law of large numbers of Logan-Shepp-Kerov-Vershik (1977) and to Kerov's central limit theorem (1993) for the Plancherel measures of the symmetric groups. Almost all our results can be restated in terms of combinatorics of words, and besides, the tools of the proofs are inspired by the usual techniques of random matrix theory. Hence, we have computed for each model the expectation of polynomial functions on partitions, that play a role similar to the tracial polynomials in random matrix theory. The principal tool of the proofs is therefore an algebra of observables of diagrams, that can also be interpreted as an algebra of partial permutations. We have tried to generalize this construction to the case of other groups and algebras, and we have constructed such a generalization in the case of the Hecke algebras of the symmetric groups. These constructions belong to the abstract setting of semilattice bundles over semigroups; in the same setting, one can formalize combinatorial problems on permutations, for instance the problem of computing the Hurwitz numbers

Un des outils numériques les plus utilisés en ingénierie est la méthode des éléments finis, qui peut être mise en o euvre grâce à l'utilisation de nombreux codes de calcul. Toutefois, une difficulté apparaît lors de l'utilisation de la méthode des éléments finis, spécialement en géotechnique, lorsque la structure étudiée est en interaction avec un domaine de dimensions infinies. L'usage courant en ingénierie est alors de réaliser les calculs sur des domaines bornés, mais la définition de la frontière de tels domaines bornés pose de sérieux problèmes. Pour traiter convenablement les problèmes comportant des frontières à l'infini, l'utilisation d'éléments discrets "infinis" est maintenant souvent délaissée au profit de la méthode des équations intégrales ou "méthode des éléments de frontière" qui permet de résoudre un système d'équations aux dérivées partielles linéaire dans un domaine infini en ne maillant que la frontière du domaine à distance finie. La mise en oeuvre du couplage entre la méthode des éléments finis et la méthode des éléments de frontière apparaît donc comme particulièrement intéressante car elle permet de bénéficier de la flexibilité des codes de calcul par éléments finis tout en permettant de représenter les domaines infinis à l'aide de la méthode des éléments de frontière. La méthode est basée sur la construction de la "matrice de raideur" du domaine infini grâce à l'utilisation de la méthode des équations intégrales. Il suffit alors d'assembler la matrice de raideur du domaine infini avec la matrice de raideur du domaine fini représenté par éléments finis. L'utilisation de la méthode la plus simple de traitement des équations intégrales, dite méthode de « collocation » conduit à une matrice de raideur non-symétrique. Par ailleurs, la méthode dite «Singular Galerkin» conduit à une formulation symétrique, mais au prix du calcul d'intégrales hypersingulières. La thèse porte sur une nouvelle formulation permettant d'obtenir une matrice de raideur symétrique sans intégrales hypersingulières, dans le cas de problèmes plans. Quelques applications numériques sont abordées pour des problèmes courants rencontrés en géotechnique / One of the most used numerical tools in engineering is the finite element method, which can be implemented through the use of many computer codes. However, a difficulty arises when using the finite element method, especially in geotechnical engineering, where the structure is studied in interaction with a field of infinite dimensions. The commonly used in engineering is then performming the calculations on bounded domains, but the definition of the border of the domain also poses serious problems. To properly solve the problems which have the boundary at infinity, the use of discrete elements "infinite" is now often neglected in favor of the integral equations method or "boundary element method", which allows to solve a linear partial differential equations system in an infinite domain by the discretization of the only boundary of the domain at finite distance. The implementation of coupling between the finite element method and boundary element method is therefore particularly interesting because it allows to benefit the flexibility of computer codes by the finite element method, while the infinite domains is represented by the help of the integral equations method. It is sufficient to assemble the stiffness matrix of infinite domain with the stiffness matrix of finite domain represented by finite elements. Using the simplest method of treatment of integral equations, known as method of "collocation" leads to a non-symmetric stiffness matrix. Furthermore, a method known “Galerkin Singular” leads to a symmetric formulation, but it is at the cost of computing hypersingular integrals. The thesis focuses on a new formulation to obtain a symmetric stiffness matrix without full hypersingular, in the case of plane problems. Some numerical applications are discussed for common problems encountered in geotechnical engineering

Game theory is the study of strategic interaction between rational agents. The need for understanding interaction arises in many different fields, such as: economics, psychology, philosophy, computer science and biology. The purpose of game theory is to analyse the outcomes and strategies of these interactions, in mathematical models called games. Some of these games have stood out from the rest, e.g. Prisoner's Dilemma, Chicken and Stag Hunt. These games, commonly referred to as the standard games, have attracted interest from many fields of research. In order to understand why these games are interesting and how they differ from each other and other games, many have attempted to sort games into interestingly different classes. In this thesis some already existing classifications are reviewed based on their mathematical structure and how well justified they are. Emphasis is put on mathematical simplicity because it makes the classification more generalisable to larger game spaces. From this review we conclude that none of the classifications captures both of these aspects. We therefore propose a classification of symmetric 2x2 games based on decomposition. We show that our proposed method captures everything that the previous classifications caputure. Our method arguably explains the interesting differences between the games, and we justify this claim by computer experiments. Moreover it has a simple mathematical structure. We also provide some results concerning the size of different game spaces.

In this thesis we study gradings on blocks of group algebras. The motivation to study gradings on blocks of group algebras and their transfer via derived and stable equivalences originates from some of the most important open conjectures in representation theory, such as Broue’s abelian defect group conjecture. This conjecture predicts the existence of derived equivalences between categories of modules. Some attempts to prove Broue’s conjecture by lifting stable equivalences to derived equivalences highlight the importance of understanding the connection between transferring gradings via stable equivalences and transferring gradings via derived equivalences. The main idea that we use is the following. We start with an algebra which can be easily graded, and transfer this grading via derived or stable equivalence to another algebra which is not easily graded. We investigate the properties of the resulting grading. In the first chapter we list the background results that will be used in this thesis. In the second chapter we study gradings on Brauer tree algebras, a class of algebras that contains blocks of group algebras with cyclic defect groups. We show that there is a unique grading up to graded Morita equivalence and rescaling on an arbitrary basic Brauer tree algebra. The third chapter is devoted to the study of gradings on tame blocks of group algebras. We study extensively the class of blocks with dihedral defect groups. We investigate the existence, positivity and tightness of gradings, and we classify all gradings on these blocks up to graded Morita equivalence. The last chapter deals with the problem of transferring gradings via stable equivalences between blocks of group algebras. We demonstrate on three examples how such a transfer via stable equivalences is achieved between Brauer correspondents, where the group in question is a TI group.