Selective dissemination of XML documents using GAs and SVM

XML has emerged as a medium for interoperability over the Internet. As the number of documents published in the form of XML is increasing there is a need for selective dissemination of XML documents based on user interests. In the proposed technique, a combination of Self Adaptive Migration Model Genetic Algorithm (SAMCA)[5] and multi class Support Vector Machine (SVM) are used to learn a user model. Based on the feedback from the users the system automatically adapts to the user's preference and interests. The user model and a similarity metric are used for selective dissemination of a continuous stream of XML documents. Experimental evaluations performed over a wide range of XML documents indicate that the proposed approach significantly improves the performance of the selective dissemination task, with respect to accuracy and efficiency.

A Story about a Message that was a Story: Message Form and its Implications to Knowledge Flow

Knowledge Flow, my dear friend! I would like to introduce you to a close relative of yours: Organizational Communication. You might want to take a moment to hear what your newfound kin has to say. As bright as you are dear Flow, you're missing a piece of the puzzle - for one cannot study any aspect of an organization relating to communication without acknowledging the message. Without a message, communication does not exist. Organizational Communication has always appreciated this. Perhaps the time has come for you to join rank and do so too? The main point of this work is to prove that the form of a message considerably affects communication, interpretation - and knowledge flow. As stories are at the heart of this thesis; and entertaining, reader-friendly communication its main argument, the entire manuscript is written in story form and is intentionally breaking academic writing tradition as far as writing style goes. Each chapter reads as a story of sorts and put together they create a grand narrative of my journey as a PhD student, the research I have conducted and the outcomes of this work. Thus if a reader hopes to make any sense of this title, she must read it in the same way one would read a novel, from beginning to end. This is a thesis with three aspirations. First, it sets out to prove that knowledge flow cannot be studied without a message. Second, it moves on to give the reader a once-over of a much used message form: storytelling. After these two goals are tackled the path is clear to research if message form indeed is as essential as claimed. I do so through both a qualitative and a quantitative study. The former acted as both a stepping stone into the research area and as an inspirational pilot, from which the research design for the larger quantitative study was drawn. Together, these two studies answered my research question - and allowed me to fulfill the third, final and foremost aspiration of this study - bridging the gap between two separate fields of knowledge management: knowledge flow and storytelling.

Stability of scheduled message communication over degraded broadcast channels

We develop a multi-class discrete-time processor-sharing queueing model for scheduled message communication over a discrete memoryless degraded broadcast channel. The framework we consider here models both the random message arrivals and the subsequent reliable communication by suitably combining techniques from queueing theory and information theory. Requests for message transmissions are assumed to arrive according to i.i.d. arrival processes. Then, (i) we derive an outer bound to the stability region of message arrival rate vectors achievable by the class of stationary scheduling policies, (ii) we show for any message arrival rate vector that satisfies the outer bound, that there exists a stationary "state-independent" policy that results in a stable system for the corresponding message arrival processes, and (iii) under an asymptotic regime, we show that the stability region of information arrival rate vectors is the information-theoretic capacity region of a degraded broadcast channel.

Cell versus message level performances in ATM networks

The goal of this paper is to provide some insight into the relations that exist between cell level and message level performance guarantees in the context of ATM networks. Cell level guarantees are typically what the network is capable of providing, while message level guarantees are the ones of interest to users. It is, therefore, important to understand how the two are related, and which factors influence this relation. There are many different performance measures that are of importance, and in this paper we try to touch on the (three) most relevant ones. This includes comparing cell and message loss probabilities, average cell and message delays, and cell and message jitter. Specifically, we show that cell and message loss probabilities can exhibit significant differences, which strongly depend on traffic characteristics such as peak rate and burst size, i.e., for a fixed cell loss probability, the message loss probability can greatly vary when peak rate and burst size change. One reason for this sensitivity, is that message loss depends on what happen to all the cells in a message. For delay and jitter, we also find that peak rate and burst size play a role in determining the relation between cell and message performance. However, this sensitivity is not as acute as with losses since message delay and jitter are typically determined by the performance seen by only one cell, the last cell in a message. In the paper, we provide quantitative examples that illustrate the range of behaviors and identify the impact of different parameters.

Analysing Message Sequence Graph Specifications

