An Accurate Model For Interference From Spatially Distributed Shadowed Users in CDMA Uplinks

A detailed characterization of interference power statistics in CDMA systems is of considerable practical and theoretical interest. Such a characterization for uplink inter-cell interference has been difficult because of transmit power control, randomness in the number of interfering mobile stations, and randomness in their locations. We develop a new method to model the uplink inter-cell interference power as a lognormal distribution, and show that it is an order of magnitude more accurate than the conventional Gaussian approximation even when the average number of mobile stations per cell is relatively large and even outperforms the moment-matched lognormal approximation considered in the literature. The proposed method determines the lognormal parameters by matching its moment generating function with a new approximation of the moment generating function for the inter-cell interference. The method is tractable and exploits the elegant spatial Poisson process theory. Using several numerical examples, the accuracy of the proposed method in modeling the probability distribution of inter-cell interference is verified for both small and large values of interference.

Distributed nonlinear optimization algorithms for general network problems

There are a number of large networks which occur in many problems dealing with the flow of power, communication signals, water, gas, transportable goods, etc. Both design and planning of these networks involve optimization problems. The first part of this paper introduces the common characteristics of a nonlinear network (the network may be linear, the objective function may be non linear, or both may be nonlinear). The second part develops a mathematical model trying to put together some important constraints based on the abstraction for a general network. The third part deals with solution procedures; it converts the network to a matrix based system of equations, gives the characteristics of the matrix and suggests two solution procedures, one of them being a new one. The fourth part handles spatially distributed networks and evolves a number of decomposition techniques so that we can solve the problem with the help of a distributed computer system. Algorithms for parallel processors and spatially distributed systems have been described.There are a number of common features that pertain to networks. A network consists of a set of nodes and arcs. In addition at every node, there is a possibility of an input (like power, water, message, goods etc) or an output or none. Normally, the network equations describe the flows amoungst nodes through the arcs. These network equations couple variables associated with nodes. Invariably, variables pertaining to arcs are constants; the result required will be flows through the arcs. To solve the normal base problem, we are given input flows at nodes, output flows at nodes and certain physical constraints on other variables at nodes and we should find out the flows through the network (variables at nodes will be referred to as across variables).The optimization problem involves in selecting inputs at nodes so as to optimise an objective function; the objective may be a cost function based on the inputs to be minimised or a loss function or an efficiency function. The above mathematical model can be solved using Lagrange Multiplier technique since the equalities are strong compared to inequalities. The Lagrange multiplier technique divides the solution procedure into two stages per iteration. Stage one calculates the problem variables % and stage two the multipliers lambda. It is shown that the Jacobian matrix used in stage one (for solving a nonlinear system of necessary conditions) occurs in the stage two also.A second solution procedure has also been imbedded into the first one. This is called total residue approach. It changes the equality constraints so that we can get faster convergence of the iterations.Both solution procedures are found to coverge in 3 to 7 iterations for a sample network.The availability of distributed computer systems — both LAN and WAN — suggest the need for algorithms to solve the optimization problems. Two types of algorithms have been proposed — one based on the physics of the network and the other on the property of the Jacobian matrix. Three algorithms have been deviced, one of them for the local area case. These algorithms are called as regional distributed algorithm, hierarchical regional distributed algorithm (both using the physics properties of the network), and locally distributed algorithm (a multiprocessor based approach with a local area network configuration). The approach used was to define an algorithm that is faster and uses minimum communications. These algorithms are found to converge at the same rate as the non distributed (unitary) case.

Optimization of sample preparation for next-generation sequencing with Illumina Genome Analyzer II

The growing interest for sequencing with higher throughput in the last decade has led to the development of new sequencing applications. This thesis concentrates on optimizing DNA library preparation for Illumina Genome Analyzer II sequencer. The library preparation steps that were optimized include fragmentation, PCR purification and quantification. DNA fragmentation was performed with focused sonication in different concentrations and durations. Two column based PCR purification method, gel matrix method and magnetic bead based method were compared. Quantitative PCR and gel electrophoresis in a chip were compared for DNA quantification. The magnetic bead purification was found to be the most efficient and flexible purification method. The fragmentation protocol was changed to produce longer fragments to be compatible with longer sequencing reads. Quantitative PCR correlates better with the cluster number and should thus be considered to be the default quantification method for sequencing. As a result of this study more data have been acquired from sequencing with lower costs and troubleshooting has become easier as qualification steps have been added to the protocol. New sequencing instruments and applications will create a demand for further optimizations in future.

Generation of a Manganese Specific Restriction Endonuclease with Nicking Activity

A typical feature of type II restriction endonucleases (REases) is their obligate sequence specificity and requirement for Mg2+ during catalysis. R.KpnI is an exception. Unlike most other type II REases, the active site of this enzyme can accommodate Mg2+, Mn2+, Ca2+, or Zn2+ and cleave DNA. The enzyme belongs to the HNH superfamily of nucleases and is characterized by the presence of a beta beta alpha-Me finger motif. Residues D148, H149, and Q175 together form the HNH active site and are essential for Mg2+ binding and catalysis. The unique ability of the enzyme to cleave DNA in the presence of different metal ions is exploited to generate mutants that are specific to one particular metal ion. We describe the generation of a Mn2+-dependent sequence specific endonuclease, defective in DNA cleavage with Mg2+ and other divalent metal ions. In the engineered mutant, only Mn2+ is selectively bound at the active site, imparting Mn2+-mediated cleavage. The mutant is impaired in concerted double-stranded DNA cleavage, leading to accumulation of nicked intermediates. The nicking activity of the mutant enzyme is further enhanced by altered reaction conditions. The active site fluidity of R Eases allowing flexible accommodation of catalytic cofactors thus forms a basis for engineering selective metal ion-dependent REase additionally possessing nicking activity.

