ppxscal/embedding_network huggingface dataset:
Learning and Approximation of Chaotic Time Series Using Wavelet-Networks
Authors: V. Alarcon-Aquino, E. S. Garcia-Trevino, R. Rosas-Romero, J. F. Ramirez-Cruz
Venue: Proceedings of the Sixth Mexican International Conference on Computer Science (2005)

This paper presents a wavelet neural-network for learning and approximation pf chaotic time series. Wavelet networks are a class of neural network that take advantage of good localization and approximation properties of multiresolution analysis. These networks use wavelets as activation fynction in the hidden layer and a hierarchical method is used for learning. Comparisons are made between a wavelet network tested with two different wavelets, and the typical feedforward network trained with the back-propagation algorithm. The results reported in this paper show that wavelet networks have better approximation properties than back-propagation networks.
The ultimate Linux lunchbox
Authors: Ron Minnich
Venue: Linux Journal (2005)

It fits under an airplane seat and uses a laptop power supply. No, not a laptop-a 16-node Beowulf cluster in a box.
Bounding Supply Noise Induced Path Delay Variation Using a Relaxation Approach
Authors: Baohua Wang, Pinaki Mazumder
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

This paper presents a general ILP model for analyzing the supply noise induced worst path delay variation. The proposed model can address various modes of supply noise analysis: function based, two-vector pattern based, or multiple cycle analysis, additionally capable of including user-specified constraints. The formulated ILP problem is solved via a relaxation approach, which produces a conservative upper-bound estimation to the worst path delay variation at any iteration. The paper applies sub-gradient optimization to improve those upper bounds. Experimentations have demonstrated the efficiency of the proposed approach, by comparisons with a commercial ILP solver and traditional supply noise modeling approaches.
A Polarized Head-Mounted Projective Display
Authors: Hong Hua, Chunyu Gao
Venue: Proceedings of the 4th IEEE/ACM International Symposium on Mixed and Augmented Reality (2005)

The lack of image brightness is a common problem in optical see-through head-mounted displays (OST-HMD) where a beamsplitter is required to combine views from HMD image source and the direct-view of a real world scene. This problem is further aggregated in a head-mounted projective display (HMPD) due to the fact that light passes through the beamsplitter multiple times. In this paper, we present a novel design of an ultra-bright polarized head-mounted projective display (p-HMPD). The image brightness observed by a viewer theoretically is four-times brighter than existing designs. We further demonstrate a design with currently available technology that leads to a display in which the observed image is significantly brighter than existing designs. Finally, experimental results from a bench setup are presented.
Experimenting with Real Time Applications in an IEEE 802.11b Ad Hoc Network
Authors: Thanasis Karapantelakis, Giorgos Iacovidis
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

In this study we set up an ad-hoc testbed of heterogeneous devices and investigate the behavior of video and audio streaming over the TCP protocol. The metrics for measuring the quality of service (QoS) of the TCP flows, are TCP round trip time (RTT) and signal to noise ratio (SNR). Our findings indicate an inverse correlation between RTT and SNR, with the first value increasing exponentially after a lower SNR threshold. Device movement and large distances are two factors affecting RTT negatively. Finally we show that the impact of background traffic on these streaming applications is prominent, as it increases RTT significantly.
Incentive Problem for Ad Hoc Networks Scalability
Authors: Jose Costa-Requena, Raimo Kantola, Nicklas Beijar
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

Ad Hoc networks still have unsolved fundamental problems such as scalability, security and QoS. Ad hoc networks have to compete with existing wireless technologies that already provide networking capabilities with low cost. The main driver for Ad hoc networks is to have a zero-cost and self-created IP network. We consider scalability as the main inconvenince for future deployment of Ad hoc networks. In this paper we analyse the scalability in a real testbed and we propose a simple and novel solution based on relay nodes. The relay nodes require consuming additional resources that users may not be willing to support. We use Game Theory to demostrate that users will cooperate if a rewarding mechanism is implemented. Therefore, the proposed solution for scalable Ad hoc networks requires a tight interaction between routing and MAC layer to enforce the rewarding mechanism. A new node architecture different from the OSI layering structure is required.
Analyse empirique de l'inter-utilisabilit&eacute; d'un service multisupport Web et t&eacute;l&eacute;phone
Authors: Laurent Karsenty, Valérie Botherel
Venue: Proceedings of the 2nd French-speaking conference on Mobility and ubiquity computing (2005)

