Path Sensitive Cache Analysis Using Cache Miss Paths

Cache analysis plays a very important role in obtaining precise Worst Case Execution Time (WCET) estimates of programs for real-time systems. While Abstract Interpretation based approaches are almost universally used for cache analysis, they fail to take advantage of its unique requirement: it is not necessary to find the guaranteed cache behavior that holds across all executions of a program. We only need the cache behavior along one particular program path, which is the path with the maximum execution time. In this work, we introduce the concept of cache miss paths, which allows us to use the worst-case path information to improve the precision of AI-based cache analysis. We use Abstract Interpretation to determine the cache miss paths, and then integrate them in the IPET formulation. An added advantage is that this further allows us to use infeasible path information for cache analysis. Experimentally, our approach gives more precise WCETs as compared to AI-based cache analysis, and we also provide techniques to trade-off analysis time with precision to provide scalability.

ELISA for the detection of venoms from four medically important snakes of India

A double antibody sandwich enzyme linked immunosorbent assay (ELISA) was developed to detect Echis carinatus venom in various organs (brain, heart, lungs, liver, spleen and kidneys) as well as tissue at the site of injection of mice, at various time intervals (1, 6, 12, 18, 24 h and 12 h intervals up to 72 h) after death. The assay could detect E. carinatus venom levels up to 2.5 ng/ml of tissue homogenate and the venom was detected up to 72 h after death. A highly sensitive and species-specific avidin-biotin microtitre ELISA was also developed to detect venoms of four medically important Indian snakes (Bungarus caeruleus, Naja naja, E. carinatus and Daboia russelli russelli) in autopsy specimens of human victims of snake bite. The assay could detect venom levels as low as 100 pg/ml of tissue homogenate. Venoms were detected in brain, heart, lungs, liver, spleen, kidneys, tissue at the bite area and postmortem blood. In all 12 human victim cadavers tested the culprit species were identified. As observed in mice, tissue at the site of bite area showed the highest concentration of venom and the brain showed the least. Moderate amounts of venoms were found in liver, spleen, kidneys, heart and lungs. Development of a simple, rapid and species-specific diagnostic kit based on this ELISA technique useful to clinicians is discussed.

NMR spectra of oriented biologically important molecules - The structure of and the internal rotation in N,N'-dimethyluracil

From the proton NMR spectra of Nfl-dimethyluracil oriented in two different nematic solvents, the internal rotation of the methyl groups about the N-C bonds is studied. It has been observed that the preferred conformation of the methyl group having one carbonyl in the vicinity is the one where a C-H bond is in the ring plane pointing toward the carbonyl group. The results are not sensitive to the mode of rotation of the other methyl group. These data are interpreted in terms of the bond polarizations.

Counterclockwise exhumation of a hot orogen: The Paleoproterozoic ultrahigh-temperature granulites in the North China Craton

Regional metamorphic belts provide important constraints on the plate tectonic architecture of orogens. We report here a detailed petrologic examination of the sapphirine-bearing ultra-high temperature (UHT) granulites from the Jining Complex within the Khondalite Belt of the North China Craton (NCC). These granulites carry diagnostic UHT assemblages and their microstructures provide robust evidence to trace the prograde, peak and retrograde metamorphic evolution. The P–T conditions of the granulites estimated from XMgGrt(Mg/Fe + Mg) − XMgSpr isopleth calculations indicate temperature above 970 °C and pressures close to 7 kbar. We present phase diagrams based on thermodynamic computations to evaluate the mineral assemblages and microstructures and trace the metamorphic trajectory of the rocks. The evolution from Spl–Qtz–Ilm–Crd–Grt–Sil to Spr–Qtz–Crd–Opx–Ilm marks the prograde stage. The Spl–Qtz assemblage appears on the low-pressure side of the P–T space with Spr–Qtz stable at the high-pressure side, possibly representing an increase in pressure corresponding to compression. The spectacular development of sapphirine rims around spinel enclosed in quartz supports this inference. An evaluation of the key UHT assemblages based on model proportion calculation suggests a counterclockwise P–T path. With few exceptions, granulite-facies rocks developed along collisional metamorphic zones have generally been characterized by clockwise exhumation trajectories. Recent evaluation of the P–T paths of metamorphic rocks developed within collisional orogens indicates that in many cases the exhumation trajectories follow the model subduction geotherm, in accordance with a tectonic model in which the metamorphic rocks are subducted and exhumed along a plate boundary. The timing of UHT metamorphism in the NCC (c. 1.92 Ga) coincides with the assembly of the NCC within the Paleoproterozoic Columbia supercontinent, a process that would have involved subduction of passive margins sediments and closure of the intervening ocean. Thus, the counterclockwise P–T path obtained in this study correlates well with a tectonic model involving subduction and final collisional suturing, with the UHT granulites representing the core of the hot or ultra-hot orogen developed during Columbia amalgamation.

