ppxscal/embedding_network huggingface dataset:
Context-aware communication for severely disabled users
Authors: Adriane B. Davis, Melody M. Moore, Veda C. Storey
Venue: Proceedings of the 2003 conference on Universal usability (2003)

Even with assistive communication technology, interactive conversation is extremely difficult for users with severely limited mobility and loss of speech. Input to such devices is painfully slow and subject to high error rates with the resulting output not reliably reflecting the true intentions of the user. Conversational prediction has been incorporated into assistive systems to help speed up communication but could be further improved by considering the contextual interaction between the user and conversant. Contextual information applied to user profiles can greatly enhance conversational prediction and increase a severely disabled user's control over his or her complex world. We present a framework that integrates a rich profile of the user, a model of the user's environment, and actors on that environment. To test the validity of the framework, we develop a set of profiles and apply them in two different scenarios. Initial results show that the context-aware user profiles can increase both the accuracy and speed of the communication.
Leakage-Proof Domino Circuit Design for Deep Sub-100nm Technologies
Authors: Ge Yang, Zhongda Wang, Sung-Mo Kang
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

The leakage power consumption in deep sub-100nmCMOS systems is projected to become a significant part ofthe total power dissipation. Although the dual Vt CMOSprocess helps reduce the subthreshold leakage current indomino circuits, the gate leakage problem poses asignificant design challenge. We propose two new circuittechniques to suppress both subthreshold leakage currentand gate leakage current in domino circuits. In standbymode, subthrshold leakage current is suppressed byusinging dual Vt devices in the two proposed circuits. Theproposed circuits generate low inputs and low outputs tosuppress gate leakage current in the NMOS logic tree instandby mode. Simulation results based on 45nm BSIM4models show that 32-bit adders using the two proposedcircuits can reduce the total standby leakage by 83.2%and 93.2%, respectively, compared with the adder usingsingle Vt domino circuits. Proposed adders have 7%active power overhead to achieve the same speed as singleVt domino adder and the area penalty is minimal withcareful layout.
On the Orthogonality of Geometric Codes
Authors: David G. Glynn
Venue: Designs, Codes and Cryptography (2004)

We solve some problems concerning the orthogonality of geometric codes associated with sets of i- and j-dimensional subspaces of PG(n, q). Various applications are found, and we discuss all the interesting cases in small dimensional spaces.
Expertise identification using email communications
Authors: Christopher S. Campbell, Paul P. Maglio, Alex Cozzi, Byron Dom
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

A common method for finding information in an organization is to use social networks---ask people, following referrals until someone with the right information is found. Another way is to automatically mine documents to determine who knows what. Email documents seem particularly well suited to this task of "expertise location", as people routinely communicate what they know. Moreover, because people explicitly direct email to one another, social networks are likely to be contained in the patterns of communication. Can these patterns be used to discover experts on particular topics? Is this approach better than mining message content alone? To find answers to these questions, two algorithms for determining expertise from email were compared: a content-based approach that takes account only of email text, and a graph-based ranking algorithm (HITS) that takes account both of text and communication patterns. An evaluation was done using email and explicit expertise ratings from two different organizations. The rankings given by each algorithm were compared to the explicit rankings with the precision and recall measures commonly used in information retrieval, as well as the d' measure commonly used in signal-detection theory. Results show that the graph-based algorithm performs better than the content-based algorithm at identifying experts in both cases, demonstrating that the graph-based algorithm effectively extracts more information than is found in content alone.
A soft-imprint technique for direct fabrication of submicron scale patterns using a surface-modified PDMS mold
Authors: Won Mook Choi, O. Ok Park
Venue: Microelectronic Engineering (2003)

A novel soft-imprint technique for fabrication of submicron scale polymer structures is proposed. The proposed technique, which can be performed at room temperature with very low pressure, is based on UV polymerization of a monomer that is patterned by application of an elastomeric polydimethylsiloxane (PDMS) mold. To prevent the swelling of the PDMS mold by the monomer during the polymerization procedure, the mold surface is coated with an amorphous fluoropolymer, Teflon AF. By using the surface-modified PDMS mold, the submicron scale polymer structures are successfully generated with good pattern fidelity, and are also fabricated over large areas through the UV-based soft-imprint technique.
The CIDOC conceptual reference module: an ontological approach to semantic interoperability of metadata
Authors: Martin Doerr
Venue: AI Magazine (2003)

