ppxscal/embedding_network huggingface dataset:
A new algorithm based on auxiliary virtual topology for sub-path protection in WDM optical networks
Authors: Xingwei Wang, Lei Guo, Xuekui Wang, Yu Zhang, Xiaobing Zheng, Weigang Hou, Hongming Li, Hongpeng Wang
Venue: Computer Communications (2009)

This paper proposes a new survivable algorithm named sub-path protection based on auxiliary virtual topology (SPAVT) to tolerate the single-link failure in WDM optical networks. First, according to the protection-switching time constraint, SPAVT searches multiple pairs of primary and backup paths for each node pair in the network by the off-line manner, and then map these paths to the virtual topology. When a connection request arrives, SPAVT only needs to run one time of the Dijkstra's algorithm to search a virtual route in virtual topology, where the route may consist of multiple pairs of sub-paths, to meet the protection-switching time constraint. Then, according to the shared resources policy, SPAVT chooses an optimal pair of sub-paths. Simulation results show that SPAVT has smaller blocking probability and lower time complexity than conventional algorithms.
A Multiscale Modeling Framework Based on P Systems
Authors: Francisco José Romero-Campero, Jamie Twycross, Hongqing Cao, Jonathan Blakes, Natalio Krasnogor
Venue: Membrane Computing: 9th International Workshop, WMC 2008, Edinburgh, UK, July 28-31, 2008, Revised Selected and Invited Papers (2009)

Cellular systems present a highly complex organization at different scales including the molecular, cellular and colony levels. The complexity at each one of these levels is tightly interrelated. Integrative systems biology aims to obtain a deeper understanding of cellular systems by focusing on the systemic and systematic integration of the different levels of organization in cellular systems.The different approaches in cellular modeling within systems biology have been classified into mathematical and computational frameworks. Specifically, the methodology to develop computational models has been recently called executable biology since it produces executable algorithms whose computations resemble the evolution of cellular systems.In this work we present P systems as a multiscale modeling framework within executable biology. P system models explicitly specify the molecular, cellular and colony levels in cellular systems in a relevant and understandable manner. Molecular species and their structure are represented by objects or strings, compartmentalization is described using membrane structures and finally cellular colonies and tissues are modeled as a collection of interacting individual P systems.The interactions between the components of cellular systems are described using rewriting rules. These rules can in turn be grouped together into modules to characterize specific cellular processes. One of our current research lines focuses on the design of cell systems biology models exhibiting a prefixed behavior through the automatic assembly of these cellular modules. Our approach is equally applicable to synthetic as well as systems biology.
Mobility entropy and message routing in community-structured delay tolerant networks
Authors: Hideya Ochiai, Hiroshi Esaki
Venue: Proceedings of the 4th Asian Conference on Internet Engineering (2008)

Many message routing schemes have been proposed in the context of delay tolerant networks (DTN) and intermittently connected mobile networks (ICMN). Those routing schemes are tested on specific environments that involve particular mobility complexity whether they are random-based or sociologically organized. We, in this paper, propose community structured environment (CSE) and mobility entropy to discuss the effect of node mobility complexity on message routing performance. We also propose potential-based entropy adaptive routing (PEAR) that adaptively carries messages over the change of mobility entropy. According to our simulation, PEAR has achieved high delivery rate on wide range of mobility entropy, while link-state routing has worked well only at small entropy scenarios and controlled replication-based routing only at large entropy environments.
Type-based categorization of relational attributes
Authors: Babak Ahmadi, Marios Hadjieleftheriou, Thomas Seidl, Divesh Srivastava, Suresh Venkatasubramanian
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

In this work we concentrate on categorization of relational attributes based on their data type. Assuming that attribute type/characteristics are unknown or unidentifiable, we analyze and compare a variety of type-based signatures for classifying the attributes based on the semantic type of the data contained therein (e.g., router identifiers, social security numbers, email addresses). The signatures can subsequently be used for other applications as well, like clustering and index optimization/compression. This application is useful in cases where very large data collections that are generated in a distributed, ungoverned fashion end up having unknown, incomplete, inconsistent or very complex schemata and schema level meta-data. We concentrate on heuristically generating type-based attribute signatures based on both local and global computation approaches. We show experimentally that by decomposing data into q-grams and then considering signatures based on q-gram distributions, we achieve very good classification accuracy under the assumption that a large sample of the data is available for building the signatures. Then, we turn our attention to cases where a very small sample of the data is available, and hence accurately capturing the q-gram distribution of a given data type is almost impossible. We propose techniques based on dimensionality reduction and soft-clustering that exploit correlations between attributes to improve classification accuracy.
EDS2DCC: A Method of Eliminating Direct Super-class to Detect Cycle of Concepts
Authors: Kairong Li, Weiying Gao, Hui Zhang, Xiaoyan Liu, Shijin Shao
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Ontology is an explicit formal sharing conceptualization of one domain. Ontology maintenance is one of most important work during ontology’s development lifecycle. Cycle of concepts is one of the most common inconsistency errors in ontology. In this paper, we propose a method of eliminating direct super-class to detect cycle of concepts (EDS2DCC). This method firstly constructs oriented graphs according to the system of concepts in ontology. Secondly, it defines an array to store concepts access states and a table to store current concepts list, then the method determines whether existing cycle of concepts or not based on the length which obtained from ergodic oriented graphs. Finally, we demonstrate the validity of the method by applying and analyzing scenarios.
Specification technique for parallel processing: process-data representation
Authors: Ken Hirose, Kiyoshi Segawa, Nobuo Saito, Norihisa Doi, Masahiro Hirata, Toshiharu Yamasaki, Masayuki Takata
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

