ppxscal/embedding_network huggingface dataset:
Time series prediction of the CATS benchmark using Fourier bandpass filters and competitive associative nets
Authors: Shuichi Kurogi, Miho Sawa, Takamasa Ueno
Venue: Neurocomputing (2007)

An approach to time series prediction of the CATS benchmark (for competition on artificial time series) is presented, where we use Fourier bandpass filters and competitive associative nets (CAN2s). Since one of the difficulties of this prediction is that the given time series does not seem to involve sufficient number of data for obtaining the underlying dynamics of the time series to reproduce low frequency components, we apply the CAN2 only for learning high frequency components extracted via Fourier bandpass filters with trial parameter values of the upper and lower cutoff frequencies and the missing last value of the given time series. Supposing that the optimal values among the trial values will give the best prediction performance for high frequency components, we can identify such optimal values via a certain reasonable validation method, with which we predict the missing high frequency components, and then we obtain the missing data to be predicted via adding high and low frequency components.
GLIMPSE: a tool to search through entire file systems
Authors: Udi Manber, Sun Wu
Venue: Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference (1994)

GLIMPSE, which stands for GLobal IMPlicit SEarch, provides indexing and query schemes for file systems. The novelty of glimpse is that it uses a very small index - in most cases 2-4% of the size of the text - and still allows very flexible full-text retrieval including Boolean queries, approximate matching (i.e., allowing misspelling), and even searching for regular expressions. In a sense, glimpse extends agrep to entire file systems, while preserving most of its functionality and simplicity. Query times are typically slower than with inverted indexes, but they are still fast enough for many applications. For example, it took 5 seconds of CPU time to find all 19 occurrences of Usenix AND Winter in a file system containing 69MB of text spanning 4300 files. Glimpse is particularly designed for personal information, such as one's own file system. The main characteristic of personal information is that it is non-uniform and includes many types of documents. An information retrieval system for personal information should support many types of queries, flexible interaction, low overhead, and customization, All these are important features of glimpse.
Scene independent real-time indirect illumination
Authors: J. R. Frisvad, R. R. Frisvad, N. J. Christensen, P. Falster
Venue: Proceedings of the Computer Graphics International 2005 (2005)

A novel method for real-time simulation of indirect illumination is presented in this paper. The method, which we call direct radiance mapping (DRM), is based on basal radiance calculations and does not impose any restrictions on scene geometry or dynamics. This makes the method tractable for real-time rendering of arbitrary dynamic environments and for interactive preview of feature animations. Through DRM we simulate two diffuse reflections of light, but can also, in combination with traditional real-time methods for specular reflections, simulate more complex light paths. DRM is a GPU-based method, which can draw further advantages from upcoming GPU functionalities. The method has been tested for moderately sized scenes with close to real-time frame rates and it scales with interactive frame rates for more complex scenes.
Providing Data Structure Animations in a Lightweight IDE
Authors: Dean Hendrix, James H. Cross, Jhilmil Jain, Larry Barowski
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

This paper presents the data structure animation tool jGRASP, which can automatically generate multiple synchronized views while the underlying code is being developed. The seamless integration of the the IDE with pedagogically effective software visualizations makes jGRASP an interesting tool for both educators and students.
Nondestructive evaluation of aircraft skin: product design and development in the sophomore engineering clinic
Authors: S. A. Mandayam
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

The four engineering departments (electrical, mechanical, chemical and civil) at Rowan University (USA) rely extensively on semester-long project modules called "Clinics" to provide practical applications for coursework taught within the respective departments. The engineering clinics are typically team-taught by faculty from more than one discipline; the student project teams are also multidisciplinary. The focus is on product design and development, students and faculty bring skills acquired from their respective disciplines to bear on the design process. This paper describes a sophomore level clinic experience wherein students and faculty from the Electrical and Mechanical Engineering departments collaborated to design and develop a portable device that could be used to nondestructively inspect aircraft skin for cracks.
Saying, "I Am Testing," is Enough to Improve the Product: An Empirical Study
Authors: Pierre N. Robillard, Tiego Francois-Brosseau
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2007)

