Submitted by Morgana Silva (morgana_linhares@yahoo.com.br) on 2016-10-07T16:48:13Z No. of bitstreams: 1 arquivototal.pdf: 18219531 bytes, checksum: 0e90b5a1339f54b242beb9a61d7e6e1b (MD5) / Made available in DSpace on 2016-10-07T16:48:13Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 18219531 bytes, checksum: 0e90b5a1339f54b242beb9a61d7e6e1b (MD5) Previous issue date: 2015-03-30 / Various compositions and violin musical creations were developed with the tonal system and diatonic scale. And many musical contemporary works are like construction tools that favor the technical standard learning and giving considerable importance to scale studies. Currently, the execution of musical works is to get into music courses in schools, conservatories and universities. Considering this, the present study intended to make a descriptive, comparative and reflective analysis of the scale systems of violin from Carl Flesch (1926), Ivan Galamian (1985) and Simon Fischer (2012), checking their main characteristics, similarities and differences of approach and the design of teaching methodology. The above-mentioned authors´s works exercised and still influence on practice and on the technique of violinists generations. So the intention of the present work is, with the bibliographical, exploratory and descriptive research, to help the student with his contact to the scale systems, promoting an access to educational content and the study proposals. In order to facilitate the contact of student with the various types of technical approaches and points of view, we identify similarities and differences in relation with the left hand as fingerings, position changes, chromatic scales, double stops, "broken" thirds , arpeggios, tenths, octaves, articulations and the challenges of the right hand, on the subject of sound production, diversity of rhythms and of bowings. With this, we question the efficiency of exercises and the real motivations led these authors to write their systems. The differences of technical approaches, styles and teaching methodologies also contribute to the clarification and understanding of the changes that occurred in the period that each method was written. / Com a consolidação do sistema tonal e sua consequente formação escalar diatônica, diversas composições e criações musicais para o repertório do violino foram desenvolvidas. E muitas obras musicais da contemporaneidade são como ferramentas de construção que favorecem a aprendizagem técnica padrão e conferem ao estudo de escalas uma considerável importância. Na atualidade, frequentemente a execução de escalas é exigida em testes de admissão para cursos de música em escolas, conservatórios e universidades. Considerando o exposto, o presente estudo pretendeu fazer uma análise descritiva, comparativa e reflexiva entre os sistemas de escalas para o violino de Carl Flesch (1926), Ivan Galamian (1985) e Simon Fischer (2012), verificando suas principais características, semelhanças e diferenças na abordagem e na concepção da metodologia de ensino. Considerando que os trabalhos dos autores citados exerceram e, ainda, exercem influência na prática e técnica de várias gerações de violinistas, buscou-se com a pesquisa bibliográfica, exploratória e descritiva, auxiliar o estudante no seu contato com o sistema de escalas, promovendo um acesso ao conteúdo de ensino e às propostas de estudo. A fim de facilitar a aproximação do aluno com os diversos tipos de abordagens técnicas e dos pontos de vista, identificamos as semelhanças e diferenças em relação à mão esquerda, tais como dedilhados, mudanças deposição, escalas cromáticas, cordas duplas, terças “quebradas”, arpejos, décimas, oitavas, articulação e agilidade dos dedos, assim como os desafios da mão direita, no que diz respeito à produção sonora, diversidade de ritmos e de arcadas. Com isso, questionamos a eficiência dos exercícios e compreendemos as reais motivações que conduziram esses autoresa escreverem seus respectivos sistemas. As diferenças de abordagens técnicas, distintos estilos e metodologias de ensino também contribuem para o esclarecimento e entendimento das mudanças ocorridas no período em que foi escrito cada método.

