[pt] Este trabalho tem como objetivo a aplicação de processos heurísticos no problema de minimização dos estados de uma máquina seqüencial incompleta. Foi desenvolvido um método heurístico e implementado num computador digital, na linguagem PL/I. o programa foi aplicado a vários exemplos encontrados na literatura sobre o assunto. É levantado o problema da avaliação dos processos heurísticos aplicados a minimização de máquinas seqüenciais incompletas. / [en] The application of heuristic techniques to the minimization of incompletely specified sequential machines is presented. An heuristic method was developed and implemented by a Pl/I program, ehich was applied to several examples found in the related literature. Finally it is mentioned the problem of evaluating heuristic processes applied to the minimization of incompletely specified sequential machine.

Maintenance management is a relevant issue in modern technical systems due to its financial, safety, and environmental implications. The need to rely on physical assets makes maintenance a necessary evil, which, on the other hand, allows achieving a high quality of end products, or services, and a safety level that is adequate for the regulatory requirements. The advent of the fourth industrial revolution offers meaningful opportunities to improve maintenance management; technologies such as Cyber-Physical Systems, the Internet of Things, and cloud computing enable realizing modern infrastructure to support decisions with advanced analytics. In this thesis, the optimization of maintenance policies is tackled in this renewed technological context. The research methods employed in this thesis include interviewing of subject experts, literature research, and numerical experiments. Mathematical modelling is used to model network effects in complex technical systems, and simulations are used to validate the proposed models and methodologies. The problem of maintenance policies comparison is addressed in one of the publications; using the proposed bi-objective analysis, an effective maintenance policy was identified. Maintenance of complex systems organized in a networked fashion is studied in another project, where maintenance costs and system performances are considered. The proposed model allowed to identify a set of non-dominated (in the Pareto sense) maintenance policies, and an efficient resolution procedure was developed. The possibility to use a digital twin to replicate a Cyber-Physical System for maintenance policies optimization is addressed in another publication. The main hurdles in realizing such a complex infrastructure are analyzed, and managerial implications are presented. Finally, following a qualitative research approach, the opportunities offered by additive manufacturing are identified and presented in a book chapter. The opportunities for both maintenance efficiency gains and new business models are identified and discussed.

Graph search is used in many areas of computer science. It is well-known that the scalability of graph-search algorithms such as A* is limited by their memory requirements. In this dissertation, I describe three complementary strategies for reducing the memory requirements of graph-search algorithms, especially for multiple sequence alignment (a central problem in computational molecular biology). These search strategies dramatically increase the range and difficulty of multiple sequence alignment problems that can be solved. The first strategy uses a divide-and-conquer method of solution reconstruction, and one of my contributions is to show that when divide-and-conquer solution reconstruction is used, a layer-by-layer strategy for multiple sequence alignment is more memory-efficient than a bestirst strategy. The second strategy is a new approach to duplicate detection in external-memory graph search that involves partitioning the search graph based on an abstraction of the state space. For graphs with sufficient local structure, it allows graph-search algorithms to use external memory, such as disk storage, almost as efficiently as internal memory. The third strategy is a technique for reducing the memory requirements of sub-alignment search heuristics that are stored in lookup tables. It uses the start and goal states of a problem instance to restrict the region of the state space for which a table-based heuristic is needed, making it possible to store more accurate heuristic estimates in the same amount of memory. These three strategies dramatically improve the scalability of graph search not only for multiple sequence alignment, but for many other graph-search problems, and generalizations of these search strategies for other graph-search problems are discussed throughout the dissertation.

No description available.

No description available.

No description available.

No description available.

No description available.

No description available.

No description available.