ppxscal/embedding_network huggingface dataset:
Optimizing the Wire Layout in Wireless Mesh Network
Authors: Wu Ruizhe, Han Fei, Ren Li
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

In this paper, we aim at the placement of TAPs in Wireless Community Mesh network to minimize the layout cost while guarantee user's demand. We model this problem as Quasi-Group Steiner Tree Problem and give 3 approximation algorithms, which based on Steiner Tree, General Minimum Spanning Tree and overlay specific of this problem respectively. Our simulations show that the algorithm based on overlay specific has the best average performance, i.e. with the shortest length of wire layout in all scenarios that we do in this paper.
Quantization effect on VLSI implementations for the 9/7 DWT filters
Authors: V. Spiliotopoulos
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

Two basic approaches for implementing the 9/7 filtering unit, used in the discrete wavelet transform, are addressed. The first is the lifting scheme approach and the second is the conventional, convolutional filter approach. Two architectures are examined for each approach, a simple straightforward one and an optimized one, substituting the multipliers used for scaling with shift-add operations. The quantization of the constants used in the calculations is thoroughly explored and the selection of the data-path bit-width is addressed. Experimental results based on hardware implementation, for several quantizations and for the different hardware architectures of the 9/7 filtering units are given.
IF estimation of linear FM signals corrupted by multiplicative and additive noise: a time-frequency approach
Authors: B. Barkat
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

This paper presents a time-frequency approach for the estimation of the instantaneous frequency (IF) of a linear frequency modulated (FM) signal affected by multiplicative and additive white Gaussian noise. Contrary to earlier claims, we show that the Wigner-Ville spectrum (WVS) is optimal in the sense of IF localisation for such signals and its peak is proposed as an IF estimator. We derive an analytical expression for the asymptotic variance for this estimator. Simulation results based on Monte-Carlo realisations illustrate and confirm the validity of the theoretical derivations and analysis.
A new fully adaptive algorithm with assured stability for adaptive active noise control
Authors: F. Jiang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

A stability-assured adaptive algorithm of updating the feedforward controller for a general adaptive active noise control system is investigated based on the strictly positive real (SPR) property of a error model. In particular, when there is uncertainly changeable channel dynamics between the control speaker and the objective area and there exists a feedback path from the control speaker to the detection microphone, almost all conventional adaptive algorithms fail to work. Two type of fully adaptive algorithms are proposed which can work in the condition that all the channel dynamics are unknown and changeable, without using any additional microphones and loudspeakers, and without identification of additional models or with assured stability.
Interpolatory Ternary Subdivision for Triangular Meshes with Arbitrary Topology
Authors: Ruotian Liang, Xiaonan Luo, Ren Chen, Wanmin Huang
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

This paper proposes an interpolatory ternary subdivision for triangular meshes that produces C^2 continuous limit surfaces for regular meshes while achieve C^1 continuity with bounded curvature at extraordinary vertices. Prior to this paper, there is no practical interpolatory subdivision scheme which exhibits C^2 continuous for triangular meshes. This subdivision scheme splits each triangle into nine by inserting two E-vertices onto each edge and a F-vertex onto each face. The regular mask is derived from interpolatory ternary subdivision curves and the irregular masks are established based on Fourier transformation. Finally, we demonstrate the visual quality of surfaces refined by our new ternary subdivision scheme with several examples.
A hybrid method for solving multi-objective global optimization problems
Authors: C. Gil, A. Márquez, R. Baños, M. G. Montoya, J. Gómez
Venue: Journal of Global Optimization (2007)

