ppxscal/embedding_network huggingface dataset:
The use of force feedback and auditory cues for performance of an assembly task in an immersive virtual environment
Authors: W. Edwards, Woodrow Barfield, A. Nussbaum
Venue: Virtual Reality (2004)

Using an immersive virtual environment, this study investigated whether the inclusion of force feedback or auditory cues improved manipulation performance and subjective reports of usability for an assembly task. Twenty-four volunteers (12 males and 12 females) were required to assemble and then disassemble five interconnecting virtual parts with either auditory, force, or no feedback cues provided. Performance for the assembly task was measured using completion time and number of collisions between parts, while the users&#x2019; preferences across conditions were evaluated using subjective reports of usability. The results indicated that the addition of force feedback slowed completion time and led to more collisions between parts for males. In contrast, females exhibited no change in the mean completion time for the assembly task but did show an increase in collision counts. Despite these negative performance findings when adding force feedback, users did report perceived increases in realism, helpfulness and utility towards the assembly task when force feedback was provided. Unlike force feedback, the results showed that auditory feedback, indicating that parts had collided during the assembly task, had no negative performance effects on the objective measures while still increasing perceived realism and overall user satisfaction. When auditory cues and force feedback were presented together, performance times, number of collisions, and usability were not improved compared to conditions containing just auditory cues or force feedback alone. Based on these results, and given the task and display devices used in the present study, the less costly option of excluding auditory and force feedback cues would produce the best performance when measured by the number of collisions and completion time. However, if increased ratings of usability for an assembly task are desired while maintaining objective performance levels and reduced cost, then the inclusion of auditory feedback cues is best.
Passive inference of path correlation
Authors: Lili Wang, James N. Griffioen, Kenneth L. Calvert, Sherlia Shi
Venue: Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video (2004)

Overlays have been proposed as a means to improve application performance in many areas, including multimedia streaming and content distribution. Some overlays use parallel transmission to increase aggregate throughput or use backup paths to improve reliability. For such applications, an important consideration is whether the "virtual links" at the overlay level (i.e. paths between overlay nodes) share links in the underlying network. In particular, choosing parallel or backup paths without any information about path correlation can reduce the effectiveness of the overlay.In this paper we show how to use passive measurement of TCP throughput to provide information about path correlation, for use in overlay routing decisions. Our methods have the advantage that they send no probe traffic to collect path information. We present results of experimental evaluation in both controlled testbed (Emulab) and real wide area network (Planetlab). Our results demonstrate that the methods together work well across a wide range of operating conditions.
Smarandache non-associative (SNA-) rings
Authors: W. B. Vasantha Kandasamy
Venue: Smarandache Notions Journal (2004)

In this paper we introduce the concept of Smarandache non-associative rings, which we shortly denote as SNA-rings as derived from the general definition of a Smarandache Structure (i.e., a set A embedded with a week structure W such that a proper subset B in A is embedded with a stronger structure S). Till date the concept of SNA-rings are not studied or introduced in the Smarandache algebraic literature. The only non-associative structures found in Smarandache algebraic notions so far are Smarandache groupoids and Smarandache loops introduced in 2001 and 2002. But they are algebraic structures with only a single binary operation defined on them that is nonassociative. But SNA-rings are non-associative structures on which are defined two binary operations one associative and other being non-associative and addition distributes over multiplication both from the right and left. Further to understand the concept of SNA-rings one should be well versed with the concept of group rings, semigroup rings, loop rings and groupoid rings. The notion of groupoid rings is new and has been introduced in this paper. This concept of groupoid rings can alone provide examples of SNA-rings without unit since all other rings happens to be either associative or nonassociative rings with unit. We define SNA subrings, SNA ideals, SNA Moufang rings, SNA Bol rings, SNA commutative rings, SNA non-commutative rings and SNA alternative rings. Examples are given of each of these structures and some open problems are suggested at the end.
The disciplined use of simplifying assumptions
Authors: Charles Rich, Richard C. Waters
Venue: Proceedings of the workshop on Rapid prototyping (1982)

Simplifying assumptions --- everyone uses them but no one's programming tool explicitly supports them. In programming, as in other kinds of engineering design, simplifying assumptions are an important method for dealing with complexity. Given a complex programming problem, expert programmers typically choose simplifying assumptions which, though false, allow them to arrive rapidly at a program which addresses the important features of the problem without being distracted by all of its details. The simplifying assumptions are then incrementally retracted with corresponding modifications to the initial program. This methodology is particularly applicable to rapid prototyping because the main questions of interest can often be answered using only the initial program.Simplifying assumptions can easily be misused. In order to use them effectively two key issues must be addressed. First, simplifying assumptions should be chosen which simplify the design problem significantly without changing the essential character of the program which needs to be implemented. Second, the designer must keep track of all the assumptions he is making so that he can later retract them in an orderly manner. By explicitly dealing with these issues, a programming assistant system could directly support the use of simplifying assumptions as a disciplined part of the software development process.
Analysis of cracked plates and shells using "metis" finite element model
Authors: Nguyen Dang Hung, Tran Thanh Ngoc
Venue: Finite Elements in Analysis and Design (2004)

