ppxscal/embedding_network huggingface dataset:
Parallel and Flexible Multiprocessor System-On-Chip for Adaptive Automotive Applications based on Xilinx MicroBlaze Soft-Cores
Authors: Michael Hubner, Katarina Paulsson, Jurgen Becker
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

Xilinx Virtex FPGAs offer the possibility of dynamic and partial run-time reconfiguration. When designing a system that includes this feature it has to be made sure, that no signal lines cross the border to other reconfigurable regions. The complex modular design flow to generate partial bitstreams and the need of macros for physical interconnection of IP-Cores causes the necessity to investigate in alternatives. This paper describes the design and implementation of a software reconfigurable multiprocessor system, based on Xilinx MicroBlaze softcore processors. A real application in the automotive domain implemented on a Xilinx Virtex-II 3000 FPGA is used to present results.
Resource overbooking and application profiling in shared hosting platforms
Authors: Bhuvan Urgaonkar, Prashant Shenoy, Timothy Roscoe
Venue: Proceedings of the 5th symposium on Operating systems design and implementationDue to copyright restrictions we are not able to make the PDFs for this conference available for downloading (2002)

In this paper, we present techniques for provisioning CPU and network resources in shared hosting platforms running potentially antagonistic third-party applications. The primary contribution of our work is to demonstrate the feasibility and benefits of overbooking resources in shared platforms, to maximize the platform yeld: the revenue generated by the available resources. We do this by first deriving an accurate estimate of application resource needs by profiling applications on dedicated nodes, and then using these profiles to guide the placement of application components onto shared nodes. By overbooking cluster resources in a controlled fashion, our platform can provide performance guarantees to applications even when overbooked, and combine these techniques with commonly used QoS resource allocation mechanisms to provide application isolation and performance guarantees at run-time. When compared to provisioning based on the worst-case, the efficiency (and consequently revenue) benefits from controlled overbooking of resources can be dramatic. Specifically, experiments on our Linux cluster implementation indicate that overbooking resources by as little as 1% can increase the utilization of the cluster by a factor of two, and a 5% overbooking yields a 300--500% improvement, while still providing useful resource guarantees to applications.
An adaptive hierarchical mobile IPv6 using mobility profile: Research Articles
Authors: Seung-Hee Hwang, Bo-Kyung Lee, Youn-Hee Han, Chong-Sun Hwang
Venue: Wireless Communications Mobile Computing (2004)

The Hierarchical Mobile IPv6 (HMIPv6), which is based on the Mobile IPv6 (MIPv6), has been proposed by IETF to reduce registration control signaling. It separates micro-mobility from macro-mobility with the help of an intermediate mobility agent, called the mobility anchor point (MAP), and exploits a Mobile Node's (MN's) spatial locality. However, all packets from a Correspondent Node (CN) to an MN are delivered through the MAP. That causes delay in packets delivery and the congestion of packets in the MAP so that it results in deterioration of network capability. To alleviate these problems, we propose a Hierarchical Mobile IPv6 protocol using not only spatial locality but also temporal locality. We introduce a profile for management of these locality information. According to the information in the profile, some packets are directly delivered to an MN, if MN seems to reside for a long time in the current subnet. Also, we introduce a handover scheme with the help of an L2 trigger, so that the proposed scheme takes nearly the same handover delay time as HMIPv6. The other contribution of this paper is to suggest a mathematical modeling and analysis of network traffic costs, MAP processing costs and handover latency for both HMIPv6 and the proposed scheme. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Wireless Video Graphics Array System Design
Authors: Adam Sampson, Zhizhang (David) Chen
Venue: Proceedings of the 3rd Annual Communication Networks and Services Research Conference (2005)

A novel system design to accommodate wireless computer video (WVGA) is presented. A simple, yet efficient variable threshold frame differencing scheme is developed in this paper that allows lossless computer video compression ratioýs up to 100%, depending on what occurs on the screen. Using this scheme, only the differences between frames are sent through the channel. The compressed video stream still requires a very high speed wireless link. A 360 Mbps wireless OFDM link is simulated to cover a distance of 6m in an indoor environment. The high bit rate comes at the expense of using 1/2 of the unlicensed band from 5.15 - 5.35 GHz (Lower UNII band) per user. There is a resulting user count of 2 per 6 meter cell. However, the data rate allows a user to play full screen video files. The scheme can be modified to accommodate a higher density network of users who spend a lot of time surfing the internet or word processing and who are not interested in viewing full screen video files all of the time.
Detection of Multi-Part Objects by Top-Down Perceptual Grouping
Authors: Veneree Randrianarisoa, Jean-Francois Bernier, Robert Bergevin
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

