ppxscal/embedding_network huggingface dataset:
Dynamic arc consistency for CSPs
Authors: Malek Mouhoub
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2009)

Constraint Satisfaction Problems (CSPs) are fundamental in many real world applications such as interpreting a visual image, laying out a silicon chip, frequency assignment, scheduling, planning and molecular biology. A main challenge when designing a CSP-based system is the ability to deal with constraints in a dynamic and evolutive environment. We talk then about on line CSP-based systems capable of reacting, in an efficient way, to any new external information during the constraint resolution process. During the conceptual phase of design, for example, the designers should be able to add/remove constraints at any time after specifying an initial statement describing the desired properties of a required artifact. We propose in this paper a new algorithm capable of dealing with dynamic constraints at the arc consistency level of the resolution process. More precisely, we present a new dynamic arc consistency algorithm that has a better compromise, in practice, between time and space than those algorithms proposed in the literature, in addition to the simplicity of its implementation. Experimental tests on randomly generated CSPs as well as on CSPs involving temporal constraints (that we call TCSPs), have been conducted. The results of the experimentation demonstrate the efficiency, in time and space costs, of our algorithm to deal with large size CSPs in a dynamic environment.
Design and evaluation of lightweight middleware for personal wireless body area network
Authors: Agustinus Borgy Waluyo, Isaac Pek, Xiang Chen, Wee-Soon Yeoh
Venue: Personal and Ubiquitous Computing (2009)

This paper presents a lightweight middleware to be used for wireless medical body area networks. The middleware is designed to reside in mobile devices, and acts as a gateway to receive sensor data as well as to control a set of sensor devices attached to the wearer. The main essence of the middleware is to simplify and accelerate the development of wireless healthcare applications by providing highly reusable codes. The architecture of the middleware including its main functions such as data acquisition, dynamic plug-and-play capabilities, on-the-fly sensor reconfiguration, and resource management (i.e., sensor sleep/wake-up, critical self-wake) will be discussed. A security feature as a means to protect critical sensor data from malicious/unauthorized parties has also been incorporated in our proposed middleware. The prototype system of the middleware has been built and is presented in this paper together with its performance measurements.
A Grid Index Based Method for Continuous Constrained Skyline Query over Data Stream
Authors: Li Zhang, Yan Jia, Peng Zou
Venue: Advances in Web and Network Technologies, and Information Management: APWeb/WAIM 2009 International Workshops: WCMT 2009, RTBI 2009, DBIR-ENQOIR 2009, PAIS 2009, Suzhou, China, April 2-4, 2009, Revised Selected Papers (2009)

As an essential query, skyline computation over data stream is very important for many on-line applications, including mobile environment, network monitoring, communication, sensor network and stock market trading, etc. Different from most popular skyline processing methods that deal with the whole data set, this paper focuses on constrained skyline processing over data stream. We employ a grid based index to store the tuples and put forward two algorithms to compute and maintain skyline set based on it. We also define Influence Area for every query to minimize the cells need to be processed when new tuples arrive and old tuples expire. Theoretical analysis and experimental evidences show the efficiency of proposed approaches.
WSPE: a peer-to-peer grid programming environment
Authors: Romulo B. Rosinha, Cláudio F. R. Geyer, Patrícia Kayser Vargas
Venue: Concurrency and Computation: Practice Experience (2009)

Grid programming environments are tools designed to isolate users from issues such as heterogeneity, scalability and adaptability, thus simplifying the use of a Grid infrastructure. This paper presents work stealing programming environment (WSPE), a Grid programming environment for Grid-unaware applications. WSPE can be defined as a programming environment, since it is a software tool that presents both a programming model and an execution system. The WSPE consists of a simple programming interface and a fully decentralized runtime system following a peer-to-peer organization, both presented in this paper. It's runtime system employs a new scheduling mechanism, known as round stealing, inspired by the idea of work stealing. The main focus of our work is to research on methods to achieve efficient execution of parallel applications in a Grid computing infrastructure. By simulation, we show that our scheduling mechanism outperforms a more traditional mechanism in a Grid environment. We also demonstrate how an appropriate choice for a network overlay mechanism can further improve the execution efficiency. Copyright &copy; 2009 John Wiley & Sons, Ltd.
Comparison of Different Talking Heads in Non-Interactive Settings
Authors: Benjamin Weiss, Christine Kühnel, Ina Wechsung, Sebastian Möller, Sascha Fagel
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part III: Ubiquitous and Intelligent Interaction (2009)

