ppxscal/embedding_network huggingface dataset:
An Adaptive GTS Allocation Scheme for IEEE 802.15.4
Authors: Yu-Kai Huang, Ai-Chun Pang, Hui-Nien Hung
Venue: IEEE Transactions on Parallel and Distributed Systems (2008)

IEEE 802.15.4 is a new standard uniquely designed for low-rate wireless personal area networks. It targets ultra-low complexity, cost, and power for low-rate wireless connectivity among inexpensive, portable, and moving devices. IEEE 802.15.4 provides a Guaranteed Time Slots (GTS) mechanism to allocate a specific duration within a superframe for time-critical transmissions. This paper proposes an adaptive GTS allocation (AGA) scheme for IEEE 802.15.4 which considers low-latency and fairness. The scheme is designed based on the existing IEEE 802.15.4 medium access control protocol, and IEEE 802.15.4 devices can receive this AGA service without any modification. A simulation model and an analytical model are developed to investigate the performance of our AGA scheme. The numerical results show that the proposed scheme significantly outperforms the existing IEEE 802.15.4 implementation.
Development of a Human Biorepository Information System at the University of Kentucky Markey Cancer Center
Authors: Sujin Kim
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Modern molecular-based studies increasingly require human biological samples. To systematically support data management for the University of Kentucky (UK) Markey Cancer Center’s (MCC) Biospecimen Core Tissue Bank (BCTB), the UK-Biorepository Information System (BIS) was designed and implemented. The BCTB was funded by the Kentucky Lung Cancer Program, which emphasizes lung tissues, matched serum, plasma, white blood cells, and buffy-coats collected from donors seen in the MCC Multidisciplinary Lung Cancer Clinic and other selected clinics. Essential sub-modules--the user, the project, the storage, the annotation, the distribution, and the search management--were included in the UK-BIS. As of July 2006, a total of 11,940 samples from 894 patients have been recorded and housed at the Kentucky Cancer Registry server for its secure and consistent system administration.
On partitioning graphs via single commodity flows
Authors: Lorenzo Orecchia, Leonard J. Schulman, Umesh V. Vazirani, Nisheeth K. Vishnoi
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

In this paper we obtain improved upper and lower bounds for the best approximation factor for Sparsest Cut achievable in the cut-matching game framework proposed in Khandekar et al. [9]. We show that this simple framework can be used to design combinatorial algorithms that achieve O(log n) approximation factor and whose running time is dominated by a poly-logarithmic number of single-commodity max-flow computations. This matches the performance of the algorithm of Arora and Kale [2]. Moreover, we also show that it is impossible to get an approximation factor of better than Ω(√log n) in the cut-matching game framework. These results suggest that the simple and concrete abstraction of the cut-matching game may be powerful enough to capture the essential features of the complexity of Sparsest Cut.
Timed environment for web agents
Authors: Andrea Omicini, Alessandro Ricci, Mirko Viroli
Venue: Web Intelligence and Agent Systems (2007)

Governing interaction, and in particular intra-system, inter-component interaction, is essential in the engineering of non-trivial multi-component systems. This also holds for Web-based systems &agrave; today the most relevant and widespread sort of distributed software system. Agent models and technologies are among the most promising approaches to the engineering of Web applications. In particular, agent coordination infrastructures aim at harnessing the complexity of interaction within MASs (multiagent systems), by providing agents and engineers with coordination artifacts, which shape agent environment by governing agent-to-agent and agent-to-environment interactions. Horizontal integration of Web infrastructure with agent coordination infrastructure is then a key issue in the engineering of agent-based Web applications. In this paper, we focus on the problem of time: time is essential in a large number of Web coordination scenarios and patterns - involving timeouts, obligations, commitments, etc. Along this line, we first discuss the notion of coordination artifact and its relation to agent environment. Then we discuss a notion of timed environment for Web agents, and show how it can be enforced through suitably-extended timed coordination artifacts. In particular, we adopt TuCSoN tuple centres (along with the ReSpecT language for programming them) as our concrete representatives for coordination artifacts, and show how they can be extended to catch with time, and to support the definition and enforcement of time-aware coordination policies. A Web-based agent workflow is finally presented as a case study, and used to demonstrate the expressiveness of the ReSpecT language to model timed coordination primitives and laws.
Ad Hoc Collaborative Filtering for Mobile Networks
Authors: Patrick Gratz, Adrian Andronache, Steffen Rothkugel
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

