OpenRaiser/Intern-Atlas huggingface dataset:
Enabling Adaptive Grid Scheduling and Resource Management
Venue: arXiv cs.DC 2007
Year: 2007

Wider adoption of the Grid concept has led to an increasing amount of federated computational, storage and visualisation resources being available to scientists and researchers. Distributed and heterogeneous nature of these resources renders most of the legacy cluster monitoring and management approaches inappropriate, and poses new challenges in workflow scheduling on such systems. Effective resource utilisation monitoring and highly granular yet adaptive measurements are prerequisites for a more efficient Grid scheduler. We present a suite of measurement applications able to monitor per-process resource utilisation, and a customisable tool for emulating observed utilisation models. We also outline our future work on a predictive and probabilistic Grid scheduler. The research is undertaken as part of UK e-Science EPSRC sponsored project SO-GRM (Self-Organising Grid Resource Management) in cooperation with BT.
Singular Curves in the Joint Space and Cusp Points of 3-RPR parallel manipulators
Venue: arXiv cs.RO 2007
Year: 2007

This paper investigates the singular curves in the joint space of a family of planar parallel manipulators. It focuses on special points, referred to as cusp points, which may appear on these curves. Cusp points play an important role in the kinematic behavior of parallel manipulators since they make possible a nonsingular change of assembly mode. The purpose of this study is twofold. First, it exposes a method to compute joint space singular curves of 3-RPR planar parallel manipulators. Second, it presents an algorithm for detecting and computing all cusp points in the joint space of these same manipulators.
Amélioration des Performances des Systèmes Automatiques de Reconnaissance de la Parole pour la Parole Non Native
Venue: arXiv cs.CL 2007
Year: 2007

In this article, we present an approach for non native automatic speech recognition (ASR). We propose two methods to adapt existing ASR systems to the non-native accents. The first method is based on the modification of acoustic models through integration of acoustic models from the mother tong. The phonemes of the target language are pronounced in a similar manner to the native language of speakers. We propose to combine the models of confused phonemes so that the ASR system could recognize both concurrent pronounciations. The second method we propose is a refinment of the pronounciation error detection through the introduction of graphemic constraints. Indeed, non native speakers may rely on the writing of words in their uttering. Thus, the pronounctiation errors might depend on the characters composing the words. The average error rate reduction that we observed is (22.5%) relative for the sentence error rate, and 34.5% (relative) in word error rate.
Data Structures for Mergeable Trees
Venue: arXiv cs.DS 2007
Year: 2007

Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant requires merging two paths in a single operation. In contrast to the standard problem, in which only one tree arc changes at a time, a single merge operation can change many arcs. In spite of this, we develop a data structure that supports merges on an n-node forest in O(log^2 n) amortized time and all other standard tree operations in O(log n) time (amortized, worst-case, or randomized depending on the underlying data structure). For the special case that occurs in the motivating application, in which arbitrary arc deletions (cuts) are not allowed, we give a data structure with an O(log n) time bound per operation. This is asymptotically optimal under certain assumptions. For the even-more special case in which both cuts and parent queries are disallowed, we give an alternative O(log n)-time solution that uses standard dynamic trees as a black box. This solution also applies to the motivating application. Our methods use previous work on dynamic trees in various ways, but the analysis of each algorithm requires novel ideas. We also investigate lower bounds for the problem under various assumptions.
A Mobile Computing Architecture for Numerical Simulation
Venue: arXiv cs.DC 2007
Year: 2007

The domain of numerical simulation is a place where the parallelization of numerical code is common. The definition of a numerical context means the configuration of resources such as memory, processor load and communication graph, with an evolving feature: the resources availability. A feature is often missing: the adaptability. It is not predictable and the adaptable aspect is essential. Without calling into question these implementations of these codes, we create an adaptive use of these implementations. Because the execution has to be driven by the availability of main resources, the components of a numeric computation have to react when their context changes. This paper offers a new architecture, a mobile computing architecture, based on mobile agents and JavaSpace. At the end of this paper, we apply our architecture to several case studies and obtain our first results.
Two Families of Quantum Codes Derived from Cyclic Codes
Venue: arXiv cs.IT 2007
Year: 2007

