ppxscal/embedding_network huggingface dataset:
Managing Priorities in Atomic Multicast Protocols
Authors: Emili Miedes, Francesc D. Muñoz-Escoí
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Group communication and atomic multicast (i.e., total order multicast) topics have been studied for more than two decades from both a theoretical and a practical point of view. Most of this work is concerned about the classical definition of total order (informally, all the messages are received in the same order). However, in some cases additional guarantees are needed, like priority-based delivery, which allows a user application to prioritize the sending and delivery of certain messages. In this paper, we present several techniques to modify an existing total order protocol to take into account message priorities and show how existing total order algorithms can be modified according to these techniques.
Crf-based authors' name tagging for scanned documents
Authors: Manabu Ohta, Atsuhiro Takasu
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

Authors' names are a critical bibliographic element when searching or browsing academic articles stored in digital libraries. Therefore, those creating metadata for digital libraries would appreciate an automatic method to extract such bibliographic data from printed documents. In this paper, we describe an automatic author name tagger for academic articles scanned with optical character recognition (OCR) mark-up. The method uses conditional random fields (CRF) for labeling the unsegmented character strings in authors' blocks as those of either an author or a delimiter. We applied the tagger to Japanese academic articles. The results of the experiments showed that it correctly labeled more than 99% of the author name strings, which compares favorably with the under 96% correct rate of our previous tagger based on a hidden Markov model (HMM).
Process Variability Analysis in DSM Through Statistical Simulations and its Implications to Design Methodologies
Authors: Srinivasa R. STG, Jandhyala Srivatsava, Narahari Tondamuthuru R
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

Integrated circuit manufacturability in DSM is directly dependent on how well the manufacturing variations are accounted for during the design of circuits. This paper reviews the effect of various process variations in DSM especially systematic and random variations in three process generations 90nm, 65nm & 45nm by doing SPICE simulation and analysis to look at the derating factors depending on the sensitivity to variations. Few individual standard cells are studied as a part of this exercise to see the effect of variation on their delays. Random variations are becoming a significant portion of the overall variatons at 45nm and below. The results suggests the need for Selective, Location based and variation aware Analysis (SLVA) for the designs going forward.
SpotSigs: robust and efficient near duplicate detection in large web collections
Authors: Martin Theobald, Jonathan Siddharth, Andreas Paepcke
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Motivated by our work with political scientists who need to manually analyze large Web archives of news sites, we present SpotSigs, a new algorithm for extracting and matching signatures for near duplicate detection in large Web crawls. Our spot signatures are designed to favor natural-language portions of Web pages over advertisements and navigational bars. The contributions of SpotSigs are twofold: 1) by combining stopword antecedents with short chains of adjacent content terms, we create robust document signatures with a natural ability to filter out noisy components of Web pages that would otherwise distract pure n-gram-based approaches such as Shingling; 2) we provide an exact and efficient, self-tuning matching algorithm that exploits a novel combination of collection partitioning and inverted index pruning for high-dimensional similarity search. Experiments confirm an increase in combined precision and recall of more than 24 percent over state-of-the-art approaches such as Shingling or I-Match and up to a factor of 3 faster execution times than Locality Sensitive Hashing (LSH), over a demonstrative "Gold Set" of manually assessed near-duplicate news articles as well as the TREC WT10g Web collection.
Fault Effects in FlexRay-Based Networks with Hybrid Topology
Authors: Mehdi Dehbashi, Vahid Lari, Seyed Ghassem Miremadi, Mohammad Shokrollah-Shirazi
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

This paper investigates fault effects and error propagation in a FlexRay-based network with hybrid topology that includes a bus subnetwork and a star subnetwork. The investigation is based on about 43500 bit-flip fault injection inside different parts of the FlexRay communication controller. To do this, a FlexRay communication controller is modeled by Verilog HDL at the behavioral level. Then, this controller is exploited to setup a FlexRay-based network composed of eight nodes (four nodes in the bus subnetwork and four nodes in the star subnetwork). The faults are injected in a node of the bus subnetwork and a node of the star subnetwork of the hybrid network. Then, the faults resulting in the three kinds of errors, namely, content errors, syntax errors and boundary violation errors are characterized. The results of fault injection show that boundary violation errors and content errors are negligibly propagated to the star subnetwork. And syntax errors propagation is almost equal in the both bus and star subnetworks. Totally, the percentage of errors propagation in the bus subnetwork is more than the star subnetwork.
Intelligent support of the preprocessing stage of engineering analysis using case-based reasoning
Authors: Peter Wriggers, Marina Siplivaya, Irina Joukova, Roman Slivin
Venue: Engineering with Computers (2008)