A special form finite element technique is presented for the calculation of displacement and stress field of cracked (or uncracked) plates and shells. The method based on a particular set of hybrid displacement finite element, namely "Metis elements". Several numerical examples are considered to evaluate the performance of this model. For cracked plate in extension, the element HSM gives high accuracy in computation of stress intensity factors. For plate bending problem with or without crack, the element HSF presents also very good performance. The results are very close to the theoretical solutions of Timoshenko (without crack) and solutions of Chen, Sosa and Eischen (with crack). For the cylindrical shell problem, the present results are also in very good agreement with solutions proposed by Scordelis and Folias.
Constraint Specification and Processing in Web Services Publication and Discovery
Authors: Seema Degwekar, Stanley Y. W. Su, Herman Lam
Venue: Proceedings of the IEEE International Conference on Web Services (2004)

Much effort is being made by the IT industry towardsthe establishment of a Web services infrastructure andthe refinement of its component technologies to enablethe sharing of heterogeneous application resources.Traditional roles of the service provider, servicerequestor and service broker and their interactionsare now being improved upon to enable more effectiveservices.The implementation of the Web Service broker iscurrently limited to being an interface to the servicerepository for service registration, browsing and/orprogrammatic access. In this work, we have extendedthe functionality of the Web services broker to includeconstraint specification and processing, which enablesthe broker to find a good match between a serviceprovider's capabilities and a service requestor'srequirements. This paper presents the extension madeto the Web Services Description Language to includeconstraint specifications in service descriptions andrequests, the architecture of a Constraint-basedBroker, the constraint matching technique, someimplementation details, and preliminary evaluation results.
All Oxide transparent MISFET using high-k dielectrics gates
Authors: Kenji Nomura, Hiromichi Ohta, Kazushige Ueda, Toshio Kamiya, Masahiro Hirano, Hideo Hosono
Venue: Microelectronic Engineering (2004)

Metal-insulator-semiconductor field-effect transistors (MISFETs) were fabricated using a n-type transparent oxide semiconductor, InGaO3(ZnO)5, single-crystalline layer as n-channel. High-k dielectric materials, amorphous Al2Ox and HfOx, were examined for gate insulators. The deposition and post-annealing conditions of the gate insulators were optimized for leakage current and MISFET performances. The MISFETs exhibited good performances such as normally off characteristics, an on/off current ratio as large as 105 and insensitivity to visible light. A field-effect mobility for oxide MISFETs (∼80 cm2 V-1 s-1) was obtained when amorphous HfOx was used for gate insulator.
Streamlining the Replenishment Process through Extended Information Sharing and Collaboration: Defining the Underlying E-Commerce Infrastructure
Authors: Katerina Pramatari, Georgios I. Doukidis, Panagiotis Miliotis
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

In this paper we address the issue of daily, store-level collaboration and information exchange between retailer and supplier, supporting the replenishment process for the full product range at store level. In the following section we define the requirements for supporting information sharing and collaboration in this context with the objective to streamline the store replenishment process. We then discuss a specific technical approach to meeting these requirements, utilizing the Internet and based on the concept of electronic marketplaces. We further discuss the implications and learnings acquired from implementing and applying the suggested approach in practice, with one big retailer and several suppliers. We conclude this discussion with some closing remarks and suggestions for further development and research in this area.
Formal Methods for Dynamic Power Management
Authors: Rajesh K. Gupta, Sandy Irani, Sandeep K. Shukla
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Dynamic Power Management or DPM refers to the problem ofjudicious application of various low power techniques based onruntime conditions in an embedded system to minimize the totalenergy consumption.To be effective, often such decisions takeinto account the operating conditions and the system-level designgoals.DPM has been a subject of intense research in thepast decade driven by the need for low power in modern embeddeddevices.We present an overview of the formal methods thathave been explored in solving the system-level DPM problem.We show how formal reasoning frameworks can potentially unifyapparently disparate DPM techniques.
A learning object generator for programming
Authors: Lindsey Ford
Venue: ACM SIGCSE Bulletin (2004)

We introduce a general tool for creating small learning scenarios (Learning Objects) that can be used by teachers and students for teaching/learning Java.
Technology applied to address difficulties of Alzheimer patients and their partners
Authors: Janice Loh, Tomas Schietecat, Tsun Fai Kwok, Lucas Lindeboom, Peter Joore
Venue: Proceedings of the conference on Dutch directions in HCI (2004)