We give a detailed construction of a finite-state transition system for a com-connected Message Sequence Graph. Though this result is well-known in the literature and forms the basis for the solution to several analysis and verification problems concerning MSG specifications, the constructions given in the literature are either not amenable to implementation, or imprecise, or simply incorrect. In contrast we give a detailed construction along with a proof of its correctness. Our transition system is amenable to implementation, and can also be used for a bounded analysis of general (not necessarily com-connected) MSG specifications.

Bayesian framework and message passing for joint support and signal recovery of approximately sparse signals

In this paper, we develop a low-complexity message passing algorithm for joint support and signal recovery of approximately sparse signals. The problem of recovery of strictly sparse signals from noisy measurements can be viewed as a problem of recovery of approximately sparse signals from noiseless measurements, making the approach applicable to strictly sparse signal recovery from noisy measurements. The support recovery embedded in the approach makes it suitable for recovery of signals with same sparsity profiles, as in the problem of multiple measurement vectors (MMV). Simulation results show that the proposed algorithm, termed as JSSR-MP (joint support and signal recovery via message passing) algorithm, achieves performance comparable to that of sparse Bayesian learning (M-SBL) algorithm in the literature, at one order less complexity compared to the M-SBL algorithm.

Channel Hardening-Exploiting Message Passing (CHEMP) Receiver in Large-Scale MIMO Systems

In this paper, we propose a multiple-input multiple-output (MIMO) receiver algorithm that exploits channel hardening that occurs in large MIMO channels. Channel hardening refers to the phenomenon where the off-diagonal terms of the matrix become increasingly weaker compared to the diagonal terms as the size of the channel gain matrix increases. Specifically, we propose a message passing detection (MPD) algorithm which works with the real-valued matched filtered received vector (whose signal term becomes, where is the transmitted vector), and uses a Gaussian approximation on the off-diagonal terms of the matrix. We also propose a simple estimation scheme which directly obtains an estimate of (instead of an estimate of), which is used as an effective channel estimate in the MPD algorithm. We refer to this receiver as the channel hardening-exploiting message passing (CHEMP) receiver. The proposed CHEMP receiver achieves very good performance in large-scaleMIMO systems (e.g., in systems with 16 to 128 uplink users and 128 base station antennas). For the considered large MIMO settings, the complexity of the proposed MPD algorithm is almost the same as or less than that of the minimum mean square error (MMSE) detection. This is because the MPD algorithm does not need a matrix inversion. It also achieves a significantly better performance compared to MMSE and other message passing detection algorithms using MMSE estimate of. Further, we design optimized irregular low density parity check (LDPC) codes specific to the considered large MIMO channel and the CHEMP receiver through EXIT chart matching. The LDPC codes thus obtained achieve improved coded bit error rate performance compared to off-the-shelf irregular LDPC codes.

A systems approach to characterise the dissemination process of household water treatment systems in developing countries

Abstract: Starting in the 1980s, household-level water treatment and safe storage systems (HWTS) have been developed as simple, local, user-friendly, and low cost options to improve drinking water quality at the point of use. However, despite conclusive evidence of the health and economic benefits of HWTS, and promotion efforts in over 50 countries in the past 20 years, implementation outcomes have been slow, reaching only 5-10 million regular users. This study attempts to understand the barriers and drivers affecting HWTS implementation. Although existing literature related to HWTS and innovation diffusion theories proposed ample critical factors and recommendations, there is a lack of holistic and systemic approach to integrate these findings. It is proposed that system dynamics modelling can be a promising tool to map the inter-relationships of different critical factors and to understand the structure of HWTS dissemination process, which may lead to identifying high impact, leveraged mitigation strategies to scale-up HWTS adoption and sustained use.

Genetic improvement and effective dissemination: keys to prosperous and sustainable aquaculture industries

There is an increasing demand for fish in the world due to a growing population, better economic situation in some sectors, and greater awareness of health issues in relation to food. Since capture fisheries have stagnated, fish farming has become a very fast growing food production system. In this presentation, the author gives an overview of the technologies that are available for genetic improvement of fish, and briefly discuss their merit in the context of a sustainable development. He also discusses the essential prerequisites for effective dissemination of improved stock to farmers. It is concluded that genetic improvement programs based on selective breeding can substantially contribute to sustainable fish production systems. Furthermore, if such genetic improvement programs are followed up with effective dissemination strategies, they can result in a positive impact on farmers' incomes.