ppxscal/embedding_network huggingface dataset:
Switched Dual Diversity Reception of M-ary DPSK Signals on Nakagami Fading Channels
Authors: Gennaro Fedele
Venue: Wireless Personal Communications: An International Journal (1998)

The paper deals with dual diversity reception of M-ary differential phase-shift keying modulated signals in the presence of additive white Gaussian noise and Nakagami-distributed slow and nonselective fading. The performance of a switched diversity system is analysed and compared to that of the predetection selection diversity combining scheme. The general case of correlated diversity branches is considered, without restrictions on the fading severity parameter. Average symbol error rate formulas are analytically derived in terms of integral expressions that can be easily computed via numerical integration routines. Moreover, the numerical evaluation of the optimum switching threshold is carried out and the influence of the fading severity parameter, the branch correlation, and the cardinality of the symbol alphabet is analysed. Finally, three fixed switching threshold strategies that allow to obtain a satisfactory diversity gain are considered.
Shape Matching Using LAT and its Application to Handwritten Numeral Recognition
Authors: T. Wakahara
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

This paper describes an iterative technique for gradually deforming a mask binary image with successive local affine transformation (LAT) operations so as to yield the best match to an input binary image as one new and promising approach toward robust handwritten character recognition. The method uses local shapes in the sense that the LAT of each point at one location is optimized using locations of other points by means of least-squares data fitting using Gaussian window functions. It also uses a multiscale refinement technique that decreases the spread of window functions with each iteration. Especially in handwritten character recognition, structural information is indispensable for robust shape matching or discrimination. The method is enhanced to explicitly incorporate structures by weighting the above least-squares criterion with similarity measures of both topological and geometric features of the mask and input images. Moreover, deformation constraints are imposed on each iteration, not only to promote and stabilize matching convergence but also to suppress an excessive matching process. Shape matching experiments have been successfully carried out using skeletons of totally unconstrained handwritten numerals.
Design and Verification of a Stack Processor Virtual Component
Authors: Manfred Stadler, Markus Thalmann, Thomas Röwer, Hubert Kaeslin, Norbert Felber, Wolfgang Fichtner
Venue: IEEE Micro (2001)

Hardware and software codesign and flexibility requirements often necessitate embedded application-specific instruction-set processors in system-on-chip designs. Spaceman, a reusable stack-processor virtual component, offers a customer-configurable instruction set; parameterizable bus widths, stack depths, and stack access ranges; and selectable bus interfaces.
The Associative Processor System CAPRA: Architecture and Applications
Authors: K. E. Grosspietsch, Ralf Reetz
Venue: IEEE Micro (1992)

The basic features of a content-addressable processor/register array (CAPRA) are discussed. The features are the inclusion of logic elements directly within the word cells or bit cells of memory, use of a maskable decoder to enable multiaccess to the memory and computing devices of the array, activity flags within the cells of the array to enable flexible definition of activity patterns, and integration of sensor elements for the direct parallel input of optical data. The architecture's potential applications in database support, basic numerical tasks, and image processing are discussed.
BCOOPL: A Language for Controlling Component Interactions
Authors: Hans De Bruin
Venue: The Journal of Supercomputing (2003)

This paper introduces BCOOPL, which stands for Basic Concurrent Object-Oriented Programming Language. BCOOPL was designed to support component-based development. In particular, it focuses on the specification of weakly-coupled components and the specification of interaction sequences between them. BCOOPL supports two design patterns directly. The built-in observer design pattern encourages the construction of weakly-coupled components. Its support for the mediator design pattern allows to govern the interactions between those components. These language features cater for the design and implementation of flexible systems in which specifications of individual component behavior is separated from specifications of component interactions. A high level overview of BCOOPL's key concepts is given, which are exemplified by means of a process control example.
Build, Buy, or Outsource?
Venue: Computer (1994)

Since most companies today are dissatisfied with their in-house software, they are exploring three possible strategies: improve in-house software-building capabilities; substitute packages for in-house development; or outsource software development and/or maintenance. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Accurate estimation of the number of tuples satisfying a condition
Authors: Gregory Piatetsky-Shapiro, Charles Connell
Venue: ACM SIGMOD Record (1984)

