ppxscal/embedding_network huggingface dataset:
MIM Capacitors using amorphous high-k PrTixOy dielectrics
Authors: Ch. Wenger, R. Sorge, T. Schroeder, A. U. Mane, G. Lippert, G. Lupina, J. Dabrowski, P. Zaumseil, H.-J. Muessig
Venue: Microelectronic Engineering (2005)

Capacitor performance of amorphous PrTixOy dielectric films deposited on TiNx metal electrodes to form MIM structures with Al top electrodes is demonstrated for the first time. The PrTixOy capacitors were fabricated within the temperature budget of back end processes. Preliminary data on the composition of the dielectric layers and the interaction of water with the films was obtained by X-ray photoelectron spectroscopy (XPS). The I(V) and C(V) device characteristics are discussed.
Gesture Registration, Relaxation, and Reuse for Multi-Point Direct-Touch Surfaces
Authors: Mike Wu, Chia Shen, Kathy Ryall, Clifton Forlines, Ravin Balakrishnan
Venue: Proceedings of the First IEEE International Workshop on Horizontal Interactive Human-Computer Systems (2006)

Freehand gestural interaction with direct-touch computation surfaces has been the focus of significant research activity recently. While many interesting gestural interaction techniques have been proposed, their design has been mostly ad-hoc and has not been presented within a constructive design framework. In this paper, we develop and articulate a set of design principles for constructing - in a systematic and extensible mannermulti-hand gestures on touch surfaces that can sense multiple points and shapes, and can also accommodate conventional point-based input. To illustrate the generality of these design principles, a set of bimanual continuous gestures that embody these principles are developed and explored within a prototype tabletop publishing application. We carried out a user evaluation to assess the usability of these gestures and use the results and observations to suggest future design guidelines.
Structured Platform for Multiple Virtual Machines
Authors: ChanSung Jung, Seman Oh
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

As processors that are used in embedded systems become increasingly more powerful, a variety of functions, including multimedia, games and the proper system-operating function, are added to the systems. Despite the fact that embedded systems are becoming increasingly more powerful, system resources remain limited, and system functionalities are being developed in the form of applications running on the middleware such as virtual machines, or in the form of embedded systems' applications. An example of this is virtual machines (VM's) that are in the form of applications in embedded systems. This paper aims to design and implement a structured platform for MVM's (Multi-VM's) that enables the middleware and system applications, such as the VM's to manage the system resources and easily share the common functions amongst them.
Web Service Annotation Using Ontology Mapping
Authors: Zhang Duo, Li Juan-Zi, Xu Bin
Venue: Proceedings of the IEEE International Workshop (2005)

Addressed in this paper is the issue of semantic annotation on Web services. As the popularity of Web services increases, automated discovery and composition of relevant Web services are more and more desired. However, current Web service standards, such as WSDL, are not rich enough to fulfill these tasks, because they cannot specify the semantics in the process of discovery and composition. Thus it is necessary to describe Web services more semantically. Now, OWL is the standard ontology language, and it provides powerful features for expressing such semantics on Web services. In this paper, we describe an approach to annotate Web services with OWL ontology. We formalize the annotation as a process of translating XML schema into an ontology in OWL, mapping this temporary ontology with shared ontologies and generating a semantic description of Web Services with the mapping result.
Sauvegarde coop&eacute;rative entre pairs pour dispositifs mobiles
Authors: Ludovic Courtès, Marc-Olivier Killijian, David Powell, Matthieu Roy
Venue: Proceedings of the 2nd French-speaking conference on Mobility and ubiquity computing (2005)

We present the features of a collaborative backup service for mobile devices. This service relies on collaboration among peers in order to provide data backup and recovery. We identify the expected dependability properties for such a service. We then survey peer-to-peer collaborative backup systems described in the literature and identify mechanisms relevant to the mobile environment. We conclude on the specificities of this environment and identify future research directions.
Cognition and learning: meeting the challenge of individual differences
Authors: David H. Rose
Venue: Issue 83 (September 2005) (2005)

Recent advances in the cognitive sciences, and especially in the cognitive neurosciences, have made one thing abundantly clear -- there is no simple way to characterize, or localize, cognition. The journal Cognitive Psychology takes a typical approach to this problem; instead of directly defining cognitive psychology, the journal lists the kinds of processes that are commonly included -- memory, language processing, perception, problem solving, and thinking.
Designing Activities for Learning Software Quality Practices
Authors: Yuen Tak Yu, Pak-Lok Poon
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