We report on an empirical study performed in an industrial environment in which the impact of modifying test practices is measured. First, the efficiency of the existing test practices is measured, by analyzing the software defects using a modified version of Orthogonal Defect Classification (ODC). The study was conducted in two phases lasting seven months each. In the first phase (Phase A), defects were recorded using existing implicit testing practices. Developers were then required to make those testing activities explicit based on a simple scheme. After a few months of employing this explicit testing practice, a new defect recording phase (Phase B), which also lasted seven months, was conducted. The impacts of explicit test practices are presented in terms of the ratios of defects found by the users and the nature of the testing activities performed. Results show that even a small improvement, such as requiring testing activities to be explicit, can have a measurable positive impact on the quality of the product.
A heuristic approach to cost-efficient derived horizontal fragmentation of complex value databases
Authors: Hui Ma, Klaus-Dieter Schewe, Qing Wang
Venue: Proceedings of the eighteenth conference on Australasian database - Volume 63 (2007)

Derived horizontal fragmentation is one of the main database distribution design techniques. Unlike primary horizontal fragmentation, the decision of derived horizontal fragmentation is not straightforward. In the literature, in the context of the relational model, derived horizontal fragmentation of a member relation is achieved by performing semijoins with fragments of one of its owner relations, which is chosen in an ad hoc manner without evaluating the system performance. Similar approaches are found in the literature for the object oriented data model. We note that fragmentation and allocation are often considered separately, disregarding that they are using the same input information to achieve the same objective, i.e. improve the overall system performance. This paper addresses derived horizontal fragmentation and allocation simultaneously in the context of complex data model. The core of the paper is a heuristic approach to derived horizontal fragmentation, which uses a cost model and is targeted at globally minimising costs.
A multi-core debug platform for NoC-based systems
Authors: Shan Tang, Qiang Xu
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Network-on-Chip (NoC) is generally regarded as the most promising solution for the future on-chip communication scheme in giga-scale integrated circuits. As traditional debug architecture for bus-based systems is not readily applicable to identify bugs in NoC-based systems, in this paper, we present a novel debug platform that supports concurrent debug access to the cores under debug (CUDs) and the NoC in a unified architecture. By introducing core-level debug probes in between the CUDs and their network interfaces and a system-level debug agent controlled by an off-chip multi-core debug controller, the proposed debug platform provides in-depth analysis features for NoC-based systems, such as NoC transaction analysis, multi-core cross-triggering and global synchronized timestamping. Therefore, the proposed solution is expected to facilitate the designers to identify bugs in NoC-based systems more effectively and efficiently. Experimental results show that the design-for-debug cost for the proposed technique in terms of area and traffic requirements is moderate.
A Simulation-Based Approach to Congestion Problem in Cafeteria
Authors: Teruaki Ito
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

Congestion problem is a critical issue at the cafeteria of the University of Tokushima. To cope with this problem, several solutions are under consideration, including layout design, payment method, facilities, etc. In order to examine these solutions, field studies at the cafeteria are required. However, it is neither always possible nor realistic to do so in actual situations. This study applied a simulation-based approach to this problem from the view point of saving time, saving cost, and avoidance of risks. This paper presents the simulation model designed in this research, clarifies how it was implemented for simulation, and the results of simulation to review the feasibility of the proposed solutions.
A special class of orthonormal wavelets: theory, implementations, and applications
Authors: Lixin Shen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

This paper introduces a novel class of length-4N orthonormal scalar wavelets, and presents the theory, implementational issues, and their applications to image compression. We first give the necessary and sufficient conditions for the existence of this class. The parameterized representation of filters with different lengths are then given. Next, we derive new and efficient decomposition and reconstruction algorithms specifically tailored to this class of wavelets. We show that the proposed discrete wavelet transformations are orthogonal and have lower computational complexity than conventional octave-bandwidth transforms using Daubechies' (1989) orthogonal filters of equal length. In addition, we also verify that symmetric boundary extensions can be applied. Finally, our image compression results further confirm that improved performance can be achieved with lower computational cost. 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
Collaborative Web Computing: From Desktops to Webtops
Authors: Haifeng Shen, Zhonghua Yang, Chengzheng Sun
Venue: IEEE Distributed Systems Online (2007)

Web-based applications offer many advantages -sharing, platform agnosticism, low risk of data loss, wide accessibility, and, most important, collaboration- that are too attractive to ignore. The "Webification" approach leverages existing desktop applications into collaborative "Webtop" applications- Web-aware desktop applications. Collaborative Webtops combine desktops' rich functionality and responsiveness with the Web's platform agnosticism and collaborative accessibility to provide their users with revolutionary experiences. This would not only make such applications more available and usable but also preserve existing desktop applications' vast user base and their rich usage skills and experiences.
Heuristic cleaning algorithms in log-structured file systems
Authors: Trevor Blackwell, Jeffrey Harris, Margo Seltzer
Venue: Proceedings of the USENIX 1995 Technical Conference Proceedings on USENIX 1995 Technical Conference Proceedings (1995)