We present a new method for estimating the number of tuples satisfying a condition of the type attribute rel constant, where rel is one of "=", ">", "<", "&ge;", "&le;". Our method gives highly accurate, yet easy to compute, estimates. We store information about attribute values as a list of distribution steps (histograms where buckets, instead of having equal width, have equal height). These distribution steps provide an upper bound on the error when estimating the number of tuples satisfying a condition. The estimation error can be arbitrarily reduced by increasing the number of steps. We analyze desirable conditions that such estimates should satisfy. Based on the distribution steps, we derive a set of estimation formulas which minimize the worst-case error. We also present another set of formulas which reduce the average-case error. Finally, we show how to use sampling to compute a close approximation of the distribution steps very quickly. The major applications of our method are in query optimization and in answering statistical queries.
Walking on Virtual Tiles
Authors: Yoram Baram, Judith Aharon-Peretz, Yahalomit Simionovici, Lior Ron
Venue: Neural Processing Letters (2002)

This paper examines the application of virtual reality cues, generating the biofeedback effects of a real tiled floor, reported in [8], for gait improvement in Parkinson's Disease (PD) patients. A portable apparatus, comprising head and body-mounted 3-axis accelerometers, a wearable computer and see-through head-mounted display, creates a virtual tiled floor, responding to the patient's own dynamics. Performance of PD patients using the device improved (higher speed, longer stride) by about 30% on average.
Out-of-core rendering of massive geometric environments
Authors: Gokul Varadhan, Dinesh Manocha
Venue: Proceedings of the conference on Visualization '02 (2002)

We present an external memory algorithm for fast display of very large and complex geometric environments. We represent the model using a scene graph and employ different culling techniques for rendering acceleration. Our algorithm uses a parallel approach to render the scene as well as fetch objects from the disk in a synchronous manner. We present a novel prioritized prefetching technique that takes into account LOD-switching and visibility-based events between successive frames. We have applied our algorithm to large gigabyte sized environments that are composed of thousands of objects and tens of millions of polygons. The memory overhead of our algorithm is output sensitive and is typically tens of megabytes. In practice, our approach scales with the model sizes, and its rendering performance is comparable to that of an in-core algorithm.
Compile-Time and Runtime Analysis of Active Behaviors
Authors: Elena Baralis, Stefano Ceri, Stefano Paraboschi
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

Active rules may interact in complex and sometimes unpredictable ways, thus possibly yielding infinite rule executions by triggering each other indefinitely. This paper presents analysis techniques focused on detecting termination of rule execution. We describe an approach which combines static analysis of a rule set at compile-time and detection of endless loops during rule processing at runtime. The compile-time analysis technique is based on the distinction between mutual triggering and mutual activation of rules. This distinction motivates the introduction of two graphs defining rule interaction, called Triggering and Activation Graphs, respectively. This analysis technique allows us to identify reactive behaviors which are guaranteed to terminate and reactive behaviors which may lead to infinite rule processing. When termination cannot be guaranteed at compile-time, it is crucial to detect infinite rule executions at runtime. We propose a technique for identifying loops which is based on recognizing that a given situation has already occurred in the past and, therefore, will occur an infinite number of times in the future. This technique is potentially very expensive, therefore, we explain how it can be implemented in practice with limited computational effort. A particular use of this technique allows us to develop cycle monitors, which check that critical rule sequences, detected at compile time, do not repeat forever. We bridge compile-time analysis to runtime monitoring by showing techniques, based on the result of rule analysis, for the identification of rule sets that can be independently monitored and for the optimal selection of cycle monitors.
QUEM: An Achievement Test for Knowledge-Based Systems
Authors: Caroline C. Hayes, Michael I. Parzen
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

This paper describes the QUality and Experience Metric (QUEM), a method for estimating the skill level of a knowledge-based system based on the quality of the solutions it produces. It allows one to assess how many years of experience the system would be judged to have if it were a human by providing a quantitative measure of the system's overall competence. QUEM can be viewed as a type of achievement or job-placement test administered to knowledge-based systems to help system designers determine how the system should be used and by what level of user. To apply QUEM, a set of subjects, experienced judges, and problems must be identified. The subjects should have a broad range of experience levels. Subjects and the knowledge-based system are asked to solve the problems; and judges are asked to rank order all solutions¿from worst quality to best. The data from the subjects is used to construct a skill-function relating experience to solution quality, and confidence bands showing the variability in performance. The system's quality ranking is then plugged into the skill function to produce an estimate of the system's experience level. QUEM can be used to gauge the experience level of an individual system, to compare two systems, or to compare a system to its intended users. This represents an important advance in providing quantitative measures of overall performance that can be applied to a broad range of systems.
Character Recognition Without Segmentation
Authors: Jairo Rocha, Theo Pavlidis
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

