ppxscal/embedding_network huggingface dataset:
A linear approximation method for the Shapley value
Authors: Shaheen S. Fatima, Michael Wooldridge, Nicholas R. Jennings
Venue: Artificial Intelligence (2008)

The Shapley value is a key solution concept for coalitional games in general and voting games in particular. Its main advantage is that it provides a unique and fair solution, but its main drawback is the complexity of computing it (e.g., for voting games this complexity is #p-complete). However, given the importance of the Shapley value and voting games, a number of approximation methods have been developed to overcome this complexity. Among these, Owen's multi-linear extension method is the most time efficient, being linear in the number of players. Now, in addition to speed, the other key criterion for an approximation algorithm is its approximation error. On this dimension, the multi-linear extension method is less impressive. Against this background, this paper presents a new approximation algorithm, based on randomization, for computing the Shapley value of voting games. This method has time complexity linear in the number of players, but has an approximation error that is, on average, lower than Owen's. In addition to this comparative study, we empirically evaluate the error for our method and show how the different parameters of the voting game affect it. Specifically, we show the following effects. First, as the number of players in a voting game increases, the average percentage error decreases. Second, as the quota increases, the average percentage error decreases. Third, the error is different for players with different weights; players with weight closer to the mean weight have a lower error than those with weight further away. We then extend our approximation to the more general k-majority voting games and show that, for n players, the method has time complexity O(k^2n) and the upper bound on its approximation error is O(k^2/n).
Improving quality-of-service of file migration policies in high-performance servers
Authors: Nathaniel Pettis, Yung-Hsiang Lu
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

Previous work demonstrates that migrating files between disks may induce idleness in servers and facilitate power management. However, these studies focus on steady-state power savings and do not consider the energy consumption and performance overhead of migrating files between disks. In this study, we construct a constrained optimization problem of file location for high-bandwidth applications by considering file migration energy, as well as steady-state energy consumption. We present an algorithm that improves quality-of-service by 63% for a streaming video server compared with existing techniques while maintaining comparable energy savings.
Real-time modeling and rendering of raining scenes
Authors: Wang Changbo, Zhangye Wang, Xin Zhang, Lei Huang, Zhiliang Yang, Qunsheng Peng
Venue: The Visual Computer: International Journal of Computer Graphics (2008)

Real-time modeling and rendering of a realistic raining scene is a challenging task. This is because the visual effects of raining involve complex physical mechanisms, reflecting the physical, optical and statistical characteristics of raindrops, etc. In this paper, we propose a set of new methods to model the raining scene according to these physical mechanisms. Firstly, by adhering to the physical characteristic of raindrops, we model the shapes, movements and intensity of raindrops in different situations. Then, based on the principle of human vision persistence, we develop a new model to calculate the shapes and appearances of rain streaks. To render the foggy effect in a raining scene, we present a statistically based multi-particles scattering model exploiting the particle distribution coherence along each viewing ray. By decomposing the conventional equations of single scattering of non-isotropic light into two parts with the physical parameter independent part precalculated, we are able to render the respective scattering effect in real time. We also realize diffraction of lamps, wet ground, the ripples on puddles in the raining scene, as well as the beautiful rainbow. By incorporating GPU acceleration, our approach permits real-time walkthrough of various raining scenes with average 20&#x00a0;fps rendering speed and the results are quite satisfactory.
Study of Cluster-Based Data Forwarding in Sensor Networks with Limited High-Power Mobile Nodes
Authors: Yen-Wen Chen, Hwa-Chun Ma, I-Hsuan Peng, Ta-En Chang
Venue: Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks (2008)

The wireless sensor network composes of sensors with limited battery power. And, consequently, to save sensor's energy effectively so as to extend the lifetime of the sensor network is one of important issues for the network deployment. In this article, we assume that limited sense nodes are equipped with high power and moving capabilities in the cluster based sensor network. The main objective of these high power nodes is to support the cluster header, which is going to exhaust its power, for data forwarding. The power consumption required for the movement is much larger than that of data forwarding. If the mobile node moves frequently, it will exhaust its power shortly. In this paper, a novel approach is proposed to effectively guide the movement of the high power nodes by considering the above issues. The simulation results show that the proposed approach can balance the sensor energy and extend the network lifetime when compared to the LEACH-C scheme for the same network environment.
Effective Pruning Strategies for Sequential Pattern Mining
Authors: Xu Yusheng, Ma Zhixin, Li Lian, Tharam S. Dillon
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

space of frequent sequence mining and present two novel pruning strategies, SEP (Sequence Extension Pruning) and IEP (Item Extension Pruning), which can be used in all Apriori-like sequence mining algorithms or lattice-theoretic approaches. With a little more memory overhead, proposed pruning strategies can prune invalidated search space and decrease the total cost of frequency counting effectively. For effectiveness testing reason, we optimize SPAM [2] and present the improved algorithm, SP AMSEPIEP, which uses SEP and IEP to prune the search space by sharing the frequent 2sequences lists. A set of comprehensive performance experiments study shows that SP AMSEPIEP outperforms SPAM by a factor of 10 on small datasets and better than 30% to 50% on reasonably large dataset.
Brief paper: Synchronization of bilateral teleoperators with time delay
Authors: Nikhil Chopra, Mark W. Spong, Rogelio Lozano
Venue: Automatica (Journal of IFAC) (2008)

Bilateral teleoperators, designed within the passivity framework using concepts of scattering and two-port network theory, provide robust stability against constant delay in the network and velocity tracking, but cannot guarantee position tracking in general. In this paper we fundamentally extend the passivity-based architecture to guarantee state synchronization of master/slave robots in free motion independent of the constant delay and without using the scattering transformation. We propose a novel adaptive coordination architecture which uses state feedback to define a new passive output for the master and slave robots containing both position and velocity information. A passive coordination control is then developed which uses the new outputs to state synchronize the master and slave robots in free motion. The proposed algorithm also guarantees ultimate boundedness of the master/slave trajectories on contact with a passive environment. Experimental results are also presented to verify the efficacy of the proposed algorithms.
Automorphisms and Distinguishing Numbers of&#x00a0;Geometric Cliques
Authors: Michael O. Albertson, Debra L. Boutin
Venue: Discrete Computational Geometry (2008)

A geometric automorphism is an automorphism of a geometric graph that preserves crossings and noncrossings of edges. We prove two theorems constraining the action of a geometric automorphism on the boundary of the convex hull of a geometric clique. First, any geometric automorphism that fixes the boundary of the convex hull fixes the entire clique. Second, if the boundary of the convex hull contains at least four vertices, then it is invariant under every geometric automorphism. We use these results, and the theory of determining sets, to prove that every geometric n-clique in which n&#x2265;7 and the boundary of the convex hull contains at least four vertices is 2-distinguishable.
Facilitating the Flexible Modeling of Human-Driven Workflow in BPEL
Authors: Wei Shi, Jian Wu, Shaolin Zhou, Ling Zhang, Yuyu Yin, Zhaohui Wu
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

BPEL can automate orchestrations for cross-organizational web services; however, it meets a serious challenge from modeling human-intensive business activities. This paper distinguishes human-driven workflow from automated process, and uses State Machine to model human-driven workflow, then transforms State Machine-style workflow to BPEL process, finally integrates BPEL-style human-driven process with automated process. The goal of our work is to utilize the flexibility and efficiency of State Machine to model complex and dynamic business process, and provides a novel procedure to model human-intensive business activities to complement the limitation of BPEL. This procedure has been implemented in DartFlow – a service composition platform for the sharing of the knowledge and services.
Ontology-based Personalized Wayfinding System Using Deviation Detecting for Individuals with Cognitive Impairments
Authors: Yao-Jen Chang, Tsen-Yung Wang, Yu-Chia Chuang, Shih-Kai Tsai
Venue: Proceedings of the 2007 International Conference on Convergence Information Technology (2007)

According to psychological model of spatial navigation and the requirements of rehabilitation professionals, PDAs prompting with spatial photos at the right time and place can assist cognitively-impaired persons with navigating indoors or on the road. Passive RFID tags which can be imagined as a new traffic sign system, are posted to selected positions on routes. The navigational photos are served on demand to the user who uses the built-in RFID reader to sense the tag when it is in eyesight range. Ontology-based route personalization is proposed to adapt routes with respect to context and changing environment. A tracking function is integrated with a time constrained breadth-first search at the core of deviation detecting algorithm. The tracking system increases the sense of security and also lowers the entry threshold to accepting the assistive technology.
Caching for bursts (C-Burst): let hard disks sleep well and work energetically
Authors: Feng Chen, Xiaodong Zhang
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

High energy consumption has become a critical challenge in all kinds of computer systems. Hardware-supported Dynamic Power Management (DPM) provides a mechanism to save disk energy by transitioning an idle disk to a low-power mode. However, the achievable disk energy saving is mainly dependent on the pattern of I/O requests received at the disk. In particular, for a given number of requests, a bursty disk access pattern serves as a foundation for energy optimization. Aggressive prefetching has been used to increase disk access burstiness and extend disk idle intervals, while caching, a critical component in buffer cache management, has not been paid a specific attention. In the absence of cooperation from caching, the attempt to create bursty disk accesses would often be disturbed due to improper replacement decision made by energy unaware caching policies. In this paper, we present the design of a set of comprehensive energy-aware caching schemes, called C-Burst, and its implementation in Linux kernel 2.6.21. Our caching schemes leverage the 'filtering' effect of buffer cache to effectively reshape the disk access stream to a bursty pattern for energy saving. The experiments under various scenarios show that C-Burst schemes can achieve up to 35% disk energy saving with minimal performance loss.
Forecasting analysis by using fuzzy grey regression model for solving limited time series data
Authors: Ruey-Chyn Tsaur
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2008)