Real optimization problems often involve not one, but multiple objectives, usually in conflict. In single-objective optimization there exists a global optimum, while in the multi-objective case no optimal solution is clearly defined but rather a set of optimums, which constitute the so called Pareto-optimal front. Thus, the goal of multi-objective strategies is to generate a set of non-dominated solutions as an approximation to this front. However, most problems of this kind cannot be solved exactly because they have very large and highly complex search spaces. The objective of this work is to compare the performance of a new hybrid method here proposed, with several well-known multi-objective evolutionary algorithms (MOEA). The main attraction of these methods is the integration of selection and diversity maintenance. Since it is very difficult to describe exactly what a good approximation is in terms of a number of criteria, the performance is quantified with adequate metrics that evaluate the proximity to the global Pareto-front. In addition, this work is also one of the few empirical studies that solves three-objective optimization problems using the concept of global Pareto-optimality.
Next-Generation Software Engineering: Function Extraction for Computation of Software Behavior
Authors: Richard C. Linger, Mark G. Pleszkoch, Luanne Burns, Alan r. Hevner, Gwendolyn H. Walton
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The ultra-large-scale systems of the future require the transformation of software engineering into a computational discipline capable of fast and dependable software development. This paper discusses an emerging next-generation software engineering research area: function extraction (FX) technology for automated computation to the maximum extent possible of the behavior, correctness, and quality attributes of software components and their compositions into systems. An introduction to the mathematical foundations for computation of software behavior is provided, followed by an overview description of a rigorously designed experiment to quantify the potential for FX technology, and a discussion of a CERT STAR*Lab first application of FX technology to compute the behavior of code expressed in the Intel assembly language instruction set.
Architecture-aware taylor shift by 1
Authors: Jeremy R. Johnson, Werner Krandick
Venue:  (2006)

We introduce register tiling for optimizing series of multiprecision additions. Our new tile method for designing an architecture-aware classical Taylor shift by 1 algorithm---a low-level operation important to the monomial bases variant of the Descartes method for polynomial real root isolation---obtains up to 7 tunes faster performance over standard implementations that call the efficient integer addition routines from the GNU Multiple Precision Arithmetic Library [44]. Our tile method for Taylor shift by 1 algorithm requires more word additions but it reduces the number of cycles per word addition by decreasing memory traffic and the number of carry computations. To enable standard compilers to tile the algorithm, we introduce signed digits, suspended normalization, radix reduction, and delayed carry propagation. The performance of our tile method depends on several parameters that can be modeled for and tuned to the underlying architecture. We show how such modeling can guide automatic code generation and automatic experimentation to adapt an algorithm to the underlying architecture for better ILP and pipeline utilization. We automatically generate our tile method for Taylor shift by 1 in a high-level language and tune it to four different processor architectures. The architecture-aware tile method outperforms four asymptotically fast methods up to degree 6000 on the four hardware platforms. We analyze feasibility of constructing high-performance architecture-aware fast methods. Using our register tiling technique, we automatically generate and tune de Castel-jau's algorithm, an operation with similar pattern of additions. The algorithm---"probably the most fundamental computation in the field of curve and surface de sign" (G. Farin [33])---is the main subalgorithm of the Bernstein bases variant of the Descartes method. We obtain similar performance gains. Applying our architecture-aware algorithms, we compare performance of several implementations of the monomial bases and Bernstein bases variants of the Descartes method on four processor architectures and for three classes of input polynomials. All variants have the same asymptotic computing time bound. The comparison shows that the best absolute computing times are obtained on an Opteron processor platform using the Bernstein-bases variant of the Descartes method with register tiling.
A New Security Scheme for Integration of Mobile Agents and Web Services
Authors: Junqi Zhang, Yan Wang, Vijay Varadharajan
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

Web services specification provides an open standard for the distributed service oriented architecture. It is widely used in Internet and pervasive networks supporting wireless mobile devices. A mobile agent is a composition of computer software and data which is able to migrate from one host to another autonomously and continue its execution on the destination host. Mobile agent technology can reduce the bandwidth requirement and tolerate the network faults - able to operate without an active connection between clients and server. Hence, the applications of the combination of mobile agents and web service have been widely investigated in recent years. However, the security issue is still of a major concern. In this paper, we propose a novel agent-based web service security scheme. This scheme provides a new authentication protocol without using the username/ password pair, which is infeasible for mobile agent, and gives an alternative method to current security mechanism without using Certification Authorities (CA) based public key infrastructure. With this scheme, we can simplify the key management and reduce the computation particularly for group-oriented web services.
WebGlimpse: combining browsing and searching
Authors: Udi Manber, Mike Smith, Burra Gopal
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1997)