This paper presents our design of the learning activities in a course on software quality practices. We describe how we strive to provide opportunities for students to gain hands-on experience on exemplar software quality practices in spite of various constraints.
Towards Grid Implementations of Metaheuristics for Hard Combinatorial Optimization Problems
Authors: Aletia P. F. Araujo, Sebastian Urrutia
Venue: Proceedings of the 17th International Symposium on Computer Architecture on High Performance Computing (2005)

Metaheuristics are approximate algorithms that are able to find very good solutions to hard combinatorial optimization problems. They do, however, offer a wide range of possibilities for implementations of effective robust parallel algorithms which run in much smaller computation times than their sequential counterparts. We present four slightly differing strategies for the parallelization of an extended GRASP with ILS heuristic for the mirrored traveling tournament problem. Computational results on widely used benchmark instances, using a varying number of processors, illustrate the effectiveness and the scalability of the different strategies. These low communication cost parallel heuristics not only find solutions faster, but also produce better quality solutions than the best known sequential algorithm.
Simulation-Based Design and Rapid Prototyping of a Parallax-Free, Orthoscopic Video See-Through Head-Mounted Display
Authors: Andrei State, Kurtis P. Keller, Henry Fuchs
Venue: Proceedings of the 4th IEEE/ACM International Symposium on Mixed and Augmented Reality (2005)

We built a video see-through head-mounted display with zero eye offset from commercial components and a mount fabricated via rapid prototyping. The orthoscopic HMD's layout was created and optimized with a software simulator. We describe simulator and HMD design, we show the HMD in use and demonstrate zero parallax.
Impacts of the Startup Behavior of Multilayered Multicast Congestion Control Protocols on the Performance of Content Delivery Protocols
Authors: Christoph NEUMANN, Vincent ROCA
Venue: Proceedings of the 10th International Workshop on Web Content Caching and Distribution (2005)

The FLUTE file delivery application (RFC 3926) and the underlying massively scalable reliable multicast protocol, ALC (RFC 3450), are used for the scalable distribution of contents in a broadcasting system having no feedback channel. When used in a routed network (like the Internet), a layered congestion control protocol is required. This paper analyzes the impacts of the startup behavior of several such protocols on the performance of multicast content delivery protocols through mathematical models. Our results show (1) that these congestion control protocols have a major impact on the download time, and (2) that the three protocols considered in this study yield significant differences.
A general regression technique for learning transductions
Authors: Corinna Cortes, Mehryar Mohri, Jason Weston
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

The problem of learning a transduction, that is a string-to-string mapping, is a common problem arising in natural language processing and computational biology. Previous methods proposed for learning such mappings are based on classification techniques. This paper presents a new and general regression technique for learning transductions and reports the results of experiments showing its effectiveness. Our transduction learning consists of two phases: the estimation of a set of regression coefficients and the computation of the pre-image corresponding to this set of coefficients. A novel and conceptually cleaner formulation of kernel dependency estimation provides a simple framework for estimating the regression coefficients, and an efficient algorithm for computing the pre-image from the regression coefficients extends the applicability of kernel dependency estimation to output sequences. We report the results of a series of experiments illustrating the application of our regression technique for learning transductions.
Learning Vector Quantization with Training Data Selection
Authors: Carlos E. Pedreira
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

In this paper, we propose a method that selects a subset of the training data points to update LVQ prototypes. The main goal is to conduct the prototypes to converge at a more convenient location, diminishing misclassification errors. The method selects an update set composed by a subset of points considered to be at the risk of being captured by another class prototype. We associate the proposed methodology to a weighted norm, instead of the Euclidean, in order to establish different levels of relevance for the input attributes. The technique was implemented on a controlled experiment and on Web available data sets.
Oblivious data hiding: a practical approach
Authors: Ali N. Akansu
Venue:  (2004)

