ppxscal/embedding_network huggingface dataset:
Multi-Bank Main Memory Architecture with Dynamic Voltage Frequency Scaling for System Energy Optimization
Authors: Hanene Ben Fradj, Cecile Belleudy, Michel Auguin
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

Several techniques were developed to reduce processor consumption which was the predominant source of dissipation. However with the technology evolution and the development of new applications that make heavy use of large memory data size, the energy savings obtained by these techniques become limited. In this article we showed that Dynamic Voltage Frequency Scaling technique (DVFS) increases the main memory consumption. A multi-banked memory architecture, having the capability of setting banks in low power modes when they are not accessed, is adopted to reduce the memory consumption. An approach of tasks allocation and banks configuration reducing the memory energy is developed at system level for multi-task and real-time systems. Experimental results show that, when we combined DVFS technique with an efficient multibank architecture and tasks to banks allocation, a system energy saving that reaches 35% is obtained.
Some New Aspects of the Coupon Collector's Problem
Authors: Amy N. Myers, Herbert S. Wilf
Venue: SIAM Review (2006)

We extend the classical coupon collector&apos;s problem to one in which two collectors are simultaneously and independently seeking collections of d coupons. We find, in finite terms, the probability that the two collectors finish at the same trial, and we find, using the methods of Gessel and Viennot, the probability that the game has the following "ballot-like" character: the two collectors are tied with each other for some initial number of steps, and after that the player who first gains the lead remains ahead throughout the game. As a by-product we obtain the evaluation in finite terms of certain infinite series whose coefficients are powers and products of Stirling numbers of the second kind.We study the variant of the original coupon collector&apos;s problem in which a single collector wants to obtain at least h copies of each coupon. Here we give a simpler derivation of results of Newman and Shepp and extend those results. Finally, we obtain the distribution of the number of coupons that have been obtained exactly once ("singletons") at the conclusion of a successful coupon collecting sequence.
Asymptotically minimum variance second-order estimation for complex circular processes
Authors: Jean-Pierre Delmas, Yann Meurisse
Venue: Signal Processing (2006)

This paper addresses asymptotically minimum variance (AMV) of parameter estimators within the class of algorithms based on second-order statistics for estimating parameter of strict-sense stationary complex circular processes. As an application, the estimation of the frequencies of cisoids for mixed spectra time series containing a sum of cisoids and an MA process is considered.
Policy-based BGP control architecture for autonomous routing management
Authors: Osamu Akashi, Kensuke Fukuda, Toshio Hirotsu, Toshiharu Sugawara
Venue: Proceedings of the 2006 SIGCOMM workshop on Internet network management (2006)

Unexpected temporal and spatial changes of inter-AS routing behavior often lead to the necessity of on-demand inter-domain routingadjustment. For resolving this problem, we apply the AISLE framework, which is a multi-agent-based model, to a policy-based routingadjustment system for transit ISPs and their customer ASs. This paper describes the BGP-control architecture called VR (Virtual Router) that can dynamically change forwarding paths considering alternative paths, which are inferred from historical data and confirmed when they are actually applied. VR can control conventional multiple border routers in an AS without any protocol extensions. The policy description, which is interpreted by an agent, enables network operators to define autonomous actions for analyzing network status and adjusting inter-AS routing based on these observed results by issuing requests to VR. Some evaluation results indicate that VR can effectively change routing over BGP data on the actual Internet and some control scenarios based on policy descriptions demonstrate the validity of our basic design framework.
Polynomial Regression with Automated Degree: A Function Approximator for Autonomous Agents
Authors: Daniel Stronger, Peter Stone
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

In order for an autonomous agent to behave robustly in a variety of environments, it must have the ability to learn approximations to many different functions. The function approximator used by such an agent is subject to a number of constraints that may not apply in a traditional supervised learning setting. Many different function approximators exist and are appropriate for different problems. This paper proposes a set of criteria for function approximators for autonomous agents. Additionally, for those problems on which polynomial regression is a candidate technique, the paper presents an enhancement that meets these criteria. In particular, using polynomial regression typically requires a manual choice of the polynomial's degree, trading off between function accuracy and computational and memory efficiency. Polynomial Regression with Automated Degree (PRAD) is a novel function approximation method that uses training data to automatically identify an appropriate degree for the polynomial. PRAD is fully implemented. Empirical tests demonstrate its ability to efficiently and accurately approximate both a wide variety of synthetic functions and real-world data gathered by a mobile robot.
Economic Evaluation Framework of Resource Allocation Methods in Service-Oriented Architectures
Authors: Werner Streitberger, Michael Reinicke, Torsten Eymann, Michele Catalano, Gianfranco Giulioni
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