Multipath Dissemination in Regular Mesh Topologies

Mesh topologies are important for large-scale peer-to-peer systems that use low-power transceivers. The Quality of Service (QoS) in such systems is known to decrease as the scale increases. We present a scalable approach for dissemination that exploits all the shortest paths between a pair of nodes and improves the QoS. Despite th presence of multiple shortest paths in a system, we show that these paths cannot be exploited by spreading the messages over the paths in a simple round-robin manner; nodes along one of these paths will always handle more messages than the nodes along the other paths. We characterize the set of shortest paths between a pair of nodes in regular mesh topologies and derive rules, using this characterization, to effectively spread the messages over all the available paths. These rules ensure that all the nodes that are at the same distance from the source handle roughly the same number of messages. By modeling the multihop propagation in the mesh topology as a multistage queuing network, we present simulation results from a variety of scenarios that include link failures and propagation irregularities to reflect real-world characteristics. Our method achieves improved QoS in all these scenarios.

Nuclear Magnetic-Resonance Spectra Of Oriented Biologically Important Molecules - The Structure Of And The Internal-Rotation In N,N-Dimethyluracil

From the proton NMR spectra of Nfl-dimethyluracil oriented in two different nematic solvents, the internal rotation of the methyl groups about the N-C bonds is studied. It has been observed that the preferred conformation of the methyl group having one carbonyl in the vicinity is the one where a C-H bond is in the ring plane pointing toward the carbonyl group. The results are not sensitive to the mode of rotation of the other methyl group. These data are interpreted in terms of the bond polarizations.

Substrate specificity plays an important role in uncoupling the catalytic and scaffolding activities of rat testis DNA topoisomerase IIalpha

Topoisomerase II (topo II) is a dyadic enzyme found in all eukaryotic cells. Topo II is involved in a number of cellular processes related to DNA metabolism, including DNA replication, recombination and the maintenance of genomic stability. We discovered a correlation between the development of postnatal testis and increased binding of topo IIalpha to the chromatin fraction. We used this observation to characterize DNA-binding specificity and catalytic properties of purified testis topo IIalpha. The results indicate that topo IIalpha binds a substrate containing the preferred site with greater affinity and, consequently, catalyzes the conversion of form I to form IV DNA more efficiently in contrast to substrates lacking such a site. Interestingly, topo IIalpha displayed high-affinity and cooperativity in binding to the scaffold associated region. In contrast to the preferred site, however, high-affinity binding of topo IIalpha to the scaffold-associated region failed to result in enhanced catalytic activity. Intriguingly, competition assays involving scaffold-associated region revealed an additional DNA-binding site within the dyadic topo IIalpha. These results implicate a dual role for topo IIalpha in vivo consistent with the notion that its sequestration to the chromatin might play a role in chromosome condensation and decondensation during spermatogenesis.

Microscopic Frictional Response of Sodium Oleate Self-Assembled on Steel