In this paper, a top-down approach based on perceptual grouping is proposed for multi-part objects detection. The abstract conceptual category of multi-part objects is formalized by a set of global criteria. These criteria will enable the evaluation of the segmentation quality in order to determine if the whole grouping is perceptually significant and if it has a good perceptual shape. A new cognitive vision methodology, called SAFE (Subjectivity And Formalism Explicitly), is presented. Its goal is to help identify the proper global criteria and to validate the judgment derived from formal calculations of these criteria by human judgment.
Smooth planar r-splines of degree 2r
Authors: Ştefan O. Tohaneanu
Venue: Journal of Approximation Theory (2005)

Alfeld and Schumaker [Numer. Math. 57 (1990) 651-661] give a for mula for the dimension of the space of piecewise polynomial functions (splines) of degree d and smoothness r on a generic triangulation of a planar simplicial complex Δ (for d ≥ 3r+1) and any triangulation (for d ≥ 3r+2). In Schenck and Stiller [Manuscripta Math. 107 (2002) 43-58], it was conjectured that the Alfeld-Schumaker formula actually holds for all d ≥ 2r+1. In this note, we show that this is the best result possible; in particular, there exists a simplicial complex Δ such that for any r, the dimension of the spline space in degree d =2r is not given by the formula of Alfeld and Schumaker [Numer. Math. 57 (1990) 651-661]. The proof relies on the explicit computation of the nonvanishing of the first local cohomology module described in Schenck and Stillman [J. Pure Appl. Algebra 117 & 118 (1997) 535-548].
Reduced-Complexity Iterative Multiuser Detection for DS-CDMA
Authors: J. Y. Pan, C. B. Soh, E. Gunawan
Venue: Wireless Personal Communications: An International Journal (2004)

A reduced-complexity iterative multiuser detection scheme is proposed. The scheme involves a simple way of choosing only K + 1 user bit vectors instead of the full-complexity 2K for the likelihood computation, thus reducing the complexity to O(K). An alternative, reduced computation method of increasing this list of vectors after each iteration is also presented. Simulations over AWGN, imperfect power control and multipath conditions demonstrate that the performance of the proposed reduced-complexity method is close to that of the full-complexity.
The most effective approach for true object-oriented program
Authors: Tanya Cashorali
Venue: Journal of Computing Sciences in Colleges (2005)

The purpose of this project is to display the use of the Design Recipe pedagogy and the idea of focusing on the design of the structure of data, the classes, and class hierarchies, rather than the design of program actions as the core idea for program design. The Design Recipe approach is superior to other programming methods in many ways.
Built-In Self-Test of Molecular Electronics-Based Nanofabrics
Authors: Zhanglei Wang, Krishnendu Chakrabarty
Venue: Proceedings of the 10th IEEE European Symposium on Test (2005)

We propose a built-in self-test (BIST) procedure for nanofabrics based on chemically-assembled electronic nanotechnology. We also present a recovery procedure through which we can identify defect-free nanoblocks and switchblocks in the nanofabric under test. The proposed BIST and recovery procedures are based on the reconfiguration of the nanofabric to achieve complete fault coverage of different types of faults. We show that a large fraction of defect-free blocks can be recovered using a small number of BIST configurations. The proposed BIST procedure is well suited for regular and dense architectures that have high defect densities.
SVR-Based Facial Texture Driving for Realistic Expression Synthesis
Authors: Wenhui Zhu, Yiqiang Chen, Yanfeng Sun, Baocai Yin, Dalong Jiang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

The facial texture variation is the key factor for realistic expression synthesis. It always changed with facial motion under some illumination. In this paper, we propose a realistic facial expression texture driving model based on the support vector regression and MPEG-4. It can learn and recall the regression relationship between facial animation parameters and the parameters of expression ratio image through support vector regression method. First, We can get the parameter set of expression ratio image and the eigenERI space by principle component analysis method, who will generate reasonable ratio image. Then, a life-like facial animation can be synthesized quickly and effectively with the support vector regression mapping. In our experiment, it not only captures subtle changes in the variation illumination, but also can synthesis realistic facial expression in bad environment.
The Downs-Thomson Paradox: Existence, Uniqueness and Stability of User Equilibria
Authors: Heti Afimeimounga, Wiremu Solomon, Ilze Ziedins
Venue: Queueing Systems: Theory and Applications (2005)

