ppxscal/embedding_network huggingface dataset:
EduBingo: Design of Multi-level Challenges of a Digital Classroom Game
Authors: Hercy N. H. Cheng, Yi-Chan Deng, Sung-Bin Chang, Tak-Wai Chan
Venue: Proceedings of the The First IEEE International Workshop on Digital Game and Intelligent Toy Enhanced Learning (2007)

Some researches suggest that Well-designed computer games can facilitate children's learning and motivation on mathematics [11, 17]. To sustain the fun in playing a learning game, according to the concept of "flow, students need a series of challenges to match their developing skills. This paper addresses two design questions: 1) How to transform a popular game into an educational game? 2) How to design multi-level challenges to sustain fun for practicing arithmetic in that game? In this paper, the game rules of Bingo are modified to design a competitive computer game, called EduBingo, for practicing arithmetic in a classroom. Based on our previous works and surveys of several digital games, four dimensions of challenges are identified for devising such educational games. A trail test was conducted to preliminarily evaluate the game's effects on learning, and, in particular, the influences of different dimensions of challenges on practice.
Performance and Scalability Aspects of Directory-Based Cache Coherence in Shared Multiprocessors
Authors: Silvio Picano, David G. Meyer, Eugene D. III Brooks, Joseph E. Hoag
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

We present a strudy that accentuates the performance and scalability aspects of directory-based cache coherence in multiprocessor systems.
Scale and skew-invariant road sign recognition
Authors: Yi-Sheng Liu, Der-Jyh Duh, Shu-Yuan Chen, Ru-Sheng Liu, Jun-Wei Hsieh
Venue: International Journal of Imaging Systems and Technology (2007)

A fast and robust method to detect and recognize scaled and skewed road signs is proposed in this paper. In the detection stage, the input color image is first quantized in HSV color model. Border tracing those regions with the same colors as road signs is adopted to find the regions of interest (ROI). The ROIs are then automatically adjusted to fit road sign shape models so as to facilitate detection verification even for scaled and skewed road signs in complicated scenes. Moreover, the ROI adjustment and verification are both performed only on border pixels; thus, the proposed road sign detector is fast. In the recognition stage, the detected road sign is normalized first. Histogram matching based on polar mesh is then adopted to measure the similarity between the scene and model road signs to accomplish recognition. Since histogram matching is fast and has high tolerance to distortion and deformation while contextual information can still be incorporated into it in a natural and elegant way, our method has high recognition accuracy and fast execution speed. Experiment results show that the detection rate and recognition accuracy of our method can achieve 94.2&percnt; and 91.7&percnt;, respectively. On an average, it takes only 4&ndash;50 and 10 ms for detection and recognition, respectively. Thus, the proposed method is effective, yet efficient. &copy; 2007 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 17, 28&ndash;39, 2007
GSM EFR implementation for TRAU application on DSP16000
Authors: Junchen Du
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

An implementation of GSM EFR using traditional single MAC DSPs (DSP1600) takes 24 MIPS to run a single speech channel. Lucent DSP16000 is a dual MAC high performance DSP. Analysis has shown DSP16000 code can run GSM EFR at 10 MIPS per channel with the same program space as DSP1600. The code has been re-structured to minimize the delays and RAM usage for multi-channel transcoder/rate adapter units (TRAU) applications. For a 100 MIPS DSP16210 running 6 EFR speech channels, DSP16210 code takes 15.7 K words of RAM with 3.2 ms maximum delay for the encoder and 0.5 ms for the decoder. Without re-structuring, the numbers are 27 K, 15.4 ms and 1.5 ms respectively. This makes the DSP16000 very attractive for TRAU applications. The initial implementation runs at 12.8 MIPS per channel with 19.3 K words of RAM, 4.7 ms maximum encoding delay and 0.5 ms maximum decoding delay for 6 speech channels.
Structural Unfairness in 802.11-basedWireless Mesh Networks
Authors: Lily Li, Paul A. S. Ward
Venue: Proceedings of the Fifth Annual Conference on Communication Networks and Services Research (2007)

