441080
An efficient model for frequency-dependent on-chip inductance
this paper, we propose an ecient table-based model for frequency-dependent on-chip inductance, and apply it to com- pute mutual inductance between random wires and loop induc- tance for cascade wires, respectively. Our inductance computa- tion achieves around 5% error when compared to the numerical solution, and matches frequency-dependent impact very well. We also apply the inductance model to generate RLC circuit models for on-chip interconnects, and present a complexity- ecient normalized RLC circuit model for multiple parallel wires. These results are extremely ecient, and can be eectively used during iterative design procedure. Further, the table-based in- ductance model has been implemented as a Web-based tool to generate inductance matrix for given random wires.
1185541
A serializability violation detector for shared-memory server programs
We aim to improve reliability of multithreaded programs by proposing a dynamic detector that detects potentially erroneous program executions and their causes. We design and evaluate a Serializability Violation Detector (SVD) that has two unique goals: (I) triggering automatic recovery from erroneous executions using backward error recovery (BER), or simply alerting users that a software error may have occurred; and (II) helping debug programs by revealing causes of error symptoms.Two properties of SVD help in achieving these goals. First, to detect only erroneous executions, SVD checks serializability of atomic regions, which are code regions that need to be executed atomically. Second, to improve usability, SVD does not require a priori annotations of atomic regions; instead, SVD approximates them using a heuristic. Experimental results on three widely-used multithreaded server programs show that SVD finds real bugs and reports modest false positives. The goal of this paper is to develop a detector suitable for (I) BER-based avoidance of erroneous program executions; and (II) alerting users as software errors occur. We argue that such a detector should have the following two properties.
7700079
On 1-Arc-regular Graphs
A graph is 1-arc-regular if its full automorphism group acts regularly on the set of its arcs. In this paper, we investigate 1-arc-regular graphs of prime valency, especially of valency 3. First, we prove that if G is a soluble group then a (G, 1)-arc-regular graph must be a Cayley graph of a subgroup of G. Next we consider trivalent Cayley graphs of a finite nonabelian simple group and obtain a sufficient condition under which one can guarantee that Cay(G, S) is 1-arc-regular. Finally, as an application of the result, we construct two infinite families of 1-arc-regular trivalent Cayley graphs with insoluble automorphism groups and, in particular, one of the families is not a Cayley graph.
14879989
On edge-transitive Cayley graphs of valency four
A characterization is given of a class of edge-transitive Cayley graphs, providing methods for constructing Cayley graphs with certain symmetry properties. Various new half-arc transitive graphs are constructed.
206570343
Vertex-Primitive Graphs of Order a Product of Two Distinct Primes
Abstract Let k and p be odd primes with k p . All vertex-primitive graphs of order kp are classified, and those which are symmetric, or are edge-transitive but not symmetric. or are not Cayley graphs are identified. In addition, a classification is given of all vertex-primitive, edge-transitive lantisymmetric) directed graphs or order kp . The classification of the vertex-primitive symmetric graphs of order kp is used by the authors and others to complete the classification of symmetric graphs or order kp . The classification of the vertex-primitive non-Cayley graphs of order kp is used by B.D. McKay and the first author in an investigation of vertex-transitive non-Cayley graphs.
16235334
Illumination-Invariant Motion Detection Using Colour Mixture Models
This paper tackles the problem of robust change detection in image sequences from static cameras. Motion cues are detected using frame differencing with an adaptive background estimation modelled by a mixture of Gaussians. Illumination invariance and elimination or detection of shadows is achieved by using a colour chromaticity representation of the image data. The combination of the colourand intensity-based models results in some promising applications.
10735574
Forwarding indices of folded n-cubes
For a given connected graph G of order n, a routing R is a set of n(n - 1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forwarding index of a graph is the maximum number of paths of R passing through any vertex (resp. edge) in the graph. In this paper, the authors determine the vertex and the edge forwarding indices of a folded n-cube as (n-1)2n-1 +1-((n+l)/2) (n ⌊n+1/2⌋) and 2n-(n,⌊n+1/2⌋),respectively.