Consider a network where two routes are available for users wishing to travel from a source to a destination. On one route (which could be viewed as private transport) service slows as traffic increases. On the other (which could be viewed as public transport) the service frequency increases with demand. The Downs-Thomson paradox occurs when improvements in service produce an overall decline in performance as user equilibria adjust. Using the model proposed by Calvert [10], with a ¿|M|1 queue corresponding to the private transport route, and a bulk-service infinite server queue modelling the public transport route, we give a complete analysis of this system in the setting of probabilistic routing. We obtain the user equilibria (which are not always unique), and determine their stability.
Prediction intelligence in context-aware applications
Authors: Christos Anagnostopoulos, Panagiotis Mpougiouris, Stathes Hadjiefthymiades
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

Mobile applications are required to operate in ubiquitous environments of dynamic nature. Specifically, the availability of resources and services may vary significantly during a typical session of system operation. As a consequence, mobile applications need to be capable of adapting to these changes to ensure the best possible level of service to the user. Therefore, such adaptive applications may have pre-evaluated the appropriate knowledge of their environment to act efficiently. Such knowledge is not known a priori, so information prediction and proactivity should enhance and extend the functionality of such applications in order to be adaptable to the future changes of their underlying computational environment. In this paper, we discuss and evaluate such a context prediction algorithm.
Working Effectively with Legacy Code
Authors: Michael Feathers
Venue:  (2004)

Get more out of your legacy systems: more performance, functionality, reliability, and manageabilityIs your code easy to change? Can you get nearly instantaneous feedback when you do change it? Do you understand it? If the answer to any of these questions is no, you have legacy code, and it is draining time and money away from your development efforts.In this book, Michael Feathers offers start-to-finish strategies for working more effectively with large, untested legacy code bases. This book draws on material Michael created for his renowned Object Mentor seminars: techniques Michael has used in mentoring to help hundreds of developers, technical managers, and testers bring their legacy systems under control.The topics covered include Understanding the mechanics of software change: adding features, fixing bugs, improving design, optimizing performance Getting legacy code into a test harness Writing tests that protect you against introducing new problems Techniques that can be used with any language or platform-with examples in Java, C++, C, and C# Accurately identifying where code changes need to be made Coping with legacy systems that aren't object-oriented Handling applications that don't seem to have any structureThis book also includes a catalog of twenty-four dependency-breaking techniques that help you work with program elements in isolation and make safer changes.© Copyright Pearson Education. All rights reserved.
Data structure repair using goal-directed reasoning
Authors: Brian Demsky, Martin Rinard
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Data structure repair is a promising technique for enabling programs to execute successfully in the presence of otherwise fatal data structure corruption errors. Previous research in this field relied on the developer to write a specification to explicitly translate model repairs into concrete data structure repairs, raising the possibility of 1) incorrect translations causing the supposedly repaired concrete data structures to be inconsistent, and 2) repaired models with no corresponding concrete data structure representation.We present a new repair algorithm that uses goal-directed reasoning to automatically translate model repairs into concrete data structure repairs. This new repair algorithm eliminates the possibility of incorrect translations and repaired models with no corresponding representation as concrete data structures.
The role of a project-based capstone course
Authors: Yael Dubinsky, Orit Hazzan
Venue: Proceedings of the 27th international conference on Software engineering (2005)

A project-based capstone course aims at using software development skills while performing a project in the course domain. One of our main challenges is to simulate a real world environment so to provide our students with the experience they need. Planning this experience we should consider academic constraints as well as the students' schedule and skills. In this paper we describe how we implement an agile software development method in a project-based capstone course in the domain of operating systems. We elaborate on how we simulate a real world environment and present a role scheme that is used by the students to manage the process. We suggest a discussion on how to use the role scheme as an assessment tool to measure the development process in general and students' contribution in particular. We expect to extend and refine the comprehension regarding process measurement in students' teams at the academia.
Exploiting mobile code for user-transparent distribution of application-level protocols
Authors: Masakuni Agetsuma, Kenji Kono, Hideya Iwasaki, Takashi Masuda
Venue: Systems and Computers in Japan (2005)

In a wide-area distributed environment such as the Internet, users exchange information by using a common application protocol. Such an application layer protocol forms the basis of information communications, and once it is widely spread, it is difficult to replace the protocol by a new improved or extended protocol. In order to enhance the spreading use of the protocol, the following conditions are necessary: (1) Both the server and clients should be able to use the new protocol. (2) It should be possible to handle the new protocol without modifying the existing client application. (3) The user should be able to handle the new protocol transparently. This paper presents a method in which the above three conditions are satisfied by using a mobile code technique in order to facilitate the spread of a new application layer protocol. In the proposed method, the mobile code that converts the existing protocol to the new protocol is distributed transparently to clients, and the spreading use of the new protocol is realized. By making the mobile code operate within the restrictions of a sandbox, the security of the client computer against defects of the mobile code is improved. The proposed method is independent of the architecture of the distributed mobile code. In this study, the mobile code is implemented in i386 native code. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 36(1): 44&ndash;57, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10603
Motion Space Reduction in a Haptic Model of Violin and Viola Bowing
Authors: Sarah Baillie, Stephen Brewster, Cordelia Hall, John O'Donnell
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