This work introduces a recommender system designed to augment the information discovery and dissemination in mobile networks. We use the system to optimize the podcast providing mechanism of the HyCast application. The presented recommender system is based on collaborative filtering and provides two different algorithms to determine similar network neighbors, which are used to incrementally build up a locally stored model for the final prediction calculation.
An efficient multilateral negotiation system for pervasive computing environments
Authors: Sanghyun Park, Sung-Bong Yang
Venue: Engineering Applications of Artificial Intelligence (2008)

In this paper we propose an automated negotiation system that can efficiently carry out multilateral negotiations with multi-attributes in pervasive computing environments. For the multilateral negotiation system proposed in our study, an e-commerce framework for pervasive computing environments in which the components can dynamically join and disjoin a virtual market is also introduced. This framework overcomes the locality of pure ad hoc networks and supports efficiently multilateral negotiation models in pervasive computing environments. In order to achieve the applicability toward multilateral negotiations, the concept of a mediator agent and the bilateral negotiation scheme based on linear programming is utilized for the proposed system. The experimental results show that the proposed system produces higher joint profits in negotiations about 5% and is about 96 times faster in reaching agreements on the average under the condition of agreement for reciprocity than a negotiation system based on the trade-off mechanism.
Process variation tolerant SRAM array for ultra low voltage applications
Authors: Jaydeep P. Kulkarni, Keejong Kim, Sang Phill Park, Kaushik Roy
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

In this work, we propose a Schmitt Trigger (ST) based differential sensing SRAM bitcell that can operate at ultra-low supply voltage. The proposed Schmitt Trigger SRAM cell addresses the fundamental conflicting design requirement of read versus write operation of a conventional 6T cell. Schmitt Trigger operation gives better read-stability and as well as better writeability compared to the standard 6T cell. The proposed ST bitcell incorporates a built-in feedback mechanism, achieving process variation tolerance - a must for future nano-scaled technology nodes. Measurements on 10 test-chips fabricated in 130nm technology show that the proposed Schmitt Trigger bitcell gives 58% higher read Static Noise Margin (SNM), 2X higher writetrip-point and 120mV lower read Vmin compared to the conventional 6T cell. The ST SRAM array is operational at 150mV of supply voltage.
A Hybrid Design Framework for Video Streaming in IEEE 802.11e Wireless Network
Authors: Hung-Chin Jang, Yu-Ti Su
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Over the past decade, wireless network access and video streaming services have become more popular than ever. However, IEEE 802.11 DCF and IEEE 802.11e EDCA are not specifically designed for video streaming. This leads to the problem of transmitting overdue video packets and thus degrades both network performance and video quality. In this paper, we propose a hybrid design framework which consists of a MAC-centric cross-layer architecture to allow MAClayer to retrieve video streaming packet information, a hybrid retransmission deadline and retry limit to save unnecessary packet waiting time, and a single-video multi-level queue to prioritize I/P/B slice (packet) delivery. Simulations show that the proposed methodology outperforms IEEE 802.11, IEEE 802.11 Timebase and IEEE 802.11e in packet loss rate, invalid packet ratio, delay time, jitter, and PSNR.
Reduce Time Synchronization Cost for High Latency and Resource-Constrained Sensor Networks
Authors: Yi Wang, Benxiong Huang, Furong Wang, Fan Zhang
Venue: Proceedings of the Seventh International Conference on Networking (2008)

For emerging resource-constrained sensor networks, energy efficiency and computation simplicity could be as important as precision. Existing terrestrial synchronization protocols have already achieved high precision in radio networks, but none of them perform well in high latency networks like underwater acoustic sensor networks: they either assume instantaneous packet transmission between nodes, or ignore clock drift during synchronization process. By addressing these problems, the recent proposed TSHL protocol provides precise time synchronization for high latency networks. However, due to its high energy and computation consumption, original TSHL design is still not practical in resource-constrained applications such as sensor networks which have stringent constraints on system resources. The main results of this paper are as follows. First, we present a complete mathematical analysis of TSHL which is lack in the original paper. Dominant factors of errors are clarified, as well as communication and computation cost functions. We prove that even with as less as 3 beacon messages, an acceptable precision level can be achieved by increasing beacon messages interval. In this lightweight synchronization, communication and computation cost for the synchronization process are greatly reduced, which is critical for those high latency and resource-constrained sensor networks.
A modular environment for e-learning and e-psychology applications
Authors: A. S. Drigas, G. Stavridis, L. Koukianakis
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

