A Tutorial on Integrating CDS/ISIS Databases with the World Wide Web

With the emergence of Internet, the global connectivity of computers has become a reality. Internet has progressed to provide many user-friendly tools like Gopher, WAIS, WWW etc. for information publishing and access. The WWW, which integrates all other access tools, also provides a very convenient means for publishing and accessing multimedia and hypertext linked documents stored in computers spread across the world. With the emergence of WWW technology, most of the information activities are becoming Web-centric. Once the information is published on the Web, a user can access this information from any part of the world. A Web browser like Netscape or Internet Explorer is used as a common user interface for accessing information/databases. This will greatly relieve a user from learning the search syntax of individual information systems. Libraries are taking advantage of these developments to provide access to their resources on the Web. CDS/ISIS is a very popular bibliographic information management software used in India. In this tutorial we present details of integrating CDS/ISIS with the WWW. A number of tools are now available for making CDS/ISIS database accessible on the Internet/Web. Some of these are 1) the WAIS_ISIS Server. 2) the WWWISIS Server 3) the IQUERY Server. In this tutorial, we have explained in detail the steps involved in providing Web access to an existing CDS/ISIS database using the freely available software, WWWISIS. This software is developed, maintained and distributed by BIREME, the Latin American & Caribbean Centre on Health Sciences Information. WWWISIS acts as a server for CDS/ISIS databases in a WWW client/server environment. It supports functions for searching, formatting and data entry operations over CDS/ISIS databases. WWWISIS is available for various operating systems. We have tested this software on Windows '95, Windows NT and Red Hat Linux release 5.2 (Appolo) Kernel 2. 0. 36 on an i686. The testing was carried out using IISc's main library's OPAC containing more than 80,000 records and Current Contents issues (bibliographic data) containing more than 25,000 records. WWWISIS is fully compatible with CDS/ISIS 3.07 file structure. However, on a system running Unix or its variant, there is no guarantee of this compatibility. It is therefore safe to recreate the master and the inverted files, using utilities provided by BIREME, under Unix environment.

Solving a part classification problem using simulated annealing-like hybrid

Part classification and coding is still considered as laborious and time-consuming exercise. Keeping in view, the crucial role, which it plays, in developing automated CAPP systems, the attempts have been made in this article to automate a few elements of this exercise using a shape analysis model. In this study, a 24-vector directional template is contemplated to represent the feature elements of the parts (candidate and prototype). Various transformation processes such as deformation, straightening, bypassing, insertion and deletion are embedded in the proposed simulated annealing (SA)-like hybrid algorithm to match the candidate part with their prototype. For a candidate part, searching its matching prototype from the information data is computationally expensive and requires large search space. However, the proposed SA-like hybrid algorithm for solving the part classification problem considerably minimizes the search space and ensures early convergence of the solution. The application of the proposed approach is illustrated by an example part. The proposed approach is applied for the classification of 100 candidate parts and their prototypes to demonstrate the effectiveness of the algorithm. (C) 2003 Elsevier Science Ltd. All rights reserved.

Faster Algorithms for Incremental Topological Ordering.Robert Tarjan

We present two online algorithms for maintaining a topological order of a directed acyclic graph as arcs are added, and detecting a cycle when one is created. Our first algorithm takes O(m 1/2) amortized time per arc and our second algorithm takes O(n 2.5/m) amortized time per arc, where n is the number of vertices and m is the total number of arcs. For sparse graphs, our O(m 1/2) bound improves the best previous bound by a factor of logn and is tight to within a constant factor for a natural class of algorithms that includes all the existing ones. Our main insight is that the two-way search method of previous algorithms does not require an ordered search, but can be more general, allowing us to avoid the use of heaps (priority queues). Instead, the deterministic version of our algorithm uses (approximate) median-finding; the randomized version of our algorithm uses uniform random sampling. For dense graphs, our O(n 2.5/m) bound improves the best previously published bound by a factor of n 1/4 and a recent bound obtained independently of our work by a factor of logn. Our main insight is that graph search is wasteful when the graph is dense and can be avoided by searching the topological order space instead. Our algorithms extend to the maintenance of strong components, in the same asymptotic time bounds.

