Context based service discovery for ubiquitous applications

Service discovery is vital in ubiquitous applications, where a large number of devices and software components collaborate unobtrusively and provide numerous services without user intervention. Existing service discovery schemes use a service matching process in order to offer services of interest to the users. Potentially, the context information of the users and surrounding environment can be used to improve the quality of service matching. To make use of context information in service matching, a service discovery technique needs to address certain challenges. Firstly, it is required that the context information shall have unambiguous representation. Secondly, the devices in the environment shall be able to disseminate high level and low level context information seamlessly in the different networks. And thirdly, dynamic nature of the context information be taken into account. We propose a C-IOB(Context-Information, Observation and Belief) based service discovery model which deals with the above challenges by processing the context information and by formulating the beliefs based on the observations. With these formulated beliefs the required services will be provided to the users. The method has been tested with a typical ubiquitous museum guide application over different cases. The simulation results are time efficient and quite encouraging.

Mini Forest - An experiment to evaluate the adaptability of Western Ghats species for afforestation

Saplings of forty nine species of trees from Western Ghats forests were planted on a 1.5 hectare tract of Deccan plateau (in the campus of Indian Institute of Science, Bangalore) and their performance monitored for 23 years. The objective was to evaluate their adaptability to a habitat and conditions apparently alien to these species. The study was also meant to understand the linkages of these trees with the surrounding environment. Contrary to the belief that tree species are very sensitive to change of location and conditions, the introduced trees have grown as good as they would do in their native habitat and maintained their phenology. Further, they have grown in perfect harmony with trees native to the location. The results show that the introduced species are opportunistic and readily acclimatized and grew well overcoming the need for the edaphic and other factors that are believed to be responsible for their endemicity. Besides ex situ conservation, the creation of miniforest has other accrued ecosystem benefits. For instance, the ground water level has risen and the ambient temperature has come down by two degrees.

Theory and Algorithms for Hop-Count-Based Localization with Random Geometric Graph Models of Dense Sensor Networks

Wireless sensor networks can often be viewed in terms of a uniform deployment of a large number of nodes in a region of Euclidean space. Following deployment, the nodes self-organize into a mesh topology with a key aspect being self-localization. Having obtained a mesh topology in a dense, homogeneous deployment, a frequently used approximation is to take the hop distance between nodes to be proportional to the Euclidean distance between them. In this work, we analyze this approximation through two complementary analyses. We assume that the mesh topology is a random geometric graph on the nodes; and that some nodes are designated as anchors with known locations. First, we obtain high probability bounds on the Euclidean distances of all nodes that are h hops away from a fixed anchor node. In the second analysis, we provide a heuristic argument that leads to a direct approximation for the density function of the Euclidean distance between two nodes that are separated by a hop distance h. This approximation is shown, through simulation, to very closely match the true density function. Localization algorithms that draw upon the preceding analyses are then proposed and shown to perform better than some of the well-known algorithms present in the literature. Belief-propagation-based message-passing is then used to further enhance the performance of the proposed localization algorithms. To our knowledge, this is the first usage of message-passing for hop-count-based self-localization.

A Two Stage Selective Averaging LDPC Decoding

Low density parity-check (LDPC) codes are a class of linear block codes that are decoded by running belief propagation (BP) algorithm or log-likelihood ratio belief propagation (LLR-BP) over the factor graph of the code. One of the disadvantages of LDPC codes is the onset of an error floor at high values of signal to noise ratio caused by trapping sets. In this paper, we propose a two stage decoder to deal with different types of trapping sets. Oscillating trapping sets are taken care by the first stage of the decoder and the elementary trapping sets are handled by the second stage of the decoder. Simulation results on the regular PEG (504,252,3,6) code and the irregular PEG (1024,518,15,8) code shows that the proposed two stage decoder performs significantly better than the standard decoder.

Context aware M-commerce services: C-IOB model approach