Economic resource allocation in Application Layer Networks (such as Grids) is critical to allow applications and users to effectively exploit computational and data infrastructures like service-oriented computing as a utility. Thus, the evaluation of resource allocation strategies plays a major part in the selection of a resource allocation method. This paper presents an evaluation framework for resource allocation methods in Application Layer Networks, that aims at supporting both a technical and an economic evaluation. The presented evaluation model shows a layered metrics pyramid with different aggregation levels. Statistical methods are used to describe this pyramid. On top of the pyramid, one single number, the social utility, is able to characterize an economic resource allocation method. This number may serve to compare different resource allocation strategies.
Examining the actual benefits of distributed simulation for supply chain management
Authors: Alexey Artamonov
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Supply chains are not new, but their importance has grown in recent years due to globalisation, tough competition and the increasingly networked nature of business. Simulation has long been applied in production-inventory systems and more recently in supply chain management. Given that supply chains are distributed systems it seems sensible to consider the application of distributed computation to their simulation, as is evident from the number of recent research papers dedicated to distributed supply chain simulation (DSCS). However, attention is seldom paid to the actual advantages of this novel technology and the possible obstacles that must be overcome before real-world applications become commonplace. My research considers the potential drivers which might make this technology attractive and uses a DSCS testbed, implemented in AutoMod, to analyse whether these drivers can be achieved. 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
Automatic element size calculation in quadrilateral finite element models of structural engineering objects
Authors: Alexander Tsvelikh, Olga Axenenko
Venue: Finite Elements in Analysis and Design (2006)

Finite element mesh generators need varieties of input data parameters in order to generate meshes in accordance with user requirements. One of such parameters is a desirable step size, to be set individually on each boundary entity. That parameter directly influences the actual elements' sizes in the vicinity of the boundary. Since a to-be-meshed geometrical domain may contain dozens and hundreds of entities (both boundary and internal), it is highly desirable to set those parameter values automatically, with two goals to be pursued: step sizes must be small enough to make the mesh generation feasible, and at the same time large enough to minimize the final number of elements as much as possible. A similar problem arises around refinement points, where concentrated forces or mechanical constraints are applied. This paper provides detailed description of developed powerful algorithms delivering solutions of those problems in 2D structural engineering models.
Risk Analysis for Oil and Gas Exploration Project
Authors: Jinlan Liu, Yin Bai, Ying Yu
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

In this paper, based on the characteristics of the oil and gas exploration project, the risk analysis method is a systematically studied. Firstly we analyze the shortcomings of existing risk analysis methodologies, set forth the further research direction in this field. Then the influence diagram algorithms are presented based on fuzzy theory. At last, the risks of a certain oil and gas exploration project are analyzed. The procedures and contents to structure and evaluate profit influence diagram are studied in the light of the reality. By means of the practical application, the effectiveness and feasibility of the methods are verified.
Evaluation of Unstructured Overlay Maintenance Protocols under Churn
Authors: R. Baldoni, S. Bonomi, A. Rippa, L. Querzoni, S. Tucci Piergiovanni, A. Virgillito
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

An overlay network is formed on top of - and generally independently from - the underlying physical computer network, by the peers (nodes) of a P2P system. The dynamics of peers is taken into account by devising appropriate overlay maintenance protocols that are able to join and leave peers from the overlay. Due to the need for scaling in the number of nodes, overlay maintenance protocols have been simulated only in environments showing a very restricted behavior with respect to the possible concurrent and interleaved execution of join/leave operations. In this paper we compare two overlay maintenance protocols well suited to unstructured P2P systems, namely SCAMP and Cyclon, in an event-based simulation setting including concurrent and interleaved join and leave operations as well as variable message transfer delay. This simulation setting allows to point out surprising results for both protocols. In particular, under a continuous and concurrent replacement of nodes, permanent partitioning of the overlay arises after a very small number of join/leave operations.
Network community: virtual space for physical bodies
Authors: Karen Ruhleder
Venue: Proceedings of the 1999 conference on Computer support for collaborative learning (1999)

