High input impedance VM-APSs with grounded passive elements

Three new circuit topologies for first-order all-pass filters, each with two variations, realising six new first-order voltage-mode all-pass sections are proposed. Each circuit employs two differential voltage current conveyors and three grounded passive components, ideal for IC implementation. All the circuits possess high input impedance, which is a desirable feature for voltage-mode circuits. As an application, a new quadrature oscillator circuit is realised using one of the proposed all-pass circuits. PSPICE simulations using 0.5 mum CMOS parameters confirm the validity and practical utility of the proposed circuits     

Performance evaluation of air-conditioning units

A limited selection of samples of small and medium size air-conditioning equipment being marketed or manufactured in Kuwait was tested in an internationally reputed laboratory. The actual performance results obtained from laboratory tests were analyzed and compared with the commercially available information from the manufacturers for the same selected units. The analysis indicated the quality of air-conditioning equipment available to the Kuwaiti user.     

A Dynamic Dictionary for Priced Information with Application

In this paper we design a dynamic dictionary for the priced information model initiated by Charikar et al. Assume that a set S consisting of n elements is given such that each element has an associated price, a positive real number. The cost of performing an operation on elements of S is a function of their prices. The cost of an algorithm is the sum of the costs of all operations it performs. The objective is to design algorithms which incur low cost. In this model we propose a dynamic dictionary, supporting search, insert and delete, for keys drawn from a linearly ordered set. As an application we show that the dictionary can be used in computing the trapezoidal map of a set of line segments, a fundamental problem in computational geometry.     

Consensus-based data replication protocol for distributed cloud

The Journal of Supercomputing - Data availability ensures efficient data accessibility by the readers anytime and from anywhere. It can be addressed by creating multiple copies of each data file...     

Switching to Directional Antennas with Constant Increase in Radius and Hop Distance

For any angle α<2π, we show that any connected communication graph that is induced by a set P of n transceivers using omni-directional antennas of radius 1, can be replaced by a strongly connected communication graph, in which each transceiver in P is equipped with a directional antenna of angle α and radius r _dir, for some constant r _dir=r _dir(α). Moreover, the new communication graph is a c-spanner of the original graph, for some constant c=c(α), with respect to number of hops.     

An algorithm for recognizing palm polygons

A polygonP is said to be apalm polygon if there exists a pointxP such that the Euclidean shortest path fromx to any pointyP makes only left turns or only right turns. The set of all such pointsx is called thepalm kernel. In this paper we propose an O(E) time algorithm for recognizing a palm polygonP, whereE is the size of the visibility graph ofP. The algorithm recognizes the given polygonP as a palm polygon by computing the palm kernel ofP. If the palm kernel is not empty,P is a palm polygon.The extended abstract of this paper was reported at the Second Canadian Conference in Computational Geometry, pp. 246–251, 1990     

Issues and strategies in composite fabrication via friction stir processing: A review

Friction stir processing (FSP) is an expeditiously emerging novel technique involving exterior layer modification, which enables one to successfully fabricate surface composites (SCs) as well as bulk composites of the metal matrix. SCs constitute an exclusive class of composites which exhibit improved surface properties while retaining the bulk properties unaltered. During initiative years, FSP was employed in development of SCs of light metal alloys like aluminum. But, nowadays, it has gained a shining role in the field of SC fabrication of various nonferrous alloys like aluminum, magnesium, copper, and even ferrous metals like steel etc. This article reviews the current trends, various issues, and strategies used to enhance the efficiency of the fabrication process of SCs. Factors involved in the process of SC fabrication are discussed and classified with a new approach. Also, variation of microstructural and mechanical characteristics with these factors is reviewed. In addition to a brief presentation on the interaction between various inputs and their effects on properties, a summary of literature on SC fabrication for different metals is tabulated with prominent results. Subsequently, shortfalls and future perspectives of FSP on SC fabrication domain are discussed.     

Algorithms for computing diffuse reflection paths in polygons

Let s be a point source of light inside a polygon P of n vertices. A polygonal path from s to some point t inside P is called a diffuse reflection path if the turning points of the path lie on edges of?P. A?diffuse reflection path is said to be optimal if it has the minimum number of reflections on the path. The problem of computing a diffuse reflection path from s to t inside P has not been considered explicitly in the past. We present three different algorithms for this problem which produce suboptimal paths. For constructing such a path, the first algorithm uses a greedy method, the second algorithm uses a transformation of a minimum link path, and the third algorithm uses the edge–edge visibility graph of?P. The first two algorithms are for polygons without holes, and they run in O(n+klogn) time, where k denotes the number of reflections in the constructed path. The third algorithm is for polygons with or without holes, and it runs in O(n ²) time. The number of reflections in the path produced by this third algorithm can be at most three times that of an optimal diffuse reflection path. Though the combinatorial approach used in the third algorithm gives a better bound on the number of reflections on the path, the first and the second algorithms stand on the merit of their elegant geometric approaches based on local geometric information.