ppxscal/embedding_network huggingface dataset:
Blind Equalization with Differential Detection for Channels with ISI and Fading
Authors: Eloise Tse, Subbarayan Pasupathy
Venue: Wireless Personal Communications: An International Journal (1999)

Schemes which combine differential detection and blind equalization, to eliminate the need for phase recovery and training sequence, are studied. Decision feedback is also added in an attempt to equalize null and fading channels. Using Godard and Modified Constant Modulus Algorithms (MCMA) new systems are proposed by combining coherent and noncoherent detection with these two algorithms. For MCMA, as it can track the carrier, neither differential detection nor a PLL is required. Contrarily, Godard Algorithm needs either differential detection or a PLL to correct phase error. While the proposed system combining differential detection, blind equalization and decision feedback can indeed, in principle, equalize different channels, the robustness of the system is compromised.
Teaching ocean wave forecasting using computer-generated visualization and animation--Part 2: swell forecasting
Authors: Dennis J. Whitford
Venue: Computers Geosciences (2002)

This paper, the second of a two-part series, introduces undergraduate students to ocean wave forecasting using interactive computer-generated visualization and animation. Verbal descriptions and two-dimensional illustrations are often insufficient for student comprehension. Fortunately, the introduction of computers in the geosciences provides a tool for addressing this problem. Computer-generated visualization and animation, accompanied by oral explanation, have been shown to be a pedagogical improvement to more traditional methods of instruction. Cartographic science and other disciplines using geographical information systems have been especially aggressive in pioneering the use of visualization and animation, whereas oceanography has not. This paper will focus on the teaching of ocean swell wave forecasting, often considered a difficult oceanographic topic due to the mathematics and physics required, as well as its interdependence on time and space. Several MATLAB® software programs are described and offered to visualize and animate group speed, frequency dispersion, angular dispersion, propagation, and wave height forecasting of deep water ocean swell waves. Teachers may use these interactive visualizations and animations without requiring an extensive background in computer programming. Published by Elsevier Science Ltd.
A New Methodology to Evaluate Locking Protocols
Authors: Y. -F. Huang, Y. -H. Chin
Venue: IEEE Transactions on Knowledge and Data Engineering (1990)

The average lock range (ALR) is proposed as an evaluation factor for measuring the strengths and weaknesses of locking-based concurrency control methods, for both structural and nonstructural locking. The methodology provides a simple and general way to analyze the performance of any locking method, and requires no queueing model. Based on the concept of the ALR, two popular locking protocols, the 2PL protocol and the tree protocol, are analyzed and a simulation is done to validate the correctness of the ALR model.
Testing Methodology for FireWire
Authors: Lee Melatti, Barry Blancha
Venue: IEEE Design Test (1999)

This article describes a methodology for testing a high-performance serial bus interface commonly referred to as FireWire. FireWire is specified by the IEEE 1394 standard and offered by IC manufacturers in various scalable configurations. In general, this low-cost device provides a high-speed data path between various systems and products such as PCs and video devices. FireWire is also usable as a backplane bus interconnect, and ASIC manufacturers offer FireWire standard cells for use in custom device designs. Tester and implementation costs must be reasonable, execution time short, and test results accurate to assure cost-effective production. The methodology described in this article fulfills these goals with a minimum of compromises to the ideal solution. A PLCC device with an 8-bit parallel port and multiple serial ports on an Advantest T6681 VLSI Logic Test System validated this methodology.
Prolog/Rex-A Way to Extend Prolog for Better Knowledge Representation
Authors: S. Vranes, M. Stanojevic
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

Prolog/Rex represents a powerful amalgamation of the latest techniques for knowledge representation and processing, rich in semantic features that ease the difficult task of encoding heterogeneous knowledge of real-world applications. The Prolog/Rex concept mechanism lets a user represent domain entities in terms of their structural and behavioral properties, including multiple inheritance, arbitrary user-defined relations among entities, annotated values (demons), incomplete knowledge, etc. A flexible rule language helps the knowledge engineer capture human expertise and provide flexible control of the reasoning process. Additional Prolog/Rex strength that cannot be found in any other hybrid language made on top of Prolog is language level support for keeping many potentially contradictory solutions to a problem, allowing possible solutions and their implications to be automatically generated and completely explored before they are committed. The same mechanism is used to model time-states, which are useful in planning and scheduling applications of Prolog/Rex.
Applying Reliability Models More Effectively
Authors: Michael R. Lyu, Allen Nikora
Venue: IEEE Software (1992)

A set of linear combination software reliability models that combine the results of single, or component, models is presented. It is shown that, as measured by statistical methods for determining a model's applicability to a set of failure data, a combination model tends to have more accurate short-term and long-term predictions than a component model. These models were evaluated using both historical data sets and data from recent Jet Propulsion Laboratory projects. The computer-aided software reliability estimation (CASRE) tool, which automates many reliability measurement tasks and makes it easier to apply reliability models and to form combination models, is described.
IN THE NEWS
Venue: IEEE Software (2002)