Six different talking heads have been evaluated in two consecutive experiments. Two text-to-speech components and three head components have been used. Results from semantic differentials show a clear preference for the most human-like and expressive head. The analysis of the semantic differentials reveals three factors each. These factors show different patterns for the head components. Overall quality is strongly related to one factor, which covers the quality aspect `appearance'. Another factor found in both experiments comprises `human likeliness' and `naturalness' and is much less correlated with overall quality. While subjects have been able to clearly separate all head components with different factors of the semantic differential, only some of these factors are relevant for explicit quality ratings. A good appearance seems to affect the perception of sympathy and the ascription of reliability.
Towards a methodology for building collaborative learning applications
Authors: Jacques Lonchamp
Venue: Proceedings of the 8th international conference on International conference for the learning sciences - Volume 3 (2008)

Future collaborative learning technologies are characterized by the CSCL community as highly malleable and flexible. A promising approach for meeting these expectations is to use explicit models which parameterize a generic kernel for flexibly supporting different kinds of collaborative applications. This technical orientation raises complex issues related to the production of such operational models. A preliminary process for supporting non-specialist teachers in charge of designing collaborative learning application models is briefly outlined in this paper.
Energy Conversation and Emission Reduction Management Based on the Lifecycle of Virtual Enterprise
Authors: Hui Ding, Jinzhao An
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

Describes the virtual enterprise life cycle theory. Builds integrated energy saving and letting out reduction management model of virtual enterprise. Studies the management of building stage, running stage, development stage and terminate stage. points out virtual enterprise energy saving and letting out reduction management is a dynamic process running through the virtual enterprise life cycle.
Time Evaluation for WTA Hopfield Type Circuits Affected by Cross-Coupling Capacitances
Authors: Ruxandra L. Costea, Corneliu A. Marinov
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

A continuous time neural network of Hopfield type is considered. It is a W(inner) T(akes) A(ll) selector. Its inputs are capacitively coupled to model the parasitics or faults of overcrowded chip layers. A certain parameter setting allows the correct selection of the maximum element from an input list. As processing time is a performance criterion, we infer upper bounds of it, explicitly depending on circuit and list parameters. Our method consists of converting the system of nonlinear differential equations describing the circuit to a system of decoupled linear inequalities. The results are checked by numerical simulation.
User guided audio selection from complex sound mixtures
Authors: Paris Smaragdis
Venue: Proceedings of the 22nd annual ACM symposium on User interface software and technology (2009)

In this paper we present a novel interface for selecting sounds in audio mixtures. Traditional interfaces in audio editors provide a graphical representation of sounds which is either a waveform, or some variation of a time/frequency transform. Although with these representations a user might be able to visually identify elements of sounds in a mixture, they do not facilitate object-specific editing (e.g. selecting only the voice of a singer in a song). This interface uses audio guidance from a user in order to select a target sound within a mixture. The user is asked to vocalize (or otherwise sonically represent) the desired target sound, and an automatic process identifies and isolates the elements of the mixture that best relate to the user's input. This way of pointing to specific parts of an audio stream allows a user to perform audio selections which would have been infeasible otherwise.
One-dimensional mathematical and numerical modeling of liquid dynamics in a horizontal capillary
Authors: Giovanni Cavaccini, Vittoria Pianese, Alessandra Jannelli, Salvatore Iacono, Riccardo Fazio
Venue: Journal of Computational Methods in Sciences and Engineering (2009)

This paper is concerned with a mathematical and numerical study of liquid dynamics in a horizontal capillary. We derive a two-liquids model for the prediction of capillary dynamics. This model takes into account the effects of real phenomena: like the outside flow action, or the entrapped gas inside a closed-end capillary. Moreover, the limitations of the one-dimensional model are clearly indicated. Finally, we report on several tests of interest: an academic test case that can be used to check available numerical methods, a test for decreasing values of the capillary radius, a simulation concerning a closed-end capillary, and two test cases for two liquids flow. In order to study the introduced mathematical model, our main tool, is a reliable one-step adaptive numerical approach based on a one-step one-method strategy.
Correlation Based Node Behavior Profiling for Enterprise Network Security
Authors: Su Chang, Thomas E. Daniels
Venue: Proceedings of the 2009 Third International Conference on Emerging Security Information, Systems and Technologies (2009)

Node behavior profiling is a promising tool for many aspects in network security. In our research, our goal is to couple node behavior profiles with statistical tests with a focus on enterprise security. Limited work has been done in the literature. In this paper, we first propose a correlation based node behavior profiling approach to study node behaviors in enterprise network environments. We then propose formal statistical test on the most common behavior profiles which is able to detect worm propagation. In our initial studies, we evaluate our profiling and detection schemes using real enterprise data (LBNL traces). The results show that the correlation based node behavior profiling approach can capture normal behaviors of different types. Consequently, the behavior profiles are promising for anomaly detection when coupled with statistical methods.
Incremental Answer Completion in the SLG-WAM
Authors: Terrance Swift, Alexandre Miguel Pinto, Luís Moniz Pereira
Venue: Proceedings of the 25th International Conference on Logic Programming (2009)

