ppxscal/embedding_network huggingface dataset:
On Nonlinear Control Systems with Multiple Time Scales
Authors: G. Grammel
Venue: Journal of Dynamical and Control Systems (2004)

An order reduction procedure for nonlinear control systems with multiple time scales is introduced. A limit system for the slowest motion describing the situation that all singular perturbation parameters vanish is constructed. For this purpose a refined two-scale averaging method is used in a way that allows a re-iteration. For vanishing control range the results reduce to the well-known Tychonoff theorem on order reduction for singularly perturbed ODEs.
The stringed haptic workbench
Authors: Nicolas Tarrin, Shoichi Hasegawa, Laroussi Bouguila, Makoto Sato
Venue: ACM SIGGRAPH 2003 Sketches Applications (2003)

This paper proposes a new approach for adding haptic feedback on a workbench. The integration of a stringed haptic device is discussed.
The importance of trust: how managers and telecommuters use communication to maintain a trusting relationship
Authors: Sharon M. Schneider-Borowicz
Venue:  (2003)

The proliferation of new technologies has fostered alternatives in the world of work, one of the most significant of which is telecommuting. The popularity of telecommuting as a work option is expected to accelerate in the near future; therefore, it will become an increasingly important issue in the U.S. workplace. Yet, many managers and supervisors hesitate to embrace telecommuting, in part because they understand neither the best way to communicate with virtual employees nor the differences between virtual and face-to-face communication and, in part, because they wonder how they can control workers whom they cannot see. Trust, generally believed to arise from face-to-face interaction, plays a major role in effective management in the traditional workplace. The effective management of telecommuters, then, requires an understanding of the impact of trust in the manager-telecomnuter relationship, the impact of time spent working out of the office on this relationship, and the contribution of different modalities of communication in maintaining a high-trust relationship between manger and telecommuter. The purpose of this study was to investigate these crucial components of distance management. The data was derived from electronic surveys completed by 52 telecommuters and 33 distance managers. The data were analyzed using SPSS 11.0. Survey questions centered on the level of trust between telecommuters and managers, the quantity of communication between them, types of technology used by managers and telecommuters for communication, and frequency of feedback from managers. Overall, it was found that, although face-to-face communication remains important in building trust between manager and telecommuter, computer-mediated communication has evolved to an equivalent level of importance in the shaping of trust and sustaining quality leader-member exchanges (LMX) in the virtual workplace. This study provides significant empirical analysis of the implications of telecommuting and its effect on trust in the manager-telecommuter relationship. Further, it extends the theoretical basis of communication and media choice into the setting of the virtual workplace. This study is a step toward identifying the importance of continuing research that helps shed light on the complex nature of the virtual work environment.
Experimental results on the integration of copper and CVD ultra lowk material
Authors: Matthias Uhlig, A. Bertz, J.-W. Erben, S. E. Schulz, T. Gessner, D. Zeidler, C. Wenzel, J. Bartha
Venue: Microelectronic Engineering (2003)

The integration of ultra low k materials in copper damascene architecture is one of the main issues in finding microelectronic-process-compatible dielectric materials. The aim of this paper is to show the integration conformity with common equipment and process steps using a PECVD (plasma enhanced chemical vapor deposition) CF polymer ultra low k material in a Cu single damascene architecture (Proceedings of the Advanced Metallization Conference, 2002). The intermetal dielectric low k material used in the described structures has 2.1≤k≤2.3 (k depends on deposition process parameters [Microelectron. Eng. 50 (2000) 7-14]) and the copper was deposited by a metal organic chemical vapor deposition process. After chemical mechanical polishing the structures were characterized by scanning electron microscopy and electrical measurements.
Engineering a Method for Wide Audience Requirements Elicitation and Integrating It to Software Development
Authors: Tuure Tuunanen, Matti Rossi
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

In recent years, consumer oriented information systems development has become increasingly important matter, as more and more complex information systems are targeted towards consumer markets. We argue that developing IS for non-organizational users creates new problems, which IS and requirement engineering (RE) community should attend to.First of all, the elicitation of requirements becomes more difficult as usually consumers do not explicitly know what they want, and it is difficult for them to express their ideas. To support different views of product development, such as project management and design, the method should present requirements in a rich enough' way to avoid overloading management, but in the same time giving designers the detailed information they need. Last but not the least, theresults of requirements engineering should be easy to integrate to the software development process. To this end, we have constructed a new RE method and its support environment within Metaedit+ Meta CASE tool. We based our method on Critical Success Chains (CSC) method, which supports top-down approach for planning, but also provides for wide participation of IS customers to get rich information. CSC aggregates the results of many individual interviews into meaningful graphical models of what is critically important about a potential system. In our work, CSC is extended with customer segmentation and lead user concepts from marketing.
A complete and practical system for interactive walkthroughs of arbitrarily complex scenes
Authors: Roger A. Crawfis
Venue:  (2003)

