ppxscal/embedding_network huggingface dataset:
Rethinking the link abstraction for multihop wireless networks: implications, cross-layer protocols and deployment
Authors: Srikanth Krishnamurthy
Venue:  (2007)

The link abstraction defines to a large extent the basis for the research and development of medium access control (MAC) and routing protocols for multihop wireless networks. Traditionally, an abstraction similar to the one commonly used to model the link of the wire-line networks has been adopted. However, the first wide-scale experimental deployments of multihop wireless networks have shown that the protocols designed based on this abstraction perform poorly in practice. The insights gained from the experimental deployments, coupled with significant advances in physical layer research in the early 2000's, have led to rethinking on what is the right link abstraction for multihop wireless networks. As a result, a new link abstraction has emerged based on the following generalizations. First, multiple nodes can cooperate together to create many-to-one links, an approach formally known as cooperative diversity. Multiple studies have shown that cooperative diversity can multiplicatively increase the link capacity and/or range. Second, the wireless links are intermittent. In light of these major changes to the link abstraction, the key challenge is identifying the implications these changes have on the fundamental design principles of the higher layer protocols and, if necessary, the redesign, in part or in their entirety, of the MAC and routing protocols for multi-hop wireless networks. In this dissertation, we attempt to address this challenge. We design cross-layer protocols that exploit cooperative diversity to improve the performance of the unicast and broadcast communications in multi-hop wireless networks. For unicast, we present a novel multi-layer protocol that spans the physical, MAC and routing layers. Extensive simulations show that our protocol achieves an increase of up to 150% in the end-to-end throughput and a decrease of up to 75% in the end-to-end delay. For network-wide broadcasting, we show that computing the optimal solution to the broadcasting with cooperative diversity is NP-Complete. Furthermore, we construct centralized and distributed approximation algorithms that significantly improve the performance of the broadcasting. Finally, we propose ETOP, a new path metric that accurately captures the packet delivery cost of a multi-hop path consisting of intermittent links. We analytically compute ETOP and prove that the problem of computing paths with the minimum ETOP cost can be solved by a greedy algorithm. We design such an algorithm and implement it in Linux as part of a legacy routing protocol. Experiments on a 25 IEEE 802.11 node testbed show that in a real environment our algorithm increases the end-to-end TCP goodput by over 50% compared to the best alternative algorithm.
Culture of Error Management "Why Admit an Error When No One Will Find Out?"
Authors: Horst Degen-Hientz
Venue: Proceedings of the 9th international conference on Product-Focused Software Process Improvement (2008)

What has a Stradivari and Linux in common? It is the error culture-driven process that created it. A culture of restless strives for innovation and quality enabling continuous learning. We systematically get trained by being punished as child when doing mistakes and often need a life long cumbersome process to undo this conditioning. In western world many organization behave just like as that: errors are socially not acceptable. This seems to be universal applicable as Kaizen and the "zero-defect-culture" can teach us. It is not a society intrinsic attitude - as one can observe from the Toyota way - which took years to establish an organizational error management culture. Studies in Europe show too that organizational error management are a means to boost companies' performance and goals achievement. Hence, what can we learn from Stradivari and Linux? It is the way to organize error management and innovation. This is key to open source projects and the raising inner source projects as observable in companies like Google.
Development of a Microscopic Three-Axis Tactile Sensor: Preliminary Examinations to Establish Sensing Algorithm by Using a Simulated Mockup
Authors: Shunsuke Yoshida, Tomoyuki Miyazawa, Terukazu Mizota, Katsumi Higuchi, Takeshi Kanashima, Haruo Noma
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

We are developing a minute tactile sensor having four cantilevers for sensing pressure and shear forces simultaneously and for distributing over a small area to recognize a certain area's conditions. Toward our goal, another important task is to establish, in parallel with the sensor's fabrication, a computing method that converts measured signals to applied forces. In this paper, we first investigate our sensing mechanism using a centimeter scale mockup of the actual sensor. Then, we formulate the relationship between the applied forces and the sensor outputs by a numerical analysis using a sufficient number of pairings of the forces and outputs. Finally, we examine the potential of the method.
Enhancing Recommendations through a Data Mining Algorithm
Authors: Alexis Lazanas, Nikos Karacapilidis
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

