ppxscal/embedding_network huggingface dataset:
Introducing natural language program analysis
Authors: Lori Pollock, K. Vijay-Shanker, David Shepherd, Emily Hill, Zachary P. Fry, Kishen Maloor
Venue: Proceedings of the 7th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering (2007)

This research group presentation focuses on our work in extracting and utilizing natural language clues from source code to improve software maintenance tools. We demonstrate the valuable information that can be gained from a software system's identifiers, literals, and comments. We then present an overview of our extraction process, program representation, and a set of tools we have developedusing this natural language program analysis.
Adaptive statistical loop filtering technique for fast and reliable polarity-DPLL synchronizers
Authors: I. Panagiotopoulos
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

The concept of adaptive loop filtering is applied to the class of the polarity-DPLL synchronizers to obtain both fast acquisition and reliable steady-state tracking simultaneously. The loop-filter's adaptation mechanism is modeled as a finite state machine and its performance characteristics are numerically obtained in terms of state transition probabilities. Also, the filter's statistical behavior during soft-switchover from tracking to acquisition mode and vice-versa, is qualitatively evaluated by using short time open-loop hypotheses and exercising first-order Markov chain analysis.
Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks
Authors: Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman
Venue: SIAM Journal on Discrete Mathematics (2007)

In this paper we consider the $k$ edge-disjoint paths problem ($k$-EDP), a generalization of the well-known edge-disjoint paths problem. Given a graph $G=(V,E)$ and a set of terminal pairs (or requests) $T$, the problem is to find a maximum subset of the pairs in $T$ for which it is possible to select paths such that each pair is connected by $k$ edge-disjoint paths and the paths for different pairs are mutually disjoint. To the best of our knowledge, no nontrivial result is known for this problem for $k>1$. To measure the performance of our algorithms we use the recently introduced flow number $F$ of a graph. This parameter is known to fulfill $F=O(\Delta \alpha^{-1} \log n)$, where $\Delta$ is the maximum degree, $\alpha$ is the edge expansion of $G$, and $n$ is the number of vertices in $G$. We show that a simple greedy online algorithm achieves a competitive ratio of $O(k^3 F)$ which naturally extends the best known bound of $O(F)$ for $k=1$ to higher $k$. To achieve this competitive ratio, we introduce a new method of converting a system of $k$ disjoint paths into a system of $k$ length-bounded disjoint paths. We also show that any deterministic online algorithm has a competitive ratio of $\Omega(k F)$. In addition, we study the $k$ disjoint flows problem ($k$-DFP), which is a generalization of the previously studied unsplittable flow problem. The difference between the $k$-DFP and the $k$-EDP is that now we consider a graph with edge capacities and our requests are allowed to have arbitrary demands $d_i$. The aim is to find a subset of requests of maximum total demand for which it is possible to select flow paths such that all the capacity constraints are maintained and each selected request with demand $d_i$ is connected by $k$ disjoint paths, each of flow value $d_i/k$. The $k$-EDP and $k$-DFP problems have important applications in fault-tolerant (virtual) circuit switching, which plays a key role in optical networks.
Incorporating Lean Development Practices into Agile Software Development
Authors: Jeff Sutherland, Jean Tabaka
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Agile software development processes have been influenced by best practices in Japanese industry, particularly by lean development principles [1] implemented at companies like Toyota [2], and knowledge management strategies developed by Takeuchi and Nonaka [3], now at the Hitotsubashi Business School in Japan, and Peter Senge [4] at MIT. This minitrack will focus on advancing the state of the art or presenting innovative ideas related to agile methods, individual practices and tools. Accepted papers will potentially enrich the body of knowledge and influence the framework of thought in the field by investigating Agile methods in a rigorous fashion.
Presumptive Selection of Trust Evidences: A Non Invasive Application-Contained Solution
Authors: Pierpaolo Dondio, Stephen Barrett
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Trust Management Systems often make use of evidences such as certificates or users' recommendations that are part of a separated infrastructure added to applications for trust management purpose. Alternatively, trust computation might be based on evidences gathered directly from core application elements. Our ongoing research focuses on the latter approach proposing a methodology for selecting trust evidences among internal elements of the application under analysis. Key features of our method are its generality, the possibility to offer human-based justifications and the usage of presumptive reasoning to ground its decisions. If successfully identified, trust evidence could support a trust-based computation that is application-contained and non-invasive, compatible with aspects of ubiquitous and pervasive scenarios. In our evaluation section we show a complete example of our methodology.
Linear and nonlinear conjugate gradient methods for adaptive processing
Authors: S. T. Smith
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

