In this thesis, a framework for improving model-driven system design productivity with Requirements-Driven Design Automation (RDDA) is presented. The key to the proposed approach is to close the semantic gap between requirements, components and architecture by using compatible semantic models for describing product requirements and component capabilities, including constraints. An ontology-based representation language is designed that spans requirements for the application domain, the software design domain and the component domain. Design automation is supported for architecture development by machine-based mapping of desired product/subsystem features and capabilities to library components and by synthesis and maintenance of Systems Modeling Language (SysML) design structure diagrams. The RDDA framework uses standards-based semantic web technologies and can be integrated with exiting modeling tools. Requirements specification is a major component of the system development cycle. Mistakes and omissions in requirements documents lead to ambiguous or wrong interpretation by engineers, causing errors that trickle down in design and implementation with consequences on the overall development cost. We describe a methodology for requirements specification that aims to alleviate the above issues and that produces models for functional requirements that can be automatically validated for completeness and consistency. The RDDA framework uses an ontology-based language for semantic description of functional product requirements, SysML structure diagrams, component constraints, and Quality of Service. The front-end method for requirements specification is the SysML editor in Rhapsody. A requirements model in Web Ontology Language (OWL) is converted from SysML to Extensible Markup Language Metadata Interchange (XMI) representation. / The specification is validated for completeness and consistency with a ruled-based system implemented in Prolog. With our methodology, omission s and several types of consistency errors present in the requirements specification are detected early on, before the design stage. Component selection and design automation have the potential to play a major role in reducing the system development time and cost caused by the rapid change in technology advances and the large solution search space. In our work, we start from a structured representation of requirements and components using SysML, and based on specific set of rules written in Prolog, we partially automate the process of architecture design. / by Mihai Fonoage. / Thesis (Ph.D.)--Florida Atlantic University, 2010. / Includes bibliography. / Electronic reproduction. Boca Raton, Fla., 2010. Mode of access: World Wide Web.

The SSL/TLS is the main protocol used to provide secure data connection between a client and a server. The main concern of using this protocol is to avoid the secure connection from being breached. Computer systems and their applications are becoming more complex and keeping these secure connections between all the connected components is a challenge. To avoid any new security flaws and protocol connections weaknesses, the SSL/TLS protocol is always releasing newer versions after discovering security bugs and vulnerabilities in any of its previous version. We have described some of the common security flaws in the SSL/TLS protocol by identifying them in the literature and then by analyzing the activities from each of their use cases to find any possible threats. These threats are realized in the form of misuse cases to understand how an attack happens from the point of the attacker. This approach implies the development of some security patterns which will be added as a reference for designing secure systems using the SSL/TLS protocol. We finally evaluate its security level by using misuse patterns and considering the threat coverage of the models. / Includes bibliography. / Dissertation (Ph.D.)--Florida Atlantic University, 2017. / FAU Electronic Theses and Dissertations Collection

Orientador: Antonio Fernando Crepaldi / Banca: Rogério Andrade Flauzino / Banca: José de Souza Rodrigues / Resumo: As desordens e incertezas provocadas no decorrer do tempo, face à dinâmica das mudanças e a complexidade dos sistemas que abrangem as organizações, acarretam diversas situações em que os gestores necessitam encontrar soluções das quais seja possível extrair a maximização do resultado empresarial. Logo, o desenvolvimento de ferramentas que possam em dado momento apresentar, de forma ágil, um número mínimo de opções necessárias para investigar a incerteza é uma tarefa necessária em ambientes de negócios. Esta dissertação tem como objetivo a busca por uma solução para o problema do Sequenciamento Ótimo de Faturamento (SOF). A perspectiva adotada para a solução do SOF é o desenvolvimento de um software que automatize o processo de atribuição dos produtos aos pedidos em carteira, denominado como processo de picking. O trabalho emprega a Computação Evolucionária como método de adaptação ao problema e utiliza a técnica dos Algoritmos Genéticos (AG) na formulação do modelo de busca de soluções. A concepção do software dar-se-á pela interconexão de um conjunto de dados estáticos que contempla o estoque disponível para venda em um período pré-determinado de tempo t e a carteira de pedidos solicitados em diferentes datas. A representação binária é utilizada para formular a programação das estruturas heurísticas de possíveis soluções e o Visual Basic for Applications (VBA) do Microsoft Office Excel é empregado como ferramenta computacional para a implementação do modelo proposto. A programação considera as restrições e os parâmetros de decisão de forma que maximização do faturamento seja o resultado otimizado do problema. A implantação do software gera um módulo que automatiza o processo de picking e apresenta resultados otimizados para o SOF, o que... (Resumo completo, clicar acesso eletrônico abaixo) / Abstract: The disorders and uncertainties caused in the course of time, given the dynamics of change and systems complexity which include organizations, result in several situations in which managers need to find solutions which can extract the maximization of the enrrepreneurial outcome. Therefore, the development of tools that can, at a given time and in an agile way, present a minimum number of options necessary to investigate the uncertainties is a necessary task in business environments. This dissertations aims to search for a solution to the Optimal Sequencing Billing (OSB) problem. The perspective adopted for the solution of the OSB is the development of a software that automates the process of assining products to backlog, named as "picking process". The work employs the Evouluationary Computation as a method of adaptation to the problem and uses the technique of Genetic Algorithms (GA) in the formulation of the searching solutions model. The software design will come to be through the inerconnection of a set of static data which includes the stock available for sale at a predetermined period of time t and a backlog request on different dates. The binary representation is used to formulate the scheduling heristics structures of possible solutions and Visual Basic for Applications (VBA) in Microsoft Office Excel is a software tool used for the implementation of the proposed model. The program considers the constraints and decision parameters so that maximizing the billing is the result of optimized problem. The implementation of the softaware generates a module that automates the picking process and presents optimized results for the OSB, which provides agility and improves the decision making for billing. It was... (Complete abstract click electronic access below) / Mestre