Increasing numbers of on-line venues for learning and engagement are emerging as virtual spaces become more accessible and commonplace. As analysts, we seek ways of talking about these spaces through a common language for understanding their organization and the nature of the interactions within them. This paper draws on a framework presented by Mynatt, et al., (1998) which provides a lens for viewing on-line community as a set of affordances. I apply this framework in a virtual educational setting, and conclude with a discussion of its applicability as a lens through which to analyze virtual community.
Enhanced Kernel-Based Tracking for Monochromatic and Thermographic Video
Authors: Quang Anh Nguyen, Antonio Robles-Kelly, Chunhua Shen
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

In this paper, we present an enhanced kernel-based tracker for monochromatic and thermographic video. The technique presented here employs the image intensity and the Local Binary Pattern (LBP) to construct a two dimensional histogram representative of the grayscale values and the texture of the target under study. With the histogram at hand, we proceed to compute its power density function. The new location of the object is then determined making use of a mean-shift optimisation approach. We illustrate the performance of our method in both, thermographic and monochromatic footages and compare our results to an alternative.
On the Access Pricing Issues of Wireless Mesh Networks
Authors: Ray K. Lam, John C. S. Lui, Dah-Ming Chiu
Venue: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (2006)

This paper studies the use of pricing as an incentive mechanism to encourage private, self-interested nodes to participate in a public wireless mesh network and cooperate in the packet forwarding service. Our focus is on the "economic behavior" of the network nodes the pricing and purchasing strategies of the access point, wireless relaying nodes, and clients. We use a "game theoretic approach" to analyze their interactions from one-hop to multihop network and when the network has an unlimited or limited channel capacity. We show that the access point and relaying wireless nodes will adopt a simple, yet optimal, fixed-rate pricing strategy in a multi-hop network with an unlimited capacity. Yet, the fixed-rate pricing strategy fails to be optimal in the limited capacity case. To this end, we focus on the access point adopting a more practical "fixedrate, non-interrupted service" model and propose an algorithm based on the Markovian decision theory to devise the optimal pricing strategy.
Three receiver structures and their performance analyses for binary signalling in a mixture of Gaussian and /spl alpha/-stable impulsive noises
Authors: S. Ambike, D. Hatzinakos
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

The effects of impulsive noise on the performance of optimal and suboptimal binary receivers are examined. The noise mixture consists of a sum of Gaussian noise and impulsive noise. The impulsive noise is modelled using /spl alpha/-stable processes. The optimal receiver structure is derived using Bayes hypothesis testing and the suboptimal receivers consist of linear and nonlinear structures. The obtained results will be useful in the performance evaluation of digital communication links subject to Gaussian and impulsive noises. Many situations exist in which the performance of systems is affected by a mixture of Gaussian and impulsive noises that could benefit from this analysis (atmospheric noise in radio links, ice cracking in underwater sonar etc.).
Empirical estimates of software availability of deployed systems
Authors: Audris Mockus
Venue: Proceedings of the 2006 ACM/IEEE international symposium on Empirical software engineering (2006)

We consider empirical evaluation of the availability of the deployed software. Evaluation of real systems is more realistic, more accurate, and provides higher level of confidence than simulations, testing, or models. We process and model information gathered from a variety of operational and service support systems to obtain estimates of software reliability and availability. The three principal quantities are the total runtime, the number of outages, and the duration of outages. We consider methods to assess the quality of information in customer support systems, discuss advantages and disadvantages of various sources, consider methods to deal with missing data, and ways to construct bounds on measures that are not directly available. We propose a method to assess empirically software availability and reliability based on information from operational customer support and inventory systems and use a case study of a large communications system to investigate factors affecting software reliability. We find large variations among platforms and releases and find the failure rate to vary over time.
Neural Interaction of the Amygdala with the Prefrontal and Temporal Cortices in the Processing of Facial Expressions as Revealed by fMRI
Authors: Tetsuya Iidaka, Masao Omori, Tetsuhito Murata, Hirotaka Kosaka, Yoshiharu Yonekura, Tomohisa Okada, Norihiro Sadato
Venue: Journal of Cognitive Neuroscience (2001)

