ppxscal/embedding_network huggingface dataset:
Design and implementation of a high-fidelity AC metering network
Authors: Xiaofan Jiang, Stephen Dawson-Haggerty, Prabal Dutta, David Culler
Venue: Proceedings of the 2009 International Conference on Information Processing in Sensor Networks (2009)

We present the architecture, design, and preliminary evaluation of ACme, a wireless sensor and actuator network for monitoring AC energy usage and controlling AC devices in a large and diverse building environment. The ACme system consists of three tiers: the ACme node which provides a metering and control interface to a single outlet, a network fabric which allows this interface to be exported to arbitrary IP endpoints, and application software that uses this networked interface to provide various power-centric applications. The ACme node integrates an Epic core module with a dedicated energy metering IC to provide real, reactive, and apparent power measurements, with optional control of an attached load. The network comprises a complete IPv6/6LoWPAN stack on every node and an edge router that connects to other IP networks. The application tier receives and stores readings in a database and uses a web server for visualization. Nodes automatically join the IPv6 subnet after being plugged in, and begin interactions with the application layer. We evaluate our system in a preliminary green building deployment with 49 nodes spread over several floors of a Computer Science Building and present energy consumption data from this preliminary deployment.
CSP properties for quantified constraints: definitions and complexity
Authors: Lucas Bordeaux, Marco Cadoli, Toni Mancini
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 1 (2005)

Quantified constraints and Quantified Boolean Formulae are typically much more difficult to reason with than classical constraints, because quantifier alternation makes the simple, classical notion of solution inappropriate. As a consequence, even such essential CSP properties as consistency or substitutability are not completely understood in the quantified case. In this paper, we show that most of the properties which are used by solvers for CSP can be generalized to Quantified CSP. We propose a systematic study of the relations which hold between these properties, as well as complexity results regarding the decision of these properties. Finally, and since these problems are typically intractable, we generalise the approach used in CSP and propose weakenings of these notions based on locality, which allow for a tractable, albeit incomplete detecting of these properties.
Backbones and backdoors in satisfiability
Authors: Philip Kilby, John Slaney, Sylvie Thiébaux, Toby Walsh
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 3 (2005)

We study the backbone and the backdoors of propositional satisfiability problems. We make a number of theoretical, algorithmic and experimental contributions. From a theoretical perspective, we prove that backbones are hard even to approximate. From an algorithmic perspective, we present a number of different procedures for computing backdoors. From an empirical perspective. we study the correlation between being in the backbone and in a backdoor. Experiments show that there tends to be very little overlap between backbones and backdoors. We also study problem hardness for the Davis Putnam procedure. Problem hardness appears to be correlated with the size of strong backdoors, and weakly correlated with the size of the backbone, but does not appear to be correlated to the size of weak backdoors nor their number. Finally, to isolate the effect of backdoors, we look at problems with no backbone.
An Improved Scheme of Single Sign-On Protocol Based on Dynamic Double Password
Authors: Yang Jian
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

In order to avoid security threats caused by password attack and replay attack in single sign-on protocol, the most methods on solving these issues are making use of complicated techniques and equipment, no-doubt this increases the degree of complication and cost of the system, and reduces the usability as well. In this regard, this study proposes an new scheme based on dynamic double password and log feedback, the two passwords are used in user’s login and application of service, and the user can be able to make a judgement on security of a password through auditing the log file and allowed to modify the password, the result analysis indicates that new scheme greatly enhances the capability of guarding against password attack of the system. Meanwhile, as the new increased data flow in new scheme is directly going to relevant server without passing client, the security gravity of the client is reduced, and also it is benefit to protecting against replay attack; furthermore, the user can be able to accurately make the position and classification of replay attack in the system by analyzing log file.
Incorporating Software Security into an Undergraduate Software Engineering Course
Authors: Cynthia Y. Lester, Frank Jamerson
Venue: Proceedings of the 2009 Third International Conference on Emerging Security Information, Systems and Technologies (2009)

Secure software development has become a topic of increasing importance, as a general fear rises due to security holes, vulnerabilities, and attacks.To ensure the security of information in a society of file sharing, on-line business transactions, and e-communication, undergraduate students will soon be required to implement software security concepts into their software development processes as soon as they complete their degrees. Consequently, it is imperative for graduates of computer science departments to be trained in the fundamentals of information security and to gain hands-on experience with secure software development. To address this issue computer science educators at the undergraduate level are turning their attentions to incorporating security issues within traditional computer science courses. The paper describes an existing undergraduate software engineering course that has been modified to include software security concepts.Challenges and future work are also presented.
Multilingual term extraction from domain-specific corpora using morphological structure
Authors: Delphine Bernhard
Venue: Proceedings of the Eleventh Conference of the European Chapter of the Association for Computational Linguistics: Posters & Demonstrations (2006)

