ppxscal/embedding_network huggingface dataset:
Towards Automated FSMD Partitioning for Low Power Using Simulated Annealing
Authors: Nainesh Agarwal, Nikitas J. Dimopoulos
Venue: Proceedings of the 9th International Workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2009)

We propose a technique to efficiently partition a FSMD (Finite State Machine with Datapath) using a simulated annealing approach. The FSMD is split into two or more simpler communicating processors. These separate processors can then be clock gated or power gated to achieve dramatic power savings since only one processor is active at any given time. We develop a framework to estimate the potential power savings from partitioning. Using several sample circuits, the estimation framework shows that when the original machine is partitioned into two submachines, on average, 32% static power savings and 19% dynamic power savings can be expected, with a performance impact of 2%. The power savings with more than two partitions can be even higher, with a larger performance impact.
Design and Implementation of Dynamic Web Security and Defense Mechanism Based on NDIS Intermediate Driver
Authors: Shuo Dai, Ye Du
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

To design and build a dynamic web security and defense mechanism, we use Device Driver Kit (DDK) Pass thru routine as the framework and adopt a method of capture based on Network Driver Interface Specification (NDIS) intermediate driver to realize non-bypassing monitoring of all packets; study, design and test detection rules against SQL injection attack and Cross-Site Scripting (CSS) attack; build a pervasive dynamic security system integrating Intrusion Detection System (IDS) and Firewall.Once an intrusion is detected, this Interaction Agent starts to work immediately followed by modification of firewall access control polices, thus complete security control is achieved.
Grocery Product Recommendations from Natural Language Inputs
Authors: Petteri Nurmi, Andreas Forsblom, Patrik Floréen
Venue: Proceedings of the 17th International Conference on User Modeling, Adaptation, and Personalization: formerly UM and AH (2009)

Shopping lists play a central role in grocery shopping. Among other things, shopping lists serve as memory aids and as a tool for budgeting. More interestingly, shopping lists serve as an expression and indication of customer needs and interests. Accordingly, shopping lists can be used as an input for recommendation techniques. In this paper we describe a methodology for making recommendations about additional products to purchase using items on the user's shopping list. As shopping list entries seldom correspond to products, we first use information retrieval techniques to map the shopping list entries into candidate products. Association rules are used to generate recommendations based on the candidate products. We evaluate the usefulness and interestingness of the recommendations in a user study.
Implementing what we know about learning in a middle-school curriculum for widespread dissemination: the project-based inquiry science (PBIS) story
Authors: Janet L. Kolodner, Mary L. Starr, Daniel Edelson, Barbara Hug, David Kanter, Joseph Krajcik, Juliana A. Lancaster, Thomas A. Laster Jennifer Leimberer, Brian J. Reiser, Michael T. Ryan, Rebecca Schneider, LeeAnn M. Sutherland
Venue: Proceedings of the 8th international conference on International conference for the learning sciences - Volume 3 (2008)

Project-Based Inquiry Science (PBIS) is a comprehensive technology-enhanced science curriculum for grades 6 through 8 (ages 12-14), designed based on foundations in the learning sciences. Most of its units were developed during the 1990's at Georgia Institute of Technology, Northwestern University, and University of Michigan. Over the past five years, researchers at these universities (and others) have been working to pull the units together into a curriculum that can be disseminated nationally (in the U.S.). During the last two years, we have been working closely with the publishing company, It's About Time, to bring the curriculum to publication. We present the research foundations of PBIS along with the pragmatics of incorporating individual units into an integrated curriculum appropriate that addresses the diverse requirements of 50 states while also addressing the diverse needs of learners.
Di-codon Usage for Gene Classification
Authors: Minh N. Nguyen, Jianmin Ma, Gary B. Fogel, Jagath C. Rajapakse
Venue: Proceedings of the 4th IAPR International Conference on Pattern Recognition in Bioinformatics (2009)

Classification of genes into biologically related groups facilitates inference of their functions. Codon usage bias has been described previously as a potential feature for gene classification. In this paper, we demonstrate that di-codon usage can further improve classification of genes. By using both codon and di-codon features, we achieve near perfect accuracies for the classification of HLA molecules into major classes and sub-classes. The method is illustrated on 1,841 HLA sequences which are classified into two major classes, HLA-I and HLA-II. Major classes are further classified into sub-groups. A binary SVM using di-codon usage patterns achieved 99.95% accuracy in the classification of HLA genes into major HLA classes; and multi-class SVM achieved accuracy rates of 99.82% and 99.03% for sub-class classification of HLA-I and HLA-II genes, respectively. Furthermore, by combining codon and di-codon usages, the prediction accuracies reached 100%, 99.82%, and 99.84% for HLA major class classification, and for sub-class classification of HLA-I and HLA-II genes, respectively.
Advanced Bilinear Image Interpolation Based on Edge Features
Authors: Heechang Kim, Sangjun Park, Jin Wang, Yonghoon Kim, Jechang Jeong
Venue: Proceedings of the 2009 First International Conference on Advances in Multimedia (2009)