Has Object-Oriented Programming Delivered?Aviation Software Guidelines
A Data Structure for Fast Region Searches
Authors: Y. S. Kuo, S. -Y. Hwang, H. F. Hu
Venue: IEEE Design Test (1989)

Bucketing, also known as fixed cells, is a data structure that is especially suitable for queries that cover small windows. However, this technique is not efficient if objects are long and narrow, such as wires. Also, as more objects are added, the efficiency of the query process may suffer. The authors describe a dynamic bucketing structure that maintains a two-level director structure and uses a directory doubting and merging technique called extendible hashing. This technique allows directories to expand without sacrificing performance as more objects are inserted into the structure. They report the results of tests comparing the performance of dynamic bucketing with the performance of the quad-tree algorithms.
Mosaic and the World Wide Web
Authors: Ronald J. Vetter, Chris Spell, Charles Ward
Venue: Computer (1994)

The World-Wide Web, an information service on the Internet, uses hypertext links to other textual documents or files. Users can click on a highlighted word or words in the text to provide additional information about the selected word(s). Users can also access graphic pictures, images, audio clips, or even full-motion video through hypermedia, an extension of hypertext. One of the most popular graphics-oriented browsers is Mosaic, which was developed at the National Center for Supercomputing Applications (NCSA) as a way to graphically-navigate the WWW. Mosaic browsers are currently available for Unix workstations running X Windows, PCs running Microsoft Windows, and Macintosh computers. Mosaic can access data in WWW servers, Wide Area Information Servers (WAIS), Gopher servers, Archie servers, and several others. The World-Wide Web is still evolving at a rapid pace. Distributed hypermedia systems on the Internet will continue to be an active area of development in the future. The flexibility of the WWW design, its use of hyperlinks, and the integration of existing WAIS and Gopher information resources, make the WWW ideal for future research and study. Highly interactive multimedia applications will require more sophisticated tools than currently exist. The most significant issue that needs to be resolved is the mismatch between WWW system capabilities and user requirements in the areas of presentation and quality of service.
Our Modern Times: The New Nature of Capitalism in the Information Agey
Authors: Daniel Cohen
Venue:  (2002)

:The "modern times" of the early twentieth century saw the rise of the assembly line and the belief that standardization would make the world a better place. Yet along with greater production efficiency came dehumanization, as the division of labor created many jobs requiring mindless repetition rather than conscious involvement with work. In our own modern times, a comparable revolution has been wrought by information technology. In Our Modern Times, Daniel Cohen traces the roots of this revolution back to the uprisings of 1968, when the youth of the industrialized world rejected the bourgeois values of their parents and the general situation of the workers. Students raised in the anti-establishment culture of the 1960s were able to shatter the world of standardization created by their parents. By the end of the twentieth century, information technology had created decentralized work structures that encouraged autonomy and personal initiative. But with this greater flexibility came the psychic stress and burnout of "24/7." Cohen explores the many ways that the new technology has changed our work and personal lives, our very conceptions of family and community. He argues compellingly that the present era represents a revolution that will be completed only when the importance of human capital is no longer overshadowed by the cost-saving efficiencies demanded by financial capital.
The motion of two axi-symmetric rigid bodies with friction coupling
Authors: E. V. Wilms, H. Cohen
Venue: Zeitschrift f&uuml;r Angewandte Mathematik und Physik (ZAMP) (2002)

Two axi-symmetric rigid bodies which are undergoing free motion, and which have Coulomb friction coupling, are considered. The motion of the system is determined. It is shown that friction destabilizes the system. When perturbed from a state of steady motion, the system seeks a coupled, rather than an uncoupled, configuration.
Querying Time Series Data Based on Similarity
Authors: Davood Rafiei, Alberto O. Mendelzon
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

We study similarity queries for time series data where similarity is defined, in a fairly general way, in terms of a distance function and a set of affine transformations on the Fourier series representation of a sequence. We identify a safe set of transformations supporting a wide variety of comparisons and show that this set is rich enough to formulate operations such as moving average and time scaling. We also show that queries expressed using safe transformations can efficiently be computed without prior knowledge of the transformations. We present a query processing algorithm that uses the underlying multidimensional index built over the data set to efficiently answer similarity queries. Our experiments show that the performance of this algorithm is competitive to that of processing ordinary (exact match) queries using the index, and much faster than sequential scanning. We propose a generalization of this algorithm for simultaneously handling multiple transformations at a time, and give experimental results on the performance of the generalized algorithm.
Global Committability in Multidatabase Systems
Authors: Ahmed K. Elmagarmid, Jin Jing, Won Kim, Omran Bukhres, Aidong Zhang
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

