ppxscal/embedding_network huggingface dataset:
Fault-tolerant deployment with k-connectivity and partial k-connectivity in sensor networks
Authors: Juhua Pu, Zhang Xiong, Xiaofeng Lu
Venue: Wireless Communications Mobile Computing (2009)

Wireless sensor networks are prone to failure, so prolonging their lifetime and preventing loss of connectivity are significant. A simple but efficient strategy is to place redundant sensor nodes to establish multi-connectivity. This paper explores how to add as few as possible nodes (called Steiner nodes) to a sensor network such that the resulting network is k-connected or partially k-connected. k-connectivity means that each pair of the nodes, whether Steiner or original, is connected by at least k node-disjoint paths, while partial k-connectivity only requires such connectivity among original nodes. The contribution lies in two aspects. First, the approximation ratio of an existing k-connectivity repair algorithm is decreased from O(k4&alpha;) to O(k3&alpha;), where &alpha; is the approximation ratio of any algorithm that finds a minimum-weight k-connected spanning subgraph of a weighted complete graph. This is the best result ever obtained. Second, the first generic partial k-connectivity repair algorithm is proposed. It is proved that the approximation ratio of this algorithm is at most O(k3&alpha;). Copyright &copy; 2008 John Wiley & Sons, Ltd.
Hiding Data Sources in P2P Networks
Authors: Marek Klonowski, Mirosław Kutyłowski, Bartłomiej Różański
Venue: Proceeding of the 2005 conference on Applied Public Key Infrastructure: 4th International Workshop: IWAP 2005 (2005)

We propose a peer-to-peer (P2P) architecture where the identity of nodes holding data remains hidden, but the information itself can be efficiently fetched. This architecture can be used to protect P2P networks against malicious attacks towards nodes holding important data. In particular, our protocol can be used for maintaining access to revocation lists, blacklists and similar data, which are of growing importance for modern P2P protocols.
A Combined Method for Extracting Rules with Improved Quality
Authors: Fuyan Liu
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

This paper presents an effective approach, which combines association rules and clustering algorithm for extracting rules on the web. The advantage of the method is that it can provide more precise and detailed rules compared with traditional algorithms. The paper analyzed some issues in previous approaches first. Then the proposed method is presented. Experiments are performed to evaluate the performance of the combined approach. Experimental results show that the proposed method is more effective and efficient.
Experimental and theoretical performances of a solar assisted dehumidification system for drying centella asiatica L
Authors: M. Yahya, K. Sopian, W. R. W. Daud, M. Y. Othman, B. Yatim, M. A. Alghoul, A. Zaharim
Venue: Proceedings of the 7th WSEAS international conference on System science and simulation in engineering (2008)

A solar assisted dehumidification system has been designed, fabricated, and evaluated. The main components of the drying system consist of a solar collector, an energy storage tank, an auxiliary heater, two blowers, two adsorber columns, two water-air heat exchanger, two water circulating pumps, a drying chamber and other ancillary equipment. A simulation program program has been developed to predict the performance of the drying system. The predicted results are compared with those obtained from experiments. The performance indices considered to calculate the performance of the drying system are: Pick up efficiency (ηP), Solar Fraction (SF) and Coefficient of Performance (COP). The results indicated that the maximum values of the pick up efficiency (ηP), solar fraction (SF) and coefficient of performance (COP) was found 70%, 97% and 0.3, respectively with initial and final wet basis moisture content of Centella Asiatica L 88% and 15%, respectively at an air velocity is 3.25 m/s. Good agreement was found between predicted results and measured results.
Combining Aspect and Model-Driven Engineering Approaches for Software Process Modeling and Execution
Authors: Reda Bendraou, Jean-Marc Jezéquél, Franck Fleurey
Venue: Proceedings of the International Conference on Software Process: Trustworthy Software Development Processes (2009)

One major advantage of executable software process models is that once defined, they can be simulated, checked and validated in short incremental and iterative cycles. This also makes them a powerful asset for important process improvement decisions such as resource allocation, deadlock identification and process management. In this paper, we propose a framework that combines Aspect and Model-Driven Engineering approaches in order to ensure process modeling, simulation and execution. This framework is based upon UML4SPM, a UML2.0-based language for Software Process Modeling and Kermeta, an executable metaprogramming language.
Multi-view object representation with inverse difference pyramid decomposition
Authors: Roumen Kountchev, Vladimir Todorov, Roumiana Kountcheva
Venue: Proceedings of the 3rd WSEAS international symposium on Wavelets theory and applications in applied mathematics, signal processing & modern science (2009)