Complex renderings of synthetic scenes or virtual environments, once deemed impossible for consumer rendering, are becoming available as tools for young artists. These renderings, due to their high-quality image synthesis, can take minutes to hours to render. With the increase of the computing power, scientific simulation can produce datasets in the tera-bytes or even pita-bytes of range. Rendering one frame of these massive datasets sometimes can take a long time to finish. Therefore, interactivity for these large datasets and complex scenes is not possible using traditional rendering techniques. Our work focuses on using Image-Based Rendering (1BR) techniques to manage and explore large and complex datasets and virtual scenes on a remote display across the high-speed network. The key idea for this research is to pre-process the scene and render key viewpoints on pre-selected paths inside the scene. We then save these pre-processed partial results into a database on the server. The user can browse through the datasets on the client side. Whenever he or she needs information, the clients sends the request through the high speed network to the server and the server can retrieve the information and send it through the network. In this dissertation, we present new Image-based models to reconstruct approximations to any view along the path, which allows the user to roam around inside the virtual environments with interactive frame rates. We partition the scenes or datasets into several depth slabs to avoid occlusion and dis-occlusion problems. We then use mesh simplification methods to simplify the geometry produced from the pre-rendering step so that the underline geometry is manageable for our system. We compare two simplification methods, namely, down-sampling and feature preserved mesh simplification schemes and compare the errors produced by each methods. We then present the methods to manage our image-based database to achieve even more efficient renderings. These methods include empty texture tiles removal, texture bindings reduction technique, a novel two-part caching and pre-fetching scheme and our new data reduction method using a track-dependent occlusion culling algorithm. The system has been successfully tested on several scenes and on two different platforms and satisfying results have been obtained which proves that our system is suitable for handling large datasets and complex scenes.
A generic ontology-based approach for requirement analysis and its application in network management software
Authors: Chau-Young Ivan Lin, Cheng-Seen Ho
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1999)

This paper describes a generic ontology-based approach that eases the requirement analysis (RA) work. The approach enables the user to derive method-specific RA tools for different applications. The derivation process is based on a unified framework that contains a software methodology ontology and a knowledge acquisition ontology. The former contains a library of software RA methods and a set of modeling support entities, which use the library to construct methodological knowledge. The latter contains a library of knowledge acquisition techniques and a set of acquisition support entities, which work on the library, guided by the generated methodological knowledge, to extract domain knowledge. The generated methodological knowledge, coupled with the domain knowledge, forms the RA tools. We have demonstrated the use of the approach by deriving an RA tool to assist the system analyst to acquire and formalize a requirement specification for a network management system. This approach facilitates the integrating, sharing, and reuse of software methodologies and knowledge acquisition techniques and alleviates the problems associated with the correct generation of requirement specification for different domains.
Register allocation for optimal loop scheduling
Authors: Qi Ning
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

One of the major challenges in designing optimizing compilers, especially for scientific computation, is to take advantage of the parallelism in loops in order to obtain maximum speedup on parallel computer architectures. Optimal loop scheduling is therefore one of the most important topics studied by many computer scientists. However, how to allocate a minimum number of registers to support optimal loop scheduling for parallel architectures is less understood. In this report, we propose a simultaneous scheduling and register allocation approach for a parallelizing compiler. We have proved that the general problem of finding such an optimal scheduling together with register allocation is NP-complete. Then we propose a practical approach to divide the register allocation problem into two steps. The first step solves a minimum buffer allocation problem, which will find a time-optimal periodic schedule using a minimum number of buffers. We give a polynomial time algorithm to solve this problem. The second step analyzes the live ranges of the variables and uses coloring algorithms to reduce the register requirement by sharing. The algorithm has been implemented and used to test selected loops in benchmark programs. Testing results are reported.
Fast evaluation of boundary integral operators arising from an eddy current problem
Authors: S. Börm, J. Ostrowski
Venue: Journal of Computational Physics (2004)