The grey model GM(1,1) is a popular forecasting method when using limited time series data and is successfully applied to management and engineering applications. On the other hand, the reliability and validity of the grey model GM(1,1) have never been discussed. First, without considering other causes when using limited time series data, the forecasting of the grey model GM(1,1) is unreliable, and provide insufficient information to a decision maker. Therefore, for the sake of reliability, the fuzzy set theory was hybridized into the grey model GM(1,1). This resulted in the fuzzy grey regression model, which granulates a concept into a set with membership function, thereby obtaining a possible interval extrapolation. Second, for a newly developed product or a newly developed system, the data collected are limited and rather vague with the result that the grey model GM(1,1) is useless for solving its problem with vague or fuzzy-input values. In this paper the fuzzy grey regression model is verified to show its validity in solving crisp-input data and fuzzy-input data with limited time series data. Finally, two examples for the LCD TV demand are illustrated using the proposed models.
Using wavelet transform on suspended particulate matter (PM10) and meteorological time series
Authors: Mokhtar Shaharuddin, Azami Zaharim, Mohd. Jailani Mohd. Nor, Othman A. Karim, Kamaruzzaman Sopian
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

Malaysia has experienced several haze periods since early 1980s in which suspended particulate matter (SPM) was the major components. The temporal variations observed are the result of interactions of various meteorological variables and pollutants emissions in different time scale. In order to study the relationship between particulate matter, temperature and rainfall, non-decimated wavelet transform is applied to the time series. The low frequency components of the temperature and rainfall showed significant relationship with PM10. The finding also support the suggestion that during the dry season one of the major sources of particles are from outside the country.
Designing packet buffers for router linecards
Authors: Sundar Iyer, Ramana Rao Kompella, Nick McKeown
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