In this paper we develop a formal basis for research into the reliability aspects of transaction processing in multidatabase systems. We define a new correctness notion called global committability(GC) for the correct unilateral commit and retry recovery of global transactions in an autonomous MDBS environment. This notion facilitates to ensure the isolation property of global transactions when the retry approach is applied. The formalization work illustrates that conventional serializability (SR) notion and recoverability (RC) notion are not sufficient to specify a correct execution (i.e., isolated execution and recovery) of global transactions when the unilateral commit and the retry recovery are used to ensure the atomicity of global transactions. This work is significant because the unilateral commit and the retry recovery is an attractive complementary means to the undo recovery (whose correct schedule is specified by the conventional RC notion) for advanced transaction applications with characteristics of site autonomy and long-lived execution.
A VLSI Constant Geometry Architecture for the Fast Hartley and Fourier Transforms
Authors: E. L. Zapata, F. Argüello
Venue: IEEE Transactions on Parallel and Distributed Systems (1992)

An application-specific architecture for the parallel calculation of the decimation in time and radix 2 fast Hartley (FHT) and Fourier (FFT) transforms is presented. A real sequence with N=2/sup n/ data items is considered as input. The system calculates the FHT and the FFT in n and n+1 stages. respectively. The modular and regular parallel architecture is based on a constant geometry algorithm using butterflies of four data items and the perfect unshuffle permutation. With this permutation, the mapping of the algorithm in VLSI technology is simplified and the communications among processors are minimized. Organization of the processor memory based on first-in, first-out (FIFO) queues facilitates a systolic data flow and permits the implementation in a direct way of the complex data movements and address sequences of the transforms. This is accomplished by means of simple multiplexing operations, using hardwired control. The total calculation time is (Nlog/sub 2/N)/4Q cycles for the FHT and N(1+log/sub 2/N)/4Q cycles for the FFT, where Q is the number of processors (Q= 2/sup q/, Q>or=N/4).
Reflections on Using a UIMS for Complex Applications
Authors: David J. Kasik, Michelle A. Lund, Henry W. Ramsey
Venue: IEEE Software (1989)

The building of a user interface management system (UIMS) is described from the perspective of the development team. This UIMS is a key component of the open-architecture system-integration services (OASIS) project at Electronic Data Systems. While OASIS's application domain is generally CAD/CAM/CAE (computer-aided design/manufacturing/engineering), users can extend its functionality by using a command macro language. The results are presented as observations and impressions gathered from the programming and training staffs, users, UIMS developers.
Optimal 2-Bit Branch Predictors
Venue: IEEE Transactions on Computers (1995)

This paper presents an efficient technique to analyze finite-state machines to determine an optimal one for branch prediction. It also presents results from using this technique to determine optimal 4-state branch predictors for applications in the SPEC89 benchmark suite running on the IBM RS/6000. The paper concludes that the simple 2-bit counter is the only machine that performs consistently well and close to the optimal over all applications.
Semi-immersive space mission design and visualization: case study of the "terrestrial planet finder" mission
Authors: Ken Museth, Alan Barr, Martin W. Lo
Venue: Proceedings of the conference on Visualization '01 (2001)

This paper addresses visualization issues of the Terrestrial Planet Finder Mission[2]. The goal of this mission is to search for chemical signatures of life in distant solar systems using five satellites flying in formation to simulate a large telescope. To design and visually verify such a delicate mission one has to analyze and interact with many different 3D spacecraft trajectories, which is often difficult in 2D. We employ a novel trajectory design approach using invariant manifold theory, which is best understood and utilized in an immersive setting. The visualization also addresses multi-scale issues related to the vast differences in distance, velocity, and time at different phases of the mission. Additionally, the parameterization and coordinate frames used for numerical simulations may not be suitable for direct visualization. Relative motion presents a more serious problem where the patterns of the trajectories can only be viewed in particular rotating frames. Some of these problems are greatly relieved by using interactive, animated stereo 3D visualization in a semi-immersive environment such as a Responsive Workbench. Others were solved using standard techniques such as a stratify approach with multiple windows to address the multi-scale issues, re-parameterizations of trajectories and associated 2D manifolds and relative motion of the camera to "evoke" the desired patterns.
Linearizing Some Recursive Logic Programs
Authors: Irène Guessarian, Jean-Eric Pin
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

We give in this paper a sufficient condition under which the least fixpoint of the equation X=a+f(X)X equals the least fixpoint of the equation X=a+f(a)X. We then apply that condition to recursive logic programs containing chain rules: we translate it into a sufficient condition under which a recursive logic program containing n¿ 2 recursive calls in the bodies of the rules is equivalent to a linear program containing at most one recursive call in the bodies of the rules. We conclude with a discussion comparing our condition with the other approaches to linearization studied in the literature.
On the Statistics of Spectrogram Reassignment Vectors
Authors: Eric Chassande-Mottin Patrick Flandrin, Francois Auger
Venue: Multidimensional Systems and Signal Processing (1998)

