ppxscal/embedding_network huggingface dataset:
Power-efficient epidemic information dissemination in sensor networks
Authors: Benoît Garbinato, Denis Rochat, Marco Tomassini
Venue: Proceedings of the 2009 workshop on Bio-inspired algorithms for distributed systems (2009)

In this paper, we present a novel approach for epidemic information dissemination, also known as gossiping, in sensor networks. By construction, our protocol exhibits three interesting properties. First, the routing of messages follows a topology with characteristics similar to that of scale-free graphs, which have been shown to be particularly efficient in terms of power consumption, when gossiping in wireless networks. Then, our protocol is fully decentralized, meaning that each sensor works independently, i.e., no coordination is necessary among sensors. Finally, it is stateless, meaning that no history information is necessary. In particular, no neighborhood knowledge is necessary to execute the protocol. Intuitively, our decentralized and stateless protocol dynamically modulates its transmission power according to a power-law distribution. That is, our approach allows sensors to save power with no negative impact, neither on the time needed for reaching all the sensors, nor on the number of messages sent.
The challenge of making a recording for the contemporary violin playing: Robert Davidson's message ground: violin duo or solo violin with digital delay or CD
Authors: Ang-Cheng Kris Ho, Yu-Chang Hu
Venue: Proceedings of the 10th WSEAS international conference on Acoustics & music: theory & applications (2009)

This research examines the use of music technology in today's violin music and performance. Music technology has provided the violinist opportunities to execute music in different ways. Robert Davidson's Message Ground: Violin Duo or Solo Violin with Digital Delay or CD is a selected example of this research. This research investigates the relationship between violin playing, technology application and audio engineer. It discusses techniques of violin playing and the process of making a recording. These challenges provide excellent exercises grounding in the fundamental basis of the violin playing and utilising the music technology into the performance preparation.
The TIL-Script Language
Authors: Nikola Ciprich, Marie Duží, Michal Košinár
Venue: Proceeding of the 2009 conference on Information Modelling and Knowledge Bases XX (2009)

Multi-agent system is a system of autonomous, intelligent but resource-bounded agents. Particular agents have to be able to make decisions on their own, based on the activities of the other agents and events within the system as well as its environment. Thus the agents have to communicate and collaborate with each other as well as with their environment. They communicate by exchanging messages encoded in a near-to-natural language. Traditional first-order languages are not expressive enough to meet the demands of MAS communication. Therefore we make use of the powerful system of Transparent Intensional Logic (TIL). The paper introduces the software variant of TIL, namely the TIL-Script functional programming language. We describe its syntax and semantic, as well as the way the TIL-Script facilities are integrated into the whole multi-agent system.
Women, doctoral degrees, and technology: female doctoral students online
Authors: Lana Rakow
Venue:  (2008)

Women, Doctoral Degrees, and Computer Technology: Female Doctoral Students Online was conducted at a Midwestern university addressing the questions: (1) How do women use the computer during their doctoral work? (2) Why do women use the computer for their doctoral work? (3) When do women working on their doctoral work use the computer? and (4) Has the personal computer enabled the doctoral student to complete her Ph.D.? The investigation was conducted in three stages. Phase one was a pilot survey of 23 women in doctoral programs that provided descriptive data on how, how much, and when women in doctoral programs used computer technology. Phase two was a focus group formed from the original participants. Phase three was a collection of personal interviews conducted with nine more of the original participants. The personal interviews were conducted to gather information about the meaning of the descriptive data. The study gave an opportunity for this group of women to voice their views and perspectives on the importance of computer technology in their doctoral programs. In 20th century United States, a traditional mid-class woman's "first shift" was her home. Feminist communication scholars identified more shifts. A "second shift" emerged when women maintained a family and a job. The phenomenon of a "parallel shift" of work and family responsibilities connected simultaneously where women use the mobile phone to connect home and job appeared. A "third shift" became apparent when women added education to maintaining home and job. This study illuminates the previous shifts in association with computer technology and more explicitly introduces the "fourth shift" of computer technology proficiency demands that permeate a woman's life in issues of convenience, desires, economics, e-mail, empowerment, frustration, information, pleasure, roadblocks, space, time, and weekly schedules. As the women expressed the challenges of work, family, career, and school, a theme emerged that proposes a "fourth shift" has been added to a woman's environment. A nascent feminist communication theory called The Fourth Shift Theory emerged from the "fourth shift" theme's relationship to the patterns of background, patriarchy, and societal change found in the literature on women and education, women and computer technology, women and communication, and women and work. Although technology is not inherently gendered and does have benefits for women, there are barriers for women that accompany the "fourth shift." Hegemony accompanies computer technology and is upheld in society through gender ideology. The Fourth Shift Theory asserts that gender-typed computer technology proficiency is necessary in a woman's world in order for her to function and manage her responsibilities.
The multiple criteria transportation model: special case
Authors: Tkacenko Alexandra
Venue: Proceedings of the 15th american conference on Applied mathematics (2009)