Internet routers and Ethernet switches contain packet buffers to hold packets during times of congestion. Packet buffers are at the heart of every packet switch and router, which have a combined annual market of tens of billions of dollars, and equipment vendors spend hundreds of millions of dollars on memory each year. Designing packet buffers used to be easy: DRAM was cheap, low power and widely used. But something happened at 10 Gb/s when packets started to arrive and depart faster than the access time of a DRAM. Alternative memories were needed, but SRAM is too expensive and power-hungry. A caching solution is appealing, with a hierarchy of SRAM and DRAM, as used by the computer industry. However, in switches and routers it is not acceptable to have a "miss-rate" as it reduces throughput and breaks pipelines. In this paper we describe how to build caches with 100% hit-rate under all conditions, by exploiting the fact that switches and routers always store data in FIFO queues. We describe a number of different ways to do it, with and without pipelining, with static or dynamic allocation of memory. In each case, we prove a lower bound on how big the cache needs to be, and propose an algorithm that meets, or comes close, to the lower bound. These techniques are practical and have been implemented in fast silicon; as a result, we expect the techniques to fundamentally change the way switches and routers use external memory.
TVscreen: Trend Vector Virtual SCREENing of Large Commercial Compounds Collections
Authors: Dariusz Plewczynski
Venue: Proceedings of the 2008 International Conference on Biocomputation, Bioinformatics, and Biomedical Technologies (2008)

