ppxscal/embedding_network huggingface dataset:
Architectural Mismatch in Service-Oriented Architectures
Authors: Kevin Bierhoff, Mark Grechanik, Edy S. Liongosari
Venue: Proceedings of the International Workshop on Systems Development in SOA Environments (2007)

Architectural mismatch results from implicit and conflicting assumptions that designers of components make about the environments in which these components should operate. While architectural mismatch was extensively studied in monolithic and distributed applications, it has not been applied to Service-Oriented Architectures (SOAs). A major contribution of this paper is the analysis of how architectural mismatch affects SOAs. We study how implicit and conflicting assumptions that designers make about web services and their compositions affect the quality of resulting SOA-based systems. We support our analysis with empirical data that we collected from a large-scale SOA-based project within Accenture and other smaller projects.
A 1200 bps speech coder with LSF matrix quantization
Authors: S. Ozaydin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

A new 1200 bps speech coder designed with a tree searched multistage matrix quantization scheme is proposed. To improve speech quality and reduce the average bit rate, we have developed a new residual multistage matrix quantization method with the joint design technique. The new,joint design algorithm reduces the codebook training complexity. Other new techniques for improving the performance include joint quantization of pitch and voiced/unvoiced/mixed decisions and gain interpolation. For the new matrix quantization based speech coder (MQBC), the listening tests have proven that an efficient and high quality coding has been achieved at bit rate 1200 bps. Test results are compared with the 2400 bps LPC10e coder and the new 2400 bps MELP coder which has been chosen as the new 2400 bps Federal Standard.
A parallel residue-to-binary converter
Authors: Wei Wang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

