ppxscal/embedding_network huggingface dataset:
Decolored Ll filter lattice: a subclass of Ll filters useful in practice
Authors: Yeong-Taeg Kim
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

The Ll filters constitute a wide class of filters including both linear and L filters, and it has been shown that they outperform linear and L filters. A close examination of the optimization of the Ll filters in real applications, however, casts a problem of importance that the Ll filters can be degraded from insufficient signal statistics for optimization since a sufficiently long training data sequence is not tractable in practice for the Ll filters, especially, when the the number of input taps is large. We formally propose a new class of order-statistic filters referred to as the decolored Ll filter lattice, which exploits a decolored rank permutation space. By decoloring the rank permutation space, having sufficient training data for optimization in practice is feasible. Various filters are obtained in the class of decolored Ll filters for different orders of decoloring. It is shown that the set of decolored Ll filters of all orders form a lattice structure. At the simplest level in the structure, the decolored Ll filters reduce to a simple linear (FIR) filter, and we obtain the Ll filter at the highest level in the structure. 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
IT Governance Maturity and IT Outsourcing Degree: An Exploratory Study
Authors: Tomi Dahlberg, Pirkko Lahdelma
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The generic rationale of IT governance and IT outsourcing is similar. Both aim to increase business value delivery from IT. This article examines empirically how IT governance maturity evaluations of 109 senior executives in 20 enterprises differ, between those enterprises that have outsourced their IT function selectively and those enterprises that have conducted total outsourcing of their IT function. We collected survey data with an instrument, which builds on a generic IT governance framework and measures IT governance maturity. The article also evaluates whether the survey instrument is applicable to research that compares selective versus total outsourcing in the context of IT governance. In statistical analysis, we found several differences between selective and total IT outsourcers.
Search Based Software Engineering for Program Comprehension
Authors: Mark Harman
Venue: Proceedings of the 15th IEEE International Conference on Program Comprehension (2007)

Search Based Software Engineering (SBSE) is an approach to software engineering in which search based optimization algorithms are used to identify optimal or near optimal solutions and to yield insight. SBSE techniques can cater for multiple, possibly competing objectives and/or constraints and applications where the potential solution space is large and complex. Such situations are common in software engineering, leading to an increasing interest in SBSE. This paper provides a brief overview of SBSE, explaining some of the ways in which it has already been applied to program - comprehension related activities. The paper also outlines some possible future applications of and challenges for the further application of SBSE to Program Comprehension.
Incomplete oblique projections for solving large inconsistent linear systems
Authors: H. D. Scolnik, N. Echebest, M. T. Guardarucci, M. C. Vacchino
Venue: Mathematical Programming: Series A and B (2007)

The authors introduced in previously published papers acceleration schemes for Projected Aggregation Methods (PAM), aiming at solving consistent linear systems of equalities and inequalities. They have used the basic idea of forcing each iterate to belong to the aggregate hyperplane generated in the previous iteration. That scheme has been applied to a variety of projection algorithms for solving systems of linear equalities or inequalities, proving that the acceleration technique can be successfully used for consistent problems. The aim of this paper is to extend the applicability of those schemes to the inconsistent case, employing incomplete projections onto the set of solutions of the augmented system Ax &#x2212; r&#x00a0;=&#x00a0;b. These extended algorithms converge to the least squares solution. For that purpose, oblique projections are used and, in particular, variable oblique incomplete projections are introduced. They are defined by means of matrices that penalize the norm of the residuals very strongly in the first iterations, decreasing their influence with the iteration counter in order to fulfill the convergence conditions. The theoretical properties of the new algorithms are analyzed, and numerical experiences are presented comparing their performance with several well-known projection methods.
Development of a speech processor for laboratory experiments with cochlear implant patients
Authors: O. Poroy
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

A laboratory speech processor based on Motorola's DSP56002 chip was developed for cochlear implant research. The hardware of the speech processor is described in detail and the safety issues associated with electrical stimulation of the auditory nerve are discussed. The speech processor is capable of providing high-rate stimulation to six electrodes using short biphasic pulses presented either simultaneously or in an interleaved fashion. Different speech processing algorithms including the continuous interleaved sampling (CIS) strategy were implemented in this processor and tested successfully with cochlear implant patients.
Contextualization of Geospatial Database Semantics for Human---GIS Interaction
Authors: Guoray Cai
Venue: Geoinformatica (2007)

