ppxscal/embedding_network huggingface dataset:
Scalable ontology systems
Authors: V. S. Subrahmanian
Venue:  (2008)

Since the adoption of the Resource Description Framework (RDF) by the World Wide Web Consortium (W3C), ontologies have become commonplace as a way to represent both knowledge and data. RDF databases have flexible schemas, are easy to integrate and allow a semantically rich query language. Unfortunately, these advantages come at the expense of increased query and application complexity. Existing RDF systems have attempted to address this problem by representing RDF data in relational format and translating queries and answers to and from SQL. As we will show, typical access patterns in RDF are substantially different than those in relational databases, to the extent that the performance of relational-backed systems degrades significantly for large datasets or complex queries.In this dissertation, we propose two solutions to the scalability issue in RDF databases. First, we introduce Annotated RDF, a representation language that extends the semantics of RDF by allowing triples to be annotated with partially ordered information such as temporal validity intervals, probabilities, provenance and many others. In standard RDF, using such information creates a blowup in the size of the database and therefore greatly increases the data complexity of queries. We define a query language for Annotated RDF that extends the RDF query language SPARQL and provides query processing and view maintenance algorithms. Our experimental evaluation shows Annotated RDF can answer queries 1.5 to 3.5 times faster than widely used systems such as Jena2, Sesame2 or Oracle 11g.Second, we introduce GRIN, to our knowledge the first index structure designed specifically for SPARQL queries. We describe query and update processing algorithms and a theoretical analysis of index optimization. GRIN is extended to Annotated RDF and evaluated thoroughly on real-world datasets of up to 26 million triples and benchmark synthetic datasets of up to 1 billion triples. Our results show that for SPARQL queries, GRIN outperforms all relational index structures at comparable resource expenditure. Moreover, we show GRIN can be integrated with Annotated RDF, but also with existing systems such as Jena2 or LucidDB.
A miniature spindle motor with fluid dynamic bearings for portable storage device applications
Authors: Chien-Sheng Liu, Psang-Dain Lin, Meng-Che Tsai
Venue: Microsystem Technologies (2009)

This paper presents the design and fabrication of a miniature axial-gap spindle motor for small-form-factor optical storage applications. The motor features a fluid dynamic bearing (FDB) and is characterized by a high mechanical rigidity, excellent dynamic characteristics, and a zero cogging torque. The performance of this FDB motor is evaluated experimentally using a laboratory-built prototype. The results show that the motor has an excellent dynamic response, a small axial repeatable runout, a small tilt angle, a high rotational speed, and a low operating current. Furthermore, with overall dimensions of just 15.5&#x00a0;&#x00d7;&#x00a0;3.3&#x00a0;mm, the FDB motor is around 80% smaller than that presented by the current group in a previous study (Liu et al., J Magn Magn Mater 304:362&#x2013;364, 2006). Consequently, the proposed motor represents an ideal solution for both existing and emerging miniaturized portable storage device applications.
The Best Damn Firewall Book Period, 2nd edition
Authors: Thomas W. Shinder
Venue:  (2007)

The Second Edition of the Best Damn Firewall Book Period is completely revised and updated to include all of the most recent releases from Microsoft, Cisco, Juniper Network, SonicWALL, and Check Point.Compiled from the best of the Syngress firewall library and authored by product experts such as Dr. Tom Shinder on ISA Server, this volume is an indispensable addition to a serious networking professionals toolkit. Coverage includes migrating to ISA Server 2006, integrating Windows Firewall and Vista security into your enterprise, successfully integrating Voice over IP applications around firewalls, and analyzing security log files.Sections are organized by major vendor, and include hardware, software and VPN configurations for each product line. New to this Edition:* Microsoft firewall protection, from Windows Firewall to ISA Server 2006* Cisco PIX Version 7, including VPN configuration and IDS* Analyzing Firewall Logs and Reports* VoIP and Firewall Bypassing
Homotopy switching model for dyad haptic interaction in physical collaborative tasks
Authors: Paul Evrard, Abderrahmane Kheddar
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

The main result of this paper is a new model based on homotopy switching between intrinsically distinct controllers that encompass most behaviors encountered in dyadic haptic collaborative tasks. The basic idea is to switch continuously between two distinct extreme behaviors (leader and follower) for each individual, which creates an implicit bilateral coupling within the dyad. The physical collaborative interaction is then described only with two distinct homotopy time-functions that vary independently. These functions can likely describe the signature of a collaborative task. A virtual reality haptic set-up is used to assess the proposed theory.
Enhancing Service Selection by Semantic QoS
Authors: Henar Muñoz Frutos, Ioannis Kotsiopoulos, Luis Miguel Vaquero Gonzalez, Luis Rodero Merino
Venue: Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications (2009)

