ppxscal/embedding_network huggingface dataset:
Markov incremental constructions
Authors: Bernard Chazelle, Wolfgang Johann Heinrich Mulzer
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

A classic result asserts that many geometric structures can be constructed optimally by successively inserting their constituent parts in random order. These randomized incremental constructions (RICs) still work with imperfect randomness: the dynamic operations need only be "locally" random. Much attention has been given recently to inputs generated by Markov sources. These are particularly interesting to study in the framework of RICs, because Markov chains provide highly nonlocal randomness, which incapacitates virtually all known RIC technology. We generalize Mulmuley's theory of Θ-series and prove that Markov incremental constructions with bounded spectral gap are optimal within polylog factors for trapezoidal maps, segment intersections,and convex hulls in any fixed dimension. The main contribution of this work is threefold: (i)extending the theory of abstract configuration spaces to the Markov setting; (ii)proving Clarkson-Shor type bounds for this new model; (iii)applying the results to classical geometric problems. We hope that this work will pioneer a new approach to average-case analysis in computational geometry.
The list colouring constants
Authors: Bruce Reed
Venue: Journal of Graph Theory (1999)

We present a conjecture concerning list colourings and prove a weakened form of it. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 31: 149&ndash;153, 1999
An RKHS for multi-view learning and manifold co-regularization
Authors: Vikas Sindhwani, David S. Rosenberg
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Inspired by co-training, many multi-view semi-supervised kernel methods implement the following idea: find a function in each of multiple Reproducing Kernel Hilbert Spaces (RKHSs) such that (a) the chosen functions make similar predictions on unlabeled examples, and (b) the average prediction given by the chosen functions performs well on labeled examples. In this paper, we construct a single RKHS with a data-dependent "co-regularization" norm that reduces these approaches to standard supervised learning. The reproducing kernel for this RKHS can be explicitly derived and plugged into any kernel method, greatly extending the theoretical and algorithmic scope of coregularization. In particular, with this development, the Rademacher complexity bound for co-regularization given in (Rosenberg & Bartlett, 2007) follows easily from wellknown results. Furthermore, more refined bounds given by localized Rademacher complexity can also be easily applied. We propose a co-regularization based algorithmic alternative to manifold regularization (Belkin et al., 2006; Sindhwani et al., 2005a) that leads to major empirical improvements on semi-supervised tasks. Unlike the recently proposed transductive approach of (Yu et al., 2008), our RKHS formulation is truly semi-supervised and naturally extends to unseen test data.
Advanced tungsten plug process for beyond nanometer technology
Authors: Tuung Luoh, Chin-Ta Su, Ta-Hung Yang, Kuang-Chao Chen, Chih-Yuan Lu
Venue: Microelectronic Engineering (2008)

This investigation elucidates various tungsten (W) nucleation layers in different W-plug fill processes. Four W-plug nucleation layers are evaluated. They involve an atomic layer deposition (ALD) W nucleation with SiH"4-base sequential nucleation layers, an ALD W nucleation with B"2H"6-base sequential nucleation layers, a conventional W chemical vapor deposition (CVD) nucleation layer, and a pulsed nucleation layer, respectively. Bulk deposition includes high pressures of 300Torr and conventionally 90Torr with hydrogen as a reductant of WF"6. A scanning electron microscopic analysis of the ALD W nucleation layer is conducted; it is a thin, smooth and dense film, which enhances the bulk deposition grain growth to increase grain size with low resistivity. Electrical results for ALD W processes are comparable to those for conventional W process in general barrier process condition. However, as the W-plug fills process on the weak and thin metal organic chemical vapor deposited (MOCVD) TiN barrier is varied, the ALD W processes retain their original electrical resistance performance. Unlike ALD W processes, the conventional W CVD suffers from serious contact resistance opening and tail bits. Transmission electron microscope profiles reveal that the thin and dense B"2H"6-base sequential nucleation layers prevent WF"6 molecular penetration through the TiN/Ti"x interface. Additionally, various W-plug fill processes are implemented in the tungsten damascene test vehicle, and the ALD B"2H"6-base sequential nucleation layers and subsequently formed bulk deposition at 300Torr have lower resistance than under other conditions. The contact profile obtained using the transmission electron microscope reveals that the ALD B"2H"6-base W-plug has favorable fill-in capability for both 100nm and 60nm contact sizes. Their lower resistivity and thinner nucleation layer suit them in particular to implement at a contact size of 100nm and smaller. The ALD B"2H"6-base sequential nucleation layers and subsequently formed bulk deposition at 300Torr can be used in the next generation of W-plug fill process.
Automatic Patch-Based Exploit Generation is Possible: Techniques and Implications
Authors: David Brumley, Pongsin Poosankam, Dawn Song, Jiang Zheng
Venue: Proceedings of the 2008 IEEE Symposium on Security and Privacy (2008)

