ppxscal/embedding_network huggingface dataset:
Analysis of Scheduling Techniques in Distributed Parallel Environments Using Mobile Agents
Authors: Giulianna Marega Marques, Ricardo José Sabatine, Kalinka R. L. J. Castelo Branco
Venue: Proceedings of the Fourth International Conference on Networking and Services (2008)

The proposed mobile agent collects the load index and performs the distributed scheduling considering the behavior of the different kinds of applications. The environments obtained were considered due to the application of parallel processing of using medical images as well as the comparison of their performance time to measure them. The objective of this paper is to offer alternatives of processes scheduling aiming at maximize the use of the machines.
Adaptive Scheduling Mechanisms toward Intelligent Services in Mobile and Wireless RFID Environments
Authors: Ching-Hsien Hsu, Jong Hyuk Park, Chia-Hao Yu
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

With the emergence of wireless RFID technologies, the problem of scheduling transmissions in dynamic RFID systems has been arousing attention. In this paper, we present a method of Two Phase Dynamic Modulation (TPDM), which consists of regional scheduling and hidden terminal scheduling phases, aims to efficiently perform communications between readers and tags in high density and mobile RFID networks. TPDM is a simple mechanism for coordinating simultaneous transmissions among multiple readers and hidden terminals. A significant improvement of this approach is that TPDM can prevent reader collisions by using a distributed self-scheduling scheme. The second advantage of the proposed technique is that TPDM is adaptive in both static and dynamic RFID environments. Experimental results show that the TPDM scheduling techniques provide superior and stable performance in both static and dynamic circumstance, especially in mobile and dense environment. The TPDM is shown to be effective in terms of throughput, system efficiency and easy to implement.
Image and video matting: a survey
Authors: Jue Wang, Michael F. Cohen
Venue: Foundations and Trends® in Computer Graphics and Vision (2007)

Matting refers to the problem of accurate foreground estimation in images and video. It is one of the key techniques in many image editing and film production applications, thus has been extensively studied in the literature. With the recent advances of digital cameras, using matting techniques to create novel composites or facilitate other editing tasks has gained increasing interest from both professionals as well as consumers. Consequently, various matting techniques and systems have been proposed to try to efficiently extract high quality mattes from both still images and video sequences. This survey provides a comprehensive review of existing image and video matting algorithms and systems, with an emphasis on the advanced techniques that have been recently proposed. The first part of the survey is focused on image matting. The fundamental techniques shared by many image matting algorithms, such as color sampling methods and matting affinities, are first analyzed. Image matting techniques are then classified into three categories based on their underlying methodologies, and an objective evaluation is conducted to reveal the advantages and disadvantages of each category. A unique Accuracy vs. Cost analysis is presented as a practical guidance for readers to properly choose matting tools that best fit their specific requirements and constraints. The second part of the survey is focused on video matting. The difficulties and challenges of video matting are first analyzed, and various ways of combining matting algorithms with other video processing techniques for building efficient video matting systems are reviewed. Key contributions, advantages as well as limitations of important systems are summarized. Finally, special matting systems that rely on capturing additional foreground/background information to automate the matting process are discussed. A few interesting directions for future matting research are presented in the conclusion.
On optimizing the selection of business transformation projects
Authors: N. Abe, R. Akkiraju, S. Buckley, M. Ettl, P. Huang, D. Subramanian, F. Tipu
Venue: IBM Systems Journal (2007)

To compete and thrive in a changing business environment, a business can adapt by initiating and successfully carrying out business transformation projects. In this paper we propose a methodology for the optimal selection of such transformational projects. We propose a two-stage methodology based on (1) correlation analytics for identifying key drivers of business performance and (2) advanced portfolio-optimization techniques for selecting optimal business-transformation portfolios in the face of resource constraints, budget constraints, and a rich variety of business rules. We illustrate our methodology through a case study from the electronics industry.
A design and implementation of a stream gateway interface of a home station for media stream transmission in heterogeneous home networks
Authors: Young-Choong Park, Seung-Ok Lim, Kwang-Sun Choi, Kwang-Mo Jung, Sang-won Min
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

Recently, through the development of the computing technologies, there has been the computing paradigm of the new concept, such as the convergence phenomenon among all information devices, ubiquitous and pervasive computing. Also the realization of the home network, which is one of the core solutions of the future computing, has become an important issue. In the paper, we describe technical and service requirements, and the architecture of a large-scale home station which will be the home platform in the next generation. And for the transmission of the media stream such as MPEG-2 TS, DVD, VoD, we design and implement a media stream gateway of a home station and explain the transmission of the media stream by engaging our home station.
Perfectly contractile diamond-free graphs
Authors: Irena Rusu
Venue: Journal of Graph Theory (1999)

