ppxscal/embedding_network huggingface dataset:
Advances in modelling of electromechanical devices with moving eddy current regions
Authors: Sheppard J. Salon
Venue:  (2003)

This thesis gives new modeling techniques for electromechanical devices with moving eddy current regions. The principal objectives of this thesis are: (1) the development of stable and accurate modeling techniques of nonlinear three dimensional and two dimensional devices which have moving conducting bodies; (2) improvement in the accuracy of determination of performance parameters particularly forces, torques and losses computed from finite elements. Contributions are made in two general areas: more efficient models for three dimensional finite element analysis which save time and improve accuracy and a novel modeling approach for higher harmonic loss terms in induction machines due to moving eddy current regions. Since the thesis is dealing with the moving eddy current problem, a new analysis based on coupled electric and magnetic potentials with remeshing techniques has been implemented to obtain braking torque in a Watt-hour meter. Even though the Watt-hour meter is a very well-known and old device, to model this complicated topology with all of its subtle effects is not an easy task and has been done for the first time. The canned solid rotor induction motor problem is also considered. The main difficulties were the low efficiency of the machine and the unknown loss sources. The moving eddy current regions bring extra losses and the finite element model has also been used to analyze the harmonic components due to the tooth ripple. A new method for analyzing these loss components based on data obtained from a transient analysis of the machine is explored. Comparisons are made for different types of solutions and conclusions drawn as to how much improvement is made. The necessity of using a time domain solution with a sufficiently small time step, even in steady state, has been shown. A new modeling technique and equivalent circuit for this motor has been introduced to determine machine performance. The one-slot model has significant advantages over the time-stepping modeling. Generally, this thesis gives new and improved modeling approaches in 2D and 3D problems with moving eddy current regions. It also shows the limitations and assumptions and provides rules to insure accurate results.
Optimization of the compiling of subscripted array references
Authors: Irving B. Elliott
Venue: ACM SIGPLAN Notices (1978)

A method is described for compiling higher-order-language references to array elements into optimum in-line executable code. Optimization is achieved by resolving parts of the required subscripting calculation, e.g., those which involve constant values, at compile time instead of at run time. The method is applicable to references for arrays of any number of dimensions. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Information access in context: experiences with the watson system
Authors: Kristian J. Hammond
Venue:  (2003)

Many activities people perform on their personal computer&mdash;reading email from a co-worker, making a PowerPoint presentation for an upcoming meeting, or writing a term paper for a high school class&mdash;can be greatly enriched with access to the right information. However, the level of effort required to effectively use existing systems to find useful information often outweighs the perceived benefit of doing so. This thesis is about a software tool called Watson, built to significantly reduce the level of effort required to find information in the context of an ongoing task. Watson works by analyzing the document the user is reading or writing in everyday productivity applications (e.g., word processors, email clients, or presentation managers) so it can automatically retrieve useful information from any networked information repository (e.g., Internet search engines, enterprise knowledge management systems, or custom databases). Using Watson, users can more easily maintain an awareness of available information resources without having to know which data repositories to search, or how to formulate a complex query. In order to better understand Watson's effectiveness as a new kind of information access tool, we performed laboratory evaluations and also developed it for use as a pilot in several commercial settings. The deployment experiences show how the architecture we developed supports flexible adaptation for diverse needs, and also that the software can effectively assist people engaged in real-world tasks.
Should we build Gnutella on a structured overlay?
Authors: Miguel Castro, Manuel Costa, Antony Rowstron
Venue: ACM SIGCOMM Computer Communication Review (2004)

There has been much interest in both unstructured and structured overlays recently. Unstructured overlays, like Gnutella, build a random graph and use flooding or random walks on the graph to discover data stored by overlay nodes. Structured overlays assign keys to data items and build a graph that maps each key to a specific node. The structure of the graph enables efficient discovery of data items given their keys but it does not support complex queries.Should we build Gnutella on a structured overlay? We believe the answer is yes. We replaced the random graph in Gnutella by a structured overlay while retaining the content placement and discovery mechanisms of unstructured overlays to support complex queries. Our preliminary results indicate that we can use structure to improve the performance of floods and rondom walks. They also indicate that structure can be used to reduce maintenance overhead, which is surprising because it is commonly believed that unstructured overlays have lower maintenance overhead than structured overlays.
Textable movie: improvising with a personal movie database
Authors: Catherine Vaucelle, Glorianna Davenport, Tristan Jehan
Venue: ACM SIGGRAPH 2003 Sketches Applications (2003)