The process of engineering analysis, especially its preprocessing stage, comprises some knowledge-based tasks which influence the quality of the results greatly, require considerable level of expertise from an engineer; the support for these tasks by the contemporary CAE systems is limited. Analysis of the knowledge and reasoning involved in solving these tasks shows that the appropriate support for them by an automated system can be implemented using case-based reasoning (CBR) technology. In this paper the automated knowledge-based system for intelligent support of the preprocessing stage of engineering analysis in the contact mechanics domain is presented which employs the CBR mechanism. The case representation model is proposed which is centered on the structured qualitative model of a technical object. The model is formally represented by the Ontology Web Language Description Logics (OWL DL) ontology. Case retrieval and adaptation algorithms for this model are described which according to the initial tests perform better in the chosen domain then the known prototypes. The automated system is described and a sample problem-solving scenario from the contact mechanics domain is presented. Use of such system can potentially lower costs of engineering analysis by reducing the number of inappropriate decisions and analysis iterations and facilitate knowledge transfer from research into industry.
Adding magic to an optimising datalog compiler
Authors: Damien Sereni, Pavel Avgustinov, Oege de Moor
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

The magic-sets transformation is a useful technique for dramatically improving the performance of complex queries, but it has been observed that this transformation can also drastically reduce the performance of some queries. Successful implementations of magic in previous work require integration with the database optimiser to make appropriate decisions to guide the transformation (the sideways information passing strategy, or SIPS). This paper reports on the addition of the magic-sets transformation to a fully automatic optimising compiler from Datalog to SQL with no support from the database optimiser. We present an algorithm for making a good choice of SIPS using heuristics based on the sizes of relations. To achieve this, we define an abstract interpretation of Datalog programs to estimate the sizes of relations in the program. The effectiveness of our technique is evaluated over a substantial set of over a hundred queries, and in the context of the other optimisations performed by our compiler. It is shown that using the SIPS chosen by our algorithm, query performance is often significantly improved, as expected, but more importantly performance is never significantly degraded on queries that cannot benefit from magic.
Noncentral matrix quadratic forms of the skew elliptical variables
Authors: B. Q. Fang
Venue: Journal of Multivariate Analysis (2008)

In this paper, the noncentral matrix quadratic forms of the skew elliptical variables are studied. A family of the matrix variate noncentral generalized Dirichlet distributions is introduced as the extension of the noncentral Wishart distributions, the Dirichlet distributions and the noncentral generalized Dirichlet distributions. Main distributional properties are investigated. These include probability density and closure property under linear transformation and marginalization, the joint distribution of the sub-matrices of the matrix quadratic forms in the skew elliptical variables and the moment generating functions and Bartlett's decomposition of the matrix quadratic forms in the skew normal variables. Two versions of the noncentral Cochran's Theorem for the matrix variate skew normal distributions are obtained, providing sufficient and necessary conditions for the quadratic forms in the skew normal variables to have the matrix variate noncentral generalized Dirichlet distributions. Applications include the properties of the least squares estimation in multivariate linear model and the robustness property of the Wilk's likelihood ratio statistic in the family of the matrix variate skew elliptical distributions.
MISR multi-angular spectral remote sensing for temperate forest mapping at 1.1-km resolution
Authors: X. Liu, M. Kafatos
Venue: International Journal of Remote Sensing (2007)

Accurate information about temperate forest distribution and extent is important to quantify the carbon sink in the northern temperate forest. While Advanced Very High Resolution Radiometer (AVHRR) and Moderate Resolution Imaging Spectroradiometer (MODIS) multi-temporal spectral information has been extensively studied for this purpose, it has not been fully studied whether Multi-angle Imaging Spectroradiometer (MISR) information is helpful for temperate forest mapping at 1.1-km resolution. This Letter addresses the potential use of 1.1-km multi-angular MISR data to improve temperate forest mapping based on a study area in eastern USA. Classification accuracy using nadir-only MISR data is compared with results derived from the combined use of some off-nadir MISR data. The results show a substantial increase in forest mapping accuracy when off-nadir spectral measurements are used.
Random access game in ad hoc networks with cooperative and noncooperative users
Authors: X. Guan, B. Yang, G. Feng, C. Long
Venue: International Journal of Systems, Control and Communications (2008)