Everett et al. [Everett et al., Discr Math, 1997] conjectured that a graph with no odd hole and no stretcher is perfectly contractile, i.e., it can be reduced to a clique by successively contracting even pairs. We show that this conjecture is true for diamond-free graphs, and propose a polynomial algorithm to perform the successive contractions. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 32: 359&ndash;389, 1999
Optimal control of heat conductivity
Authors: L. G. Lelevkina, S. N. Sklyar, O. S. Khlybov
Venue: Automation and Remote Control (2008)

Consideration was given to the problem of optimal control of heat conductivity in the spherical coordinate system under a bounded control action. Proposed was a procedure of numerical solution of this problem based on the Pontryagin method for the distributed-parameter systems, special iterative process, and new difference schemes for the problem of heat conductivity in the spherical coordinate system. Estimates of the iterative process convergence were proved. The proposed difference schemes and the algorithm on the whole are illustrated by numerical calculations of the test problems.
Risk as Dependability Metrics for the Evaluation of Business Solutions: A Model-driven Approach
Authors: Yudistira Asnar, Rocco Moretti, Maurizio Sebastianis, Nicola Zannone
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

The analysis of business solutions is one of critical issues in industry. Risk is one of the most preeminent and accepted metrics for the evaluation of business solutions. Not surprisingly, many research efforts have been devoted to develop risk management frameworks. Among them, Tropos Goal-Risk offers a formal framework for assessing and treating risks on the basis of the likelihood and severity of failures. In this paper, we extend the Tropos Goal-Risk to assess and treat risks by considering the interdependency among actors within an organization. To make the discussion more concrete, we apply the proposed framework for analysis of the risks within manufacturing organizations.
IMPROVING GESTURE RECOGNITION IN THE ARABIC SIGN LANGUAGE USING TEXTURE ANALYSIS
Authors: Omar Al-Jarrah, Faruq A. Al-Omari
Venue: Applied Artificial Intelligence (2007)

Sign language plays a crucial role in communication between people when voices cannot reach them. Deaf people use sign language as their primary method of communication. Hand gestures represent the alphabets of sign languages. For proper inter-communication between hearing and deaf people, a translator becomes of great need. In this paper, a fully automated translator of the gestures representing the alphabets of the Arabic Sign Language (ASL) was developed. A set of 30 ANFIS networks were designed and trained properly to recognize the ASL gestures. The developed system is a visual-based system that does not rely on the use of gloves or visual markings. To this end, the developed system deals with images of bare hands, allowing the user to interact with the system in a natural way. A twin approach that is based on boundary and region properties is utilized to extract a set that recognizes the gesture. The extracted features are translation, scaling, and rotation invariant so as to make the system more flexible. The subtractive clustering algorithm and the least-squares estimator are used to identify the fuzzy inference system, and the training is achieved using the hybrid learning algorithm. Experiments revealed that our system was able to recognize the 30 Arabic manual alphabets with a recognition rate of 100% when approximately 19 rules are used per ANFIS model, and a recognition rate of 97.5% when approximately 10 rules are used.
Computational high frequency waves through curved interfaces via the Liouville equation and geometric theory of diffraction
Authors: Shi Jin, Dongsheng Yin
Venue: Journal of Computational Physics (2008)

We construct a class of numerical schemes for the Liouville equation of geometric optics coupled with the Geometric Theory of Diffractions to simulate the high frequency linear waves with a discontinuous index of refraction. In this work [S. Jin, X. Wen, A Hamiltonian-preserving scheme for the Liouville equation of geometric optics with partial transmissions and reflections, SIAM J. Numer. Anal. 44 (2006) 1801-1828], a Hamiltonian-preserving scheme for the Liouville equation was constructed to capture partial transmissions and reflections at the interfaces. This scheme is extended by incorporating diffraction terms derived from Geometric Theory of Diffraction into the numerical flux in order to capture diffraction at the interface. We give such a scheme for curved interfaces. This scheme is proved to be positive under a suitable time step constraint. Numerical experiments show that it can capture diffraction phenomena without fully resolving the wave length of the original wave equation.
Multi-armed bandits in metric spaces
Authors: Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of $n$ trials so as to maximize the total payoff of the chosen strategies. While the performance of bandit algorithms with a small finite strategy set is quite well understood, bandit problems with large strategy sets are still a topic of very active investigation, motivated by practical applications such as online auctions and web advertisement. The goal of such research is to identify broad and natural classes of strategy sets and payoff functions which enable the design of efficient solutions. In this work we study a very general setting for the multi-armed bandit problem in which the strategies form a metric space, and the payoff function satisfies a Lipschitz condition with respect to the metric. We refer to this problem as the "Lipschitz MAB problem". We present a complete solution for the multi-armed problem in this setting. That is, for every metric space (L,X) we define an isometry invariant Max Min COV(X) which bounds from below the performance of Lipschitz MAB algorithms for $X$, and we present an algorithm which comes arbitrarily close to meeting this bound. Furthermore, our technique gives even better results for benign payoff functions.
An industrial case study on wearable computing applications
Authors: Michael Lawo, Otthein Herzog, Hendrik Witt
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

