Thesis (M.S.)--University of Wisconsin--Madison, 1965. / eContent provider-neutral record in process. Description based on print version record. Bibliography: 1 l. at end.

Thesis (Ph. D.)--University of Wisconsin--Madison, 1982. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 112-115).

Dimitri P. Bertsekas, Bob Gendron, Wei K. Tsai. / Bibliography: p. 17-18. / "February 1984" / "NSF-ECS-8217668" "ONR/N00014-75-C-1183"

Thesis (M.S.)--University of Delaware, 2009. / Principal faculty advisor: Xiaoming Li, Dept. of Electrical & Computer Engineering. Includes bibliographical references.

Ant colony optimisation (ACO) is a metaheuristic to solve optimisation problems inspired by the foraging behaviour of ant colonies. It has been successfully applied to several types of optimisation problems, such as scheduling and routing, and more recently for the discovery of classification rules. The classification task in data mining aims at predicting the value of a given goal attribute for an example, based on the values of a set of predictor attributes for that example. Since real-world classification problems are generally described by nominal (categorical or discrete) and continuous (real-valued) attributes, classification algorithms are required to be able to cope with both nominal and continuous attributes. Current ACO classification algorithms have been designed with the limitation of discovering rules using nominal attributes describing the data. Furthermore, they also have the limitation of not coping with more complex types of classification problems e.g., hierarchical multi-label classification problems. This thesis investigates the extension of ACO classification algorithms to cope with the aforementioned limitations. Firstly, a method is proposed to extend the rule construction process of ACO classification algorithms to cope with continuous attributes directly. Four new ACO classification algorithms are presented, as well as a comparison between them and well-known classification algorithms from the literature. Secondly, an ACO classification algorithm for the hierarchical problem of protein function prediction which is a major type of bioinformatics problem addressed in this thesis is presented. Finally, three different approaches to extend ACO classification algorithms to the more complex case of hierarchical multi-label classification are described, elaborating on the ideas of the proposed hierarchical classification ACO algorithm. These algorithms are compare against state-of-the-art decision tree induction algorithms for hierarchical multi-label classification in the context of protein function prediction. The computational results of experiments with a wide range of data sets including challenging protein function prediction data sets with very large number.

No description available.

No description available.

Distributed computing systems, with a high degree of interaction, cooperation, and sharing of resources between large numbers of computing elements, are becoming critical to the working of many enterprises. The evolution of services and networks along with the development of interorganisational, distributed applications require distributed management techniques, systems and tools. Different platforms are currently available to assist the development of distributed applications, hiding the underlying diversity and physical distribution of different computers, operating systems and network protocols. However, they supply neither facilities for automatic management of the support services they provide to application developers nor of the applications themselves. A random allocation of software components to nodes and the lack of resource management policies may lead to poor performance by having some nodes overloaded while others are idle. This thesis proposes an approach to distributed systems management, addressing in particular the distribution of the workload submitted to a distributed system by its users. A management architecture based on the ODP Reference Model and the OSI Management Model is presented. Distributed System managers, each responsible for a management domain, and Node Managers interact to allocate services to suitable nodes, considering the services requirements and the resources available. A prototype implementation is described which demonstrates how the concepts and mechanisms that form the architecture can be realised. This, together with a qualitative evaluation, shows the benefits of incorporating this management approach in a distributed environment: service creation and distribution, as well as resource management, is made transparent to platform users; the workload submitted to the system is automatically distributed; and services are provided with the requirements they need.

Formal methods for the specification and development of distributed systems have traditionally supported a top-down, linear development process. However, there is a growing awareness in the (distributed) software engineering community that, in addition to a `vertical' structuring into design phases and steps, the specification and development of complex systems should also be structured `horizontally' according to, so called, viewpoints. Such multi-viewpoint development methods raise two important new issues though, viz. consistency and composition of viewpoint specifications. The aim of this thesis is to provide formal techniques to support multi-viewpoint specification and development. In particular, it deals with process algebraic techniques for viewpoint specification, consistency checking and viewpoint composition. An important issue is the formal definition of consistency, in particular when different viewpoints are expressed using different specification techniques -- a situation that is referred to as unbalanced (as opposed to balanced) consistency. To this end, a mathematical framework for formal, viewpoint oriented system development is elaborated by abstracting from specific viewpoint models and specific formal techniques. A number of existing process algebraic specification techniques based on, so called, implementation relations, are investigated on their suitability for viewpoint specification. The thesis contains a comprehensive study of all possible binary consistency relations between specifications in these techniques, resulting in a spectrum of consistency relations. It also provides techniques for composition in these specification techniques. In addition, a new mixed term specification technique is developed that combines the expressiveness of modal logics with the structuring capabilities of process calculi. Consistency and composition turn out to have precisely the desired properties, which makes it an ideal formalism for partial process specification. Moreover, because of its expressiveness, it can serve as a pivotal formalism for unbalanced consistency checking.

No description available.