This dissertation presents an in-depth study of oblivious data hiding with the emphasis on quantization based schemes. Three main issues are specifically addressed: (1) Theoretical and practical aspects of embedder-detector design. (2) Performance evaluation, and analysis of performance vs. complexity tradeoffs. (3) Some application specific implementations. A communications framework based on channel adaptive encoding and channel independent decoding is proposed and interpreted in terms of oblivious data hiding problem. The duality between the suggested encoding-decoding scheme and practical embedding-detection schemes are examined. With this perspective, a formal treatment of the &ldquo;processing&rdquo; employed in quantization based hiding methods is presented. In accordance with these results, the key aspects of embedder-detector design problem for practical methods are laid out, and various embedding-detection schemes are compared in terms of probability of error, normalized correlation, and hiding rate performance merits assuming AWGN attack scenarios and using mean squared error distortion measure. The performance-complexity tradeoffs available for large and small embedding signal size (availability of high bandwidth and limitation of low bandwidth) cases are examined and some novel insights are offered. A new codeword generation scheme is proposed to enhance the performance of low-bandwidth applications. Embedding-detection schemes are devised for watermarking application of data hiding, where robustness against the attacks is the main concern rather than the hiding rate or payload. In particular, cropping-resampling and lossy compression types of non-invertible attacks are considered in this dissertation work.
Studying the Fault-Detection Effectiveness of GUI Test Cases for Rapidly Evolving Software
Authors: Atif M. Memon, Qing Xie
Venue: IEEE Transactions on Software Engineering (2005)

Software is increasingly being developed/maintained by multiple, often geographically distributed developers working concurrently. Consequently, rapid-feedback-based quality assurance mechanisms such as daily builds and smoke regression tests, which help to detect and eliminate defects early during software development and maintenance, have become important. This paper addresses a major weakness of current smoke regression testing techniques, i.e., their inability to automatically (re)test graphical user interfaces (GUIs). Several contributions are made to the area of GUI smoke testing. First, the requirements for GUI smoke testing are identified and a GUI smoke test is formally defined as a specialized sequence of events. Second, a GUI smoke regression testing process called Daily Automated Regression Tester (DART) that automates GUI smoke testing is presented. Third, the interplay between several characteristics of GUI smoke test suites including their size, fault detection ability, and test oracles is empirically studied. The results show that: 1) the entire smoke testing process is feasible in terms of execution time, storage space, and manual effort, 2) smoke tests cannot cover certain parts of the application code, 3) having comprehensive test oracles may make up for not having long smoke test cases, and 4) using certain oracles can make up for not having large smoke test suites.
Semantic image classification with hierarchical feature subset selection
Authors: Yuli Gao, Jianping Fan
Venue: Proceedings of the 7th ACM SIGMM international workshop on Multimedia information retrieval (2005)

High-dimensional visual features for image content characterization enables effective image classification. However, training accurate image classifiers in high-dimensional feature space suffers from the problem of curse of dimensionality and thus requires a large number of labeled images. To achieve accurate classifier training in high-dimensional feature space, we propose a hierarchical feature subset selection algorithm for semantic image classification, where the feature subset selection procedure is seamlessly integrated with the underlying classifier training procedure in a single algorithm. First, our hierarchical feature subset selection framework partitions the high-dimensional feature space into multiple homogeneous feature subspaces and forms a two-level feature hierarchy. Second, weak image classifiers are trained for each homogeneous feature subspace at the lower level of the feature hierarchy, where the traditional feature subset selection techniques such as principal component analysis (PCA) can be used for dimension reduction. Finally, these weak classifiers are boosted to determine an optimal image classifier and the higher-level feature subset selection is realized by selecting the most effective weak classifiers and their corresponding homogeneous feature subsets. Our experiments on a specific domain of natural images have obtained very positive results.
Metadata Design for Reconfigurable Protocol Stacks in Systems Beyond 3G
Authors: Vangelis Gazis, Nancy Alonistioti, Lazaros Merakos
Venue: Wireless Personal Communications: An International Journal (2006)

Global consensus on the next generation of wireless mobile communications, broadly termed "beyond 3G", sketches a heterogeneous infrastructure comprising different wireless systems in a complementary manner and vested with reconfiguration capabilities, which support a flexible and dynamic adaptation of the wireless network and its spectrum resources to meet the ever-changing service requirements. For ubiquitous reconfiguration to become a practical capability of mobile communication systems, it is necessary to establish a global architecture for modeling, expressing, and circulating essential metadata related to reconfiguration, including reconfigurable device capabilities and semantic properties of protocol stacks. We outline the relevant standardization initiatives in the mobile domain, summarize existing work in reconfiguration-supporting architectures, and identify key shortcomings that may hinder the advent of ubiquitously reconfigurable systems. Further on, we point out some major limitations of current metadata standards in the mobile domain for the representation of capability information pertaining to reconfigurable protocol stacks. Next, we identify essential metadata classes in support of reconfigurable communication systems, introducing an associated object-oriented UML model. We elaborate on the design rationale of the UML model, presenting and discussing the alternative metadata representation standards and suitable encoding formats. Finally, we demonstrate the suitability of our UML model by applying our reconfiguration-supporting vocabulary in the cases of a standardized protocol stack of 3G mobile devices and stationary 3G cellular network elements.
Improved Phylogenetic Motif Detection Using Parsimony
Authors: Usman Roshan, Dennis R. Livesay, David La
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