This paper presents a modular electronic environment for e-learning and e-psychology applications. Our work is based on the modularity and adaptability achieved via the ICT and Internet tools that provide authoring services of e-content (i.e. examples, exercises, multiple choices, glossary, references, e-library, announcements, web links) and asynchronous communication (i.e. discussion forums, message box). The distributed, interoperable and user-friendly architecture implemented allows the existence of different user levels depending on their role. Moreover, the environment supports different education scenarios, in a virtual classroom, as well as collaborative learning-consulting via e-psychology applications both for small groups and for individuals.
QUORUM: quality of service in wireless mesh networks
Authors: Vinod Kone, Sudipto Das, Ben Y. Zhao, Haitao Zheng
Venue: Mobile Networks and Applications (2007)

Wireless mesh networks (WMNs) can provide seamless broadband connectivity to network users with low setup and maintenance costs. To support next-generation applications with real-time requirements, however, these networks must provide improved quality of service guarantees. Current mesh protocols use techniques that fail to accurately predict the performance of end-to-end paths, and do not optimize performance based on knowledge of mesh network structures. In this paper, we propose QUORUM, a routing protocol optimized for WMNs that provides accurate QoS properties by correctly predicting delay and loss characteristics of data traffic. QUORUM integrates a novel end-to-end packet delay estimation mechanism with stability-aware routing policies, allowing it to more accurately follow QoS requirements while minimizing misbehavior of selfish nodes.
Query-Based Summarization for Search Lists
Authors: Xinghuo Ye, Hai Wei
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

In this paper we describe a Query-based summarization system. We propose a practical approach for this task by identifying the sentences with high query-relevant and high information density. This paper introduces a statistical model for query-relevant summarization: adopt Word overlap feature to capture the power of correlation with the query and mine the relations between the sentences. While the first is executed by computing semantic similarity between the sentence and the query, and the other is executed by using semantic graph. Then these two kinds of features are blessed to score each sentence. At last with the help of MMR for reducing redundancy, we get the summary. Experimental results indicate that this method is encouraging for both those retrieved documents that correspondingly concentrating to one subject and retrieved documents who have many subtopics and comparatively being related to the query.
A Survey of Current Directions in Service Placement in Mobile Ad-hoc Networks
Authors: Georg Wittenburg, Jochen Schiller
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

Service placement deals with the problem of selecting which node in a network is most suitable for hosting a service that responds to queries from other nodes. Optimally placing services reduces network traffic and improves connectivity between clients and servers. Service placement algorithms may thus be regarded as an interesting building block for research into service-oriented middleware. Recently, new approaches to address the service placement problem in the field of ad-hoc networking have been proposed. This paper surveys, classifies and evaluates ten representative approaches, thereby providing a summary of the state of the art in service placement.
NFC Devices: Security and Privacy
Authors: Gerald Madlmayr, Josef Langer, Christian Kantner, Josef Scharinger
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

The aim of this paper is to show security measures for NFC (Near Field Communication) use cases and devices. We give a brief overview over NFC technology and evaluate the implementation of NFC in devices. Out of this technology review we derive different use cases and applications based on NFC technology. Based on the use cases we show assets and interfaces of an NFC device that could be a possible target of an attacker. In the following we apply different attacks against the operation modes to show how applications and devices could be protected against such attacks. The information collected is consolidated in a set of threats giving guidelines on how to improve security and overcome privacy issues. This allows integrating NFC technology in a secure way for the end consumer.
Towards a more physical approach to gate modeling for timing, noise, and power
Authors: Peter Feldmann, Soroush Abbaspour
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Timing, noise, and power analysis have historically relied on high level, black-box, non-physical logic library models. Moreover, these models were of a look-up type, i.e. precharacterized for practically all the possible environments in which they would be eventually used. The evolution of the VLSI technology towards nanometer sized features made this characterization methodology impractical. Increasingly, the space of all possible environments grew too rich to be fully covered during characterization. In the past decade, the so-called effective capacitance was introduced to provide some analysis capability to gate models, i.e., the ability to evaluate in the presence of RC loads, although characterized with capacitive loads only. In current and future VLSI technologies, such simple extensions no longer provide the required accuracy. Increasingly, models of logic gates must retain elements of the electrical behavior of the circuit in order to provide accurate timing, noise, and power information. This poses a new challenge on the analysis algorithms, now required to handle an enhanced level of detail in modeling without significantly degrading the overall efficiency of the application.
Teaching with the GridWorld case study
Authors: Paul T. Tymann, Frances P. Trees
Venue: Journal of Computing Sciences in Colleges (2008)

