ppxscal/embedding_network huggingface dataset:
Generating hard SAT/CSP instances using expander graphs
Authors: Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

In this paper we provide a new method to generate hard k-SAT instances. We incrementally construct a high girth bipartite incidence graph of the k-SAT instance. Having high girth assures high expansion for the graph, and high expansion implies high resolution width. We have extended this approach to generate hard n-ary CSP instances and we have also adapted this idea to increase the expansion of the system of linear equations used to generate XORSAT instances, being able to produce harder satisfiable instances than former generators.
Cost Comparison and Control Based on GLM and Panel Data Model: Evidence from Major Citrus Producing Areas in China
Authors: Yu Zhang, Yu Zhao, Chunjie Qi
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

All the major citrus producing areas in China are facing the intensive competition from international market. The problem of how to find an efficient path to decrease citrus production cost by analyzing production cost of citrus and how to promote effective cooperation between regions to deal with the pressure of international market through integrating resources of the regions, has become an important problem that all the major citrus producing areas focus on. The paper firstly compares citrus production cost of the major citrus producing areas, and then reveals the reason causing cost differentiation in the central and eastern areas according to general linear model and panel data, finally proposes several suggestions to control citrus production cost.
A Self-stabilizing K-Clustering Algorithm Using an Arbitrary Metric
Authors: Eddy Caron, Ajoy K. Datta, Benjamin Depardon, Lawrence L. Larmore
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

Mobile ad hoc networks as well as grid platforms are distributed, changing and error prone environments. Communication costs within such infrastructures can be improved, or at least bounded, by using k-clustering. A k-clustering of a graph, is a partition of the nodes into disjoint sets, called clusters, in which every node is distance at most k from a designated node in its cluster, called the clusterhead. A self-stabilizing asynchronous distributed algorithm is given for constructing a k-clustering of a connected network of processes with unique IDs and weighted edges. The algorithm is comparison-based, takes O(nk) time, and uses O(logn + logk) space per process , where n is the size of the network. To the best of our knowledge, this is the first distributed solution to the k-clustering problem on weighted graphs.
A comprehensive simulation tool for the analysis of password policies
Authors: Richard Shay, Elisa Bertino
Venue: International Journal of Information Security (2009)

Modern organizations rely on passwords for preventing illicit access to valuable data and resources. A well designed password policy helps users create and manage more effective passwords. This paper offers a novel model and tool for understanding, creating, and testing password policies. We present a password policy simulation model which incorporates such factors as simulated users, accounts, and services. This model and its implementation enable administrators responsible for creating and managing password policies to test them before giving them to actual users. It also allows researchers to test how different password policy factors impact security, without the time and expense of actual human studies. We begin by presenting our password policy simulation model. We next discuss prior work and validate the model by showing how it is consistent with previous research conducted on human users. We then present and discuss experimental results derived using the model.
Network Awareness in P2P-TV Applications
Authors: Stefano Traverso, Emilio Leonardi, Marco Mellia, Michela Meo
Venue: Proceedings of the 15th Open European Summer School and IFIP TC6.6 Workshop on The Internet of the Future (2009)

The increasing popularity of applications for video-streaming based on P2P paradigm (P2P-TV) is raising the interest of both broadcasters and network operators. The former see a promising technology to reduce the cost of streaming content over the Internet, while offering a world-wide service. The latter instead fear that the traffic offered by these applications can grow without control, affecting other services, and possibly causing network congestion and collapse. The "Network-Aware P2P-TV Application over Wise Networks" FP7 project aims at studying and developing a novel P2P-TV application offering the chance to broadcast high definition video to broadcasters and to carefully manage the traffic offered by peers to the network, therefore avoiding worries to Internet providers about network overload. In such context, we design a simulator to evaluate performance of different P2P-TV solutions, to compare them both considering end-users' and network providers' perspectives, such as quality of service perceived by subscribers and link utilization. In this paper, we provide some results that show how effective can be a network aware P2P-TV system.
SHABaN Multi-agent Team To Herd Cows
Authors: Adel T. Rahmani, Alireza Saberi, Mehdi Mohammadi, Amin Nikanjam, Ehsan Adeli Mosabbeb, Monireh Abdoos
Venue: Programming Multi-Agent Systems: 6th International Workshop, ProMAS 2008, Estoril, Portugal, May 13, 2008. Revised Invited and Selected Papers (2009)