This sketch presents a new approach to improvising movies according to the inter-relationship between personal videos and the story of an experience. Textable Movie is a graphical interface that invites a storyteller of any age to compose and visualize movies, images and sound environments while writing a story; the system self-selects and self-edits movies in real time based on textual input from the teller. Textable Movie aims to exalt the imagination of its authors (writer, and film-maker) by immersing them in real time, in a co-constructed narration.
Investigation of the substrate activation mechanism and electroless Ni-P coating ductility and adhesion
Authors: T. N. Khoperia
Venue: Microelectronic Engineering (2003)

The effects of different factors: concentration of Sn and Pd ions, temperature, pH, additives, surface roughness, time of treatment on sensitization, activation and electroless deposition were investigated. The adsorption and desorption of tin and palladium ions have been investigated using the method of radioactive isotopes and X-ray photoelectron spectroscopy. A mechanism of sensitization and activation was established. The established characters of ductility and adhesion between the electrolessly deposited Ni-P alloy and dielectrics depending on annealing temperature were explained on the basis of the changes in the alloy structure and phase transformations. The proposed methods of metallization are widely used in electronics and instrument-making. As a result, Au, Ag and Pd were adequately replaced with the alloys of nonprecious metals, usage of toxic substances was eliminated and the technology was significantly simplified. A new resistless technology is proposed.
Pipelining and Overlapping for MPI Collective Operations
Authors: Joachim Worringen
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

Collective operations are an important aspect of the currentlymost important message-passing programming modelMPI (Message Passing Interface). Many MPI applicationsmake heavy use of collective operations. Collective operationsinvolve the active participation of a known groupof processes and are usually implemented on top of MPIpoint-to-point message passing. Many optimizations of theused communication algorithms have been developed, butthe vast majority of those optimizations is still based onplain MPI point-to-point message passing. While this hasthe advantage of portability, it often does not allow for fullexploitation of the underlying interconnection network. Inthis paper, we present a low-level, pipeline-based optimizationof one-to-many and many-to-one collective operationsfor the SCI (Scalable Coherent Interface) interconnectionnetwork. The optimizations increase the performance ofsome operations by a factor of four if compared with thegeneric, tree-based algorithms.
A study of student preference between two approaches of classroom instruction of undergraduate music appreciation at the university level
Authors: Robert Lee Elliott,  Jr.
Venue:  (2003)

The purpose of this study was to determine student preference between two types of classroom instruction in a music appreciation course. Students in four intact class sections experienced both traditional lecture-demonstration instruction and computer-based presentation instruction and then completed a survey that included questions about instructional model preference. There is evidence that a large majority of students in this study's population preferred instruction delivered via computer-based presentations.
Using randomized response techniques for privacy-preserving data mining
Authors: Wenliang Du, Zhijun Zhan
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Privacy is an important issue in data mining and knowledge discovery. In this paper, we propose to use the randomized response techniques to conduct the data mining computation. Specially, we present a method to build decision tree classifiers from the disguised data. We conduct experiments to compare the accuracy of our decision tree with the one built from the original undisguised data. Our results show that although the data are disguised, our method can still achieve fairly high accuracy. We also show how the parameter used in the randomized response techniques affects the accuracy of the results.
Performance analysis and enhancement for the current and future IEEE 802.11 MAC protocols
Authors: Yang Xiao, Jon Rosdahl
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2003)

