1 Abstract (English) Legal protection of computer program The subject of the thesis is the legal protection of computer programs. The thesis provides for various perspectives of legal protection analysis, namely static protection, dynamic changes and perspectives for enforcement. The aim is to summarize the complex view on forms of protection and disposals of computer programs, especially taking into consideration extremely fast technological advances in the latest decades. This view on legal protection is further extended by a short analysis of development of protection and enforcement of rights related to computer programs within the digital environment. It is essential to view the protection of computer programs as a very specific subject of legal relations. Computer programs have emerged just recently and the opinions on their protection still vary. The primary form of protection is the copyright protection. However, computer programs are defined typically by their functional character which is not reflected by standard copyright protection. Legal protection is therefore amended to reflect these aspects via implementation of specific rights based on directives on protection of computer programs. The thesis reflects also judicial advances, especially taking into consideration the shifts in the...

Java’s cross-platform virtual machine arrangement and its special features that make it ideal for writing network applications, also have a tremendous negative impact on its operations. In spite of its relatively weak performance, Java’s success has motivated the search for techniques to enhance its execution. This work presents the JAFARDD (a Java Architecture based on a Folding Algorithm, with Reservation stations, Dynamic translation, and Dual processing) processor designed to accelerate Java processing. JAFARDD dynamically translates Java bytecodes to RISC instructions to facilitate the use of a typical general-purpose RISC core. This enables the exploitation of the instruction level parallelism among the translated instructions using well established techniques, and facilitates the migration to Java-enabled hardware. Designing hardware for Java requires an extensive knowledge and understanding of its instruction set architecture which were acquired through a comprehensive behavioral analysis by benchmarking. Many aspects of the Java workload behavior were collected and the resulting statistics were analyzed. This helped identify performance-critical aspects that are candidates for hardware support. Our analysis surpasses other similar ones in terms of the number of aspects studied and the coverage of the recommendations made. Next, a global analysis of the design space of Java processors was carried out. Different hardware design options and alternatives that are suitable for Java were explored and their trade-offs were examined. We especially focused on the design methodology, execution engine organization, parallelism exploitation, and support for high-level language features. This analysis helped identify innovative design ideas such as the use of a modified Tomasulo’s algorithm. This, in turn, motivated the development of a bytecode folding algorithm that integrates with the reservation station concept in JAFARRD. While examining the behavioral analysis and the design space exploration ideas, a list of global architectural design principles started to emerge. These principles ensure JAFARRD can execute Java efficiently and are taken into consideration while the various instruction pipeline modules were designed. Results from the behavioral analysis also confirmed that Java’s stack architecture creates virtual data dependencies that limit performance and prohibit instruction level parallelism. To overcome this drawback, stack operation folding has been suggested in the literature to enhance performance by grouping contiguous instructions that have true data dependencies into a compound instruction. We have developed a folding algorithm that, unlike existing ones, does not require the folded instructions to be consecutive. To the best of our knowledge, our folding algorithm is the only one that permits nested pattern folding, tolerates variations in folding groups, and detects and resolves folding hazards completely. By incorporating this algorithm into a Java processor, the need for, and therefore the limitations of, a stack are eliminated. In addition to an efficient dual processing configuration (i.e., Java and RISC), JAFARDD is empowered with a number of innovative design features, including: an adaptive feedback fetch policy that copes with the variation in Java instruction size, a smart bytecode queue that compensates for the lack of a stack, an on-chip local variable file to facilitate operand access, an early tag assignment to dispatched instructions to reduce processing delay, and a specialized load/store unit that preprocesses object-oriented instructions. The functionality of JAFARDD has been successfully demonstrated through VHDL modeling and simulation. Furthermore, benchmarking using SPECjvm98 showed that the introduced techniques indeed speed up Java execution. Our bytecode folding algorithm speeds up execution by an average of about 1.29, eliminating an average of 97% of the stack instructions and 50% of the overall instructions. Compared to other proposals, JAFARDD combines Java bytecode folding with dynamic hardware translation, while maintaining the RISC nature of the processor, making this a much more flexible and general approach. / Graduate