This article presents the methodology that has been successfully used over the past seven years by an interdisciplinary team to create the International Committee for Documentation of the International Council of Museums (CIDOC) CONCEPTUAL REFERENCE MODEL (CRM), a high-level ontology to enable information integration for cultural heritage data and their correlation with library and archive information. The CIDOC CRM is now in the process to become an International Organization for Standardization (ISO) standard. This article justifies in detail the methodology and design by functional requirements and gives examples of its contents. The CIDOC CRM analyzes the common conceptualizations behind data and metadata structures to support data transformation, mediation, and merging. It is argued that such ontologies are property-centric, in contrast to terminological systems, and should be built with different methodologies. It is demonstrated that ontological and epistemological arguments are equally important for an effective design, in particular when dealing with knowledge from the past in any domain. It is assumed that the presented methodology and the upper level of the ontology are applicable in a far wider domain.
Automatic SOM Compatibility Check and FOM Development
Authors: Gary Tan, Yu Hu, Farshad Moradi
Venue: Proceedings of the Seventh IEEE International Symposium on Distributed Simulation and Real-Time Applications (2003)

The High Level Architecture (HLA) is widely used in defense applications as a common framework for modeling and simulation. The Federation Development and Execution Process (FEDEP) is a generalized process to build HLA federations from scratch. However, simulation model design, implementation, testing and execution defined in the FEDEP are time consuming and expensive. The Model Construction Environment (MCE) is introduced in this paper as a web-based system to enhance the efficiency of the federation development by reusing the existing Simulation Object Models (SOM) to build new Federation Object Models (FOM). To ensure the compatibility of the SOMs in a FOM, a Matching Algorithm is defined and tested. An Extensible Elements scheme is designed to help shape the characteristics of the FOM/SOMs. This study can contribute to more cost-efficient methodologies for the development and execution of simulation models.
Virtual routers: a tool for networking research and education
Authors: Florian Baumgartner, Torsten Braun, Eveline Kurt, Attila Weyland
Venue: ACM SIGCOMM Computer Communication Review (2003)

Virtual routers are software entities, i.e. user space processes, emulating IP routers on one or several (Linux) computers. Virtual routers can be used for both networking research and education. In contrast to simulation, virtual routers process packets in real-time and the virtual router code is similar to code in real routers. In the case of research, larger network test-beds can be built using a relatively small number of computers. New functionalities such as new queuing mechanisms are supported by a modular software architecture and can be tested in a rather safe environment compared to kernel space implementations. Virtual routers can also be used as a tool aiming to allow students to perform virtual experiments within a computer networks course. Students can create and experiment with arbitrary virtual IP network topologies. The web-based user interface allows students to interact remotely with the emulated routers, but simultaneously it is very similar to commonly available configuration interfaces of network devices in reality. This enables students to configure routers like in the real world but also to experiment in a much more robust and safe environment.
Data Mining for Very Busy People
Authors: Tim Menzies, Ying Hu
Venue: Computer (2003)

Most modern businesses can access mountains of data electronically¿the trick is effectively using that data. In practice, this means summarizing large data sets to find the data that really matters. Most data miners are zealous hunters seeking detailed summaries and generating extensive and lengthy descriptions. The authors take a different approach and assume that busy people don't need¿or can't use¿complex models. Rather, they want only the data they need to achieve the most benefits.Instead of finding extensive descriptions of things, their data mining tool hunts for a minimal difference set between things because they believe a list of essential differences is easier to read and understand than detailed descriptions.
Aerospace vehicle and air traffic simulation
Authors: A. R. Pritchett, M. M. van Paassen, F. P. Wieland, E. N. Johnson
Venue: Applied system simulation: methodologies and applications (2003)

Simulation has long been an important part of the aerospace industry. This chapter reviews two prevalent types of simulation: (1) vehicle simulations based on continuous time models of vehicle dynamics, and their applications in human in the loop simulation and in system design and integration; and (2) large-scale air traffic simulations based on a variety of simulation methods. The conclusions note current research directions in aerospace simulation, including easy model re-use and re-configuration, identification of the correct level of simulation fidelity, and better methods of linking together simulations.
Efficient dynamic mining of constrained frequent sets
Authors: Laks V. S. Lakshmanan, Carson Kai-Sang Leung, Raymond T. Ng
Venue: ACM Transactions on Database Systems (TODS) (2003)