The use of multi-hop wireless networks based on 802.11 technology is extensive and growing, owing to their ease of deployment and low cost. However, such networks exhibit poor fairness, starving nodes that are too many hops distant from the gateway. The best current solution to this problem is source rate limiting. While effective in many topologies, this fails to completely address the fairness problem. In this paper we investigate this problem of residual unfairness in multi-hop wireless networks that use source-rate limiting. We identify the five necessary conditions for its occurrence, showing that elimination of any of these conditions is sufficient to remove the remaining unfairness. For cases where the conditions are unavoidable, we present two simple changes that can ameliorate the problem, providing on average 30% improvement for the least-rate flow.
Twain: Two-end association miner with precise frequent exhibition periods
Authors: Jen-Wei Huang, Bi-Ru Dai, Ming-Syan Chen
Venue: ACM Transactions on Knowledge Discovery from Data (TKDD) (2007)

We investigate the general model of mining associations in a temporal database, where the exhibition periods of items are allowed to be different from one to another. The database is divided into partitions according to the time granularity imposed. Such temporal association rules allow us to observe short-term but interesting patterns that are absent when the whole range of the database is evaluated altogether. Prior work may omit some temporal association rules and thus have limited practicability. To remedy this and to give more precise frequent exhibition periods of frequent temporal itemsets, we devise an efficient algorithm Twain (standing for TWo end AssocIation miNer.) Twain not only generates frequent patterns with more precise frequent exhibition periods, but also discovers more interesting frequent patterns. Twain employs Start time and End time of each item to provide precise frequent exhibition period while progressively handling itemsets from one partition to another. Along with one scan of the database, Twain can generate frequent 2-itemsets directly according to the cumulative filtering threshold. Then, Twain adopts the scan reduction technique to generate all frequent k-itemsets (k > 2) from the generated frequent 2-itemsets. Theoretical properties of Twain are derived as well in this article. The experimental results show that Twain outperforms the prior works in the quality of frequent patterns, execution time, I/O cost, CPU overhead and scalability.
Computer art: creativity and computability
Authors: Frieder Nake
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

The tutorial addresses an important aspect of the "algorithmic revolution" that has taken place silently without many really becoming aware of it. That aspect is the gradual influx of information technology, computers, and algorithmic thinking into fine art. We take a choice of individual topics giving participants the chance to explore a landscape of computer art from first beginnings in the mid 1960s, and leading up to current developments. The treatment is by typical examples in a mixture of short presentations and group discussions. Principles of computer art are identified in a way that makes transfer possible to other areas of creative applications of computable processes.
Benchmarking of Simulation Systems--The ARGESIM Comparisons
Authors: Felix Breitenecker, Siegfried Wassertheurer, Nikolas Popper, Gunter Zauner
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

Modelling and simulation has become the third pillar of gaining knowledge. Modelling and simulation of a process makes use of a simulation software, and quality of results and investigation time depend dramatically on the choice of the most appropriate simulator. Consequently, a basis for simulator choice or at least serious hints are necessary. This contribution first gives an overview about methods for comparing and benchmarking simulation systems. Then it introduces the ARGESIM Benchmarks / Comparisons on Simulation Software and gives details on some comparisons. The paper concludes with an outlook for further development of the ARGESIM Benchmarks.
A Parallel Trace-driven Simulator: Implementation and Performance
Authors: Xiaohan Qin, Jean-Loup Baer
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

The simulation of parallel architectures requires an enormous amount of CPU cycles and, in the case of trace-driven simulation, of disk storage. In this paper, we consider the evaluation of the memory hierarchy of multiprocessor systems via parallel trace-driven simulation. We refine Lin et al.[8] original algorithm, whose main characteristic is to insert the shared references from every trace in all other traces, by reducing the amount of communication between simulation processes. We have implemented our algorithm on a KSR-1. Results of our experiments on traces of four applications and three different cache coherence protocols show that parallel trace-driven simulation yields significant speedups over its sequential counter-part. The communication overhead is not substantial compared to the dominant overhead due to the processing of replicated inserted references. We also investigate filtering techniques and show how to filter in parallel private and shared references for various block sizes in one pass. Simulation of filtered traces is faster but with a lower speedup.
Adaptive Thresholding Based Cell Segmentation for Cell-Destruction Activity Verification
Authors: Praveen Sankaran, Vijayan K. Asari
Venue: Proceedings of the 35th Applied Imagery and Pattern Recognition Workshop (2006)