In the paper the multicriteria transportation fractional problem of "bottleneck" type is investigated. We have studied the case of identical denominators of the objective functions like of the total cost or deterioration per unit of time and many other similarly criteria which present an increased interest from the practical point of view. We have proposed an iterative algorithm with theoretical justification for solving the proposed problem, in which the time constraining criterion is included. It is tested on a concrete example, annexed to the work.
Study of Iterative Learning Control Algorithm Based on Neural Network
Authors: Xisheng Zhan, Jie Wu, Xianhe Zhang
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

Aiming at a kind of nonlinear systems part of which is either uncertain or with interference, a neural network iterative learning control algorithm based on feedback is proposed. It combines iterative learning control and feedback control, the latter made the system follow the track of expected trace in the direction of time axis, and the former made the system follow the expected trace in the direction of iterative axis.
Optimum network on future hydrogen supply chain in Peninsular Malaysia
Authors: S. K. Kamarudin, Z. Yaakob, W. R. W. Daud, W. Anuar, A. Zaharim
Venue: Proceedings of the 7th WSEAS international conference on System science and simulation in engineering (2008)

The main objective of this study is to presents the overview ideas on the infrastructure planning of hydrogen energy in Malaysia as potential future use of hydrogen as an energy carrier in the transportation sector. Finally the results will give the most optimum hydrogen network in Malaysia. The hydrogen demand are assuming that the hydrogen demand in Peninsular Malaysia as a function of total vehicle numbers, average total distance traveled, and vehicle fuel economy. The final results shows that, the liquefied hydrogen produced by natural gas steam reforming delivered via tanker truck using cryogenic Tanker was the most optimum hydrogen supply chain due to its most minimal cost.
Learning to cooperate in a continuous tragedy of the commons
Authors: Steven de Jong, Karl Tuyls
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

In previous work, we discussed that social dilemmas are often present in multi-agent systems [3]. Social dilemmas are problems in which we can only find a good solution if we consider the benefit of others in addition to our own benefit. Altruistic punishment has been identified as an important mechanism to enforce this consideration. However, as the punishment is altruistic, deciding whether to punish essentially entails a second-order social dilemma. We developed a methodology that allowed individually learning agents to reach satisfactory solutions in a social dilemma with a continuous strategy space, called the Ultimatum Game [2]. We extended this methodology to thousands of agents, using social networks [4]. Moreover, we devoted attention to the tragedy of the commons, a social dilemma typically exemplified by the Public Goods Game (PGG) [1]. In this game, which is played repeatedly, every agent i (out of n) has to decide on an investment &mu;i &epsilon; [0, C]. The summed investment is multiplied by a factor 1 < r < n, and equally distributed over all agents. Agent i's individual benefit (or reward) is maximized by &mu;i = 0, whereas the group gains the most by collectively playing &mu;i = C. Altruistic punishment (i.e., reducing an other agent's reward by an amount e, with a cost c < e to the punisher) allows agents to force others to invest a higher amount, but performing such punishment is clearly not individually rational. In earlier work, we restricted ourselves to a small number of strategies and/or agents in this game [1].
Rotation distance is fixed-parameter tractable
Authors: Sean Cleary, Katherine St. John
Venue: Information Processing Letters (2009)

Rotation distance between trees measures the number of simple operations it takes to transform one tree into another. There are no known polynomial-time algorithms for computing rotation distance. In the case of ordered rooted trees, we show that the rotation distance between two ordered trees is fixed-parameter tractable, in the parameter, k, the rotation distance. The proof relies on the kernelization of the initial trees to trees with size bounded by 5k.
VCONF: a reinforcement learning approach to virtual machines auto-configuration
Authors: Jia Rao, Xiangping Bu, Cheng-Zhong Xu, Leyi Wang, George Yin
Venue: Proceedings of the 6th international conference on Autonomic computing (2009)

Virtual machine (VM) technology enables multiple VMs to share resources on the same host. Resources allocated to the VMs should be re-configured dynamically in response to the change of application demands or resource supply. Because VM execution involves privileged domain and VM monitor, this causes uncertainties in VMs' resource to performance mapping and poses challenges in online determination of appropriate VM configurations. In this paper, we propose a reinforcement learning (RL) based approach, namely VCONF, to automate the VM configuration process. VCONF employs model-based RL algorithms to address the scalability and adaptability issues in applying RL in systems management. Experimental results on both controlled environments and a testbed of clouds with Xen VMs and representative server workloads demonstrate the effectiveness of VCONF. The approach is able to find optimal (near optimal) configurations in small scale systems and shows good adaptability and scalability.
Symbolic Model-based Test Selection
Authors: Thierry Jéron
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

