ppxscal/embedding_network huggingface dataset:
ISDN-Based Interactive Distance Learning between Japanese and German Elementary Schools
Authors: Seiji Moriya, Takashi Dasai, Hisao Koizumi, Klaus D. Graf
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

Multimedia technology has made possible vivid and effective presentations and exchanges of information. With the introduction of this technology in the field of education, schools mutually located in the remote sites can be connected, and pupils can exchange vivid images and voices, interactively and in realtime. We have expectations that through making use of such technology, we can form a system for interactive distance learning which holds the possibility to promote pupils' desire to learn and their creative potential. In this paper, we propose a new method of distance learning, which is conceived, specifically for use in international distance learning. We also try to evaluate the results obtained from actual distance learning experiments conducted between Japanese and German elementary schools.
Memory efficient adaptation of vector quantizers to time-varying channels
Authors: Norbert Görtz, Jörg Kliewer
Venue: Signal Processing (2003)

Channel-optimized vector quantization (COVQ) is approximated by the novel channel-adaptive scaled vector quantization (CASVQ). This new method uses a reference codebook that is optimal for one specific channel condition. However, for a bit-error rate being different from the design assumption for the reference codebook, all codevectors are scaled by a common factor, which depends on the channel condition. It is shown by simulations that a performance close to that of COVQ can be achieved in many practically important situations. Without a significant increase in complexity, the new CASVQ-scheme can be adapted to time-varying channels by adjusting the scaling factor to the current bit-error probability. Another advantage is that only one codebook needs to be stored for all error probabilities, while for COVQ either the performance degrades significantly due to channel mismatch, or a large set of codebooks must be available at the encoder and the decoder.
A new method for image segmentation based on fuzzy knowledge
Authors: C. Tresp, M. Jagar, M. Moser, J. Hiltner, M. Fathi
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

Within this work a method for knowledge based fuzzy image segmentation is introduced. The basic idea comes from the field of automated medical MRI segmentation where the well-known standard methods have proven insufficient to solve the task. Therefore, a method especially for the problems concerning vagueness in medical imaging has been developed. Beside the improved segmentation procedures, the development has a general impact on the conventional model of image analysis.
Fast nearest neighbor algorithms on a linear array with a reconfigurable pipelined bus system
Authors: Yi Pan, Keqin Li, Si-Qing Zheng
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

We present efficient algorithms for the nearest neighbor problem defined in an n/spl times/n binary image. We show that using a linear array with a reconfigurable pipelined bus system (LARPBS) of n/sup 2/ processors, the nearest neighbor problem can be solved in O(log log n) time, and using an LARPBS of n/sup 3/ processors, the nearest neighbor problem can be solved in O(1) time. We also show that the nearest neighbor problem can be solved on an LARPBS of n/sup 2/ processors in O(1) time with high probability.
Advancing Customer-Perceived Quality in the EDA Industry
Authors: Giora Ben-Yaacov, Larry Bjork, Edward P. Stone
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

This paper describes the initial efforts of two quality groups, one representing EDA software suppliers, and the other representing their major customers, to understand and systematically improve EDA industry quality, as perceived by the customers. The groups continue to work toward this goal, and have reached agreement on several issues, including a defect classification system by severity eight quality metrics, and a plan for reporting and publishing industry average quality trends using these metrics.
Pulse Mode Multilayer Neural Network with Floating Point Operation and On-Chip Learning
Authors: Hiroomi Hikawa
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

This paper describes a new pulse mode hardware multilayer neural network (MNN) that uses floating-point number system for synapse weights. Combined with pulse mode operation, the floating-point operation is implemented without multiplier. Furthermore, back-propagation algorithm is included in the hardware to provide on-chip learning capability. The proposed MNN is implemented on field programmable gate array (FPGA) and various experiments are conducted to test the performance of the proposed system. The results of the experiments show that the proposed MNN architecture can be used for applications that require high precision in their calculation, and its good on-chip learning capability is demonstrated.
Automatic Generation of Hair Texture with Line Integral Convolution
Venue: Proceedings of the International Conference on Information Visualisation (2000)

Synthesis of hair image is one of the most important and challenging computer graphics problems. In this paper, we propose a new technique for automatically generating realistic human hair texture on the 3D models of human character. The idea is inspired by the similarity between the texture of human hair and the texture generated with the LIC algorithm. The proposed technique generates the texture of human hair by using the vector field defining the directions of hair strands as the input to the 3D LIC algorithm.
.Net and COM Interoperability Handbook
Authors: Alan Gordon
Venue:  (2002)