This paper deals with the H2-matrix approximation of matrices that arise from a Galerkin boundary element (BEM) discretization in the context of the E-based eddy current model. The BEM operators are dense, thus need to be compressed. They are of complicated structure, i.e., some kernels and basis functions are vector valued, and test and basis functions are not always identical. The H2-matrix approximation technique is applied to the kernels of the four different relevant boundary integral operators. Numerical experiments demonstrate the significant acceleration of an iterative solution procedure by means of matrix compression.
Quantitative Model for Thermal Behaviour of an Analog Integrated Circuit
Authors: Gagandeep S. Sandha, Pawan K. Singh, C. Pradeep Kumar, D. Nagchoudhuri
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

Localized heating of different areas of an integratedcircuit lead to the temperature variations across thevarious regions. The thermal gradients flow across thesemiconductor chip causing the circuit to behave in anabnormal way. This paper introduces a mathematicalmodel to determine the change in the integrated circuitoutput parameters due to non-linearity in operation ofthe high heat dissipating devices the in the chip and theflow of thermal gradients.
Group Modeling: Selecting a Sequence of Television Items to Suit a Group of Viewers
Authors: Judith Masthoff
Venue: User Modeling and User-Adapted Interaction (2004)

Watching television tends to be a social activity. So, adaptive television needs to adapt to groups of users rather than to individual users. In this paper, we discuss different strategies for combining individual user models to adapt to groups, some of which are inspired by Social Choice Theory. In a first experiment, we explore how humans select a sequence of items for a group to watch, based on data about the individuals' preferences. The results show that humans use some of the strategies such as the Average Strategy (a.k.a. Additive Utilitarian), the Average Without Misery Strategy and the Least Misery Strategy, and care about fairness and avoiding individual misery. In a second experiment, we investigate how satisfied people believe they would be with sequences chosen by different strategies, and how their satisfaction corresponds with that predicted by a number of satisfaction functions. The results show that subjects use normalization, deduct misery, and use the ratings in a non-linear way. One of the satisfaction functions produced reasonable, though not completely correct predictions. According to our subjects, the sequences produced by five strategies give satisfaction to all individuals in the group. The results also show that subjects put more emphasis than expected on showing the best rated item to each individual (at a cost of misery for another individual), and that the ratings of the first and last items in the sequence are especially important. In a final experiment, we explore the influence viewing an item can have on the ratings of other items. This is important for deciding the order in which to present items. The results show an effect of both mood and topical relatedness.
Analysis and Estimation of the States of Special Jump Markov Processes. I. Martingale Representation
Authors: A. V. Borisov
Venue: Automation and Remote Control (2004)

The first part of this paper was devoted to a class of continuous-time jump processes generalizing the finite-state Markov processes. Main characteristics of this process such as the transition probabilities, infinitesimal generator, and so on were established. Processes of this class were proved to be solutions of linear differential equations with a martingale in the right-hand side. Stochastic analysis of a hidden Markov model of evolution of risky assets was presented as an example.
Design and use of the biomolecular interaction network database (bind) for storing and analyzing protein-protein interaction data
Authors: Christopher W. Hogue
Venue:  (2003)