The increasing number of functionally similar services requires the existence of a non-functional properties selection process based on the Quality of Service (QoS). Thus, in this article, authors focus on the provision of a QoS model, an architecture and an implementation which enhance the selection process by the annotation of Service Level Agreement (SLA) templates with semantic QoS metrics. This QoS model is composed by a specification for annotating SLA templates files, a QoS conceptual model formed as a QoS ontology and selection algorithm. This approach, which is backward compatible, provides interoperability among customer-providers and a lightweight alternative. Finally, its applicability and benefits are shown by using examples of Infrastructure services.
Further Stability Analysis for Neural Networks with Time-Varying Interval Delay
Authors: Qiufeng Cai, Jianjiang Yu
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

This paper provides improved results on stability condition for a class of neural networks (NNs) with time-varying interval delay. The activation functions of the NNs are assumed to be more general. Based on a new augmented Lyapunov-Krasovskii functional, the improved delay-dependent stability criterion for delay NNs is obtained in terms of linear matrix inequalities (LMIs). It is shown that the new criterion can provide less conservative results than some existing ones. A numerical example is given to demonstrate the effectiveness and the benefits of the proposed method.
An Action-Based Legal Model for Dynamic Digital Rights Expression
Authors: Melanie Dulong de Rosnay
Venue: Proceeding of the 2006 conference on Legal Knowledge and Information Systems: JURIX 2006: The Nineteenth Annual Conference (2006)

At the crossroad of law and computer science, the notion of Digital Rights Management renews the research on Lex Electronica. Rights Expression Languages provide the legal semantic and syntax to be implemented by Digital Rights Management Systems. Rights Expressions are legal metadata that define the actions led on a digital text or multimedia file. This article presents some legal resources and requirements to express rights and transactions pertaining to digital documents and data, ie legally or contractually allowed usages or actions. The proposed model associate terminological resources from technology, usages, exclusive rights and public domain. Research around this article takes place in Medialex, an interdisciplinary project aiming at building a transaction ontology to license, access and reuse.
Synchronisation of complex networks via partial contraction principle
Authors: Kezan Li, Weigang Sun, Xinchu Fu
Venue: International Journal of Systems, Control and Communications (2009)

Based on partial contraction principle, we study the complete synchronisation for approximately globally coupled networks (almost all nodes are connected). By contraction for a system, we mean that initial conditions or temporary disturbances are forgotten exponentially fast, so that all trajectories of this system converge to a unique trajectory. We identify the region of coupling strength required for achieving synchronisation for these networks without using the eigenvalues of their coupling matrices. Avoiding the computation of the eigenvalues of coupling matrix, this method becomes more effective as to studying the problem of synchronisation for that kinds of network than most other approaches. Numerical examples verify the efficiency of this method.
Evaluation of the iterative multiplication strategy for trust propagation in pervasive environments
Authors: Omar Hasan, Lionel Brunie, Jean-Marc Pierson
Venue: Proceedings of the 2009 international conference on Pervasive services (2009)

There are a number of models for access control in pervasive environments that are based on trust propagation. Iterative multiplication of the trust values on a path from a source entity to a target entity is one of the common strategies for trust propagation. In this paper, we evaluate the effectiveness of iterative multiplication for trust propagation. The data set used for this evaluation is the real web of trust of Advogato.org that comprises of over 11,000 vertices (users) and over 50,000 directed weighted edges (trust relationships between users). We find that a significantly strong positive linear correlation exists between trust values based on direct experience and the corresponding propagated trust values derived through the iterative multiplication approach. This finding provides empirical support for the access control models for pervasive environments that employ the iterative multiplication strategy for trust propagation.
Emerging Technologies for Inquiry-Based Learning in Science
Authors: Dawn Woodgate, Danaë Stanton fraser
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

The aim of this workshop is to promote discussion and collaboration among educational practitioners and researchers, and others with an interest in using new technologies to stimulate learners' interest and motivation in science topics, and to explore ways in which emerging technologies can be appropriated for use in scientific investigations in schools and elsewhere, to bring about a more engaging and hands-on approach to science learning.
Building a Linux-based high-performance compute cluster
Authors: Tom Lehmann
Venue: Linux Journal (2009)