This paper is submitted as the final team description of SHABaN team, one of the participants in the Second Multi-Agent Programming Contest in association with the ProMAS 2008 workshop. Here we describe the agent architecture and behaviors to solve a cooperative task in a highly dynamic environment. Our approach consists of evaluating strategies in NetLogo and a raw implementation.
Constraining separated morphotactic dependencies in finite-state grammars
Authors: Kenneth R. Beesley
Venue: Proceedings of the International Workshop on Finite State Methods in Natural Language Processing (1998)

[Morphology, Morphotactics, Finite State, Separated Dependencies] This paper examines dependencies between separated (non-adjacent) morphemes in natural-language words and a variety of ways to constrain them in finite-state morphology. Methods include running separate constraining transducers at runtime, composing in constraints at compile time, feature unification, and the use of Flag Diacritics. Examples are provided from Modern Standard Arabic. In choosing a practical solution, developers must weigh the size, performance and flexibility of the overall system.
Towards a Modernization Process for Secure Data Warehouses
Authors: Carlos Blanco, Ricardo Pérez-Castillo, Arnulfo Hernández, Eduardo Fernández-Medina, Juan Trujillo
Venue: Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery (2009)

Data Warehouses (DW) manage crucial enterprise information used for the decision making process which has to be protected from unauthorized accesses. However, security constraints are not properly integrated in the complete DWs' development process, being traditionally considered in the last stages. Furthermore, legacy systems need a reverse engineering process in order to accomplish re-documentation for detecting new security requirements as well as system's design recovery to enable migration and reuse. Thus, we have proposed a model driven architecture (MDA) for secure DWs which takes into account security issues from the early stages of development and provides automatic transformations between models. This paper fulfills this architecture providing an architecture-driven modernization (ADM) process focused on obtaining conceptual security models from legacy OLAP systems.
Parser evaluation across frameworks without format conversion
Authors: Wai Lok Tam, Yo Sato, Yusuke Miyao, Jun-ichi Tsujii
Venue: Coling 2008: Proceedings of the workshop on Cross-Framework and Cross-Domain Parser Evaluation (2008)

In the area of parser evaluation, formats like GR and SD which are based on dependencies, the simplest representation of syntactic information, are proposed as framework-independent metrics for parser evaluation. The assumption behind these proposals is that the simplicity of dependencies would make conversion from syntactic structures and semantic representations used in other formalisms to GR/SD a easy job. But (Miyao et al., 2007) reports that even conversion between these two formats is not easy at all. Not to mention that the 80% success rate of conversion is not meaningful for parsers that boast 90% accuracy. In this paper, we make an attempt at evaluation across frameworks without format conversion. This is achieved by generating a list of names of phenomena with each parse. These names of phenomena are matched against the phenomena given in the gold standard. The number of matches found is used for evaluating the parser that produces the parses. The evaluation method is more effective than evaluation methods which involve format conversion because the generation of names of phenomena from the output of a parser loaded is done by a recognizer that has a 100% success rate of recognizing a phenomenon illustrated by a sentence. The success rate is made possible by the reuse of native codes: codes used for writing the parser and rules of the grammar loaded into the parser.
Automatic scoring of children's read-aloud text passages and word lists
Authors: Klaus Zechner, John Sabatini, Lei Chen
Venue: Proceedings of the Fourth Workshop on Innovative Use of NLP for Building Educational Applications (2009)

Assessment of reading proficiency is typically done by asking subjects to read a text passage silently and then answer questions related to the text. An alternate approach, measuring reading-aloud proficiency, has been shown to correlate well with the aforementioned common method and is used as a paradigm in this paper. We describe a system that is able to automatically score two types of children's read speech samples (text passages and word lists), using automatic speech recognition and the target criterion "correctly read words per minute". Its performance is dependent on the data type (passages vs. word lists) as well as on the relative difficulty of passages or words for individual readers. Pearson correlations with human assigned scores are around 0.86 for passages and around 0.80 for word lists.
Performance Modeling in Intelligent Educational Networks: Performance Modeling and Knowledge Processing in Intelligent Educational Networks
Authors: Marcos Pinto
Venue:  (2009)

The paradigm of accessing knowledge using network technology is part of the everyday task of learning. However, it is a daunting mission to seek the right piece of information among data available in the internetworks. This book focuses on optimizing knowledge processing through the use of intelligent networks in a campus environment. The initial part of this book provides you with the analysis of the data traffic characteristics of campus networks in order to develop insight into their operation and performance. Intelligent components are then included in the network architecture turning it into an intelligent educational network. The book introduces a methodology for understanding network traffic behavior through the combination of quality of service, degradation policies, and a queue scheme. It also suggests a new approach in routing network packets intelligently by dividing the application layer into layers that deals with the forwarding packet process, the quality of service integrated into the packet, and the type of application the packet belongs to.
S-IAMB Algorithm for Markov Blanket Discovery
Authors: Zhang Yishi, Xu Hong, Huang Yang, Qian Gangyi
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