Human interactions with geographical information are contextualized by problem-solving activities which endow meaning to geospatial data and processing. However, existing spatial data models have not taken this aspect of semantics into account. This paper extends spatial data semantics to include not only the contents and schemas, but also the contexts of their use. We specify such a semantic model in terms of three related components: activity-centric context representation, contextualized ontology space, and context mediated semantic exchange. Contextualization of spatial data semantics allows the same underlying data to take multiple semantic forms, and disambiguate spatial concepts based on localized contexts. We demonstrate how such a semantic model supports contextualized interpretation of vague spatial concepts during human---GIS interactions. We employ conversational dialogue as the mechanism to perform collaborative diagnosis of context and to coordinate sharing of meaning across agents and data sources.
Methodology for Analysis of Networks Performance
Authors: Abrosimov Leonid
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

In this paper formulated the system of the interconnected definitions of performance for components and computer network as a whole, functioning in typical modes. Examined the specification of quantitative parameters of computer networks architecture. Theory allows obtain quantitative evaluations of computer networks performance in typical modes of functioning.
Automatic generation of colorful patterns with wallpaper symmetries from dynamics
Authors: Jian Lu, Zhongxing Ye, Yuru Zou
Venue: The Visual Computer: International Journal of Computer Graphics (2007)

A new algorithm is presented in this paper for the generation of colorful images with wallpaper symmetries by means of dynamical systems. Invariant functions are employed to construct density functions for the creation of colorful images.
Context Aware Routing of Enterprise User Communications
Authors: Munmun De Choudhury, Hari Sundaram, Ajita John, Doree Duncan Seligmann
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

This paper develops a context aware framework to address the diverse communication needs of a modern enterprise. Such enterprises are characterized by workers in different locations, subject to different policies, using different communication devices, and having varying degrees of skill sets. This diversity poses challenges in finding the most effective human worker (agent) for tasks like fielding a customer request, helping another agent with additional expert knowledge, or more generally help complete a task like a supply chain exception. We focus on the problem of routing communications to the most effective agent using a spectrum of contextual knowledge: availability, media type, activity, expertise, and location. We determine an optimal "request-to-agent' routing based on several metrics of effectiveness depending on the communication context. The optimal agent is selected to communicate on a specific media who minimizes the expected duration of interaction while maximizes the probability of successful call completion. Based on our model we have conducted simulations involving context aware and non-context aware routing scenarios. The results indicate that the context aware routing outperforms other conventional request-routing techniques. The work presented here can impact routing algorithms, as well as address problems related to enterprise staffing and temporal variation of context for the agent.
Interposed request routing for scalable network storage
Authors: Darrell C. Anderson, Jeffery S. Chase, Amin M. Vahdat
Venue: Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4 (2000)

This paper explores interposed request routing in Slice, a new storage system architecture for high-speed networks incorporating network-attached block storage. Slice interposes a request switching filter - called a µproxy - along each client's network path to the storage service (e.g., in a network adapter or switch). The µproxy intercepts request traffic and distributes it across a server ensemble. We propose request routing schemes for I/O and file service traffic, and explore their effect on service structure. The Slice prototype uses a packet filter µproxy to virtualize the standard Network File System (NFS) protocol, presenting to NFS clients a unified shared file volume with scalable bandwidth and capacity. Experimental results from the industry-standard SPECsfs97 workload demonstrate that the architecture enables construction of powerful network-attached storage services by aggregating cost-effective components on a switched Gigabit Ethernet LAN.
An Overview of Symbolic Analysis Techniques Needed for the Effective Parallelization of the Perfect Benchmarks
Authors: William Blume, Rudolf Eigenmann
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

We have identified symbolic analysis techniques that will improve the effectiveness of parallelizing Fortran compilers, with emphasis upon data dependence analysts. We have done this by comparing the automatically and manually parallelized versions of the Perfect Benchmarks®. The techniques include: symbolic data dependence tests for nonlinear expressions, constraint propagation, array summary information, and run time tests.
Scheduling for stability in single-machine production systems
Authors: Roel Leus, Willy Herroelen
Venue: Journal of Scheduling (2007)