Context-aware computing is useful in providing individualized services focusing mainly on acquiring surrounding context of user. By comparison, only very little research has been completed in integrating context from different environments, despite of its usefulness in diverse applications such as healthcare, M-commerce and tourist guide applications. In particular, one of the most important criteria in providing personalized service in a highly dynamic environment and constantly changing user environment, is to develop a context model which aggregates context from different domains to infer context of an entity at the more abstract level. Hence, the purpose of this paper is to propose a context model based on cognitive aspects to relate contextual information that better captures the observation of certain worlds of interest for a more sophisticated context-aware service. We developed a C-IOB (Context-Information, Observation, Belief) conceptual model to analyze the context data from physical, system, application, and social domains to infer context at the more abstract level. The beliefs developed about an entity (person, place, things) are primitive in most theories of decision making so that applications can use these beliefs in addition to history of transaction for providing intelligent service. We enhance our proposed context model by further classifying context information into three categories: a well-defined, a qualitative and credible context information to make the system more realistic towards real world implementation. The proposed model is deployed to assist a M-commerce application. The simulation results show that the service selection and service delivery of the system are high compared to traditional system.

A hybrid RTS-BP algorithm for improved detection of large-MIMO M-QAM signals

Low-complexity near-optimal detection of large-MIMO signals has attracted recent research. Recently, we proposed a local neighborhood search algorithm, namely reactive tabu search (RTS) algorithm, as well as a factor-graph based belief propagation (BP) algorithm for low-complexity large-MIMO detection. The motivation for the present work arises from the following two observations on the above two algorithms: i) Although RTS achieved close to optimal performance for 4-QAM in large dimensions, significant performance improvement was still possible for higher-order QAM (e.g., 16-, 64-QAM). ii) BP also achieved near-optimal performance for large dimensions, but only for {±1} alphabet. In this paper, we improve the large-MIMO detection performance of higher-order QAM signals by using a hybrid algorithm that employs RTS and BP. In particular, motivated by the observation that when a detection error occurs at the RTS output, the least significant bits (LSB) of the symbols are mostly in error, we propose to first reconstruct and cancel the interference due to bits other than LSBs at the RTS output and feed the interference cancelled received signal to the BP algorithm to improve the reliability of the LSBs. The output of the BP is then fed back to RTS for the next iteration. Simulation results show that the proposed algorithm performs better than the RTS algorithm, and semi-definite relaxation (SDR) and Gaussian tree approximation (GTA) algorithms.

Performance improvement of short-length regular low-density parity-check codes with low-complexity post-processing

It is well known that extremely long low-density parity-check (LDPC) codes perform exceptionally well for error correction applications, short-length codes are preferable in practical applications. However, short-length LDPC codes suffer from performance degradation owing to graph-based impairments such as short cycles, trapping sets and stopping sets and so on in the bipartite graph of the LDPC matrix. In particular, performance degradation at moderate to high E-b/N-0 is caused by the oscillations in bit node a posteriori probabilities induced by short cycles and trapping sets in bipartite graphs. In this study, a computationally efficient algorithm is proposed to improve the performance of short-length LDPC codes at moderate to high E-b/N-0. This algorithm makes use of the information generated by the belief propagation (BP) algorithm in previous iterations before a decoding failure occurs. Using this information, a reliability-based estimation is performed on each bit node to supplement the BP algorithm. The proposed algorithm gives an appreciable coding gain as compared with BP decoding for LDPC codes of a code rate equal to or less than 1/2 rate coding. The coding gains are modest to significant in the case of optimised (for bipartite graph conditioning) regular LDPC codes, whereas the coding gains are huge in the case of unoptimised codes. Hence, this algorithm is useful for relaxing some stringent constraints on the graphical structure of the LDPC code and for developing hardware-friendly designs.

Superbubble breakout and galactic winds from disc galaxies

We study the conditions for disc galaxies to produce superbubbles that can break out of the disc and produce a galactic wind. We argue that the threshold surface density of supernovae rate for seeding a wind depends on the ability of superbubble energetics to compensate for radiative cooling. We first adapt Kompaneets formalism for expanding bubbles in a stratified medium to the case of continuous energy injection and include the effects of radiative cooling in the shell. With the help of hydrodynamic simulations, we then study the evolution of superbubbles evolving in stratified discs with typical disc parameters. We identify two crucial energy injection rates that differ in their effects, the corresponding breakout ranging from being gentle to a vigorous one. (a) Superbubbles that break out of the disc with a Mach number of the order of 2-3 correspond to an energy injection rate of the order of 10(-4) erg cm(-2) s(-1), which is relevant for disc galaxies with synchrotron emitting gas in the extra-planar regions. (b) A larger energy injection threshold, of the order of 10(-3) erg cm(-2) s(-1), or equivalently, a star formation surface density of similar to 0.1 M-circle dot yr(-1) kpc(-2), corresponds to superbubbles with a Mach number similar to 5-10. While the milder superbubbles can be produced by large OB associations, the latter kind requires super-starclusters. These derived conditions compare well with observations of disc galaxies with winds and the existence of multiphase halo gas. Furthermore, we find that contrary to the general belief that superbubbles fragment through Rayleigh-Taylor (RT) instability when they reach a vertical height of the order of the scaleheight, the superbubbles are first affected by thermal instability for typical disc parameters and that RT instability takes over when the shells reach a distance of approximately twice the scaleheight.