This report presents the results of an empirical analysis of a multi-device service which is accessible both from a Web interface on a PC and a spoken interface over a telephone. The objective of this study was to deepen our understanding of inter-usability issues related to multi-device services. Inter-usability is defined as the easiness with which users transfer and adapt the knowledge they have acquired from previous uses of their service while they access it with a new device. The results of this study, obtained from a sample of 20 users achieving a series of use scenarios, highlights the need to keep data, functions and use procedures as consistent as possible between the various devices but reveals, at the same time, inter-device inconsistencies that are not detrimental to the dialogue quality and even, in some cases, desirable. These results stress the relevance of user's activity analysis in designing multi-device services and suggest some basic principles that may drive their design.
Biometrics hit the mainstream: an analysis of security and privacy implications
Authors: Vance Bjorn
Venue: Proceedings of the 12th ACM conference on Computer and communications security (2005)

Biometric-based user authentication is no longer just the domain of James Bond movies or government installations. Fingerprint sensors, in particular, are now showing up standard on notebooks from IBM, HP and Toshiba, and in new line of peripherals from Microsoft. The benefits to the user and organization are clear: unlike passwords or tokens, fingerprints cannot be lost, forgotten, or easily lent to others. The consequence is a reduction in administration costs, improvement in audit logs for compliance, and the prospect of heightened security by reducing reliance on each user to adhere to security policy. However, the potential weaknesses are also well known, such as reversible templates, gummy fingers, storage of secrets, and central databases. Since no single security approach is a magic bullet, the strengths and weaknesses of biometric authentication must be considered in light of the threats in a given environment. This talk will survey the current state of the art of biometric authentication algorithms, readers and security architectures used for network security with a critical analysis of the security and privacy considerations. 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
Counting Monomials
Authors: Mordechai Katzman
Venue: Journal of Algebraic Combinatorics: An International Journal (2005)

This paper presents two enumeration techniques based on Hilbert functions. The paper illustrates these techniques by solving two chessboard problems.
A Prototype of a Secure Autonomous Bootstrap Mechanism for Control Networks
Authors: Nobuo Okabe, Shoichi Sakane, Masahiro Ishiyama, Atsushi Inoue, Hiroshi Esaki
Venue: Proceedings of the International Symposium on Applications on Internet (2006)

There are many kinds of control networks, which have been used in various non-IP network areas, such as BA (Building Automation), FA (Factory Automation) and PA (Process Automation). They are introducing IP and face the issues of security and configuration complexity. The authors have proposed a model which intends to solve the issues while satisfying restrictions, i.e. small embedded devices, isolated networks and private naming system/name space, which are required when introducing new functionality into existing control networks. Secure bootstrap sequence and device-to-device communication using the chain of trust are the points of the model. This paper shows the practicability of the model through implementing the model experimentally.
S&ucirc;ret&eacute; de fonctionnement d'applications nomades construites par assemblage de composants
Authors: Audrey Occello, Anne-Marie Dery-Pinna
Venue: Proceedings of the 2nd French-speaking conference on Mobility and ubiquity computing (2005)

Mobile handheld devices allow mobile users to use application services without taking care of their position. In this context, mobile applications must cope with service continuity during network disconnections. On the other hand, component platforms provide mechanisms to adapt applications by modifying component assemblies and to control these adaptations dynamically. However, these platforms are dedicated to traditional environments and do not take into account assembly breaks resulting from disconnections. In this paper, we propose to handle disconnections as assembly adaptations in order to determine whether work around components are useful. We extend the Satin model, created to control component assembly adaptations, so as to control nomad component disconnections.
Approximation of Hyperbolic Models for Chemosensitive Movement
Authors: Francis Filbet, Chi-Wang Shu
Venue: SIAM Journal on Scientific Computing (2005)

Numerical methods with different orders of accuracy are proposed to approximate hyperbolic models for chemosensitive movements. On the one hand, first- and second-order well-balanced finite volume schemes are presented. This approach provides exact conservation of the steady state solutions. On the other hand, a high-order finite difference weighted essentially nonoscillatory (WENO) scheme is constructed and the well-balanced reconstruction is adapted to this scheme to exactly preserve steady states and to retain high-order accuracy. Numerical simulations are performed to verify accuracy and the well-balanced property of the proposed schemes and to observe the formation of networks in the hyperbolic models similar to those observed in the experiments.
Adaptive resolution of 1D mechanical B-spline
Authors: Julien Lenoir, Laurent Grisoni, Christophe Chaillou, Philippe Meseure
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