Data mining is supposed to be an iterative and exploratory process. In this context, we are working on a project with the overall objective of developing a practical computing environment for the human-centered exploratory mining of frequent sets. One critical component of such an environment is the support for the dynamic mining of constrained frequent sets of items. Constraints enable users to impose a certain focus on the mining process; dynamic means that, in the middle of the computation, users are able to (i) change (such as tighten or relax) the constraints and/or (ii) change the minimum support threshold, thus having a decisive influence on subsequent computations. In a real-life situation, the available buffer space may be limited, thus adding another complication to the problem.In this article, we develop an algorithm, called DCF, for Dynamic Constrained Frequent-set computation. This algorithm is enhanced with a few optimizations, exploiting a lightweight structure called a segment support map. It enables DCF to (i) obtain sharper bounds on the support of sets of items, and to (ii) better exploit properties of constraints. Furthermore, when handling dynamic changes to constraints, DCF relies on the concept of a delta member generating function, which generates precisely the sets of items that satisfy the new but not the old constraints. Our experimental results show the effectiveness of these enhancements.
Special Issue: Configuration
Authors: Timo Soininen, Markus Stumptner
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2003)

The configuration task is commonly defined as composing a complex product from a set of predefined component types while taking into account a set of well-defined restrictions on how components belonging to these types can be combined. Configuration, always a successful artificial intelligence (AI) application area ever since the R1&sol;XCON system of the early 1980s, has recently attracted renewed research interest. This is also demonstrated by an annual series of workshops on configuration that have been held at the AAAI, ECAI, and IJCAI conferences since 1999. Important real-world industrial configuration tasks are encountered in marketing, manufacturing, and design. They usually involve physical products, such as telecommunication switches, computers, elevators, large diesel engines, automation systems, or vehicles (some of which appear as application domains in the articles in this issue), but can also pertain to financial or other services or software.
Distributed frameworks and parallel algorithms for processing large-scale geographic data
Authors: Kenneth A. Hawick, P. D. Coddington, H. A. James
Venue: Parallel Computing (2003)

The number of applications that require parallel and high-performance computing techniques has diminished in recent years due to to the continuing increase in power of PC, workstation and mono-processor systems. However, Geographic information systems (GIS) still provide a resource-hungry application domain that can make good use of parallel techniques. We describe our work with geographical systems for environmental and defence applications and some of the algorithms and techniques we have deployed to deliver high-performance prototype systems that can deal with large data sets. GIS applications are often run operationally as part of decision support systems with both a human interactive component as well as large scale batch or server-based components. Parallel computing technology embedded in a distributed system therefore provides an ideal and practical solution for multi-site organisations and especially government agencies who need to extract the best value from bulk geographic data.We describe the distributed computing approaches we have used to integrate bulk data and metadata sources and the grid computing techniques we have used to embed parallel services in an operational infrastructure. We describe some of the parallel techniques we have used: for data assimilation; for image and map data processing; for data cluster analysis; and for data mining. We also discuss issues related to emerging standards for data exchange and design issues for integrating together data in a distributed ownership system. We include a historical review of our work in this area over the last decade which leads us to believe parallel computing will continue to play an important role in GIS. We speculate on algorithmic and systems issues for the future.
An Immersed Interface Method for Incompressible Navier-Stokes Equations
Authors: Long Lee, Randall J. LeVeque
Venue: SIAM Journal on Scientific Computing (2003)

The method developed in this paper is motivated by Peskin's immersed boundary (IB) method, and allows one to model the motion of flexible membranes or other structures immersed in viscous incompressible fluid using a fluid solver on a fixed Cartesian grid. The IB method uses a set of discrete delta functions to spread the entire singular force exerted by the immersed boundary to the nearby fluid grid points. Our method instead incorporates part of this force into jump conditions for the pressure, avoiding discrete dipole terms that adversely affect the accuracy near the immersed boundary. This has been implemented for the two-dimensional incompressible Navier--Stokes equations using a high-resolution finite-volume method for the advective terms and a projection method to enforce incompressibility. In the projection step, the correct jump in pressure is imposed in the course of solving the Poisson problem. This gives sharp resolution of the pressure across the interface and also gives better volume conservation than the traditional IB method. Comparisons between this method and the IB method are presented for several test problems. Numerical studies of the convergence and order of accuracy are included.
On the data hiding theory and multimedia content security applications
Authors: Ali N. Akansu
Venue:  (2002)