An adaptive thresholding method used to distinguish cell boundaries in a given image is presented in this paper. A preprocessing step involves low pass filtering of the image to remove high frequency noise seen in the image. This image is now adaptively thresholded to create a binary image. The bright regions are further analyzed based on their geometrical descriptors such as area and form factor to classify them as cell or non-cell regions. Two sets of images, pulsed and non-pulsed, are available, which can be compared to determine the efficiency of the pulsing. Results for automatic segmentation are compared with those of manually obtained values to determine its efficiency.
Signaling with Conserved Quantities: Two Realizations in CMOS and Superconducting Flux Quantum Logic
Venue: Proceedings of the 13th IEEE International Symposium on Asynchronous Circuits and Systems (2007)

A simple scheme for single rail asynchronous data transmission and signaling relying on the management and transfer of conserved quantities is presented. The conserved quantity is dependent on the kind of logic family used: mass for fluidic logic, charge for CMOS logic, and flux for superconducting flux quantum logic.
Experiences from Representing Software Architecture in a Large Industrial Project Using Model Driven Development
Authors: Anders Mattsson, Bjorn Lundell, Brian Lings, Brian Fitzgerald
Venue: Proceedings of the Second Workshop on SHAring and Reusing architectural Knowledge Architecture, Rationale, and Design Intent (2007)

A basic idea of Model Driven Development (MDD) is to capture all important design information in a set of formal or semi formal models that are automatically kept consistent by tools. This paper reports on industrial experience from use of MDD and shows that the approach needs improvements regarding the architecture since there are no suggested ways to formalize design rules which are an important part of the architecture. Instead, one has to rely on time consuming and error prone manual interpretations, reviews and reworkings to keep the system consistent with the architecture. To reap the full benefits of MDD it is therefore important to find ways of formalizing design rules to make it possible to allow automatic enforcement of the architecture on the system model.
Finiteness Theorems in Stochastic Integer Programming
Authors: Matthias Aschenbrenner, Raymond Hemmecke
Venue: Foundations of Computational Mathematics (2007)

We study Graver test sets for families of linear multistage stochastic integer programs with a varying number of scenarios. We show that these test sets can be decomposed into finitely many "building blocks," independent of the number of scenarios, and we give an effective procedure to compute them. The paper includes an introduction to Nash-Williams' theory of better-quasi-orderings, which is used to show termination of our algorithm. We also apply this theory to finiteness results for Hilbert functions.
The design and evolution of communication of PODOS
Authors: Sudharshan Vazhkudai
Venue: Proceedings of the 3rd annual conference on Atlanta Linux Showcase - Volume 3 (1999)

Distributed Operating Systems have always attracted a plethora of researchers for decades that wish to make many computers appear to be one. In spite of this goal, improvement in aggregate system performance has always been secondary to resource sharing or reliability. With performance as our goal, we are designing a Performance Oriented Distributed Operating System (PODOS). PODOS is the interaction of two or more monolithic Linux machines. The PODOS design has a number of key performance benefits.
Monaural speech segregation based on fusion of source-driven with model-driven techniques
Authors: Mohammad H. Radfar, Richard M. Dansereau, Abolghasem Sayadiyan
Venue: Speech Communication (2007)

In this paper by exploiting the prevalent methods in speech coding and synthesis, a new single channel speech segregation technique is presented. The technique integrates a model-driven method with a source-driven method to take advantage of both individual approaches and reduce their pitfalls significantly. We apply harmonic modelling in which the pitch and spectrum envelope are the main components for the analysis and synthesis stages. Pitch values of two speakers are obtained by using a source-driven method. The spectrum envelope, is obtained by using a new model-driven technique consisting of four components: a trained codebook of the vector quantized envelopes (VQ-based separation), a mixture-maximum approximation (MIXMAX), minimum mean square error estimator (MMSE), and a harmonic synthesizer. In contrast with previous model-driven techniques, this approach is speaker independent and can separate out the unvoiced regions as well as suppress the crosstalk effect which both are the drawbacks of source-driven or equivalently computational auditory scene analysis (CASA) models. We compare our fused model with both model- and source-driven techniques by conducting subjective and objective experiments. The results show that although for the speaker-dependent case, model-based separation delivers the best quality, for a speaker independent scenario the integrated model outperforms the individual approaches. This result supports the idea that the human auditory system takes on both grouping cues (e.g., pitch tracking) and a priori knowledge (e.g., trained quantized envelopes) to segregate speech signals.
Automatic index creation for handwritten notes
Authors: S. Uchihashi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