A high-speed parallel residue-to-binary converter is proposed for the moduli set S/sup k/={2/sup m/-1, 2/sup 2(0)m/+1, 2/sup 2(l)m/+1, L, 2.
An integrated approach to rule refinement for instructable knowledge-based agents
Authors: Gheorghe Tecuci
Venue:  (2007)

Our research addresses the problem of developing knowledge-based agents that incorporate the knowledge of subject matter experts. Our approach is to develop a learning and problem solving agent, which can be directly taught by a subject matter expert by explaining it how to solve specific problems, and by critiquing its attempts to solve new problems. Because the accuracy of the agent's reasoning depends on the rules from its knowledge base, the process of rule improvement is very important. This dissertation presents an integrated set of methods to assist a subject matter expert in refining the rules from an agent's knowledge base, to incorporate his problem solving expertise. This dissertation presents methods to discover incompletely refined rules and to propose suggestions for their improvement; to guide the expert during the rule refinement process, focusing his attention on the reasoning steps that need to be analyzed; to refine the applicability condition of over-generalized and over-specialized rules; to modify a learned rule using a lazy refinement method; and to extend the agent's ontology to eliminate the rules' exceptions. These methods complement each other and create an integrated approach to the rule refinement problem in an evolving representation space, resulting in refined problem solving rules, which will assure a higher degree of correctness of the solutions generated by the agent. These rule refinement methods have been implemented in the Disciple learning agent shell, and have been evaluated during several experiments in complex application domains.
Unsupervised topic identification by integrating linguistic and visual information based on hidden Markov models
Authors: Tomohide Shibata, Sadao Kurohashi
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

This paper presents an unsupervised topic identification method integrating linguistic and visual information based on Hidden Markov Models (HMMs). We employ HMMs for topic identification, wherein a state corresponds to a topic and various features including linguistic, visual and audio information are observed. Our experiments on two kinds of cooking TV programs show the effectiveness of our proposed method.
Architectural implications of brick and mortar silicon manufacturing
Authors: Martha Mercaldi Kim, Mojtaba Mehrara, Mark Oskin, Todd Austin
Venue: Proceedings of the 34th annual international symposium on Computer architecture (2007)

We introduce a novel chip fabrication technique called "brick and mortar", in which chips are made from small, pre-fabricated ASIC bricks and bonded in a designer-specified arrangement to an inter-brick communication backbone chip. The goal of brick and mortar assembly is to provide a low-overhead method to produce custom chips, yet with performance that tracks an ASIC more closely than an FPGA. This paper examines the architectural design choices in this chip-design system. These choices include the definition of reasonable bricks, both in functionality and size, as well as the communication interconnect that the I/O cap provides. To do this we synthesize candidate bricks, analyze their area and bandwidth demands, and present an architectural design for the inter-brick communication network. We discuss a sample chip design, a 16-way CMP, and analyze the costs and benefits of designing chips with brick and mortar. We find that this method of producing chips incurs only a small performance loss (8%) compared to a fully custom ASIC, which is significantly less than the degradation seen from other low-overhead chip options, such as FPGAs. Finally, we measure the effect that architectural design decisions have on the behavior of the proposed physical brick assembly technique, fluidic self-assembly.
Parallel computation of discrete Legendre transforms
Authors: M. F. Aburdene
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

This paper presents a parallel implementation of the discrete Legendre transform using SIMD machines, MasPar MP-1 and MP-2. Laguerre, Hermite, and binomial transforms can be implemented in a similar manner using some of the computations required to compute the discrete Legendre transform. The time required to compute the discrete Legendre transform vs. number of points for an MP-2 machine is included.
Designing fast interpolation and extrapolation algorithms
Authors: P. J. S. G. Ferreira
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

One of the purposes of this paper is to outline a unified approach to the design of fast, stable band-limited interpolation or extrapolation l superresolution algorithms, iterative or noniterative, able to perform well even for large size problems (block sizes of thousands of samples and above). The results are about one-dimensional signals, but some attention is given to efficient image extrapolation or superresolution. An attempt is also made to clarify the connections between some of the existing algorithms, and in the process of doing so we uncover some new possibilities, that lead to the fastest known algorithms for certain classes of problems. However, it is shown that no method can be "best overall", since there are problems for which one set of methods clearly outperforms the others. The main issues that arise when designing efficient algorithms for the solution of a specific problem are discussed.
Variational iteration method for solving cubic nonlinear Schrödinger equation
Authors: N. H. Sweilam
Venue: Journal of Computational and Applied Mathematics (2007)

The variational iteration method is applied to solve the cubic nonlinear Schrodinger (CNLS) equation in one and two space variables. In both cases, we will reduce the CNLS equation to a coupled system of nonlinear equations. Numerical experiments are made to verify the efficiency of the method. Comparison with the theoretical solution shows that the variational iteration method is of high accuracy.
Visualization of Growth Curve Data from Phenotype Microarray Experiments
Authors: Janet S. Jacobsen, Dominique C. Joyner, Sharon E. Borglin
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

Phenotype microarrays provide a technology to simultaneously survey the response of an organism to nearly 2,000 substrates, including carbon, nitrogen and potassium sources; varying pH; varying salt concentrations; and antibiotics. In order to more quickly and easily view and compare the large number of growth curves produced by phenotype microarray experiments, we have developed software to produce and display color images, each of which corresponds to a set of 96 growth curves. Using color images to represent growth curves data has proven to be a valuable way to assess experiment quality, compare replicates, facilitate comparison of the responses of different organisms, and identify significant phenotypes. The color images are linked to traditional plots of growth versus time, as well as to information about the experiment, organism, and substrate. In order to share and view information and data project-wide, all information, plots, and data are accessible using only a Web browser.
Distance Learning in Tele-Immersion Environment
Authors: Tetsuro Ogi, Hiroaki Sakon
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Distance education using the high-resolution video image has become popular according to the expansion of broadband networks. However, conventional distance learning systems lack the feeling of presence and have difficulty to utilize the three-dimensional information. This paper proposes the tele-immersive distance learning system that uses the video avatar, database interface and several interaction techniques in the shared virtual environment.
Cardinal multiwavelets and the sampling theorem
Authors: I. W. Selesnick
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

This paper considers the classical Shannon sampling theorem in multiresolution spaces with scaling functions as interpolants. As discussed by Xia and Zhang (1993), for an orthogonal scaling function to support such a sampling theorem, the scaling function must be cardinal. They also showed that the only orthogonal scaling function that is both cardinal and of compact support is the Haar function, which has only 1 vanishing moment and is not continuous. This paper addresses the same question, but in the multiwavelet context, where the situation is different. This paper presents the construction of orthogonal multiscaling functions that are simultaneously cardinal, of compact support, and have more than one vanishing moment. The scaling functions thereby support a Shannon-like sampling theorem. Such wavelet bases are appealing because the initialization of the discrete wavelet transform (prefiltering) is the identity operator-the projection of a function onto the scaling space is given by its samples.
The performance surface in nonlinear mean square estimation: application to the active noise control problem
Authors: M. H. Costa
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

This paper investigates the properties of the performance surface for a problem of nonlinear mean-square estimation of a random sequence. The problem studied has direct application to the study of active noise control (ANC) systems when the transducers are driven into nonlinear behavior. A deterministic expression is derived for the mean-square error (MSE) surface as a function of the system's degree of nonlinearity. It is shown how the presence of the nonlinearity deforms the MSE surface. It is demonstrated that the surface is unimodal, and the expression for the optimum weight vector is determined. The new results are then used to quantify the behavior of ANC systems employing the LMS adaptive algorithm. Important algorithm properties are derived from this study. Examples are presented to verify the analytical models derived.
Optimizing system configurations quickly by guessing at the performance
Authors: Takayuki Osogami, Sei Kato
Venue: ACM SIGMETRICS Performance Evaluation Review (2007)

The performance of a Web system can be greatly improved by tuning its configuration parameters. However, finding the optimal configuration has been a time-consuming task due to the long measurement time needed to evaluate the performance of a given configuration. We propose an algorithm, which we refer to as Quick Optimization via Guessing (QOG), that quickly selects one of nearly best configurations with high probability. The key ideas in QOG are (i) the measurement of a configuration is terminated as soon as the configuration is found to be suboptimal, and (ii) the performance of a configuration is guessed at based on the measured similar configurations, so that the better configurations are more likely to be measured before the others. If the performance of a good configuration has been measured, a poor configuration will be quickly found to be suboptimal with short measurement time. We apply QOG to optimizing the configuration of a real Web system, and find that QOG can drastically reduce the total measurement time needed to select the best configuration. Our experiments also illuminate several interesting properties of QOG specifically when it is applied to optimizing Web systems.
Fast memory footprint estimation based on maximal dependency vector calculation
Authors: Q. Hu, A. Vandecappelle, P. G. Kjeldsberg, F. Catthoor, M. Palkovic
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

In data dominated applications, loop transformations have a huge impact on the lifetime of array data and therefore on memory footprint. Since a locally optimal loop transformation may have a detrimental effect somewhere else, many alternative loop transformations need to be explored. Therefore, estimation of the memory footprint is essential, and this estimation has to be fast. This paper presents a fast array based memory footprint estimation technique based on counting of iteration nodes in an iteration domain constrained by a maximal lifetime. The maximal lifetime is defined by the Maximal Dependency Vector (MDV) of the array for a given execution ordering. We further present for the first time two approaches for calculation of the MDV: a general approach based on an ILP formulation and a novel vertexes approach when iteration domains are approximated by bounding boxes. Experiments on practical test vehicles demonstrate that the estimation based on our vertexes approach is extremely fast, on average two orders of magnitude faster than the compared approaches, while still keeping the accuracy high. This enables system-level data memory footprint exploration of many different alternative transformed program codes, within interactive time limits, and on realistic complex applications.
Incorporating visual attention into mesh simplification techniques
Authors: Susana Mata, Luis Pastor, José Juan Aliaga, Angel Rodríguez
Venue: Proceedings of the 4th symposium on Applied perception in graphics and visualization (2007)

The goal of this work is to propose a new automatic technique that makes use of the information obtained by means of a visual attention model for guiding the extraction of a simplified 3D model.
Super-resolution Imaging Using Grid Computing
Authors: Jing Tian, Kai-Kuang Ma
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

The super-resolution (SR) imaging is to overcome the inherent limitations of the image acquisition systems to produce high-resolution images from their low-resolution counterparts. In our recent work, the Markov chain Monte Carlo (MCMC) technique has been successfully developed and shown as a promising stochastic approach for addressing the SR problem. However, the MCMC SR approach requires substantial amounts of computational resources, for it not only needs to generate a huge number of samples, but also requires an exhaustive search for obtaining an optimal prior image model. To tackle the above computation challenge, Grid computing is introduced for tackling the SR problem in this paper. The computationallyintensive MCMC SR task is broke down into a set of independent and small sub-tasks, which are further distributed and implemented in the Grid computing environment. Their respective results are finally assembled to produce a highresolution image as the final result of the entire MCMC SR task. Experiments are conducted to show that Grid computing can effectively acc
FAB: enterprise storage systems on a shoestring
Authors: Svend Frølund, Arif Merchant, Yasushi Saito, Susan Spence, Alistair Veitch
Venue: Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9 (2003)

A Federated Array of Bricks (FAB) is a logical disk system that provides the reliability and performance of enterprise-class disk arrays, at a fraction of the cost and with better scalability. The unit of deployment in FAB is a brick, a small rack-mounted storage appliance built from commodity components including disks, a CPU, NVRAM, and network cards. Bricks federate themselves in a completely decentralized manner to provide users with a set of logical volumes. This paper motivates FAB and introduces our data replication algorithm based on majority-voting. We argue that majority voting is practical for ultra-reliable, high-throughput storage systems like FAB, and present several techniques that improve both the performance and space overhead of our protocol.
Degree-constrained network flows
Authors: P. Donovan, B. Shepherd, A. Vetta, G. Wilfong
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

A d-furcated flow is a network flow whose support graph has maximum out degree d. Take a single-sink multi-commodity flow problem on any network and with any set of routing demands. Then we show that the existence of feasible fractional flow with node congestion one implies the existence of a d-furcated flow with congestion at most 1+1/(d-1), for d ≥ 2. This result is tight, and sothe congestion gap for d-furcated flows is bounded andexactly equal to 1+ 1/(d-1). For the case d=1 (confluent flows), it is known that the congestion gap is unbounded, namely Θ(log n). Thus, allowing single-sink multicommodity network flows to increase their maximum out degree from one to two virtually eliminates this previously observed congestion gap. As a corollary we obtain a factor 1 + 1/(d-1)-approximation algorithm for the problem of finding a minimum congestion d-furcated flow; we also prove that this problem is max SNP-hard. Using known techniques these results also extend to degree-constrained unsplittable routing,where each individual demand must be routed along a unique path.
Pervasive Computing with Frugal Objects
Authors: Benoit Garbinato, Rachid Guerraoui, Jarle Hulaas, Maxime Monod, Jesper H. Spring
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

This paper presents a computing model for resource-limited mobile devices that might be ubiquitously deployed in private and business environments. The model integrates a strongly-typed event-based communication paradigm with abstractions for frugal control, assuming a small footprint runtime. With our model, an application consists of a set of distributed reactive objects, called Frugal Objects (FROBs), that communicate through typed events and dynamically adapt their behavior according to notifications about changes in resource availability. FROBs have a logical time-slicing execution pattern that helps monitor resource consuming tasks and determine resource profiles in terms of CPU, memory, battery and bandwidth.
Fast computation of the continuous wavelet transform through oblique projections
Authors: M. Vrhel
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

We introduce a fast simple method for computing the real continuous wavelet transform (CWT). The approach achieves O(N) complexity per scale and the filter coefficients can be analytically obtained by a simple integration. Our method is to use P wavelets per octave and to approximate them with their oblique projection onto a space defined by a compact scaling function. The wavelet templates are expanded to larger sizes (octaves) using the two-scale relation and zero padded filtering. Error bounds are presented to justify the use of an oblique projection over an orthogonal one.
On-Line Self-Healing of Circuits Implemented on Reconfigurable FPGAs
Authors: Manuel G. Gericota, Luis F. Lemos, Gustavo R. Alves, Jose M. Ferreira
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

To boost logic density and reduce per unit power consumption SRAM-based FPGAs manufacturers adopted nanometric technologies. However, this technology is highly vulnerable to radiation-induced faults, which affect values stored in memory cells, and to manufacturing imperfections. Fault tolerant implementations, based on Triple Modular Redundancy (TMR) infrastructures, help to keep the correct operation of the circuit. However, TMR is not sufficient to guarantee the safe operation of a circuit. Other issues like module placement, the effects of Multi- Bit Upsets (MBU) or fault accumulation, have also to be addressed. In case of a fault occurrence the correct operation of the affected module must be restored and/or the current state of the circuit coherently re-established. A solution that enables the autonomous restoration of the functional definition of the affected module, avoiding fault accumulation, re-establishing the correct circuit state in real-time, while keeping the normal operation of the circuit, is presented in this paper.
Building a digital library of traditional mongolian historical documents
Authors: Garmaabazar Khaltarkhuu, Akira Maeda
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

This paper describes technique of converting modern Mongolian text input to traditional Mongolian script and integrating the result into the Greenstone Digital Library (GSDL). This work is part of on-going research to create a digital library of traditional Mongolian historical documents.
Vehicle Communication Experiment Environment with MANET and NEMO
Authors: Manabu Tsukada, Thierry Ernst
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

Mobile Adhoc Network (MANET) routing protocols and NEMO basic support protocol are developed as independent technologies. Since both will be used in vehicles communication, interaction between MANET and NEMO (MANEMO) brings benefits which are referred as route optimization and multihoming. To investigate MANEMO, we classify it into five topologies. With Optimized Link State Routing (OLSR) protocol and NEMO basic support protocol, we setup a real-field testbed which consist of mobile networks in two electric vehicles. Network performance of MANEMO is evaluated with this testbed. The experimentation results show that MANEMO allows to improve the overall network performance.