Case studies expose students to large programs, enabling them to understand the importance of design and good programming style while encouraging teamwork and active learning. While there are some excellent sources of good programming examples, most are not at the CS-1 level. Creating an appropriate program to illustrate the key ideas of CS-1 is one of the largest obstacles. Fortunately, there are some existing case studies which can be used. The AP Computer Science curriculum has used case studies since 1995 and performance on case study exam questions shows a significantly smaller score difference between males and females than non-case study questions. Beginning this year, the AP CS curriculum includes the GridWorld Case Study. The first portion of the workshop will introduce the participants to the GridWorld environment allowing them to explore GridWorld through a series of guided activities which demonstrate inheritance and class interaction. During the second portion of the workshop participants will be shown examples of how the GridWorld Case Study can be used in a typical Computer Science 1 course.
Self-stabilizing algorithm for high service availability in spite of concurrent topology changes in ad hoc mobile networks
Authors: Abdelouahid Derhab, Nadjib Badache
Venue: Journal of Parallel and Distributed Computing (2008)

Mobile nodes in ad hoc networks move freely and run out of battery power so quickly, which leads to frequent network partitioning. Network partitioning considerably reduces service availability when the server node is not in the same partition as the client nodes. In order to provide a continuous service availability for all mobile nodes, we propose a self-stabilizing algorithm that can tolerate multiple concurrent topological changes and can incur a cost of one server per long-lived connected component. By using (1) the time interval-based computations concept that distinguishes between disjoint and concurrent computations, and (2) Markov chain model, the proposed algorithm can within a finite time converge to a legitimate state even if topological changes occur during the convergence time. Our simulation results show that the algorithm can ensure very high service availability, and each node has a strong path to the server of its network component over 98% of the time.
Toward a New Generation of Semantic Web Applications
Authors: Mathieu d'Aquin, Enrico Motta, Marta Sabou, Sofia Angeletou, Laurian Gridinoc, Vanessa Lopez, Davide Guidi
Venue: IEEE Intelligent Systems (2008)

First-generation Semantic Web applications typically use one ontology—or at most, a few—that ontology engineers built, selected, and integrated at design time. In contrast, the next generation of Semantic Web applications will dynamically exploit the Semantic Web as a large-scale source of distributed knowledge. The authors have implemented several next-generation applications and have gained, in the process, insights about the Semantic Web's current status, strengths, and limitations. An analysis of their initial results also indicates near-future directions for the Semantic Web, as well as upcoming challenges and opportunities. This article is part of a special issue called Semantic Web Update.
Implementation of Flow Binding Mechanism
Authors: Tanguy Ropitault, Nicolas Montavont
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

The paper presents an implementation of flow binding in Nepl, theNEMO Basic Support (Nemo BS) and Mobile IPv6 implementation for Linux. Flowbinding is an extension to Nemo BS and Mobile IPv6 toexchange policy routing information between a distant node and themobile node / router. This paper also presents an evaluation whichshows that the implementation is working and which benefit a mobilenetwork can reach by using flow binding extensions.
Energy efficient multi-path communication for time-critical applications in underwater sensor networks
Authors: Zhong Zhou, Jun-Hong Cui
Venue: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing (2008)

Due to the long propagation delay and high error rate of acoustic channels, it is very challenging to provide reliable data transfer for time-critical applications in an energy-efficient way. On the one hand, traditional retransmission-upon-failure usually introduces very large end-to-end delay, thus is not proper for time-critical services. On the other hand, common approaches without retransmission consume lots of energy. In this paper, we propose a new multi-path power-control transmission (MPT) scheme, which can guarantee certain end-to-end packet error rate while achieving a good balance between the overall energy efficiency and the end-to-end packet delay. MPT smartly combines power control with multi-path routing and packet combining at the destination. With carefully designed power control strategies, MPT consumes much less energy than the conventional one-path transmission scheme without retransmission. Besides, since no hop-by-hop retransmission is allowed, MPT introduces much shorter delay than the traditional one-path scheme with retransmission. We conduct extensive simulations to evaluate the performance of MPT. Our results show that MPT is highly energy efficient with low end-to-end packet delays.
The development of software and hardware for marble cutting tests
Authors: Hasan Çimen, Said Mahmut Çinar, Mustafa Nartkaya
Venue: Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications (2008)

Academicians and lots of laboratories intensively use PC based equipments for their experiments. PC based systems are lots of advantages; rapidly, functionality, low cost, adaptability, attractive. PC based systems can also be used industrial environments for improving productivity. In this paper, a marble test machine fully controlled by PC is presented. The PC based marble test machine is designed for experimental tasks such as determining suitable cutting parameters, developing saw blade performance and marble cutting with optimum electric energy. Presented PC based marble test machine whereby an experimental test machine was carried out to obtain precise results.