Abstract not available

How might capabilities for algorithm animation be seamlessly integrated into a programming language that is both visual and declarative? Until now, visual programming language researchers have not attempted to answer that question, making the fruits of algorithm animation available only to users of textual programming languages. Users of visual programming languages (VPLs) have been deprived of the unique semantic insights algorithm animation offers, insights that would foster the understanding and debugging of visual programs. We have answered the question by seamlessly integrating algorithm animation capabilities into Forms/3, a general-purpose, declarative VPL. Our results show that such a VPL can support algorithm animation without leaving the declarative, visual model, without adding new concepts to the language or how to program in it, and without deviating from the uniform representation established for the language. In addition, our research shows that the characteristics of declarative VPLs result in some interesting algorithm animation features not found in other systems. / Graduation date: 1995

This paper seeks to describe the process by which a database-centric web application was redesigned and rewritten to take advantage of Apache’s Lucene - an open-source information retrieval software library written in the Java programming language. After the implementation of a Lucene-based text index of “semi-structured data”, a college radio station's card catalog application was able to deliver higher-quality search results in significantly less time than it was able to do using just a relational database alone. Additionally, the dramatic improvements in speed and performance even allowed the search results interface to be redesigned and enhanced with an improved pagination system and new features such as faceted search/filtering.

Reverse execution can be defined as a method which recovers the states that a program attains during its execution. Therefore, reverse execution eliminates the need for repetitive program restarts every time a bug location is missed. This potentially shortens debug time considerably. This thesis presents a new approach which, for the first time ever (to the best of the author's knowledge), achieves reverse execution at the assembly instruction level on general purpose processors via execution of a reverse program. A reverse program almost always regenerates destroyed states rather than restoring them from a record. Furthermore, a reverse program provides assembly instruction by assembly instruction execution in the backward direction. This significantly reduces state saving and thus decreases the associated memory and time costs of reverse execution support. Furthermore, this thesis presents a new dynamic slicing algorithm that is built on top of assembly instruction level reverse execution. Dynamic slicing is a technique which isolates the code parts that influence an erroneous variable at a program point. The algorithm presented in this thesis achieves dynamic slicing via execution of a reduced reverse program. A reduced reverse program is obtained from a full reverse program by omitting the instructions that recover states irrelevant to the dynamic slice under consideration. This provides a reverse execution capability along a designated dynamic slice only. The use of a reduced reverse program for dynamic slicing removes the need for runtime execution trajectories. The methodology of this thesis has been implemented on a PowerPC processor with a custom made debugger. As compared to previous work, all of which heavily use state saving techniques, the experimental results show up to 2206X reduction in runtime memory usage, up to 403X reduction in forward execution time overhead and up to 2.32X reduction in forward execution time for the tested benchmarks. Measurements on the selected benchmarks also indicate that the dynamic slicing method presented in this thesis can achieve up to six orders of magnitude (1,928,500X) speedups in reverse execution along the dynamic slice as compared to full-scale reverse execution.

M. Tech. Business Information Systems / This mini-dissertation explored the e-Skills expectation gap between academia and the software industry where there are high numbers of unemployed graduate in the face of ICT skills shortage. This study looked at the following factors: government participation in the industry, academia course offering, course design and processes, and individuals as e-Skill contributors to the software industry. The present study conceptualises a framework that may help bridge the gap between academia and the software industry. The study sought to analyse the ICT curriculum, student e-Skills and the software industry, in order to address the present e-Skills gap.

One of the main objectives of software development in scientific computing is efficiency. Being focused on highly specialized application domain, important software quality metrics, e.g., usability, extensibility ,etc may not be amongst the list of primary objectives. In this research, we have studied the design structures and iterative releases of scientific research software using Design Structure Matrix(DSM). We implemented a DSM partitioning algorithm using sparse matrix data structure Compressed Row Storage(CRS), and its timing was better than those obtained from the most widely used C++ library boost. Secondly, we computed several architectural complexity metrics, compared releases and total release costs of a number of open source scientific research software. One of the important finding is the absence of circular dependencies in studied software which attributes to the strong emphasis on computational performance of the code. Iterative release analysis indicates that there might be a correspondence between “clustering co-efficient” and “release rework cost” of the software. / x, 87 leaves : ill. ; 29 cm

No description available.