In the paper is presented one new method for multi-view object representation based on image decomposition with Inverse Difference Pyramid. The method permits to obtain a very efficient description of the multi-view images using one of them as a reference one. The decomposition has a relatively low computational complexity because it is based on orthogonal transforms (Walsh-Hadamard, DCT, etc.). The relations which exist between transform coefficients from the consecutive decomposition layers permit significant reduction of the coefficients needed for the high-quality object representation.
Haptic virtual manipulatives for enhancing K-12 special education
Authors: Ravikiran B. Singapogu, Timothy C. Burg
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

The novel idea of haptic virtual manipulatives as learning aids for learning disabled K-12 students will be presented. The need for innovative, specialized tools to enhance learning, especially for students with learning disabilities, is presented as motivation for this work. We discuss virtual manipulatives for math education and the proposition that it would be beneficial to augment these manipulatives with a sense of touch through a haptic interface. The design of haptic virtual manipulatives is discussed as well as suitable haptic interfaces. A discussion of future directions of this research concludes the presentation.
Workflow Diagrams Based on Evidence Life Cycles
Authors: Osamu Takaki, Takahiro Seino, Izumi Takeuti, Noriaki Izumi, Koichi Takahashi
Venue: Proceeding of the 2008 conference on Knowledge-Based Software Engineering: Proceedings of the Eighth Joint Conference on Knowledge-Based Software Engineering (2008)

In this paper, we introduce a new language AWL of workflow diagrams for requirement analysis in large scale information system developments. AWL has a merit that one can describe concrete and accurate life cycles of evidences (evidence documents) in workflow diagrams in the language. We also introduce a tool AWDE that supports users to compose consistent workflow diagrams in AWL, by visualizing life cycles of evidences in the workflow diagrams and verifying consistency of the life cycles. As a validation of AWL and AWDE, we report an experiential result in requirement analysis in real large scale information system developments with and without AWDE.
Intractability results for some computational problems
Authors: Subhash Khot
Venue:  (2008)

In this thesis, we show results for some well-studied problems from learning theory and combinatorial optimization. Learning Parities under the Uniform Distribution. We study the learnability of parities in the agnostic learning framework of Haussler and Kearns et al. We show that under the uniform distribution, agnostically learning parities reduces to learning parities with random classification noise, commonly referred to as the noisy parity problem. Together with the parity learning algorithm of Blum et al., this gives the first nontrivial algorithm for agnostic learning of parities. We use similar techniques to reduce learning of two other fundamental concept classes under the uniform distribution to learning of noisy parities. Namely, we show that learning of DNF expressions reduces to learning noisy parities of just logarithmic number of variables and learning of k-juntas reduces to learning noisy parities of k variables. Agnostic Learning of Halfspaces. We give an essentially optimal hardness result for agnostic learning of halfspaces over Qn . We show that for any constant &epsi; finding a halfspace that agrees with an unknown function on 1/2 + &epsi; fraction of examples is NP-hard even when there exists a halfspace that agrees with the unknown function on 1 &minus; &epsi; fraction of examples. This significantly improves on a number of previous hardness results for this problem. We extend the result to &epsi; = 2-Wlog n assuming NP &nsube; DTIME( 2logn O1 ). Majorities of Halfspaces. We show that majorities of halfspaces are hard to PAC-learn using any representation, based on the cryptographic assumption underlying the Ajtai-Dwork cryptosystem. This also implies a hardness result for learning halfspaces with a high rate of adversarial noise even if the learning algorithm can output any efficiently computable hypothesis. Max-Clique, Chromatic Number and Min-3Lin-Deletion. We prove an improved hardness of approximation result for two problems, namely, the problem of finding the size of the largest clique in a graph (also referred to as the Max-Clique problem) and the problem of finding the chromatic number of a graph. We show that for any constant &gamma; > 0, there is no polynomial time algorithm that approximates these problems within factor n/2logn 3/4+g in an n vertex graph, assuming NP &nsube; BPTIME( 2logn O1 ). This improves the hardness factor of n/2logn 1-g&prime; for some small (unspecified) constant &gamma;' > 0 shown by Khot. Our main idea is to show an improved hardness result for the Min-3Lin-Deletion problem.Monotone Multilinear Boolean Circuits for Bipartite Perfect Matching. A monotone Boolean circuit is said to be multilinear if for any AND gate in the circuit, the minimal representation of the two input functions to the gate do not have any variable in common. We show that monotone multilinear Boolean circuits for computing bipartite perfect matching require exponential size. In fact we prove a stronger result by characterizing the structure of the smallest monotone multilinear Boolean circuits for the problem.
Thickness-Two Graphs Part Two: More New Nine-Critical Graphs, Independence Ratio, Cloned Planar Graphs, and Singly and Doubly Outerplanar Graphs
Authors: Ellen Gethner, Thom Sulanke
Venue: Graphs and Combinatorics (2009)