Reassignment is a non-linear technique which can improve on the localization of a spectrogram by moving its values according to a suitable vector field. Statistical properties of spectrogram reassignment vectors are investigated in detail. Closed form expressions are given when the observation consists in a non-random component embedded in white Gaussian circular noise, and when the analysis window is Gaussian. An extension to arbitrary windows is also proposed and theoretical claims are supported by numerical simulations.
Vocal Access to a Newspaper Archive: Assessing the Limitations of Current Voice Information Access Technology
Authors: Fabio Crestani
Venue: Journal of Intelligent Information Systems (2003)

This paper presents the design and the current prototype implementation of an interactive vocal Information Retrieval system that can be used to access articles of a large newspaper archive using a telephone. The implementation of the system highlights the limitations of current voice information retrieval technology, in particular of speech recognition and synthesis. We present our evaluation of these limitations and address the feasibility of intelligent interactive vocal information access systems.
Local Reasoning and Knowledge Compilation for Efficient Temporal Abduction
Authors: Luca Console, Paolo Terenziani, Daniele Theseider Dupré
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

Generating abductive explanations is the basis of several problem solving activities such as diagnosis, planning, and interpretation. Temporal abduction means generating explanations that do not only account for the presence of observations, but also for temporal information on them, based on temporal knowledge in the domain theory. We focus on the case where such a theory contains temporal constraints that are required to be consistent with temporal information on observations. The aim of this paper is to propose efficient algorithms for computing temporal abductive explanations. Temporal constraints in the theory and in the observations can be used actively by an abductive reasoner in order to prune inconsistent candidate explanations at an early stage during their generation. However, checking temporal constraint satisfaction frequently generates some overhead. In the paper, we analyze two incremental ways of making this process efficient. First we show how, using a specific class of temporal constraints (which is expressive enough for many applications), such an overhead can be reduced significantly, yet preserving a full pruning power. In general, the approach does not affect the asymptotic complexity of the problem, but it provides significant advantages in practical cases. We also show that, for some special classes of theories, the asymptotic complexity is also reduced. We then show how, compiled knowledge based on temporal information, can be used to further improve the computation, thus, extending to the temporal framework previous results in the case of atemporal abduction. The paper provides both analytic and experimental evaluations of the computational advantages provided by our approaches.
Literature-based discovery on the World Wide Web
Authors: Michael Gordon, Robert K. Lindsay, Weiguo Fan
Venue: ACM Transactions on Internet Technology (TOIT) (2002)

Previous research has shown that researchers can generate medical hypotheses by using computers to analyze several, seemingly unrelated, medical literatures. In this work we suggest broader application for the ideas of literature-based discovery. Specifically, we suggest that literature-based discovery can be fruitful in areas other than medicine; that in addition to finding "cures" for "problems," literature-based discovery offers the possibility of finding new problems for existing technologies; that the analysis of a single literature may be sufficient for literature-based discovery; and that literature-based discovery can support individuals seeking to draw together ideas from various areas of inquiry, even if such connections have been previously made by others.We describe literature-based discovery experiments conducted on the World Wide Web that support these ideas.
Fast Extraction of Semantic Features from a Latent Semantic Indexed Text Corpus
Authors: A. Kabán, M. A. Girolami
Venue: Neural Processing Letters (2002)

This paper proposes a projection-based symmetrical factorisation method for extracting semantic features from collections of text documents stored in a Latent Semantic space. Preliminary experimental results demonstrate this yields a comparable representation to that provided by a novel probabilistic approach which reconsiders the entire indexing problem of text documents and works directly in the original high dimensional vector-space representation of text. The employed projection index is derived here from the a priori constraints on the problem. The principal advantage of this approach is computational efficiency and is obtained by the exploitation of the Latent Semantic Indexing as a preprocessing stage. Simulation results on subsets of the 20-Newsgroups text corpus in various settings are provided.
Testing Logic-Intensive Memory ICs on Memory Testers
Authors: Robert Wu, Jerry Gerner, Richard Wheelus, Kevin Lew
Venue: IEEE Design Test (1997)

Currently, a fully-equipped logic tester costs several million dollars more than a memory tester. If logic ICs could be tested in part on less-expensive memory testers, the benefits would be two-fold: significant cost savings and greatly increased productivity. This paper describes one method of converting certain types of tests traditionally performed by logic testers onto a memory test system. Using an innovative software tool called LOTOM (LOgic TO Memory) to convert logic test vectors into memory test patterns and to generate test programs, sample time savings of 99% (compared to doing the same job manually) have been achieved.