The problem of fault detection and location in modular tree structures are considered in this thesis. The fault set is restricted to stuck-at-faults in the discussion of the fault location problem. Short circuit faults and broken and short circuit faults are considered in the discussion of the fault detection problem. In either the fault detection or location case, detection conditions for each fault in a cell are derived. Tests for locating or detecting fault are designed based on providing those detection conditions to each cell in a tree. For fault detection, the more detection conditions provided by a test, the better the test is. The detection conditions provided by the detection test must be partitioned into single element blocks to locate faults. In this thesis, two algorithms in for fault detection and three for fault location in a combinational modular tree with n input variables are presented in detail. All the above results are directly modified for fault detection and location in modular trees which realize arbitrary definite machines. Since a pair of these tree structures can be connected to realize arbitrary sequential machines, the results derived here are useful in diagnosing sequential machines. / Master of Science

We study the supervisory control of supply chain operation modelled by (timed) State Tree Structures (STS). We model each agent involved in a supply chain using holons. Three operational models, make-to-order, make-to-stock, and assemble-to-order are considered. A strong assumption on the original STS theory is weakened to allow events shared among agents to be located at different levels. A supervisor is synthesized for the example of a mattress supply chain with make-to-stock operation under certain specifications. Moreover, a new version of the Timed STS framework is developed to allow events to have an upper time bound i.e. deadline. With Timed STS framework, more specifications requiring time measurement can be modeled and a supervisory control is synthesized for the timed model of a supply chain. For a nonempty supervisory synthesis result, the maximum time for the inventory periodic review rate, and the minimum cycle time for customer order satisfaction are achieved.

We study the supervisory control of supply chain operation modelled by (timed) State Tree Structures (STS). We model each agent involved in a supply chain using holons. Three operational models, make-to-order, make-to-stock, and assemble-to-order are considered. A strong assumption on the original STS theory is weakened to allow events shared among agents to be located at different levels. A supervisor is synthesized for the example of a mattress supply chain with make-to-stock operation under certain specifications. Moreover, a new version of the Timed STS framework is developed to allow events to have an upper time bound i.e. deadline. With Timed STS framework, more specifications requiring time measurement can be modeled and a supervisory control is synthesized for the timed model of a supply chain. For a nonempty supervisory synthesis result, the maximum time for the inventory periodic review rate, and the minimum cycle time for customer order satisfaction are achieved.

<p>This paper describes the design, implementation and evaluation of HyperSALmon, a Java™ open source prototype for visualizing service models in telecommunication networks. For efficient browsing and graphical monitoring of service models using SALmon, a service modeling language and a monitoring engine (Leijon et al., 2008), some kind of interactive GUI that implements a visualization of the service model is desired. This is what HyperSALmon is intended to do. The prototype has been designed in accordance with suggestions derived from a current research report of visualization techniques (Sehlstedt, 2008) appropriate for displaying service model data. In addition to these suggestions domain experts at Data Ductus Nord AB has expressed an urge for implementation of further features, some of their suggestions are deduced from research documents (Leijon et al., 2008; Wallin and Leijon, 2007, 2006), while others have been stated orally in direct relation to the prototype implementation work. The main visualization proposal is to use tree structures. Thus, both traditional tree structures and hyperbolic tree structures have been utilized, where the main navigation is set to occur in the hyperbolic tree view. In order to contribute further to this report I provide a discussion addressing problems related to the context of implementing a prototype for service model visualization using open source frameworks that meets the requirements set by the service model network architecture, the domain experts and the suggestions in the research report (Sehlstedt, 2008,page 51-52). Finally, I will present drawn conclusions of the attempted prototype implementation, illustrating potential strengths and weaknesses and consequently introduce suggestions for possible improvement and further development.</p>

<p>NestStep is a collection of parallel extensions to existing programming languages. These extensions supports a shared memory model and nested parallelism. NestStep is based the Bulk-Synchronous Programming model. Most of the communication of data in NestStep takes place in a</p><p>combine/commit phase, which is essentially a reduction followed by a broadcast.</p><p>The primary aim of the project that this thesis is based on was to develop a runtime system for NestStep-C, the extensions for the C programming language. The secondary aim was to find which tree structure among a selected few is the best for communicating data in the combine/commit phase.</p><p>This thesis includes information about NestStep, how to interface with the NestStep runtime system, some example applications and benchmarks for determining the best tree structure. A binomial tree structure and trees similar to it was empirically found to yield the best performance.</p>