Deorphanization of Malonyl CoA:ACP Transacylase Drug Target in Plasmodium falciparum (PfFabD) Using Bacterial Antagonists: A Piggyback' Approach for Antimalarial Drug Discovery

Quest for new drug targets in Plasmodium sp. has underscored malonyl CoA:ACP transacylase (PfFabD) of fatty acid biosynthetic pathway in apicoplast. In this study, a piggyback approach was employed for the receptor deorphanization using inhibitors of bacterial FabD enzymes. Due to the lack of crystal structure, theoretical model was constructed using the structural details of homologous enzymes. Sequence and structure analysis has localized the presence of two conserved pentapeptide motifs: GQGXG and GXSXG and five key invariant residues viz., Gln109, Ser193, Arg218, His305 and Gln354 characteristic of FabD enzyme. Active site mapping of PfFabD using substrate molecules has disclosed the spatial arrangement of key residues in the cavity. As structurally similar molecules exhibit similar biological activities, signature pharmacophore fingerprints of FabD antagonists were generated using 0D-3D descriptors for molecular similarity-based cluster analysis and to correlate with their binding profiles. It was observed that antagonists showing good geometrical fitness score were grouped in cluster-1, whereas those exhibiting high binding affinities in cluster-2. This study proves important to shed light on the active site environment to reveal the hotspot for binding with higher affinity and to narrow down the virtual screening process by searching for close neighbors of the active compounds.

Mutual inhibition and capacity sharing during parallel preparation of serial eye movements

Many common activities, like reading, scanning scenes, or searching for an inconspicuous item in a cluttered environment, entail serial movements of the eyes that shift the gaze from one object to another. Previous studies have shown that the primate brain is capable of programming sequential saccadic eye movements in parallel. Given that the onset of saccades directed to a target are unpredictable in individual trials, what prevents a saccade during parallel programming from being executed in the direction of the second target before execution of another saccade in the direction of the first target remains unclear. Using a computational model, here we demonstrate that sequential saccades inhibit each other and share the brain's limited processing resources (capacity) so that the planning of a saccade in the direction of the first target always finishes first. In this framework, the latency of a saccade increases linearly with the fraction of capacity allocated to the other saccade in the sequence, and exponentially with the duration of capacity sharing. Our study establishes a link between the dual-task paradigm and the ramp-to-threshold model of response time to identify a physiologically viable mechanism that preserves the serial order of saccades without compromising the speed of performance.

Higgs boson in the MSSM in light of the LHC

We investigate the expectations for the light Higgs signal in the minimal supersymmetric standard model in different search channels at the LHC. After taking into account dark matter and flavor constraints in the minimal supersymmetric standard model with 11 free parameters as well as LHC results on the Higgs sector, we show that the light Higgs signal in the gamma channel is expected to be at most at the level of the standard model Higgs, while the h -> b (b) over bar from W fusion and/or the h -> tau(tau) over bar can be enhanced. For the main discovery mode, we show that a strong suppression of the signal occurs in two different cases: low M-A or large invisible width. The former is however strongly constrained by the recent LHC results. A more modest suppression is associated with the effect of light supersymmetric particles. Looking for such modification of the Higgs properties and searching directly for supersymmetric partners and pseudoscalar Higgs offer two complementary probes of supersymmetry at the LHC.

The hazard potential of the western segment of the Makran subduction zone, northern Arabian Sea