Both fully adaptive and partially adaptive processing algorithms can be implemented using linear and nonlinear conjugate gradient (CG) methods. This approach can be computationally attractive when a family of continuous time-varying adaptive problems must be solved. An iterative approach that starts with the previous solution can converge quickly to the new solution. This paper considers linear and nonlinear CG methods for adaptive processing. The example used is space-time adaptive processing (STAP) and clutter interference subspace tracking within the context of an airborne radar with a rotating array. It is seen that the linear CG method for adaptive filtering in this context can be several times less costly than sample matrix inversion if the interference subspace has sufficient eigenvalue structure, and that a nonlinear CG algorithm is capable of tracking the principal clutter interference subspace. 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
A voice-operated multi-domain telephone information system
Authors: J. Nouza
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

This contribution describes the first Czech voice-operated information system running on the public telephone network. The system named InfoCity is a multi-domain inquiry service. It offers a wide range of information useful for citizens of a middle-size city, such as programs of cinemas and theatres, overview of local sport events, timetables of city and regional transport, opening times of public or private institutions. Since March 1999 the InfoCity serves inhabitants and visitors of Liberec, a city with 100000 population. During the first 9 months of its operation, more than 2900 inquiry calls were automatically processed. Although the system uses a fixed dialogue scenario with discrete-utterance input (with 220-item vocabulary), long-term statistics show that a typical call (with 5 to 9 dialogue turns) does not take more than 2 minutes. Under field trial conditions the average recognition score is about 87%.
Resolution of large symmetric eigenproblems on a world wide grid
Authors: Laurent Choy, Serge G. Petiton, Mitsuhisa Sato
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

We propose an explicit restarted Lanczos algorithm on a world-wide heterogeneous grid platform. This method computes one or few eigenpairs of a large sparse real symmetric matrix. We take the specificities of computational resources into account and deal with communications over the Internet by means of techniques such as out-of-core and data persistence. We also show that a restarted algorithm and the combination of several paradigms of parallelism are interesting in this context. We perform many experimentations using several parameters related to the Lanczos method and the configuration of the platform. Depending on the number of computed Ritz eigenpairs, the results underline how critical the choice of the dimension of the working subspace is. Moreover, the size of platform has to be scaled to the order of the eigenproblem because of communications over the Internet.
Ant colony optimization for FOP shop scheduling: a case study on different pheromone representations
Authors: C. Blum, M. Sampels
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

In this work we deal with the FOP shop scheduling problem which is a general scheduling problem including job shop scheduling, open shop scheduling and mixed shop scheduling as special cases. The aim of this paper is to compare different pheromone representations taken from the literature with our new approach. The pheromone representations are used by an ant colony optimization algorithm to construct solutions to the FOP shop scheduling problem.
Secure Web Application Development and Global Regulation
Authors: William Bradley Glisson, L. Milton Glisson, Ray Welland
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

The World Wide Web (WWW) has been predominantly responsible for instigating radical paradigm transformations in today's global information rich civilizations. Many societies have basic operational economical components that depend on Web enabled systems in order to support daily commercial activities. The acceptance of E-commerce as a valid channel for conducting business coupled with societal integration and dependence on Web enabled technology has instigated the development of local, national, and global efforts to regulate criminal activities on the World Wide Web. This paper makes two contributions. The first contribution is the high-level review of the United States and United Kingdom legislation that has developed from the escalation and integration of the World Wide Web into society. The second contribution is the support for the idea that legislative compatibility, in concert with an organization's policy compatibility, needs to be acknowledged in secure Web application development methodologies.
Learning active appearance models from image sequences
Authors: Jason Saragih, Roland Goecke
Venue: Proceedings of the HCSNet workshop on Use of vision in human-computer interaction - Volume 56 (2006)