This paper addresses the problem of model-based off-line selection of test cases for testing the conformance of a black-box implementation with respect to a specification, in the context of reactive systems. Efficient solutions to this problem have been proposed for LTS finite-state models, based on the ioco conformance testing theory. In this paper, the approach is extended for infinite-state specifications, modelled as automata extended with variables. When considering the selection of test cases according to test purposes (abstract scenarii focused by test cases), the selection of test cases relies on approximate co-reachability analyses using abstract interpretation and syntactical transformations guided by this analysis, while test execution uses constraint solving.
Combining Measurement Data and Erlang-B Formula for Blocking Prediction in GSM Networks
Authors: Pasi Lehtimäki, Kimmo Raivio
Venue: Proceeding of the 2008 conference on Tenth Scandinavian Conference on Artificial Intelligence: SCAI 2008 (2008)

In cellular network performance optimization, it is important to be able to predict the amount of user-experienced quality problems such as call blocking with alternative modifications to the network configuration. In this paper, a method based on mathematical optimization and knowledge representation to predict the amount of blocking in GSM networks is presented. The method is based on exploiting the available statistical measurement information describing the individual characteristics of the network elements. In addition, application domain knowledge about blocking is included to the model by using the well known Erlang-B formula to establish a mapping between blocking and existing network measurements. The results of the experiments show that the proposed method performs better than the comparison method based on basic Erlang-B formula and raw measurement data.
From Interactive Positioning to Automatic Try-On of Garments
Authors: Tung Thanh, André Gagalowicz
Venue: Proceedings of the 4th International Conference on Computer Vision/Computer Graphics CollaborationTechniques (2009)

With the large development of computer graphics hardware and virtual cloth simulation techniques, virtual try-on of garments has become possible. An Internet-based shop will reduce significantly the cost of garment manufacturing as only paid garments will be manufactured. On top of that, a client will also be able to buy exactly what he wants and garments will be fitted to him/her. In this paper, we describe a virtual try-on system that allows a particular user to try garments easily. After loading his/her 3D digital model, he will be able to select the clothes he wants from a data base and see himself/herself wearing it virtually in 3D. The proposed system consists of two major parts : first, the 2D positioning part which requires a designer's interaction; second, a 3D part, fully automatic which will be installed in the user's computer, which allows tim to access a garments'catalog and see himself wearing virtually the chosen garment.
Learning in an Ambient Intelligent World: Enabling Technologies and Practices
Authors: Xiang Li, Ling Feng, Lizhu Zhou, Yuanchun Shi
Venue: IEEE Transactions on Knowledge and Data Engineering (2009)

The rapid evolution of information and communication technology opens a wide spectrum of opportunities to change our surroundings into an Ambient Intelligent (AmI) world. AmI is a vision of future information society, where people are surrounded by a digital environment that is sensitive to their needs, personalized to their requirements, anticipatory of their behavior, and responsive to their presence. It emphasizes on greater user friendliness, user empowerment, and more effective service support, with an aim to bring information and communication technology to everyone, every home, every business, and every school, thus improving the quality of human life. AmI unprecedentedly enhances learning experiences by endowing the users with the opportunities of learning in context, a breakthrough from the traditional education settings. In this survey paper, we examine some major characteristics of an AmI learning environment. To deliver a feasible and effective solution to ambient learning, we overview a few latest developed enabling technologies in context awareness and interactive learning. Associated practices are meanwhile reported. We also describe our experience in designing and implementing a smart class prototype, which allows teachers to simultaneously instruct both local and remote students in a context-aware and natural way.
Support vector machine approach to extracting gene references into function from biological documents
Authors: Chih Lee, Wen-Juan Hou, Hsin-Hsi Chen
Venue: Proceedings of the International Joint Workshop on Natural Language Processing in Biomedicine and its Applications (2004)

In the biological domain, extracting newly discovered functional features from the massive literature is a major challenging issue. To automatically annotate Gene References into Function (GeneRIF) in a new literature is the main goal of this paper. We tried to find GRIF words in a training corpus, and then applied these informative words to annotate the GeneRIFs in abstracts with several different weighting schemes. The experiments showed that the Classic Dice score is at most 50.18%, when the weighting schemes proposed in the paper (Hou et al., 2003) were adopted. In contrast, after employing Support Vector Machines (SVMs) and the definition of classes proposed by Jelier et al. (2003), the score greatly improved to 56.86% for Classic Dice (CD). Adopting the same features, SVMs demonstrated advantage over the Na&iuml;ve Bayes Classifier. Finally, the combination of the former two models attained a score of 59.51% for CD.
Usability Issues in Description Logic Knowledge Base Completion
Authors: Franz Baader, Barış Sertkaya
Venue: Proceedings of the 7th International Conference on Formal Concept Analysis (2009)