Το θέμα της παρούσας διπλωματικής εργασίας είναι η ανάκτηση πληροφορίας από δενδρικές δομές που εμφανίζονται σε ιατρικές εικόνες. Η διάγνωση με την βοήθεια ηλεκτρονικών υπολογιστών είναι ένας ευρέως αναπτυσσόμενος κλάδος της πληροφορικής καθώς υποβοηθά το ιατρικό έργο. Συχνά στην ιατρική απαιτείται αξιολόγηση δεδομένων που προκύπτουν από εικόνες (π.χ. απλή ακτινογραφία, αξονική τομογραφία). Οι ιατρικές αυτές εικόνες παρουσιάζουν τη μορφολογία διαφόρων οργάνων του ανθρώπινου σώματος. Ο σκοπός της παρούσας διπλωματικής εργασίας είναι η ανάλυση ιατρικών εικόνων με τη βοήθεια προγραμμάτων που κατασκευάζουμε προκειμένου να αυτοματοποιηθεί η διαδικασία της διάγνωσης. Οι ιατρικές εικόνες τις οποίες μελετάμε απεικονίζουν δενδρικές δομές από ιστούς του ανθρώπινου σώματος. Πιο συγκεκριμένα, γίνεται προσπάθεια να εντοπιστούν εκείνα τα χαρακτηριστικά των δενδρικών δομών που συμβάλλουν με ακρίβεια στη διάγνωση του ασθενούς. Παλιότερες εργασίες έχουν αποδείξει ότι η ανάλυση της μορφολογίας αυτών των δενδρικών δομών μπορεί να χρησιμοποιηθεί για την εξόρυξη περιγραφικών χαρακτηριστικών που διακρίνουν τους ασθενείς από τους μη ασθενείς. Αυτοματοποιημένες τεχνικές ανάλυσης των εικόνων αυτών έχουν ήδη χρησιμοποιηθεί για την ανίχνευση πρώιμων σταδίων όγκων του εγκεφάλου, καρκίνου του μαστού και τρισδιάστατη ανάλυση της μορφολογίας των αεραγωγών στον πνεύμονα. Η μέθοδός μας προσπαθεί να βελτιώσει τα αποτελέσματα από προηγούμενες μεθόδους αναλύοντας την εικόνα, ώστε να μοντελοποιηθεί η δενδρική δομή που υπάρχει. Με βάση τη δενδρική δομή λαμβάνονται μετρήσεις αρκετών παραμέτρων, όπως το πλήθος των διακλαδώσεων, η χωρική πυκνότητα των διακλαδώσεων (ανάλυση Sholl) και ο δείκτης ασυμμετρίας. Βάσει των παραπάνω μετρήσεων, γίνεται κατηγοριοποίηση των εξεταζόμενων ασθενών σε δύο κλάσεις (ασθενείς με ευρήματα και ασθενείς χωρίς ευρήματα). Τέλος, γίνεται αξιολόγηση της προτεινόμενης μεθόδου με κριτήρια την ευαισθησία και ειδικότητά της σχετικά με τον εντοπισμό ευρημάτων. Η έρευνά μας μπορεί να βρει εφαρμογές στην ανίχνευση ευρημάτων που οδηγούν σε καρκίνο του στήθους. Στην περίπτωση αυτή οι ιατρικές εικόνες που εξετάζονται είναι γαλακτογραφίες (είδος ακτινογραφίας που χρησιμοποιείται κατά την εξέταση του στήθους). Επίσης, μπορεί να εφαρμοστεί στις δενδρικές δομές που υπάρχουν στο πυελοκαλυκικό σύστημα των νεφρών. Καταλήγοντας, η μέθοδος αυτή μπορεί να χρησιμοποιηθεί στη σύγκριση και την κατηγοριοποίηση ιστών ή τμημάτων του ανθρωπίνου σώματος που αποτελούνται από δενδρικές δομές. / -