Este trabalho apresenta o desenvolvimento e exemplos de aplicação de um software para cálculo de fluxo e pressões em silos cilíndricos metálicos de produtos agrícolas e industriais. As propriedades dos produtos a granel variam amplamente, e consequentemente suas pressões, tanto em grandeza e distribuição. Esses cálculos são importantes para prever picos de pressões imprevisíveis que podem causar sérios danos. O software está desenvolvido em linguagem Python com embasamento nas formulações do BS EN 1991-4 para silos esbeltos, medianamente esbeltos e baixos, com e sem excentricidades de carregamento e descarregamento, tremonhas cônicas, piramidais quadráticas, em forma de cunha ou de saída retangular dos tipos íngreme, rasa ou fundo plano. O programa é rápido, confiável, modular, estruturado e de fácil manuseio. A interface do software é simples para interação entre os dados fornecidos pelo usuário, tais como propriedades dos produtos armazenados, propriedades geométricas do silo e da tremonha, e os resultados obtidos das pressões e determinação do tipo de fluxo. São desenvolvidos exemplos de aplicação e análise dos resultados em silos cilíndricos metálicos de chapa corrugada muito comuns de uso em fazendas e cooperativas. Espera-se fornecer uma importante ferramenta para projetistas e desta forma criar projetos de silos mais eficientes, diminuindo falhas e colapsos. / This paper presents the development and application examples of software for calculation of pressures and flow in metal cylindrical silos of agricultural and industrial products. The properties of bulk materials vary widely, and consequently pressures, both in magnitude and distribution. These calculations are important to avoid peak unpredictable pressures that may cause serious damage. The software is developed in Python with grounding in the formulations of BS EN 1991-4 for silos slender, intermediate slenderness and squat, with and without loading and unloading eccentricities, conical and square pyramidal hoppers, wedge hoppers and hoppers of rectangular planform, shallow, steep or flat bottom. The program is fast, reliable, modular, structured and easy to handle. The software interface is simple for interaction between the data provided by the user, such as properties of stored products, geometric properties of the silo and hopper, and the results of the pressures and determining the type of flow. Are developed application examples and analysis of results in very common corrugated sheet metal cylindrical silos use in farms and cooperatives. It is expected to provide an important tool for designers and thus be more efficient silo designs, reducing failures and breakdowns.

Orientador: Dalton Soares Arantes / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-08T23:55:19Z (GMT). No. of bitstreams: 1 Cruz_AriadneArrais_M.pdf: 3860163 bytes, checksum: 0d7d8da694df81c51baff9f2d0088e8c (MD5) Previous issue date: 2007 / Resumo: O objetivo deste trabalho é apresentar um framework genérico e extensível para integração de WebLabs e outros Serviços via Web. Esta integração visa promover uma colaboração acadêmica em diferentes áreas da ciência, oferecendo aos desenvolvedores uma infra-estrutura básica de serviços, tais como uma comunicação cliente/servidor, serviços de persistência e facilidades para o desenvolvimento de interfaces de usuários. Infra-estruturas como esta viabilizam o compartilhamento de experimentos reais e remotos, explorando o novo paradigma de WebLab. O framework proposto é baseado em uma arquitetura modular e utiliza o conceito de plugins pré-instalados. Esta abordagem é bastante flexível, permitindo aos administradores do framework adicionar, remover ou atualizar seus serviços WebLabs sem a necessidade de recompilar o núcleo da plataforma ou de interromper os serviços. Isso garante um maior compartilhamento de código e facilidade de manutenção. O framework foi implementado utilizando metodologias do estado-da-arte, incluindo técnicas de programação avançadas como os Padrões de Projeto e o paradigma Ajax / Abstract: The objective of this work is to present a generic and extensible Framework for WebLab integration. Such integration aims at fostering academic collaboration in different areas of science, since it offers a basic service infrastructure to developers, such as client/server communication, persistency service and facilities for the development of user-friendly interfaces. An infrastructure such as this one is of great importance for scientists to share virtual and real remote experiments through the web. The proposed Framework is based on a modular architecture that uses the concept of preinstalled plugins. This approach is quite flexible, since it allows the Framework administrator to add, remove or upgrade the WebLab services without recompilation of the platform kernel or disruption of services. This guarantees a better code-sharing and an easier Framework maintenance. The Framework was implemented using state-of-the-art methodology and other advanced programming techniques, such as Design Patterns and Ajax / Mestrado / Telecomunicações e Telemática / Mestre em Engenharia Elétrica

