ppxscal/embedding_network huggingface dataset:
Use vs. access: design and use in educational digital libraries
Authors: Flora McMartin, Brandon Muramatsu
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

The poster will compare and contrast the design and usage assumptions of existing educational digital libraries and repositories to challenge digital library developers to meet the needs of their increasingly sophisticated users. Traditionally, assumptions have focused on access to a site and discovery of content, whereas we define use as content and its application (context, audience, etc.). In this poster we will review the assumptions that have driven the design of digital libraries, their services and evaluation. Measures of success such as page views of metadata rest on assumptions associated with access, i.e., the number of times a metadata record is displayed. This measure provides a very limited view of how a digital library is used. We believe that educational digital libraries need to go beyond such a limited view and think about what people actually do with material: Are they using it? Are they returning to it? Are they modifying it? Are they sharing it with others? We will explore an alternate set of metrics for determining the success (or failure) of educational digital libraries by examining metrics focused on use of the contents of educational digital libraries.
Towards a construction-based framework for development of language, event perception and social cognition: Insights from grounded robotics and simulation
Authors: Peter Ford Dominey
Venue: Neurocomputing (2007)

The current research addresses the question of how neurocomputational mechanisms developed for a given cognitive function can be adapted to novel functions. In this context, research in language development has contributed to the concept of grammatical construction defined in terms of a functional mapping between the surface structure of an utterance, and its meaning. The objective of the current research is to generalize this notion of construction, and demonstrate its possible application in two cognitive areas that are adjacent and related to language, notably the understanding of physical events based on vision, and the understanding of the intentions of other agents based on observation of their behavior in the context of a perceptually grounded robotic system.
An Accurate Mutual Information-based Registration of Digitized
Authors: Souha Aouadi, Laurent Sarry
Venue: Proceedings of the Eighth IEEE Workshop on Applications of Computer Vision (2007)

This paper addresses the problem of estimating the 3D rigid pose of an object from its digitized X-ray projection. Certain applications in medical image analysis or non-destructive testing demand an extremely high level of accuracy: early detection of orthopedic prosthesis migration or the detection of defects or occlusion in manufactured objects requires sub-millimeter precision. It is also possible after registration to use subtraction to enhance features absent from the shape model. We considered the cases of homogeneous (CAD models) and inhomogeneous (map obtained from tomodensitometry) X-ray attenuation in an optimization framework based on a mutual information similarity measure(SM). Pose is recovered with submillimeter accuracy and high precision for both screen-film and computed radiographs by three major enhancements of the existing iconic methods: i) special care is given to the model of Parzen distribution used in the mutual information estimator (data pre-sphering in the bivariate case and bandwidth estimation in the univariate case); ii) a quasi-global optimization scheme based on the stochastic clustering is used in conjunction with an object mesh resampling stage to reduce variance of the final pose estimator; iii) nonlinear response of screen-film radiographs is also modeled.
Using Dynamic Aspects in High Level Architecture for Simulation of Electric Power Auctions
Authors: Yingyu Yin, Haitao Song, Xiushan Liu
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

This paper presents a platform for distributed interactive simulation of electric power auctions based on High Level Architecture (HLA). HLA dedicates to improving the reusability of Federates by sepcifying the interaction between them. But behavior of Federate in HLA is hard to be modified at runtime, while it is very important to the long-term simulation. In our design, the Federate could be adapted dynamically. This helps to create a coherent evolution of simulation system. The run-time adaptation of Federate is implemented using dynamic weaving of aspects and the framework is described detailedly in this paper. Moreover, we introduced a practical system developed by the framework, and finally examined its effectiveness through an application of performing the synchronization among associated Federates. The experience demonstrates that the technique can reduce the redundancy of simulation system effectively.
An integrated core sequence in digital computation
Authors: D. S. Wills, J. L. A. Hughes
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

A new digital computation sequence that integrates elements of digital logic design, computer architecture, and programming is described. This four-course core sequence, introduced at Georgia Tech, provides a system-oriented presentation instead of treating these concepts as independent topics. Key concepts include hierarchical modular design, system-level trade-offs, and computer-based design and analysis tools. Tightly coupled laboratories and computer-based assignments consolidate key concepts. Real-world design environment tools are utilized for digital logic design and simulation, instruction level simulation, and VHDL-based architectural modeling. This restructuring of core courses is designed to better prepare students for the evolving design environment based on custom and semi-custom VLSI programmable logic devices, and computer-based design tools.
Regularized dequantization for DCT-based transform coding
Authors: S. Moon-Ho Song
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

