ppxscal/embedding_network huggingface dataset:
Proceedings of the First International Workshop on Haptic Human-Computer Interaction
Authors: Stephen A. Brewster, Roderick Murray-Smith
Venue: Lecture Notes In Computer Science; Vol. 2058 (2000)

:"Haptic, human-computer interaction is interaction between a human computer user and the computer user interface based on the powerful human sense of touch. Haptic hardware has been discussed and explored for some time, in particular in the context of computer games. Haptic technology is now maturing and migrating from research labs into real-world applications and commercial products. However, so far, little attention has been paid to the general principles of haptic HCI and the systematic use of haptic devices for improving efficiency, effectiveness, and satisfaction in HCI." This book is the first one to focus on haptic human-computer interaction. It is based on a workshop held in Glasgow, UK, in August/September 2000.
Granulometric Size Density for Segmented Random-Disk Models
Authors: Edward R. Dougherty
Venue: Journal of Mathematical Imaging and Vision (2002)

This design of optimal filters depends upon the random processes under consideration and the operator class from which a filter is to be chosen. Analytic derivation of an optimal filter is facilitated by finding partial descriptors of the random processes that facilitate analytic derivation of an optimal filter from the descriptors&mdash;for linear filtering, derivation of the optimal filter is via the covariance function. For nonlinear filtering of random sets (binary images), an analogous approach applies to the derivation of an optimal granulometric bandpass filter (GBF) by means of the granulometric size densities (GSDs) of the signal and noise. A GBF operates by passing or not passing components of a random set. For simply shaped grains having convenient analytic description, finding the GSD is not too difficult&semi; however, when the disjoint union results from the segmentation of a non-disjoint union, the resulting process, and its GSD, can become very complex. This paper postulates a constrained overlap random-set model, and then finds the GSD for the segmented random set. The primary grain of the random model is a disk of random radius and segmentation is via the watershed transformation. Even for a union of disks, modest intersection greatly enhances the difficulty of finding the GSD, and therefore of designing optimal bandpass filters. Although application to disks is specialized, it gives quantitative insight into the effects of grain overlapping and segmentation. Such restriction to a tractable model is not uncommon in the literature of random sets when quantitative estimation results are desired.
IT research, innovation, and e-government
Authors: William L. Scherlis, Jon Eisenberg
Venue: Communications of the ACM (2003)

Over the past few years, the basic outline of an e-government vision has emerged, and government has taken promising steps to deploy e-government services. Much remains to be done, however, both in implementing e-government services and in developing new technologies and concepts, if the e-government vision is to be broadly realized. A recent study by the National Research Council's Computer Science and Telecommunications Board [2] examines several aspects of this challenge. It identifies areas where government is a demand leader for IT, explores the roles of IT researchers in risk-managed e-government innovation, and discusses approaches that can help accelerate innovation and foster the transition of innovative technologies from the lab to operational systems.
The Complex EGI: A New Representation for 3-D Pose Determination
Authors: S. B. Kang, K. Ikeuchi
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

The complex extended Gaussian image (CEGI), a 3D object representation that can be used to determine the pose of an object, is described. In this representation, the weight associated with each outward surface normal is a complex weight. The normal distance of the surface from the predefined origin is encoded as the phase of the weight, whereas the magnitude of the weight is the visible area of the surface. This approach decouples the orientation and translation determination into two distinct least-squares problems. The justification for using such a scheme is twofold: it not only allows the pose of the object to be extracted, but it also distinguishes a convex object from a nonconvex object having the same EGI representation. The CEGI scheme has the advantage of not requiring explicit spatial object-model surface correspondence in determining object orientation and translation. Experiments involving synthetic data of two polyhedral and two smooth objects are presented to illustrate the feasibility of this method.
Correction to
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

Inadvertently and with much regret, Pabrita Mitra and Sankar K. Pal's photos published in the March 2002 issue were switched. We apologize to both for the error.
Nonmonotonic Logic Programming
Authors: V. s. Subrahmanian
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

This paper provides a survey of the state of the art in nonmonotonic logic programming. In particular, we survey advances in the declarative semantics of logic programs, in query processing procedures for nonmonotonic logic programs, and in recent extensions of the nonmonotonic logic programming paradigm.
A Browser for Large Knowledge Bases Based on a Hybrid Distributed/Local Connectionist Architecture
Authors: T. Samad, P. Israel
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

