3,585 research outputs found
Narayanella, a new name for Narayana Subba Rao (hymenoptera : mymaridae)
No full textThe name Narayana was applied (Subba Rao, 1976) to a genus erected for the new species N. pilipes reared from the gaUs of Lagerstoemia flos reginae. Unfortunately the author overlooked the vulid and prior use of Narayana by Distant (1908). Narayana Distant was erected with rusticitatus as type-species (Issidae: Homoptera). Hence Narayana Subba Rao is a junior homonym which has to be replaced according to the rules of the International Zoological Nomenclature
Dissociation kinetics of an enzyme-inhibitor system using single-molecule force measurements
No full textEssa Mayyas, Margarida Bernardo, Lindsay Runyan, Anjum Sohail, Venkatesh Subba-Rao, Mircea Pantea, Rafael Fridman, and Peter M. Hoffman
Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits
No full textRecent work by Elmasry et al. (STACS 2015) and Asano et al. (ISAAC 2014) reconsidered classical fundamental graph algorithms focusing on improving the space complexity. Elmasry et al. gave, among others, an implementation of depth first search (DFS) of a graph on n vertices and m edges, taking O(m lg lg n) time using O(n) bits of space improving on the time bound of O(m lg n) due to Asano et al. Subsequently Banerjee et al. (COCOON 2016) gave an O(m + n) time implementation using O(m+n) bits, for DFS and its classical applications (including testing for biconnectivity, and finding cut vertices and cut edges). Recently, Kammer et al. (MFCS 2016) gave an algorithm for testing biconnectivity using O(n + min{m, n lg lg n}) bits in linear time.
In this paper, we consider O(n) bits implementations of the classical applications of DFS. These include the problem of finding cut vertices, and biconnected components, chain decomposition and st-numbering. Classical algorithms for them typically use DFS and some Omega(lg n) bits of information at each node. Our O(n)-bit implementations for these problems take O(m lg^c n lg lg n) time for some small constant c (c leq 3). Central to our implementation is a succinct representation of the DFS tree and a space efficient partitioning of the DFS tree into connected subtrees, which maybe of independent interest for space efficient graph algorithms
Collective excitations and dynamic structure factor of liquid tellurium
No full text247-252Using the
potential function and its derivatives evaluated by Rao and Venkatesh from the
experimental structure factors, the longitudinal (ωL) and transverse(ωT) phonon
frequencies have been computed through the equations of Takeno and Goda. The ωL
(k) maximum is found to occur midway between zero and the first peak of the
structure factor. The dynamic structure factor has been
calculated
in the viscoelastic approximation. In the current correlation function, the
position of the maximum of the current density at a particular k is designated
as ωm. ωm versus k has been obtained at various wave
vectors. The ωm versus k exhibits a flat portion spreading over the
three peaks of the complex structure factor of liquid Te even though ωm
(k) increases slowly with k.ωm gives a peak at nearly the same
position as ωL(k)
A Framework for In-place Graph Algorithms
No full textRead-only memory (ROM) model is a classical model of computation to study time-space tradeoffs of algorithms. A classical result on the ROM model is that any algorithm to sort n numbers using O(s) words of extra space requires Omega (n^2/s) comparisons for lg n <= s <= n/lg n and the bound has also been recently matched by an algorithm. However, if we relax the model, we do have sorting algorithms (say Heapsort) that can sort using O(n lg n) comparisons using O(lg n) bits of extra space, even keeping a permutation of the given input sequence at anytime during the algorithm.
We address similar relaxations for graph algorithms. We show that a simple natural relaxation of ROM model allows us to implement fundamental graph search methods like BFS and DFS more space efficiently than in ROM. By simply allowing elements in the adjacency list of a vertex to be permuted, we show that, on an undirected or directed connected graph G having n vertices and m edges, the vertices of G can be output in a DFS or BFS order using O(lg n) bits of extra space and O(n^3 lg n) time. Thus we obtain similar bounds for reachability and shortest path distance (both for undirected and directed graphs). With a little more (but still polynomial) time, we can also output vertices in the lex-DFS order. As reachability in directed graphs (even in DAGs) and shortest path distance (even in undirected graphs) are NL-complete, and lex-DFS is P-complete, our results show that our model is more powerful than ROM if L != P.
En route, we also introduce and develop algorithms for another relaxation of ROM where the adjacency lists of the vertices are circular lists and we can modify only the heads of the lists. Here we first show a linear time DFS implementation using n + O(lg n) bits of extra space. Improving the extra space exponentially to only O(lg n) bits, we also obtain BFS and DFS albeit with a slightly slower running time. Both the models we propose maintain the graph structure throughout the algorithm, only the order of vertices in the adjacency list changes. In sharp contrast, for BFS and DFS, to the best of our knowledge, there are no algorithms in ROM that use even O(n^{1-epsilon}) bits of extra space; in fact, implementing DFS using cn bits for c<1 has been mentioned as an open problem. Furthermore, DFS (BFS, respectively) algorithms using n+o(n) (o(n), respectively) bits of extra use Reingold's [JACM, 2008] or Barnes et al's reachability algorithm [SICOMP, 1998] and hence have high runtime. Our results can be contrasted with the recent result of Buhrman et al. [STOC, 2014] which gives an algorithm for directed st-reachability on catalytic Turing machines using O(lg n) bits with catalytic space O(n^2 lg n) and time O(n^9)
Sensor Selection for Angle of Arrival Estimation Based on the Two-Target Cramér-Rao Bound
No full textSensor selection is a useful method to help reduce data throughput, as well as computational, power, and hardware requirements, while still maintaining acceptable performance. Although minimizing the Cramér-Rao bound has been adopted previously for sparse sensing, it did not consider multiple targets and unknown source models. In this work, we propose to tackle the sensor selection problem for angle of arrival estimation using the worst-case Cramér-Rao bound of two uncorrelated sources. To do so, we cast the problem as a convex semi-definite program and retrieve the binary selection by randomized rounding. Through numerical examples related to a linear array, we illustrate the proposed method and show that it leads to the natural selection of elements at the edges plus the center of the linear array. This contrasts with the typical solutions obtained from minimizing the single-target Cramér-Rao bound.Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Signal Processing System
Sketch Studies and Lu Yen’s Harmony
No full textThis paper introduces the various types of music manuscripts and current issues in music sketch studies. It argues that the study of musical manuscripts is not simply the direct conversion of composition processes into music analysis. Nor is it limited to the function of providing a basis for choosing performance editions. Rather, it allows the researchers to weigh and ponder on many entangled issues, such as the composer's intentions, musical influences and music trends, composition habits, manuscripts chronology order, revisions to the draft, and traces of pre-composition plans. In addition, manuscripts could be situated in the network of various cultural or historical moments, and of a variety of musical styles and trends. It can be linked to a large web of associations contributing in different ways to the production of the manuscripts. Manuscripts are deeply rooted in historical processes and are essentially open text. The diversity of the twentieth century music manuscript, both in terms of musical language and medium, also raise new issues for sketch studies. Borrowing from Philip Gossett, this paper examines three areas of manuscript studies—confirmatory, suggestive, and conceptual—to ponder on the analysis of 20th century music. From this angle, the paper analyzes the manuscripts of Taiwanese composer Lu Yan. It focuses on several diagrams of integers in the composer’s sketches. In particular the paper examines how these diagrams reflect abstract conceptualization of pitch structure and harmony language, and how they are connected to his composition, “Woodwind Quintet.” These sketches of “pitch material” illustrate the profound thinking encompassing his harmony, melody and tone row and balanced relationship of sound world.Peer reviewedPrimarily in Chinese; abstract, annotations, notes, and some references in English
A Comparison of Trichordal Relations in Milton Babbitt's String Quartet No. 2 and Elliott Carter's A Symphony for Three Orchestras
No full textPeer reviewe
The Color of Music Heritage: Chinese America in American Ultra-Modern Music
No full textThis essay considers American ultra-modern music from the vantage point of Chinese America. It argues that the interiority of this racial terrain was molded by the negotiation, mimicry, and transformation necessarily attended musical activities across racial boundaries. Cowell‘s ultra-modern composition bears witness to Asian confluence in the American musical landscape at the beginning of the century, and raises the question of musical heritage. Rejecting the typical orientalist analysis and its self-other framework, this essay explores the significance of Chinatown music, and how a sonic idea that was engendered from it found expression in the dialogical space of American ultra-modern music.Peer reviewe
- …
