ppxscal/embedding_network huggingface dataset:
An asynchronous MAC protocol for wireless sensor networks
Authors: Wen-Hwa Liao, Hsiao-Hsien Wang
Venue: Journal of Network and Computer Applications (2008)

The MAC protocol for wireless sensor network plays a very important role in the control of energy consumption. It is a very important issue to effectively utilize power under the condition of limited energy. The most energy-wasting part of the MAC protocol for wireless sensor network is at the idling condition. Therefore it is crucial for power saving to be able to turn off the signal transducer of the wireless network when the equipment is idling. Pattern-MAC (PMAC) allows sensors that did not transfer for a long period of time to quickly enter a dormant state, so that the problem of sensor overhearing can be greatly improved, and the whole network structure can fully respond to the actual transfer rate without too much energy consumption, but this type of design requires precise time synchronization mechanism. Achieving time synchronization is a very energy consuming and very expensive mechanism in the sensor network structure, achieving the goal is coupled with excess energy consumption and reduction of the lifespan of the sensor. Additionally, the exchange action with the neighboring pattern after each cycle, not only generates additional energy consumption for data transfer, but is also accompanied by factors such as competition, collision and pattern exchange failure. We propose an asynchronous MAC protocol (AMAC) in this paper and expect to improve the problem of energy wasting and time synchronization due to sleeping schedule exchange under the PMAC basic protocol.
On a theory of computation over the real numbers; NP completeness, recursive functions and universal machines
Authors: L. Blum
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

A model for computation over an arbitrary (ordered) ring R is presented. In this general setting, universal machines, partial recursive functions, and NP-complete problems are obtained. While the theory reflects of classical over Z (e.g. the computable functions are the recursive functions), it also reflects the special mathematical character of the underlying ring R (e.g. complements of Julia sets provide natural examples of recursively enumerable undecidable sets over the reals) and provides a natural setting for studying foundational issues concerning algorithms in numerical analysis.
Comparing the Conceptual Graphs Extracted from Patent Claims
Authors: Shih-Yao Yang, Von-Wun Soo
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

A patent claim defines the protection of the invention. It is usually very time consuming and laborious to manually conduct analysis on patents in any domain of interest. A maximal common edge subgraph (MCES) is a subgraph consisting of the largest number of edges common between two graphs G and G'. This paper automatically compares conceptual graphs, extracted from patent claims by an NLP parser, using anchored relaxation labeling.
Individual trust development in computer mediated teamwork
Authors: Xusen Cheng, Linda Macaulay, Alexandros Zarifis
Venue: Proceedings of the hypertext 2008 workshop on Collaboration and collective intelligence (2008)

Facilitated group collaboration is evolving into a new generation in Web 2.0 using new technology such as online group systems. Building trust is vital to group collaboration. Risk, benefit, utility value, power and interest are six factors that influence individual trust development. This paper further develops the Scale Balance Model based on the Individual Trust Development Model in order to investigate individual trust development in facilitated group collaboration. There is a two stage investigation using a survey from face-to-face student groups with Web based group system support. The model is used to analyse the individual trust development in the sample. The results of applying the improved model can help give feedback and advice for future collaboration research.
Celestial3D
Authors: Angeline M. Loh, Steven Wiltshire, Jon Emery, Kim W. Carter, Lyle J. Palmer
Venue: Bioinformatics (2008)

Summary: Traditional two-dimensional (2D) software programs for drawing pedigrees are limited when dealing with extended pedigrees. In successive generations, the number of individuals grows exponentially, leading to an unworkable amount of space required in the horizontal direction for 2D displays. In addition, it is not always possible to place closely related individuals near each other due to the lack of space in 2Ds. To address these issues we have developed three-dimensional (3D) pedigree drawing techniques to enable clearer visualization of extended pedigrees. Currently no other methods are available for displaying extended pedigrees in 3Ds. We have made freely available a software tool—‘Celestial3D’—that implements these novel techniques. Availability: Freely available to non-commercial users Contact: celestial3d@genepi.org.au Supplementary information: www.genepi.org.au/celestial3d
On multiword entity ranking in peer-to-peer search
Authors: Yuval Merhav, Ophir Frieder
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Previously [2], we postulated the advantage of using entity extraction to implement a new Peer-to-Peer (P2P) search framework for reducing network traffic and providing a trade off between precision and recall. We now propose an entity ranking method designed for the 'short documents' characteristic of P2P, which significantly improves both precision and recall in 'top results' P2P search. We construct a dynamic entity corpus using n-grams statistics and metadata, study its reliability, and use it to identify correlations between user query terms.
Delay-dependent stability analysis for impulsive neural networks with time varying delays
Authors: Shujun Long, Daoyi Xu
Venue: Neurocomputing (2008)