A browser concept based on a connectionist architecture is presented. The concept utilizes both distributed and local representations. A proof-of-concept system is implemented for an integrally developed, Honeywell-proprietary knowledge acquisition tool. In the browser, concepts and relations in a knowledge base are represented using microfeatures. The microfeatures can encode semantic attributes, structural features, contextual information, etc. Desired portions of the knowledge base can then be associatively retrieved based on a structured cue. An ordered list of partial matches is presented to the user for selection. Microfeatures can also be used as bookmarks-they can be placed dynamically at appropriate points in the knowledge base and subsequently used as retrieval cues. The browser concept can be applied wherever there is a need for conveniently inspecting and manipulating structured information.
Guest Editor's Introduction: Migrating Software to the World Wide Web
Authors: Ellis Horowitz
Venue: IEEE Software (1998)

Horowitz describes how Web technology can offer a relatively painless way to extend the life of legacy systems, which are, by definition, both fragile and valuable. The Web can give aging applications a modern graphical interface, deliver them to employees' desktops regardless of platform, and grant access to databases distributed across the enterprise.
Exploring Parafunctional Programming: Separating the What from the How
Authors: Paul Hudak
Venue: IEEE Software (1988)

A method is presented that takes functional programming one step further by letting the programmer change operational (parafunctional) details without restructuring or rewriting the program. Parafunctional programming is based on the premise that the what (specification) and the how (implementation) are separately identifiable and maintainable system components. Unlike conventional programming methods, parafunctional programming maintains this separation by metalinguistic constructs in the source language and a programming environment that supports structured editing and high-level debugging.
Strengthening the Case for Pair Programming
Authors: Laurie Williams, Robert R. Kessler, Ward Cunningham, Ron Jeffries
Venue: IEEE Software (2000)

The software industry has practiced pair programming--two programmers working side by side at one computer on the same problem--for years. But people who haven't tried it often reject the idea as a waste of resources. The authors demonstrate that pair programming yields better software products in less time--and happier, more confident programmers. Their supportive evidence comes from professional programmers and an experiment with university students.
Programming Techniques for Object-Based Statistical Analysis with SAS Software, 1st edition
Authors: Tanya Kolosova, Samuel Berestizhevsky
Venue:  (1998)

:Learn valuable time-saving techniques for data analysis and ensure reliability and quality of the results! This book introduces an innovative and reliable approach for developing object-based applications for statistical analysis in SAS. Through detailed examples, each chapter demonstrates how to develop object-based applications using this approach. You will learn to structure data, define statistical classes and their associated actions, define objects, and perform the statistical analysis by calling actions for the objects. Statistical analyses illustrated in the examples include regular time series, calendar time series, and irregular time series. Detailed instructions for extending this technique to other statistical analyses are included. Discover how this object-based approach to statistical analysis can ensure consistent data analysis across teams comprised of data analysts, statisticians, and computer programmers! Supports releases 6.09 and higher of SAS software.Author Biography: Tanya Kolosova Tanya Kolosova specializes in time series and forecasting, operations research, and statistical training in her work as an independent consultant. Samuel Berestizhevsky Samuel Berestizhevsky's expertise lies in statistical data analysis, the design of experiments, quality control and assurance, system analysis, and training, which he implements at his customer sites as an independent consultant.
Reduced Rank Kernel Ridge Regression
Authors: Gavin C. Cawley, Nicola L. C. Talbot
Venue: Neural Processing Letters (2002)

Ridge regression is a classical statistical technique that attempts to address the bias-variance trade-off in the design of linear regression models. A reformulation of ridge regression in dual variables permits a non-linear form of ridge regression via the well-known &lsquo;kernel trick&rsquo;. Unfortunately, unlike support vector regression models, the resulting kernel expansion is typically fully dense. In this paper, we introduce a reduced rank kernel ridge regression (RRKRR) algorithm, capable of generating an optimally sparse kernel expansion that is functionally identical to that resulting from conventional kernel ridge regression (KRR). The proposed method is demonstrated to out-perform an alternative sparse kernel ridge regression algorithm on the Motorcycle and Boston Housing benchmarks.
ArArCALC-software for 40Ar/39Ar age calculations
Authors: Anthony A. P. Koppers
Venue: Computers Geosciences (2002)

ArArCALC is a Microsoft Excel® 97-2000-XP application for performing calculations in 40Ar/39Ar geochronology. It is coded in Visual Basic for Applications and can be used under the Windows® 95/98/NT/2000/ME/XP operating systems. ArArCALC provides an easy-to-use graphical interface for the calculation of age plateaus, total fusion ages and isochrons following the regression of 40Ar/39Ar mass spectrometry data. Results are stored in single Excel workbooks including nine different data tables and four different diagrams. Analytical, internal and external errors are calculated based on error propagation of all input parameters, analytical data and applied corrections. Finally, the age calculation results can be recalibrated with reference to the primary K-Ar standards (e.g. GA-1550, MMhb-1) in order to obtain more consistent absolute 40Ar/39Ar age determinations. ArArCALC is distributed as freeware.
An efficient verification procedure supporting evolution of reactive system specifications
Authors: Takenobu Aoshima, Kenji Sakuma, Naoki Yonezaki
Venue: Proceedings of the 4th International Workshop on Principles of Software Evolution (2001)

