ppxscal/embedding_network huggingface dataset:
A Time-Frequency Well-localized Pulse for Multiple Carrier Transmission
Authors: Ralf Haas, Jean-Claude Belfiore
Venue: Wireless Personal Communications: An International Journal (1997)

In multicarrier transmission schemes, the essential requirement on the elementary pulse or envelope function is the orthogonality with its time-frequency shifted versions. However, the time and frequency dispersion of the mobile radio channel leads to the loss of orthogonality which produces intersymbol interference (ISI) and interchannel interference (ICI). Therefore, another requirement on the elementary pulse has to be imposed: the good localization in time and frequency. Based on the characteristics of the mobile radio channel, we design a new pulse to minimize ICI and ISI.
The Effects of Preparatory Sensory Information on ICU Patients
Authors: Shu-Feng Shi, Barbara A. Munjas, Thomas T. H. Wan, W. Richard Cowling,  III, Mary Jo Grap, Bill B. L. Wang
Venue: Journal of Medical Systems (2003)

Preparatory sensory information (PSI) has been found to have significant effects in reducing distress, tension, restlessness, negative moods, and anxiety, and also in reducing length of postoperative hospitalization during various threatening medical events, but no evidence has demonstrated the effect of PSI on a patient during ICU hospitalization. On the basis of Lazarus' theory, a structural equation model was developed to examine the role of the nursing intervention, PSI, as a significant factor influencing patients' processes of cognitive appraisals and coping, adaptational responses, and patient care outcomes during ICU hospitalization. The analytical model examined the net effect of PSI on outcomes, controlling for the effects of mastery, interpersonal trust, social support, socioeconomic status, severity of illness, age, and gender. A quasi-experiment was executed in four large acute care hospitals. Data were collected from 41 subjects in the control group and from 42 in the treatment group receiving PSI before ICU admission. Structural equation modeling was employed to test the proposed analytic model. The initial tests of model fit indicate that the original model did not fit the data well with GFI &equals; 0.85, AGFI &equals; 0.76, RMSEA &equals; 0.059, p&lowbar;close &equals; 0.28, and critical N &equals; 78. A revised model was developed, and the fit indices suggested an adequate fit with GFI &equals; 0.90, AGFI &equals; 0.84, RMSEA &equals; 0.00, p&lowbar;close &equals; 0.89, and critical N &equals; 109. These findings provide empirical support for Lazarus' theory on stress, appraisal, and coping. The findings also verify the beneficial effects of the nursing intervention of PSI on ICU patients.
Animate Characters
Authors: Barbara Hayes-Roth, Patrick Doyle
Venue: Autonomous Agents and Multi-Agent Systems (1998)

The world of everyday interactions is filled with characters, real or fictitious, and human knowledge of how to make these interactions satisfying and productive relies upon an understanding of character. As agents become more intelligent and more ubiquitous, we may naturally ask how we can endow them with life and personality to make them easier and more gratifying to use. This paper offers a broad definition of &ldquo;animate character,&rdquo; and examines the technical and artistic issues involved both in the creation and the evaluation of such systems. We provide example interactions with several character types. The paper concludes with an annotated bibliographic survey of work done in this area.
Writing the Future: Computers in Science Fiction
Authors: Jonathan Vos Post, Kirk L. Kroeker
Venue: Computer (2000)

Although we cannot be certain that science fiction directly influenced the course that computing technology has taken over the past 50 years, the genre has--at the very least--anticipated the technologies we're using and developing.Speculation about our future human relationship to computers-and to technology in general-has been the province of science fiction for at least a hundred years. But not all of that speculation has been as optimistic as those in the computing profession might assume.While cautionary tales in science fiction are plentiful and varied, the genre is also filled with more optimistic speculation about computer technology that will help save time, improve health, and generally benefit life as we know it.If we take a look at some of this speculation--both optimistic and pessimistic--as if it were prediction, it turns out that many science fiction authors have envisioned the future as accurately as historians have chronicled the past.Prediction is difficult, goes the joke, especially when it comes to the future. Yet science fiction authors have taken their self-imposed charters seriously; they've tested countless technologies in the virtual environments of their fiction.
Maximum weight stable set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time
Authors: Andreas Brandstädt, Suhail Mahfud
Venue: Information Processing Letters (2002)

Minty has shown that the Maximum Weight Stable Set (MWS) Problem can be solved in polynomial time when restricted to claw-free graphs. We show that the structure of graphs being both claw-free and co-claw-free is very simple which implies bounded clique width for this graph class. It is known that for graph classes of bounded clique width (assuming that k- expressions can be determined in linear time), there are linear time algorithms for all problems expressible in Monadic Second Order Logic with quantification only over vertex sets. The problems MWS, Maximum Clique, Domination and Steiner Tree, for example, are expressible in this way.Moreover, we describe the structure of prime graphs being both H- and H-free for any four-vertex graph H and obtain bounded clique width for these graph classes except the 2K2- and C4-free graphs.
Constructing Knowledge-Based Systems
Authors: Nigel Shadbolt, Enrico Motta, Alain Rouge
Venue: IEEE Software (1993)