Some involvement of the human amygdala in the processing of facial expressions has been investigated in neuroimaging studies, although the neural mechanisms underlying motivated or emotional behavior in response to facial stimuli are not yet fully understood. We investigated, using functional magnetic resonance imaging (fMRI) and healthy volunteers, how the amygdala interacts with other cortical regions while subjects are judging the sex of faces with negative, positive, or neutral emotion. The data were analyzed by a subtractive method, then, to clarify possible interaction among regions within the brain, several kinds of analysis (i.e., a correlation analysis, a psychophysiological interaction analysis and a structural equation modeling) were performed. Overall, significant activation was observed in the bilateral fusiform gyrus, medial temporal lobe, prefrontal cortex, and the right parietal lobe during the task. The results of subtraction between the conditions showed that the left amygdala, right orbitofrontal cortex, and temporal cortices were predominantly involved in the processing of the negative expressions. The right angular gyrus was involved in the processing of the positive expressions when the negative condition was subtracted from the positive condition. The correlation analysis showed that activity in the left amygdala positively correlated with activity in the left prefrontal cortex under the negative minus neutral subtraction condition. The psychophysiological interaction revealed that the neural responses in the left amygdala and the right prefrontal cortex underwent the condition-specific changes between the negative and positive face conditions. The right amygdaloid activity also had an interactive effect with activity in the right hippocampus and middle temporal gyrus. These results may suggest that the left and right amygdalae play a differential role in effective processing of facial expressions in collaboration with other cortical or subcortical regions, with the left being related with the bilateral prefrontal cortex, and the right with the right temporal lobe.
Stochastic approximation with simulated annealing as an approach to global discrete-event simulation optimization
Authors: Matthew H. Jones, K. Preston White,  Jr.
Venue: Proceedings of the 36th conference on Winter simulation (2004)

This paper explores an approach to global, stochastic, simulation optimization which combines stochastic approximation (SA) with simulated annealing (SAN). SA directs a search of the response surface efficiently, using a conservative number of simulation replications to approximate the local gradient of a probabilistic loss function. SAN adds a random component to the SA search, needed to escape local optima and forestall premature termination. Using a limited set of simple test problems, we compare the performance of SA/SAN with the commercial package OptQuest. Results demonstrate that SA/SAN can outperform OptQuest when properly tuned. The practical difficulty lies in specifying an appropriate set of SA/SAN gain coefficients for a given application. Further results demonstrate that a multi-start approach greatly improves the coverage and robustness of SA/SAN, while also providing insights useful in directing iterative improvement of the gain coefficients before each new start. This preliminary study is sufficiently encouraging to invite further research on SA/SAN.
Statistically Optimal Dynamic Power Management for Streaming Data
Authors: Nathaniel Pettis, Le Cai, Yung-Hsiang Lu
Venue: IEEE Transactions on Computers (2006)

This paper presents a method that uses data buffers to create long periods of idleness to exploit power management. This method considers the power consumed by the buffers and assigns an energy penalty for buffer underflow. Our approach provides analytic formulas for calculating the optimal buffer sizes without subjective or heuristic decisions. We simulate four different hardware configurations with MPEG-1, MPEG-2, and MPEG-4 formats as a case study. Our results indicate that the optimal buffer size varies significantly for different data formats on different hardware. Simulation results indicate that 16 MB buffers are sufficient for MPEG-1, MPEG-2, and MPEG-4 video streams from a microdrive or a network card, but transfers from an IDE disk require buffer sizes ranging from 16 MB to 176 MB, depending on each video's statistical properties.
The design and evaluation of an assistive application for dialysis patients
Authors: Kay H. Connelly
Venue:  (2006)

Medical informatics, broadly defined as the integration of information technology in healthcare, is revolutionizing all aspects of medicine from electronic medical record systems to portable systems that assist clinicians with medical decision-making and data entry. The human-computer interface issues in medical informatics are particularly interesting because there are often diverse user groups with different requirements for the same application (i.e., clinicians and patients). In this dissertation, I present studies that inform the design of the Dietary Intake Monitoring Application (DIMA), a patient-centered application designed to assist dialysis patients in monitoring their dietary needs. Dialysis patients who do not comply with their dietary restrictions run the risk of undergoing additional emergency dialysis, hypertension, pulmonary edema, and death. Currently, patients try to remember their fluid and sodium consumption or record it in a food diary. However, these techniques fail in 80% of dialysis patients. We provide patients with a personal digital assistant application to record their fluid and sodium intake. The varying levels of patient literacy and computing skills present a challenge for the design of DIMA. Furthermore, evaluating DIMA is a challenge because user studies must be conducted in dialysis wards, which are small, stressful, prohibit audio/video recordings, and change rapidly without warning. This dissertation presents methods to make patients more comfortable using DIMA in their everyday lives, a framework for usability studies in non-traditional environments, and interface design guidelines for people with varying literacy skills.