Motivated by the fact that the exponential back-off algorithm is unfair towards nodes in the middle of networks, we propose two approaches to computing the optimal persistence probabilities in Medium Access Control based on game theory. The first is a cooperative game theoretic MAC with the objective of total payoff maximisation. By decomposing the overall problem into each user's subproblem, we solve the nonconvex random access problem in a distributed manner. The existence, uniqueness and stability of the Nash Equilibrium (NE) for the cooperative game are proved. The second is the noncooperative persistence scheme with an aim to minimise information exchanging among nodes. This formulation leads to a simple iterative scheme by which each user can arrive at a Pareto dominant NE. Simulation results illustrate the performance of these algorithms.
Authentication codes and bipartite graphs
Authors: Rongquan Feng, Lei Hu, Jin Ho Kwak
Venue: European Journal of Combinatorics (2008)

In this paper, a characterization of authentication codes in terms of bipartite graphs is given. By using such a characterization, two necessary and sufficient conditions for a minimal authentication code with perfect secrecy are derived. The probabilities of a successful impersonation and of a successful substitution attack are discussed. As a result, some (optimal) minimal authentication codes with perfect secrecy are constructed from association schemes, from finite groups or from known authentication codes no matter whether the known ones are with or without secrecy.
A domain specific interconnect for reconfigurable computing
Authors: Sanjay Rajopadhye, Gautam Gupta, Lakshminarayanan Renganarayana
Venue: ACM SIGPLAN Notices (2008)

Affine Control Loops (ACLs) occur frequently in data- and computeintensive applications. Implementing ACLs directly on dedicated hardware has the potential for spectacular performance improvement in area, time and energy. An important challenge for such direct hardware compilation of ACLs is the interconnection between the different processing elements, which may be non-local as well as dynamic. We propose a generic, reconfigurable interconnection fabric which can realize the data-path of any ACL and be dynamically reconfigured in constant time. We have applied for a patent for this technology.
An approximation to solutions of linear ODE by cubic interpolation
Authors: L. P. Lara, M. Gadella
Venue: Computers Mathematics with Applications (2008)

We present a method of integration for non-autonomous non-homogeneous systems of linear ordinary differential equation (ODE), which is based in both, the cubic polynomial segmentary interpolation and the minimal square method. This method is valid for nonhomogeneous ordinary linear second order differential equations in the neighborhood of regular and singular regular points. We illustrate the method with the Mathieu and Bessel equations and two other equations that arise in the study of quantum systems with axial symmetry, which are versions of the spheroidal wave equation.
Revision of Security Proof on f-OAEP
Authors: Jie Liu, Gongliang Chen, Jianhua Li
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

OAEP is widely accepted because of its provable security and practicability. However, there was a twist in the security proof in the random oracle model. Shoup revealed a flaw in the original security proof by Bellare and Rogaway. In this paper, a revision of the security proof is presented to fix the flaw. Furthermore, compared with some existing improved prove methods, the revised proof is applicable for the underlying trapdoor permutation being a general case.
Robust design of fuzzy logic power system stabilizer using multiobjective genetic algorithm
Authors: Manisha Dubey, Aalok Dubey, Nikos E. Mastorakis
Venue: Proceedings of the 7th WSEAS International Conference on Evolutionary Computing (2006)

Optimal multiobjective design of robust fuzzy logic power system stabilizer is presented in this paper. The fuzzy logic power system stabilizer is designed using GA. The proposed controller enhances both small and large perturbation stabilities. A multiobjective problem is formulated to optimize a set of objective functions comprising the speed deviation error subjected to small and large perturbation. The problem of selection of optimal parameters of fuzzy logic power system stabilizer is converted into an optimization problem and which is solved by genetic algorithm with the Integral of square time square error (ISTSE) based multiobjective function. Simulation results reveal the effectiveness of the proposed controller over a wide range of loading conditions under small as well as large perturbation.
Insect Population Inspired Wireless Sensor Networks: A Unified Architecture with Survival Analysis, Evolutionary Game Theory, and Hybrid Fault Models
Authors: Zhanshan (Sam) Ma, Axel W. Krings
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

We envision a wireless sensor network (WSN) as an entity analogous to a biological population with individual nodes mapping to individual organisms and the network architecture mapping to the biological population. In particular, a mobile wireless sensor network consisting of hundreds or more of microchip-driven nodes is analogous to a flying insect population in several important aspects. The notions of lifetime, space distribution and environment apply to both domains. The interactions between individuals, either insects or WSN sensors, can be captured with evolutionary game theory models, in which individuals are the players and reliability are the fitness (payoff) of the players. The evolutionary stable strategy (ESS) forms the basis of network survivability. Furthermore, we introduce hybrid fault models into the proposed architecture with the notion of "Byzantine generals playing evolutionary games"[13]. This unified architecture makes it possible to dynamically (real-time) predict reliability, survivability, and fault tolerance capability of a WSN. On the node level, we introduce survival analysis to model lifetime, reliability and survivability of WSN nodes. By adopting survival analysis, rather than standard engineering reliability theory, we try to address four critical issues: (i) replacing unrealistic constant failure rates with general stochastic models, (ii) replacing unrealistic independent failures with shared frailty models that effectively address common risks or events-related dependence, and with multi-state modeling for common events dependence, (iii) harnessing the censoring-modeling mechanisms to assess the influences of unpredictable malicious events on reliability and survivability, and (iv) addressing spatial aspects of failures with spatial survival analysis, spatial frailty.
Enabling co-located ad-hoc collaboration on shared displays
Authors: Peter Hutterer, Bruce H. Thomas
Venue: Proceedings of the ninth conference on Australasian user interface - Volume 76 (2008)