Avec la complexité croissante des systèmes dynamiques qui apparaissent dans l'ingénierie et d'autres domaines de la science, l'étude des systèmes de grande taille composés d'un ensemble de sous-systèmes interconnectés est devenue un important sujet d'attention dans différents domaines, tels que la robotique, les réseaux de transports, les grandes structures spatiales (panneaux solaires, antennes, télescopes,...), les bâtiments,… et a conduit à des problèmes intéressants d'analyse d'identification paramétrique, de contrôle distribué et d'optimisation. L'absence d'une définition universelle et reconnue des systèmes qu'on appelle "grands systèmes", "systèmes complexes", "systèmes interconnectés",..., témoigne de la confusion entre ces différents concepts et la difficulté de définir des limites précises pour tels systèmes. L'analyse de l'identifiabilité et de l'identification de ces systèmes nécessite le traitement de modèles numériques de grande taille, la gestion de dynamiques diverses au sein du même système et la prise en compte de contraintes structurelles (des interconnections,...). Ceci est très compliqué et très délicat à manipuler. Ainsi, ces analyses sont rarement prises en considération globalement. La simplification du problème par décomposition du grand système en sous-problèmes de complexité réduite est souvent la seule solution possible, conduisant l'automaticien à exploiter clairement la structure du système.Cette thèse présente ainsi, une approche décentralisée d'identification des systèmes de grande taille "large scale systems" composés d'un ensemble de sous-systèmes interconnectés. Cette approche est basée sur les propriétés structurelles (commandabilité, observabilité et identifiabilité) du grand système. Cette approche à caractère méthodologique est mise en œuvre sur des applications thermiques des bâtiments. L'intérêt de cette approche est montré à travers des comparaisons avec une approche globale. / With the increasing complexity of dynamical systems that appear in engineering and other fields of science, the study of large systems consisting of a set of interconnected subsystems has become an important subject of attention in various areas such as robotics, transport networks, large spacial structures (solar panels, antennas, telescopes, \ldots), buildings, … and led to interesting problems of parametric identification analysis, distributed control and optimization. The lack of a universal definition of systems called "large systems", "complex systems", "interconnected systems", ..., demonstrates the confusion between these concepts and the difficulty of defining clear boundaries for such systems. The analysis of the identifiability and identification of these systems requires processing digital models of large scale, the management of diverse dynamics within the same system and the consideration of structural constraints (interconnections, ...) . This is very complicated and very difficult to handle. Thus, these analyzes are rarely taken into consideration globally. Simplifying the problem by decomposing the large system to sub-problems is often the only possible solution. This thesis presents a decentralized approach for the identification of "large scale systems" composed of a set of interconnected subsystems. This approach is based on the structural properties (controllability, observability and identifiability) of the global system. This methodological approach is implemented on thermal applications of buildings. The advantage of this approach is demonstrated through comparisons with a global approach.

京都大学 / 0048 / 新制・課程博士 / 博士(情報学) / 甲第22808号 / 情博第738号 / 新制||情||126(附属図書館) / 京都大学大学院情報学研究科システム科学専攻 / (主査)教授 大塚 敏之, 教授 加納 学, 教授 太田 快人 / 学位規則第4条第1項該当 / Doctor of Informatics / Kyoto University / DFAM

Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Civil Engineering, 1982. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING. / Bibliography: leaves 202-205. / by Kamal Nabil Ali Safwat. / Ph.D.