In this paper, the global exponential stability and global asymptotic stability of the neural networks with impulsive effect and time varying delays is investigated. By using Lyapunov-Krasovskii-type functional, the quality of negative definite matrix and Cauchy criterion, we obtain the sufficient conditions for global exponential stability and global asymptotic stability of such model, in terms of linear matrix inequality (LMI), which depend on the delays. Two examples are given to illustrate the effectiveness of our theoretical results.
Fast adaptive wavelet for remote sensing image compression
Authors: Bo Li, Run-Hai Jiao, Yuan-Cheng Li
Venue: Journal of Computer Science and Technology (2007)

Remote sensing images are hard to achieve high compression ratio because of their rich texture. By analyzing the influence of wavelet properties on image compression, this paper proposes wavelet construction rules and builds a new biorthogonal wavelet construction model with parameters. The model parameters are optimized by using genetic algorithm and adopting energy compaction as the optimization object function. In addition, in order to resolve the computation complexity problem of online construction, according to the image classification rule proposed in this paper we construct wavelets for different classes of images and implement the fast adaptive wavelet selection algorithm (FAWS). Experimental results show wavelet bases of FAWS gain better compression performance than Daubechies9/7.
Proposed methodology for georeferencing and mosaicking Corona photographs
Authors: H. Hamandawana, F. Eckardt, S. Ringrose
Venue: International Journal of Remote Sensing (2007)

A practically based user-friendly methodology to accurately georeference and colour balance Corona photographs for large area coverages without compromising information content by downgrading their high spatial resolution is presented. Tapping on a range of techniques provided in the Erdas Imagine environment, the procedures laid out in this paper go a step further than normal software guidelines by providing improvised techniques that are graphically illustrated by reference to a study area (the Okavango Delta in northern Botswana) covering about 65 000 km2 to allow the reader to assimilate the sequence of steps involved. With self evident usable results in the form of a 2 m-resolution seamless mosaic providing blanket coverage for the above stated area on 15 September 1967, it is apparent that similar initiatives elsewhere can take advantage of our proposed methodology in putting together what is retrievable from the archives by building databases that extend time horizons into the historical past for use in long-term environmental monitoring.
Parasitic Aware Process Variation Tolerant Voltage Controlled Oscillator (VCO) Design
Authors: Dhruva Ghai, Saraju P. Mohanty, Elias Kougianos
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

In this paper we present a parasitic aware, process variation tolerant optimization methodology that may be applied to nanoscale circuits to ensure better yield. A current-starved voltage controlled oscillator (VCO) is treated as a case study and to the best of the authors' knowledge, this is the first VCO design that accounts for both parasitic degradation and process variation together. The physical design of the VCO is carried out in a generic 90 nm Salicide 1.2 V / 2.5 V 1 Poly 9 Metal process design kit. The oscillation frequency is the objective function with the area overhead as constraint. A performance degradation of 43.5 % is observed when the parasitic extracted circuit was subjected to worst case process variation. After a single physical design iteration, the frequency of oscillation was within 4.5 % of the target.
Superposing Beats: A Novel Method for High-Precision Indoor Localization
Authors: Matthias Schneider, Ralf Salomon
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

While being very successful in everyday life, GPS-based localization systems exhibit limited performance under certain circumstances, such as under trees, behind walls, and in closed rooms. In addition,they sometimes induce costs that are way too high to be acceptable for some applications. This paper addresses these problems by exploring a novel localization procedure that is based on beats and pattern recognition. Because of its low-cost properties and simple technical requirements, this system might be interesting for application areas, such as ubiquitous computing, ambient intelligence, high-precision indoor localization, and sensor networks.
Watermarking oriented video modelling in the wavelet domain
Authors: Mihai Mitrea, Francoise Preteux, Adriana Vlad
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