Morphologically complex terms composed from Greek or Latin elements are frequent in scientific and technical texts. Word forming units are thus relevant cues for the identification of terms in domain-specific texts. This article describes a method for the automatic extraction of terms relying on the detection of classical prefixes and word-initial combining forms. Word-forming units are identified using a regular expression. The system then extracts terms by selecting words which either begin or coalesce with these elements. Next, terms are grouped in families which are displayed as a weighted list in HTML format.
Statistic Analysis for Probabilistic Processes
Authors: Michel de Rougemont, Mathieu Tracol
Venue: Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science (2009)

We associate a statistical vector to a trace and a geometrical embedding to a Markov Decision Process, based on a distance on words, and study basic Membership and Equivalence problems. The Membership problem for a trace \textit{w} and a Markov Decision Process \textit{S} decides if there exists a strategy on \textit{S} which generates with high probability traces close to \textit{w}. We prove that Membership of a trace is \emph{testable} and Equivalence of MDPs is polynomial time approximable. For Probabilistic Automata, Membership is not testable, and approximate Equivalence is undecidable. We give a class of properties, based on results concerning the structure of the tail sigma-field of a finite Markov chain, which characterizes equivalent Markov Decision Processes in this context.
A multi-dimensional data organization for natural language processing
Authors: Kam-Hoi Cheng, Waleed Faris
Venue: Journal of Computational Methods in Sciences and Engineering (2009)

For knowledge systems that rely on teachings from an outside source to gain their knowledge, proper data organizations are instrumental in managing and applying what has been learned. This paper describes the development of a Multi-Dimensional Data Organization (MDDO). Our MDDO stores a collection of knowledge of the same category classified by multiple orthogonal dimensions. Each dimension has a number of indices reflecting the potential attribute values of that dimension. A knowledge object is identified by a unique combination of indices from multiple dimensions whose values signify the different properties of the object itself. Our solution allows the collection of knowledge to be learned dynamically in any order and in an incremental manner. This MDDO has been used to store part of the English grammar, and we describe in this paper how it assists a learning program in both the parsing and the production of an English sentence. We also define the functionalities of the data organization, describe its organization, describe how each function is implemented, and analyze their worst-case performances.
Moving Object Segmentation for Determining Direction
Authors: Youfu Wu, Gang Zhou, Jing Wu
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

In this paper, we propose a new method for segmenting the moving objects in the difference image sequence, using the adaptive invariable moments (AIM). Following the detection and segmentation of the moving objects, we propose an analysis method of moving direction of moving object. The experiment results show that these methods are robust and effective.
Over-computing CSCL macro scripts? gaining flexibility by using WikiPlus instead of specialized tools for authoring macro scripts
Authors: Beat Döbeli Honegger, Michele P. Notari
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

In this paper we show how teachers can improve collaborative learning by designing and implementing macro scripts and by regulating script sessions using enhanced wikis, called WikiPlus. To achieve optimal collaborative learning it is important to have a well designed script (preparation phase). It is also very important to being able to regulate learners' activities, because some activities can not be predicted in complex pedagogical scenarios as collaborative learning (regulation phase). WikiPlus helps enhancing the collaboration process by enabling the teacher to adapt the script whenever non predicted learner's activities happen. A prototype has been implemented, the impact of different regulation mechanisms on collaboration is discussed and wishes for macro script authoring tools of the future are formulated.
The Application of Wavelet Transform in Electrical Heating Cable Trouble-shooting Testing
Authors: Yilin Shen, Li Li, Bing Li
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

A new trouble-shooting testing method for electrical heating cable based on dyadic wavelet transform is proposed. The paper analyzes the wavelet transform theory used in trouble-shooting testing method. The feature of dyadic wavelet transform is analyzed .The process of denoising and fault location is introduced in detail. The experimental result is analyzed. This method can be used to find the trouble-shooting of the cable rapidly and accurately. It is very important to trouble-shooting testing for electrical heating cable.
Experimental evaluation of a tool for the verification and transformation of source code in event-driven systems
Authors: Gürcan GüleşIr, Klaas Berg, Lodewijk Bergmans, Mehmet Akşit
Venue: Empirical Software Engineering (2009)