We present a new dequantization technique for discrete cosine transform (DCT) based encoding. For the lack of better dequantization methods, the currently existing image compression standards states simply to multiply the received quantized DCT coefficients by the quantization matrix. Therefore, for each DCT coefficient, the quantization noise as large as half quantizer step size may be introduced (in the DCT domain). Our proposed technique, through regularization, dequantizes the quantized DCT coefficients so that the resulting decoded image will be visually more pleasing. Through simulation studies, we show improvements in the visual characteristics and also in terms of the peak-signal-to-noise-ratio (PSNR).
Mining Fuzzy Weighted Association Rules
Authors: David L. Olson, Yanhong Li
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The paper combines and extends the technologies of fuzzy sets and association rules, considering users' differential emphasis on each attribute through fuzzy regions. A fuzzy data mining algorithm is proposed to discovery fuzzy association rules for weighted quantitative data. This is expected to be more realistic and practical than crisp association rules. Discovered rules are expressed in natural language that is more understandable to humans. The paper demonstrates the performance of the proposed approach using a synthetic but realistic dataset.
A Dimension Abstraction Approach to Vectorization in Matlab
Authors: Neil Birkbeck, Jonathan Levesque, Jose Nelson Amaral
Venue: Proceedings of the International Symposium on Code Generation and Optimization (2007)

Matlab is a matrix-processing language that offers very efficient built-in operations for data organized in arrays. However Matlab operation is slow when the program accesses data through interpreted loops. Often during the development of a Matlab application writing loop-based code is more intuitive than crafting the data organization into arrays. Furthermore, many Matlab users do not command the linear algebra expertise necessary to write efficient code. Thus loop-based Matlab coding is a fairly common practice. This paper presents a tool that automatically converts loop-based Matlab code into equivalent array-based form and built-in Matlab constructs. Arraybased code is produced by checking the input and output dimensions of equations within loops, and by transposing terms when necessary to generate correct code. This paper also describes an extensible loop pattern database that allows user-defined patterns to be discovered and replaced by more efficient Matlab routines that perform the same computation. The safe conversion of loop-based into more efficient array-based code is made possible by the introduction of a new abstract representation for dimensions.
Maximum likelihood separation of phase modulated signals
Authors: A. Leshem
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

In this paper we present a Newton scoring algorithm for the maximum likelihood separation and direction of arrival estimation of constant modulus signals, using a calibrated array. The main technical step is the inversion of the Fisher information matrix, and an analytic formula for the update step in the Newton method. We present the algorithm based on the derived update and discuss potential initializations. We also present the computational complexity of the update. Finally we present simulation results comparing the method to the ESPRIT and the CM-DOA.
Visualization and the art of metaphor
Authors: Jack Ox
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

This tutorial is designed for students in various disciplines (arts & sciences) that traditionally work in other media and would like to integrate visualization into their work to enhance communication of ideas and concepts. Attendees that are already using visualization methods in their work can benefit from this tutorial because they will be exposed to different methods as it provides an environment to improve communication skills and the opportunity to acquire visual literacy. This tutorial provides an examination of different kinds of visualization concepts, which will be exemplified by the work of different artists and scientists, both historical and current. In addition to the lecture component the course provides hands-on experience with a laboratory assignment. The tutorial is based on a the class co-created and taught by Jack Ox and Judith v. der Elst, Fall '06, at the ARTS Lab, University of New Mexico.
Two-Way Protocol with Imperfect Devices
Authors: Marco Lucamarini, Alessandro Ceré, Giovanni Di Giuseppe, Stefano Mancini, David Vitali, Paolo Tombesi
Venue: Open Systems Information Dynamics (2007)

The security of a deterministic quantum scheme for communication, namely the LM05 [1], is studied in presence of a lossy channel under the assumption of imperfect generation and detection of single photons. It is shown that the scheme allows for a rate of distillable secure bits higher than that pertaining to BB84 [2]. We report on a first implementation of LM05 with weak pulses.
Heuristic and exact algorithms for generating homogenous constrained three-staged cutting patterns
Authors: Yaodong Cui
Venue: Computers and Operations Research (2008)