:.NET/COM interoperability in depth: comprehensive techniques and strategies The most in-depth guide to .NET/COM interoperability ever published! Covers every .NET/COM interop option, "gotcha," and workaround Offers practical strategies for .NET migration and long-term .NET/COM coexistence Compares .NET to COM and Java Addresses many advanced issues, including Interop marshaling, Primary Interop Assemblies, using ActiveX Controls from managed code, using COM+ Services from managed code, converting your COM+ Applications to XML Web Services and .NET RemotingThe .NET and COM Interoperability Handbook will help you move your Windows(-based software into the future without abandoning the investments you've already made. Writing from the perspective of the experienced COM/COM+ developer, Alan Gordon offers the most realistic, in-depth coverage of .NET/COM interoperability ever presented. He illuminates all your .NET/COM interoperability options, offering practical advice for both migration and long-term coexistence. Coverage includes: What COM/COM+ developers must know first about .NET/COM interoperability Using the .NET/COM interoperability resources built into Visual Studio .NET Calling COM/COM+ components from .NET Calling .NET components from Win32/COM applications Using COM+ Services from .NET applications Turning your COM+ applications into an XML Web Service without writing any code Understanding the impact of COM apartment threading on .NET performance Overcoming mismatches between COM reference counting and .NET garba Interop marshaling, ActiveX controls, .NET remoting, and much more
Increasing Data Reuse in the Unsymmetric QR Algorithm
Authors: Greg Henry
Venue:  (1992)

This paper models data use in the Unsymmetric QR Eigenvalue Algorithm to improve performance on machines with memory hierarchy. Most of the algorithms and strategies presented can be implemented so that they are numerically similar to strategies found in such libraries as LAPACK and EISPACK ([1,5]). We provide tests to show improvement of performance. Some strategies implemented include the use of block methods, transposing the matrix, reducing the average stride, reducing data movement with hybrid steps, and using block data structures.
Augmented-Reality Visualizations Guided by Cognition: Perceptual Heuristics for Combining Visible and Obscured Information
Authors: Chris Furmanski, Ronald Azuma, Mike Daily
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

One of the unique applications of Mixed and Augmented Reality (MR/AR) systems is that hidden and occluded objects can be readily visualized. We call this specialized use of MR/AR, Obscured Information Visualization (OIV). In this paper, we describe the beginning of a research program designed to develop such visualizations through the use of principles derived from perceptual psychology and cognitive science. In this paper we surveyed the cognitive science literature as it applies to such visualization tasks, described experimental questions derived from these cognitive principles, and generated general guidelines that can be used in designing future OIV systems (as well improving AR displays more generally). Here we also report the results from an experiment that utilized a functioning AR-OIV system: we found that in a relative depth judgment, subjects reported rendered objects as being in front of real-world objects, except when additional occlusion and motion cues were presented together.
Efficient scheduling of nonuniform packet traffic in a WDM/TDM local lightwave network with arbitrary transceiver tuning latencies
Authors: M. S. Borella, B. Mukherjee
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

A passive-star-based, broadcast-and-select, local lightwave network which can support a limited number of WDM channels (on the order of ten), but serve a much larger number of nodes (a few tens or hundreds), is considered. Each node is equipped with one tunable transmitter and one fixed receiver, and each WDM channel is operated in a TDM fashion for carrying packet traffic. Bandwidth is allocated to the node pairs when traffic flow between them is non-uniform, while also accommodating transceiver tuning latency. Our approach exploits well-known results from scheduling theory to create efficient transmission schedules.
Constructing IPv6 protocol stack on Apertos
Authors: J. Itoh, Y. Yokote, M. Tokoro
Venue: Proceedings of the 5th International Workshop on Object Orientation in Operating Systems (IWOOOS '96) (1996)

The paper discusses the implementation of IPv6 protocol stack on the top of the reflective object oriented operating system, Apertos. The Internet community is working on a transition from IPv4 to a new Internet protocol, IPv6. Though IPv6 has good design choices, IPv6 is much more complex and harder to implement than IPv4. To reduce complexity and ease the implementation, the paper introduces a reflective OO method to implement protocol handlers. This can reduce the hurdles for implementation and make the software update cost cheaper.
Directory Design and Record Allocation for List and Cluster Files
Authors: C. S. Yang
Venue:  (1976)

Most file organizations for on-line econdary key retrieval consist of two subcomponents a structural file and a data file. The structural file provides, a physical access path in the data base for each query, so that searches can be restricted to small portions of the data file. The data file contains the data records where information is stored. Hence, the file design problem consists of (1) an efficient design of the structural file, and (2) an allocation of data records in the data file so that a given set of data records can be jointly retrieved at mimimum cost. List structure organizations and clustered organizations are shown to be important structures for secondary key retrieval. This thesis studies the design aspects of the structural and data files for both of the above organizations. The most popular list structure files are the inverted list and the multilist organizations. It is shown that either organization is a special case of a new class of hybrid list organizations. File elements in this class are characterized by a list length parameter $\cal l_{th}$, and a list is stored as an inverted list or as a multilist depending on whether its length is larger than $\cal l_{th}$ or not. Analytical and simulation results indicate that neither a pure inverted list organization nor a pure multilist organization is normally the best choice for all elements in the class. A new method is also introduced for the structure of combined indices for list structure files. A combined index is created only if its component keys co-occur frequently in the queries. Experimental results show that such combined indices do improve the search performances for both inverted list and multilist organizations. Search methods and physical implementations of clustered organizations are discussed. The balancing of cluster trees is shown to be an important concept. A search model is established to obtain optimal branching ratios for cluster trees. The optimal branching ratio is seen to be dependent on certain statistical characteristics of the data base. The last part of the thesis concerns itself with the arrangement of records in the dataa file. The data records are assigned to blocks in the disk like devices. The goal is to minimize the average number of block accesses in processing the query set in the system. This problem turns out to be a polynomial complete problem. Heuristic algorithms are therefore used for the record block assignment. Experimental results show that a record organization produced by the heuristic algorithms is more efficient than a random assignment of records to the blocks. 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
Local fairness in general-topology networks with convergence routing
Authors: A. Mayer, Y. Ofek, M. Yung
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

Convergence routing is a unique variant of deflection routing which ensures that packets (or cells) will converge to their destinations along a global sense of direction. In this work we show how a global sense of direction can be used in an arbitrary network for the design of a control algorithm which (a) ensures fair access in switch-based local area networks, (b) is efficient with respect to performance measures we have developed, and (c) is easily interfaced to the convergence routing mechanism. We present performance measures which assess the new access- and flow-control algorithm: (i) locality- only the sub-network containing conflicting traffic streams gets involved in the fairness regulation; (ii) scalability-the data-structure sizes used in the algorithm are a function of the switching node degree, and use constant space control signals of only a-bit (the ATM standard, for example, dedicates four bits in the header of each cell to generic flow-control); (iii) linear access-time measured by the "the maximal clique in the conflict-graph to which a node belongs", and a frequency which is inverse linear in this parameter (when the traffic pattern stabilizes).
Software in the field needs process too
Authors: D. Heimbigner, A. L. Wolf
Venue: Proceedings of the 10th International Software Process Workshop (1996)

A software system spends its life in two, very different worlds: development and operations. Traditional software process technology has focused on supporting the activities associated only with development. We believe that there are significant benefits to be gained by also supporting processes in the field. Furthermore, once support is in place for operation processes, we can begin to consider how to profitably integrate development and operations.
Probabilistic Student Modelling to Improve Exploratory Behaviour
Authors: Andrea Bunt, Cristina Conati
Venue: User Modeling and User-Adapted Interaction (2003)

This paper presents the details of a student model that enables an open learning environment to provide tailored feedback on a learner's exploration. Open learning environments have been shown to be beneficial for learners with appropriate learning styles and characteristics, but problematic for those who are not able to explore effectively. To address this problem, we have built a student model capable of detecting when the learner is having difficulty exploring and of providing the types of assessments that the environment needs to guide and improve the learner's exploration of the available material. The model, which uses Bayesian Networks, was built using an iterative design and evaluation process. We describe the details of this process, as it was used to both define the structure of the model and to provide its initial validation.
Magnetoconvection Dynamics in a Stratified Layer. II. A Low-Order Model of the Tilting Instability (Revised 03/94)
Authors: Steven R. Lantz
Venue:  (1993)

Simulations of nonlinear, anelastic convection in the presence of magnetic fields have revealed a complex array of dynamic phenomena, including several kinds of nonlinear oscillations (Lantz & Sudan 1993). In an attempt to identify the physical mechanism responsible for these oscillations, a simple model is proposed in which the full magnetoanelastic equations are replaced by equations for the amplitudes of only a few Fourier modes, which evolve according to more symmetric Boussinesq rules. Only one symmetry is permitted to be broken: the updown mirror symmetry, via a tilting mode that drives a shear flow in the horizontal direction (Howard & Krishnamurti 1986). The nonlinear interaction of just these few modes is shown to be adequate to reproduce qualitatively the kinds of behavior seen in simulations. Furthermore, when parameters in the magneto-anelastic equations are mapped onto rough Boussinesq equivalents, a number of quantitative comparisons can be made as well; these confirm that the low-order, truncated model is able to capture the correct numerical trends in the simulated data as the Rayleigh number and imposed horizontal magnetic field are varied. Video visualizations of fluid motions derived from the low-order equations are presented, together with their analogs from full MHD simulations.
Three Surveys on Operating System Topics
Authors: Gregory R. Andrews, Fred B. Schneider
Venue:  (1980)

Recently, we were asked by the Wiley Publishing Company to write survey articles covering some of the important concepts in operating systems for their forthcoming Handbook of Electrical and Computer Engineering. The three brief articles that comprise this report are the results of those efforts. The first was written by Schneider, the latter two by Andrews. We have collected them here in the hope that some may find them of interest. The first article discusses concurrent programming, which is an underlying concern in most operating systems. The use of a kernel or nucleus in constructing an operating system is described in the second article. Lastly, in the third article, the notion of hierarchical organization is developed and some of the advantage of this approach are presented.
Overcoming the limitations of conventional vector processors
Authors: Christos Kozyrakis, David Patterson
Venue: ACM SIGARCH Computer Architecture News (2003)

Despite their superior performance for multimedia applications, vector processors have three limitations that hinder their widespread acceptance. First, the complexity and size of the centralized vector register file limits the number of functional units. Second, precise exceptions for vector instructions are difficult to implement. Third, vector processors require an expensive on-chip memory system that supports high bandwidth at low access latency.This paper introduces CODE, a scalable vector microarchitecture that addresses these three shortcomings. It is designed around a clustered vector register file and uses a separate network for operand transfers across functional units. With extensive use of decoupling, it can hide the latency of communication across functional units and provides 26% performance improvement over a centralized organization. CODE scales efficiently to 8 functional units without requiring wide instruction issue capabilities. A renaming table makes the clustered register file transparent at the instruction set level. Renaming also enables precise exceptions for vector instructions at a performance loss of less than 5%. Finally, decoupling allows CODE to tolerate large increases in memory latency at sub-linear performance degradation without using on-chip caches. Thus, CODE can use economical, off-chip, memory systems.
Software Support for Parallel Computing: Where are We Headed?
Authors: Cherri Pancake
Venue:  (1991)

Although the current state of software support for high-performance computing is often decried as a crisis situation, there has been no concerted attempt to define the nature of the problem or to suggest how it might be resolved. In June of 1991, IBM''s Technical CASE Market Development group invited representatives from industry, academia, and federal agencies to participate in an open forum on directions in parallel software for the next decade. This report summarizes the group''s discussions on the obstacles confronting today''s scientific and technical programmers, likely changes in user requirements, and promising directions for future research and development efforts. 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
Stability Analysis of Regional and National Voting Schemes by a Continuous Model
Authors: Liang Chen, Naoyuki Tokuda
Venue: IEEE Transactions on Knowledge and Data Engineering (2003)

The previous discrete-model-based stability analysis of regional and national voting has been extended to a continuous-model-based analysis in the simultaneous presence of white and concentrated components of noise, reconfirming the previous conclusion that regional voting with smaller sized regions always demonstrates an improved stability over those with larger sized regions, including the national voting in its limiting case in particular. The conclusion remains valid as long as the weak distribution assumption is valid.
A Method for Approximate Equivalence Checking
Authors: Mitch Thornton, Rolf Drechsler, Wolfgang Guenther
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

An approximate equivalence checking method is developed based on the use of partial Haar spectral diagrams (HSDs). Partial HSDs are defined and used to represent a subset of the Haar spectral coefficients for two functions. Due to the uniqueness properties of the Haar transform, a necessary condition for equivalence is that the individual coefficients must have the same value. The probability that two functions are equivalent is then computed based on the number of observed, same-valued, Haar coefficients. The method described here can be useful for the case where two candidate functions require extreme amounts of computational resources for exact equivalence checking. For simplicity, the technique is explained for the binary case first and extensions to Multiple Valued Logic (MVL) are shown afterwards. Experimental results are provided to validate the effectiveness of this approach.