In today’s Data Centers, a combination of factors leads to the static allocation of physical servers and switches into dedicated clusters such that it is difficult to add or remove hardware from these clusters for short periods of time. This silofication of the hardware leads to inefficient use of clusters. This dissertation proposes a novel architecture for improving the efficiency of clusters by enabling them to add or remove bare-metal servers for short periods of time. We demonstrate by implementing a working prototype of the architecture that such silos can be broken and it is possible to share servers between clusters that are managed by different tools, have different security requirements, and are operated by tenants of the Data Center, which may not trust each other. Physical servers and switches in a Data Center are grouped for a combination of reasons. They are used for different purposes (staging, production, research, etc); host applications required for servicing specific workloads (HPC, Cloud, Big Data, etc); and/or configured to meet stringent security and compliance requirements. Additionally, different provisioning systems and tools such as Openstack-Ironic, MaaS, Foreman, etc that are used to manage these clusters take control of the servers making it difficult to add or remove the hardware from their control. Moreover, these clusters are typically stood up with sufficient capacity to meet anticipated peak workload. This leads to inefficient usage of the clusters. They are under-utilized during off-peak hours and in the cases where the demand exceeds capacity the clusters suffer from degraded quality of service (QoS) or may violate service level objectives (SLOs). Although today’s clouds offer huge benefits in terms of on-demand elasticity, economies of scale, and a pay-as-you-go model yet many organizations are reluctant to move their workloads to the cloud. Organizations that (i) needs total control of their hardware (ii) has custom deployment practices (iii) needs to match stringent security and compliance requirements or (iv) do not want to pay high costs incurred from running workloads in the cloud prefers to own its hardware and host it in a data center. This includes a large section of the economy including financial companies, medical institutions, and government agencies that continue to host their own clusters outside of the public cloud. Considering that all the clusters may not undergo peak demand at the same time provides an opportunity to improve the efficiency of clusters by sharing resources between them. The dissertation describes the design and implementation of the Market Driven Elastic Secure Infrastructure (MESI) as an alternative to the public cloud and as an architecture for the lowest layer of the public cloud to improve its efficiency. It allows mutually non-trusting physically deployed services to share the physical servers of a data center efficiently. The approach proposed here is to build a system composed of a set of services each fulfilling a specific functionality. A tenant of the MESI has to trust only a minimal functionality of the tenant that offers the hardware resources. The rest of the services can be deployed by each tenant themselves MESI is based on the idea of enabling tenants to share hardware they own with tenants they may not trust and between clusters with different security requirements. The architecture provides control and freedom of choice to the tenants whether they wish to deploy and manage these services themselves or use them from a trusted third party. MESI services fit into three layers that build on each other to provide: 1) Elastic Infrastructure, 2) Elastic Secure Infrastructure, and 3) Market-driven Elastic Secure Infrastructure. 1) Hardware Isolation Layer (HIL) – the bottommost layer of MESI is designed for moving nodes between multiple tools and schedulers used for managing the clusters. It defines HIL to control the layer 2 switches and bare-metal servers such that tenants can elastically adjust the size of the clusters in response to the changing demand of the workload. It enables the movement of nodes between clusters with minimal to no modifications required to the tools and workflow used for managing these clusters. (2) Elastic Secure Infrastructure (ESI) builds on HIL to enable sharing of servers between clusters with different security requirements and mutually non-trusting tenants of the Data Center. ESI enables the borrowing tenant to minimize its trust in the node provider and take control of trade-offs between cost, performance, and security. This enables sharing of nodes between tenants that are not only part of the same organization by can be organization tenants in a co-located Data Center. (3) The Bare-metal Marketplace is an incentive-based system that uses economic principles of the marketplace to encourage the tenants to share their servers with others not just when they do not need them but also when others need them more. It provides tenants the ability to define their own cluster objectives and sharing constraints and the freedom to decide the number of nodes they wish to share with others. MESI is evaluated using prototype implementations at each layer of the architecture. (i) The HIL prototype implemented with only 3000 Lines of Code (LOC) is able to support many provisioning tools and schedulers with little to no modification; adds no overhead to the performance of the clusters and is in active production use at MOC managing over 150 servers and 11 switches. (ii) The ESI prototype builds on the HIL prototype and adds to it an attestation service, a provisioning service, and a deterministically built open-source firmware. Results demonstrate that it is possible to build a cluster that is secure, elastic, and fairly quick to set up. The tenant requires only minimum trust in the provider for the availability of the node. (iii) The MESI prototype demonstrates the feasibility of having a one-of-kind multi-provider marketplace for trading bare-metal servers where providers also use the nodes. The evaluation of the MESI prototype shows that all the clusters benefit from participating in the marketplace. It uses agents to trade bare-metal servers in a marketplace to meet the requirements of their clusters. Results show that compared to operating as silos individual clusters see a 50% improvement in the total work done; up to 75% improvement (reduction) in waiting for queues and up to 60% improvement in the aggregate utilization of the test bed. This dissertation makes the following contributions: (i) It defines the architecture of MESI allows mutually non-trusting tenants of the data center to share resources between clusters with different security requirements. (ii) Demonstrates that it is possible to design a service that breaks the silos of static allocation of clusters yet has a small Trusted Computing Base (TCB) and no overhead to the performance of the clusters. (iii) Provides a unique architecture that puts the tenant in control of its own security and minimizes the trust needed in the provider for sharing nodes. (iv) A working prototype of a multi-provider marketplace for bare-metal servers which is a first proof-of-concept that demonstrates that it is possible to trade real bare-metal nodes at practical time scales such that moving nodes between clusters is sufficiently fast to be able to get some useful work done. (v) Finally results show that it is possible to encourage even mutually non-trusting tenants to share their nodes with each other without any central authority making allocation decisions. Many smart, dedicated engineers and researchers have contributed to this work over the years. I have jointly led the efforts to design the HIL and the ESI layer; led the design and implementation of the bare-metal marketplace and the overall MESI architecture.

