Lévy flight artificial bee colony algorithm

Artificial bee colony (ABC) optimisation algorithm is a relatively simple and recent population-based probabilistic approach for global optimisation. The solution search equation of ABC is significantly influenced by a random quantity which helps in exploration at the cost of exploitation of the search space. In the ABC, there is a high chance to skip the true solution due to its large step sizes. In order to balance between diversity and convergence in the ABC, a Lévy flight inspired search strategy is proposed and integrated with ABC. The proposed strategy is named as Lévy Flight ABC (LFABC) has both the local and global search capability simultaneously and can be achieved by tuning the Lévy flight parameters and thus automatically tuning the step sizes. In the LFABC, new solutions are generated around the best solution and it helps to enhance the exploitation capability of ABC. Furthermore, to improve the exploration capability, the numbers of scout bees are increased. The experiments on 20 test problems of different complexities and five real-world engineering optimisation problems show that the proposed strategy outperforms the basic ABC and recent variants of ABC, namely, Gbest-guided ABC, best-so-far ABC and modified ABC in most of the experiments.     

Classification of patterns representing Apples and Oranges in three-qubit system

The study of the classification of Apples and Oranges in a warehouse has been undertaken in a three-qubit system using the method of repeated iterations in Grover’s algorithm and Ventura’s algorithm separately. Operator describing an inversion about average has been constructed as a square matrix of order eight, the phase inversion operators and corresponding iteration operators for patterns separately representing Apples and Oranges have been derived, and various possible superpositions as the choice for search states for the classification of these patterns have been obtained for starting states consisting of two patterns and a single pattern, respectively. It has been demonstrated that on the second iteration of the exclusion superposition by the corresponding iteration operators, the patterns Apples and Oranges, respectively, are most suitably classified using the Grover’s algorithm. The probabilities of classifications of Apples have also been calculated by using Ventura’s algorithm (Ventura and Martinez in Inf Sci 124:273–296, 2000; Found Phys Lett 12:547–559, 1999) for all the possible superpositions as the search states, and the results have been compared with those of Grover’s algorithm and it has been demonstrated that in general for classification of a given pattern (Apples) in three-qubit system, the Grover’s and Ventura’s algorithms are effective in the cases where the number of patterns in the stored database is larger or smaller, respectively.     

Semantic web reasoners and languages

Semantic web reasoners and languages enable the semantic web to function. Some of the latest reasoning models developed in the last few years are: DLP, FaCT, RACER, Pellet, MSPASS, CEL, Cerebra Engine, QuOnto, KAON2, HermiT and others. Some software tools such as Protégé, Jena and others also have been developed, which provide inferencing as well as ontology development and management environments. These reasoners usually differ in their inference procedures, supporting logic, completeness of reasoning, expressiveness and implementation languages. Various semantic web languages with increasing expressive power continue to be developed for describing web services. We survey the some of the more recent languages like OWL-S (Ontology Web Language-Schema), WSML (Web Service Modeling Language), SWRL (Semantic Web Rule Language) and others that have been tested in early use. We also survey semantic web reasoners and their relationship to these languages.     

Dataflow Architectures for GALS

In Kahn process network (KPN), the processes (nodes) communicate by unbounded unidirectional FIFO channels (arcs), with the property of non-blocking writes and blocking reads on the channels. KPN provides a semantic model of computation, where a computation can be expressed as a set of asynchronously communicating processes. However, the unbounded FIFO based asynchrony is not realizable in practice and hence requires refinement in real hardware. In this work, we start with KPN as the model of computation for GALS, and discuss how different GALS architectures can be realized. We borrow some ideas from existing dataflow architectures for our GALS designs.     

High performance mobility without agent infrastructure for connection oriented service

Currently it is very difficult for connection oriented applications to use a mobile environment. One reason is that Mobile IP requires intermediate software agents to be deployed in the Internet. This infrastructure based mobility scheme offers connectivity to itinerant hosts but incurs significant handoff and tunneling delays along with deployment costs. These delays are particularly harmful for connection oriented applications. In this paper we investigate an alternate mobility scheme which does not require any such infrastructure but only uses an end-point technique and interestingly provides much faster loss-free handoff for connection oriented applications. This End-to-End scheme named Interactive Protocol for Mobile Networks (IPMN) intelligently performs handoff based on information provided by MAC Layer. The network address change is handled by renewing the existing connections by manipulating the TCP/IP stack at the end-points. Also, unlike several other recently proposed end-to-end techniques which require extensive modification of end-protocols, the proposed scheme does not require any functional change in the TCP/IP protocol software. Besides the difference in deployment scenarios, the IPMN offers blazingly fast event based handoff and much faster and simplified transport (no tunneling delay) than MIP. We have implemented IPMN over FreeBSD. In this paper we show the performance advantage of IPMN over MIP with real deployment for three interesting real-time traffic types — www, voice streaming and, steerable/interactive time critical video.     