The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true or false in WFS. The reason for this is that the XSB does not implement the SLG Answer Completion operation in its engine, the SLG-WAM --- rather Answer Completion must be performed by post-processing the table. This engine-level omission has not proven significant for applications so far, but the need for Answer Completion is becoming important as XSB is more often used to produce well-founded residues of highly non-stratified programs. However, due to its complexity, care must be taken when adding Answer Completion to an engine. In the worst case, the cost of each Answer Completion operation is proportional to the size of a program P, so that the operation must be invoked as rarely as possible, and when invoked the operation must traverse as small a fragment as possible of P. We examine the complexity of Answer Completion; and then describe its implementation and performance in XSB's SLG-WAM such that the invocations of the operation are restricted, and which is limited in scope to Strongly Connected Components within a tabled evaluation's Subgoal Dependency Graph.
Personas Layering: A Cost Effective Model for Service Design in Medium-Long Term Telco Research Projects
Authors: Alessandro Marcengo, Elena Guercio, Amon Rapp
Venue: Proceedings of the 1st International Conference on Human Centered Design: Held as Part of HCI International 2009 (2009)

Creating a set of Personas requires a considerable effort. Socio-psychological characteristic must be very punctually defined, needs and goals must also be well investigated and related to the service that will be designed. The accurate collection and processing of this large amount of qualitative and quantitative data represents often a huge cost. In our research area, which deals mainly with medium to long term telco projects, we developed a Personas layering model that allows us to adapt them over different contexts. The model consists in two main elements; the basic "Persona" and the "external" layer. In this paper we gave a practical application of our model within different projects developed in our research area. The benefits that arise from this model are the "durability" of Personas, their re-use in different contexts, the modularity of components and their possible recombination, thus reducing costs while maintaining excellent design insights.
The Study on the Acceleration Signal Processing Based on the TVAR Algorithm
Authors: Shihu Wang, Mingjie Liu
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

Abstract—Penetration acceleration signal is a kind ofnon-stationary random signal, the occurrence of which lastinga very short period of time, and the conventionaltime-frequency analysis and non-parametric modelingmethods can not effectively analyze and deal with suchsignals. In this paper, time-varying autoregressive (TVAR)algorithm is used to achieve the parametric modeling of thenon-stationary random penetration signal, through thetime-varying spectrum estimationthe method is verified withhigh resolution. Based on the simulation analysis, this paperresolves the model parameters with the application of the basefunction expansion. Through the study on the pole parametersphase information, the characteristics of information of theinstantaneous frequency is extracted, while the accelerationsignal characteristics such as layer events, void event areeffectively obtained, and these works provided the algorithmbasis and reference for the penetration of precise burst controltechnology.
PBA*: using proactive search to make A* robust to unplanned deviations
Authors: Paul Breimyer, Peter R. Wurman
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

Many path planning algorithms leverage A* to determine optimal paths. However, when an actor deviates from the optimal path, a typical application of A* executes a new search from the deviation point to the goal. This approach redundantly calculates paths that may have been examined during the initial search, rather than leveraging previous information. We introduce Plan-B A* (PBA*), which uses A* for the initial search, and substantially reduces the number of searched states during all subsequent searches, while incurring minimal space overhead. PBA* not only remembers certain states it has examined, it proactively creates solution paths for the most likely deviations. In our experiments, PBA* searches only 10% of the A* search space when recovering from execution errors by storing a limited amount of search history.
Relative rank statistics for dialog analysis
Authors: Juan M. Huerta
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

We introduce the relative rank differential statistic which is a non-parametric approach to document and dialog analysis based on word frequency rank-statistics. We also present a simple method to establish semantic saliency in dialog, documents, and dialog segments using these word frequency rank statistics. Applications of our technique include the dynamic tracking of topic and semantic evolution in a dialog, topic detection, automatic generation of document tags, and new story or event detection in conversational speech and text. Our approach benefits from the robustness, simplicity and efficiency of non-parametric and rank based approaches and consistently outperformed term-frequency and TF-IDF cosine distance approaches in several experiments conducted.
HBS: A Single-Key Mode of Operation for Deterministic Authenticated Encryption
Authors: Tetsu Iwata, Kan Yasuda
Venue: Fast Software Encryption: 16th International Workshop, FSE 2009 Leuven, Belgium, February 22-25, 2009 Revised Selected Papers (2009)