A variety of image interpolation methods have been used in order to obtain high-resolution (HR) images. In this paper, we propose an advanced bilinear interpolation algorithm which improves edge components. The conventional bilinear image interpolation method has a serious problem such as blurring artifacts. In the experimental results, our proposed algorithm outperforms the bilinear image interpolation not only objective qualities but also subjective qualities.
Demo abstract: An ultra-compact and multiple channel protocol for ultra-tiny wireless sensor nodes
Authors: Chong-Jing Chen, Pai H. Chou, Stephen F. Jenks, Sung-Jin Kim
Venue: Proceedings of the 2009 International Conference on Information Processing in Sensor Networks (2009)

We demonstrate a system is comprised of a single-hop network structure with ultra-compact sensor nodes densely deployed and operating at non-trivial data rates. The contribution of our research is a light-weight, multi-channel protocol which minimizes the complexities on the sensor nodes while retaining high flexibility and high scalability. The data streams collected by the base stations are transmitted over the Fast Ethernet to the host for real-time data logging. The system keeps gathering data in a network of 100 sensor nodes organized as two frequency groups, and all sensor nodes are deployed within 2m2 area.
Optimal Portfolio Selection under the Short-range Fractional Brownian Motion
Authors: Jianwei Gao
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

In this paper, we study the classical portfolio selection problem and extend the Brownian motion about the noises involved in the dynamics of wealth to a short-range fractional Brownian motion. Instead of using the classical tool of optimal control as optimization engine, we convert the stochastic optimal control problem into a non-random optimization by using Hamilton and Lagrange multiplier, and conclude the solution of the initial problem. Based on deterministic optimal control principle, we obtain the explicit solution of the optimal strategies. Finally, we present a simulation and analyze the sensitivity of the fractional order to the optimal strategy.
Wireless Networked Control Systems with Nonlinear Control and Novel Smith Predictor
Authors: Feng Du, Wencai Du
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

This paper aims to the random and uncertain network delays, as well as controlled plant might be time-variant or nonlinear, a novel approach is proposed that novel Smith predictor combined with nonlinear control for wireless networked control systems (WNCS). This novel Smith predictor comes true to hide predictor models of the network delays into real network data transmission processes, therefore network delays don’t need to be measured, identified or estimated on-line. Based on IEEE 802.15.4 (ZigBee), the results of simulation show validity of this control scheme, and indicate that system has better dynamic performance and anti-jamming ability.
Distributed iterative optimal resource allocation with concurrent updates of routing and flow control variables
Authors: Jayakrishnan Nair, D. Manjunath
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

Consider a set of active elastic sessions over a network. Session traffic is routed at each hop (potentially through multiple network paths) based only on its destination. Each session is associated with a concave increasing utility function of its transfer rate. The transfer rates of all sessions and the routing policy define the operating point of the network.We construct a metric f of the goodness of this operating point. f is an increasing function of the session utilities and a decreasing function of the extent of congestion in the network.We define"good" operating points as those that maximizef, subject to the capacity constraints in the network. This paper presents a distributed, iterative algorithm for adapting the session rates and the routing policy across the network so as to converge asymptotically to the set of "good" operating points. The algorithm updates session rates and routing variables concurrently and is, therefore, amenable to distributed online implementation. The convergence of the concurrent update scheme is proved rigorously.
Introduction
Authors: Domenico Talia, Jason Maassen, Fabrice Huet, Shantenu Jha
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

The Parallel and Distributed Programming Topic, Topic 9, is concerned with the development of parallel or distributed applications. Developing such applications is a difficult task and it requires advanced algorithms, realistic modeling, efficient design tools, high performance languages and libraries, and experimental evaluation. This topic provides a forum for presentation of new results and practical experience in this domain. It emphasizes research that facilitates the design and development of correct, high-performance, portable, and scalable parallel program. Related to these central needs, this Topic also includes contributions that assess methods for reusability, performance prediction, large-scale deployment, self- adaptivity, and fault-tolerance.
A Closed-Form Estimator of Fully Visible Boltzmann Machines
Authors: Jun-Ichiro Hirayama, Shin Ishii
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