All major desktop environments are designed around the assumption of having a single system cursor and a single keyboard. Co-located multi-user interaction on a standard desktop requires users to physically hand over the devices. Existing collaboration applications require complicated and limiting setups and no collaboration application or toolkit supports ad-hoc transition from a traditional single-user desktop to a multi-user collaboration environment without restarting applications. Our Multi-Pointer X server (MPX) allows easy transition between a single-user desktop and a multi-user collaboration environment. Pointer devices and keyboards can be added and removed at any time. Independent cursors and keyboard foci for these devices allow users to interact with and type into multiple applications simultaneously. MPX is compatible with any legacy X application and resolves ambiguity in legacy APIs using the novel "ClientPointer" principle. MPX also provides new APIs for multi-user applications and thus enables fluid integration of single-user and multi-user environments.
System-level throughput analysis for process variation aware multiple voltage-frequency island designs
Authors: Siddharth Garg, Diana Marculescu
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2008)

The increasing variability in manufacturing process parameters is expected to lead to significant performance degradation in deep submicron technologies. Multiple Voltage-Frequency Island (VFI) design styles with fine-grained, process-variation aware clocking have recently been shown to possess increased immunity to manufacturing process variations. In this article, we propose a theoretical framework that allows designers to quantify the performance improvement that is to be expected if they were to migrate from a fully synchronous design to the proposed multiple VFI design style. Specifically, we provide techniques to efficiently and accurately estimate the probability distribution of the execution rate (or throughput) of both single and multiple VFI systems under the influence of manufacturing process variations. Finally, using an MPEG-2 encoder benchmark, we demonstrate how the proposed analysis framework can be used by designers to make architectural decisions such as the granularity of VFI domain partitioning based on the throughput constraints their systems are required to satisfy.
Advances in Rosetta protein structure prediction on massively parallel systems
Authors: S. Raman, B. Qian, D. Baker, R. C. Walker
Venue: IBM Journal of Research and Development (2008)

One of the key challenges in computational biology is prediction of three-dimensional protein structures from amino-acid sequences. For most proteins, the "native state" lies at the bottom of a free-energy landscape. Protein structure prediction involves varying the degrees of freedom of the protein in a constrained manner until it approaches its native state. In the Rosetta protein structure prediction protocols, a large number of independent folding trajectories are simulated, and several lowest-energy results are likely to be close to the native state. The availability of hundred-teraflop, and shortly, petaflop, computing resources is revolutionizing the approaches available for protein structure prediction. Here, we discuss issues involved in utilizing such machines efficiently with the Rosetta code, including an overview of recent results of the Critical Assessment of Techniques for Protein Structure Prediction 7 (CASP7) in which the computationally demanding structure-refinement process was run on 16 racks of the IBM Blue Gene/L™ system at the IBM T. J. Watson Research Center. We highlight recent advances in high-performance computing and discuss future development paths that make use of the next-generation petascale (>1012 floating-point operations per second) machines.
Fully dynamic cycle-equivalence in graphs
Authors: M. R. Henzinger
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

Two edges e/sub 1/ and e/sub 2/ of an undirected graph are cycle-equivalent iff all cycles that contain e/sub 1/ also contain e/sub 2/, i.e., iff e/sub 1/ and e/sub 2/ are a cut-edge pair. The cycle-equivalence classes of the control-flow graph are used in optimizing compilers to speed up existing control-flow and data-flow algorithms. While the cycle-equivalence classes can be computed in linear time, we present the first fully dynamic algorithm for maintaining the cycle-equivalence relation. In an n-node graph our data structure executes an edge insertion or deletion in O(/spl radic/n log n) time and answers the query whether two given edges are cycle-equivalent in O(log/sup 2/ n) time. We also present an algorithm for plane graphs with O(log n) update and query time and for planar graphs with O(log n) insertion time and O(log/sup 2/ n) query and deletion time. Additionally, we show a lower bound of /spl Omega/(log n/log log n) for the amortized time per operation for the dynamic cycle-equivalence problem in the cell probe model.