Don't toss 'em, cluster 'em. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
The Kinetics of Charge Recombination in DNA Hairpins Controlled by Counterions
Authors: Gail S. Blaustein, Frederick D. Lewis, Alexander L. Burin, Rajesh Shrestha
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

The charge recombination rate in DNA hairpins is investigated. The distance dependence for the charge recombination rate between stilbene donor (Sd + ) and stilbene acceptor (Sa¿) linkers separated by an AT bridge has a double exponential form. We suggest that this dependence is associated with two tunneling channels distinguished by the presence or absence of the Cl¿ counterion bound to Sd + . Experiment-based estimates of counterion binding parameters agree within reasonable expectations. A control experiment replacing the Cl¿ ion with other halide ions is suggested. Counterion substitution allows modification of the charge recombination rate in either direction by orders of magnitude.
Design of a secure chat application based on AES cryptographic algorithm and key management
Authors: Nikolaos G. Bardis, Konstantinos Ntaikos
Venue: Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems (2008)

This article presents the design and implementation of a software application for the provision of secure real time communication services between workstations, based on the AES prototype cryptographic algorithm and an advanced secret key management system. The application has been designed based on the requirements of a military unit, so as to allow groups of authenticated users to communicate and read the transmitted messages. This application can be used as the basis for the design of an integrated communication system for a military organization. The present design confines its operation within the limits of a local area network, but the possibilities are open for operation in extended networks or the internet. In this article, a concise account of the design of the application is first presented. The way in which a symmetric encryption system uses a pair of secret keys to provide additional capabilities is hence presented. Consequently, the operation of a password management system is presented that achieves secure storage and handling of user secret passwords and access control data. Finally, the application implementation details are presented for a Visual Basic 6 implementation developed for a military unit.
Conceptual Association of Functional Size Measurement Methods
Authors: Onur Demirors, Cigdem Gencel
Venue: IEEE Software (2009)

A significant challenge for functional size measurement (FSM) is the underlying variations among FSM methods. A software product has different functional sizes in different units of measurement when measured via different methods. On the other hand, FSM methods are based on similar concepts and use comparable attributes in their measurement processes. In this article, the authors discuss the conceptual similarities and differences between FSM methods and present their model for unification. They evaluated the model using two case studies for measuring the functional size of software systems simultaneously via IFPUG FPA, MkII FPA, and COSMIC FP methods.
Spread-of-Disease Modeling in a Microbiology Course
Authors: George W. Shiflet, Angela B. Shiflet
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

Microbiology is the study of microorganisms. Most college courses in microbiology emphasize the biology of bacteria and viruses, including those that are human pathogens. One challenging aspect of the course is to introduce students to epidemiology, which considers the causes, dispersal, and control of disease. Although disease transmission models have helped develop successful strategies for managing epidemics, most science students are unaware of their advantages and complexities. To address this challenge, the microbiology course at Wofford College has incorporated a sequence of three or four laboratories on modeling the spread of disease. Emphasis in Computational Science students who have studied modeling and simulation in depth serve as laboratory assistants and mentors. Evidence from test scores and self-assessment support the hypothesis that the sequence of laboratories has improved student understanding of human disease dynamics and demonstrated the utility of computational models.
Faceprint: Fusion of Local Features for 3D Face Recognition
Authors: Guangpeng Zhang, Yunhong Wang
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

3D face recognition is a very active biometric research field. Due to the 3D data's insensitivity to illumination and pose variations, 3D face recognition has the potential to perform better than 2D face recognition. In this paper, we focus on local feature based 3D face recognition, and propose a novel Faceprint method. SIFT features are extracted from texture and range images and matched, the matching number of key points together with geodesic distance ratios between models are used as three kinds of matching scores, likelihood ratio based score level fusion is conducted to calculate the final matching score. Thanks to the robustness of SIFT, shape index, and geodesic distance against various changes of geometric transformation, illumination, pose and expression, the Faceprint method is inherently insensitive to these variations. Experimental results indicate that Faceprint method achieves consistently high performance comparing with commonly used SIFT on texture images.
The analysis of the scattering over a nonchiral-chiral interface in a coaxial waveguide
Authors: S. Mohammadi, S. S. Razavi Pour
Venue: Proceedings of the 8th WSEAS international conference on Microelectronics, nanoelectronics, optoelectronics (2009)