Efficient data dissemination using locale covers

Location-dependent data are central to many emerging applications, ranging from traffic information services to sensor networks. The standard pull- and push-based data dissemination models become unworkable since the data volumes and number of clients are high.We address this problem using locale covers, a subset of the original set of locations of interest, chosen to include at least one location in a suitably defined neighborhood of any client. Since location-dependent values are highly correlated with location, a query can be answered using a location close to the query point. Typical closeness measures might be Euclidean distance, or a $k$-nearest neighbor criterion.We show that location-dependent queries may be answered satisfactorily using locale covers. Our approach is independent of locations and speeds of clients, and is applicable to mobile clients.We also introduce a nested locale cover scheme that ensures fair access latencies, and allows clients to refine the accuracy of their information over time. We also prove two important results: one regarding the greedy algorithm for sensor covers and the other pertaining to randomized locale covers for $k$-nearest neighbor queries.     

A theoretical investigation of the emerging standards for web services

Currently, standards for web services are being developed via three different initiatives (W3C, Semantic web services and ebXML). To the best of our knowledge, no theoretical perspectives underlie these standardization efforts. Without the benefit of a strong theoretical basis, the results, within and across these initiatives, have remained piecemeal. We suggest ‘Language–Action Theories’ as a plausible perspective that can effectively define, assess and refine web services standards. In this paper, we first investigate the existing initiatives to identify commonalities that point to theories of ‘Language–Action’ as an appropriate theoretical basis for web services standards. Next, we adapt work from these theories to develop a comprehensive reference framework for understanding web services standards. Finally, we use this reference framework to assess the three initiatives, and analyze the findings to provide insights for future development and refinement of web services standards.

Geomorphology Based Semi-Distributed Approach for Modelling Rainfall-Runoff Process

This study presents a geomorphology based semi-distributed methodology for prediction of runoff of a catchment. In this proposed methodology, the catchment area is divided into a number of sub-catchments using the Thiessen polygon method. The rainfall records of particular rain-gauge station are considered as uniformly distributed over the entire sub-watershed. Four different weighting factors are proposed to obtain the sub-catchment’s contribution towards runoff. The weighting factors are calculated based on the geomorphological parameters of the catchment. The geomorphological parameters of the sub-watersheds are obtained from SRTM digital elevation data. The weighted contributions from all the sub-watersheds at current and previous time steps and the previous time step discharge are used to develop an Artificial Neural Network (ANN) for predicting the discharge at the basin outlet. A lump model considering average rainfall of the catchment is also developed using ANN for evaluating the performance of the proposed distributed model. For the lump model, average rainfall is calculated using Thiessen polygon method. The historic rainfall and runoff data recorded at the Dikrong basin, a sub-catchment of the river Brahmaputra is used to evaluate the efficiency of the developed methodology. The evaluation results show that the presented model is superior to the lump model and has the potential for field application. A comparative study is also carried out to obtain the most influential combination of geomorphological parameters in predicting the catchment’s runoff.     

Analysis of temporal jitter in a copper vapor laser system

Temporal jitter in a magnetic pulse compression based copper vapor laser (CVL) system is analyzed by considering ripple present in the input dc power supply and ripple present in the magnetic core resetting power supply. It is shown that the jitter is a function of the ratio of operating voltage to the designed voltage, percentage ripple, and the total propagation delay of the magnetic pulse compression circuit. Experimental results from a CVL system operating at a repetition rate of 9 kHz are presented.     

Setup for in situ deep level transient spectroscopy of semiconductors during swift heavy ion irradiation

A computerized system for in situ deep level characterization during irradiation in semiconductors has been set up and tested in the beam line for materials science studies of the 15 MV Pelletron accelerator at the Inter-University Accelerator Centre, New Delhi. This is a new facility for in situ irradiation-induced deep level studies, available in the beam line of an accelerator laboratory. It is based on the well-known deep level transient spectroscopy (DLTS) technique. High versatility for data manipulation is achieved through multifunction data acquisition card and LABVIEW. In situ DLTS studies of deep levels produced by impact of 100 MeV Si ions on Aun-Si(100) Schottky barrier diode are presented to illustrate performance of the automated DLTS facility in the beam line.