The two paradigms of searching and browsing are currently almost always used separately. One can either look at the library card catalog, or browse the shelves; one can either search large WWW sites (or the whole web), or browse page by page. In this paper we describe a software tool we developed, called WebGlimpse, that combines the two paradigms. It allows the search to be limited to a neighborhood of the current document. WebGlimpse automatically analyzes collections of web pages and computes those neighborhoods (at indexing time). With WebGlimpse users can browse at will, using the same pages; they can also jump from each page, through a search, to "close-by" pages related to their needs. In a sense, our combined paradigm allows users to browse using hypertext links that are constructed on the fly through a neighborhood search. The design of WebGlimpse concentrated on four goals: fast search, efficient indexing (both in terms of time and space), flexible facilities for defining neighborhoods, and non-wasteful use of Internet resources. Our implementation was geared towards the World-Wide Web, but the general design is applicable to any large-scale information bases. We believe that the concept of combining browsing and searching is very powerful, and deserves much more attention. Further information about WebGlimpse, including the complete source code, documentations, demos, and examples of use, can be found at http://glimpse.cs.arizona.edu/webglimpse/.
Power-aware scheduling for real-time embedded systems
Authors: Gang Quan
Venue:  (2006)

Driven by the remarkable evolution of IC technology and the ever-increasing human appetite for higher computing power, the dramatically increased power/energy consumption for real-time embedded systems has presented a profound challenge to researchers and developers. Battery-operated embedded devices, which have already been ubiquitous, demand low power consumption to extend the battery life and thus the mission cycles. Even for power-rich platforms, rapidly elevated power consumption raised serious concerns regarding the reliability and packaging/cooling cost as a result of the heat dissipation. It is fair to say that energy reduction has become one of the most critical design issues in the design of next generation real-time embedded systems. In our research, we seek to address this problem at the operating system level. Specifically, we believe that real-time scheduling plays a critical role in power/energy reduction not only because most embedded systems have real-time requirements, but also because significant energy savings can be achieved by taking advantage of the knowledge in application characteristics and underlying architectures known at this level. The goal of our research is to study and develop appropriate real-time scheduling techniques that can exploit the advanced power manageable features in state-of-the-art architecture to minimize the power/energy consumption while satisfying other design requirements at the same time. The contributions of the dissertation include: (i) We developed several advanced power-aware scheduling algorithms for hard real-time systems with emphasis on reducing both dynamic and leakage power consumption; (ii) We extended the system model from simple hard real-time systems to soft real-time systems with more complicated Quality of Service constraints; (iii) We also developed efficient scheduling algorithms to minimize the system-wide energy consumption with peripheral devices taken into consideration. Experimental results have demonstrated that our techniques greatly outperform existing ones. The problems discussed in this dissertation are rather general in real-time embedded system designs, and these methodologies and techniques are important both in the theoretical and practical sense.
IBDL: a language for interface behavior specification and testing
Authors: Sreenivasa Viswanadha, Deepak Kapur
Venue: Proceedings of the 4th conference on USENIX Conference on Object-Oriented Technologies and Systems - Volume 4 (1998)