Diplomová práce: Autorskoprávní ochrana počítačových programů Petr Kučera 2015 Resumé The goal of this thesis is to give readers insight into the copyright protection of computer programs as enshrined within Czech legal system especially under the Act no. 121/2000 Sb. taking into account the European and the international law. The text is divided into six chapters, which gradually present the reader to the topic. Firstly, this thesis approaches and explains the basic technical terms used further in the text. After this introductory chapter, the thesis deals with the cornerstone of copyright protection of computer programs which is the computer program itself as the object of the copyright and the nature of its copyright protection. This chapter among other things aims to familiarize the reader with the issue, which elements of the computer program are subject to the copyright protection and which are not. The next chapter is devoted to the authorship of a computer program. Firstly the theoretical concepts are presented and then follows the analysis of the process of development of a computer program. The analysis looks into activities pursued during this process and analyses their nature in terms of the copyright protection. The goal of this analysis is to distinguish possible authors of the computer...

This diploma thesis deals with video games as a problematic part of software law that is constantly growing in importance. It focuses on legal difficulties that were a byproduct of their growing economic potential. It further explains relevant aspects of copyright law in this matter and, to a limited degree, also related problematic from different branches of law, namely criminal law, administrative law and civil law. During the writing, I was focusing on distinctive aspects of video games as specific kind of software, and their distinctions from different kinds of works, especially from "classic" computer programs. An introduction to the problematics, an establishment of aims of this work and a brief summary of video games from the forties to the present times can be found in the first chapter. Basic terminology that is used in this work is in chapter two. The thesis further continues with legal concepts such as author, work and computer program. It proceeds with thoughts on a possible subsumption of video game under a certain kind of work as it is defined in the copyright act and considers establishing an individual category for video games. Chapter five defines content of copyrights, their division on personal and property law with a focus on the specification of different kinds of property law....

D.Ed. / Please refer to full text to view abstract

No description available.

The simplest and most widely used queueing model in call centres is the M/M/k system, sometimes referred to as Erlang-C. For many applications the model is an over-simplification. Erlang-C model ignores among other things busy signals, customer impatience and services that span multiple visits. Although the Erlang-C formula is easily implemented, it is not easy to obtain insight from its answers (for example, to find an approximate answer to questions such as "how many additional agents do I need if the arrival rate doubles?"). An approximation of the Erlang-C formula that gives structural insight into this type of question would be of use to better understand economies of scale in call centre operations. Erlang-C based predictions can also turn out highly inaccurate because of violations of underlying assumptions and these violations are not straightforward to model. For example, non-exponential service times lead one to the M/G/k queue which, in stark contrast to the M/M/k system, is difficult to analyse. This thesis deals mainly with the general M/GI/k model with abandonment. The arrival process conforms to a Poisson process, service durations are independent and identically distributed with a general distribution, there are k servers, and independent and identically distributed customer abandoning times with a general distribution. This thesis will endeavour to analyse call centres using M/GI/k model with abandonment and the data to be used will be simulated using EZSIM-software. The paper by Brown et al. [3] entitled "Statistical Analysis of a Telephone Call Centre: A Queueing-Science Perspective," will be the basis upon which this thesis is built.

Occam is designed for concurrent programming on a network of transputers. AIlocation and partitioning of the program is specified within the source code, binding the program to a specific network. An altemative approach is proposed which completely separates the source code from hardware considerations. Static allocation is performed as a separate phase and should, ideally, be automatic but at present is manual. Complete hardware abstraction requires that non-local, shared communication be provided for, introducing an efficiency overhead which can be minimised by the allocation. The proposal was implemented on a network of IBM PCs, modelled on a transputer network, and implementation issues are discussed