We present here the trend vector based method for identification of inhibitors for a given protein target. Therefore our approach reduces the number of compounds to be tested experimentally in costly validation studies, when some initial information about actives is already available. The machine learning method is trained here on compounds from the Elsevier Molecular Design Ltd (MDL) Information Systems' drug data report (MDDR) for five diverse protein targets (cyclooxygenase-2, dihydrofolatereductase, thrombin, HIV-reverse transcriptase and antagonists of the estrogen receptor). Each classified ligand is represented using an optimized set of two dimensional topological descriptors. Then the trend vectors are used to divide the whole set of ligands into two groups: 1) molecules predicted to be active, and 2) those predicted to be inactive. Training and predicted activities were treated as binary. The accuracy of the method is comparable to other existing prediction tools (such as support vector machines, or random forest), whereas it provides significantly higher speed and portability. The accuracy of prediction (precision) reaches 60% on heterogeneous source data. As a consequence, the method can be easily applied to large commercial compounds collections.
Effect of Ventilation on Indoor Airborne Microbial Pollution Control
Authors: Guoqing Cao
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Airborne microorganisms present a challenge to engineering control of indoor air quality (IAQ) in hospital, commercial, and residential buildings. This paper analyses the generation, transmission and control mechanism of airborne microbes, and presents one engineering control method that is ventilation commonly used in indoor air microbial contamination control. A mathematical calculous model of building ventilation system is developed to study on microbial contamination control. Discusses the relationship between different ventilation parameters and microbial concentration due to ventilation model, and gives the connection between ventilation rate and infection rate based on the Wells-Riley equation. Theoretical calculation results show that natural ventilation is ineffective if microbial pollution control is the main purpose of indoor air contamination control, mechanical ventilation should be taken. When indoor microbial pollution density is high, only ventilation cannot reduce the infection rate effectively, then other methods, such as air filtration, ultraviolet germicidal irradiation etc, should be combined for better control.
Architecting for Physical Verification Performance and Scaling
Authors: John Ferguson, Robert Todd
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

The primary goal when using physical verificationtools is to achieve the best performance at the lowestcost, both in resources and time. Physical verificationtools rely on multiple enabling technologies tocontribute to runtime and turnaround time reduction.Using differing combinations of architecture andscaling, this paper compares and contrasts threephysical verification approaches to determine thecombination of factors most likely to produce thedesired results in a production environment.
Safety Enhancing Mechanisms for Pervasive Computing Systems in Intelligent Environments
Authors: Hen-I Yang, Abdelsalam Helal
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

Pervasive computing systems provide personalized and intimate services to improve users’ quality of life by integrating computation and communication into the environments. With the capability to interact with the physical world and the promise in assisting or managing aspects of users’ daily lives, the requirement for safety is high and imminent. The difficulty in providing safety is the result of the dynamicity, complexity, heterogeneity and uncertainly typical in pervasive computing. After examining and analyzing worst-case scenarios of safety violation, we identify four fundamental elements whose individual safety assurances add greatly to the overall system safety. We propose safety enhancing mechanisms for each of the four elements and their interactions.
Continuous coordination within the context of cooperative and human aspects of software engineering
Authors: Ban Al-Ani, Erik Trainer, Roger Ripley, Anita Sarma, André van der Hoek, David Redmiles
Venue: Proceedings of the 2008 international workshop on Cooperative and human aspects of software engineering (2008)

We have developed software tools that aim to support the cooperative software engineering tasks and promote an awareness of social dependencies that is essential to successful coordination. The tools share common characteristics that can be traced back to the principles of the Continuous Coordination (CC) paradigm. However, the development of each sprung from carrying out a different set of activities during its development process. In this paper, we outline the principles of the CC paradigm, the tools that implement these principles and focus on the social aspects of software engineering. Finally, we discuss the socio-technical and human-centered processes we adopted to develop these tools. Our conclusion is that the cooperative dimension of our tools represents the cooperation between researchers, subjects, and field sites. Our conclusion suggests that the development processes adopted to develop like-tools need to reflect this cooperative dimension.
A cross-modal approach for karaoke artifacts correction
Authors: Wei-Qi Yan, Mohan S. Kankanhalli
Venue: Multimedia Tools and Applications (2008)

Karaoke singing is a popular form of entertainment in several parts of the world. Since this genre of performance attracts amateurs, the singing often has artifacts related to scale, tempo, and synchrony. We have developed an approach to correct these artifacts using cross-modal multimedia streams information. We first perform adaptive sampling on the user's rendition and then use the original singer's rendition as well as the video caption highlighting information in order to correct the pitch, tempo and the loudness. A method of analogies has been employed to perform this correction. The basic idea is to manipulate the user's rendition in a manner to make it as similar as possible to the original singing. A pre-processing step of noise removal due to feedback and huffing also helps improve the quality of the user's audio. The results are described in the paper which shows the effectiveness of this multimedia approach.
The Sensing Performance of Undoped-AlGaN/GaN/Sapphire HEMT Hydrogen Gas Sensor
Authors: Mazuina Mohamad, Fong Yee Meng, Abdul Manaf Hashim
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

The hydrogen sensing characteristics of undoped-AlGaN/GaN/sapphire circular Schottky diodes are systematically studied and compared over wide hydrogen concentration and temperature ranges. High purity hydrogen gas was exposed to the sample together with the ambient gas of either air or pure nitrogen or without ambient gas (vacuum) at pressure in the range of 50 Torr to 200 Torr was used for both types of ambient gases. The sensing characteristics at different hydrogen concentration are investigated. The sensitivity to hydrogen gas was also investigated in dependence of various catalytic metals thickness and operating temperatures.