The automatic patch-based exploit generation problem is: given a program P and a patched version of the program P, automatically generate an exploit for the potentially unknown vulnerability present in P but fixed in P. In this paper, we propose techniques for automatic patch-based exploit generation, and show that our techniques can automatically generate exploits for 5 Microsoft programs based upon patches provided via Windows Update. Although our techniques may not work in all cases, a fundamental tenant of security is to conservatively estimate the capabilities of attackers. Thus, our results indicate that automatic patch-based exploit generation should be considered practical. One important security implication of our results is that current patch distribution schemes which stagger patch distribution over long time periods, such as Windows Update, may allow attackers who receive the patch first to compromise the significant fraction of vulnerable hosts who have not yet received the patch.
Statistical regression for efficient high-dimensional modeling of analog and mixed-signal performance variations
Authors: Xin Li, Hongzhou Liu
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

The continuous technology scaling brings about high-dimensional performance variations that cannot be easily captured by the traditional response surface modeling. In this paper we propose a new statistical regression (STAR) technique that applies a novel strategy to address this high dimensionality issue. Unlike most traditional response surface modeling techniques that solve model coefficients from over-determined linear equations, STAR determines all unknown coefficients by moment matching. As such, a large number of (e.g., 103~105) model coefficients can be extracted from a small number of (e.g., 102~103) sampling points without over-fitting. In addition, a novel recursive estimator is proposed to accurately and efficiently predict the moment values. The proposed recursive estimator is facilitated by exploiting the interaction between different moment estimators and formulating the moment estimation problem into a special form that can be iteratively solved. Several circuit examples designed in commercial CMOS processes demonstrate that STAR achieves more than 20x runtime speedup compared with the traditional response surface modeling.
DialogStudio: A workbench for data-driven spoken dialog system development and management
Authors: Sangkeun Jung, Cheongjae Lee, Seokhwan Kim, Gary Geunbae Lee
Venue: Speech Communication (2008)

Recently, data-driven speech technologies have been widely used to build speech user interfaces. However, developing and managing data-driven spoken dialog systems are laborious and time consuming tasks. Spoken dialog systems have many components and their development and management involves numerous tasks such as preparing the corpus, training, testing and integrating each component for system development and management. In addition, data annotation for natural language understanding and speech recognition is quite burdensome. This paper describes the development of a tool, DialogStudio, to support the development and management of data-driven spoken dialog systems. Desirable aspects of the data-driven spoken dialog system workbench tool are identified, and architectures and concepts are proposed that make DialogStudio efficient in data annotation and system development in a domain and methodology neutral manner. The usability of DialogStudio was validated by developing dialog systems in three different domains with two different dialog management methods. Objective evaluations of each domain show that DialogStudio is a feasible solution as a workbench for data-driven spoken dialog systems.
Multiple description video coding by coefficients ordering and interpolation
Authors: Nicola Conci, Francesco De Natale
Venue: Proceedings of the 2nd international conference on Mobile multimedia communications (2006)

A novel approach to Multiple Description Coding (MDC) of digital video is presented. In the proposed scheme, each descriptor carries a limited number of alternately selected coefficients, complemented with a sorting information, which is used at the decoder to achieve an accurate interpolation of missing coefficients. In order to achieve an efficient compression reducing the overhead, a very effective JPEG-like syntax has been introduced to encode the side information. As compared to other approaches to MDC, the proposed strategy is characterized by an extremely low computational burden, while ensuring comparable overhead and almost seamless reconstruction from a single descriptor. Current simulations and tests refer to a two-descriptors architecture, but an almost straightforward extension to three or more descriptors is also suggested.
Flow engineering for physical implementation: theory and practice
Authors: Steve Golson, Pete Churchill
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Two consultants, each with over twenty years of experience designing integrated circuits at a variety of companies large and small, are fed up with the imperfect flows typically used by their clients. Drawing on a career's worth of mistakes knowledge, they present a set of coherent engineering principles for building a better flow infrastructure.
On the Generation of Aperiodic and Periodic Necklaces via T-augmentation
Authors: T. Aaron Gulliver, Isaiah Makwakwa, Ulrich Speidel
Venue: Fundamenta Informaticae (2008)

In a recent report, Gulliver and Speidel showed that complete sets of aperiodic and - in some cases periodic - necklaces can be generated for arbitrary lengths as fixed-length subsets of variable-length T-codes. The T-codes to which they applied this observation were specifically T-codes constructed by systematic T-augmentation, that is by T-augmentation sequences in which each T-expansion parameter is 1 (simple T-augmentation) and where the T-codes A_{(p1,p2,...,pi)} at each Taugmentation level i do not contain any codewords shorter than pi (strictly minimal T-augmentation). This present paper generalizes their result to arbitrary T-codes and formalizes their earlier result as a special case of the general result.
DKA method for single variable holomorphic functions
Authors: Toshiaki Itoh
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