Several researchers have recently proposed alternative estimation methods of Boltzmann machines (BMs) beyond the standard maximum likelihood framework. Examples are the contrastive divergence or the ratio matching, and also a rather classic pseudolikelihood method. With a loss of statistical efficiency, alternative methods can often speed-up the computation and/or simplify the implementation. In this article, as an extreme of this direction, we show the parameter estimation of BMs can be done even with a closed-form estimator, by recasting the problem into linear regression. We confirm our estimator can actually approach the true parameter as the sample size increases, while the convergence can be slow, by a simple simulation experiment.
The Design and Evaluation of a Selective Way Based Trace Cache
Authors: Deze Zeng, Minyi Guo, Song Guo, Mianxiong Dong, Hai Jin
Venue: Proceedings of the 8th International Symposium on Advanced Parallel Processing Technologies (2009)

Energy efficient and performance efficient instruction fetch unit is a critical issue in modern processor design. Trace cache which stores dynamic basic-block stream can significantly improve performance efficiency. Conventional trace cache (CTC) usually adopts set associative structure which requires probing all the data ways in parallel such that only the output of the matched way is used, but the energy for accessing the other ways is wasted. In this paper, we propose a selective way based trace cache (SWTC), which probes only the selected way(s) instead of probing all the data ways. In SWTC, traces are divided into several types and stored into cache by type. Then the trace cache is partially activated and accessed. Based on these design principles, a SWTC model is proposed and evaluated in this paper. Simulation results show that compared to CTC, SWTC can reduce energy consumption on the fetch unit by 20.1% on average, while providing almost the same performance in terms of number of instructions per cycle.
Are some speech recognition errors easier to detect than others?
Authors: Yongmei Shi, Lina Zhou
Venue: Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Companion Volume, Short Papers on XX (2007)

This study investigates whether some speech recognition (SR) errors are easier to detect and what patterns can be identified from those errors. Specifically, SR errors were examined from both non-linguistic and linguistic perspectives. The analyses of non-linguistic properties revealed that high error ratios and consecutive errors lowered the ease of error detection. The analyses of linguistic properties showed that ease of error detection was associated with changing parts-of-speech of reference words in SR errors. Additionally, syntactic relations themselves and the change of syntactic relations had impact on the ease of error detection.
WSDL and UDDI extensions for version support in web services
Authors: Matjaz B. Juric, Ana Sasa, Bostjan Brumen, Ivan Rozman
Venue: Journal of Systems and Software (2009)

Versioning is an important aspect of web service development, which has not been adequately addressed so far. In this article, we propose extensions to WSDL and UDDI to support versioning of web service interfaces at development-time and run-time. We address service-level and operation-level versioning, service endpoint mapping, and version sequencing. We also propose annotation extensions for developing versioned web services in Java. We have tested the proposed solution for versioning in two real-world environments and identified considerable improvements in service development and maintenance efficiency, improved service reuse, and simplified governance.
Use of Co-occurrences for Temporal Expressions Annotation
Authors: Olga Craveiro, Joaquim Macedo, Henrique Madeira
Venue: Proceedings of the 16th International Symposium on String Processing and Information Retrieval (2009)

The annotation or extraction of temporal information from text documents is becoming increasingly important in many natural language processing applications such as text summarization, information retrieval, question answering, etc.. This paper presents an original method for easy recognition of temporal expressions in text documents. The method creates semantically classified temporal patterns, using word co-occurrences obtained from training corpora and a pre-defined seed keywords set, derived from the used language temporal references. A participation on a Portuguese named entity evaluation contest showed promising effectiveness and efficiency results. This approach can be adapted to recognize other type of expressions or languages, within other contexts, by defining the suitable word sets and training corpora.
SiMPSON: Efficient Similarity Search in Metric Spaces over P2P Structured Overlay Networks
Authors: Quang Hieu Vu, Mihai Lupu, Sai Wu
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

Similarity search in metric spaces over centralized systems has been significantly studied in the database research community. However, not so much work has been done in the context of P2P networks. This paper introduces SiMPSON: a P2P system supporting similarity search in metric spaces. The aim is to answer queries faster and using less resources than existing systems. For this, each peer first clusters its own data using any off-the-shelf clustering algorithms. Then, the resulting clusters are mapped to one-dimensional values. Finally, these one-dimensional values are indexed into a structured P2P overlay. Our method slightly increases the indexing overhead, but allows us to greatly reduce the number of peers and messages involved in query processing: we trade a small amount of overhead in the data publishing process for a substantial reduction of costs in the querying phase. Based on this architecture, we propose algorithms for processing range and kNN queries. Extensive experimental results validate the claims of efficiency and effectiveness of SiMPSON.
Structural Abstract Interpretation: A Formal Study Using Coq
Authors: Yves Bertot
Venue: Language Engineering and Rigorous Software Development: International LerNet ALFA Summer School 2008, Piriapolis, Uruguay, February 24 - March 1, 2008, Revised Tutorial Lectures (2009)