We have recently demonstrated (La et al, Proteins, 58:2005) that sequence fragments approximating the overall familial phylogeny, called phylogenetic motifs (PMs), represent a promising protein functional site prediction strategy. Previous results across a structurally and functionally diverse dataset indicate that phylogenetic motifs correspond to a wide variety of known functional characteristics. Phylogenetic motifs are detected using a sliding window algorithm that compares neighbor joining trees on the complete alignment to those on the sequence fragments. In this investigation we identify PMs using heuristic maximum parsimony trees. We show that when using parsimony the functional site prediction accuracy of PMs improves substantially, particularly on divergent datasets. We also show that the new PMs found using parsimony are not necessarily conserved in sequence, and, therefore, would not be detected by traditional motif (information content-based) approaches.
Describing a social science data information system, networks and components
Authors: Paul E. Peters
Venue: ACM SIGSOC Bulletin (1974)

The acquisition of data has taken its place with the acquisition of literature as a first-order information problem for social science practitioners, researchers, and students. The traditional mechanisms of information dissemination have been serial publications and professional meetings which provide linkages for social science practitioners and researchers, while monographs and textbooks serve the basic needs of students. Brittain (1), however, has suggested that social scientists are unique as scientists because they utilize large volumes of data often produced outside their immediate control. [1] The costs associated with social science data collection in the quantity required for reliable research have occasioned discussions related to the possibility of data resource dissemination. This dissemination leads to secondary or extended analysis', whereby one researcher applies data to problems not thematic to those researchers who collected the data and performed a 'primary analysis'.
Fault Tolerant Active Rings for Structured Peer-to-Peer Overlays
Authors: John Risson, Ken Robinson, Tim Moors
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Algorithms by which peers join and leave structured overlay networks can be classified as passive or active. Passive topology maintenance relies on periodic background repair of neighbor pointers. When a node passively leaves the overlay, subsequent lookups may fail silently. Active maintenance has been proven only for fault-free networks. We develop an active topology maintenance algorithm for practical, fault-prone networks. Unlike prior work, it a) maintains ring continuity during normal topology changes and b) guarantees consistency and progress in the presence of faults. The latter property is inherited by novel extension of the Paxos Commit algorithm. The topology maintenance algorithm is formally developed using the B Method and its event-driven extensions for dynamic systems. Messaging and storage overheads are quantified.
Interactive image-space refraction of nearby geometry
Authors: Chris Wyman
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

Interactive applications often strive for realism, but framerate constraints usually limit realistic effects to those that run efficiently in graphics hardware. One effect largely ignored in interactive applications is refraction. We build upon a simple, image-space approach to refraction [Wyman 2005] that easily runs on modern graphics cards. This image-space approach requires two passes on a GPU, and allows refraction of distant environments through two interfaces. Our work explores extensions allowing the refraction of nearby opaque objects, at the cost of one additional pass to render nearby geometry to texture and a more complex fragment shader for computing refracted color. Like all image-based algorithms, aliasing can occur in certain circumstances, especially when a few texels are magnified to cover a sizable portion of screen space. However, our plausible refractions should suffice for many applications.
Congestion Control in InfiniBand Networks
Authors: M. Gusat, D. Craddock, W. Denzel, T. Engbersen, N. Ni, G. Pfister, W. Rooney, J. Duato
Venue: Proceedings of the 13th Symposium on High Performance Interconnects (2005)

Driving computer interconnection networks closer to saturation minimizes cost/performance and power consumption, but requires efficient congestion control to prevent catastrophic performance degradation during traffic peaks or "hot spot" traffic patterns. The InfiniBand™Architecture provides such congestion control, but lacks guidance for setting its parameters. At its adoption, it was unproven that there were any settings that would work at all, avoid instability or oscillations. This paper reports on a simulation-driven exploration of that parameter space which verifies that the architected scheme can, in fact, work properly despite inherent delays in its feedback mechanism.
A New Approach to Generalized Singular Value Decomposition
Authors: Shmuel Friedland
Venue: SIAM Journal on Matrix Analysis and Applications (2005)

We propose a new algorithm to find the generalized singular value decompositions of two matrices with the same number of columns. We discuss in detail the sensitivity of our algorithm to errors in the entries of the matrices and suggest a way to suppress this sensitivity.