An approach is proposed for generating homogenous three-staged cutting patterns for the constrained two-dimensional guillotine-cutting problems of rectangles. It is based on branch-and-bound procedure combined with dynamic programming techniques. The stock plate is divided into segments. Each segment consists of strips with the same direction. Only homogenous strips are allowed, each of which contains rectangles of the same size. The approach uses a tree-search procedure. It starts from an initial lower bound, implicitly generates all possible segments through the builds of strips, and constructs all possible patterns through the builds of segments. Tighter bounds are established to discard non-promising segments and patterns. Both heuristic and exact algorithms are proposed. The computational results indicate that the algorithms are capable of dealing with problems of larger scale. Finally, the solution to a cutting problem taken from a factory that makes passenger cars is given.
On Reachability and Spatial Reachability in Fragments of BioAmbients
Authors: Giorgio Delzanno, Roberto Montagna
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

BioAmbients is a powerful model for representing various aspects of living cells. The model provides a rich set of operations for the movement and interaction of molecules. The richness of the language motivates the study of dialects of the full model and the comparison with other computational models. In this paper we investigate the limit between decidability and undecidability of two decision problems, namely reachability and spatial reachability, for semantic and syntactic fragments of BioAmbients providing movement capabilities and merge. Our results illustrate the power of merge with respect to the other movement operations of BA for properties like reachability. Furthermore, they establish an interesting connection between BioAmbients and other computational models like associative-commutative term rewriting and Petri nets with transfer arcs.
Spectral Predictors
Authors: Lorenzo Ibarria, Peter Lindstrom, Jarek Rossignac
Venue: Proceedings of the 2007 Data Compression Conference (2007)

Many scientific, imaging, and geospatial applications produce large high-precision scalar fields sampled on a regular grid. Lossless compression of such data is commonly done using predictive coding, in which weighted combinations of previously coded samples known to both encoder and decoder are used to predict subsequent nearby samples. In hierarchical, incremental, or selective transmission, the spatial pattern of the known neighbors is often irregular and varies from one sample to the next, which precludes prediction based on a single stencil and fixed set of weights. To handle such situations and make the best use of available neighboring samples, we propose a local spectral predictor that offers optimal prediction by tailoring the weights to each configuration of known nearby samples. These weights may be precomputed and stored in a small lookup table. We show that predictive coding using our spectral predictor improves compression for various sources of high-precision data.
Object-Swapping for Resource-Constrained Devices
Authors: Luis Veiga, Paulo Ferreira
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

Mobile devices are still memory-constrained when compared to desktop and laptop computers. Thus, in some circumstances, even while occupied by useful objects, some memory must be freed. This must be performed while preserving referential integrity in object-oriented applications and without permanently losing data. We propose a novel approach to object swapping in constrained devices, that favors portability and avoids most of the requirements of the previous approaches. Objects are incrementally replicated to devices in groups (clusters) of adaptable size. When there is shortage of memory, the middleware detaches the objects belonging to selected clusters from the application graph. It maintains graph correctness (via proxy replacement objects), and stores the swapped objects (in XML-format) in any nearby device with wireless connectivity and available storage. Nearby devices do not require any specific VM or middleware. They simply must be able to store and provide XML text. This approach is suited to an envisioned future in which there will be a myriad of small memory-enabled devices with wireless connectivity, scattered all-over, available to any user either to store data or to relay communications.
PeaCE: A hardware-software codesign environment for multimedia embedded systems
Authors: Soonhoi Ha, Sungchan Kim, Choonseung Lee, Youngmin Yi, Seongnam Kwon, Young-Pyo Joo
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2007)

Existent hardware-software (HW-SW) codesign tools mainly focus on HW-SW cosimulation to build a virtual prototyping environment that enables software design and system verification without need of making a hardware prototype. Not only HW-SW cosimulation, but also HW-SW codesign methodology involves system specification, functional simulation, design-space exploration, and hardware-software cosynthesis. The PeaCE codesign environment is the first full-fledged HW-SW codesign environment that provides seamless codesign flow from functional simulation to system synthesis. Targeting for multimedia applications with real-time constraints, PeaCE specifies the system behavior with a heterogeneous composition of three models of computation and utilizes features of the formal models maximally during the whole design process. It is also a reconfigurable framework in the sense that third-party design tools can be integrated to build a customized tool chain. Experiments with industry-strength examples prove the viability of the proposed technique.
Make the Most of Your Time: How Should the Analyst Work with Automated Traceability Tools?
Authors: Alex Dekhtyar, Jane Huffman Hayes, Jody Larsen
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Several recent studies employed traditional information retrieval (IR) methods to assist in the mapping of elements of software engineering artifacts to each other. This activity is referred to as candidate link generation because the final say in determining the final mapping belongs to the human analyst. Feedback techniques that utilize information from the analyst (on whether the candidate links are correct or not) have been shown to improve the quality of the mappings. Yet the analyst is making an investment of time in providing the feedback. This leads to the question of whether or not guidance can be provided to the analyst on how to best utilize that time. This paper simulates a number of approaches an analyst might take to evaluating the same candidate link list, and discovers that more structured and organized approaches appear to save time/effort of the analyst.
Matrix scheduler reloaded
Authors: Peter G. Sassone, Jeff Rupley,  II, Edward Brekelbaum, Gabriel H. Loh, Bryan Black
Venue: ACM SIGARCH Computer Architecture News (2007)