The article peruses the frictional response of an important metal working lubricant additive, sodium oleate. Frictional force microscopy is used to track the response of molecules self-assembled on a steel substrate of 3–4 nm roughness at 0% relative humidity. The friction-normal load characteristic emerges as bell-shaped, where the peak friction and normal load at peak friction are both sensitive to substrate roughness. The frictional response at loads lower than that associated with the peak friction is path reversible while at higher loads the loading and unloading paths are different. We suggest that a new low-friction interface material is created when the normal loads are high.

Profiling k-Iteration Paths : A Generalization of the Ball-Larus Profiling Algorithm

The Ball-Larus path-profiling algorithm is an efficient technique to collect acyclic path frequencies of a program. However, longer paths -those extending across loop iterations - describe the runtime behaviour of programs better. We generalize the Ball-Larus profiling algorithm for profiling k-iteration paths - paths that can span up to to k iterations of a loop. We show that it is possible to number suchk-iteration paths perfectly, thus allowing for an efficient profiling algorithm for such longer paths. We also describe a scheme for mixed-mode profiling: profiling different parts of a procedure with different path lengths. Experimental results show that k-iteration profiling is realistic.

Voting Paths

We consider a variant of the popular matching problem here. The input instance is a bipartite graph $G=(\mathcal{A}\cup\mathcal{P},E)$, where vertices in $\mathcal{A}$ are called applicants and vertices in $\mathcal{P}$ are called posts. Each applicant ranks a subset of posts in an order of preference, possibly involving ties. A matching $M$ is popular if there is no other matching $M'$ such that the number of applicants who prefer their partners in $M'$ to $M$ exceeds the number of applicants who prefer their partners in $M$ to $M'$. However, the “more popular than” relation is not transitive; hence this relation is not a partial order, and thus there need not be a maximal element here. Indeed, there are simple instances that do not admit popular matchings. The questions of whether an input instance $G$ admits a popular matching and how to compute one if it exists were studied earlier by Abraham et al. Here we study reachability questions among matchings in $G$, assuming that $G=(\mathcal{A}\cup\mathcal{P},E)$ admits a popular matching. A matching $M_k$ is reachable from $M_0$ if there is a sequence of matchings $\langle M_0,M_1,\dots,M_k\rangle$ such that each matching is more popular than its predecessor. Such a sequence is called a length-$k$ voting path from $M_0$ to $M_k$. We show an interesting property of reachability among matchings in $G$: there is always a voting path of length at most 2 from any matching to some popular matching. Given a bipartite graph $G=(\mathcal{A}\cup\mathcal{P},E)$ with $n$ vertices and $m$ edges and any matching $M_0$ in $G$, we give an $O(m\sqrt{n})$ algorithm to compute a shortest-length voting path from $M_0$ to a popular matching; when preference lists are strictly ordered, we have an $O(m+n)$ algorithm. This problem has applications in dynamic matching markets, where applicants and posts can enter and leave the market, and applicants can also change their preferences arbitrarily. After any change, the current matching may no longer be popular, in which case we are required to update it. However, our model demands that we switch from one matching to another only if there is consensus among the applicants to agree to the switch. Hence we need to update via a voting path that ends in a popular matching. Thus our algorithm has applications here.

Max-Coloring Paths: Tight Bounds and Extensions

The max-coloring problem is to compute a legal coloring of the vertices of a graph G = (V, E) with a non-negative weight function w on V such that Sigma(k)(i=1) max(v epsilon Ci) w(v(i)) is minimized, where C-1, ... , C-k are the various color classes. Max-coloring general graphs is as hard as the classical vertex coloring problem, a special case where vertices have unit weight. In fact, in some cases it can even be harder: for example, no polynomial time algorithm is known for max-coloring trees. In this paper we consider the problem of max-coloring paths and its generalization, max-coloring abroad class of trees and show it can be solved in time O(vertical bar V vertical bar+time for sorting the vertex weights). When vertex weights belong to R, we show a matching lower bound of Omega(vertical bar V vertical bar log vertical bar V vertical bar) in the algebraic computation tree model.

Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs

Let G - (V, E) be a weighted undirected graph having nonnegative edge weights. An estimate (delta) over cap (u, v) of the actual distance d( u, v) between u, v is an element of V is said to be of stretch t if and only if delta(u, v) <= (delta) over cap (u, v) <= t . delta(u, v). Computing all-pairs small stretch distances efficiently ( both in terms of time and space) is a well-studied problem in graph algorithms. We present a simple, novel, and generic scheme for all-pairs approximate shortest paths. Using this scheme and some new ideas and tools, we design faster algorithms for all-pairs t-stretch distances for a whole range of stretch t, and we also answer an open question posed by Thorup and Zwick in their seminal paper [J. ACM, 52 (2005), pp. 1-24].

Interaction Energy Based Protein Structure Networks

The three dimensional structure of a protein is formed and maintained by the noncovalent interactions among the amino acid residues of the polypeptide chain These interactions can be represented collectively in the form of a network So far such networks have been investigated by considering the connections based on distances between the amino acid residues Here we present a method of constructing the structure network based on interaction energies among the amino acid residues in the protein We have investigated the properties of such protein energy based networks (PENs) and have shown correlations to protein structural features such as the clusters of residues involved in stability formation of secondary and super secondary structural units Further we demonstrate that the analysis of PENs in terms of parameters such as hubs and shortest paths can provide a variety of biologically important information such as the residues crucial for stabilizing the folded units and the paths of communication between distal residues in the protein Finally the energy regimes for different levels of stabilization in the protein structure have clearly emerged from the PEN analysis

Covalent attachment of two important dicopper(II) systems in a one-dimensional polymeric chain: An x-ray structure of [Cu2(en)2(OH)2·Cu2(O2CMe)4](PF6)2·0.5EtOH]α showing the shortest Cucdots, three dots, centeredCu Distance in the tetraacetato core

Reaction of Cu2(O2CMe)4(H2O)2 with 1,2-diaminoethane(en) in ethanol, followed by the addition of NH4PF6, led to the formation of a covalently linked 1D polymeric copper(II) title complex showing alternating [Cu2(en)2(OH)22+] and [Cu2(O2CMe)4] units in the chain and the shortest Cucdots, three dots, centeredCu separation of 2.558(2) Å in the tetraacetato core.

Important role of the amino acid attached to tRNA in formylation and in initiation of protein synthesis in Escherichia coli

In attempts to convert an elongator tRNA to an initiator tRNA, we previously generated a mutant elongator methionine tRNA carrying an anticodon sequence change from CAU to CUA along with the two features important for activity of Escherichia coli initiator tRNA in initiation. This mutant tRNA (Mi:2 tRNA) was active in initiation in vivo but only when aminoacylated with methionine by overproduction of methionyl-tRNA synthetase. Here we show that the Mi:2 tRNA is normally aminoacylated in vivo with lysine and that the tRNA aminoacylated with lysine is a very poor substrate for formylation compared with the same tRNA aminoacylated with methionine. By introducing further changes at base pairs 4:69 and 5:68 in the acceptor stem of the Mi:2 tRNA to those found in the E. coli initiator tRNA, we show that change of the U4:A69 base pair to G4:C69 and overproduction of lysyl-tRNA synthetase and methionyl-tRNA transformylase results in partial formylation of the mutant tRNA and activity of the formyllysyl-tRNAs in initiation of protein synthesis. Thus, the G4:C69 base pair contributes toward formylation of the tRNA and protein synthesis in E. coli can be initiated with formyllysine. We also discuss the implications of these and other results on recognition of tRNAs by E. coli lysyl-tRNA synthetase and on competition in cells among aminoacyl-tRNA synthetases.