Wearable computing means a paradigm shift: instead of working at the computer users are supported by computing systems in their primary tasks. Currently wearable computing is still a technology of niches and in a laboratory stage. However, with wearIT@work a project dedicated to applications was launched by the European Commission (EC IP 004216). The first 30 months of this project are over and industrial demonstrators, evaluations and results are available. In this paper we present results from industrial case studies in two of the four application domains, namely production and maintenance, with a newly designed wearable user interface.
User-centric universal multimedia access in home networks
Authors: Bernhard Reiterer, Cyril Concolato, Janine Lachner, Jean Le Feuvre, Jean-Claude Moissinac, Stefano Lenzi, Stefano Chessa, Enrique Fern&#x00e1;ndez Ferr&#x00e1;, Juan Jos&#x00e9; Gonz&#x00e1;lez Menaya, Hermann Hellwagner
Venue: The Visual Computer: International Journal of Computer Graphics (2008)

Much research is currently being conducted towards Universal Multimedia Access, aiming at removing barriers that arise when multimedia content is to be consumed with more and more heterogeneous devices and over diverse networks. We argue that users should be put at the center of the research work to enable user-centric multimedia access. In this paper we present the requirements for a user-centric multimedia access system in a networked home environment. These requirements are easy access to available content repositories, context awareness, content adaptation and session migration. After showing the limits of state-of-the-art technologies, we present the architecture of a system which allows unified access to the home network content, automatically delivered to rendering devices close to the user, adapted according to the rendering device constraints, and which is also capable of session mobility.
UUTE Home Network for Wireless Health Monitoring
Authors: Sakari Junnila, Irek Defee, Mari Zakrzewski, Antti-Matti Vainio, Jukka Vanhala
Venue: Proceedings of the 2008 International Conference on Biocomputation, Bioinformatics, and Biomedical Technologies (2008)

This paper presents a home sensor network for wireless health monitoring, including a wireless sensor network, client for controlling the sensor network, and a data storage server. A common software and hardware microcontroller-sensor interface was defined to enable joint use of sensor technologies developed in three different projects. IEEE 802.15.4 RF-transceiver based radio-boards and ZigBee network software were designed and built, along with a simple sensor network software on top of the ZigBee stack, to implement the wireless sensor network. Both commercial and custom made sensors have been interfaced to the sensor network. A set-up consisting of four sensors was developed and tested in a real home environment. The architectural overview of the system and main technical design choices are presented.
System Complexity and System Failures
Authors: Brian Randell
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

System complexity is a challenge both with regard to defining and agreeing on basic concepts of system dependability, and to actually achieving such dependability in practice from large computer-based systems. In this talk I will discuss such issues, and give a brief description of some recent work on a new approach to formally modelling and analysing the activity of complex (un)dependable systems. I will end by discussing some likely dependability and security consequences of the overall complexity and chosen architecture of the huge National Programme for IT (NPfIT) that is currently being undertaken by the National Health System in England, and which is claimed to be the world's largest civil IT project.
Effective and scalable software compatibility testing
Authors: Il-Chul Yoon, Alan Sussman, Atif Memon, Adam Porter
Venue: Proceedings of the 2008 international symposium on Software testing and analysis (2008)

