Parallel algorithm for binomial series(special cases) using mesh architecture

Author(s):  
Ashish Gupta
2017 ◽  
Vol 27 (03n04) ◽  
pp. 1750009 ◽  
Author(s):  
Amit Datta ◽  
Mallika De ◽  
Bhabani P. Sinha

A parallel algorithm for prefix computation on [Formula: see text] data elements mapped on a Multi Mesh (MM) network of [Formula: see text] processing elements is presented here. The time required by the proposed algorithm is significantly less than that by any of the existing algorithms for prefix computation on mesh-like architectures due to the specific interconnection pattern used in the MM network. The proposed technique requires [Formula: see text] time for data communication and [Formula: see text] time for computation, when mapped on a MM network constituted by [Formula: see text] meshes, each of size [Formula: see text]. The data communication time in the proposed algorithm is less than the prefix sum algorithm proposed in extended Multi Mesh. To be precise, instead of [Formula: see text] communication time the proposed algorithm requires a data communication time of [Formula: see text] only. Moreover, the proposed parallel algorithm does not need any extra inter block links as used in the extended Multi Mesh.


1991 ◽  
Vol 01 (02) ◽  
pp. 143-148 ◽  
Author(s):  
SELIM G. AKL ◽  
THIBAULT DUBOUX ◽  
IVAN STOJMENOVIC

We present a cost-optimal parallel algorithm for generating variations of m elements out of {0, 1, …, n - 1} in lexicographic order. It uses a linear array of m processors, each having constant size memory and each being responsible for producing one part of a given variation. Binary and decimal counters are special cases of the algorithm, when n = 2 and n = 10, respectively. To our knowledge, the algorithm presented here is the first to be published with the property that the delay between any two variations generated is constant.


2003 ◽  
Vol 13 (04) ◽  
pp. 673-687
Author(s):  
ARVIND GUPTA ◽  
RAMESH KRISHNAMURTI

Vehicle routing problems involve the navigation of one or more vehicles through a network of locations. Locations have associated handling times as well as time windows during which they are active. The arcs connecting locations have time costs associated with them. In this paper, we consider two different problems in single vehicle routing. The first is to find least time cost routes between all pairs of nodes in a network for navigating vehicles; we call this the all pairs routing problem. We show that there is an O( log 3 n) time parallel algorithm using a polynomial number of processors for this problem on a CREW PRAM. We next consider the problem in which a vehicle services all locations in a network. Here, locations can be passed through at any time but only serviced during their time window. The general problem is [Formula: see text] -complete under even fairly stringent restrictions but polynomial algorithms have been developed for some special cases. In particular, when the network is a line, there is no time cost in servicing a location, and all time windows are unbounded at either their lower or upper end, O(n2) algorithms have been developed. We show that under the same conditions, we can reduce this problem to the all pairs routing problem and therefore obtain an O( log 3 n) time parallel algorithm on a CREW PRAM.


Author(s):  
M. Isaacson ◽  
M.L. Collins ◽  
M. Listvan

Over the past five years it has become evident that radiation damage provides the fundamental limit to the study of blomolecular structure by electron microscopy. In some special cases structural determinations at very low doses can be achieved through superposition techniques to study periodic (Unwin & Henderson, 1975) and nonperiodic (Saxton & Frank, 1977) specimens. In addition, protection methods such as glucose embedding (Unwin & Henderson, 1975) and maintenance of specimen hydration at low temperatures (Taylor & Glaeser, 1976) have also shown promise. Despite these successes, the basic nature of radiation damage in the electron microscope is far from clear. In general we cannot predict exactly how different structures will behave during electron Irradiation at high dose rates. Moreover, with the rapid rise of analytical electron microscopy over the last few years, nvicroscopists are becoming concerned with questions of compositional as well as structural integrity. It is important to measure changes in elemental composition arising from atom migration in or loss from the specimen as a result of electron bombardment.


Author(s):  
H. Bethge

Besides the atomic surface structure, diverging in special cases with respect to the bulk structure, the real structure of a surface Is determined by the step structure. Using the decoration technique /1/ it is possible to image step structures having step heights down to a single lattice plane distance electron-microscopically. For a number of problems the knowledge of the monatomic step structures is important, because numerous problems of surface physics are directly connected with processes taking place at these steps, e.g. crystal growth or evaporation, sorption and nucleatlon as initial stage of overgrowth of thin films.To demonstrate the decoration technique by means of evaporation of heavy metals Fig. 1 from our former investigations shows the monatomic step structure of an evaporated NaCI crystal. of special Importance Is the detection of the movement of steps during the growth or evaporation of a crystal. From the velocity of a step fundamental quantities for the molecular processes can be determined, e.g. the mean free diffusion path of molecules.


Methodology ◽  
2012 ◽  
Vol 8 (1) ◽  
pp. 23-38 ◽  
Author(s):  
Manuel C. Voelkle ◽  
Patrick E. McKnight

The use of latent curve models (LCMs) has increased almost exponentially during the last decade. Oftentimes, researchers regard LCM as a “new” method to analyze change with little attention paid to the fact that the technique was originally introduced as an “alternative to standard repeated measures ANOVA and first-order auto-regressive methods” (Meredith & Tisak, 1990, p. 107). In the first part of the paper, this close relationship is reviewed, and it is demonstrated how “traditional” methods, such as the repeated measures ANOVA, and MANOVA, can be formulated as LCMs. Given that latent curve modeling is essentially a large-sample technique, compared to “traditional” finite-sample approaches, the second part of the paper addresses the question to what degree the more flexible LCMs can actually replace some of the older tests by means of a Monte-Carlo simulation. In addition, a structural equation modeling alternative to Mauchly’s (1940) test of sphericity is explored. Although “traditional” methods may be expressed as special cases of more general LCMs, we found the equivalence holds only asymptotically. For practical purposes, however, no approach always outperformed the other alternatives in terms of power and type I error, so the best method to be used depends on the situation. We provide detailed recommendations of when to use which method.


KYAMC Journal ◽  
2019 ◽  
Vol 10 (2) ◽  
pp. 122-125
Author(s):  
Ashraf Uddin Mallik ◽  
Mostafizur Rahman ◽  
Fatema Bagum ◽  
Uttam Karmaker ◽  
Baikali Ferdous ◽  
...  

Penile fracture is an uncommon urological emergency, especially in Bangladesh. The other name is traumatic rupture of the tunica albuginea and corpora cavernosa in the erect penis. It occurs when an erect penis face to buckle under the pressure of a blunt sexual trauma. Patient gives the typical history of immediate detumescence, severe pain, swelling and eggplant deformity of the penile shaft due to penile injury. Immediate surgical exploration and repair of corpora Cavernosa with tunica albugenia is the most effective treatment modality. In normal cases diagnosis is made from history, physical examination alone. In some special cases ultrasonogram, radiological images, including retrograde urethrography or cavernosography are mandatory for proper diagnosis. KYAMC Journal Vol. 10, No.-2, July 2019, Page 122-125


Sign in / Sign up

Export Citation Format

Share Document