This paper reports on the development of a new data mining algorithm that formulates purposeful association rules out of the transactions' database of a transportation management system,. The proposed algorithm is generic and capable to construct such rules by creating a large set of related items. The constructed rules can be used by the system's recommender module, which is responsible for providing recommendations to the associated users. The recommendation process takes into account the constructed rules and techniques that derive from the area of collaborative filtering. Our approach enables users to receive high quality recommendations for their upcoming transactions.
Web prefetching with high accuracy and low memory cost
Authors: Qinghui Liu, Roberto Solis-Oba
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

Prefetching algorithms can effectively reduce Web latency and dramatically improve responsiveness of interactive Web application. We propose a new history-based prefetching algorithm that achieves very high prediction accuracy, generates little overhead traffic, and allows users to bound the amount of memory that it uses. We also propose a method to find accurate upper bounds on the performance of any history-based prefetching algorithm.
Natural Interaction between Avatars and Persons with Alzheimer's Disease
Authors: Eduardo Carrasco, Gorka Epelde, Aitor Moreno, Amalia Ortiz, Igor Garcia, Cristina Buiza, Elena Urdaneta, Aitziber Etxaniz, Mari Feli González, Andoni Arruti
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

In this paper a natural human computer interaction paradigm is proposed for persons with cognitive impairments such as Alzheimer's Disease. The paradigm consists of using a realistic virtual character, rendered on a common television set, to play the role of a virtual personal assistant that shows reminders, notifications and performs short dialogues with the user. In this paradigm, the television remote control is used as a return channel to capture the user's responses. To test this concept, a functional prototype was built and then validated by a group of 21 persons with Alzheimer's Disease ranging from mild to moderate. For this validation two simple dialogues were developed that consisted of simple Yes/No type questions. The test results showed that with both dialogues all users engaged naturally with the avatar. All of the users understood the information conveyed by the avatar and answered successfully by means of the TV remote control.
Infinite horizon stochastic H2/H∞ control for discrete-time systems with state and disturbance dependent noise
Authors: Weihai Zhang, Yulin Huang, Lihua Xie
Venue: Automatica (Journal of IFAC) (2008)

This paper studies the infinite horizon mixed H"2/H"~ control for discrete-time stochastic systems with state and disturbance dependent noise. We shall first establish a version of stochastic bounded real lemma (SBRL) which by itself has theoretical importance. Based on the SBRL, it is shown that under the condition of exact observability, the existence of a static state feedback H"2/H"~ controller is equivalent to the solvability of four coupled matrix-valued equations. A suboptimal H"2/H"~ controller design is given based on a convex optimization approach and an iterative algorithm is proposed to solve the four coupled matrix-valued equations.
A Clustering Algorithm Based on Power for WSNs
Authors: Kaihua Xu, Ya Wang, Yuhua Liu
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

This paper computes the optimum number of cluster heads based on power first, and then proposes the clustering algorithm for WSNs, at last estimates its performances by our emulator. On analysis, clustering time complexity is dependent on the network diameter and it is suitable for small or medium networks. The simulation results show that using this clustering algorithm can generate network topology of optimum number of clusters, the nodes energy is reduced greatly and the lifetime of networks is extended.
An open system for transparent firewall authentication and user traffic identification within corporate intranets
Authors: Roberto D. Rubino
Venue: Proceedings of the 9th ACM SIGITE conference on Information technology education (2008)

Classical firewalls provide network security by matching a network flow's 5-tuple information against user defined packet filters loaded into memory. In today's dynamic network environments where threats can be both outside and inside a network, it is not sufficient to simply identify the originator of a data packet by a source address and port pair. It is necessary to identify the user or entity responsible for the transmission. An open and vendor neutral authentication scheme inspired by the IPSEC Authentication Header is presented which allows for the creation of firewall packet filters based on user identity.
Feature-Weighted User Model for Recommender Systems
Authors: Panagiotis Symeonidis, Alexandros Nanopoulos, Yannis Manolopoulos
Venue: Proceedings of the 11th international conference on User Modeling (2007)

Recommender systems are gaining widespread acceptance in e-commerce applications to confront the "information overload" problem. Collaborative Filtering (CF) is a successful recommendation technique, which is based on past ratings of users with similar preferences. In contrast, Content-Based filtering (CB) assumes that each user operates independently. As a result, it exploits only information derived from document or item features. Both approaches have been extensively combined to improve the recommendation procedure. Most of these systems are hybrid: they run CF on the results of CB and vice versa. CF exploits information from the users and their ratings. CB exploits information from items and their features. In this paper, we construct a feature-weighted user profile to disclose the duality between users and features. Exploiting the correlation between users and features we reveal the real reasons of their rating behavior. We perform experimental comparison of the proposed method against the well-known CF, CB and a hybrid algorithm with a real data set. Our results show significant improvements, in terms of effectiveness.
Unfavorable Strides in Cache Memory Systems (RNR Technical Report RNR-92-015)
Authors: David H. Bailey
Venue: Scientific Programming (1995)