We characterize the affine-invariant maximal extended cyclic codes. Then by the CSS construction, we derive from these codes a family of pure quantum codes. Also for ordnq even, a new family of degenerate quantum stabilizer codes is derived from the classical duadic codes. This answer an open problem asked by Aly et al.
Bi-capacities -- Part I: definition, Möbius transform and interaction
Venue: arXiv cs.DM 2007
Year: 2007

Bi-capacities arise as a natural generalization of capacities (or fuzzy measures) in a context of decision making where underlying scales are bipolar. They are able to capture a wide variety of decision behaviours, encompassing models such as Cumulative Prospect Theory (CPT). The aim of this paper in two parts is to present the machinery behind bi-capacities, and thus remains on a rather theoretical level, although some parts are firmly rooted in decision theory, notably cooperative game theory. The present first part is devoted to the introduction of bi-capacities and the structure on which they are defined. We define the Möbius transform of bi-capacities, by just applying the well known theory of M\" obius functions as established by Rota to the particular case of bi-capacities. Then, we introduce derivatives of bi-capacities, by analogy with what was done for pseudo-Boolean functions (another view of capacities and set functions), and this is the key point to introduce the Shapley value and the interaction index for bi-capacities. This is done in a cooperative game theoretic perspective. In summary, all familiar notions used for fuzzy measures are available in this more general framework.
Guarded Hybrid Knowledge Bases
Venue: arXiv cs.LO 2007
Year: 2007

Recently, there has been a lot of interest in the integration of Description Logics and rules on the Semantic Web.We define guarded hybrid knowledge bases (or g-hybrid knowledge bases) as knowledge bases that consist of a Description Logic knowledge base and a guarded logic program, similar to the DL+log knowledge bases from (Rosati 2006). G-hybrid knowledge bases enable an integration of Description Logics and Logic Programming where, unlike in other approaches, variables in the rules of a guarded program do not need to appear in positive non-DL atoms of the body, i.e. DL atoms can act as guards as well. Decidability of satisfiability checking of g-hybrid knowledge bases is shown for the particular DL DLRO, which is close to OWL DL, by a reduction to guarded programs under the open answer set semantics. Moreover, we show 2-EXPTIME-completeness for satisfiability checking of such g-hybrid knowledge bases. Finally, we discuss advantages and disadvantages of our approach compared with DL+log knowledge bases.
Are networks with more edges easier to synchronize?
Venue: arXiv cs.NI 2007
Year: 2007

In this paper, the relationship between the network synchronizability and the edge distribution of its associated graph is investigated. First, it is shown that adding one edge to a cycle definitely decreases the network sychronizability. Then, since sometimes the synchronizability can be enhanced by changing the network structure, the question of whether the networks with more edges are easier to synchronize is addressed. It is shown by examples that the answer is negative. This reveals that generally there are redundant edges in a network, which not only make no contributions to synchronization but actually may reduce the synchronizability. Moreover, an example shows that the node betweenness centrality is not always a good indicator for the network synchronizability. Finally, some more examples are presented to illustrate how the network synchronizability varies following the addition of edges, where all the examples show that the network synchronizability globally increases but locally fluctuates as the number of added edges increases.
The Generalized Asymptotic Equipartition Property: Necessary and Sufficient Conditions
Venue: arXiv cs.IT 2007
Year: 2007