As genomics and proteomics technologies such as mass spectrometry, yeast two-hybrid, phage display and genetic interaction screens become more sensitive and robust, they are becoming more automated and high-throughput. These experimental systems are currently providing a wealth of data on genetic and molecular interactions and post-translational protein modifications. The Biomolecular Interaction Network Database (BIND - http://bind.ca) has been designed to store details about these molecular and genetic interactions, complexes and pathways and thus captures proteomics data in a computer readable format. Chemical reactions, photochemical activation and conformational changes can be described down to the atomic level of detail. Everything from small graph theory methods may be applied for data mining. The database can be used to study networks of interactions, to map pathways across taxonomic branches and to generate information for full pathway kinetic simulations. Currently, BIND is a web-based system that allows the database to be queried and for records to be entered. A Java applet to visually navigate the database and a BLAST against BIND service are both available via the web. BIND is an open community effort. All BIND records are in the public domain and source code for the project is made freely available under the GNU Public License. The system is designed so that both users and a curation staff can submit interactions described in the literature, which are then vetted. BIND has been used to manage and automatically discover new knowledge residing in large yeast protein-protein and genetic interaction networks in Saccharomyces cerevisiae determined using mass-spectrometry, phase-display, yeast two-hybrid and roboticized synthetic lethal screens. A system, called MCODE (Molecular Complex Detection), for automatically recognizing molecular complexes in large molecular interaction networks, has been devised. MCODE is based on the notion that densely connected regions of a molecular network, or graph, represent molecular complexes. The BIND project illustrates how a structured software development process focusing on the design phase provides a sturdy foundation for the future implementation of bioinformatics tools that solve real biological problems.
Project Failures in Small Companies
Authors: Mohammad A. Rob
Venue: IEEE Software (2003)

In February 1998, at the peak of the IT boom when almost every company was fixing Y2K bugs, the author was hired as a programmer/analyst by a small IT company to develop functional specifications for two ongoing software development projects. The company provided data services maintenance of hardware and software, as well as data access for customers and also did some software development. Though ultimately painful, his experiences at this company gave him invaluable insight into the way projects can fail.
Consensus in byzantine asynchronous systems
Authors: Roberto Baldoni, Jean-Michel Hélary, Michel Raynal, Lenaik Tangui
Venue: Journal of Discrete Algorithms (2003)

This paper presents a consensus protocol resilient to Byzantine failures. It uses signed and certified messages and is based on two underlying failure detection modules. The first is a muteness failure detection module of the class ♦M. The second is a reliable Byzantine behaviour detection module. More precisely, the first module detects processes that stop sending messages, while processes experiencing other non-correct behaviours (i.e., Byzantine) are detected by the second module. The protocol is resilient to F faulty processes, F ≤ min(⌊(n - 1)/2⌋, C) (where C is the maximum number of faulty processes that can be tolerated by the underlying certification service).The approach used to design the protocol is new. While usual Byzantine consensus protocols are based on failure detectors to detect processes that stop communicating, none of them use a module to detect their Byzantine behaviour (this detection is not isolated from the protocol and makes it difficult to understand and prove correct). In addition to this modular approach and to a consensus protocol for Byzantine systems, the paper presents a finite state automaton-based implementation of the Byzantine behaviour detection module. Finally, the modular approach followed in this paper can be used to solve other problems in asynchronous systems experiencing Byzantine failures.
Cut rules and explicit substitutions
Authors: René Vestergaard, Joe Wells
Venue: Mathematical Structures in Computer Science (2001)

We introduce a method to associate calculi of proof terms and rewrite rules with cut elimination procedures for logical deduction systems (i.e., Gentzen-style sequent calculi) in the case of intuitionistic logic. We illustrate this method using two different versions of the cut rule for a variant of the intuitionistic fragment of Kleene's logical deduction system G3.Our systems are in fact calculi of explicit substitution, where the cut rule introduces an explicit substitution and the left-&rarr; rule introduces a binding of the result of a function application. Cut propagation steps of cut elimination correspond to propagation of explicit substitutions, and propagation of weakening (to eliminate it) corresponds to propagation of index-updating operations. We prove various subject reduction, termination, and confluence properties for our calculi.Our calculi improve on some earlier calculi for logical deduction systems in a number of ways. By using de Bruijn indices, our calculi qualify as first-order term rewriting systems (TRS's), allowing us to use correctly certain results for TRS's about termination. Unlike in some other calculi, each of our calculi has only one cut rule and we do not need unusual features of sequents.We show that the substitution and index-updating mechanisms of our calculi work the same way as the substitution and index-updating mechanisms of Kamareddine and R&iacute;os' &lambda;s and &lambda;t, two well-known systems of explicit substitution for the standard &lambda;-calculus. By a change in the format of sequents, we obtain similar results for a known &lambda;-calculus with variables and explicit substitutions, Rose's &lambda;bxgc.
Application of P2P (Peer-to-Peer) Technology to Marketing
Authors: Kato Tomoya, Yokoi Shigeki
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

Peer-to-Peer (P2P) networks are spreading, and their practicalapplications for the business scene are promising. However, theessence of P2P is missed by broad interpretations that do notmake it a problem whether to use P2P technology. Incidentally,although marketing activity currently consists mainly of Webpages or mail, it is difficult to actively find latent customers fromthe company side, and it is not necessarily an effective marketingmeans for a small-scale company. Therefore, in this paper, wediscuss the application of P2P technology to marketing. First,the essence of P2P is correctly extracted by focusing on the stateof the information that changes within a P2P network, andeffective fields in business are clarified. Next, by paying attentionto characteristics of P2P that have not yet been adequatelydeveloped in business, we have recognized that P2P marketingis promising from now on. We devise five models for applyingP2P networks to the marketing field (P2P marketing), andclarify P2P's marketing features through comparisons withexisting Internet marketing. Consequently, we reveal featuresnot currently held by Web pages or mail.