This paper describes a technique for automatically creating an index for handwritten notes captured as digital ink. No text recognition is performed. Rather, a dictionary of possible index terms is built by clustering groups of ink strokes corresponding roughly to words. Terms whose distribution varies significantly across note pages are selected for the index. An index page containing the index terms is created, and terms are hyper-linked back to their original location in the notes. Further, index terms occurring in a note page are highlighted to aid browsing.
Explicit modeling of coarticulation in a statistical speech recognizer
Authors: Ruxin Chen, L. H. Jamieson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

This paper presents a new statistical speech model in which coarticulation is modeled explicitly. Unlike HMMs, in which the current state depends only on the previous state and the current observation, the proposed model supports dependence on the previous and next states and on the previous and current observations. The degree of coarticulation between adjacent phones is modeled parametrically, and can be adjusted according to a parameter representing the speaking rate. The model also incorporates a parameter that represents a frame-by-frame measure of confidence in the speech. We present two methods for solving the system parameters: one based on the K-means method, and a novel method based on explicitly minimizing a measure of the segmentation error. A new, efficient forward algorithm and the use of top candidates in the search greatly reduce the computational complexity. In evaluation on the TIMIT data base, we achieve a phone recognition rate of 77.1%.
Volterra filter identification using penalized least squares
Authors: R. D. Nowak
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

Volterra filters have been applied to many nonlinear system identification problems. However, obtaining good filter estimates from short and/or noisy data records is a difficult task. We propose a penalized least squares estimation algorithm and derive appropriate penalizing functionals for Volterra filters. An example demonstrates that penalized least squares estimation can provide much more accurate filter estimates than ordinary least squares estimation.
The condition number of a randomly perturbed matrix
Authors: Van H. Vu, Terence Tao
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

Let M be an arbitrary n by n matrix. We study the conditionnumber a random perturbation M+Nn of M, where Nn is arandom matrix. It is shown that, under very general conditions on M and Mn, the condition number of M+Nn is polynomial in nwith very high probability. The main novelty here is that we allow Nn to have discrete distribution.
Designing and Evaluating an Index for Graph Structured Data
Authors: Stanislav Barton, Pavel Zezula
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

In this paper we present own design of an indexing structure for general graph structured data called ñ-index that allows an effective processing of special path queries. These special queries represent for example a search for all paths lying between two arbitrary vertices limited to a certain path length. The ñ-index is a multilevel balanced tree structure where each node is created with a certain graph transformation and described by modified adjacency matrix. Hence, ñ-index indexes all the paths to a predefined length l inclusive. The search algorithm is then able to find all the paths shorter than or having the length l and some of the paths longer then the predefined l lying between any two vertices in the indexed graph. We also present an experimental evaluation of the process of creating the p-index on graphs with different sizes and also a complexity evaluation of the search algorithm that uses the p-index.
An account for compound prepositions in Farsi
Authors: Zahra Abolhassani Chime
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

There are some sorts of 'Preposition + Noun' combinations in Farsi that apparently a Prepositional Phrase almost behaves as Compound Prepositions. As they are not completely behaving as compounds, it is doubtful that the process of word formation is a morphological one. The analysis put forward by this paper proposes "incorporation" by which an N&deg; is incorporated to a P&deg; constructing a compound preposition. In this way tagging prepositions and parsing texts in Natural Language Processing is defined in a proper manner.
Recursive speech enhancement using the EM algorithm with initial conditions trained by HMM's
Authors: L. H. Jamieson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

This paper considers speech enhancement where the speech signal is modeled with hidden filter models (HFMs), when only noisy speech signal are available. The HFM is a parametric approach for representing the speech waveform in the time domain. We apply the nested EM algorithm for jointly estimating the clean signal and the parameters of HFM and noise model. A computationally efficient implementation of the algorithm is developed by the log-likelihood gradient based on the Kalman filter output in the estimation process. The resulting algorithm does not need framing and may be viewed in the time domain context.
Organizational Storytelling and Technology Innovation
Authors: Maureen MacLeod, Elizabeth Davidson
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

As technology innovation finds its way into increasingly diverse workplaces, the need to understand how project participants' views influence the change process has never been more pressing. Organizations are introducing technology change at an accelerated pace and increasingly diverse groups are finding themselves in uncertain territory as they attempt to collaborate on projects that fall outside their areas of expertise in an attempt to envision and then build new and complicated technology systems for their organizations. This paper explores the promising role of organizational storytelling as a framework to support the creation of shared meaning among disparate project members in an effort to mitigate the negative and costly impact that the different perspectives of team members have on innovation projects.