Using Markov Blanket for feature selection is one of important methods in machine learning. This paper analyses IAMB algorithm for discovering the Markov Blanket of a target variable from training data. Based on its characters and deficiency we introduce an improve algorithm of IAMB: SIAMB.The experimental results show that the S-IAMB algorithm performs better than IAMB by finding Markov Blanket of variables of ALARM dataset and by testing the performance with the classification tasks.
A Novel Available Bandwidth Measurement Method Based on the Pathload
Authors: Bo Wang, Xiangmin Wen, Yong Sun, Wei Zhen
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

In this paper, we present a new available bandwidth measurement method with the characters of fast-convergence and high-accuracy, which is the improvement of Pathload. Pathload sends probe stream at specific rate and estimates the available bandwidth from the inference of self-induced congestion. Contrary to traditional Pathload method, the new method infers the congestion from two parameters, which are based on the one-way delay variation. The first parameter which indicates the trend of one-way delay can make the available bandwidth more accuracy than the Pathload, and the second parameter makes the measurment procedure very fast which does not induce congestion to cross-traffic. We test our method in controlled enviroment using NS2 and compare it with the Pathload. The results show that our new method provides high accurate available bandwidth with fast convergence.
Imprinted polymer stamps for UV-NIL
Authors: T. Haatainen, T. Mäkelä, J. Ahopelto, Y. Kawaguchi
Venue: Microelectronic Engineering (2009)

Thermal step and stamp nanoimprint lithography (SSIL) offers an alternative to fabricate transparent polymer stamps for UV-imprinting. The fabrication process does not require any other subsequent steps, e.g. dry etching or anti adhesive coating. In this work, we have manufactured UV-stamp by combining patterns of two different silicon masters. The patterns of the silicon masters were transferred into resin coated quartz plate by sequential imprinting. The first master consisted gratings with 50nm features and the second master consisted dot arrays of 350nm diameter features. The novel idea is the ability to create a large UV-stamp using a combination of small masters. Thus fabricated UV-stamps were used for demonstrating step and repeat UV-imprinting. The quality of the UV-stamps and imprints were analyzed by AFM. High fidelity patterns were achieved in respect to patterns in the original silicon master.
BigKey: A Virtual Keyboard for Mobile Devices
Authors: Khaldoun Al Faraj, Mustapha Mojahid, Nadine Vigouroux
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part III: Ubiquitous and Intelligent Interaction (2009)

This paper describes BigKey virtual keyboard for mobile devices, designed to make the keys of virtual keyboard easier to acquire. The tiny size of keys makes efficient selection difficult. To overcome this drawback, we propose to expand key size that corresponds to next character entry. The proposed solution helps to facilitate the selection task by expanding the next entry. Moreover the prediction system reduces the visual scanning time to find letters that one is looking for. Users' performance study showed that they were 25.14% faster and more accurate with BigKey virtual keyboard than with normal virtual keyboard.
A Negotiation Mechanism Based on Fuzzy Preferences and Time Constraints
Authors: Zhaoming Wang
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

Business negotiation is a key technique for the development of electronic commerce.Negotiation is a means for agents to communicate and compromise to reach mutually beneficial agreements. This paper presents a new model for bilateral multi-objective negotiation under fuzzy preferences and time constraints in an incomplete information setting. This paper employs the theory of fuzzy mathematicsto analyze negotiation model,In this model, the order in which objects are bargained over and agreements are reached is determined exogenously, as part of the bargaining equilibrium. In this context, This paper proposes nine negotiation scenarios based on the agents’ fuzzy preferences and time constraints. The analysis on this model shows that the negotiation can reach equilibrium before the deadlines in all proposed negotiation scenarios. This result is checked by using a numerical experiment to simulate the negotiation process.
A Simplified and Fast Fully Scalable Video Coding Scheme with Hierarchical-B-Picture-Like and DWT
Authors: Shuguang Su, Yueming Su
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