This article presents an adaptive approach to B-spline curve physical simulation. We combine geometric refinement and coarsening techniques with an appropriate continuous mechanical model. We thus deal with the (temporal and geometric) continuity issues implied when mechanical adaptive resolution is used. To achieve real-time local adaptation of spline curves, some criteria and optimizations are shown. Among application examples, real-time knot tying is presented, and curve cutting is also pointed out as a nice side-effect of the adaptive resolution animation framework.
Cooperation model of a multiagent parallel file system for clusters
Authors: M. S. Perez, A. Sanchez, V. Robles, J. M. Pena, J. Abawajy
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

MAPFS is a parallel file system integrated with a multiagent system responsible for the information retrieval. One of the fields where the agents can be very useful is precisely in the development of information recovery systems. The usage of a multiagent system implies coordination among the agents that belong to such system. The main goal of the agent cooperation is the interaction among them for achieving a common objective in a distributed system. Thus, a communication framework must be provided. This paper shows the MAPFS cooperation model and its communication framework, emphasizing its relation with the whole system.
A general framework for probabilistic low-power design space exploration considering process variation
Authors: A. Srivastava, D. Sylvester
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

Increasing levels of process variation in current process technologies make it extremely important that design and process decisions be made while considering their impact. This work presents a convex optimization based approach to select supply and threshold voltages to minimize power dissipation in generic multi-Vdd/Vth CMOS designs while considering process variation. We use this probabilistic approach to compare the optimization of different statistical parameters of power dissipation (e.g., mean or high percentile points), and quantify the impact of rising process variations on these power minimization techniques.
3rd international workshop on traceability in emerging forms of software engineering (TEFSE 2005)
Authors: Jonathan I. Maletic, Giuliano Antoniol, Jane Cleland-Huang, Jane Huffman Hayes
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

Establishing and maintaining traceability links and consistency between software artifacts produced or modified in the software life-cycle are costly and tedious activities that are crucial but frequently neglected in practice. Traceability between the free text documentation associated with the development and maintenance cycle of a software system and its source code are crucial in a number of tasks such as program comprehension, software maintenance, and software verification & validation. Finally, maintaining traceability links between subsequent releases of a software system is important for evaluating relative source code deltas, highlighting effort/code variation inconsistencies, and assessing the change history. The main theme of the workshop is focused on understanding and defining the foundations for consistency and change management of software systems within the scope of artifact-to-artifact (model-to-model) traceability.The workshop will address the following issues:A formal definition of model to model traceabilityTraceability between artifacts and processesThe semantics of traceability linksRecovery of traceability linksVisualization of traceability linksInteroperable approaches to support traceabilityTraceability in emerging forms of software engineering including production lines, frameworks, components, etc..The goals of the workshop are to:Broaden awareness within the software engineering community of the potential for the application of traceabilityFacilitate the exchange of ideas and interaction between international researchersDefine open research problems faced in realizing usable approaches for traceabilityConstruct a foundation of materials for future research on traceability .For more information please visit the workshop web site is: http://re.cs.depaul.edu/tefse05/. The workshop proceedings are available through the ACM digital library.
An Incremental Clustering Scheme for Duplicate Detection in Large Databases
Authors: Eugenio Cesario, Francesco Folino, Giuseppe Manco, Luigi Pontieri
Venue: Proceedings of the 9th International Database Engineering & Application Symposium (2005)

We propose an incremental algorithm for clustering duplicate tuples in large databases, which allows to assign any new tuple t to the cluster containing the database tuples which are most similar to t (and hence are likely to refer to the same real-world entity t is associated with). The core of the approach is a hash-based indexing technique that tends to assign highly similar objects to the same buckets. Empirical evaluation proves that the proposed method allows to gain considerable efficiency improvement over a state-of-art index structure for proximity searches in metric spaces.
Computational learning and data-driven modeling for water resources management and hydrology
Authors: Abedalrazq F. Khalil
Venue:  (2005)