This dissertation is a comprehensive study of digital steganography for multimedia content protection. With the increasing development of Internet technology, protection and enforcement of multimedia property rights has become a great concern to multimedia authors and distributors. Watermarking technologies provide a possible solution for this problem. The dissertation first briefly introduces the current watermarking schemes, including their applications in video, image and audio. Most available embedding schemes are based on direct Spread Sequence (SS) modulation. A small value pseudo random signature sequence is embedded into the host signal and the information is extracted via correlation. The correlation detection problem is discussed at the beginning. It is concluded that the correlator is not optimum in oblivious detection. The Maximum Likelihood detector is derived and some feasible suboptimal detectors are also analyzed. Through the calculation of extraction Bit Error Rate (BER), it is revealed that the SS scheme is not very efficient due to its poor host noise suppression. The watermark domain selection problem is addressed subsequently. Some implications on hiding capacity and reliability are also studied. The last topic in SS modulation scheme is the sequence selection. The relationship between sequence bandwidth and synchronization requirement is detailed in the work. It is demonstrated that the white sequence commonly used in watermarking may not really boost watermark security. To address the host noise suppression problem, the hidden communication is modeled as a general hypothesis testing problem and a set partitioning scheme is proposed. Simulation studies and mathematical analysis confirm that it outperforms the SS schemes in host noise suppression. The proposed scheme demonstrates improvement over the existing embedding schemes. Data hiding in audio signals are explored next. The audio data hiding is believed a more challenging task due to the human sensitivity to audio artifacts and advanced feature of current compression techniques. The human psychoacoustic model and human music understanding are also covered in the work. Then as a typical audio perceptual compression scheme, the popular MP3 compression is visited in some length. Several schemes, amplitude modulation, phase modulation and noise substitution are presented together with some experimental results. As a case study, a music bitstream encryption scheme is proposed. In all these applications, human psychoacoustic model plays a very important role. A more advanced audio analysis model is introduced to reveal implications on music understanding. In the last part, conclusions and future research are presented.
Consistent document engineering: formalizing type-safe consistency rules for heterogeneous repositories
Authors: Jan Scheffczyk, Uwe M. Borghoff, Peter Rödig, Lothar Schmitz
Venue: Proceedings of the 2003 ACM symposium on Document engineering (2003)

When a group of authors collaboratively edits interrelated documents, consistency problems occur almost immediately. Current document management systems (DMS) provide useful mechanisms such as document locking and version control, but often lack consistency management facilities.If at all, consistency is "defined" via informal guidelines, which do not support automatic consistency checks.In this paper, we propose to use explicit formal consistency rules for heterogeneous repositories that are managed by traditional DMS. Rules are formalized in a variant of first-order temporal logic. Functions and predicates, implemented in a full programming language, provide complex (even higher-order) functionality. A static type system supports rule formalization, where types also define (formal) document models. In the presence of types, the challenge is to smoothly combine a first-order logic with a useful type system including subtyping. In implementing a tolerant view of consistency, we do not expect that repositories satisfy consistency rules. Instead, a novel semantics precisely pinpoints inconsistent document parts and indicates when, where, and why a repository is inconsistent.Our major contributions are (1) the use of explicit formal rules giving a precise (and still comprehensible) notion of consistency, (2) a static type system securing the formalization process, (3) a novel semantics pinpointing inconsistent document (parts) precisely, and (4) a design of how to automatically check consistency for document engineering projects that use existing DMS. We have implemented a prototype of a consistency checker. Applied to real world content, it shows that our contributions can significantly improve consistency in document engineering processes.
First Look at ADO.NET and System Xml v 2.0
Authors: Alex Homer, Dave Sussman, Mark Fussell
Venue:  (2003)

Alex Homer is managing director of Stonebroom, Ltd., a software-development, consulting, and training organization. He was formerly lead technical author and reviewer for Wrox Press, specializing in Microsoft Web and database technologiesDave Sussman speaks frequently at Microsoft development conferences and has been writing about ASP since its earliest releases.Mark Fussell is a lead program manager at Microsoft, working on XML and Web service technologies. He designed the XML APIs in version 1.0 release of System.Xml in the .NET Framework and worked on the design of version 2.0 until the end of 2004. In this role, he helped define the future direction of XML and data access in the .NET Framework and within SQL Server 2005. Mark is now the program manager for the Web Services Enhancements (WSE) product, which enables developers to build advanced, secure, service-oriented applications within Visual Studio, based around the WS-* specifications. Fortunately, this still allows him to work with developers and the XML APIs in .NET, and to remain passionate about current and emerging XML technologies to integrate data across platforms-XML came, it saw, it integrated. Mark speaks regularly at conferences and can be contacted via his blog at http://blogs.msdn.com/mfussell.
A formalization of the CORDS Process Model using Mondel
Authors: Ferhat Khendek, Gregor v. Bochmann
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2 (1992)

The CORDS Process Model (CPM) represents an architectural model on which the components of the CORDS project will be patterned. The CPM describes a set of concepts, like process, port, conventions for process creation, ports initialization and binding, and some abstract primitives for interprocess communication. It includes a set of language independent datatypes that can appear in messages exchanged between processes and an interface definition mechanism for specifying contracts between communicating processes. In this paper, we describe formally the concepts of inport, outport, and process using the object-oriented specification language Mondel. The modelization in Mondel of the abstract primitives of the CPM is provided. We also discuss the applications and advantages of such formal description of the CPM.