There are numerous means for measuring the closeness to planarity of a graph such as crossing number, splitting number, and a variety of thickness parameters. We focus on the classical concept of the thickness of a graph, and we add to earlier work in [4]. In particular, we offer new 9-critical thickness-two graphs on 17, 25, and 33 vertices, all of which provide counterexamples to a conjecture on independence ratio of Albertson; we investigate three classes of graphs, namely singly and doubly outerplanar graphs, and cloned planar graphs. We give a sharp upper bound for the largest chromatic number of the cloned planar graphs, and we give upper and lower bounds for the largest chromatic number of the former two classes.
Selection of defuzzification method for routing metrics in MPLS network to obtain better crisp values for link optimization
Authors: Arianit Maraj, Besnik Shatri, Skender Rugova
Venue: Proceedings of the 7th WSEAS international conference on System science and simulation in engineering (2008)

The complexity of networks that offers multimedia services requires the consideration of multiple routing metrics for routing decisions. The most important metrics that should be considered for multimedia services are: delay, bandwidth, jitter, losses etc. This paper treats three network metrics as input parameters of fuzzy logic controller: delay, losses and bandwidth. As we know, the output of fuzzy logic controller depends from selection of defuzzification method. The aim is to obtain better values of link optimization in MPLS network using appropriate defuzzification method. Also, in this paper we will make some analysis with MATLAB to show which defuzzification method is the best one for better link utilization.
Intravascular palpation and haptic feedback during angioplasty
Authors: Thorsten Mei, Christoph Budelmann, Thorsten A. Kern, Stephanie Sindlinger, Carlos Minamisava, Roland Werthschutzky
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

Within the HapCath - haptic catheter - project an assistive system for interventional catheterizations has been developed. Conventional navigation during catheterization is done by direct manipulation of a handle at a guide wire's proximal end. With the aid of x-ray imaging the corresponding movement of the distal tip within the patient can be monitored. Depending on the practical experience of the medical expert and on the varying complexity of the treatment, the procedure differs in duration and x-ray exposure dose of up to 300 %. The aim of the HapCath-System is to reduce duration and exposure dose by simplifying the procedure. The implemented method is to measure the contact forces at the distal tip of the guide wire and feed these measured forces back onto the proximal end of the guide wire to enable tactile feedback and allow for haptic control of the guide wire. The system gives exact measures for the contact force of the guide wire's tip and vessel walls to the physician. The demonstration system of HapCath includes an artificial artery system, within these the user will be able to maneuver the haptic guide wire and will be able to recognize different types of plaques by touching the calcifications with the guide wire tip. The system is set up to experience different levels of haptic assistance. The discrete tasks of catheterizations can be performed with visual or haptic feedback either, or with visual and haptic feedback simultaneously.
Multi-Agent-System for General Strategic Interaction
Authors: Rustam Tagiew
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

The challenge addressed in this paper is designing of a software framework and associated language for interactions between real-world agents, if they reason strategically. The aspired result is general definition, providing and recording of strategic interactions, or also called games. The paper contains an overview of most important preliminary works. We present our approach for game management infrastructure. It is based on a multi-agent programing environment JADE. We also introduce our petri nets based language for definition of a subset of games of imperfect information restricted through finite number of states and actions. The language is additionally able to define time critical processes with discrete intervals. Game representation in our language can be also used for calculating game theoretic or heuristic solutions. 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
The direct updating of damping and gyroscopic matrices
Authors: Yongxin Yuan, Hua Dai
Venue: Journal of Computational and Applied Mathematics (2009)

In this paper we develop an efficient numerical method for the finite element model updating of damped gyroscopic systems. This model updating of damped gyroscopic systems is proposed to incorporate the measured modal data into the finite element model to produce an adjusted finite element model on the damping and gyroscopic matrices that closely match the experimental modal data.
EMO: A statistical encounter-based mobility model for simulating delay tolerant networks
Authors: Feiselia Tan, Youmna Borghol, Sebastien Ardon
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

We propose EMO, a model to evaluate Delay Tolerant Networks (DTN) and opportunistic systems, which focuses on simulating encounter events between mobile radios, rather than node locations as done in existing models and simulators. Our approach introduces a more accurate simulation of DTNs on the main system timescale (the encounter timescale), while trading off some accuracy at the bit-level, through an abstraction of radio propagation simulation. To design EMO, we extract and characterize the necessary parameters from experimental data and propose a method to generate synthetic node encounter traces based on this characterization. The output of the model is validated using hold-out cross-validation method. Our validation results indicate that EMO is able to maintain the statistical properties of experimental data over a wide range of time (simulation duration) and space (number of nodes) scales, with mean square errors of less than 3% for the main system parameters.
Out of the box: exploring the richness of children's use of an interactive table
Authors: Rune Nielsen, Jonas Fritsch, Kim Halskov, Martin Brynskov
Venue: Proceedings of the 8th International Conference on Interaction Design and Children (2009)