A methodology and language for specifying behaviors of interfaces (a la OMG's IDL, JavaTM, C++, etc.) for object-oriented systems is proposed based on the message-passing paradigm. Signatures of messages are enhanced to include semantic information, expressing behavior clients can expect from a server. Formulas are given to disambiguate normal termination from abnormal termination of a message using the return values and exceptions to reflect whether the pre-condition associated with the message is satisfied or not. State changes caused by a message invocation are specified by explicitly enumerating subsequent messages that a message invocation enables (and/or) disables, by establishing (or violating, respectively) their pre-conditions. Special operators on sequences of messages are defined to specify such semantic information. A specification language IBDL, Interface Behavior Description Language, based on this methodology is developed. As IBDL specifications explicitly capture the interactions between messages, they are ideal for validating implementation behaviors with sequences of messages. We present a scheme for sequence testing by translating IBDL specifications into code.
Formal Verification of Floating-Point Programs
Authors: Sylvie Boldo, Jean-Christophe Filliatre
Venue: Proceedings of the 18th IEEE Symposium on Computer Arithmetic (2007)

This paper introduces a methodology to perform formal verification of floating-point C programs. It extends an existing tool for the verification of C programs, Caduceus, with new annotations specific to floating-point arithmetic. The Caduceus first-order logic model for C programs is extended accordingly. Then verification conditions expressing the correctness of the programs are obtained in the usual way and can be discharged interactively with the Coq proof assistant, using an existing Coq formalization of floatingpoint arithmetic. This methodology is already implemented and has been successfully applied to several short floatingpoint programs, which are presented in this paper.
3D Reconstruction Based on Pseudo-Linearization and Errors-in-Variables Model
Authors: Tingbo Hou, Junwen Wang, Feng Zhu, Zelin Shi
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

This paper proposes a general approach of 3D reconstruction, a major problem arising in computer vision and virtual reality, based on a combination of Pseudo-Linearization and Errors-in-Variables model. The proposed approach concerns a bunch of corrupted measurements under nonlinear constraints, and optimizes the estimation by taking errors into account. Furthermore, we set a synthetic projective model and adopt a standard deviation-expectation criterion to evaluate the performance or our method applied in 3D reconstruction. Also, some test images are picked from an image database to give this method a chance to demonstrate its performance in our experiments. Finally, as a successful application, this method is used in a calibration-free augmented reality system.
Test Selection Criteria for Modal Specifications of Reactive Systems
Authors: Marc Aiguier, Delphine Longuet
Venue: Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (2007)

In the framework of functional testing from algebraic specifications, the strategy of test selection which has been widely and efficiently applied is based on axiom unfolding. In this paper, we propose to extend this selection strategy to a modal formalism used to specify dynamic and reactive systems. Such a work is then a first step to tackle testing of such systems more abstractly than most of the works dealing with what is called conformance testing. We get a higher level of abstraction since our specifications account for what is usually called underspecification, i.e. they do not denote a unique model but a class of models. Hence, the testing process can be applied at every design level. Keywords. Specification-based testing, dynamic specifications, selection criteria, unfolding, proof tree normalisation, exhaustivity, coalgebras.
A virtual logo keyboard for people with motor disabilities
Authors: Stéphane Norte, Fernando Graça Lobo
Venue: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (2007)

In our society, people with motor impairments are often times socially excluded from their environment. This is unfortunate because every human being should have the possibility to obtain the necessary conditions to live a normal life. Although there is technology to assist people with motor impairments, few systems are targeted for programming environments. We have created a system, called Logo Keyboard,to assist people with motor disabilities to program with the Logo programming language. With this special keyboard we can help more people to get involved into computer programming and to develop projects in different areas.
Teacher attitudes and perceptions toward instructional computing in a k--5 math, science and technology school
Authors: William F. Mccomas
Venue:  (2006)

Attitude-behavior theory suggests that the behavioral intention of individuals is a primary predictor of their behavior, and attitudes control behavioral intentions Therefore, to induce teachers to use computers in instruction (behavior), teacher attitudes toward computer use must be gauged. In addition, teacher confidence in applying computers to instruction is another factor predicting the use of computers in instruction. Based on these theoretical assumptions, this study examined the attitudes and confidence of teachers toward computers in a math, science, and technology elementary school as important variables to predict the future behavior of teachers with respect to instructional computing. Results of this study were similar to those found in previous research investigations regarding teacher attitudes and confidence toward instructional computing. The teachers in this study, as reported here, had positive attitudes toward instructional computing but moderate confidence in using computers. There was no difference between the lower and upper elementary grade teachers concerning computer attitudes. The lower grade teachers believed that they were competent in basic computer knowledge and skills such as word processing and web surfing; the upper grade teachers were confident in their ability to apply basic computer knowledge and skills to classroom instruction.Importantly, teacher computer attitudes and confidence levels can change as a result of external factors, such as computer-related training and technical support. The relationship between teachers' computer attitudes and confidence levels was positive and moderate. Hence, the relationship between the two variables was stronger in the lower grade teachers than the upper grade teachers. It was inferred that the upper grade teachers were more experienced in using computers for instruction and therefore recognized that an external factor such as institutional support could influence their attitudes and confidence regarding instructional computing. As a result, the upper grade teachers' belief in the relationship between computer attitudes and confidence might be less strong than that of the lower grade teachers. Finally, the teachers were convinced that well-designed computer-related workshops can improve their computer attitudes and confidence, as well as their computer knowledge and skills.
Vehicle Tracking and Distance Estimation Based on Multiple Image Features
Authors: Yixin Chen, Manohar Das, Devendra Bajpai
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

In this paper, we introduce a vehicle tracking algorithm based on multiple image features to detect and track the front car in a collision avoidance system (CAS) application. The algorithm uses multiple image features, such as corner, edge, gradient, vehicle symmetry property, and image matching technique to robustly detect the vehicle bottom corners and edges, and estimate the vehicle width. Based on the estimated vehicle width, a few pre-selected edge templates are used to match the image edges that allow us to estimate the vehicle height, and also the distance between the front vehicle and the host vehicle. Some experimental results based on real world video images are presented. These seem to indicate that the algorithm is capable of identifying a front vehicle, tracking it, and estimating its distance from the host vehicle.