Suppose a string $X_1^n=(X_1,X_2,...,X_n)$ generated by a memoryless source $(X_n)_{n\geq 1}$ with distribution $P$ is to be compressed with distortion no greater than $D\geq 0$, using a memoryless random codebook with distribution $Q$. The compression performance is determined by the ``generalized asymptotic equipartition property'' (AEP), which states that the probability of finding a $D$-close match between $X_1^n$ and any given codeword $Y_1^n$, is approximately $2^{-n R(P,Q,D)}$, where the rate function $R(P,Q,D)$ can be expressed as an infimum of relative entropies. The main purpose here is to remove various restrictive assumptions on the validity of this result that have appeared in the recent literature. Necessary and sufficient conditions for the generalized AEP are provided in the general setting of abstract alphabets and unbounded distortion measures. All possible distortion levels $D\geq 0$ are considered; the source $(X_n)_{n\geq 1}$ can be stationary and ergodic; and the codebook distribution can have memory. Moreover, the behavior of the matching probability is precisely characterized, even when the generalized AEP is not valid. Natural characterizations of the rate function $R(P,Q,D)$ are established under equally general conditions.
Partial Reversible Gates(PRG) for Reversible BCD Arithmetic
Venue: arXiv cs.AR 2007
Year: 2007

IEEE 754r is the ongoing revision to the IEEE 754 floating point standard and a major enhancement to the standard is the addition of decimal format. Furthermore, in the recent years reversible logic has emerged as a promising computing paradigm having its applications in low power CMOS, quantum computing, nanotechnology, and optical computing. The major goal in reversible logic is to minimize the number of reversible gates and garbage outputs. Thus, this paper proposes the novel concept of partial reversible gates that will satisfy the reversibility criteria for specific cases in BCD arithmetic. The partial reversible gate is proposed to minimize the number of reversible gates and garbage outputs, while designing the reversible BCD arithmetic circuits.
Variations on Information Embedding in Multiple Access and Broadcast Channels
Venue: arXiv cs.IT 2007
Year: 2007

Information embedding (IE) is the transmission of information within a host signal subject to a distortion constraint. There are two types of embedding methods, namely irreversible IE and reversible IE, depending upon whether or not the host, as well as the message, is recovered at the decoder. In irreversible IE, only the embedded message is recovered at the decoder, and in reversible IE, both the message and the host are recovered at the decoder. This paper considers combinations of irreversible and reversible IE in multiple access channels (MAC) and physically degraded broadcast channels (BC).
Image Classification Using SVMs: One-against-One Vs One-against-All
Venue: arXiv cs.LG 2007
Year: 2007

Support Vector Machines (SVMs) are a relatively new supervised classification technique to the land cover mapping community. They have their roots in Statistical Learning Theory and have gained prominence because they are robust, accurate and are effective even when using a small training sample. By their nature SVMs are essentially binary classifiers, however, they can be adopted to handle the multiple classification tasks common in remote sensing studies. The two approaches commonly used are the One-Against-One (1A1) and One-Against-All (1AA) techniques. In this paper, these approaches are evaluated in as far as their impact and implication for land cover mapping. The main finding from this research is that whereas the 1AA technique is more predisposed to yielding unclassified and mixed pixels, the resulting classification accuracy is not significantly different from 1A1 approach. It is the authors conclusion therefore that ultimately the choice of technique adopted boils down to personal preference and the uniqueness of the dataset at hand.
IT services design to support coordination practices in the Luxembourguish AEC sector
Venue: arXiv cs.HC 2007
Year: 2007

In the Architecture Engineering and Construction sector (AEC) cooperation between actors is essential for project success. The configuration of actors' organization takes different forms like the associated coordination mechanisms. Our approach consists in analyzing these coordination mechanisms through the identification of the "base practices" realized by the actors of a construction project to cooperate. We also try with practitioners to highlight the "best practices" of cooperation. Then we suggest here two prototypes of IT services aiming to demonstrate the value added of IT to support cooperation. These prototype tools allow us to sensitize the actors through terrain experiments and then to bring inch by inch the Luxembourgish AEC sector towards electronic cooperation.
Augmented Tree-based Routing Protocol for Scalable Ad Hoc Networks
Venue: arXiv cs.NI 2007
Year: 2007