It is well known that the optimal nonblocking supervisory control problem of timed discrete event systems is NP-hard, subject in particular to state space explosion that is exponential in the number of system components. In this thesis, we propose to manage complexity by organizing the system as a Timed State Tree Structure (TSTS). TSTS are an adaptation of STS to timed Supervisory Control Theory (SCT). Based on TSTS we present an e±cient recursive symbolic algorithm that can perform nonblocking supervisory control design for systems of state size 10^12 and higher. Failure diagnosis is the process of detecting and identifying deviations of a system from its normal behavior using the information available through sensors. A method for fault diagnosis of the TSTS model is proposed. A state based diagnoser is constructed for each timed holon of TSTS. Fault diagnosis is accomplished using the state estimates provided by the timed holon diagnosers. The diagnosers may communicate among each other in order to update their state estimates. At any given time, only a subset of the diagnosers are operational, and as a result, instead of the entire model of the system, only the models of the timed holons associated with the operational diagnosers are used. It is shown that the computational complexity of constructing and storing the transition systems required for diagnosis in the proposed approach is polynomial in the number of system components, whereas in the original monolithic approach the computational complexity is exponential.

It is well known that the optimal nonblocking supervisory control problem of timed discrete event systems is NP-hard, subject in particular to state space explosion that is exponential in the number of system components. In this thesis, we propose to manage complexity by organizing the system as a Timed State Tree Structure (TSTS). TSTS are an adaptation of STS to timed Supervisory Control Theory (SCT). Based on TSTS we present an e±cient recursive symbolic algorithm that can perform nonblocking supervisory control design for systems of state size 10^12 and higher. Failure diagnosis is the process of detecting and identifying deviations of a system from its normal behavior using the information available through sensors. A method for fault diagnosis of the TSTS model is proposed. A state based diagnoser is constructed for each timed holon of TSTS. Fault diagnosis is accomplished using the state estimates provided by the timed holon diagnosers. The diagnosers may communicate among each other in order to update their state estimates. At any given time, only a subset of the diagnosers are operational, and as a result, instead of the entire model of the system, only the models of the timed holons associated with the operational diagnosers are used. It is shown that the computational complexity of constructing and storing the transition systems required for diagnosis in the proposed approach is polynomial in the number of system components, whereas in the original monolithic approach the computational complexity is exponential.

NestStep is a collection of parallel extensions to existing programming languages. These extensions supports a shared memory model and nested parallelism. NestStep is based the Bulk-Synchronous Programming model. Most of the communication of data in NestStep takes place in a combine/commit phase, which is essentially a reduction followed by a broadcast. The primary aim of the project that this thesis is based on was to develop a runtime system for NestStep-C, the extensions for the C programming language. The secondary aim was to find which tree structure among a selected few is the best for communicating data in the combine/commit phase. This thesis includes information about NestStep, how to interface with the NestStep runtime system, some example applications and benchmarks for determining the best tree structure. A binomial tree structure and trees similar to it was empirically found to yield the best performance.

This paper describes the design, implementation and evaluation of HyperSALmon, a Java™ open source prototype for visualizing service models in telecommunication networks. For efficient browsing and graphical monitoring of service models using SALmon, a service modeling language and a monitoring engine (Leijon et al., 2008), some kind of interactive GUI that implements a visualization of the service model is desired. This is what HyperSALmon is intended to do. The prototype has been designed in accordance with suggestions derived from a current research report of visualization techniques (Sehlstedt, 2008) appropriate for displaying service model data. In addition to these suggestions domain experts at Data Ductus Nord AB has expressed an urge for implementation of further features, some of their suggestions are deduced from research documents (Leijon et al., 2008; Wallin and Leijon, 2007, 2006), while others have been stated orally in direct relation to the prototype implementation work. The main visualization proposal is to use tree structures. Thus, both traditional tree structures and hyperbolic tree structures have been utilized, where the main navigation is set to occur in the hyperbolic tree view. In order to contribute further to this report I provide a discussion addressing problems related to the context of implementing a prototype for service model visualization using open source frameworks that meets the requirements set by the service model network architecture, the domain experts and the suggestions in the research report (Sehlstedt, 2008,page 51-52). Finally, I will present drawn conclusions of the attempted prototype implementation, illustrating potential strengths and weaknesses and consequently introduce suggestions for possible improvement and further development.