Systems-of-Systems (SoS) have performed an important and even essential role to the whole society and refer to complex softwareintensive systems, resulted from interoperability of independent constituent systems that work together to achieve more complex missions. SoS have emerged specially in critical application domains and, therefore, high level of quality must be assured during their development and evolution. However, dealing with quality of SoS still presents great challenges, as SoS present a set of unique characteristics that can directly affect the quality of such systems. Moreover, there are not comprehensive models that can support the quality evaluation of SoS. Motivated by this scenario, the main contribution of this Masters project is to present a SoS Evaluation Model, more specifically, addressing the crisis/emergency management domain, built in the context of a large international research project. The proposed model covers important evaluation activities and considers all SoS characteristics and challenges not usually addressed by other models. This model was applied to evaluate a crisis/emergency management SoS and our results have shown it viability to the effective management of the SoS quality. / Sistemas-de-Sistemas (SoS, do inglês Systems-of-Systems) realizam um importante e até essencial papel na sociedade. Referem-se a complexos sistemas intensivos em software, resultado da interoperabilidade de sistemas constituintes independentes que trabalham juntos para realizar missões mais complexas. SoS têm emergido especialmente em domínios de aplicação crítica, portanto, um alto nível de qualidade deve ser garantido durante seu desenvolvimento e evolução. Entretanto, lidar com qualidade em SoS ainda apresenta grandes desafios, uma vez que possuem um conjunto de características únicas que podem diretamente afetar a qualidade desses sistemas. Além disso, não existem modelos abrangentes para o suporte à avaliação de qualidade de SoS. Motivado por este cenário, a principal contribuição deste projeto de mestrado é apresentar um modelo de avaliação para SoS, especialmente destinado ao domínio de gerenciamento de crises e emergências. Este modelo foi construído no contexto de um grande projeto de pesquisa internacional, e cobre as mais importantes atividades de avaliação, considerando as principais características e desafios de SoS geralmente não abordados por outros modelos. Este modelo foi aplicado na avaliação de um SoS de gerenciamento de crises e emergência, e nossos resultados têm mostrado sua viabilidade para o efetivo gerenciamento da qualidade de SoS.

<p>Na osnovu istraživanja u ovoj disertaciji i implemetiranog<br />softverskog rešenja za podršku upravljanju industrijskim<br />preduzećima utvrđeno je da sama implementacija ERP sistema nije<br />dovoljna, i da su potrebni MES sistemi koji pružaju informacije u<br />realnom vremenu koje pomažu da se donese odluka u cilju unapređenja<br />proizvodnih sistema i omogućuju kontrolu nad svim elementima<br />proizvodnog procesa, prema osnovnim načelima LEAN proizvodnje i<br />TQM.</p> / <p>Based on the research in this dissertation and implementation оf software<br />solution for support of management of industrial enterprises it was found that<br />implementation of ERP systems is not sufficient, and it is necessary<br />implementation of MES systems which provide real-time information for<br />making a decision for improvement of the production system and enable<br />control of all elements of the manufacturing process, according to the basic<br />principles of LEAN production and TQM.</p>

Many dynamical systems in nature and technology involve delays in the interaction of variables forming the system. Furthermore, many of such systems involve external inputs or perturbations which might force the system to have arbitrary initial function. The conventional way to model these systems is using delay differential equations (DDE). However, DDEs with arbitrary initial functions has serious problems for finding analytical and computational solutions. This fact is a strong motivation for considering abstractions and approximations for dynamical systems involving delay. In this thesis, the piecewise linear systems with delay on piecewise constant part which is a useful subclass of hybrid dynamical systems is studied. We introduced various representations of these systems and studied the state transition conditions. We showed that there exists fixed point and periodic stable solutions. We modelled the genomic regulation of fission yeast cell cycle. We discussed various potential uses including approximating the DDEs and finally we concluded.

Regulatory processes and history dependent behavior appear in many dynamical systems in nature and technology. For modeling regulatory processes, hybrid systems offer several advances. From this point of view, to observe the capability of hybrid systems in a history dependent system is a strong motivation. In this thesis, we developed functional hybrid systems which exhibit memory dependent behavior such that the dynamics of the system is determined by both the location of the state vector and the memory. This property was explained by various examples. We used the hybrid system with memory in modeling the gene regulatory network of human immune response to Influenza A virus infection. We investigated the sensitivity of the piecewise linear model with memory. We introduced how the model can be developed in future.

In a data streaming system, each component consumes one or several streams of data on the fly and produces one or several streams of data for other components. The entire Internet can be viewed as a giant data streaming system. Other examples include real-time exploratory data mining and high performance transaction processing. In this thesis we study several measurement and resource allocation optimization problems of data streaming systems. Measuring quantities associated with one or several data streams is often challenging because the sheer volume of data makes it impractical to store the streams in memory or ship them across the network. A data streaming algorithm processes a long stream of data in one pass using a small working memory (called a sketch). Estimation queries can then be answered from one or more such sketches. An important task is to analyze the performance guarantee of such algorithms. In this thesis we describe a tail bound problem that often occurs and present a technique for solving it using majorization and convex ordering theories. We present two algorithms that utilize our technique. The first is to store a large array of counters in DRAM while achieving the update speed of SRAM. The second is to detect global icebergs across distributed data streams. Resource allocation decisions are important for the performance of a data streaming system. The processing graph of a data streaming system forms a fork and join network. The underlying data processing tasks consists of a rich set of semantics that include synchronous and asynchronous data fork and data join. The different types of semantics and processing requirements introduce complex interdependence between various data streams within the network. We study the distributed resource allocation problem in such systems with the goal of achieving the maximum total utility of output streams. For networks with only synchronous fork and join semantics, we present several decentralized iterative algorithms using primal and dual based optimization techniques. For general networks with both synchronous and asynchronous fork and join semantics, we present a novel modeling framework to formulate the resource allocation problem, and present a shadow-queue based decentralized iterative algorithm to solve the resource allocation problem. We show that all the algorithms guarantee optimality and demonstrate through simulation that they can adapt quickly to dynamically changing environments.

Thesis (doctoral)--Universität Kaiserslautern, 2002. / Includes bibliographical references (p. 219-234) and index.

Transactional memory systems are expected to enable parallel programming at lower programming complexity, while delivering improved performance over traditional lock-based systems. Nonetheless, there are certain situations where transactional memory systems could actually perform worse. Transactional memory systems can outperform locks only when the executing workloads contain sufficient parallelism. When the workload lacks inherent parallelism, launching excessive transactions can adversely degrade performance. These situations will actually become dominant in future workloads when large-scale transactions are frequently executed. In this thesis, we propose a new paradigm called adaptive transaction scheduling to address this issue. Based on the parallelism feedback from applications, our adaptive transaction scheduler dynamically dispatches and controls the number of concurrently executing transactions. In our case study, we show that our low-cost mechanism not only guarantees that hardware transactional memory systems perform no worse than a single global lock, but also significantly improves performance for both hardware and software transactional memory systems.

No description available.

No description available.

Thesis (M.Info.Tech.)--University of Wollongong, 2005. / Includes appendices. Typescript. Includes bibliographical references: leaf 100-105.