In event-driven systems, separating the reactive part of software (i.e., event-driven control) from the non-reactive part is a common design practice. The reactive part is typically structured according to the states and transitions of a system, whereas the non-reactive part is typically structured according to the concepts of the application domain (e.g., the services provided by the system). In such systems, the non-reactive part of software stimulates the reactive part with event calls. Whenever the non-reactive part is modified (e.g., during evolution), the existing event calls may become invalid, new event calls may become necessary, and the two parts of software may become incompatible. Manually finding and repairing these types of defects is a time-consuming and error-prone maintenance task. In this article, we present a solution that combines source code model checking and aspect-oriented programming techniques, to reduce the time spent by developers and to automatically find defects, while performing the maintenance task mentioned above. In addition, we present controlled experiments showing that the solution can reduce the time by 75%, and enable the prevention of one defect per 140 lines of source code.
A SAMC-CDN Network System Based on Cluster Technology
Authors: Huang Jianshe, Ma Zhanjun
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

With the rapid development of Internet and their deep influence on our life, the user number and network traffic are increasing in geometric series on the Internet. The emergence of great lot of applications especially on text, image, advertisement, streaming media and flash require higher flexibility on the network system services. Furthermore, as more and more key applications like E-Commence are running in Internet, any exceptional service interruption will lead to an immeasurable loss. Therefore, high availability of services is more and more important. This article is for the purpose of researching how to alleviate congestion in networks, accelerate the speed of information access, and design appropriate frame in order to establish the network services with high performance, high scalability and high availability.
Single-link failure detection in all-optical networks using monitoring cycles and paths
Authors: Satyajeet S. Ahuja, Srinivasan Ramasubramanian, Marwan M. Krunz
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

In this paper, we consider the problem of fault localization in all-optical networks. We introduce the concept of monitoring cycles (MCs) and monitoring paths (MPs) for unique identification of single-link failures. MCs and MPs are required to pass through one or more monitoring locations. They are constructed such that any single-link failure results in the failure of a unique combination of MCs and MPs that pass through the monitoring location(s). For a network with only one monitoring location, we prove that three-edge connectivity is a necessary and sufficient condition for constructing MCs that uniquely identify any single-link failure in the network. For this case, we formulate the problem of constructing MCs as an integer linear program (ILP). We also develop heuristic approaches for constructing MCs in the presence of one or more monitoring locations. For an arbitrary network (not necessarily three-edge connected), we describe a fault localization technique that uses both MPs and MCs and that employs multiple monitoring locations. We also provide a linear-time algorithm to compute the minimum number of required monitoring locations. Through extensive simulations, we demonstrate the effectiveness of the proposed monitoring technique.
Algorithm for Extracting Loosely Structured Data Records Through Digging Strict Patterns
Authors: Qing Li, Jing Chen, Yipu Wu
Venue: World Wide Web (2009)

Extracting loosely structured data records (LSDRs) has wide applications in many domains, such as forum pattern recognition, Weblogs data analysis, and books and news review analysis. Yet currently existing methods only work well for strongly structured data records (SDRs). In this paper, we propose to address the problem of extracting LSDRs through mining strict patterns. In our method, we utilize both content feature and tag tree feature to recognize the LSDRs, and propose a new algorithm to extract the Data Records (DRs) automatically. The experimental results demonstrate that our algorithm is able to effectively extract LSDRs with higher precision and recall.
Stemming the Qur'an
Authors: Naglaa Thabet
Venue: Proceedings of the Workshop on Computational Approaches to Arabic Script-based Languages (2004)

In natural language, a stem is the morphological base of a word to which affixes can be attached to form derivatives. Stemming is a process of assigning morphological variants of words to equivalence classes such that each class corresponds to a single stem. Different stemmers have been developed for a wide range of languages and for a variety of purposes. Arabic, a highly inflected language with complex orthography, requires good stemming for effective text analysis. Preliminary investigation indicates that existing approaches to Arabic stemming fail to provide effective and accurate equivalence classes when applied to a text like the Qur'an written in Classical Arabic. Therefore, I propose a new stemming approach based on a light stemming technique that uses a transliterated version of the Qur'an in western script.
An Evaluation Approach for Scene Flow with Decoupled Motion and Position
Authors: Andreas Wedel, Tobi Vaudrey, Annemarie Meissner, Clemens Rabe, Thomas Brox, Uwe Franke, Daniel Cremers
Venue: Statistical and Geometrical Approaches to Visual Motion Analysis: International Dagstuhl Seminar, Dagstuhl Castle, Germany, July 13-18, 2008. Revised Papers (2009)