A segmentation-free approach to OCR is presented as part of a knowledge-based word interpretation model. This new method is based on the recognition of subgraphs homeomorphic to previously defined prototypes of characters [16]. Gaps are identified as potential parts of characters by implementing a variant of the notion of relative neighborhood used in computational perception. In the system, each subgraph of strokes that matches a previously defined character prototype is recognized anywhere in the word even if it corresponds to a broken character or to a character touching another one. The characters are detected in the order defined by the matching quality. Each subgraph that is recognized is introduced as a node in a directed net that compiles different alternatives of interpretation of the features in the feature graph. A path in the net represents a consistent succession of characters in the word. The method allows the recognition of characters that overlap or that are underlined. A final search for the optimal path under certain criteria gives the best interpretation of the word features. The character recognizer uses a flexible matching between the features and a flexible grouping of the individual features to be matched. Broken characters are recognized be looking for gaps between features that may be interpreted as part of a character. Touching characters are recognized because the matching allows nonmatched adjacent strokes. The recognition results of this system for over 24,000 printed numeral characters belonging to a USPS database and on some hand-printed words confirmed the method¿s high robustness level.
Answering a Question of Pott on Almost Perfect Sequences
Authors: K. T. Arasu, N. J. Voss
Venue: Designs, Codes and Cryptography (1999)

Periodic binary (plus-minus) sequences all but one of whose out-of-phase autocorrelation coefficients are zero are studied by Wolfman [6]. Using the equivalence of these almost perfect sequences to certain cyclic divisible difference sets (noted by Bradley and Pott [1]), we settle the existence status of a perviously open case of an almost perfect sequence of length 852, thereby answering a question of Pott [5] negatively.
Fast Hardware-Based Algorithms for Elementary Function Computations Using Rectangular Multipliers
Authors: W. F. Wong, E. Gogo
Venue: IEEE Transactions on Computers (1994)

As the name suggests, elementary functions play a vital role in scientific computations. Yet due to their inherent nature, they are a considerable computing task by themselves. Not surprisingly, since the dawn of computing, the goal of speeding up elementary function computation has been pursued. This paper describes new hardware based algorithms for the computation of the common elementary functions, namely division, logarithm, reciprocal square root, arc tangent, sine and cosine. These algorithms exploit microscopic parallelism using specialized hardware with heavy use of truncation based on detailed accuracy analysis. The contribution of this work lies in the fact that these algorithms are very fast and yet are accurate. If we let the time to perform an IEEE Standard 754 double precision floating point multiplication be /spl tau//sub /spl times//, our algorithms to achieve roughly 3.68/spl tau//sub /spl times//,4.56/spl tau//sub /spl times//, 5.25/spl tau//sub /spl times//, 3.69/spl tau//sub /spl times//, 7.06/spl tau//sub /spl times//, and 6.5/spl tau//sub /spl times//, for division, logarithm, square root, exponential, are tangent and complex exponential (sine and cosine) respectively. The trade-off is the need for tables and some specialized hardware. The total amount of tables required, however, is less than 128 Kbytes. We discuss the hardware, algorithmic and accuracy aspects of these algorithms.
Computing in Japan: From Cocoon to Competition
Authors: Norris Parker Smith
Venue: Computer (1997)

In broad terms, adoption of new technologies by Japanese computer manufacturers and the expansion of the Japanese market for computers have until recently lagged behind the US and the rest of the industrialized world-usually by two or three years, sometimes for longer periods. Until only a few years ago, computing in Japan was still defined primarily by mainframes and proprietary systems. Prices remained high. Competition and innovation took place within accepted limits. My research has led me to conclude that part of this reluctance is actually a calculated caution. Delaying the adoption of new trends avoids the mistakes and costs of immature technologies. Equally important, Japan has become accustomed to a comfortable computational culture, highly profitable for computer vendors and tolerated by customers. Now computing in Japan is undergoing a belated transformation as the mainframe culture wanes. Vendors are competing with less politeness, prices are dropping, demand for PCs is surging, and the Internet is being embraced with noisy exuberance. There have been periods of rapid change before, and they are frequently offset by a subsequent reassertion of traditional patterns. But there are signs that the recent transformation of computing in Japan will be sustained.
Open Systems and Consciousness. A Physical Discussion
Authors: Roman S. Ingarden
Venue: Open Systems Information Dynamics (2002)

Further discussion of the author's ideas, as well as their confrontation with similar and different concepts of consciousness, have been given in the Introduction. Then the physical and, in lesser degree, also mathematical aspects of open systems, in particular of human person, are sketched in Sec. 2. The quantum concept of the decoherence time is treated as a model for a finite life-time of any composed physical and biological system. In Sec. 3 the role of languages of many types in living and non-living systems is briefly considered, as well as the importance of modality for sentence predicates. In Sec. 4, the structure of the cerebral neocortex and its speech centers is briefly described from the point of view of the mechanism of thinking and the consciousness. The concepts of laterality and dominance (left or right hemispheres of the brain) and their dependence on the type of culture and education are shown on the example of the differences between the Japanese and Western perception of languages (discoveries of Liberman and Tsunoda). In Secs. 5 and 6 the experimental evidence for the connection of consciousness with the speech centers are presented and some questions are posed.
Covering Arrays of Strength Three
Authors: M. A. Chateauneuf, Charles J. Colbourn, D. L. Kreher
Venue: Designs, Codes and Cryptography (1999)