One of the major drawbacks of the Active Appearance Model (AAM) is that it requires a training set of pseudo-dense correspondences. Most methods for automatic correspondence finding involve a groupwise model building process which optimises over all images in the training sequence simultaneously. In this work, we pose the problem of correspondence finding as an adaptive template tracking process. We investigate the utility of this approach on an audio-visual (AV) speech database and show that it can give reasonable results.
Understanding Individual Experiences of Chronic Illness with Semantic Space Models of Electronic Discussions
Authors: Guocai Chen, Jim Warren, Robert McArthur, Peter Bruza, Debbie Kralik, Kay Price
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

Electronic discussion groups provide a convenient forum for individuals to share their experiences of chronic illness. The language use of individual participants, and the way their language shifts over time, may provide implicit indications of important shifts in sense-of-self. This paper relates experience with application of the Hyperspace Analogue to Language (HAL) model for automatic construction of a dimensional model from a corpus of text. HAL is applied to 17 months of discussion on a closed list of 20 women coping with chronic illness. The discussion group was moderated for a focus the phenomenon of "Transition' - how people can learn to incorporate the consequences of illness into their lives. The current phase of research focuses on identification of clusters of words that can represent key aspects of Transition. The HAL models for two participants have been analyzed by experts in Transition to form candidate clusters. These clusters are then used as a basis for contrasting the language usage of an individual participant over time as compared to the entire corpus. We have not yet found a reliable basis for identifying transitions in an individual based on their entries into a discussion forum, although the clusters may have some inherent value for introspection on individual experiences and Transition in general. We report challenges for interpretation of the HAL model related to the correlation of dimensions and the impact of group dynamics.
Tetris: a new register pressure control technique for VLIW processors
Authors: Weifeng Xu, Russell Tessier
Venue: ACM SIGPLAN Notices (2007)

The run-time performance of VLIW (very long instruction word) microprocessors depends heavily on the effectiveness of its associated optimizing compiler. Typical VLIW compiler phases include instruction scheduling, which maximizes instruction level parallelism (ILP), and register allocation, which minimizes data spills to external memory. If ILP is maximized without considering register constraints, high register pressure may result, leading to increased spill code and reduced run-time performance. In this paper, a new register pressure reduction technique for embedded VLIW processors is presented to control register pressure prior to instruction scheduling and register allocation. By modifying the relative ordering of operations, this technique restructures code to better reduce spills. Our technique has been implemented in Trimaran, an academic VLIW compiler, and evaluated using a series of VLIW benchmarks. Experimental results show that, on average, our algorithm reduces dynamic spills and improves overall cycle counts by 6% for a VLIW architecture with 8 functional units and 32 registers versus previous spill code reduction techniques.
Adaptive, optimal-recovery image interpolation
Authors: D. D. Muresan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

We consider the problem of image interpolation using adaptive optimal recovery. We adaptively estimate the local quadratic signal class of our image pixels. We then use optimal recovery to estimate the missing local samples based on this quadratic signal class. This approach tends to preserve edges, interpolating along edges and not across them.
Online Monitoring of Database Structural Deterioration
Authors: Takashi Hoshino, Kazuo Goda, Masaru Kitsuregawa
Venue: Proceedings of the Fourth International Conference on Autonomic Computing (2007)

The paper proposes a structural deterioration monitor of database, which is an essential building block to realize an autonomic database reorganizer. Experimental results with our prototype show that the monitor can keep track of structural deterioration with high resolution, high accuracy, and low overhead.
A Proposal of a High Definition Haptic Rendering for Stability and Fidelity
Authors: Katsuhito Akahane, Shoichi Hasegawa, Yasuharu Koike, Makoto Sato
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

In this paper, we propose a 10kHz high definition haptic rendering which can display on real-time video-rate (60Hz) in general VR applications. Our proposal requires both fidelity and stability in the multi-rate system, which the frequency ratio approximates at 160 times. For satisfying two criteria, there are some problems to be resolved. In the view of getting only stability, we can use a virtual coupling method to link a haptic display and a virtual object. Due to low its coupling impedance, this method isn't good for realization of fidelity and quality of manipulation. Therefore, we have developed a multi-rate system with two level upsampling for both fidelity and stability of haptic sensation. The first level up-sampling achieves stability with the virtual coupling, and the second level achieves fidelity with 10kHz haptic rendering to compensate the haptic quality lost from the coupling process. We confirmed that our proposed system could achieve both the stability and fidelity of haptic rendering through a computer simulation and a 6DOF haptic interface (SPIDAR-G) with a rigid object simulation engine.
A Generic Time Hierarchy with One Bit of Advice
Authors: Dieter Melkebeek, Konstantin Pervyshev
Venue: Computational Complexity (2007)