Does linear separability really matter? Complex visual search is explained by simple search

Visual search in real life involves complex displays with a target among multiple types of distracters, but in the laboratory, it is often tested using simple displays with identical distracters. Can complex search be understood in terms of simple searches? This link may not be straightforward if complex search has emergent properties. One such property is linear separability, whereby search is hard when a target cannot be separated from its distracters using a single linear boundary. However, evidence in favor of linear separability is based on testing stimulus configurations in an external parametric space that need not be related to their true perceptual representation. We therefore set out to assess whether linear separability influences complex search at all. Our null hypothesis was that complex search performance depends only on classical factors such as target-distracter similarity and distracter homogeneity, which we measured using simple searches. Across three experiments involving a variety of artificial and natural objects, differences between linearly separable and nonseparable searches were explained using target-distracter similarity and distracter heterogeneity. Further, simple searches accurately predicted complex search regardless of linear separability (r = 0.91). Our results show that complex search is explained by simple search, refuting the widely held belief that linear separability influences visual search.

Solid-solid collapse transition in a two dimensional model molecular system

Solid-solid collapse transition in open framework structures is ubiquitous in nature. The real difficulty in understanding detailed microscopic aspects of such transitions in molecular systems arises from the interplay between different energy and length scales involved in molecular systems, often mediated through a solvent. In this work we employ Monte-Carlo simulation to study the collapse transition in a model molecular system interacting via both isotropic as well as anisotropic interactions having different length and energy scales. The model we use is known as Mercedes-Benz (MB), which, for a specific set of parameters, sustains two solid phases: honeycomb and oblique. In order to study the temperature induced collapse transition, we start with a metastable honeycomb solid and induce transition by increasing temperature. High density oblique solid so formed has two characteristic length scales corresponding to isotropic and anisotropic parts of interaction potential. Contrary to the common belief and classical nucleation theory, interestingly, we find linear strip-like nucleating clusters having significantly different order and average coordination number than the bulk stable phase. In the early stage of growth, the cluster grows as a linear strip, followed by branched and ring-like strips. The geometry of growing cluster is a consequence of the delicate balance between two types of interactions, which enables the dominance of stabilizing energy over destabilizing surface energy. The nucleus of stable oblique phase is wetted by intermediate order particles, which minimizes the surface free energy. In the case of pressure induced transition at low temperature the collapsed state is a disordered solid. The disordered solid phase has diverse local quasi-stable structures along with oblique-solid like domains. (C) 2013 AIP Publishing LLC.

Socio-cultural protection of endemic trees in humanised landscape

Culturally protected forest patches or sacred groves have been the integral part of many traditional societies. This age old tradition is a classic instance of community driven nature conservation sheltering native biodiversity and supporting various ecosystem functions particularly hydrology. The current work in Central Western Ghats of Karnataka, India, highlights that even small sacred groves amidst humanised landscapes serve as tiny islands of biodiversity, especially of rare and endemic species. Temporal analysis of landuse dynamics reveals the changing pattern of the studied landscape. There is fast reduction of forest cover (15.14-11.02 %) in last 20 years to meet up the demand of agricultural land and plantation programs. A thorough survey and assessment of woody endemic species distribution in the 25 km(2) study area documented presence of 19 endemic species. The distribution of these species is highly skewed towards the culturally protected patches in comparison to other land use elements. It is found that, among the 19 woody endemic species, those with greater ecological amplitude are widely distributed in the studied landscape in groves as well as other land use forms whereas, natural population of the sensitive endemics are very much restricted in the sacred grove fragments. The recent degradation in the sacred grove system is perhaps, due to weakening of traditional belief systems and associated laxity in grove protection leading to biotic disturbances. Revitalisation of traditional practices related to conservation of sacred groves can go a long way in strengthening natural ecological systems of fragile humid tropical landscape.