Vital, a four-and-a-half-year ESPRIT II research and development project that involves nine organizations in five countries is discussed. It addresses the problems of effective process modeling for knowledge-based systems, providing guidelines on when to use various knowledge-engineering methods and techniques, and reducing the bottleneck in acquiring expert knowledge by providing both methodological and software support for developing large, industrial, knowledge-based system applications. The project goals, approach, and workbench are outlined, and a case study is described.
Feedforward Neural Networks Based Input-Output Models for RailwayCarriage System Identification
Authors: Tommy W. S. Chow, Oulian Shuai
Venue: Neural Processing Letters (1997)

Depending on the representation ability of neural networks for a nonlinear process, this paper develops procedures to locate the input space dimensions of feedforward neural networks for general practical nonlinear systems identification when only the outputs are accessible observations. The size of the input space is directly related to the involved system order. Hence based on our developed model, we are able to determine whether the system is faulty or not by monitoring the output error change. The methods are demonstrated in vibration signals that were measured by an accelerometer mounted on a traction centre of a railway carriage running at about 60 mph along the Hong Kong railway.
Persistence of Web References in Scientific Research
Authors: Steve Lawrence, David M. Pennock, Gary William Flake, Robert Krovetz, Frans M. Coetzee, Eric Glover, Finn Årup Nielsen, Andries Kruger, C. Lee Giles
Venue: Computer (2001)

Invalid URLs can lead to important data loss as cited works and research findings gradually disappear from circulation. The lack of persistence of Web references leads researchers to question whether publications should even include URL citations. To minimize the future loss of information, the authors review new long-term strategies for managing Internet resources and suggest several ways to improve citation practices. Their analysis of references to Web resources in 270,977 computer science publications revealed that URL citations have increased, but many are now invalid. The authors were, however, able to relocate most invalid Web references using two searches. They analyzed the missing links and identified reasons why URLs become invalid.
Analysis of visualisation requirements for fuzzy systems
Authors: Binh Pham, Ross Brown
Venue: Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2003)

This paper provides a comprehensive analysis of the working and requirements of fuzzy systems with the view to devise appropriate visualisation framework and techniques for these systems using a user- and task-oriented approach. We firstly discuss the nature of fuzzy data and the essential components of typical fuzzy systems, then categorise different visualisation requirements from three perspectives: user of fuzzy systems, designer of fuzzy systems and designer of visualisation systems. The visualisation framework also include mechanisms for capturing users' profiles in order to customise the system to their own needs. We then examine how different visualisation techniques can be adapted to satisfy these requirements. Motivations for an architecture of a visualisation system which is based on a multi-agent approach are also presented.
Rendering higher order finite element surfaces in hardware
Authors: Rahul Khardekar, David Thompson
Venue: Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2003)

Graphics hardware is becoming flexible enough to move more than just the traditional rendering pipeline off the CPU and onto the graphics card. We demonstrate a technique for rendering nonlinear (quadratic in our case) finite element boundaries, deflected by a vector field value and colored by a scalar field value. Simple performance measurements indicate that moving field value interpolation to the graphics card results yields roughly 50% speedup, however current hardware limits the color precision of the output. Finally, we discuss approaches to circumvent precision problems and other limitations using next generation hardware.
Beyond Incremental Change
Authors: Daniel S. Goldin, Samuel L. Venneri, Ahmed K. Noor
Venue: Computer (1998)

In the next 25 years NASA has ambitious goals: It wants to accurately predict climate and resources over decades, not just days. It wants to detect Earth-sized planets 600 trillion miles away with a telescope powerful enough to determine signs of life. It wants to use the International Space Station as a platform for an astronaut to visit Mars. This is the big vision, and to many it may sound more like science fiction. To help achieve these goals, in 1997 NASA and the University of Virginia's Center for Advanced Computational Technology began planning and developing the Intelligent Synthesis Environment. The ISE aims to link scientists, design teams, manufacturers, suppliers, and consultants in the creation and operation of an aerospace system and in synthesizing its missions. The ultimate goal is to significantly increase creativity and knowledge and eventually dissolve rigid cultural boundaries among diverse engineering and science teams.
Challenging search engines under copyright law: Part 1
Authors: Richard H. Stern
Venue: IEEE Micro (2002)