A haptic model of bowing the violin and viola is presented that focuses on just the geometry of the contact point between the bow hair and the string, giving a simplified description that focuses on aspects which the performer thinks about consciously. The model allows artificial constraints on the bow motion to be provided, giving the player physical feedback if one dimension of the contact point becomes incorrect, while allowing full movement in other dimensions.
Numerical identification of parameters for a strongly degenerate convection-diffusion problem modelling centrifugation of flocculated suspensions
Authors: S. Berres, R. Bürger, A. Coronel, M. Sepúlveda
Venue: Applied Numerical Mathematics (2005)

This paper presents the identification of parameters in the flux and diffusion functions for a quasilinear strongly degenerate parabolic equation which models the centrifugation of flocculated suspensions. We consider both a rotating tube and a basket centrifuge at a given angular velocity, and assume that the radius (i.e., the distance to the center of rotation) is the only spatial coordinate. The identification problem is formulated as the problem of minimization of a suitable cost function. Its formal gradient is derived by means of an adjoint equation, which is a backward linear degenerate parabolic equation with discontinuous coefficients. For the numerical approach, the direct problem is discretized by the Engquist-Osher scheme. The discrete Lagrangian formulation provides an associated discrete adjoint state. The conjugate gradient method permits to find numerically the physical parameters. In particular, it allows to identify the critical concentration value at which the model equation changes from second-order parabolic to first-order hyperbolic type. Physically, this critical value is the concentration value at which the solid particles begin to touch each other and determines the change of parabolic to hyperbolic behaviour in the model equation. The new feature compared to the previous treatment of gravity settling in a column of sedimentation is the dependence of the flux function on the space variable.
A New Photo Consistency Test for Voxel Coloring
Authors: Jianfeng Yin, Jeremy R. Cooperstock
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

Volumetric scene reconstruction is an important task for many vision applications. Most voxel coloring or space carving techniques required for this purpose suffer from the coupled problems of visibility and photo consistency. We propose a new photo consistency measurement that implicitly solves the visibility problem, thus permitting an efficient, single-scan voxel inspection that can be parallelized.
A new 6-DOF parallel robotic structure actuated by wires: The WiRo-6.3
Authors: Carlo Ferraresi, Marco Paoloni, Stefano Pastorelli, Francesco Pescarmona
Venue: Journal of Robotic Systems (2004)

This paper describes a novel parallel robotic structure with six degrees of freedom, whose end effector is driven by nine wires operated by motors: the WiRo-6.3. The ideas that led to the conception of the robot are thoroughly discussed and analyzed. The workspace of WiRo-6.3 has been numerically analyzed, and it is significantly larger than the one of other analogous seven-wire structures. The forward and inverse kinematics are both solved in closed form. &copy; 2004 Wiley Periodicals, Inc.
Scene Reconstruction with Sparse Range Information
Authors: Guangyi Chen, Gregory Dudek, Luz A. Torres-Mendez
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

This paper addresses an approach to scene reconstruction by inferring missing range data in a partial range map based on intensity image and sparse initial range data.It is assumed that the initial known range data is given on a number of scan lines one pixel width.This assumption is natural for a range sensor to acquire range data in a 3D real world environment. Both edge information of the intensity image and linear interpolation of the range data are used.Experiments show that this method gives very good results in inferring missing range data.It outperforms both the previous method and bilinear interpolation when a very small percentage of range data is known.
A web-based service for distributed process planning optimization
Authors: W. D. Li
Venue: Computers in Industry (2005)

The advance and pervasive applications of the Web-enabled computations are exerting a profound influence on product design and manufacturing processes, and one of the major technical shifts for product development systems is toward supporting distributed collaboration. A key component for this trend is to develop a service model that enables product development systems to be triggered and manipulated from a remote computer, so as to provide a more flexible manner to share and interoperate the executive codes and processing data. In this paper, a process planning optimization module has been wrapped as a Web-enabled service and deployed in the Internet to support distributed design and manufacturing analysis. The module consists of several optimization approaches, and a Tabu search-based approach, which can optimize the selection of machining resources, determination of set-up plans and sequencing of machining operations to achieve optimal process plans, is elaborated to illustrate the process. The Web-based service has been integrated with a distributed feature-based design system, and the latter can generate design models and re-represent them in an XML representation based on VRML and attributes of features to provide the input of the former. Through effective utilization of the Web and Java technologies, the established service and relevant system can be used by a distributed design team to organize concurrent engineering activities effectively.