In ad hoc networks scalability is a critical requirement if these technologies have to reach their full potential. Most of the proposed routing protocols do not operate efficiently with networks of more than a few hundred nodes. In this paper, we propose an augmented tree-based address space structure and a hierarchical multi-path routing protocol, referred to as Augmented Tree-based Routing (ATR), which utilizes such a structure in order to solve the scalability problem and to gain good resilience against node failure/mobility and link congestion/instability. Simulation results and performance comparisons with existing protocols substantiate the effectiveness of the ATR.
Entity Ranking in Wikipedia
Venue: arXiv cs.IR 2007
Year: 2007

The traditional entity extraction problem lies in the ability of extracting named entities from plain text using natural language processing techniques and intensive training from large document collections. Examples of named entities include organisations, people, locations, or dates. There are many research activities involving named entities; we are interested in entity ranking in the field of information retrieval. In this paper, we describe our approach to identifying and ranking entities from the INEX Wikipedia document collection. Wikipedia offers a number of interesting features for entity identification and ranking that we first introduce. We then describe the principles and the architecture of our entity ranking system, and introduce our methodology for evaluation. Our preliminary results show that the use of categories and the link structure of Wikipedia, together with entity examples, can significantly improve retrieval effectiveness.
Approche polyedrale pour le probleme du separateur (VSP)
Venue: arXiv cs.DM 2007
Year: 2007

In an undirected connected graph G=(V,E), the vertex separator problem (VSP) asks for a partition of V into nonempty subsets A, B, C such that |C| is minimized such that there is no edge between A and B, and sizes of A and B are similar. This paper presents a polyhedral approach of the (VSP), introducing new efficient valid inequalities and providing computational tests and results.
On the Centroids of Symmetrized Bregman Divergences
Venue: arXiv cs.CG 2007
Year: 2007

In this paper, we generalize the notions of centroids and barycenters to the broad class of information-theoretic distortion measures called Bregman divergences. Bregman divergences are versatile, and unify quadratic geometric distances with various statistical entropic measures. Because Bregman divergences are typically asymmetric, we consider both the left-sided and right-sided centroids and the symmetrized centroids, and prove that all three are unique. We give closed-form solutions for the sided centroids that are generalized means, and design a provably fast and efficient approximation algorithm for the symmetrized centroid based on its exact geometric characterization that requires solely to walk on the geodesic linking the two sided centroids. We report on our generic implementation for computing entropic centers of image clusters and entropic centers of multivariate normals, and compare our results with former ad-hoc methods.
Improved Fully Dynamic Reachability Algorithm for Directed Graph
Venue: arXiv cs.DS 2007
Year: 2007

We propose a fully dynamic algorithm for maintaining reachability information in directed graphs. The proposed deterministic dynamic algorithm has an update time of $O((ins*n^{2}) + (del * (m+n*log(n))))$ where $m$ is the current number of edges, $n$ is the number of vertices in the graph, $ins$ is the number of edge insertions and $del$ is the number of edge deletions. Each query can be answered in O(1) time after each update. The proposed algorithm combines existing fully dynamic reachability algorithm with well known witness counting technique to improve efficiency of maintaining reachability information when edges are deleted. The proposed algorithm improves by a factor of $O(\frac{n^2}{m+n*log(n)})$ for edge deletion over the best existing fully dynamic algorithm for maintaining reachability information.
The annealing induced extraordinary properties of SI based ZNO film grown by RF sputtering
Venue: arXiv cs.OH 2007
Year: 2007

Pb(Zr0.52Ti0.48)O3 (PZT) thin films were in situ deposited by pulsed laser deposition (PLD) on Pt/Ti/SiO2/Si substrates using a template layer derived by sol-gel method. A 0.1-$μ$m-thick PZT layer with (111) or (100)-preferred orientation was first deposited onto Pt/Ti/SiO2/Si substrates using the sol-gel method, and than a PZT layer with thickness of 1$μ$m was in situ deposited by PLD on the above-mentioned PZT layer. The crystalline phases and the preferred orientations of the PZT films were investigated by X-ray diffraction analysis. Surface and cross-sectional morphologies were observed by scanning electron microscopy and transmission electron microscopy. The electrical properties of the films were evaluated by measuring their P-E hysteresis loops and dielectric constants. The preferred orientation of the films can be controlled using the template layer derived by the sol-gel method. The deposition temperature required to obtain the perovskite phase in this process is approximately 460 degrees C, and is significantly lower than that in the case of direct film deposition by PLD on the Pt/Ti/SiO2/Si substrates. Keywords: lead zirconate titanate (PZT), thin film, sol-gel method, laser ablation, electrical properties
Effect of Surface Finish of Substrate on Mechanical Reliability of in-48SN Solder Joints in Moems Package
Venue: arXiv cs.OH 2007
Year: 2007