To evolve reactive system specifications, it is necessary to check properties of the specifications, such as satisfiability, stepwise satisfiability and strong satisfiability. We developed a verification method for checking these properties of specifications described in Linear Temporal Logic. The most significant problem of the verification is that it needs huge computational resources. To solve the problem, we introduce an efficient procedure for checking these properties based on a tableau method using combination of Binary Decision Diagrams representing sets of states and coarse graphs representing transitions.
Is the Turkish Health Care System Ready to Be a Part of the European Union?
Authors: Adnan Kisa, Sahin Kavuncubasi, Korkut Ersoy
Venue: Journal of Medical Systems (2002)

Lately, Turkey is struggling to recover from the economic effects of the economic crisis so that the government officials are trying to impose budget cuts in health and education sectors. After the United States, the country's national defense expenditures are the highest among the NATO countries. Therefore, Turkey allocates only 3&ndash;4% of the gross domestic product for health care expenses. Overall, the health status in Turkey is the lowest among the European Union countries&semi; infant mortality rate is about 45 per 1000 live births, which is the highest on the European continent, and per capita health care expenditure is &dollar;120. Although 75% of the people are covered by some type of public insurance, 25% of the Turkish people do not have any insurance coverage. The national system is funded by taxes (43%), out of pocket payments (32%), and social and private insurance premiums (25%). This study examines whether Turkey is ready to be a part of the European Union in terms of the health sector of its economy and health status of its people.
Neural Networks, II: What Are They and Why is Everybody So Interested in Them Now?
Venue: IEEE Expert: Intelligent Systems and Their Applications (1988)

For part I, see ibid., vol. EX-2, no. 4, p. 10-11 (1987). The learning ability of neural networks and their ability to generalize and to abstract or generate ideals from an imperfect training set are examined. Their potential for multiprocessing is considered. A brief history of neural network research is followed by a discussion of their architectures and a presentation of several specific architectures and learning techniques. The Cauchy machine, which represents a possible solution to the local minima problem encountered with virtually every other neural network training algorithm, is described. The outlook for neural nets is briefly considered.
Classification of Transcranial Doppler Signals Using Artificial Neural Network
Authors: Selami Serhatlioglu, Fırat Hardalaç, İnan Güler
Venue: Journal of Medical Systems (2003)

Transcranial Doppler signals, recorded from the temporal region of brain on 110 patients were transferred to a personal computer by using a 16-bit sound card. The fast Fourier transform (FFT) method was applied to the recorded signal from each patient. Since FFT method inherently can not offer a good spectral resolution at jet blood flows, it sometimes causes wrong interpretation of transcranial Doppler signals. To do a correct and rapid diagnosis, transcranial Doppler blood flow signals were statistically arranged so that they were classified in artificial neural network. Back propagation neural network and self-organization map algorithms of artificial neural network were used for training, whereas momentum and delta&ndash;bar-delta algorithms were used for learning. The results of these algorithms were compared in the case of classification and learning.
A dynamical model for the analysis and acceleration of learning in feedforward networks
Authors: Nikolaos Ampazis, Stavros J. Perantonis, John G. Taylor
Venue: Neural Networks (2001)

A dynamical system model is derived for feedforward neural networks with one layer of hidden nodes. The model is valid in the vicinity of flat minima of the cost function that rise due to the formation of clusters of redundant hidden nodes with nearly identical outputs. The derivation is carried out for networks with an arbitrary number of hidden and output nodes and is, therefore, a generalization of previous work valid for networks with only two hidden nodes and one output node. The Jacobian matrix of the system is obtained, whose eigenvalues characterize the evolution of learning. Flat minima correspond to critical points of the phase plane trajectories and the bifurcation of the eigenvalues signifies their abandonment. Following the derivation of the dynamical model, we show that identification of the hidden nodes clusters using unsupervised learning techniques enables the application of a constrained application (Dynamically Constrained Back Propagation--DCBP) whose purpose is to facilitate prompt bifurcation of the eigenvalues of the Jacobian matrix and, thus, accelerate learning. DCBP is applied to standard benchmark tasks either autonomously or as an aid to other standard learning algorithms in the vicinity of flat minima. Its application leads to significant reduction in the number of required epochs for convergence.
Load Balancing of Parallelized Information Filters
Authors: N. C. Rowe, A. Zaky
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

