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.     

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.     

A learning automata-based fault-tolerant routing algorithm for mobile ad hoc networks

Reliable routing of packets in a Mobile Ad Hoc Network (MANET) has always been a major concern. The open medium and the susceptibility of the nodes of being fault-prone make the design of protocols for these networks a challenging task. The faults in these networks, which occur either due to the failure of nodes or due to reorganization, can eventuate to packet loss. Such losses degrade the performance of the routing protocols running on them. In this paper, we propose a routing algorithm, named as learning automata based fault-tolerant routing algorithm (LAFTRA), which is capable of routing in the presence of faulty nodes in MANETs using multipath routing. We have used the theory of Learning Automata (LA) for optimizing the selection of paths, reducing the overhead in the network, and for learning about the faulty nodes present in the network. The proposed algorithm can be juxtaposed to any existing routing protocol in a MANET. The results of simulation of our protocol using network simulator 2 (ns-2) shows the increase in packet delivery ratio and decrease in overhead compared to the existing protocols. The proposed protocol gains an edge over FTAR, E2FT by nearly 2% and by more than 10% when compared with AODV in terms of packet delivery ratio with nearly 30% faulty nodes in the network. The overhead generated by our protocol is lesser by 1% as compared to FTAR and by nearly 17% as compared to E2FT when there are nearly 30% faulty nodes.     

Fibrous myopathy. A rheumatic complication of drug abuse

A progressive fibrous myopathy may result from chronic intramuscular drug abuse. This complication may mimic other rheumatic disorders and early recognition may prevent disability. The patient described here presented with fixed flexion and extension contracture of hips and knees, respectively, after abusing meperidine and other agents for 3 years. Soft tissues of thighs and buttocks were "wood hard," EMG showed absence of action potentials in affected muscles, and biopsy revealed extensive replacement of muscle with dense, acellular fibrous tissue. Possible mechanisms are discussed.     

Preoperative radiotherapy for adenocarcinoma of the rectosigmoid

Ninety-seven patients with adenocarcinoma of the rectosigmoid have been treated with high dose (5000-6000 rad) preoperative irradiation from 1960 through 1972 at the University of Oregon Health Sciences Center. Fifty-seven were initially clinically resectable and 40 were initially inoperable. Forty of the 57 initially clinically resectable patients had "curative" resections and are at risk for more than 5 years. An increase in 5-year survival (from 38% to 53%) and an absence of pelvic recurrence have occurred in those patients receiving preoperative irradiation and "curative" resection. Four of the 40 initially inoperable patients are alive without tumor. Three of the four survivors had irradiation and surgery; one had irradiation only. An additional four patients had no evidence of tumor at death. Tumor was totally sterilized by irradiation and nine patients and reduced to microfocal extent in an additional three of the 97 patients. Incidence of complications was no greater than has been reported in a surgical series from the same institution.