Research results show that while Log-Structured File Systems (LFS) offer the potential for dramatically improved file system performance, the cleaner can seriously degrade performance, by as much as 40% in transaction processing workloads [9]. Our goal is to examine trace data from live file systems and use those to derive simple heuristics that will permit the cleaner to run without interfering with normal file access. Our results show that trivial heuristics perform very well, allowing 97% of all cleaning on the most heavily loaded system we studied to be done in the background.
Segmenting unrestricted Chinese text into prosodic words instead of lexical words
Authors: Yao Qian
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

This paper stresses the importance of converting a string of lexical words to that of prosodic words in text-to-speech (TTS) systems by presenting the surface differences and perceptual differences between them. A statistical rule based method and a classification and regression tree (CART) based method are proposed as solutions. Though ComplicatedSet based CART method performs the best, the achievement is obtained at the cost of heavy computation workloads needed by a parser. Statistical rule based method results in higher recall but lower precision, comparing to SimpleSet CART method. It is very difficult to tell which is better, since we don't know which affects naturalness more, precision or recall. Both of them require only lexicon word segmentation and part of speech (POS) tagging in the preprocessing stage, and are easily realized in TTS systems. Results of the preference test discloses that significant improvements on naturalness are perceived when lexical word strings are converted into prosodic word strings by our approach.
Analysis of RealTime Embedded Applications in the Presence of a Stochastic Fault Model
Authors: Ranjani Sridharan, Rabi Mahapatra
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

Real-time embedded systems are characterized by their need to complete task executions within their scheduled dead- lines. Task scheduling could get complicated due to the oc- currence of faults in such systems. Traditionally, researchers have accounted for faults by assuming a constant number of faults occuring in the system. However, such an assump- tion may lead the system designers to rather pessimistic es- timates on tasks' response times. In this paper, the occur- rence of faults has been modeled as a stochastic process with a Poisson distribution having a mean inter-arrival rate of. The usefulness of the model has been evaluated in terms of estimated task response time, energy consumption and loss of predictability for two periodic real-time embedded task sets, one real-world and another synthetic. It has been shown that the proposed approach can achieve up to 40% improvement in terms of the estimated energy savings and task response time with very minimal loss of predictability in the system of about 1e-3 % as compared to the systems with constant number faults.
Thin Client Computing Solutions in Low- and High-Motion Scenarios
Authors: L. Deboosere, J. De Wachter, P. Simoens, F. De Turck, B. Dhoedt, P. Demeester
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

The centralized thin client computing environment offers a solution to the vulnerability of desktops to viruses, trojan horses and worms. It also releases the user from regular software and hardware updates. One of the major barriers for the proliferation of thin clients in public wide-area networks is the hampering presentation of multimedia applications. While the existing remote display protocols offer a good user experience for office applications, most protocols cannot deal with swift display updates, like video playback, or hardware-accelerated 3D-graphics as in games. In this paper, a wide range of wellknown and widely used thin client protocols are tested in both low-motion and high-motion scenarios. It is shown that additional functionality is required to offer a satisfying multimedia experience.
Applications for Provably Secure Intent Protection with Bounded Input-Size Programs
Authors: J. Todd McDonald, Alec Yasinsac
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

The de facto standard program obfuscation security model, termed the virtual black box (VBB), declares a program to be securely obfuscated if and only if an adversary can prove no more when given the obfuscated code than it can when only given oracle access to the original program. In this paper, we define and give methodology for a perfectly secure program intent obfuscation that is general and practical for bounded input-size programs, including those with input/output relationships that are easily learned. We also lay foundations for how to embed a key securely in a private-key encryption setting using such constructions.
DNK-WSD: A Distributed Approach for Knowledge Discovery in Peer to Peer Networks
Authors: Giovanni Aiello, Marco Alessi, Massimo Cossentino, Pietro Storniolo, Alfonso Urso
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