Abstract interpreters are tools to compute approximations for behaviors of a program. These approximations can then be used for optimisation or for error detection. In this paper, we show how to describe an abstract interpreter using the type-theory based theorem prover Coq, using inductive types for syntax and structural recursive programming for the abstract interpreter's kernel. The abstract interpreter can then be proved correct with respect to a Hoare logic for the programming language. 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
Minimized Database of Unit Selection in Visual Speech Synthesis without Loss of Naturalness
Authors: Kang Liu, Joern Ostermann
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

Image-based modeling is very successful in the creation of realistic facial animations. Applications with dialog systems, such as e-Learning and customer information service, can integrate facial animations with synthesized speech in websites to improve human-machine communication. However, downloading a database with 11,594 mouth images (about 120MB in JPEG format) used by talking head needs about 15 minutes at 150 kBps. This paper presents a prototype framework of two-step database minimization. First, the key mouth images are identified by clustering algorithms and similar mouth images are discarded. Second, the clustered key mouth images are further compressed by JPEG. MST (Minimum Spanning Tree), RSST (Recursive Shortest Spanning Tree) and LBG-based clustering algorithms are developed and evaluated. Our experiments demonstrate that the number of mouth images is lowered by the LBG-based clustering algorithm and further compressed to 8MB by JPEG, which generates facial animations in CIF format without loss of naturalness and fulfill the need of talking head for Internet applications. 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
On Computing Canonical Subsets of Graph-Based Behavioral Representations
Authors: Walter C. Mankowski, Peter Bogunovich, Ali Shokoufandeh, Dario D. Salvucci
Venue: Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition (2009)

The collection of behavior protocols is a common practice in human factors research, but the analysis of these large data sets has always been a tedious and time-consuming process. We are interested in automatically finding canonical behaviors: a small subset of behavioral protocols that is most representative of the full data set, providing a view of the data with as few protocols as possible. Behavior protocols often have a natural graph-based representation, yet there has been little work applying graph theory to their study. In this paper we extend our recent algorithm by taking into account the graph topology induced by the paths taken through the space of possible behaviors. We applied this technique to find canonical web-browsing behaviors for computer users. By comparing identified canonical sets to a ground truth determined by expert human coders, we found that this graph-based metric outperforms our previous metric based on edit distance.
Recovering Relationships between Documentation and Source Code based on the Characteristics of Software Engineering
Authors: Xiaobo Wang, Guanhui Lai, Chao Liu
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Software documentation is usually expressed in natural languages, which contains much useful information. Therefore, establishing the traceability links between documentation and source code can be very helpful for software engineering management, such as requirement traceability, impact analysis, and software reuse. Currently, the recovery of traceability links is mostly based on information retrieval techniques, for instance, probabilistic model, vector space model, and latent semantic indexing. Previous work treats both documentation and source code as plain text files, but the quality of retrieved links can be improved by imposing additional structure using that they are software engineering documents. In this paper, we present four enhanced strategies to improve traditional LSI method based on the special characteristics of documentation and source code, namely, source code clustering, identifier classifying, similarity thesaurus, and hierarchical structure enhancement. Experimental results show that the first three enhanced strategies can increase the precision of retrieved links by 5%~16%, while the the fourth strategy is about 13%.
DC-SSAT: a divide-and-conquer approach to solving stochastic satisfiability problems efficiently
Authors: Stephen M. Majercik, Byron Boots
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 1 (2005)

We present DC-SSAT, a sound and complete divide-and-conquer algorithm for solving stochastic satisfiability (SSAT) problems that outperforms the best existing algorithm for solving such problems (ZANDER) by several orders of magnitude with respect to both time and space. DC-SSAT achieves this performance by dividing the SSAT problem into subproblems based on the structure of the original instance, caching the viable partial assignments (VPAs) generated by solving these subproblems, and using these VPAs to construct the solution to the original problem. DC-SSAT does not save redundant VPAs and each VPA saved is necessary to construct the solution. Furthermore, DC-SSAT builds a solution that is already human-comprehensible, allowing it to avoid the costly solution rebuilding phase in ZANDER. As a result, DC-SSAT is able to solve problems using, typically, 1-2 orders of magnitude less space than ZANDER, allowing DC-SSAT to solve problems ZANDER cannot solve due to space constraints. And, in spite of its more parsimonious use of space, DCSSAT is typically 1-2 orders of magnitude faster than ZANDER. We describe the DC-SSAT algorithm and present empirical results comparing its performance to that of ZANDER on a set of SSAT problems.