We investigate the data-parallel implementation of a set of information filters used to rule out uninteresting data from a database or data stream. We develop an analytic model for the costs and advantages of load rebalancing for the parallel filtering processes, as well as a quick heuristic for its desirability. Our model uses binomial models of the filter processes and fits key parameters to the results of extensive simulations. Experiments confirm our model. Rebalancing should pay off whenever processor communications costs are high. Further experiments showed it can also pay off even with low communications costs for 16-64 processes and 1-10 data items per processor; then, imbalances can increase processing time by up to 52 percent in representative cases, and rebalancing can increase it by 78 percent, so our quick predictive model can be valuable. Results also show that our proposed heuristic rebalancing criterion gives close to optimal balancing. We also extend our model to handle variations in filter processing time per data item.
A Database for Handwritten Text Recognition Research
Authors: J. J. Hull
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

An image database for handwritten text recognition research is described. Digital images of approximately 5000 city names, 5000 state names, 10000 ZIP Codes, and 50000 alphanumeric characters are included. Each image was scanned from mail in a working post office at 300 pixels/in in 8-bit gray scale on a high-quality flat bed digitizer. The data were unconstrained for the writer, style, and method of preparation. These characteristics help overcome the limitations of earlier databases that contained only isolated characters or were prepared in a laboratory setting under prescribed circumstances. Also, the database is divided into explicit training and testing sets to facilitate the sharing of results among researchers as well as performance comparisons.
Coordinated Placement and Replacement for Large-Scale Distributed Caches
Authors: Madhukar R. Korupolu, Michael Dahlin
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

In a large-scale information system such as a digital library or the web, a set of distributed caches can improve their effectiveness by coordinating their data placement decisions. Using simulation, we examine three practical cooperative placement algorithms, including one that is provably close to optimal, and we compare these algorithms to the optimal placement algorithm and several cooperative and noncooperative replacement algorithms. We draw five conclusions from these experiments: 1) Cooperative placement can significantly improve performance compared to local replacement algorithms, particularly when the size of individual caches is limited compared to the universe of objects; 2) although the amortizing placement algorithm is only guaranteed to be within 14 times the optimal, in practice it seems to provide an excellent approximation of the optimal; 3) in a cooperative caching scenario, the recent greedy-dual local replacement algorithm performs much better than the other local replacement algorithms; 4) our hierarchical-greedy-dual replacement algorithm yields further improvements over the greedy-dual algorithm especially when there are idle caches in the system; and 5) a key challenge to coordinated placement algorithms is generating good predictions of access patterns based on past accesses.
Fast Query Processing in Deductive Databases
Authors: Dik Lun Lee, Yim Yung Leung
Venue: IEEE Software (1993)

A special-purpose algorithm, that analyzes the structure of a recursion and exploits its properties in query processing in a deductive database is presented. This method is applied to linear rules, a large and common class of recursion. The structural approach to rule processing (SARP) prototype system that implements the algorithm is described.
Extending OPMISR beyond 10x Scan Test Efficiency
Authors: Carl Barnhart, Vanessa Brunkhorst, Frank Distler, Owen Farnsworth, Andrew Ferko, Brion Keller, David Scott, Bernd Koenemann, Takeshi Onodera
Venue: IEEE Design Test (2002)

Rapidly increasing ASIC gate counts are stressing the test capacity of manufacturing test equipment. New on-product multiple-input signature register (OPMISR) techniques compress test vectors produced by ATPG, substantially reducing data volume and test time.
Verifying Timing Consistency in Formal Specifications
Authors: Tibor Bartos, Norbert Fristacky
Venue: IEEE Design Test (1996)

An algorithm for formal verification of the timing rule set that expresses timing discipline in digital system specifications is described. The algorithm is based on a higher level behavioral specification model and concerns formal consistency verification at the design level of system specification development procedure.
Interfaces for the Ordinary and Beyond
Venue: IEEE Software (1993)

Several ways in which current computer interfaces discriminate against those who do not fit the accepted profile of the average user are described. A needs continuum for describing users' abilities and characteristics is presented. The parameters affecting a person's position within the continuum are discussed. The ways in which interface designers take into account a range of needs is also discussed.
Bounds on Shape Recognition Performance
Authors: Michael Lindenbaum
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

The localization and the recognition tasks are analyzed here relying on a probabilistic model, and independently of the recognition method used. Rigorous upper and lower bounds on the probability that a set of measurements is sufficient to localize an object within a certain precision, are derived. The bounds quantify the difficulty of the localization task regarding many of its aspects, including the number of measurements, the uncertainty in their position, the information they reveal, and the ¿ability of the objects to confuse the recognizer.¿ Similar results are obtained for the recognition task. The asymptotic difficulty of recognition/localization tasks is characterized by a single parameter, thus making it possible to compare between different tasks. The bounds provide a theoretical benchmark to which experimentally measured performance of localization/recognition methods can be compared.