I decided to be ambitious and call this column "Part 1.' The US Court of Appeals on the West Coast (CA 9) recently handed down an opinion (in Kelly v. Arriba Soft) broadly condemning as illegal what it termed "framing" and apparently condemning all hyperlinking as well. It turns out, though, that what the CA 9 called framing is actually just putting an image from someone's Web page into a new browser window by using a deep, direct hyperlink to the image file. This is not framing. In fact, the only apparent difference between this and an ordinary link to the same content is that, in this case, returning to the place where you started requires clicking the X box in the screen's upper right corner rather than clicking the Back button. (You don't need to reload the previous page, either, because it stays in memory, but you don't see that.)
Mobile Agents for World Wide Web Distributed Database Access
Authors: Stavros Papastavrou, George Samaras, Evaggelia Pitoura
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

The popularity of the Web as a universal access mechanism for network information has created the need for developing web-based DBMS client/server applications. However, the current commercial applet-based approaches for accessing database systems offer limited flexibility, scalability, and robustness. In this paper, we propose a new framework for Web-based distributed access to database systems based on Java-based mobile agents. The framework supports lightweight, portable, and autonomous clients as well as operation on slow or expensive networks. The implementation of the framework using the aglet workbench shows that its performance is comparable to, and in some case outperforms, the current approach. In fact, in wireless and dial-up environments and for average size transactions, a client/agent/server adaptation of the framework provides a performance improvement of approximately a factor of ten. For the fixed network, the gains are about 40 percentand 30 percent, respectively. We expect our framework to perform even better when deployed using different implementation platforms as indicated by our preliminary results from an implementation based on Voyager.
The gods must be crazy: a matter of time in collaborative systems
Authors: Du Li, Limin Zhou, Richard Muntz
Venue: ACM SIGGROUP Bulletin (1999)

The concept of time in traditional distributed systems has been inherited in the Computer-Supported Collaborative Work (CSCW) literature. The following assumptions have generally been made: (1) Events are atomic and their durations do not matter. (2) Total ordering of events can be achieved by some mechanical algorithm. (3) The relationship between events is determined solely by time (causal relationship). However, we observe that these assumptions are not appropriate if the goal is to faithfully preserve user intentions in collaborative systems. In particular, we discuss why and how these assumptions should be relaxed or removed in the design of collaborative editing systems.
The Essence of Objects: Concepts and Terms
Authors: Alan Snyder
Venue: IEEE Software (1993)

Core concepts in object-oriented technology are defined. The concepts are the basis for characterizing and contrasting various object-oriented technologies. The core concepts are: all objects embody an abstraction, objects provide services, clients issue requests, objects are encapsulated, requests identify operations, requests can identify objects, new objects can be created, operations can be generic, objects can be classified in terms of their services, objects can have a common implementation, and objects can share partial implementations. To address communication problems, a glossary of terms appropriate for the diverse set of domains in which object-oriented concepts are being applied is developed. The definitions are grouped into three sections in top-down order: terms related to abstraction, terms related to requesting services, and terms related to performing services.
A Semiautomatic Method for Assigning Elevation in Contour Maps
Authors: Marco A. G. M. Maia, Átila L. F. Xavier
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

Assigning contour elevations during digitalization process of topographic charts can be a very time-consuming task and liable to human errors. The method here presented for this purpose is based upon the integration of three elements: the definition of nesting tree, a formal set of rules linking neighboring contour elevations and the concept of ambiguity interval. The information provided by the chart control points and its propagation on the nesting tree for ambiguity interval update allows to automatically evaluate a considerable number of elevations, typically 60%. The remaining curves are assessed with the help of an operator where an strategy is employed to minimize human interaction. At the end of the process, the typical figure describing the number of elevations requested by the system is around 20%.
Dynamic Code Partitioning for Clustered Architectures
Authors: Ramon Canal, Joan-Manuel Parcerisa, Antonio González
Venue: International Journal of Parallel Programming (2001)

Recent works^(1) show that delays introduced in the issue and bypass logic will become critical for wide issue superscalar processors. One of the proposed solutions is clustering the processor core. Clustered architectures benefit from a less complex partitioned processor core and thus, incur in less critical delays. In this paper, we propose a dynamic instruction steering logic for these clustered architectures that decides at decode time the cluster where each instruction is executed. The performance of clustered architectures depends on the inter-cluster communication overhead and the workload balance. We present a scheme that uses runtime information to optimize the trade-off between these figures. The evaluation shows that this scheme can achieve an average speed-up of 35% over a conventional 8-way issue (4&emsp14;int+4&emsp14;fp) machine and that it outperforms other previous proposals, either static or dynamic.
Software Architecture: Introducing IEEE Standard 1471
Authors: Mark W. Maier, David Emery, Rich Hilliard
Venue: Computer (2001)