The paper proposes a simplified and fast fully scalable video coding (SVC) scheme for video communication over error prone channels and surveillance systems, such as wireless and mobile network characterized with vibrating bandwidth. The proposed scheme supports three types of scalability of temporal, resolution and SNR and any combination scalability of them. It uses a novel Hierarchical-B-Picture-Like technology to gain temporal scalability, DWT for spatial scalability, successive multi-level quantization and SPIHT together for quality scalability. The proposed scheme provides an embedded bitstream that can be easily adapted (reordered) to a given bandwidth, resolution and SNR requirements. Simulation results show the scheme has the advantages of being simple, flexible, and acceptable quality.
A Knowledge Based CAD System for Hydraulic Actuators
Authors: Jun Wang, Qingzhi Meng
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

This paper discusses the key problems for case based and ruled-based intelligent design system in order to shorten the product cycle; make full use of the available designing resources and implement the intelligent and rapid response design for hydraulic actuators. The framework and the working process of the CAD system are introduced. The knowledge involved in the design process is divided into three types: rules, cases, and 3-D case model. In CBR, each available design result is considered as a case, so we must represent each case in a way computer can understand. In this paper, not only a series of data is structured for each case, but also the complicated assembly is represented in a hierarchical data structure and 3-D models are created with Pro/E parametric modeling function to facilitate the design process.
Implications of Acoustic Variation for the Segmentation of the Czech Trill /r/
Authors: Pavel Machač
Venue: Cross-Modal Analysis of Speech, Gestures, Gaze and Facial Expressions: COST Action 2102 International Conference Prague, Czech Republic, October 15-18, 2008 Revised Selected and Invited Papers (2009)

The Czech alveolar sonorant trill /r/, like liquids generally, constitutes a challenge from the point of view of locating its boundaries in the acoustic stream. As it is desirable to label and segment a phonetic corpus uniformly and also to facilitate a high degree of inter-labeller agreement, rules for specifying speechsound boundaries should be unambiguous and as straightforward as possible. In this study, we examined various acoustic forms of Czech /r/ --- from the trill and a flap to strongly reduced instances --- and their implications for segmentation. The above-mentioned requirements resulted in the necessity to treat the segmentation of intervocalic items of /r/ differently from items occurring in consonant clusters.
The ultimate guest speaker: a model for educator/practitioner collaboration
Authors: Josh Tenenberg
Venue: Journal of Computing Sciences in Colleges (2009)

This paper describes a unique model for bringing professional practice into the computer science classroom. It does so by pairing a practicing professional with a practicing educator to plan and teach a course, thereby exploiting what each does best. This model was instantiated in 2009 between the author and an interaction designer from Google.
Designing a mobile application to capture everyday activity
Authors: Lynne Baillie, Lee Morton, Gillian MacLellan, Gemma Ryde
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

Despite the importance of physical activity to health, many people do not meet the recommended guidelines for physical activity. In order to gain a greater understanding of people's activity levels and patterns in everyday life we designed a mobile activity monitoring application, which resides on mobile phones which utilizes the accelerometer and GPS (either as an externally attached component or as in internal component) data. We designed the system to be used by any member of the public and then redesigned the system given continuous feedback from three sets of local authority workers who were just about to commence a walking led scheme. We logged their activity over a week long period.
An incremental dimensionality reduction method on discriminant information for pattern classification
Authors: Xiaoqin Hu, Zhixia Yang, Ling Jing
Venue: Pattern Recognition Letters (2009)

From the view of classification, linear discriminant analysis (LDA) is a proper dimensionality reduction method which finds an optimal linear transformation that maximizes the class separability. However it is difficult to apply LDA in under sampled problems where the number of data samples is smaller than the dimensionality of data space, due to the singularity of scatter matrices caused by high-dimensionality. In order to make LDA applicable, we propose a new dimensionality reduction algorithm called discriminant multidimensional mapping (DMM), which combines the advantages of multidimensional scaling (MDS) and LDA. DMM is effective for small sample datasets with high-dimensionality. Its superiority is given from theoretical point of view. Then we extend DMM for large datasets and datasets with non-linear manifold respectively, and get two algorithms: landmark DMM (LDMM) and geodesic-metric discriminant mapping (GDM). The performances of these algorithms are also shown by preliminary numerical experiments.
Making speech look like text in the Regulus development environment
Authors: Elisabeth Kron, Manny Rayner, Marianne Santaholma, Pierrette Bouillon, Agnes Lisowska
Venue: Proceedings of the Workshop on Grammar Engineering Across Frameworks (2008)

We present an overview of the development environment for Regulus, an Open Source platform for construction of grammar-based speech-enabled systems, focussing on recent work whose goal has been to introduce uniformity between text and speech views of Regulus-based applications. We argue the advantages of being able to switch quickly between text and speech modalities in interactive and offline testing, and describe how the new functionalities enable rapid prototyping of spoken dialogue systems and speech translators.