In this article we explore how to enrich the experience of toys that usually spend a boring time in their boxes in the toy store by digitally bringing them out of the box. For this purpose we have developed an interactive table based on the 3D game engine Virtools, together with the reacTIVision software and have studied and evaluated the use of the table in a full-scale, realworld situation in the toy department of a major Danish retailer. Our detailed analysis highlights the wide range of interaction forms and interaction modes facilitated by the table, moving from initial exploration to playful and engaging experiences, both on individual and social levels. We sum up our findings and their relevance for future design and show how the interplay of physical design, interaction, and content has been instrumental in giving children and adults a richer and extended experience of the toy -- even though it remains in the box.
Minimizing the communication cost for continuous skyline maintenance
Authors: Zhenjie Zhang, Reynold Cheng, Dimitris Papadias, Anthony K.H. Tung
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

Existing work in the skyline literature focuses on optimizing the processing cost. This paper aims at minimization of the communication overhead in client-server architectures, where a server continuously maintains the skyline of dynamic objects. Our first contribution is a Filter method that avoids transmission of updates from objects that cannot influence the skyline. Specifically, each object is assigned a filter so that it needs to issue an update only if it violates its filter. Filter achieves significant savings over the naive approach of transmitting all updates. Going one step further, we introduce the concept of frequent skyline query over a sliding window(FSQW). The motivation is that snapshot skylines are not very useful in streaming environments because they keep changing over time. Instead, FSQW reports the objects that appear in the skylines of at least θ ⋅ s of the s most recent timestamps (0
Understanding how to support architects in sharing knowledge
Authors: Rik Farenhorst, Hans van Vliet
Venue: Proceedings of the 2009 ICSE Workshop on Sharing and Reusing Architectural Knowledge (2009)

In this paper we report on four years of case study research in a large software development organization, during which we built up understanding on how to effectively support software architects in sharing knowledge. By following a typical action research cycle we first diagnosed the architecting process of this organization, after which we designed and executed a therapy for the identified problems. The insights gained over the past few years have resulted in four lessons learned and have culminated in a theoretical framework of what architects do and what they need.
Architectural core salvaging in a multi-core processor for hard-error tolerance
Authors: Michael D. Powell, Arijit Biswas, Shantanu Gupta, Shubhendu S. Mukherjee
Venue: Proceedings of the 36th annual international symposium on Computer architecture (2009)

The incidence of hard errors in CPUs is a challenge for future multicore designs due to increasing total core area. Even if the location and nature of hard errors are known a priori, either at manufacture-time or in the field, cores with such errors must be disabled in the absence of hard-error tolerance. While caches, with their regular and repetitive structures, are easily covered against hard errors by providing spare arrays or spare lines, structures within a core are neither as regular nor as repetitive. Previous work has proposed microarchitectural core salvaging to exploit structural redundancy within a core and maintain functionality in the presence of hard errors. Unfortunately microarchitectural salvaging introduces complexity and may provide only limited coverage of core area against hard errors due to a lack of natural redundancy in the core. This paper makes a case for architectural core salvaging. We observe that even if some individual cores cannot execute certain operations, a CPU die can be instruction-set-architecture (ISA) compliant, that is execute all of the instructions required by its ISA, by exploiting natural cross-core redundancy. We propose using hardware to migrate offending threads to another core that can execute the operation. Architectural core salvaging can cover a large core area against faults, and be implemented by leveraging known techniques that minimize changes to the microarchitecture. We show it is possible to optimize architectural core salvaging such that the performance on a faulty die approaches that of a fault-free die--assuring significantly better performance than core disabling for many workloads and no worse performance than core disabling for the remainder.
Web-based citizens education for a healthy life-style
Authors: Ioana Moisil, Carmen Domnariu, Liliana Rogozea
Venue: Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases (2009)

All over the world the health sector has to face serious challenges: aging population, increase of the care costs, new diseases, and increase incidence of chronic diseases, being the most important. There are new treatments, new medical technologies that can answer to some of these challenges, but often access to them is prohibited by the costs associated. An old proverb, attributed to Erasmus of Rotterdam says that "Prevention is better than cure". In our paper we are presenting a health portal - PRO VITA - designed to support education for a healthy life-style of the citizens of the district of Sibiu. In designing the portal we had considered, from the medical point of view, the fact that primary prevention starts with reduction of risk factors. From the technical point of view we took advantage of the opportunities offered by Web 2.0 services and technologies (web-based communities, wikis, blogs, social networks, RSS, LPWS- lifetime personal Web space, podcasts, Second Life, etc.), combined with the multi-agent paradigm.