This paper presents an original statistical approach enabling: (1) to accurately model video sequences in the wavelet domain as Gaussian laws and (2) to prove experimentally and a posteriori an ergodicity behaviour for video sequences. By partitioning the wavelet coefficients into classes with independent elements, we rigorously handle the dependency existing among the successive frames in the video sequence. Further on, four statistical tests are applied to each class in the partition, namely: the Chi-square test on concordance with a probability law, the Ro test on correlation, the Fisher F test on equality between two variances and the Student T test on equality between two means. These tests make it possible to: (1) enable the Gaussian law to be checked up, (2) validate the data partition and (3) reveal an homogeneity behaviour among the classes in the partition. Finally, the obtained results are fusioned so as to provide a global information characterising the whole sequence. We integrated these results within a spread spectrum video watermarking scheme which meets all the requirement stated nowadays: transparency, robustness, obliviousness and probability of false alarm lower than 16-16.
Enhancing keyword-based botanical information retrieval with information extraction
Authors: Xiaoya Tang
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Keyword-based retrieval matches search terms and documents via term co-occurrence. Such an approach does not allow matching based on the specific plant characteristic descriptions that are often used in botanical text retrieval. This study applies information extraction techniques to automatically extract plant characteristic information from text and allows users to search using such information in combination with keywords. An evaluation experiment was conducted using actual users. The results indicate that this approach enhances task-based retrieval performance.
Data Quality in Traditional Chinese Medicine
Authors: Yi Feng, Zhaohui Wu, Huajun Chen, Tong Yu, Yuxin Mao, Xiaohong Jiang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Data quality is a key issue in medical informatics and bioinformatics. Although many researches could be found that discuss data quality in the area of health care and medicine, few literature exist that particularly focuses on data quality in the field of traditional Chinese medicine (TCM). Due to the high domain-specificity of data quality, it is of essential necessity to identify key dimensions of data quality in TCM. In this paper, based on TCM practice in past years, three data quality aspects are highlighted as key dimensions, including representation granularity, representation consistency, and completeness. Moreover, practical methods and techniques to handle data quality problems in these dimensions are also provided, showing how to enhance data quality in TCM field.
Comparative evaluation of multi-core cache occupancy strategies
Authors: Feiqi Su, Xudong Shi, Gang Liu, Ye Xia, Jih-Kwon Peir
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

Intelligent sharing cache space among multiple cores on a Chip Multiprocessor (CMP) has become an important research topic. There are many design options to trade-off and many possible performance metrics to evaluate. It generally requires costly simulations to gain insights over a wide-spectrum of cache sharing and partitioning methods. In this paper, we use an efficient single-pass stack simulation method to understand the effectiveness of cache sharing through natural competition (i.e. shared cache) and through static or dynamic cache partitioning, such as equal partition, utility-based partition, etc. The results demonstrate that cache occupancy through natural competition favors the core with more frequently misses. It may take away the needed space for other cores and increase the overall miss ratio. Furthermore, we find that the existing cache partitioning schemes based on fixed-length portioning phases may not be optimal compared with the scheme that allows variable phase lengths.
A course in collaborative computing: collaborative learning and research with a global perspective
Authors: Tony Clear, Diana Kassabova
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

Recent calls for a new discipline of 'web science' have proposed extending computer science to incorporate the social dimensions of computing. In this paper we outline a Masters course in Collaborative Computing, which employs a combination of collaborative pedagogy, collaborative technologies, and a corpus of research data from Global Virtual Teams to blend the technology and the social dimensions within a research linked course context. We review the effectiveness of this model of learning and the conduct of the course over the five years since its inception.
IDMTM: A Novel Intrusion Detection Mechanism Based on Trust Model for Ad Hoc Networks
Authors: Furong Wang, Chen Huang, Jing Zhao, Chunming Rong
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

An Ad hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure, so they are vulnerable to many attacks and the security of the network can not be ensued. In this paper, we present a novel Intrusion Detection Mechanism based on the Trust Model (IDMTM) for mobile Ad hoc networks. In IDMTM, we employ two new concepts: “Evidence Chain (EC)” and “Trust Fluctuation (TF)” to accurately evaluate the trust value of a node in the network for judging whether it is malicious or not. Comparing with other Intrusion Detection System, IDMTM can greatly decrease the possibility of false-alarm with by efficiently utilizing the information collected from the local node and the neighboring nodes. Also, IDMTM can efficiently isolate internal malicious nodes from the networks and enhance the security without compromising the performance of the networks.
Web Usage Mining to Evaluate the Transfer of Learning in a Web-Based Learning Environment
Authors: Farah Habib Chanchary, Indrani Haque, Md. Saifuddin Khalid
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

