An enhanced zone 3 algorithm of a distance relay using transient components and state diagram

Zone 3 of a distance relay is used to provide the remote backup protection in case of the failure of the primary protection. However, the risk of maloperation under stressed conditions such as heavy loading, voltage, and transient instability is quite high. Zone 3 is used in combination with the derivatives of the voltage and current, etc. to prevent maloperation. At times, the impedance characteristics that restrict the tripping area of relay are used to avoid maloperation due to load encroachment. This work presents a novel zone 3 scheme based on combining the steady-state components (i.e., 60 Hz) and the transient components (TCs) using a state diagram that visualizes the sequence of studies that emanate from the sequence of events. The simulation results show that the novel zone 3 distance relay elements using the proposed method operate correctly for the various events.     

CARD: A Contact-based Architecture for Resource Discovery in Wireless Ad Hoc Networks

Traditional protocols for routing in ad hoc networks attempt to obtain optimal or shortest paths, and in doing so may incur significant route discovery overhead. Such approaches may be appropriate for routing long-lived transfers where the initial cost of route discovery may be amortized over the life of the connection. For short-lived connections, however, such as resource discovery and small transfers, traditional shortest path approaches may be quite inefficient. In this paper we propose a novel architecture, CARD, for resource discovery in large-scale wireless ad hoc networks. Our mechanism is suitable for resource discovery as well as routing very small data transfers or transactions in which the cost of data transfer is much smaller than the cost of route discovery. Our architecture avoids expensive mechanisms such as global flooding and complex hierarchy formation and does not require any location information. In CARD resources within the vicinity of a node, up to a limited number of hops, are discovered using a proactive scheme. For resources beyond the vicinity, each node maintains a few distant nodes called contacts. Contacts help in creating a small world in the network and provide an efficient way to query for distant resources. Using contacts, the network view (or reachability) of the nodes increases, reducing the discovery overhead and increasing the success rate. On the other hand, increasing the number of contacts also increases control overhead. We study such trade-off in depth and present mechanisms for contact selection and maintenance that attempt to increase reachability with reduced overhead. Our schemes adapt gracefully to network dynamics and mobility using soft-state periodic mechanisms to validate and recover paths to contacts. Our simulation results show that CARD is scalable and can be configured to provide desirable performance for various network sizes. Comparisons with other schemes show overhead savings reaching over 93% (vs. flooding) and 80% (vs. bordercasting or zone routing) for high query rates in large-scale networks.     

Fabrication of Arsenic Sulfide Optical Fiber with Low Hydrogen Impurities

Arsenic sulfide glass optical fibers typically possess extrinsic absorption bands in the infrared wavelength region associated with residual hydrogen and oxygen related impurities, despite using purified precursors. We report a purification process based on the addition of tellurium tetrachloride (TeCl₄) to the glass. During melting, the chlorine from TeCl₄ reacts with the hydrogen impurities to produce volatile products (e.g., HCl) that can be removed by subsequent dynamic distillation. The processing conditions have been modified accordingly to produce optical fibers with significantly reduced loss due to hydrogen sulfide impurity content (1.5 dB/m).     

The generalized Kuhn model of linear viscoelasticity

We propose a generalization of the Kuhn model of linear viscoelasticity. This generalization, which has four material parameters, is able to provide a near frequency independent response over a wide range of frequencies. It is useful for highly dissipative materials such as asphalt concrete. It is derived by generalizing Lubliner and Panoskaltsis’s modified Kuhn model, but we also show that it is closely related to fractional derivative models. We show that the model admits a rheological approximation, that is, an approximation by classical springs and dashpots. The model and rheological representation are compared to experimental data.     

A generalized scheme for mapping parallel algorithms

A generalized mapping strategy that uses a combination of graph theory, mathematical programming, and heuristics is proposed. The authors use the knowledge from the given algorithm and the architecture to guide the mapping. The approach begins with a graphical representation of the parallel algorithm (problem graph) and the parallel computer (host graph). Using these representations, the authors generate a new graphical representation (extended host graph) on which the problem graph is mapped. An accurate characterization of the communication overhead is used in the objective functions to evaluate the optimality of the mapping. An efficient mapping scheme is developed which uses two levels of optimization procedures. The objective functions include minimizing the communication overhead and minimizing the total execution time which includes both computation and communication times. The mapping scheme is tested by simulation and further confirmed by mapping a real world application onto actual distributed environments     

On the network effect in Web 2.0 applications

In recent years, the proliferation of the world wide web has lead to an increase in a number of applications such as search, social networks and auctions, whose success depends critically upon the number of users of that service. Two examples of such applications are internet auctions and social networks. One of the characteristics of online auctions is that a successful implementation requires a high volume of buyers and sellers at its website. Consequently, auction sites which have a high volume of traffic have an advantage over those in which the volume is limited. This results in even greater polarization of buyers and sellers towards a particular site. The same is true for social networks in which greater use of a given social network increases the use from other participants on the network. This is often referred to as the “network effect” in a variety of interaction-centric applications in networks. While this effect has qualitatively been known to increase the value of the overall network, its effect has never been modeled or studied rigorously. In this paper, we construct a Markov model to analyze the network effect in the case of two important classes of web applications. These correspond to auctions and social networks. We show that the network effect is very powerful and can result in a situation in which an auction or a social networking site can quickly overwhelm its competing sites. Thus, the results of this paper show the tremendous power of the network effect for Web 2.0 applications.     

Computation of surface orientation and structure of objects using grid coding

In this correspondence, algorithms are introduced to infer surface orientation and structure of visible object surfaces using grid coding. We adopt the active lighting technique to spatially ``encode' the scene for analysis. The observed objects, which can have surfaces of arbitrary shape, are assumed to rest on a plane (base plane) in a scene which is ``encoded' with light cast through a grid plane. Two orthogonal grid patterns are used, where each pattern is obtained with a set of equally spaced stripes marked on a glass pane. The scene is observed through a camera and the object surface orientation is determined using the projected patterns on the object surface. If the surfaces under consideration obey certain smoothness constraints, a dense orientation map can be obtained through proper interpolation. The surface structure can then be recovered given this dense orientation map. Both planar and curved surfaces can be handled in a uniform manner. The algorithms we propose yield reasonably accurate results and are relatively tolerant to noise, especially when compared to shape-from-shading techniques. In contrast to other grid coding techniques reported which match the grid junctions for depth reconstruction under the stereopsis principle, our techniques use the direction of the projected stripes to infer local surface orientation and do not require any correspondence relationship between either the grid lines or the grid junctions to be specified. The algorithm has the ability to register images and can therefore be embedded in a system which integrates knowledge from multiple views.     

Parallel 2-d convolution on a mesh connected array processor

In this correspondence, a parallel 2-D convolution scheme is presented. The processing structure is a mesh connected array processor consisting of the same number of simple processing elements as the number of pixels in the image. For most windows considered, the number of computation steps required is the same as that of the coefficients of a convolution window. The proposed scheme can be easily extended to convolution windows of arbitrary size and shape. The basic idea of the proposed scheme is to apply the 1-D systolic concept to 2-D convolution on a mesh structure. The computation is carried out along a path called a convolution path in a systolic manner. The efficiency of the scheme is analyzed for windows of various shapes. The ideal convolution path is a Hamiltonian path ending at the center of the window, the length of which is equal to the number of window coefficients. The simple architecture and control strategy make the proposed scheme suitable for VLSI implementation.