Today's software systems are typically composed of multiple components, each with different versions. Software compatibility testing is a quality assurance task aimed at ensuring that multi-component based systems build and/or execute correctly across all their versions' combinations, or configurations. Because there are complex and changing interdependencies between components and their versions, and because there are such a large number of configurations, it is generally infeasible to test all potential configurations. Consequently, in practice, compatibility testing examines only a handful of default or popular configurations to detect problems; as a result costly errors can and do escape to the field. This paper presents a new approach to compatibility testing, called Rachet. We formally model the entire configuration space for software systems and use the model to generate test plans to sample a portion of the space. In this paper, we test all direct dependencies between components and execute the test plan efficiently in parallel. We present empirical results obtained by applying our approach to two large-scale scientific middleware systems. The results show that for these systems Rachet scaled well and discovered incompatibilities between components, and that testing only direct dependences did not compromise test quality.
A Least Grade Page Replacement Algorithm for Web Cache Optimization
Authors: Naizheng Bian, Hao Chen
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Caching is a technique first used by memory management to reduce bus traffic and latency of data access. Web traffic has increased tremendously since the beginning of the 1990s. With the significant increase of web traffic, caching techniques are applied to web caching to reduce network traffic, user-perceived latency, and server load by caching the documents in local proxies. In this paper, we analyzed both advantages and disadvantages of some current web cache replacement algorithms including lowest relative value algorithm, least weighted usage algorithm and Least Unified-Value (LUV) algorithm. Based on our analysis, we proposed a new algorithm, called least Grade Replacement (LGR), which takes recency, frequency, perfect-history, and document size into account for web cache optimization. The optimal recency coefficients were determined by using 2and 4-way set associative caches. The cache size was varied from 32k to 256k in the simulation. The simulation results showed that the new algorithm (LGR) is better than LRU and LFU in terms of Hit Ratio (HR) and Byte Hit Ratio (BHR).
Communication complexity of algebraic computation
Authors: Z.-Q. Luo
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

The authors consider a situation in which two processors P/sub 1/ and P/sub 2/ are to evaluate one or more functions f/sub 1/, . . ., f/sub s/ of two vector variables x and y, under the assumption that processor P/sub 1/ (respectively, P/sub 2/) has access only to the value of x (respectively, y) and the functional form of f/sub 1/, . . ., f/sub s/. They consider a continuous model of communication whereby real-valued messages are transmitted, and they study the minimum number of messages required for the desired computation. Tight lower bounds are established for the following three problems: (1) each f/sub i/ is a rational function and only one-way communication is allowed. (2) The variables x and y are matrices and the processors wish to solve the linear system (x+y)z=b for the unknown z. (3) The processors wish to evaluate a particular root of the polynomial equation Sigma (x/sub i/+y/sub i/)z/sup i/=0, where the sum is from i=0 to n-1.
Thermal Aware Global Routing of VLSI Chips for Enhanced Reliability
Authors: Aseem Gupta, Nikil D. Dutt, Fadi J. Kurdahi, Kamal S. Khouri, Magdy S. Abadir
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

In this paper we propose thermal aware global routing of interconnects which reduces the probability of failure of chips due to interconnect failures. Temperature has a very serious effect on the Mean Time to Failure (MTF) of interconnects because of electromigration. We present TAGORE, a Thermal Aware Global Router. TAGORE achieves a reduction in the probability of failure by routingmore wires in the colder regions of the chip and less wires in the hotter regions of the chip. We observed that TAGORE reduced the number of wires in the hottest region of a chip by up to 19.95% and by an average of 12.29%. This resulted in a decrease in the failure rate by up to 292 failures per million hours of operation. We also perform an analytical examination of the reduction in the probability of interconnect failure and the failure rate. The analysis shows that there is a reduction in the probability of failure of a chip if fewer wires are routed in the hot regions. This approach to reliability improvement does not require any addition of redundant wires or vias.
Hierarchies in transitive closure logic, stratified Datalog and infinitary logic
Authors: E. Gradel
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The authors establish a general hierarchy theorem for quantifier classes in the infinitary logic L/sub infinity omega //sup omega / on finite structures. In particular, it is shown that no infinitary formula with bounded number of universal quantifiers can express the negation of a transitive closure. This implies the solution of several open problems in finite model theory: On finite structures, positive transitive closure logic is not closed under negation. More generally the hierarchy defined by interleaving negation and transitive closure operators is strict. This proves a conjecture of N. Immerman (1987). The authors also separate the expressive power of several extensions of Datalog, giving new insight in the fine structure of stratified Datalog.
Fuzzy multi-objective optimization for network design of integrated e-supply chains
Authors: M. Dotoli, M. P. Fanti, A. M. Mangini
Venue: International Journal of Computer Integrated Manufacturing (2007)

Worldwide competition originated the development of integrated e-supply chains (IESC) that are distributed manufacturing systems integrating international logistics and information technologies with production. This work builds upon an IESC network design methodology previously proposed to select partners in the different IESC stages and the links connecting them. In order to rank the Pareto optimal solutions obtained by such a method, the paper proposes a second level IESC optimization performed using fuzzy logic. Indeed, fuzzy multi-criteria optimization is particularly suitable for choosing, on the basis of the subjective and qualitative knowledge provided by the decision makers, the IESC configuration from the set of Pareto optimal alternatives. Two fuzzification techniques and two different multi-criteria methods are considered. Moreover, a discussion on the different advantages and limitations of the proposed techniques is provided. Finally, the effectiveness of the methodology is illustrated by way of a case study.