IEEE Standard 1471 identifies sound practices to establish a framework and vocabulary for software architecture concepts.
Verification of delta-sigma converters using adaptive regression modeling
Authors: Jeongjin Roh, Suresh Seshadri, Jacob A. Abraham
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

A new verification technique for &Delta;&Sigma; analog-to-digital converters (ADC) is proposed. The ADC is partitioned into functional blocks, and adaptive regression models for each partition are constructed using transistor-level simulation data. Non-idealities in circuit behavior are captured by the adaptive regression technique from the collected data. The algorithms have been implemented in a simulation program ARSIM (Adaptive Regression Simulator), which performs data sampling, model building, and simulation. Experimental results using ARSIM are shown on a second-order &Delta;&Sigma; modulator, and they demonstrate the effectiveness of our technique as a fast and accurate approach for verifying &Delta;&Sigma; converters.
Designing the automatic transformation of visual languages
Authors: Dániel Varró, Gergely Varró, András Pataricza
Venue: Science of Computer Programming (2002)

The design process of complex systems requires a precise checking of the functional and dependability attributes of the target design. The growing complexity of systems necessitates the use of formal methods, as the exhaustiveness of checks performed by the traditional simulation and testing is insufficient.For this reason, the mathematical models of various formal verification tools are automatically derived from UML-diagrams of the model by mathematical transformations guaranteeing a complete consistency between the target design and the models of verification and validation tools.In the current paper, a general framework for an automated model transformation system is presented. The method starts from a uniform visual description and a formal proof concept of the particular transformations by integrating the powerful computational paradigm of graph transformation, planner algorithms of artificial intelligence, and various concepts of computer engineering.
Join Index Hierarchy: An Indexing Structure for Efficient Navigation in Object-Oriented Databases
Authors: Jiawei Han, Zhaohui (Alex) Xie, Yongjian Fu
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

A novel indexing structure¿join index hierarchy¿is proposed to handle the "gotos on disk" problem in object-oriented query processing. The method constructs a hierarchy of join indices and transforms a sequence of pointer chasing operations into a simple search in an appropriate join index file, and thus accelerates navigation in object-oriented databases. The method extends the join index structure studied in relational and spatial databases, supports both forward and backward navigations among objects and classes, and localizes update propagations in the hierarchy. Our performance study shows that partial join index hierarchy outperforms several other indexing mechanisms in object-oriented query processing.
Accelerating Learning from Experience: Avoiding Defects Faster
Authors: Lutz Prechelt
Venue: IEEE Software (2001)

Defect logging and defect data analysis aim to decrease programmers' repetitive errors. DLDA was inspired by Watts Humphrey's Personal Software Process but has a much lower learning cost. A controlled experiment validated the technique.
Joint local and global hardware adaptations for energy
Authors: Ruchira Sasanka, Christopher J. Hughes, Sarita V. Adve
Venue: Proceedings of the 10th international conference on Architectural support for programming languages and operating systems (2002)

This work concerns algorithms to control energy-driven architecture adaptations for multimedia applications, without and with dynamic voltage scaling (DVS). We identify a broad design space for adaptation control algorithms based on two attributes: (1) when to adapt or temporal granularity and (2) what structures to adapt or spatial granularity. For each attribute, adaptation may be global or local. Our previous work developed a temporally and spatially global algorithm. It invokes adaptation at the granularity of a full frame of a multimedia application (temporally global) and considers the entire hardware configuration at a time (spatially global). It exploits inter-frame execution time variability, slowing computation just enough to eliminate idle time before the real-time deadline.This paper explores temporally and spatially local algorithms and their integration with the previous global algorithm. The local algorithms invoke architectural adaptation within an application frame to exploit intra-frame execution variability, and attempt to save energy without affecting execution time. We consider local algorithms previously studied for non-real-time applications as well as propose new algorithms. We find that, for systems without and with DVS, the local algorithms are effective in saving energy for multimedia applications, but the new integrated global and local algorithm is best for the systems and applications studied.
Estimating Block Selectivities for Physical Database Design
Authors: P. -C. Chu
Venue: IEEE Transactions on Knowledge and Data Engineering (1992)

Access path deployment is a critical issue in physical database design. Access paths typically include a clustered index as the primary access path and a set of secondary indexes as auxiliary access paths. To deploy the right access paths requires an effective algorithm and accurate estimation of the parameters used by the algorithm. One parameter central to any index-selection algorithm is the block selectivity of a query. Existing methods for estimating block selectivities are limited by restrictive assumptions. Furthermore, most existing methods produce estimates useful for aiding the selection of secondary indexes only. Little research has been done in the area of estimating block selectivities for supporting the selection of the clustered index. The paper presents a set of methods that do not depend on any specific assumption, produce accurate estimates, and can be used to aid in selecting the clustered index as well as secondary indexes.