This paper discusses how technological potential have brought true benefit to the lives of people with Alzheimer.Contextual scenarios that illustrate certain problems faced by Alzheimer patients in their daily lives have been mapped out, and a conceptual solution enabled by technology is proposed. A discussion on the feasibility of this solution and its implementation ensues.
Pair Stochastic Tree Adjoining Grammars for Aligning and Predicting Pseudoknot RNA Structures
Authors: Hiroshi Matsui, Kengo Sato, Yasubumi Sakakibara
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Motivation: Since the whole genome sequences for many species are currently available, computational predictions of RNA secondary structures and computational identifications of those non-coding RNA regions by comparative genomics become important, and require more advanced alignment methods. Recently, an approach of structural alignments for RNA sequences has been introduced to solve these problems. By structural alignments, we mean a pairwise alignment to align an unfolded RNA sequence into a folded RNA sequence of known secondary structure. Pair HMMs on tree structures (PHMMTSs) proposed by Sakakibara are efficient automata-theoretic models for structural alignments of RNA secondary structures, but are incapable of handling pseudoknots. On the other hand, tree adjoining grammars (TAGs) is a subclass of context-sensitive grammar, which is suitable for modeling pseudoknots. Our goal is to extend PHMMTSs by incorporating TAGs to be able to handle pseudoknots. Results: We propose the pair stochastic tree adjoining grammars (PSTAGs) for modeling RNA secondary structures including pseudoknots and show the strong experimental evidences that modeling pseudoknot structures significantly improves the prediction accuracies of RNA secondary structures. First, we extend the notion of PHMMTSs defined on alignments of ýtreesý to PSTAGs defined on alignments of "TAG (derivation) trees", which represent a top-down parsing process of TAGs and are functionally equivalent to derived trees of TAGs. Second, we modify PSTAGs so that it takes as input a pair of a linear sequence and a TAG tree representing a pseudoknot structure of RNA to produce a structural alignment. Then, we develop a polynomial-time algorithm for obtaining an optimal structural alignment by PSTAGs, based on dynamic programming parser. We have done several computational experiments for predicting pseudoknots by PSTAGs, and our computational experiments suggests that prediction of RNA pseudoknot structures by our method are more efficient and biologically plausible than by other conventional methods. The binary code for PSTAG method is freely available from our website at http://www.dna.bio.keio.ac.jp/pstag/.
How to identify and estimate the largest traffic matrix elements in a dynamic environment
Authors: Augustin Soule, Antonio Nucci, Rene Cruz, Emilio Leonardi, Nina Taft
Venue: Proceedings of the joint international conference on Measurement and modeling of computer systems (2004)

In this paper we investigate a new idea for traffic matrix estimation that makes the basic problem less under-constrained, by deliberately changing the routing to obtain additional measurements. Because all these measurements are collected over disparate time intervals, we need to establish models for each Origin-Destination (OD) pair to capture the complex behaviours of internet traffic. We model each OD pair with two components: the diurnal pattern and the fluctuation process. We provide models that incorporate the two components above, to estimate both the first and second order moments of traffic matrices. We do this for both stationary and cyclo-stationary traffic scenarios. We formalize the problem of estimating the second order moment in a way that is completely independent from the first order moment. Moreover, we can estimate the second order moment without needing any routing changes (i.e., without explicit changes to IGP link weights). We prove for the first time, that such a result holds for any realistic topology under the assumption of minimum cost routing and strictly positive link weights. We highlight how the second order moment helps the identification of the top largest OD flows carrying the most significant fraction of network traffic. We then propose a refined methodology consisting of using our variance estimator (without routing changes) to identify the top largest flows, and estimate only these flows. The benefit of this method is that it dramatically reduces the number of routing changes needed. We validate the effectiveness of our methodology and the intuitions behind it by using real aggregated sampled netflow data collected from a commercial Tier-1 backbone.
Efficient desingularization of reducible algebraic sets
Authors: Gábor Bodnár
Venue: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (2004)

In this paper we present a resolution strategy that uses a modification of Villamayor's algorithm as a subroutine and combines resolutions of irreducible (or at least equidimensional) components of a given algebraic set X⊂ W to compute an embedded resolution of singularities of X. The arising algorithm extends the scope of Villamayor's algorithm from equidimensional algebraic sets to the general case. The ideas also serve well in improving the efficiency of resolutions, using the prime ideal decomposition of the (radical) vanishing ideal of X
Approximation schemes for parallel machine scheduling problems with controllable processing times
Authors: Klaus Jansen, Monaldo Mastrolilli
Venue: Computers and Operations Research (2004)