This chapter presents a technique for estimating the three-dimensional displacement vector field that describes the motion of each visible scene point. This displacement field consists of the change in image position, also known as optical flow, and the change in disparity and is called the scene flow. The technique presented uses two consecutive image pairs from a stereo sequence. The main contribution is to decouple the disparity (3D position) and the scene flow (optical flow and disparity change) estimation steps. Thus we present a technique to estimate a dense scene flow field using a variational approach from the gray value images and a given stereo disparity map.Although the two subproblems disparity and scene flow estimation are decoupled, we enforce the scene flow to yield consistent displacement vectors in all four stereo images involved at two time instances. The decoupling strategy has two benefits: Firstly, we are independent in choosing a disparity estimation technique, which can yield either sparse or dense correspondences, and secondly, we can achieve frame rates of 5 fps on standard consumer hardware. This approach is then expanded to real-world displacements, and two metrics are presented that define likelihoods of movement with respect to the background. Furthermore, an evaluation approach is presented to compare scene flow algorithms on long image sequences, using synthetic data as ground truth.
Model Transformation Using Graph Transactions
Authors: Leila Ribeiro, Luciana Foss, Bruno Silva, Daltro Nunes
Venue: Proceedings of the 11th International Conference on Software Reuse: Formal Foundations of Reuse and Domain Engineering (2009)

Model transformations are central to model driven software engineering. The main aim of defining a model transformation is to reuse this model by adapting it to a new situation or context (aims of transformation include synthesis, reverse engineering, migration, optimization, refactoring, etc). Given two metamodels T1 and T2 a model transformation takes as input a model of T1 and delivers as result a corresponding model with respect to T2. Since many modelling languages are diagrammatic (like class-diagrams, message sequence charts, state charts), it is natural to use graphs as a formal basis to describe metamodels of these languages. Rules that transform graphs can be used to describe the transformation process. Here we propose the use graph grammars with transactions to describe model transformations. The notion of (graph) transaction can be very useful in proving essential properties of model transformation, like termination, confluence and correctness.
Querying Heterogeneous Relational Database using SPARQL
Authors: Jinpeng Wang, Zhuang Miao, Yafei Zhang, Bo Zhou
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

The emergence of the Semantic Web has given rise to several researches on semantic integration of heterogeneous relational databases using ontology. This paper studies the query rewriting problem in such an integration scenario. RDF’s graph model lends itself well to expressing relational data. To model the relational schema, we propose a data source describing method based on SPARQL graph patterns and give some principles for semantic mapping between relational schema and RDF ontology. The semantic of query rewriting is further discussed and a query rewriting algorithm is presented so that SPARQL can access heterogeneous relational databases without converting the data into physical triples.
The Evaluation of Geological Environmental Quality and the Partition in Wuhan Megalopolis
Authors: Luojia Zhong, Lianpin Xie, Yanlong Zhou
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

In this paper, the author taking the geological problem of environment and occurred geological disasters evaluating objects, apply GIS HAP to evaluate three subsystems of rock environment, environmental soil, water environment which affect the quality of geological environment of Wuhan megalopolis. By analyzing the main factors which affect the subsystems, the author establishes subsystem hierarchy structure model and quality mathematic exponent model in order to reach the quality exponent of each subsystem which could be utilized quality of each subsystem, based on this, the author carries out a systematic evaluation of geological environment of Wuhan megalopolis.
Evaluating the effects of behavioral realism in embodied agents
Authors: Victoria Groom, Clifford Nass, Tina Chen, Alexia Nielsen, James K. Scarborough, Erica Robles
Venue: International Journal of Human-Computer Studies (2009)

Designers of embodied agents constantly strive to create agents that appear more human-like, with the belief that increasing the human-likeness of agents will improve users' interactions with agents. While designers have focused on visual realism, less attention has been paid to the effects of agents' behavioral realism on users' responses. This paper presents an empirical study that compared three theories of agent realism: Realism Maximization Theory, Uncanny Valley Theory, and Consistency Theory. Results of this study showed that people responded best to an embodied agent when it demonstrated moderately realistic, inconsistent behavior. These results support Uncanny Valley Theory and demonstrate the powerful influence of agent behavior on users' responses.