Durand-Kerner-Aberth (DKA) method for single variable holomorphic functions are treated. Finite series approximation of the single variable holomorphic function is used to find local roots of single variable holomorphic functions instead of algebraic equation. We can find roots of single variable holomorphic functions in wide region by continuing local solutions.
AIR 2006: First International Workshop on Adaptive Information Retrieval
Authors: Hideo Joho, Jana Urban, Robert Villa, Joemon M. Jose, C. J. van Rijsbergen
Venue: ACM SIGIR Forum (2008)

Adaptive Information Retrieval (IR) systems are designed to optimize retrieval effectiveness and user interaction in an underlying search environment. In this article, we report on a workshop held at Glasgow, UK, in October 2006. The workshop program consisted of three invited talks, four provocative presentations, and a panel discussion. In addition, 15 poster presentations enriched the workshop themes. Important pointers to further development of adaptive IR systems and their evaluation were suggested.
Characterizing unstructured overlay topologies in modern P2P file-sharing systems
Authors: Daniel Stutzbach, Reza Rejaie, Subhabrata Sen
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

In recent years, peer-to-peer (P2P) file-sharing systems have evolved to accommodate growing numbers of participating peers. In particular, new features have changed the properties of the unstructured overlay topologies formed by these peers. Little is known about the characteristics of these topologies and their dynamics in modern file-sharing applications, despite their importance. This paper presents a detailed characterization of P2P overlay topologies and their dynamics, focusing on the modern Gnutella network. We present Cruiser, a fast and accurate P2P crawler, which can capture a complete snapshot of the Gnutella network of more than one million peers in just a few minutes, and show how inaccuracy in snapshots can lead to erroneous conclusions--such as a power-law degree distribution. Leveraging recent overlay snapshots captured with Cruiser, we characterize the graph-related properties of individual overlay snapshots and overlay dynamics across slices of back-to-back snapshots. Our results reveal that while the Gnutella network has dramatically grown and changed in many ways, it still exhibits the clustering and short path lengths of a small world network. Furthermore, its overlay topology is highly resilient to random peer departure and even systematic attacks. More interestingly, overlay dynamics lead to an "onion-like" biased connectivity among peers where each peer is more likely connected to peers with higher uptime. Therefore, long-lived peers form a stable core that ensures reachability among peers despite overlay dynamics.
Improving regression testing performance using the Adaptive Resonance Theory-2A self-organising neural network architecture
Authors: Adenilso S. Simao, Rodrigo F. De Mello, Luciano J. Senger, Laurence T. Yang
Venue: International Journal of Autonomous and Adaptive Communications Systems (2008)

Regression testing applies a previously developed test case suite to new software versions. A traditional approach is the execution of all test cases, although, this may be time consuming and, sometimes, not necessary as the source code modification may affect only a test case subset. Some initiatives have addressed this issue. For instance, one of the most promising ones is the modified-based technique that selects test cases based on whether they execute the modified parts of the program. This technique is conservative, but it often selects test cases that are not relevant. This article presents an approach to select test case subsets by using an Adaptive Resonance Theory-2A self-organising neural network architecture. In this approach, test cases are summarised in feature vectors with code coverage information, which are classified by the neural network in clusters. Clusters are labelled representing each software functionality evaluated by the coverage criterion. A new software version is then analysed to determine modified points and, then, clusters, which represent the related functionalities, are chosen. The test case subset is obtained from these clusters. Experiments were conducted to evaluate the approach using feature vectors based on all-uses and -nodes code coverage information against a modification-based technique.
Automatic blemish detection for image restoration of virtual heritage environments
Authors: Yimin Yu, Duanqing Xu, Chun Chen, Yijun Yu, Lei Zhao
Venue: Proceedings of the 6th WSEAS International Conference on Signal, Speech and Image Processing (2006)

This paper proposes a novel approach for the completion of natural scenery images, which automatically detects the blemish region in the image for restoration. This approach consists of two filtering steps and uses shape information to detect the blemish region. Then, the detected regions are marked with a specified color, so that image completion is conveniently implemented in the area we detected. We demonstrate this approach with an image database containing a variety of scenery images, especially the images or frescoes of Dunhuang, which are the relics of Chinese culture and are urgently needed to be protected and restored. The experiment results show that our approach is effective when integrated with the subsequent image completion procedure.
Spline formulae for the computation of high-order Hjorth complexities
Authors: Ma Navascues, Mv Sebastian
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