No description available.

An interactive color graphics layout editor for VLSI has been implemented on the IBM PC. The software, PC-ICICLE, is written in Microsoft PASCAL and the 8086/88 Assembly Language under the DOS 2.0 environment. The basic hardware requirement is the standard configuration of the IBM PC with 256K bytes, and color graphics monitor and adapter. Without the need for any special hardware, PC-ICICLE makes layout editors more readily available to VLSI chip designers. PC-ICICLE has also been executed on the IBM PC-XT, IBM PC-AT, and Zenith's IBM compatible PC without any modifications. / Master of Science

Large scale optimization problems are tractable only if they are somehow decomposed. Hierarchical decompositions are inappropriate for some types of problems and do not parallelize well. Sobieszczanski-Sobieski has proposed a nonhierarchical decomposition strategy for nonlinear constrained optimization that is naturally parallel. Despite some successes on engineering problems, the algorithm as originally proposed fails on simple two dimensional quadratic programs. Here, the algorithm is carefully analyzed by testing it on simple quadratic programs, thereby recognizing the problems with the algorithm. Different modifications are made to improve its robustness and the best version is tested on a larger dimensional example. Some of the changes made are very fundamental, affecting the updating of the various tuning parameters present in the original algorithm. The algorithm involves solving a given problem by dividing it into subproblems and a final coordination phase. The results indicate good success with small problems. On testing it with a larger dimensional example, it was discovered that there is a basic flaw in the coordination phase which needs to be rectified. / Master of Science

京都大学 / 新制・課程博士 / 博士(情報学) / 甲第24263号 / 情博第807号 / 新制||情||136(附属図書館) / 京都大学大学院情報学研究科数理工学専攻 / (主査)准教授 加嶋 健司, 教授 太田 快人, 教授 山下 信雄 / 学位規則第4条第1項該当 / Doctor of Informatics / Kyoto University / DFAM

In this dissertation, we present several main research thrusts involving thermodynamic stabilization via energy dissipating hybrid controllers and nonlinear control of network systems. Specifically, a novel class of fixed-order, energy-based hybrid controllers is presented as a means for achieving enhanced energy dissipation in Euler-Lagrange, lossless, and dissipative dynamical systems. These dynamic controllers combine a logical switching architecture with continuous dynamics to guarantee that the system plant energy is strictly decreasing across switching. In addition, we construct hybrid dynamic controllers that guarantee that the closed-loop system is consistent with basic thermodynamic principles. In particular, the existence of an entropy function for the closed-loop system is established that satisfies a hybrid Clausius-type inequality. Special cases of energy-based hybrid controllers involving state-dependent switching are described, and the framework is applied to aerospace system models. The overall framework demonstrates that energy-based hybrid resetting controllers provide an extremely efficient mechanism for dissipating energy in nonlinear dynamical systems. Next, we present finite-time coordination controllers for multiagent network systems. Recent technological advances in communications and computation have spurred a broad interest in autonomous, adaptable vehicle formations. Distributed decision-making for coordination of networks of dynamic agents addresses a broad area of applications including cooperative control of unmanned air vehicles, microsatellite clusters, mobile robotics, and congestion control in communication networks. In this part of the dissertation we focus on finite-time consensus protocols for networks of dynamic agents with undirected information flow. The proposed controller architectures are predicated on the recently developed notion of system thermodynamics resulting in thermodynamically consistent continuous controller architectures involving the exchange of information between agents that guarantee that the closed-loop dynamical network is consistent with basic thermodynamic principles.