We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have a controllable processing time means that it is allowed to compress (a part of) the processing time of the job, in return for compression cost. We present the first known polynomial time approximation schemes for the nonpreemptive case of several identical parallel machines scheduling problems with controllable processing times. Moreover, we study the problem when preemption is allowed and describe efficient exact and approximation algorithms.
Progress and developments in the field of materials for transient liquid phase bonding and active soldering processes
Authors: E. Lugscheider, S. Ferrara, H. Janssen, A. Reimann, B. Wildpanner
Venue: Microsystem Technologies (2004)

In the last decade, microsystem engineering has rapidly developed. Nowadays microsystems have a very broad scope of applications, which range from electronics and aerospace to chemistry, optics, biology and medicine. Within this framework, the joining technique plays a crucial role. Therefore the development of new concepts for joining hybrid microstructures is one of the main tasks within the collaborative research center, assembly of hybrid microsystems. Active soldering and transient liquid phase (TLP) bonding processes are two innovative and trend-setting technologies in the field of joining dissimilar materials and have been specifically adapted to the requirements of the microsystems.
iMAP: discovering complex semantic matches between database schemas
Authors: Robin Dhamankar, Yoonkyong Lee, AnHai Doan, Alon Halevy, Pedro Domingos
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Creating semantic matches between disparate data sources is fundamental to numerous data sharing efforts. Manually creating matches is extremely tedious and error-prone. Hence many recent works have focused on automating the matching process. To date, however, virtually all of these works deal only with one-to-one (1-1) matches, such as address = location. They do not consider the important class of more complex matches, such as address = concat (city, state) and room-pric = room-rate* (1 + tax-rate).We describe the iMAP system which semi-automatically discovers both 1-1 and complex matches. iMAP reformulates schema matching as a search in an often very large or infinite match space. To search effectively, it employs a set of searchers, each discovering specific types of complex matches. To further improve matching accuracy, iMAP exploits a variety of domain knowledge, including past complex matches, domain integrity constraints, and overlap data. Finally, iMAP introduces a novel feature that generates explanation of predicted matches, to provide insights into the matching process and suggest actions to converge on correct matches quickly. We apply iMAP to several real-world domains to match relational tables, and show that it discovers both 1-1 and complex matches with high accuracy.
Circular Chromatic Number and Mycielski Graphs
Authors: Genghua Fan
Venue: Combinatorica (2004)

As a natural generalization of graph coloring, Vince introduced the star chromatic number of a graph G and denoted it by &#x03c7;*(G). Later, Zhu called it circular chromatic number and denoted it by &#x03c7;c(G). Let &#x03c7;(G) be the chromatic number of G. In this paper, it is shown that if the complement of G is non-hamiltonian, then &#x03c7;c(G)=&#x03c7;(G). Denote by M(G) the Mycielski graph of G. Recursively define Mm(G)=M(Mm&#x2212;1(G)). It was conjectured that if m&#x2264;n&#x2212;2, then &#x03c7;c(Mm(Kn))=&#x03c7;(Mm(Kn)). Suppose that G is a graph on n vertices. We prove that if $$\chi {\left( G \right)} \geqslant \frac{{n + 3}}{2}$$, then &#x03c7;c(M(G))=&#x03c7;(M(G)). Let S be the set of vertices of degree n&#x2212;1 in G. It is proved that if |S|&#x2265; 3, then &#x03c7;c(M(G))=&#x03c7;(M(G)), and if |S|&#x2265; 5, then &#x03c7;c(M2(G))=&#x03c7;(M2(G)), which implies the known results of Chang, Huang, and Zhu that if n&#x2265;3, &#x03c7;c(M(Kn))=&#x03c7;(M(Kn)), and if n&#x2265;5, then &#x03c7;c(M2(Kn))=&#x03c7;(M2(Kn)).
The analysis and applications of adaptive-binning color histograms
Authors: Wee Kheng Leow, Rui Li
Venue: Computer Vision and Image Understanding (2004)

Histograms are commonly used in content-based image: retrieval systems to represent the distributions of colors in images. It is a common understanding that histograms that adapt to images can represent their color distributions more efficiently than do histograms with fixed binnings. However, existing systems almost exclusively adopt fixed-binning histograms because, among existing well-known dissimilarity measures, only the computationally expensive Earth Mover's Distance (EMD) can compare histograms with different binnings. This paper addresses the issue by defining a new dissimilarity measure that is more reliable than the Euclidean distance and yet computationally less expensive than EMD. Moreover, a mathematically sound definition of mean histogram can be defined for histogram clustering applications. Extensive test results show that adaptive histograms produce the best overall performance, in terms of good accuracy, small number of bins, no empty bin, and efficient computation, compared to existing methods for histogram retrieval, classification, and clustering tasks.