An important issue in obtaining high performance on a scientific application running on a cache-based computer system is the behavior of the cache when data are accessed at a constant stride. Others who have discussed this issue have noted an odd phenomenon in such situations: A few particular innocent-looking strides result in sharply reduced cache efficiency. In this article, this problem is analyzed, and a simple formula is presented that accurately gives the cache efficiency for various cache parameters and data strides.
Model Screening: How to Choose the Best Fitting Regression Model?
Authors: Stefan W. Roeder, Matthias Richter, Olf Herbarth
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

The problem space in epidemiological research is characterized by large datasets with many variables as candidates for logistic regression model building. Out of these variables the variable combinations which form a sufficient logistic regression model have to be selected. Usually methods like stepwise logistic regres`sion apply.These methods deliver suboptimal results in most cases, because they cannot screen the entire problem space which is formed by different variable combinations with their resulting case set. Screening the entire problem space causes an enormous effort in computing power. Furthermore the resulting models have to be judged. This paper describes an approach for calculating the complete problem space using a computer grid as well as quality indicators for judgement of every particular model in order to find the best fitting models.We are using this system for epidemiological studies addressing specific problems in human epidemiology.
A Concise Introduction to Software Engineering, 1 edition
Authors: Pankaj Jalote
Venue: Undergraduate Topics In Computer Science (2008)

Software engineering is an integral part of studies in computer science and consequently foundational knowledge is critical to all students in the field. This text focuses on the essential elements, providing readers with the basic skills and introductory knowledge required to execute a software project successfully. Following the winning formula and easy-to read style of the authors previous An Integrated Approach to Software Engineering, this reader-friendly text is written specifically for undergraduates as an introduction to this broad-ranging discipline. With a strong emphasis on practice, this textbook takes a step-by-step approach whereby the key tasks involved in a project are discussed through the course of the book, illustrating the different activities involved in software development. Features and topics: Discusses core concepts and techniques in an introductory easy-to-follow approach Offers a solid foundation to this wide-ranging topic Focuses only on the essential elements required to complete a software project effectively Takes the reader through the project life cycle - applying concepts to practice Teaches the skills needed to execute a small commercial project Provides the necessary conceptual background for further study in software engineering Concentrates on the two key tasks: Engineering and project management Each chapter covers one of the key tasks involved in a project Includes helpful learning tools such as chapter introductions, chapter goals and self-assessment exercises Teaching support (such as chapter slides, templates and a case study) and supplemental resources are available via http://www.cse.iitd.ac.in/~jalote/ConciseIntroToSE Presents practical methods and notations for performing given tasks within each chapter Designed for undergraduates and bolstered with numerous examples, this text imparts to the reader the fundamental knowledge, skills, practices and techniques within software engineering. It will also be helpful for professionals who know programming but want to be introduced to the formal systematic approach of software engineering.
An Individual-Based Model of Influenza in Nosocomial Environments
Authors: Boon Som Ong, Mark Chen, Vernon Lee, Joc Cing Tay
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

Traditional approaches in epidemiological modeling assume a fully mixed population with uniform contact rates. These assumptions are inaccurate in a real epidemic. We propose an agent-based and spatially explicit epidemiological model to simulate the spread of influenza for nosocomial environments with high heterogeneity in interactions and susceptibilities. A field survey was conducted to obtain the activity patterns of individuals in a ward of Tan Tock Seng Hospital in Singapore. The data collected supports modeling of social behaviors constrained by roles and physical locations so as to achieve a highly precise simulation of the ward's activity. Our results validate the long-standing belief that within the ward, influenza is typically transmitted through staff and less directly between patients, thereby emphasizing the importance of staff-oriented prophylaxis. The model predicts that outbreak size (and attack rate) will increase exponentially with increasing disease infectiousness beyond a certain threshold but eventually tapers due to a target-limited finite population. The latter constraint also gives rise to a peak in epidemic duration (at the threshold level of infectiousness) that decreases to a steady value for increasing infectiousness. Finally, the results show that the rate of increase in distinct cumulated contacts will be highest within the first 24 hours and gives the highest yield for contact tracing among patients that had prolonged periods of non-isolation. We conclude that agent-based models are a necessary and viable tool for validating epidemiological beliefs and for prediction of disease dynamics when local environmental and host factors are sufficiently heterogeneous.
Programming in Vienna Fortran
Authors: Barbara Chapman, Piyush Mehrotra, Hans Zima
Venue: Scientific Programming (1992)

Exploiting the full performance potential of distributed memory machines requires a careful distribution of data across the processors. Vienna Fortran is a language extension of Fortran which provides the user with a wide range of facilities for such mapping of data structures. In contrast to current programming practice, programs in Vienna Fortran are written using global data references. Thus, the user has the advantages of a shared memory programming paradigm while explicitly controlling the data distribution. In this paper, we present the language features of Vienna Fortran for FORTRAN 77, together with examples illustrating the use of these features.
A Product Design Using an S-Shaped and C-Shaped Transition Curves
Authors: Saifudin Hafiz Yahaya, Jamaludin Md. Ali, Muhammad Hafidz Fazli Md. Fauadi
Venue: Proceedings of the 2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation (2008)

This paper proposes a design technique using an S-shaped and C-shaped transition curves. A simple algorithm will be proposed in this paper where this algorithm will be based on Habib and Sakai [1]. In order to use this algorithm, a few constraints are considered such as the continuity, control points, curvature, radius etc. In this paper, we will apply this algorithm to design a spur gear tooth and vase in the two and three dimensional. The function involved is Bézier like cubic function with the smoothness is G2 continuity.
Dispositional Factors in the Use of Social Networking Sites: Findings and Implications for Social Computing Research
Authors: Peter A. Bibby
Venue: Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics (2008)

The paper presents findings of a study that relates dispositional factors such as extroversion, stability, self-esteem and narcissism to the use of social networking sites (SNSs). Each of these dispositional factors is shown to be related to different types of usage of SNSs. It is argued that attempts to model the use of SNSs and thereby target particular information to particular users would benefit greatly from using modeling techniques that can parameterize such dispositional factors.
A Key Predistribution Scheme Based on 3-Designs
Authors: Junwu Dong, Dingyi Pei, Xueli Wang
Venue: Information Security and Cryptology: Third SKLOIS Conference, Inscrypt 2007, Xining, China, August 31 - September 5, 2007, Revised Selected Papers (2007)

In wireless distributed sensor networks, it is important for sensor nodes to communicate securely each other. In order to ensure this security, many approaches have been proposed recently. One of them is to use key predistribution scheme (KPS). In this paper, we shall use the Möbius plane to present a key predistribution scheme for distributed sensor networks. The secure connectivity and resilience of the resulting sensor network will be analyzed in this paper. This KPS constructed in our paper has some better properties than the ones of KPSs constructed in [5],[7] and [9].
A Reliable Transmission Strategy in Unreliable Wireless Sensor Networks
Authors: Zhendong Wu, Shanping Li
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

Recent empirical and theoretical studies have shown that wireless links in low-power sensor networks are unreliable. Obviously, it is not a good choice for sensor networks that transmitting data unreliably, which will bring many problems to the networks, such as uncertainty, performance-decline, and so on. In this paper, a novel transmission strategy for reliable transmitting over unreliable links is proposed. Based on the observation that the broadcast nature of the wireless communications has the potential that allows all neighbors receive and process the packets simultaneously, we suggest that using a nodes-set, instead of one node, to receive and relay packets. The key idea is that receiving packets simultaneously and relaying packets competitively. Theoretical and experimental analysis demonstrates that the new strategy can provide reliable transmitting over unreliable links meanwhile improves the performance of networks significantly.
Distributed Implementation of OpenMP Based on Checkpointing Aided Parallel Execution
Authors: Éric Renault
Venue: Proceedings of the 3rd international workshop on OpenMP: A Practical Programming Model for the Multi-Core Era (2007)

Checkpointers are used to secure the execution of sequential and parallel programs. This article shows that they can also be used to generate a parallel program from a sequential program automatically, this program being executed on any kind of distributed parallel system. The article also presents how this new technique can be included inside the usual compilation chain to provide a distributed implementation of OpenMP. Finally, some performance measurements are discussed.