Interfacial reactions and shear properties of the In-48Sn (in wt.%) ball grid array (BGA) solder joints after bonding were investigated with four different surface finishes of the substrate over an underlying Cu pad: electroplated Ni/Au (hereafter E-NG), electroless Ni/immersion Au (hereafter ENIG), immersion Ag (hereafter I-Ag) and organic solderability preservative (hereafter OSP). During bonding, continuous AuIn2, Ni3(Sn,In)4 and Cu6(Sn,In)5 intermetallic compound (IMC) layers were formed at the solder/E-NG, solder/ENIG and solder/OSP interface, respectively. The interfacial reactions between the solder and I-Ag substrate during bonding resulted in the formation of Cu6(Sn,In)5 and Cu(Sn,In)2 IMCs with a minor Ag element. The In-48Sn/I-Ag solder joint showed the best shear properties among the four solder joints after bonding, whereas the solder/ENIG solder joint exhibited the weakest mechanical integrity.
Macro and Micro Scale Electromagnetic Kinetic Energy Harvesting Generators
Venue: arXiv cs.OH 2007
Year: 2007

This paper is concerned with generators that harvest electrical energy from the kinetic energy present in the sensor nodes environment. These generators have the potential to replace or augment battery power which has a limited lifetime and requires periodic replacement which limits the placement and application of the sensor node.
The Design and Fabrication of Platform Device for Dna Amplification
Venue: arXiv cs.OH 2007
Year: 2007

Thermalcycler were extensively used machine for amplify DNA sample. One of the major problems in the working time was that it spent most of time for cooling and heating. In order to improve the efficient, this study presented a novel method for amplify DNA sample. For this concept, the DNA sample in the silicon chamber which was pushed by a beam through three temperature regions around a center and then the DNA segments could be amplified rapidly after 30 cycles. The polymerase chain reaction platform was composed of thin-film heaters, copper plates, DC powers, and temperature controllers. The photolithography and bulk etching technologies were utilized to construct the thin-film heater and DNA reaction chambers. Finally, 1 pound gL 100bp DNA segment of E. coli K12 was amplified successfully within 36 minutes on this PCR platform.
Design and Modeling of a Mems-Based Valveless Pump Driven by an Electromagnetic Force
Venue: arXiv cs.OH 2007
Year: 2007

A novel valveless micro impedance pump is proposed and analyzed in this study.
Miniaturized Fluorescence Excitation Platform with Optical Fiber for Bio-Detection Chips
Venue: arXiv cs.OH 2007
Year: 2007

This paper presents a new research study on the platform fabrication of fluorescence bio-detection chip with an optical fiber transmission. Anisotropic wet etching on (100) silicon wafers to fabrication V-groove for optical fiber alignment and micro-mirror were included. Combing with anodic bonding technique to adhere glass, silicon structure and optical fiber for a fluorescence excitation platform was completed. In this study, the etching solution 40% KOH was used to study the parameters effect. The results show that working temperature is the main parameter to significantly effect the etch rate. The anisotropic etching resulted 54.7 degrees reflective mirrors and its reflectivity for optical beam were also examined. The surface roughness of the micro-mirror is Ra 4.1 nm measured using AFM, it provides excellent optical reflection. The incident light and beam profiles were also examined for further study. This study can show this micro-platform adaptable for fluorescence bio-detection.