Water scarcity, changing climate, and hydrologic uncertainty present serious challenges for water resources management and hydrologic modeling. Development of surface and groundwater resources, success in harnessing the power of flowing water, mitigation of the effects of floods and droughts, and provision for clean water require models with high predictive capability. Computational learning theory and data-driven modeling techniques are new and rapidly expanding areas of research that examine formal models of induction with the goal of developing efficient learning algorithms. This dissertation introduces new and improved modeling frameworks and systematic guidelines to integrate various forms of available data to provide reliable forecasts for the behavior of hydrologic systems that are important in water resources management. The objective is to advance the concepts of support vector machines, relevance vector machines, and locally weighted projection regression learning algorithms to capture the convoluted physical processes, provide decision-relevant information, model chaotic dynamic systems, and detect drift and novelty in the systems. These learning machines are applied to evaluate their plausibility and utility in diverse water resources-related settings. The models are designed in this dissertation to be parsimonious and robust, and to have the ability to quantitatively describe various aspects of uncertainty in model forecasts. Promising simulation results using real-life case studies show the ability of learning machines to build accurate models with competitive predictive capabilities and hence constitute a valuable means for extracting knowledge and improving modeling techniques.
Traffic matrix tracking using Kalman filters
Authors: Augustin Soule, Kavé Salamatian, Antonio Nucci, Nina Taft
Venue: ACM SIGMETRICS Performance Evaluation Review (2005)

In this work we develop a new approach to monitoring origin-destination flows in a large network. We start by building a state space model for OD flows that is rich enough to fully capture temporal and spatial correlations. We apply a Kalman filter to our linear dynamic system that can be used for both estimation and prediction of traffic matrices. We call our system a traffic matrix tracker due to its lightweight mechanism for temporal updates that enables tracking traffic matrix dynamics at small time scales. Our Kalman filter approach allows us to go beyond traffic matrix estimation in that our single system can also carry out traffic prediction and yield confidence bounds on the estimates, the predictions and the residual error processes. We show that these elements provide key functionalities needed by monitoring systems of the future for carrying out anomaly detection. Using real data collected from a Tier-1 ISP, we validate our model, illustrate that it can achieve low errors, and that our method is adaptive on both short and long timescales.
The hierarchical hair model and sweeping rendering algorithms
Authors: Tao Wang
Venue:  (2002)

Realistic modeling and rendering of human hair is an important and challenging issue in computer graphics. The main difficulty comes from the large number of hairs to be modeled, the fine geometry of individual hairs, and the complex illumination interactions among the hairs. In this thesis, based on a previous cluster hair model, the hierarchical hair model is developed. This model allows the hair design to be performed hierarchically at multiple levels. The main features of the hierarchical hair model include: (1) the concept of multi-level of abstraction, providing a compact and efficient representation for complex hair styles; (2) interactive hair design which is achieved effectively by manipulating hair styles at different levels during the modeling process; (3) the generation of near photo quality hair pictures; and (4) the support of adaptive hair rendering with multiple resolutions. A new paradigm, called the projection-based sweeping algorithm, is developed to render hair images using the hierarchical model. As compared with the previous ray tracing algorithm, the new algorithm offers several significant improvements: (1) it avoids the complex and expensive ray/cluster intersection computation; (2) it eliminates the time-consuming density value evaluations at the sample points along a ray during ray tracing; (3) it allows flexible variation of the density map along the trajectory to enhance the natural appearance of hair; and (4) it allows easy coarse/fine control over the density map for multi-resolution rendering. As a result, the new algorithm significantly improves rendering efficiency and hair image quality. The new paradigm is also applicable to a class of problems in which free-shape slices of a 3D density model are placed in arbitrary orientations without simple ordering. This thesis also introduces the concept of the fuzzy shadow buffer to handle complex shadow interactions among the hairs and with the surrounding environment. Though originally motivated by accurate hair shadow generation, this technique is clearly applicable to other objects of similar natures, such as clouds, fog, grass, forests. In addition, a hair design system, called V-HairStudio; is developed for interactive hair design. This system provides a set of functionalities for interactive manipulation of hair styles at multiple levels.
HLogGP: a new parallel computational model for heterogeneous clusters
Authors: J. L. Bosque, L. P. Perez
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

Heterogeneous clusters claim for new models and algorithms. In this paper a new parallel computational model is presented. The model, based on the LogGP model, has been extended to be able to deal with heterogeneous parallel systems. For that purpose, the LogGP's scalar parameters have been replaced by vector and matrix parameters to take into account the different node's features. The work presented here includes the parameterization of a real cluster which illustrates the impact of node heterogeneity over the model's parameters. Finally, the paper presents some experiments performed in a real heterogeneous cluster that can be used for assessing the method's validity, together with the main conclusions and future work.