Robust scheduling aims at the construction of a schedule that is protected against uncertain events. A stable schedule is a robust schedule that changes only little when variations in the input parameters arise. This paper presents a model for single-machine scheduling with stability objective and a common deadline. We propose a branch-and-bound algorithm for solving an approximate formulation of the model. The algorithm is exact when exactly one job is disrupted during schedule execution.
Project Track and Trace Ontology
Authors: Hai Dong, Farookh Khadeer Hussain, Elizabeth Chang
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

It is well-known that ontology is utilized as an effective methodology to share domain-specific knowledge in multidisciplinary fields. In the field of project management, due to the characteristic of project organizations in which project members are geographically dispersed and from different cultural background, senior management would feel difficulty when they attempt to know about the detailed project completion status from dispersed project groups. Thus, the objective of this paper is to propose an automated project track and trace methodology through the use of ontology technology, to challenge the knowledge sharing issues in project organizations. By means of extending CCCI Metrics into the field of project management and introducing a new ontological notation system, we deliver the project track and trace ontology.
Broadband matched field processing using robust prewhitening and multiple window techniques
Authors: C. F. Mecklenbrauker
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

The estimation of source and environmental parameters for stationary broadband wave propagation in an unknown shallow ocean is considered. We apply an approximate maximum-likelihood technique (AMLE) in the frequency domain after cleaning the observations from outliers using robust prewhitening. This method is compared with the previously used multitaper techniques. Environmental noise in data obtained by horizontally towed arrays just beneath the ocean surface has been observed to be more spiky than Gaussian due to the sound originating from individual breaking waves. Therefore, we apply the robust-resistant spectral methods introduced by Martin and Thomson (1982). The advantage of this approach is the physically and statistically justified full broadband estimator. Simulations show the feasibility of the presented approach. Finally, the algorithm is applied to real sonar data recorded by a horizontally towed receiver array in the Baltic Sea in order to estimate the ocean depth and source bearings and to interpret the impinging signals.
Adaptive sorted neighborhood methods for efficient record linkage
Authors: Su Yan, Dongwon Lee, Min-Yen Kan, Lee C. Giles
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

Traditionally, record linkage algorithms have played an important role in maintaining digital libraries - i.e., identifying matching citations or authors for consolidation in updating or integrating digital libraries. As such, a variety of record linkage algorithms have been developed and deployed successfully. Often, however, existing solutions have a set of parameters whose values are set by human experts off-lineand are fixed during the execution. Since finding the ideal values of such parameters is not straightforward, or no such single ideal value even exists, the applicability of existing solutions to new scenarios or domains is greatly hampered. To remedy this problem, we argue that one can achieve significant improvement by adaptively and dynamically changing such parameters of record linkage algorithms. To validate our hypothesis, we take a classical record linkage algorithm, the sorted neighborhood method (SNM), and demonstrate how we can achieve improved accuracy and performance by adaptively changing its fixed sliding window size. Our claim is analytically and empirically validated using both real and synthetic data sets of digital libraries and other domains.
A compact low-power decimation filter for sigma delta modulators
Authors: Suet-Fei Li
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

Sigma delta modulators can provide the lowest power and area solution for high resolution A/D converters. Unfortunately the required decimation filter for the modulator tends to consume much more power and area than the modulator. This paper solves both problem by introducing a new FIR-Sinc architecture and taking advantage of the low number of bits at the input. Careful choice of pipelining and logic style and the use of multiple-V/sub DD/ logic lead to a low power implementation without compromising on performance and area. The power consumed is 93% less and area used is 14% less than the best reported designs. The 64-tap programmable decimation filter with 10-bit coefficients consumes 1.5 mW of power and 0.71 mm/sup 2/ of area running on a 40 MHz 1.5 bit input with a 1.25 MHz 15 bit output on a 1.65 V supply.
wshdbg - a debugger for CGI applications
Authors: Andrej Vckovski
Venue: Proceedings of the 6th conference on Annual Tcl/Tk Workshop, 1998 - Volume 6 (1998)