This paper proposes a new specification technique called Process-Data Representation (PDR) which intends to describe precise and comprehensive specification for parallel processing. The process representation consists of (a) the condition to start the actions of processes and (b) the execution ordering. The data representation specifies the constraints on the shared usage of particular data. We propose the forcing logic to describe these constraint conditions. A formula in the forcing logic can clearly specify the number of objects involved in some actions. The semantics of the formula is discussed in detail. We also give an operational model of the forcing logic and its effective implementation using semaphores. An example of the specification description for an operating system is given, and the verifications of its properties are discussed.
Semantic partitioning of peer-to-peer search space
Authors: Habib Rostami, Jafar Habibi, Emad Livani
Venue: Computer Communications (2009)

Peer-to-peer (P2P) networks are beginning to form the infrastructure of future applications. Computers are organized in P2P overlay networks to facilitate search queries with reasonable cost. So, scalability is a major aim in design of P2P networks. In this paper, to obtain a high factor of scalability, we partition network search space using a consistent static shared upper ontology. We name our approach semantic partition tree (SPT). All resources and queries are annotated using the upper ontology and queries are semantically routed in the overlay network. Also, each node indexes addresses of other nodes that possess contents expressible by the concept it maintains. So, our approach can be conceived as an ontology-based distributed hash table (DHT). Also, we introduce a lookup service for the network which is very scalable and independent of the network size and just depends on depth of the ontology tree. Further, we introduce a broadcast algorithm on the network. We present worst case analysis of both lookup and broadcast algorithms and measure their performance using simulation. The results show that our scheme is highly scalable and can be used in real P2P applications.
Fast implementation of a scan statistic for identifying chromosomal patterns of genome wide association studies
Authors: Yan V. Sun, Douglas M. Jacobsen, Stephen T. Turner, Eric Boerwinkle, Sharon L. R. Kardia
Venue: Computational Statistics Data Analysis (2009)