We show that for any reasonable semantic model of computation and for any positive integer a and rationals 1 ¿ c < d, there exists a language computable in time n d with a bits of advice but not in time n c with a bits of advice. Our result implies the first such hierarchy theorem for randomized machines with zero-sided error, quantum machines with one- or zero-sided error, unambiguous machines, symmetric alternation, Arthur.Merlin games of any signature, etc. Our argument yields considerably simpler proofs of known hierarchy theorems with one bit of advice for randomized and quantum machines with two-sided error.Our paradigm also allows us to derive stronger separation results in which the machine with the smaller running time can receive more advice than the one with the larger running time. We present a unified way to derive such results for randomized and quantum machines with two-sided error and for randomized machines with one-sided error.
A stable fast affine projection adaptation algorithm suitable for low-cost processors
Authors: Heping Ding
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

The fast affine projection (FAP) adaptation algorithm possesses a superior convergence property, but most of its implementations so far suffer from instability resulting from error propagation and accumulation in a matrix inversion process. A stable yet simple FAP algorithm is proposed, where the matrix inversion is performed based on an optimization scheme in the field of non-linear programming. Proven to be stable and immune to numerical errors, the new algorithm is suitable for a wide range of voice applications.
Issues in Testing Dependable Event-Based Systems at a Systems Integration Company
Authors: Armin Beer, Matthias Heindl
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Testing of dependable event-based systems is very important to ensure that all requirements (including nonfunctional requirements such as reliability, availability, safety and security) are met and the relevant standards are considered. Siemens Program and Systems Engineering is a company that builds dependable event-based systems in multiple domains. A special unit at PSE, the Support Center Test, focuses on testing issues. In this paper we provide an overview of the state-of-thepractice in testing dependable event-based systems and identify the challenges that have to be addressed in the future. We illustrate our findings by two case studies, one for a transportation system and one for telecommunications. The top three topics for improvement are: testability and requirements tracing, generation of test cases, and verification and validation.
Small Fan-in Floating-Gate Circuits with Application to an Improved Adder Structure
Authors: Jon Alfredsson, Snorre Aunet, Bengt Oelmann
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

For digital circuits with ultra-low power consumption, floating- gate circuits (FGMOS) have been considered to be a potentially better technique than standard static CMOS circuits. One reason for this is because FGMOS only requires a few transistors per gate while it still can have a large fan-in. When power supply is reduced to subthreshold region it will influence the maximum fan-in that is possible to use in designs. In this paper we have investigated how the performance of FGMOS circuits will change in subthreshold region. Simulation in a 120 nm process technology shows that FGMOS will not be working for circuits that have a large fan-in and might not be useable for many designs. At 250 mV power supply it can have a maximum fan-in of 5 and for 150 mV the maximum is 3. FGMOS simulations of an improved full-adder structure with fan-in of 3 is also proposed and compared to a conventional structure with fan-in of 5. It is shown that the improved full-adder with fan-in 3 will have more than 36 times better energy-delay product (EDP).
Automatic precompiled headers: speeding up C++ application build times
Authors: Tara Krishnaswamy
Venue: Proceedings of the 1st conference on Industrial Experiences with Systems Software - Volume 1 (2000)

This paper describes the crucial design and implementation issues that arise in building a fully automatic precompiled header mechanism for compiling industrial-strength C and C++ applications. The key challenges include designing the Makefile-transparent automation, determining the precompileable region, capturing the compile environment and verifying it and addressing the correctness issues involved in using precompiled headers. The ensuing discussion treats the internals of the actual dumping and loading of precompiled headers as a black-box beyond a brief high-level description. An automatic precompiled header mechanism has been implemented in aCC, the HP ANSI C++ compiler, and the results of compiling real applications show that it achieves significant speedup in compile-times of real applications.
Blind channel identification using RLS method based on second-order statistics
Authors: T. Kimura
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

In this paper, we show a new blind identification algorithm which is based on second order statistics and exploits a single-input double-output (SIDO) model. It is suitable for a real-time processing system because of lower operation and high-speed convergence. The proposed blind identification algorithm is superior to conventional algorithms in view of simple structure and the uniqueness of solution. We also verify its efficiency by computer simulation.