The IEEE 802.11 specifications provide up to 54 Mbps data rates, respectively. The industry is seeking Higher Data Rates (HDR's) over 100Mbps for IEEE 802.11a extension. However, the medium access control (MAC), which they are based upon, is the same. In this paper, we explore the overhead of HDR's to find out whether the MAC is good enough for the increasing data rates and what to expect as the industry seeks higher data rates. We prove that a theoretical throughput upper limit and a theoretical delay lower limit exist for IEEE 802.11 protocols. The existence of such limits indicates that the overhead must be reduced to get good performance for HDR's. Otherwise, the enhanced performance of HDR's is limited and bounded even when the data rate becomes infinitely high. Both reducing overhead and pursuing HDR's are therefore necessary and important. In order to reduce overhead, we propose a burst transmission and acknowledgement (BTA) mechanism, in which, instead of acknowledging each frame, a burst of frames is received first, and then the whole burst is acknowledged one time. Our study shows that with the BTA mechanism, overhead has been greatly reduced and performance has been greatly improved.
PeerSpaces: data-driven coordination in peer-to-peer networks
Authors: Nadia Busi, Cristian Manfredini, Alberto Montresor, Gianluigi Zavattaro
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Shared dataspaces &agrave; la Linda, and the underlying data-driven coordination model, have been successfully exploited in the development of a huge variety of applications, going from parallel computing to web-based collaborative work. In this paper we consider a novel class of applications, namely those developed for peer-to-peer networks &agrave; la Gnutella or FreeNet. We discuss the problems which arise when trying to exploit the original Linda coordination model in this new scenario. In order to address these problems, we introduce PeerSpaces, a new coordination model particularly suited for the realm of peer-to-peer network applications, and we present a prototypical implementation of this coordination model based on the JXTA peer-to-peer technology.
The effect of learning style accommodation on university foodservice employees' computer aversion and learning outcomes using multimedia computer-based training
Authors: Gary Lee Frantz
Venue:  (2003)

The purpose of this study was to determine the effect of two employee-training methods upon learning transfer and aversion to computer based training (CBT) and the relationship to individual learning styles. Learning styles were assessed using Bernice McCarthy's Learning Type Measure (LTM&reg;). Computer aversion was determined using a modified version of Scott Meier's Computer Aversion Scale&copy;. Knowledge transfer was measured using a 25-question, multiple choice, competency-based skill exam. The training concept taught was foodservice customer service. The three-phase study consisted of a pre-test, post-test, control design. Phase 1 was an initial survey to determine subjects' pre-test computer based training aversion, skill knowledge level, individual learning styles, and demographics. Phase 2 consisted of three workplace-training interventions. Training intervention one (TI-1) used the multimedia CD-ROM Check Please!: Performance Training for Restaurant Servers&copy; . The second intervention (TI-2) consisted of a constructivist-based module designed to accommodate the four McCarthy' learning styles&mdash;Imaginative, Analytic, Common Sense, and Dynamic. McCarthy's work is based on David Kolb's cycle of learning. The third intervention (TI-3) was that of no training, and used as a control group. Subjects received the identical phase 1 computer aversion and skill knowledge measurement in the Phase 3 post-test survey. Eighty full-time, part-time and student midwestem university foodservice workers participated in this study. Correlations between learning types, pre-, post-test computer aversion and learning were assessed; followed by a MANOVA test for training intervention effect. Preferred learning types were analyzed for demographic differences, and relation to the two criterion measures. Age, gender and age-gender interaction, with education level controlled, were determined by an ANCOVA statistic. Results of this study concluded that both the CD-ROM and 4MAT &reg; process significantly impacted learning transfer and computer aversion, with learning making the largest discriminant contribution. The use of computer based training did not highly influence computer aversion; and preferred learning type did not appear to influence learning transfer or change in computer aversion.
Basic components for constraint solver cooperations
Authors: Eric Monfroy, Carlos Castro
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

We propose a predefined set of basic components for designing and implementing constraint solver cooperations and solver cooperation languages. Combining these components into patterns enables one to manage computation, control, and coordination needed for solver cooperations. Our framework has been implemented with the CHR language. We then used it to implement some cooperation primitives, and some constraint propagation with cooperative components.
Solving large FPT problems on coarse-grained parallel machines
Authors: James Cheetham, Frank Dehne, Andrew Rau-Chaplin, Ulrike Stege, Peter J. Taillon
Venue: Journal of Computer and System Sciences (2003)

Fixed-parameter tractability (FPT) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with previous methods. In this paper, we show how to enhance this approach through the addition of parallelism, thereby allowing even larger problem instances to be solved in practice. More precisely, we demonstrate the potential of parallelism when applied to the bounded-tree search phase of FPT algorithms. We apply our methodology to the k-VERTEX COVER problem which has important applications in, for example, the analysis of multiple sequence alignments for computational biochemistry. We have implemented our parallel FPT method for the k-VERTEX COVER problem using C and the MPI communication library, and tested it on a 32-node Beowulf cluster. This is the first experimental examination of parallel FPT techniques. As part of our experiments, we solved larger instances of k-VERTEX COVER than in any previously reported implementations. For example, our code can solve problem instances with k≥400 in less than 1.5 h.
Improving a fixed parameter tractability time bound for the shadow problem
Authors: Peter Heusch, Stefan Porschen, Ewald Speckenmeyer
Venue: Journal of Computer and System Sciences (2003)

Consider a forest of k trees and n nodes together with a (partial) function σ mapping leaves of the trees to non-root nodes of other trees. Define the shadow of a leaf l to be the subtree rooted at σ(l). The shadow problem asks whether there is a set S of leaves exactly one from each tree such that none of these leaves lies in the shadow of another leaf in S. This graph theoretical problem as shown in Franco et al. (Discrete Appl. Math. 96 (1999) 89) is equivalent to the falsifiability problem for pure implicational Boolean formulas over n variables with k occurences of the constant false as introduced in: Heusch J. Wiedermann, P. Hajek (Edso), Proceedings of the Twentieth International Symposium on Mathematical Foundations of Computer Science (MFCS'95), Prague, Czech Republic, Lecture Notes in Computer Science, Vol. 969, Springer, Berlin, 1995, pp. 221-226, where its NP-completeness is shown for arbitrary values of k and a time bound of O(nk) for fixed k was obtained. In Franco et al. (1999) this bound is improved to O(n2kk) showing the problem's fixed parameter tractability (Congr. Numer. 87 (1992) 161). In this paper the bound O(n33k) is achieved by dynamic programming techniques thus significantly improving the fixed parameter part.
Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability
Authors: Kenji Kashiwabara, Takashi Takabatake
Venue: Discrete Applied Mathematics (2003)

We discuss matroid-likeness of polyhedra whose facets have non-01-vectors as their normal vectors. We propose, as a generalized class of submodular polyhedra, the class of down-monotone polyhedra whose support functions satisfy submodularity on non-negative vectors. The sets of feasible outflows of certain bipartite generalized networks are examples of such polyhedra. We prove that such polyhedra have certain unbalanced simultaneous exchangeability between two axes. This property gives a simple criterion of optimality for a linear objective function on these polyhedra. We also prove that this simultaneous exchangeability characterizes this generalized class of polyhedra, while a non-simultaneous version of this exchangeability does not.
PRESENCE: The Sense of Believability of Inaccessible Worlds
Authors: Annie Luciani, Daniela Urma, Sylvain Marlière, Joël Chevrier
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

With the development of communication methods anddevices, it became possible to perform actions more and moredistant from the task spaces. These new tools raise today thequestion of Presence of distant spaces with a growingaccuracy. In a first part, we show that the distance between themanipulation space and the task space, in a teleoperationactivity, points to different meanings. However, the same needfor a strong Presence of the task space raises, whatever thedistance between these spaces is. We then discuss the notion ofPresence as a cross-point between technological and scientificdisciplines, and propose some general idea that may reinforceit. In a second part, we illustrate the previous ideas with theexample of manipulation of nano-objects. We show how it ispossible to enhance dramatically the feeling of Presence of thenano-objects to be perceived and manipulated, by addinghaptic bi-directional transducers to the visual and acousticalsensors used today. By the end, we defend the idea that thefeeling of Being there is deeply dependent on multisensoriality.
Detecting adverse events for patient safety research: a review of current methodologies
Authors: Harvey J. Murff, Vimla L. Patel, George Hripcsak, David W. Bates
Venue: Journal of Biomedical Informatics (2003)

Promoting patient safety is a national priority. To evaluate interventions for reducing medical errors and adverse event, effective methods for detecting such events are required. This paper reviews the current methodologies for detection of adverse events and discusses their relative advantages and limitations. It also presents a cognitive framework for error monitoring and detection. While manual chart review has been considered the "gold-standard" for identifying adverse events in many patient safety studies, this methodology is expensive and imperfect. Investigators have developed or are currently evaluating, several electronic methods that can detect adverse events using coded data, free-text clinical narratives, or a combination of techniques. Advances in these systems will greatly facilitate our ability to monitor adverse events and promote patient safety research. But these systems will perform optimally only if we improve our understanding of the fundamental nature of errors and the ways in which the human mind can naturally, but erroneously, contribute to the problems that we observe.
Mining Frequent Itemsets in Distributed and Dynamic Databases
Authors: M. E. Otey, C. Wang, S. Parthasarathy, A. Veloso, W. Meira,  Jr.
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Traditional methods for frequent itemset mining typicallyassume that data is centralized and static. Such methods imposeexcessive communication overhead when data is distributed,and they waste computational resources when datais dynamic. In this paper we present what we believe to bethe first unified approach that overcomes these assumptions.Our approach makes use of parallel and incremental techniquesto generate frequent itemsets in the presence of dataupdates without examining the entire database, and imposesminimal communication overhead when mining distributeddatabases. Further, our approach is able to generate bothlocal and global frequent itemsets. This ability permits ourapproach to identify high-contrast frequent itemsets, whichallows one to examine how the data is skewed over differentsites.
A compression-based algorithm for Chinese word segmentation
Authors: W. J. Teahan, Rodger McNab, Yingying Wen, Ian H. Witten
Venue: Computational Linguistics (2000)

Chinese is written without using spaces or other word delimiters. Although a text may be thought of as a corresponding sequence of words, there is considerable ambiguity in the placement of boundaries. Interpreting a text as a sequence of words is beneficial for some information retrieval and storage tasks:for example, fulltext search, word-based compression, and keyphrase extraction. We describe a scheme that infers appropriate positions for word boundaries using an adaptive language model that is standard in text compression. It is trained on a corpus of presegmented text, and when applied to new text, interpolates word boundaries so as to maximize the compression obtained. This simple and general method performs well with respect to specialized schemes for Chinese language segmentation.