received significant attention in finding customers' behavioral pattern in e-commerce and learners' behavioral pattern in elearning. While hit-counts indicate customers' interest in the product or purchasing behavior, a student's visits to a Learning Management System (LMS) do not necessarily involve transfer of learning. Addressing such complexity in e-learning, this study analyzed students' log of a Learning Management System (LMS) of two subjects at a university in Bangladesh, taught over six weeks duration. Data mining and statistical tools have been used to find relationships between students' LMS access behavior and overall performances. Results show that students having `Low' access obtained poor grade, on campus access was higher than access from home. Background of students is very important for effective usage of web resources. Majority of the student considered LMS to be a quite helpful tool as teaching-learning method. Preparation and cleaning of the web-log files as well as application of data mining algorithms is important for learners' web usage analysis. Keywords-data mining, e-learning.
Intrusion Detection for Wormhole Attacks in Ad hoc Networks: A Survey and a Proposed Decentralized Scheme
Authors: Marianne Azer, Sherif El-Kassas, Abdel Wahab Hassan, Magdy El-Soudani
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

The dynamic and cooperative nature of ad hoc networks presents substantial challenges in securing and detecting attacks in these networks. A particularly severe security attack, called the wormhole attack, has been introduced in the context of ad-hoc networks. During the attack, a malicious node captures packets from one location in the network, and tunnels them to another malicious node at a distant point, which replays them locally. In this paper we survey and classify the solutions that have been proposed in the literature for this attack and propose a decentralized scheme for intrusion detection based on the theory of diffusion of innovations. We argue that the proposed approach is more appropriate to address ad hoc networks’ dynamic and cooperative nature especially at the application level.
On conciseness of extensions of timed automata
Authors: Patricia Bouyer, Fabrice Chevalier
Venue: Journal of Automata, Languages and Combinatorics (2005)

In this paper we study conciseness of various extensions of timed automata, and prove that several features like diagonal constraints or updates lead to exponentially more concise timed models.
Centralized and distributed joint dual transmitter receiver diversity and power control for wireless networks
Authors: Jui Teng Wang
Venue: Computer Communications (2008)

Centralized and distributed algorithms, which aim to derive the optimal feasible power and weight for joint dual transmitter receiver diversity and power control, are proposed in this paper. We first show that the optimal feasible power and weight can be obtained by executing the centralized algorithm. Then we propose the distributed algorithm that simulates the operation of the centralized algorithm and iteratively adjusts the power and weight of each individual. It is shown that the power and weight obtained from the distributed algorithm converge to the optimal feasible power and weight, and simulation results also coincide with this fact. Furthermore, we also found that the centralized algorithm outperforms the previous approach in the average power level per user and the probability of feasibility.
Building a Website for Seniors in Easy Steps
Authors: Nick Vandome
Venue: In Easy Steps (2007)

This helpful guide demystifies the process of building a website. It shows readers, step-by-step, how to create, edit, and publish a webpage and walks them through technical aspects such as obtaining a Web address. It also covers building family websites, including genealogy, family trees, and sharing photographs; becoming the webmaster for a local club or charity; and adding a blog to a website.
Towards a next generation data center architecture: scalability and commoditization
Authors: Albert Greenberg, Parantap Lahiri, David A. Maltz, Parveen Patel, Sudipta Sengupta
Venue: Proceedings of the ACM workshop on Programmable routers for extensible services of tomorrow (2008)

Applications hosted in today's data centers suffer from internal fragmentation of resources, rigidity, and bandwidth constraints imposed by the architecture of the network connecting the data center's servers. Conventional architectures statically map web services to Ethernet VLANs, each constrained in size to a few hundred servers owing to control plane overheads. The IP routers used to span traffic across VLANs and the load balancers used to spray requests within a VLAN across servers are realized via expensive customized hardware and proprietary software. Bisection bandwidth is low, severly constraining distributed computation Further, the conventional architecture concentrates traffic in a few pieces of hardware that must be frequently upgraded and replaced to keep pace with demand - an approach that directly contradicts the prevailing philosophy in the rest of the data center, which is to scale out (adding more cheap components) rather than scale up (adding more power and complexity to a small number of expensive components). Commodity switching hardware is now becoming available with programmable control interfaces and with very high port speeds at very low port cost, making this the right time to redesign the data center networking infrastructure. In this paper, we describe monsoon, a new network architecture, which scales and commoditizes data center networking monsoon realizes a simple mesh-like architecture using programmable commodity layer-2 switches and servers. In order to scale to 100,000 servers or more,monsoon makes modifications to the control plane (e.g., source routing) and to the data plane (e.g., hot-spot free multipath routing via Valiant Load Balancing). It disaggregates the function of load balancing into a group of regular servers, with the result that load balancing server hardware can be distributed amongst racks in the data center leading to greater agility and less fragmentation. The architecture creates a huge, flexible switching domain, supporting any server/any service and unfragmented server capacity at low cost.