Evaluating the hazard potential of the Makran subduction zone requires understanding the previous records of the large earthquakes and tsunamis. We address this problem by searching for earthquake and tectonic proxies along the Makran Coast and linking those observations with the available constraints on historical seismicity and the tell-tale characteristics of sea floor morphology. The earthquake of Mw 8.1 of 1945 and the consequent tsunami that originated on the eastern part of the Makran are the only historically known hazardous events in this region. The seismic status of the western part of the subduction zone outside the rupture area of the 1945 earthquake remains an enigma. The near-shore shallow stratigraphy of the central part of Makran near Chabahar shows evidence of seismically induced liquefaction that we attribute to the distant effects of the 1945 earthquake. The coastal sites further westward around Jask are remarkable for the absence of liquefaction features, at least at the shallow level. Although a negative evidence, this possibly implies that the western part of Makran Coast region may not have been impacted by near-field large earthquakes in the recent past-a fact also supported by the analysis of historical data. On the other hand, the elevated marine terraces on the western Makran and their uplift rates are indicative of comparable degree of long-term tectonic activity, at least around Chabahar. The offshore data suggest occurrences of recently active submarine slumps on the eastern part of the Makran, reflective of shaking events, owing to the great 1945 earthquake. The ocean floor morphologic features on the western segment, on the contrary, are much subdued and the prograding delta lobes on the shelf edge also remain intact. The coast on the western Makran, in general, shows indications of progradation and uplift. The various lines of evidence thus suggest that although the western segment is potentially seismogenic, large earthquakes have not occurred there in the recent past, at least during the last 600 years. The recurrence period of earthquakes may range up to 1,000 years or more, an assessment based on the age of the youngest dated coastal ridge. The long elapsed time points to the fact that the western segment may have accumulated sufficient slip to produce a major earthquake.

Turning visual search time on its head

Our everyday visual experience frequently involves searching for objects in clutter. Why are some searches easy and others hard? It is generally believed that the time taken to find a target increases as it becomes similar to its surrounding distractors. Here, I show that while this is qualitatively true, the exact relationship is in fact not linear. In a simple search experiment, when subjects searched for a bar differing in orientation from its distractors, search time was inversely proportional to the angular difference in orientation. Thus, rather than taking search reaction time (RT) to be a measure of target-distractor similarity, we can literally turn search time on its head (i.e. take its reciprocal 1/RT) to obtain a measure of search dissimilarity that varies linearly over a large range of target-distractor differences. I show that this dissimilarity measure has the properties of a distance metric, and report two interesting insights come from this measure: First, for a large number of searches, search asymmetries are relatively rare and when they do occur, differ by a fixed distance. Second, search distances can be used to elucidate object representations that underlie search - for example, these representations are roughly invariant to three-dimensional view. Finally, search distance has a straightforward interpretation in the context of accumulator models of search, where it is proportional to the discriminative signal that is integrated to produce a response. This is consistent with recent studies that have linked this distance to neuronal discriminability in visual cortex. Thus, while search time remains the more direct measure of visual search, its reciprocal also has the potential for interesting and novel insights. (C) 2012 Elsevier Ltd. All rights reserved.

A peer-peer particle swarm optimizer

Particle Swarm Optimization is a parallel algorithm that spawns particles across a search space searching for an optimized solution. Though inherently parallel, they have distinct synchronizations points which stumbles attempts to create completely distributed versions of it. In this paper, we attempt to create a completely distributed peer-peer particle swarm optimization in a cluster of heterogeneous nodes. Since, the original algorithm requires explicit synchronization points we modified the algorithm in multiple ways to support a peer-peer system of nodes. We also modify certain aspect of the basic PSO algorithm and show how certain numerical problems can take advantage of the same thereby yielding fast convergence.

Fiber Bragg Grating Sensor Instrumentation for Parking Space Occupancy Management

This work aims at providing an effective parking management system by reducing the drivers' searching time for vacant car-parking space, in turn improving the traffic flow in the car park areas. This is achieved by the use of Fiber Bragg Grating Sensor (FBG) sensor instrumentation in vehicle parking management system. Present work involves embedding an array of FBG sensors underground in the parking space, then determining the strain changes on the FBG sensor due to load applied by the vehicle parked in the parking space, occupancy of the parking space is determined. To validate the FBG sensor parking management system, three most common cases have been considered. This closed loop FBG parking management system can give real-time feed-back to space-guidance display board helping the driver in maneuvering the vehicle to the appropriate parking space. The proposed technique offers optimized usage of parking space for the various segments of cars and also facilitates in a conjoined automated billing system, as compared to conventional method of parking systems.

An Eigen Approach to Transmit Beamforming in Wireless Networks With Single Antenna Receivers