We propose the HBS (Hash Block Stealing) mode of operation. This is the first single-key mode that provably achieves the goal of providing deterministic authenticated encryption. The authentication part of HBS utilizes a newly-developed, vector-input polynomial hash function. The encryption part uses a blockcipher-based, counter-like mode. These two parts are combined in such a way as the numbers of finite-field multiplications and blockcipher calls are minimized. Specifically, for a header of h blocks and a message of m blocks, the HBS algorithm requires just h + m + 2 multiplications in the finite field and m + 2 calls to the blockcipher. Although the HBS algorithm is fairly simple, its security proof is rather complicated.
Integrating genomic binding site predictions using real-valued meta classifiers
Authors: Yi Sun, Mark Robinson, Rod Adams, Rene te Boekhorst, Alistair G. Rust, Neil Davey
Venue: Neural Computing and Applications (2009)

Currently the best algorithms for predicting transcription factor binding sites in DNA sequences are severely limited in accuracy. There is good reason to believe that predictions from different classes of algorithms could be used in conjunction to improve the quality of predictions. In this paper, we apply single layer networks, rules sets, support vector machines and the Adaboost algorithm to predictions from 12 key real valued algorithms. Furthermore, we use a &#x2018;window&#x2019; of consecutive results as the input vector in order to contextualise the neighbouring results. We improve the classification result with the aid of under- and over-sampling techniques. We find that support vector machines and the Adaboost algorithm outperform the original individual algorithms and the other classifiers employed in this work. In particular they give a better tradeoff between recall and precision.
The macro-structure of use of help
Authors: Oscar D. Andrade, Nathaniel Bean, David G. Novick
Venue: Proceedings of the 27th ACM international conference on Design of communication (2009)

Users of help systems often complain that they do not find them useful; while they still use help at least occasionally, they resort to other problem-solving strategies. In this paper, we analyze audiovisual recordings of people using a computer application, to identify (1) transition patterns among problem-solving approaches, and (2) the frequency of these transitions. Our analysis indicates that people switch frequently between consulting help and exploring the interface. Switching between problem-solving approaches appears to be an effective way of succeeding in tasks. Applications and their help systems can be better designed to support users who switch between help and non-help approaches to solving problems.
Professional ASP.NET 3.5 SP1 Edition: In C# and VB
Authors: Bill Evjen, Scott Hanselman, Devin Rader
Venue: Wrox Programmer To Programmer (2009)

Professional ASP.NET 3.5 SP1 In C# and VB ASP.NET 3.5 brings the power of Visual Studio 2008 along with the multitude of language improvements in C# 2008 and Visual Basic 2008 as well as powerful new technology called LINQ, together with the ASP.NET 2.0 Framework you already know and love. Packed with valuable coverage of ASP.NET 3.5 SP1, this essential resource offers both C# and VB examples throughout the book, and shares new and updated content on the ADO.NET Entity Framework, ADO.NET Dynamic Data, and ADO.NET Data Services. While ASP.NET 3.5 boasts server controls like the ListView and the incredibly flexible GridView, it also includes advancements in AJAX technology combined with JavaScript debugging features in Visual Studio 2008. With this book, a stellar author team covers the new controls in the AJAX toolbox, the back button history, and script combining, and they also examine the new capabilities of WCF including changes to DataContractSerializer. In addition, the accompanying CD-ROM features the entire book in PDF format. What you will learn from this book The concepts underlying the server control and its pivotal role in ASP.NET development How to create templated ASP.NET pages using the master page feature How to work with data from enterprise databases including SQL Server Ways to debug, package, and deploy ASP.NET applications, monitor their health and performance, and handle errors How to retrieve, update, and delete data quickly and logically using LINQ with side-by-side examples comparing LINQ to existing techniques Ways to localize your web site in multiple languages for a world-wide audience Methods for adding AJAX capabilities to your ASP.NET applications The many benefits of the new data access additions Ways to use and extend the Provider Model for accessing data stores, processes, and more What freeware tools you need in Scott Hanselman's ASP.NET Ultimate Developer Tools appendix Who this book is for This book is for programmers and developers who are looking to make the transition to ASP.NET 3.5 SP1 with Visual Studio 2008 and either C# 3.0 (2008) or Visual Basic 9 (2008). CD-ROM includes the full book in PDF format and a selection of 7 Wrox Blox mini e-books including: Internet Explorer 8 and Its Impact on Your ASP.NET Web Sites Jumping from ASP.NET to Silverlight 2 Leverage LINQ in ASP.NET 3.5 Projects
A Markov Process-Based Model for the B2B E-commerce Trust Evaluation
Authors: Zhigang Lu, Wenbin Ma
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

In this paper, we explore the trust evaluation system of the enterprise in B2B e-commerce business and establish a trust evaluation model based on the Markov process, which includes time, the heavy-weight of transactions and the reputation of buying agents as the restraining variables. They control the five effect factors for building a stably credit evaluation model. It’s confirmed that the Markov process-based model for the B2B e-commerce trust evaluation has better stability and the ability for anti-jamming through the simulation. The result of the experiment indicates we calculate the trust of selling agents factually by the trust evaluation model of this paper and reduce the risk of transaction.