In a previous paper, we have introduced an approach for extending both the terminological and the assertional part of a Description Logic knowledge base by using information provided by the assertional part and by a domain expert. This approach, called knowledge base completion, was based on an extension of attribute exploration to the case of partial contexts. The present paper recalls this approach, and then addresses usability issues that came up during first experiments with a preliminary implementation of the completion algorithm. It turns out that these issues can be addressed by extending the exploration algorithm for partial contexts such that it can deal with implicational background knowledge.
Computational modeling and real-time control of patient-specific laser treatment of prostate cancer
Authors: John Tinsley Oden
Venue:  (2008)

Hyperthermia based cancer treatments delivered under various modalities have the potential to become an effective option to eradicate the disease, maintain functionality of infected organs, and minimize complications and relapse. Moreover, hyperthermia therapies are a form of minimally invasive cancer treatment which are key to improving the quality of life post-treatment. Many modalities are available for delivering the heat source. However, the ability to control the energy deposition to prevent damage to adjacent healthy tissue is a limiting factor in all forms of thermal therapies, including cryotherapy, microwave, radio-frequency, ultrasound, and laser. The application of a laser heat source under the guidance of real-time treatment data has the potential to provide unprecedented control over the temperature field induced within the biological domain. The computational infrastructure developed in this work combines a computational model of bioheat transfer based on a nonlinear version of the Pennes equation for heterogeneous media with the precise timing and orchestration of the real-time solutions to the problems of calibration, optimal control, data transfer, registration, finite element mesh refinement, cellular damage prediction, and laser control; it is an example of Dynamic-Data-Driven Applications System (DDDAS) in which simulation models interact with measurement devices and assimilates data over a computational grid for the purpose of producing high-fidelity predictions of physical events. The tool controls the thermal source, provides a prediction of the entire outcome of the treatment and, using intra-operative data, updates itself to increase the accuracy of the prediction. A precise mathematical framework for the real-time finite element solution of the problems of calibration, optimal heat source control, and goal-oriented error estimation applied to the equations of bioheat transfer is presented. It is demonstrated that current finite element technology, parallel computer architecture, data transfer infrastructure, and thermal imaging modalities are capable of inducing a precise computer controlled temperature field within a biological domain. The project thus addresses a set of problems falling in the intersection of applied mathematics, imaging physics, computational science, computer science and visualizations, biomedical engineering, and medical science. The work involves contributions in the three component areas of the CAM program; A, Applicable Mathematics; B, Numerical Analysis and Scientific Computing; and C, Mathematical modeling and Applications. The ultimate goal of this research is to provide the medical community a minimally invasive clinical tool that uses predictive computational techniques to provide the optimal hyperthermia laser treatment procedure given real-time, patient specific data.
Exact Path Delay Fault Coverage Calculation of Partitioned Circuits
Authors: Fatih Kocan, Lun Li, Daniel G. Saab
Venue: IEEE Transactions on Computers (2009)

Exact path delay fault (PDF) coverage calculation of large circuits with an exponential number of detectable PDFs requires exponential memory space. This often yields memory overflow in computations. One common approach to avoid memory overflow is to partition or virtually cut circuits into several subcircuits and to perform coverage calculation at the partition-level circuit. Partitioning reduces the number of PDFs to be stored in memory exponentially at the expense of losing considerable coverage. This paper describes an algorithm to improve the reported coverage value by recovering the lost PDFs up to a user-controlled degree (\Delta), which is a function of the length of cut net sequences. The reported coverage monotonically increases as \Delta increases: the exact coverage value is guaranteed when \Delta is equal to the number of consecutive partitions on the longest path. Experimental results are provided for the ISCAS85 circuits that illustrate the trade-off between the computation time, the number of partitions, the values of \Delta, and the reported coverage. The results indicate that as \Delta and the number of partitions increase, the runtime does not increase after some point since the cost of set operations reduces as more partitions are created.
A Winner-Take-All Neural Networks of N Linear Threshold Neurons without Self-Excitatory Connections
Authors: Hong Qu, Zhang Yi, Xiaobin Wang
Venue: Neural Processing Letters (2009)

Multistable neural networks have attracted much interests in recent years, since the monostable networks are computationally restricted. This paper studies a N linear threshold neurons recurrent networks without Self-Excitatory connections. Our studies show that this network performs a Winner-Take-All (WTA) behavior, which has been recognized as a basic computational model done in brain. The contributions of this paper are: (1) It proves by mathematics that the proposed model is Non-Divergent. (2) An important implication (Winner-Take-All) of the proposed network model is studied. (3) Digital computer simulations are carried out to validate the performance of the theory findings.