From multiprocessor scale-up to cache sizes to the number of reorder-buffer entries, microarchitects wish to reap the benefits of more computing resources while staying within power and latency bounds. This tension is quite evident in schedulers, which need to be large and single-cycle for maximum performance on out-of-order cores. In this work we present two straightforward modifications to a matrix scheduler implementation which greatly strengthen its scalability. Both are based on the simple observation that the wakeup and picker matrices are sparse, even at small sizes; thus small indirection tables can be used to greatly reduce their width and latency. This technique can be used to create quicker iso-performance schedulers (17-58% reduced critical path) or larger iso-timing schedulers (7-26% IPC increase). Importantly, the power and area requirements of the additional hardware are likely offset by the greatly reduced matrix sizes and subsuming the functionality of the power-hungry allocation CAMs.
A Design and Construction of 4 Channel Biotelemetry Device Employing Indoor
Authors: Uğur Fidan, Nihal Fatma Güler
Venue: Journal of Medical Systems (2007)

In this study, 4 channel biotelemetry device was designed and implemented for monitoring physiological and biological signals of the patients at indoor. Body temperature, respiratory rate, heart rate, electrocardiogram (ECG) and electromyogram (EMG) signals were transmitted using 10 mW 433 MHz and 500 mW 868 MHz FM/FSK transmitter with 9.6 Kps transmission speed. At indoor, receive signal strength indicator (RSSI) levels were measured and compared with 433 and 868 MHz carrier frequency. The placement of repeater at indoor was decided as a result of RSSI measurement.
Prediction of shallow water flows over dry beds
Authors: P. Glaister
Venue: Computers Mathematics with Applications (2007)

Numerical results are presented and compared for four conservative upwind difference schemes for the shallow water equations when applied to a severe dam-break problem that generates supercritical flow over a bed of decreasing depth. A comparison is also made when the schemes are used to predict, in an approximate sense, the flow over a dry bed by replacing the dry bed by water of an infinitesimal depth.
Power Virus Generation Using Behavioral Models of Circuits
Authors: K. Najeeb, Vishnu Vardhan Reddy Konda, Siva Kumar Sastry Hari, V. Kamakoti, Vivekananda M. Vedula
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

The problem of peak power estimation in CMOS circuits is essential for analyzing the reliability and performance of circuits at extreme conditions. The dynamic power dissipated is directly proportional to the switching activity (number of gate outputs that toggles (changes state)) in the circuit. The Power Virus problem involves finding input vectors that cause maximum dynamic power dissipation (maximum toggles) in circuits. As the power virus problem is NP-complete the gate-level techniques are less scalable with increasing design size and produce less optimal vectors. In this paper, an approach for power virus generation using behavioral models of digital circuits is presented. The proposed technique converts the given behavioral model automatically to an integer (word-level) constraint model and employs an integer constraint solver to generate the required power virus vectors. Experimenting the proposed technique on ISCAS behavioral level benchmark circuits and the standard DLX processor model show that the above technique is fast and yields higher-quality results than the known gate-level techniques. Interestingly, the paper attempts to generate an assembly program that cause the maximum dynamic power dissipation on the given DLX processor model. To the best of our knowledge the proposed technique is the first reported that considers power virus generation using behavioral level models.
Characterizing the result of the division of fuzzy relations
Authors: P. Bosc, O. Pivert, D. Rocacher
Venue: International Journal of Approximate Reasoning (2007)

The role and properties of the division operator are well known in the framework of queries addressed to regular relational databases. However, Boolean queries may turn out to be too restrictive to answer some user needs and it is desirable to consider extended queries by introducing preferences inside selection conditions. In this paper, the extension of the division operator is investigated in the context of graded relations, i.e., whose tuples are weighted. Several interpretations of the division are possible and they mainly depend on the roles of the grades attached to tuples of input relations. Their properties are examined in the perspective of a characterization of the result obtained as a quotient, similarly to that obtained for the division of two integers.