A formally exact full-wave solution is presented for the problem of scattering at a nonchiral-chiral interface in a coaxial waveguide. The field components for the axisymmetric modes in a coaxial chirowaveguide are initially obtained. A new orthogonality relation for the modes is then proposed and used to find expansion coefficients for the electromagnetic fields in the coaxial chirowaveguide. The scattering matrix for the nonchiral-chiral dielectric discontinuity in a coaxial waveguide is finally derived by enforcing the continuity conditions of the tangential field components across the interface. Numerical results for the reflection and transmission coefficients at the nonchiral-chiral interface in a coaxial waveguide are presented.
An Attempt to Use the KEEL Tool to Evaluate Fuzzy Models for Real Estate Appraisal
Authors: Tadeusz Lasota, Bogdan Trawiński, Krzysztof Trawiński
Venue: Proceeding of the 2008 conference on New Trends in Multimedia and Network Information Systems (2008)

Fuzzy models to assist with real estate appraisals are described and previous experiments on optimizing them with evolutionary algorithms implemented in MATLAB are summarized. An approach was made to use the KEEL Tool, developed in Java by a group of Spanish research centres, to investigate the models. Five fuzzy models comprising 3 or 4 input variables referring to the attributes of a property were learned and evaluated using six regression algorithms for fuzzy rule based systems implemented in the KEEL Tool. The experiments were conducted using a data set prepared on the basis of actual 134 sales transactions made in one of Polish cities and located in a residential section. The results were encouraging. The KEEL Tool has proved to be very useful and effective research tool, especially thanks to its 10-fold cross validation mechanism and relatively short time of data processing.
Physicalnet: a framework for interoperability and application concurrency in wireless networks of sensors and actuators
Authors: John A. Stankovic
Venue:  (2008)

Recent advances in embedded technology have made possible the deployment of wireless networks composed of hundreds or thousands of energy efficient sensors and actuators equipped with their own CPU, memory, and wireless radio. These wireless networks of sensors and actuators (WNSA) have found applications in many domains among which building automation, personal health care, strategic military assistance, and environmental surveillance. Despite the large number of WNSA applications, the number of actual WNSA deployments is limited by several factors including programming difficulties and the low reliability of resulting applications. Many approaches have been proposed to ease the programming of WNSAs: macro-programming languages, toolkits, virtual machines, and programming abstractions. While these approaches introduce valuable programming features and architectural organization models, their scope is typically limited to a single WNSA, composed of identical nodes, all managed by a single individual that runs a single application at a time. In this research, we provide a framework, named Physicalnet, which assumes nothing of the sort. Physicalnet applications can simultaneously use the same sensors and actuators; they can seamlessly access the services implemented on a heterogeneous set of nodes; and they can involve nodes from multiple remote WNSAs. Physicalnet nodes are free to move within a network and across networks; and each node can have a different owner that can specify fine-grained and complex access rights involving environmental measurements, node locations, or any other application variables. Finally, Physicalnet also addresses canonical WNSA requisites: ease of programming, scalability, robustness, low application launch time, low application response time, energy conservation, and low memory usage. Physicalnet is implemented on resource constrained MICAz wireless sensor nodes, and personal computers. Using a combination of simulation, testbed, and numerical evaluation, we estimate the following quantitative metrics for multiple applications and multiple deployment scenarios involving mobile nodes, multiple networks, and concurrent applications: number of lines of code (used an indicator of conciseness), memory usage, energy consumption, application launch time, application response time, and percentage of lost sensor data. We compare Physicalnet with the related work using several of these metrics and conclude on the practicality of Physicalnet and its potential impact.
Depth First Rule Generation for Text Categorization
Authors: Jiyuan An, Yi-Ping Phoebe Chen
Venue: Proceeding of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006 (2006)

Classification methods are usually used to categorize text documents, such as, Rocchio method, Naïve bayes based method, and SVM based text classification method. These methods learn labeled text documents and then construct classifiers. The generated classifiers can predict which category is located for a new coming text document. The keywords in the document are often used to form rules to categorize text documents, for example “kw = computer” can be a rule for the IT documents category. However, the number of keywords is very large. To select keywords from the large number of keywords is a challenging work. Recently, a rule generation method based on enumeration of all possible keywords combinations has been proposed [2]. In this method, there remains a crucial problem: how to prune irrelevant combinations at the early stages of the rule generation procedure. In this paper, we propose a method than can effectively prune irrelative keywords at an early stage.