A covering array of size N, degree k, orderv and strength t is a k \times N array with entries from a set of v symbols such that in any t \times N subarray every t \times 1 column occurs at least once. Covering arrays have been studied for their applications to drug screening and software testing. We present explicit constructions and give constructive upper bounds for the size of a covering array of strength three.
An Explanation Facility for Today's Expert Systems
Authors: Michael R. Wick, James R. Slagle
Venue: IEEE Expert: Intelligent Systems and Their Applications (1989)

The authors discuss explanation facility types found in most expert systems and shells used today, referring to these as practice systems, since they represent current practice in expert system work. Practice systems include nonresearch expert systems (being developed every day in industry) as well as nonresearch expert system shells. They maintain that an extensive explanation facility meeting the obligations of a practice system's role can be implemented using only practice technology. They discuss the relationship of journalism to explanation, showing that explanation facility tasks (roles) on current practice expert systems and shells resemble a newswriter's tasks, as both involve presenting users or readers with accurate, objective, noninteractive accounts of events. In news reporting, events are pieces of news. In expert-system explanation, events are actions taken by expert systems. The authors present a journalistic explanation facility, Joe, which is part of AGNESS (a generalized network-based expert system shell), under development at the University of Minnesota.
Access 97 (Unleashed), 2nd edition
Authors: Dwayne Gifford, Stephen Forte
Venue:  (1998)

:Access, one of Microsoft's database managers for Windows, has become one of the most accepted standards of database management for personal computers. The Unleashed format for this book allows current and new users to quickly find and easily find the information they need on the new features. It also serves as a complete reference for database programmers new to Access.Readers learn advanced techniques for working with tables, queries, forms, and dataShows how to program Access and how to integrate the database with the Internet
Formal Verification: Current Use and Future Perspectives
Venue: IEEE Design Test (2002)

Nowadays, designs can contain up to several hundred million transistors. Moreover, up to 80% of the over-all design costs are due to verification. Formal verification techniques provide an attractive alternative by proving the circuits' correct behavior. These techniques--for example, equivalence checking and property checking--are extensively used in many industrialflows. Difficulties with formal verification techniques include the definition and use of appropriate languages, formulation of properties, and lack of motivation of designers to use the new approaches.IEEE Design & Test thanks roundtable participantsJacob A. Abraham (University of Texas at Austin), AndrewBetts (Qualis Europe), Hans Eveking (Darmstadt Universityof Technology), Harry D. Foster (Verplex Systems),Thomas Kropf (Bosch), Matthew J. Morley (VerisityDesign), Thomas R. Shiple (Synopsys), and Michael Siegel(Infineon Technologies). D&T gratefully acknowledges thehelp of Rolf Drechsler (University of Bremen), our moderator;and Kaushik Roy (Purdue University), our Roundtables Editor, who organized the event. Special thanks go to the IEEE Computer Society for sponsoring the roundtable.
Ergodic Joinings of {\rm GL}(n, {\Bbb Z})-Action on n-Torus
Authors: A. A. Prikhod'ko
Venue: Journal of Dynamical and Control Systems (1999)

In this paper a classification of ergodic self-joinings of {\rm GL}(n, {\Bbb Z})-action on n-torus is given. Our study generalizes the description of 2-fold self-joining of {\rm GL}(2, {\Bbb Z}) action on {\Bbb T}^2 due to K. Park. We show that any joining is a linear combination of the Haar measures on subgroups of special form.
Diagnosis Strategies for Hardware or Software Systems
Authors: Maisaa Khalil, Chantal Robach, Franc Novak
Venue: Journal of Electronic Testing: Theory and Applications (2002)

In this paper we explore two alternative approaches to system diagnosis. The first strategy is based on testability analysis performed by SATAN tool. The second approach performed by the Sequential Diagnosis Tool (SDT) generates solutions with minimum average cost of the diagnostic tree. The application of either approach in practice depends on the goals, constraints and the available system test data. The SATAN approach is suitable for the cases where the system structure (i.e., interconnection of its functional parts) is given, while in the second approach the probabilities of faulty states and the test matrix implicitly describe the functionality of the diagnosed system.