In order to take into account the complex genomic distribution of SNP variations when identifying chromosomal regions with significant SNP effects, a single nucleotide polymorphism (SNP) association scan statistic was developed. To address the computational needs of genome wide association (GWA) studies, a fast Java application, which combines single-locus SNP tests and a scan statistic for identifying chromosomal regions with significant clusters of significant SNP effects, was developed and implemented. To illustrate this application, SNP associations were analyzed in a pharmacogenomic study of the blood pressure lowering effect of thiazide-diuretics (N=195) using the Affymetrix Human Mapping 100 K Set. 55,335 tagSNPs (pair-wise linkage disequilibrium R^2
Teach Yourself Auto CAD 2007, 2 edition
Authors: Mac Bride
Venue: Teach Yourself (2007)

Learn your way around AutoCAD 2007 Teach Yourself AutoCAD 2007 helps you cut through the complexity, providing detailed, easy-to-follow instructions on AutoCAD’s key tools and techniques. From drawing simple lines to creating 3-D images, you will quickly master the skills you need to advance your career in design.Table of contents1. introducing AutoCAD 2. the drawing tools 3. modifying objects 4. properties 5. fills and hatches 6. text 7. dimensions 8. layers 9. blocks and the design center 10. from sketch to plot 11. drawing in 3D 12. 3D solids
One class support vector machine for anomaly detection in the communication network performance data
Authors: Rui Zhang, Shaoyan Zhang, Sethuraman Muthuraman, Jianmin Jiang
Venue: Proceedings of the 5th conference on Applied electromagnetics, wireless and optical communications (2007)

Anomaly detection refers to the automatic identification of the abnormal behaviors from a large amount of normal data. Anomaly detection is more and more required in the communication network due to the increasing number of the unauthorized activities occurring in the network. This paper presents a method based on one class support vector machine (OCSVM) to detect the network anomalies. The communication network performance data are used for the investigation and the raw data are firstly preprocessed in order to produce the vector sets required by the OCSVM algorithm. The training data are used to train the OCSVM anomaly detector, and the trained detector is applied on the test data to detect the anomalies. In addition, the results are compared with the results obtained from the rule-based system which is currently used in the communication network. The algorithm shows the promising performance on the network anomaly detection and provides a great reduction on the volume of the alarms than the rule-based system.
Query independent measures of annotation and annotator impact
Authors: James Lanagan, Alan F. Smeaton
Venue: Proceedings of the WSDM '09 Workshop on Exploiting Semantic Annotations in Information Retrieval (2009)

The modern-day web-user plays a far more active role in the creation of content for the web as a whole. In this paper we present Annoby, a free-text annotation system built to give users a more interactive experience of the events of the Rugby World Cup 2007. Annotations can be used for query-independent ranking of both the annotations and the original recorded video footage (or documents) which has been annotated, based on the social interactions of a community of users. We present two algorithms, AuthorRank and MessageRank, designed to take advantage of these interactions so as to provide a means of ranking documents by their social impact.
Estimating storm discharge and water quality data uncertainty: A software tool for monitoring and modeling applications
Authors: R. D. Harmel, D. R. Smith, K. W. King, R. M. Slade
Venue: Environmental Modelling Software (2009)

Uncertainty estimates corresponding to measured hydrologic and water quality data can contribute to improved monitoring design, decision-making, model application, and regulatory formulation. With these benefits in mind, the Data Uncertainty Estimation Tool for Hydrology and Water Quality (DUET-H/WQ) was developed from an existing uncertainty estimation framework for small watershed discharge, sediment, and N and P data. Both the software and its framework-basis utilize the root mean square error propagation methodology to provide uncertainty estimates instead of more rigorous approaches requiring detailed statistical information, which is rarely available. DUET-H/WQ lists published uncertainty information for data collection procedures to assist the user in assigning appropriate data-specific uncertainty estimates and then calculates the uncertainty for individual discharge, concentration, and load values. Results of DUET-H/WQ application in several studies indicated that substantial uncertainty can be contributed by each procedural category (discharge measurement, sample collection, sample preservation/storage, laboratory analysis, and data processing and management). For storm loads, the uncertainty was typically least for discharge (+/-7-23%), greater for sediment (+/-16-27%) and dissolved N and P (+/-14-31%) loads, and greater yet for total N and P (+/-18-36%). When these uncertainty estimates for individual values were aggregated within study periods (i.e. total discharge, average concentration, and total load), uncertainties followed the same pattern (Q
Using open source software to engage students in computer science education
Authors: Gregory W. Hislop, Heidi J.C. Ellis, Allen B. Tucker, Scott Dexter
Venue: Proceedings of the 40th ACM technical symposium on Computer science education (2009)

This panel will discuss issues and methods for incorporating free and open source software (FOSS) in computer science education. The panelists are investigating approaches to student participation in FOSS that produce results that are contributed to the FOSS community and actually used by others.
Generating Executable Scenarios from Natural Language
Authors: Michal Gordon, David Harel
Venue: Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing (2009)

Bridging the gap between the specification of software requirements and actual execution of the behavior of the specified system has been the target of much research in recent years. We have created a natural language interface, which, for a useful class of systems, yields the automatic production of executable code from structured requirements. In this paper we describe how our method uses static and dynamic grammar for generating live sequence charts (LSCs), that constitute a powerful executable extension of sequence diagrams for reactive systems. We have implemented an automatic translation from controlled natural language requirements into LSCs, and we demonstrate it on two sample reactive systems.
On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis
Authors: Joseph Wun-Tat Chan, Prudence W. H. Wong, Fencol C. C. Yung
Venue: Algorithmica (2009)

We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart from the packing dynamically. The main result in this paper is a lower bound of&#x00a0;2.5 on the achievable competitive ratio, improving the best known 2.428 lower bound, and revealing that packing items of restricted form like unit fractions (i.e., of size 1/k for some integer k), for which a 2.4985-competitive algorithm is known, is indeed easier. We also investigate the resource augmentation version of the problem where the on-line algorithm can use bins of size b (>1) times that of the optimal off-line algorithm. An interesting result is that we prove b=2 is both necessary and sufficient for the on-line algorithm to match the performance of the optimal off-line algorithm, i.e., achieve 1-competitiveness. Further analysis gives a trade-off between the bin size multiplier&#x00a0;1<b&#x2264;2 and the achievable competitive ratio.
The impact of MOSFET's physical parameters on its threshold voltage
Authors: Milaim Zabeli, Nebi Caka, Myzafere Limani, Qamil Kabashi
Venue: Proceedings of the 6th conference on Microelectronics, nanoelectronics, optoelectronics (2007)

The aim of this paper is to research the impact of physical parameters which characterize the MOSFET transistors structure on the threshold voltage value. It is also analysed the role of substrate (the body effect) on the threshold voltage. The MOSFET threshold voltage value will have influence in the dynamic and static work regime (mode) of device. Based on the results obtained we can further see impact of each single physical parameter on the total value of threshold voltage. Moreover we can see which of these parameters will have significant and small impact on the threshold voltage. Hence, considering we can adjust the values of MOSFET physical parameters to reach the accepted threshold voltage.
Narrow-band Interference Suppression in DSSS Systems Using Efficient Adaptive Filters
Authors: Jiang-Zhi Fu, Li-Li Guo, Hong-Qiao Yang, Zhi-Xue Han
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

In this paper, we present a novel adaptive interference suppression method by combining with time-domain filters and frequency-domain filters. Demonstrated by simulation results, the method can significantly improve the performance of DSSS receiver serving at the narrow-band interference environment. The improvement of resulting SNR after NBI suppression will further enhance along with the increasing of interference intensities. Compared with the simple interference nulling and amplitude limiting processing, the proposed method has less complexity and better real-time performance without losing much signal performance.
Comparison of short term variability indexes in cardiotocographic foetal monitoring
Authors: M. Cesarelli, M. Romano, P. Bifulco
Venue: Computers in Biology and Medicine (2009)

Concise indexes related to variability of foetal heart rate (FHR) are usually utilised for foetal monitoring; they enrich information provided by cardiotocography (CTG). Most attention is paid to the short term variability (STV), which relates to activity and reaction of autonomic nervous control of foetal heart. There is not a unique method to compute short term variability of the FHR but different formulas have been proposed and are employed in clinical and scientific environments: this leads to different evaluations and makes difficult comparative studies. Nine short term variability indexes: Arduini, Dalton, Organ, Sonicaid 8000, Van Geijn, Yeh, Zugaib a modified version of Arduini index and Standard Deviation were considered and compared to test their robustness in CTG applications. A large set of synthetic foetal heart rate series with known features were used to compare indexes performances. Different amounts of variability, mean foetal heart rate, storage rates, baseline variations were considered. The different indexes were in particular tested for their capability to recognise short term heart rate variability variation, their dependence on heart rate signal storage rate (as those provided by commercial cardiotocographic devices), on mean value of the foetal heart rate and on modifications of the floatingline, such in case of accelerations or decelerations. Concise statistical parameters relative to indexes scores were presented in comparative tables. Results indicate that although the indexes are able to recognise STV variation, they show substantial differences in magnitude and some in sensibility. Results depend on the frequency used to acquire and store FHR data (depending on devices); in general, the lower is data rate the more degraded are the results. Furthermore, results differently depend on FHR mean, some for their intrinsic definition; differences arise also in correspondences of accelerations and decelerations. Our results demonstrate that only indexes which refer directly to differences in FHR values, such as Organ and SD indexes, not show dependence on FHR mean. The use of the Standard Deviation index may provide efficient information while showing independence from the considered variables. Indexes performance in case of real cardiotocographic signals were also presented as examples.
Algebraic Immunity of Even Variable Symmetric Boolean Functions
Authors: Weiqiang Zhang, Ruihu Li
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

The properties of value vector and coefficient vector of symmetric Boolean functions with maximum algebraic immunity are studied by applying combinatory and Lucas formula. Basing on that, we proved the algebraic immunity of three classes (2m −2)-variable symmetric Boolean functions with m≥3 is not maximum.
In-home telehealth clinical interaction using a robot
Authors: Simon Brière, Patrick Boissy, Francois Michaud
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

Providing healthcare in remote locations can prove to be costly. Using a static videoconference system in the patient's home has its limitations. A remotely operated mobile robot platform could provide a better interaction with the patient located at home. This paper presents Telerobot, a teleoperated mobile robotic platform equipped with videoconferencing capabilities. Developed by a team of roboticists and clinical experts, the system is designed specifically for the provision of in-home telerehabilitation services. A usability study was done in order to qualify the robot user control scheme and the clinician-patient interaction.
On the derivation of macroscopic hyperbolic equations for binary multicellular growing mixtures
Authors: N. Bellomo, A. Bellouquid
Venue: Computers Mathematics with Applications (2009)

This paper presents an asymptotic theory, based on the hyperbolic scaling, for a large class of Boltzmann-type equations suitable to model the evolution of a binary mixture of multicellular systems in biology. The modelling approach is that of the kinetic theory for active particles. Time scaling related to cell movement and biological activity are shown to play a crucial role in determining the macroscopic equations corresponding to each case. Applications are focused on the immune competition.