Service Oriented Architectures (SOA) represent a recent proposal to obtain cooperation and interoperability in distributed computing environments. A challenge of SOA is services and resources discovery which can be realized both in centralized and distributed way. The distributed approach involves peer-to-peer (P2P) infrastructures supporting the knowledge distribution among peers. In this paper we propose DNK-WSD, a new network architecture providing an efficient distributed web service and resource discovery mechanism based on the notification pattern. The DNK network is a peer-to-peer architecture built using the Distributed Network Knowledge (DNK) heuristic which represents a lightweight approach to model graphs mapping logical P2P overlay networks. A case study, regarding the deployment of DNK-WSD for information sharing in real time collaborative web applications, demonstrates the validity of DNK-WSD in terms of fast propagation of the shared data, low network load and reliability.
On the Fly Testing of Regular Patterns in Distributed Computations
Authors: Eddy Fromentin, Michel Raynal, Vijay K. Garg, Alex Tomlinson
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

A class of properties of distributed computations is described and an algorithm which detects them is presented. This class of properties called regular patterns allows the user to specify an expected (or unwanted) behavior of a computation as sequences of relevant events (or as sequences of local predicates that must be successively verified). The sequences are defined by a finite state automaton (hence the name regular patterns) A computation verifies the property if and only if one of its causal paths matches a sequence.
Au&#x2013;Sn flip-chip solder bump for microelectronic and optoelectronic applications
Authors: Jeong-Won Yoon, Hyun-Suk Chun, Ja-Myeong Koo, Seung-Boo Jung
Venue: Microsystem Technologies (2007)

As an alternative to the time-consuming solder pre-forms and pastes currently used, a co-electroplating method of eutectic Au&#x2013;Sn alloy was used in this study. Using a co-electroplating process, it was possible to plate the Au&#x2013;Sn solder directly onto a wafer at or near the eutectic composition from a single solution. Two distinct phases, Au5Sn (&#x03b6;-phase) and AuSn (&#x03b4;-phase), were deposited at a composition of 30&#x00a0;at.%Sn. The Au&#x2013;Sn flip-chip joints were formed at 300 and 400&#x00b0;C without using any flux. In the case where the samples were reflowed at 300&#x00b0;C, only an (Au,Ni)3Sn2 IMC layer formed at the interface between the Au&#x2013;Sn solder and Ni UBM. On the other hand, two IMC layers, (Au,Ni)3Sn2 and (Au,Ni)3Sn, were found at the interfaces of the samples reflowed at 400&#x00b0;C. As the reflow time increased, the thickness of the (Au,Ni)3Sn2 and (Au,Ni)3Sn IMC layers formed at the interface increased and the eutectic lamellae in the bulk solder coarsened.
Training of HMM with filtered speech material for hands-free recognition
Authors: D. Giuliani
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

This paper addresses the problem of hands-free speech recognition in a noisy office environment. An array of six omnidirectional microphones and a corresponding time delay compensation module are used to provide a beamformed signal as input to a HMM-based recognizer. Training of HMMs is performed either using a clean speech database or using a filtered version of the same database. Filtering consists in a convolution with the acoustic impulse response between the speaker and microphone, to reproduce the reverberation effect. Background noise is summed to provide the desired SNR. The paper shows that the new models trained on these data perform better than the baseline ones. Furthermore, the paper investigates on maximum likelihood linear regression (MLLR) adaptation of the new models. It is shown that a further performance improvement is obtained, allowing to reach a 98.7% WRR in a connected digit recognition task, when the talker is at 1.5 m distance from the array.
GPD training of the state weighting functions in hidden control neural network
Authors: Kyungmin Na
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

This paper proposes a weighted hidden control neural network (WHCNN) which incorporates a state weighting function into the conventional HCNN. The state weighting function is trained by the generalized probabilistic descent (GPD) method. The GPD method allows minimization of the number of recognition errors directly, and thus allows approximation of the minimum-error-rate recognizer. As a result, we can find that state prediction residuals from each state contain rich discrimination information. Experimental results on the Korean digit recognition have shown 25% and about 16.7% reduction in the number of recognition errors for closed and open test, respectively. The derived algorithm may be easily applied to other predictive neural networks.
COMERA: COM extensible remoting architecture
Authors: Yi-Min Wang, Woei-Jyh Lee
Venue: Proceedings of the 4th conference on USENIX Conference on Object-Oriented Technologies and Systems - Volume 4 (1998)

In a distributed object system, remoting architecture refers to the infrastructure that allows client programs to invoke methods on remote server objects in a transparent way. In this paper, we study the strength and limitations of current remoting architecture of COM (Component Object Model), and propose a new architecture called COMERA (COM Extensible Remoting Architecture) to enhance the extensibility and flexibility. We describe several application scenarios and implementations to demonstrate the power of such a componentized remoting architecture.