Regenerating Codes for Distributed Storage Networks

In a storage system where individual storage nodes are prone to failure, the redundant storage of data in a distributed manner across multiple nodes is a must to ensure reliability. Reed-Solomon codes possess the reconstruction property under which the stored data can be recovered by connecting to any k of the n nodes in the network across which data is dispersed. This property can be shown to lead to vastly improved network reliability over simple replication schemes. Also of interest in such storage systems is the minimization of the repair bandwidth, i.e., the amount of data needed to be downloaded from the network in order to repair a single failed node. Reed-Solomon codes perform poorly here as they require the entire data to be downloaded. Regenerating codes are a new class of codes which minimize the repair bandwidth while retaining the reconstruction property. This paper provides an overview of regenerating codes including a discussion on the explicit construction of optimum codes.

Exact bounds for distributed graph colouring

A distributed system is a collection of networked autonomous processing units which must work in a cooperative manner. Currently, large-scale distributed systems, such as various telecommunication and computer networks, are abundant and used in a multitude of tasks. The field of distributed computing studies what can be computed efficiently in such systems. Distributed systems are usually modelled as graphs where nodes represent the processors and edges denote communication links between processors. This thesis concentrates on the computational complexity of the distributed graph colouring problem. The objective of the graph colouring problem is to assign a colour to each node in such a way that no two nodes connected by an edge share the same colour. In particular, it is often desirable to use only a small number of colours. This task is a fundamental symmetry-breaking primitive in various distributed algorithms. A graph that has been coloured in this manner using at most k different colours is said to be k-coloured. This work examines the synchronous message-passing model of distributed computation: every node runs the same algorithm, and the system operates in discrete synchronous communication rounds. During each round, a node can communicate with its neighbours and perform local computation. In this model, the time complexity of a problem is the number of synchronous communication rounds required to solve the problem. It is known that 3-colouring any k-coloured directed cycle requires at least ½(log* k - 3) communication rounds and is possible in ½(log* k + 7) communication rounds for all k ≥ 3. This work shows that for any k ≥ 3, colouring a k-coloured directed cycle with at most three colours is possible in ½(log* k + 3) rounds. In contrast, it is also shown that for some values of k, colouring a directed cycle with at most three colours requires at least ½(log* k + 1) communication rounds. Furthermore, in the case of directed rooted trees, reducing a k-colouring into a 3-colouring requires at least log* k + 1 rounds for some k and possible in log* k + 3 rounds for all k ≥ 3. The new positive and negative results are derived using computational methods, as the existence of distributed colouring algorithms corresponds to the colourability of so-called neighbourhood graphs. The colourability of these graphs is analysed using Boolean satisfiability (SAT) solvers. Finally, this thesis shows that similar methods are applicable in capturing the existence of distributed algorithms for other graph problems, such as the maximal matching problem.

Tsoi Yuen Resistance and Post-80s Generation: A new wave of domestic social movement

Hong Kong was once a British colony and has been under the sovereignty of People’s Republic of China (PRC) since 1997. However, some of the unjust practices and colonial legacies are infiltrated into the development ideology as well as the social structures. The construction of intercity express railway project announced in 2008 causing the demolishment of Tsoi Yuen Tsuen, a “non-indigenous” agricultural village in Hong Kong, was one of the current examples. Tsoi Yuen village was established under the former colonial sovereignty sixty years ago. Approximately 450 populations were affected that they had to relocate their homeland involuntarily. However, these villagers were very attached to their homelands and were unwilling to move, and meanwhile they found that they were absent in the government’s consultation and decision-making process. Soon they began their resistance and demanded for “No Move! No Demolish!”. Their movement was strongly supported by a group of “Post-80s generation” and turned into the most important social movement of the city in recent years. In fact, demolition of Tsoi Yuen Village for city development is not an isolated case in the city. Meanwhile the situation is getting worse in Mainland China. I chose the case study of Tsoi Yuen Resistance from 2008 to 2011 for revelation of the complicated colonial history and postcolonial era of Hong Kong. I focused on discussing the Tsoi Yuen Resistance and the Post-80s movement, and how they have exposed the tension between top-down urban planning and development and public movements fighting for a more democratic process in choosing their way of living. Through the study of a village movement which as well as the rationale behind the Post-80s’ support, I hoped to illustrate how this movement has awaken a different sense of living for the new generations in the midst of the high-sounding urban development. It is an opportunity to examine Hong Kong’s colonial epoch in a different perspective: through studying the Tsoi Yuen Village, let them (subalterns) speak for themselves. Furthermore, the significance of this resistance, taking place eleven years after the handover to the PRC, is an important fact that I shall not miss in later discussion. Last but not least, during the resistance, advanced technology and social networks such as Facebook, Twitter, iPhone were used by Post 80s generation to spread the latest information in order to attract public’s concern and participation. Therefore, apart from studying Tsoi Yuen Resistance as a local social movement, I also regard it as a part of the global movement in perusing ecological lifestyle and civil society. How Post 80s’ generation manipulates the global idea in a local context will also be examined.

Directing role of functional groups in selective generation of C-H center dot center dot center dot pi interactions: In situ cryo-crystallographic studies on benzyl derivatives

The in situ cryo-crystallization study of benzyl derivatives reveals that the molecular packing in these compounds is either through methylene (sp(3)) C-H center dot center dot center dot pi or aromatic (sp(2)) C-H center dot center dot center dot pi interactions depending on the level of acidity of the benzyl proton. These studies of low melting compounds bring out the subtle features of such weak interactions and point to the directional preferences depending on the nature (electron withdrawing, polarizability) of the neighbouring functional group.