In this paper, we propose an eigen framework for transmit beamforming for single-hop and dual-hop network models with single antenna receivers. In cases where number of receivers is not more than three, the proposed Eigen approach is vastly superior in terms of ease of implementation and computational complexity compared with the existing convex-relaxation-based approaches. The essential premise is that the precoding problems can be posed as equivalent optimization problems of searching for an optimal vector in the joint numerical range of Hermitian matrices. We show that the latter problem has two convex approximations: the first one is a semi-definite program that yields a lower bound on the solution, and the second one is a linear matrix inequality that yields an upper bound on the solution. We study the performance of the proposed and existing techniques using numerical simulations.

Silent katydid females are at higher risk of bat predation than acoustically signalling katydid males

Males that produce conspicuous mate attraction signals are often at high risk of predation from eavesdropping predators. Females of such species typically search for signalling males and their higher motility may also place them at risk. The relative predation risk faced by males and females in the context of mate-finding using long-distance signals has rarely been investigated. In this study, we show, using a combination of diet analysis and behavioural experiments, that katydid females, who do not produce acoustic signals, are at higher risk of predation from a major bat predator, Megaderma spasma, than calling males. Female katydids were represented in much higher numbers than males in the culled remains beneath roosts of M. spasma. Playback experiments using katydid calls revealed that male calls were approached in only about one-third of the trials overall, whereas tethered, flying katydids were always approached and attacked. Our results question the idea that necessary costs of mate-finding, including risk of predation, are higher in signalling males than in searching females.

Magnetometry using Ramsey interferometry in a Yb atomic beam

We use the Ramsey separated oscillatory fields technique in a 400 degrees C thermal beam of ytterbium (Yb) atoms to measure the Larmor precession frequency (and hence the magnetic field) with high precision. For the experiment, we use the strongly allowed S-1(0) P-1(1) transition at 399 nm, and choose the odd isotope Yb-171 with nuclear spin I = 1/2, so that the ground state has only two magnetic sublevels m(F) = +/- 1/2. With a magnetic field of 22.2 G and a separation of about 400 mm between the oscillatory fields, the central Ramsey fringe is at 16.64 kHz and has a width of 350 Hz. The technique can be readily adapted to a cold atomic beam, which is expected to give more than an order-of-magnitude improvement in precision. The signal-to-noise ratio is comparable to other techniques of magnetometry; therefore it should be useful for all kinds of precision measurements such as searching for a permanent electric dipole moment in atoms.

A novel acoustic-vibratory multimodal duet

The communication strategy of most crickets and bushcrickets typically consists of males broadcasting loud acoustic calling songs, while females perform phonotaxis, moving towards the source of the call. Males of the pseudophylline bushcricket species Onomarchus uninotatus produce an unusually low-pitched call, and we found that the immediate and most robust response of females to the male acoustic call was a bodily vibration, or tremulation, following each syllable of the call. We hypothesized that these bodily oscillations might send out a vibrational signal along the substrate on which the female stands, which males could use to localize her position. We quantified these vibrational signals using a laser vibrometer and found a clear phase relationship of alternation between the chirps of the male acoustic call and the female vibrational response. This system therefore constitutes a novel multimodal duet with a reliable temporal structure. We also found that males could localize the source of vibration but only if both the acoustic and vibratory components of the duet were played back. This unique multimodal duetting system may have evolved in response to higher levels of bat predation on searching bushcricket females than calling males, shifting part of the risk associated with partner localization onto the male. This is the first known example of bushcricket female tremulation in response to a long-range male acoustic signal and the first known example of a multimodal duet among animals.

Discovering compressing serial episodes from event sequences

Most pattern mining methods yield a large number of frequent patterns, and isolating a small relevant subset of patterns is a challenging problem of current interest. In this paper, we address this problem in the context of discovering frequent episodes from symbolic time-series data. Motivated by the Minimum Description Length principle, we formulate the problem of selecting relevant subset of patterns as one of searching for a subset of patterns that achieves best data compression. We present algorithms for discovering small sets of relevant non-redundant episodes that achieve good data compression. The algorithms employ a novel encoding scheme and use serial episodes with inter-event constraints as the patterns. We present extensive simulation studies with both synthetic and real data, comparing our method with the existing schemes such as GoKrimp and SQS. We also demonstrate the effectiveness of these algorithms on event sequences from a composable conveyor system; this system represents a new application area where use of frequent patterns for compressing the event sequence is likely to be important for decision support and control.