The present study describes a method for the computation of Hjorth complexities of any order. The procedure is based on the interpolation of electroencephalographic signals by means of odd degree polynomial splines. This kind of functions provides an accurate approximation of both the original signal and its derivatives and is used here to find explicit quadrature formulae for even spectral moments. By using some known results about the convergence of spline functions, error bounds of the numerical algorithm are obtained. The procedure is applied to the electroencephalographic discrimination of a group of children suffering from an Attention Deficit with Hyperactivity Disorder (ADHD). This syndrome cannot be detected by mere visual inspection of the recordings and this study looks for electroencephalographic differences with the patterns of bioelectric normality.
Measurement and Analysis of "Yes and "No Responses by Auditory Stimuli Questions in Human EEG
Authors: Ssanghee Seo, Haifeng Chen, Donghee Ye, Jungtae Lee, Kyungjae Ha
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Patients with severe physical disorders but who are cognitively intact find it difficult to communicate with the outside world. Researches on the brain-computer interface (BCI) are aimed to help such patients. This study analyzes the characteristics of brainwaves when a subject thinks of a "yes" or "no" response to an auditory stimuli question. Experiment using auditory stimuli of the form of questions is performed. We discriminate between the activities of the brainwaves of the "yes" and "no" responses using the alpha power. Nineteen healthy subjects (7 females and 12 males), aged between 20 and 35 years, volunteered to participate in the experiment. In the experiment, for 14 out of 19 subjects (73.68%), the average alpha power for the "yes" response is lower than that for the "no" response. Keywords: BCI, EEG, ERP, power analysis, yes and no response
Study of a Scheduling Algorithm Based on Simple Network Coding with High Throughput and Low Delay
Authors: Yan Shi, Min Sheng
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

For satisfying the requirements of broadband wireless access networks for high throughput and low delay, a delay sensitive scheduling algorithm based on simple network coding, DSNC, is presented. With the introduction of delivery state parameter, DSNC selectively combines retransmission packets into an innovative one by only XOR operation. Not only can DSNC reach the upper band of network throughput defined by the Maximum Flow-Minimum Cut theorem, but receivers can recover original packets immediately upon successful receptions. Compared with the general network coding, DSNC is able to effectively lower the system requirements for processor speed, memory capacity and even power consumption at mobile nodes. In addition, the scheduling scheme according to packet queue delay is capable of providing better delay performance while maintaining high network throughput. The simulation results indicate that DSNC can actually reach that throughput superior limit, and make packets experience shorter end-to-end delay and less jitter than other algorithms, which makes it applicable to broadband delay sensitive services.
Development of a low cost hybrid Si/PDMS multi-layered pneumatic microvalve
Authors: Ga&#x00eb;l Thuillier, Chantal Khan Malek
Venue: Microsystem Technologies (2005)

We report on the design and fabrication of a low cost active microvalve with a soft elastomer membrane driven by pneumatic actuation. The valve was made in two separate parts, a fluidic part in biocompatible and optically transparent material (PDMS) and a robust pneumatic interface in silicon, which were assembled together. The main issue of alignment and localized selective bonding of the PDMS parts to preserve the membrane mobility, hence the valving function, is described. In this work we also investigated two types of silicon moulds for PDMS casting, made by KOH anisotropic wet etching or DRIE.
Repetitions detection on a linear array with reconfigurable pipelined bus system
Authors: David Semé, Sidney Youlou
Venue: International Journal of Parallel, Emergent and Distributed Systems (2007)

The optical bus based arrays have recently shown many applications. In this paper we use the pipelining ability of the LARPBS to solve the repetitions detection problem. We propose an algorithm that finds all kind of repetitions in a string including k-power repetitions, overlapping repetitions and non-contiguous repetitions. For a given distance, this operation is performed in O(1) communication cycle with a constant computation time processors on a O(n) processors LARPBS for a string of length n. For all the periods, it is O(n) bus cycle. No previous algorithms were known for this problem on the LARPBS.
Optimal Oblivious Path Selection on the Mesh
Authors: Costas Busch, Malik Magdon-Ismail, Jing Xi
Venue: IEEE Transactions on Computers (2008)

In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is to be independent of the traffic distribution. The quality of the paths is determined by the congestion $C$, the maximum number of paths crossing an edge, and the dilation $D$, the maximum path length. So far, the oblivious algorithms studied in the literature have focused on minimizing the congestion while ignoring the dilation. An open question is whether $C$ and $D$ can be controlled simultaneously. Here, we answer this question for the $d$-dimensional mesh. We present an oblivious algorithm for which $C$ and $D$ are both within $O(d^2)$ of optimal. The algorithm uses randomization, and we show that the number of random bits required per packet is within $O(d)$ of the minimum number of random bits required by any algorithm that obtains the same congestion. For fixed $d$, our algorithm is asymptotically optimal.