This contribution discusses wshdbg, an interactive, remote debugger for CGI applications written in pure or derived Tcl-based environments such as websh. The discussion covers a short overview of the websh environment and an analysis of current techniques and impediments of CGI debugging. The debugger presented consists of a client-server architecture, where the server is running on the same host as the Web browser, while the client is included in the CGI application that needs to be debugged. The resulting environment does not provide the level of sophistication known from typical source level debuggers, yet it presents a significant step forward compared to typical CGI debugging techniques which rely on tracing the execution by many log or debug messages. The system has been in operational use in the last two years and proved to be a great help in debugging large Web-based applications, allowing high-level software engineering for Web applications on nearly the same level as it is being done in traditional software development.
Scale Changes Everything: Understanding the Requirements for Systems of Systems
Authors: Steve Easterbrook
Venue: Proceedings of the Sixth International IEEE Conference on Commercial-off-the-Shelf (COTS)-Based Software Systems (2007)

Software technology now penetrates almost every aspect of our lives in complex ways. The reality of 21st century software development is that software itself is but one part of a complex system-of-systems that includes a broad technological infrastructure along with a wide set of human activities. The technological systems and the human activity systems have a symbiotic relationship - each shapes the other in complex ways, such that neither can be understood in isolation. A recent report from the SEI on Ultra-Large Scale (ULS) Systems accurately characterized the nature of these systems-of-systems: they have no centralized control; experience normal failures and continual evolution of heterogeneous elements; and their requirements are inherently conflicting, diverse and often unknowable. For design purposes, the boundary between people and software disappears - design is as much about shaping the human activities as it is about constructing the software.
Source localisation with recurrent neural networks
Authors: B. Colnet
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

We address the far-field source localisation problem. A new neuromimetic approach is presented. Instead of considering time as a second dimension of the input space, time is implicitly encoded in the structure of a recurrent neural network. This allows us to process temporal data such as the temporal propagation delays between the sensors of a linear array. Recurrent neural networks are encompassed in a two stage decision process. Locally, specialised neural networks are in charge of detecting acoustical sources in small angular sectors. Globally, an integration system locates accurately the direction of arrival of the signals.
A Software Implementation of the IEEE 754R Decimal Floating-Point Arithmetic Using the Binary Encoding Format
Authors: Marius Cornea, Cristina Anderson, John Harrison, Ping Tak Peter Tang, Eric Schneider, Charles Tsen
Venue: Proceedings of the 18th IEEE Symposium on Computer Arithmetic (2007)

The IEEE Standard 754-1985 for Binary Floating-Point Arithmetic [1] was revised [2], and an important addition is the definition of decimal floating-point arithmetic. This is intended mainly to provide a robust, reliable framework for financial applications that are often subject to legal requirements concerning rounding and precision of the results, because the binary floating-point arithmetic may introduce small but unacceptable errors. Using binary floating-point calculations to emulate decimal calculations in order to correct this issue has led to the existence of numerous proprietary software packages, each with its own characteristics and capabilities. IEEE 754R decimal arithmetic should unify the ways decimal floating-point calculations are carried out on various platforms. New algorithms and properties are presented in this paper which are used in a software implementation of the IEEE 754R decimal floatingpoint arithmetic, with emphasis on using binary operations efficiently. The focus is on rounding techniques for decimal values stored in binary format, but algorithms for the more important or interesting operations of addition, multiplication, division, and conversions between binary and decimal floating-point formats are also outlined. Performance results are included for a wider range of operations, showing promise that our approach is viable for applications that require decimal floating-point calculations.
Cibyl: an environment for language diversity on mobile devices
Authors: Simon Kågström, Håkan Grahn, Lars Lundberg
Venue: Proceedings of the 3rd international conference on Virtual execution environments (2007)

With an estimated installation base of around 1 billion units, the Java J2ME platform is one of the largest development targets available. For mobile devices, J2ME is often the only available environment. For the very large body of software written in C other languages, this means difficult and costly porting to another language to support J2ME devices. This paper presents the Cibyl programming environment which allows existing code written in C and other languages supported by GCC to be recompiled into Java bytecode and run with close to native Java performance on J2ME devices. Cibyl translates compiled MIPS binaries into Java bytecode. In contrast to other approaches, Cibyl supports the full C language, is based on unmodified standard tools, and does not rely on source code conversion. To achieve good performance, Cibyl employs extensions to the MIPS architecture to support low-overhead calls to native Java functionality and use knowledge of the MIPS ABI to avoid computing unused values and transfer unnecessary registers. An evaluation on multiple virtual machines shows that Cibyl achieves performance similar to native Java, with results ranging from a slowdown of around 2 to a speedup of over 9 depending on the JVM and the benchmark.