ppxscal/embedding_network huggingface dataset:
Concise finite-domain representations for PDDL planning tasks
Authors: Malte Helmert
Venue: Artificial Intelligence (2009)

We introduce an efficient method for translating planning tasks specified in the standard PDDL formalism into a concise grounded representation that uses finite-domain state variables instead of the straight-forward propositional encoding. Translation is performed in four stages. Firstly, we transform the input task into an equivalent normal form expressed in a restricted fragment of PDDL. Secondly, we synthesize invariants of the planning task that identify groups of mutually exclusive propositions which can be represented by a single finite-domain variable. Thirdly, we perform an efficient relaxed reachability analysis using logic programming techniques to obtain a grounded representation of the input. Finally, we combine the results of the third and fourth stage to generate the final grounded finite-domain representation. The presented approach has originally been implemented as part of the Fast Downward planning system for the 4th International Planning Competition (IPC4). Since then, it has been used in a number of other contexts with considerable success, and the use of concise finite-domain representations has become a common feature of state-of-the-art planners.
An Improved DV-Hop Localization Algorithm with Reduced Node Location Error for Wireless Sensor Networks
Authors: Hongyang Chen, Kaoru Sezaki, Ping Deng, Hing Cheung So
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this paper, we propose a new localization algorithm and improve the DV-Hop algorithm by using a differential error correction scheme that is designed to reduce the location error accumulated over multiple hops. This scheme needs no additional hardware support and can be implemented in a distributed way. The proposed method can improve location accuracy without increasing communication traffic and computing complexity. Simulation results show the performance of the proposed algorithm is superior to that of the DV-Hop algorithm.
Modeling and Simulation of Pre-compressed Multilayered Corrugated Board during Impact
Authors: Li Chen, ShengLing Xiao, YaoXiang Li, ShiZhou You
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

This paper studied the physical properties of multilayered corrugated board, fully considering the air-flow of flute influence on its properties. Built up the theoretical model of pre-compressed multilayered corrugated board. Used MATLAB/simulink software simulate theoretical model to determine the value of acceleration during impact. In a qualitative way the simulated results tend to coincide with experimental results. It validated theoretical model. This method found a correct way to consider cushion material of corrugated board. The model will assist in the design of protective packaging and digital production in the packaging industry, which have remarkable actually application value.
ARForce: a marker-based augmented reality system for force distribution input
Authors: Kensei Jo, Yasuaki Kakehi, Kouta Minamizawa, Hideaki Nii, Naoki Kawakami, Susumu Tachi
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

In recent years, the use of augmented reality (AR) systems has become quite common. Many marker-based AR systems can input the positions of physical markers and realize a combination of real-world and computer-generated graphics. However, few systems can recognize other information such as fingertip motions. The objective of our study is to create AR environments in which users can manipulate virtual objects by using natural finger motions. Toward this end, we propose a novel marker-based AR system called "ARForce." ARForce enables users to measure the 3D position of markers as well as also the distribution of force vectors that are applied by a user. Using this system, users can manipulate virtual objects using various finger motions. Our proposed system comprises a camera and an input device. The input device is an elastic body and it comprises two types of markers. One is a square-shaped marker that enables a user to detect the position of the device. The other markers are small circular-shaped ones that are placed within the elastic body. The positions of the circular markers are moved when a user applies a force to the device. This enables force detection.
Simulation of passenger screening for pandemic influenza at U.S. airport ports of entry
Authors: Robert Brigantic, George Muller
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

We present a stochastic discrete event simulation that was developed to model the screening of international airline passengers arriving at U.S. airport ports of entry for pandemic influenza. The simulation begins with the generation of international aircraft arrival patterns to the United States. Based on assumed prevalence rates in their origin countries, passengers are randomly assigned to one of three infected states in the simulation -- not infected, infected with pandemic influenza, infected with other respiratory illness. Passengers then pass through various screening layers and ultimately exit the system. We track the declared outcome of each passenger over time as they exit the screening process, with a special emphasis on false negatives as they pose the most significant threat to our nation as they will exit the system and unknowingly further spread the pandemic virus throughout the United States. Extensions to DoD environment will also be discussed.
Single facility collection depots location problem in the plane
Authors: Robert Benkoczi, Binay K. Bhattacharya, Sandip Das, Jeff Sember
Venue: Computational Geometry: Theory and Applications (2009)

In this paper we consider an extension of the classical facility location problem where besides n weighted customers, a set of p collection depots are also given. In this setting the service of a customer consists of the travel of a server to the customer and return back to the center via a collection depot. We have analyzed the problem and showed that the collection depots problem using the Euclidean metric can be transformed to O(p^2n^2) number of different classical facility location problems and this bound is tight. We then show the existence of small coresets for these problems. These coresets are then used to provide (1+@e)-factor approximation algorithms which have linear running times for fixed customer weights and @e.
Thermo-fluids: comparative study of academic efficiency between two groups using different methodologies of instruction
Authors: Antonio Jose Ostos Celis
Venue: Proceedings of the 8th WSEAS international conference on Distance learning and web engineering (2008)

The present work was raised to know the influence the instruccional strategy in the academic efficiency of the students when incorporating the Internet like tool in the education of the subject Thermo-Fluids (TF) in the students of the fifth semester course of Industrial Engineering. The study leaned in the resource of the new Information and Communication Technology (ICT) using the Internet like learning environment. For it the platform was used Web or system of free conference by mean of the gratuitous platform Nicenet Internet Classroom Assistant (http://www.nicenet.org). The investigation was experimental and of longitudinal way in where the following instruments were used: a) list to determine the knowledge and previous abilities that have the students in the use of the computer, handling of the Internet and electronic mail, handling and use of the WWW like education learning tool, b) list to collect the perception of the student with respect to the learning atmosphere being used the ICT in the process education - learning of the subject TF and c) registry of the student efficiency according to the learning of unit two of the plan of evaluation of the course. In the analysis of the results one was favorable significant differences to the Experimental Group (EG), in the knowledge and abilities that the students in the use of the computer and handling of the tools of the Internet, as well as the student efficiency improved after to have applied the instruccional strategy.
Encoding and decoding the knowledge of association rules over SVM classification trees
Authors: Shaoning Pang, Nikola Kasabov
Venue: Knowledge and Information Systems (2009)

This paper presents a constructive method for association rule extraction, where the knowledge of data is encoded into an SVM classification tree (SVMT), and linguistic association rule is extracted by decoding of the trained SVMT. The method of rule extraction over the SVMT (SVMT-rule), in the spirit of decision-tree rule extraction, achieves rule extraction not only from SVM, but also over the decision-tree structure of SVMT. Thus, the obtained rules from SVMT-rule have the better comprehensibility of decision-tree rule, meanwhile retains the good classification accuracy of SVM. Moreover, profiting from the super generalization ability of SVMT owing to the aggregation of a group of SVMs, the SVMT-rule is capable of performing a very robust classification on such datasets that have seriously, even overwhelmingly, class-imbalanced data distribution. Experiments with a Gaussian synthetic data, seven benchmark cancers diagnosis, and one application of cell-phone fraud detection have highlighted the utility of SVMT and SVMT-rule on comprehensible and effective knowledge discovery, as well as the superior properties of SVMT-rule as compared to a purely support-vector based rule extraction. (A version of SVMT Matlab software is available online at http://kcir.kedri.info)
ILLINET: a 32 Mbits/sec. local-area network
Authors: W. Y. Cheng, S. Ray, R. Kolstad, J. Luhukay, R. Campbell, J. W-S. Liu
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

ILLINET is a fiber-optical ring network designed to provide wide band linkages between host computers for the purpose of facilitating file transfers at speeds near those of fast I/O devices in the hosts. Its structure is similar to the Distributed Computing System. ILLINET will eventually connect several PDP-11's, a PRIME computer and a network of microcomputers. These computers are used in a variety of real-time and batch processing applications. Currently they are already interconnected via 9600 band lines in a star configuration to provide access to simple terminals. This paper describes the network architecture, control structure, and hardware configuration of ILLINET.
Continuous Scheduling for Data-Driven Peer-to-Peer Streaming
Authors: Jyrki Akkanen
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

The paper introduces a new approach to data-driven peer-to-peer media streaming. While classical algorithms send buffer maps and run scheduling periodically, we experiment by continuously sending incremental notifications of buffer contents and by running a continuous scheduling process. The approach has been tested both in a network simulator and in a small network of smart phones with live video content. The protocol seems to adapt quickly to changing data rate or churn without producing intolerable overhead. The approach leads to small latency and strong peer equality and may thus ease neighbor management. The end-to-end delay is small and one may alleviate a need for large buffers.
An Integrated Approach for the Run-Time Monitoring of BPEL Orchestrations
Authors: Luciano Baresi, Sam Guinea, Raman Kazhamiakin, Marco Pistore
Venue: Proceedings of the 1st European Conference on Towards a Service-Based Internet (2008)

In this paper, we compare and integrate Dynamo and ASTRO, two previous approaches of the authors for run-time monitoring of BPEL orchestrations. A key element of the proposed integrated framework is the capability to cover a wide range of features, including the detection of complex behavioural patterns, the possibility to measure boolean, numeric and time-related properties, the possibility to monitor the behaviour of the composition both at the level of a single execution instance and by aggregating the information of all execution instances of a given composition.
Photoshop CS4 For Dummies
Authors: Peter Bauer
Venue: For Dummies (2008)

This latest version of Photoshop has a few new tricks up its sleeve and Adobe Photoshop CS4 For Dummies will teach you how to use them. From the basics like getting your images into and out of Photoshop to enhancing, cropping, and color correction, its all here!Youll get all of the basics of digital images and master the importing and exporting of images. Youll find out how to create easy enhancements like adding shadows and highlights and making color natural, in addition to learning how to use the Adobe camera raw plug-in. Before you know it, youll be making beautiful art with Photoshop by combining images, precision edges, dressing up images, painting in Photoshop, and using filters. You can even streamline your work in Photoshop using advanced techniques. Find out how to:Import images and use all the tools and processes Reduce digital noise, make colors look natural, add highlights and shadows Optimize images for print or the Web Edit images Explore the Painting function and master the daunting Brushes panel Add layer styles Create on-screen presentations, contact prints, and more Complete with lists of ten reasons to love your Wacom tablet, ten reasons to own a digital camera, and ten favorite tips and tricks, Adobe CS4For Dummies is your one-stop guide to setting up, working with, and making the most of Photoshop CS4 for all your digital photography needs.
Meeting virtual organization performance goals through adaptive grid reconfiguration
Authors: Zach Hill, Jonathan Rowanhill, Anh Nguyen-Tuong, Glenn Wasson, John Knight, Jim Basney, Marty Humphrey
Venue: Proceedings of the 8th IEEE/ACM International Conference on Grid Computing (2007)

In order for Grids to become relied upon for critical infrastructure and scientific computing, Grid-wide management must be automated so that it is possible in quickly and comprehensively respond to or anticipate specific environmental changes and requirements. That is, due to the disjoint administration of Grids which results in high communication requirements as well as large numbers of skilled administrators, manual reconfiguration of large portions of a Grid in such situations is not a viable solution. We have developed an architecture that allows changes to the grid configuration to be automated in response to operator input or sensors placed throughout the Grid. Additionally, our architecture allows the resource owner to specify who is allowed to alter the configuration of his resource and what types of reconfigurations are allowed. This permits the automation of reconfiguration while retaining owner control of the individual resources. Our experiments show that this architecture can be used to reconfigure a representative GT4-based development grid to enforce maximum latency limits on a Virtual Organization’s jobs by dynamically controlling job priorities Grid-wide.
Classifying High-Dimensional Text and Web Data Using Very Short Patterns
Authors: Hassan H. Malik, John R. Kender
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

In this paper, we propose the "Democratic Classifier", a simple pattern-based classification algorithm that uses very short patterns for classification, and does not rely on the minimum support threshold. Borrowing ideas from democracy, our training phase allows each training instance to vote for an equal number of candidate size-2 patterns. The training instances select patterns by effectively balancing between local, class, and global significance of patterns. The selected patterns are simultaneously added to the model for all applicable classes and a novel power law based weighing scheme adjusts their weights with respect of each class. Results of experiments performed on 121 common text and web datasets show that our algorithm almost always outperforms state of the art classification algorithms, without any parameter tuning. On 100 real-life web datasets, the average absolute classification accuracy improvement was as great as 9.4% over SVM, Harmony, C4.5 and KNN. Also, our algorithm ran about 3.5 times faster than the fastest existing pattern-based classification algorithm.
Modular verification of strongly invasive aspects: summary
Authors: Emilia Katz, Shmuel Katz
Venue: Proceedings of the 2009 workshop on Foundations of aspect-oriented languages (2009)

An extended specification for aspects, and a new verification method based on model checking are used to establish the correctness of strongly-invasive aspects, independently of any particular base program to which they may be woven. Such aspects can change the underlying base program variables to new states, and after the aspect advice has completed, the base program code continues from states that were previously unreachable.
On the glog-normal distribution and its application to the gene expression problem
Authors: Víctor Leiva, Antonio Sanhueza, Diana M. Kelmansky, Elena J. Martínez
Venue: Computational Statistics Data Analysis (2009)

In this article, we characterized the glog-normal distribution and present a comprehensive treatment of the properties of this model. Specifically, we present the probability density function as well as a graphical analysis of this density, the cumulative distribution function and the moments for this statistical distribution. Additionally, by using likelihood methods, we estimate the parameters, carry out asymptotic inference and discuss influence diagnostics of this model. Finally, we show the usefulness of the glog-normal distribution for modeling gene expression microarray intensity data by means of a real numerical example.
Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression
Authors: Elvira Mayordomo, Philippe Moser
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

This paper considers online compression algorithms that use at most polylogarithmic space (plogon). These algorithms correspond to compressors in the data stream model. We study the performance attained by these algorithms and show they are incomparable with both pushdown compressors and the Lempel-Ziv compression algorithm.
Skart: a skewness-and autoregression-adjusted batch-means procedure for simulation analysis
Authors: Ali Tafazzoli, James R. Wilson, Emily K. Lada, Natalie M. Steiger
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

We discuss Skart, an automated batch-means procedure for constructing a skewness-and autoregression-adjusted confidence interval for the steady-state mean of a simulation output process. Skart is a sequential procedure designed to deliver a confidence interval that satisfies user-specified requirements concerning not only coverage probability but also the absolute or relative precision provided by the half-length. Skart exploits separate adjustments to the half-length of the classical batch-means confidence interval so as to account for the effects on the distribution of the underlying Student's t-statistic that arise from nonnormality and autocorrelation of the batch means. Skart also delivers a point estimator for the steady-state mean that is approximately free of initialization bias. In an experimental performance evaluation involving a wide range of test processes, Skart compared favorably with other simulation analysis methods---namely, its predecessors ASAP3, WASSP, and SBatch as well as ABATCH, LBATCH, the Heidelberger-Welch procedure, and the Law-Carson procedure.
SOA Cookbook: Master SOA process architecture, modeling, and simulation in BPEL, TIBCO's BusinessWorks, and BEA's Weblogic Integration
Authors: Michael Havey
Venue:  (2008)

Master SOA process architecture, modeling, and simulation in BPEL, TIBCO's BusinessWorks, and BEA's Weblogic Integration. The book is intended for hands-on SOA architects, designers, and developers who want to learn techniques in process orchestration. Many of these readers use, or will soon start using, languages such as BPEL, TIBCO's BusinessWorks, or BEA's Weblogic Integration in their projects. This intermediate-level book assumes that the reader is comfortable reading XML and knows the basic concepts of web services. The book presents several BPEL and BPMN examples, but it explains specific language constructs on the fly; the reader need not have background in these languages.
Towards Reputation Enhanced Electronic Negotiations for Service Oriented Computing
Authors: Stefan König, Sebastian Hudert, Torsten Eymann, Mario Paolucci
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

Currently electronic Commerce mechanisms are mainly investigated in two independent research areas: Service-Oriented Computing (SOC) and multi-agent systems. The former as a means to deliver electronic services of various granularity and the latter as a testbed of electronic negotiation mechanisms. However, both research areas heavily rely on each other. On the one hand, service-oriented architectures need to support dynamic cooperation, negotiation, and adaptive interactions between offered services. On the other hand SOC represents a promising application for software agent technologies as a paradigm for electronic negotiations which future service economies will more and more rely on. Apart from the high flexibility and efficiency of such service economies, problems similar to the ones in real world economies will arise, such as the trusting problem between market participants. In this paper, we investigate the efficiency of reputation concepts in different negotiation protocols for electronic service economies. Based on social science findings we deduct hypotheses on the applicability of such mechanisms in various electronic negotiation settings.
TinkerSheets: using paper forms to control and visualize tangible simulations
Authors: Guillaume Zufferey, Patrick Jermann, Aurélien Lucchi, Pierre Dillenbourg
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

This paper describes TinkerSheets, a paper-based interface to tangible simulations. The proposed interface combines the advantages of form-based input and paper. Form-based input allows to set an arbitrary number of parameters. Using paper as a medium for the interface keeps the interaction modality consistently physical. TinkerSheets are also used as an output screen to display summarized information about the simulation. A user study conducted in an authentic context shows how the characteristics of the interface shape real world usage. We also describe how the affordances of this control and visualization interface support the co-design of interaction with end-users.
"Georgia computes!": improving the computing education pipeline
Authors: Amy Bruckman, Maureen Biggers, Barbara Ericson, Tom McKlin, Jill Dimond, Betsy DiSalvo, Mike Hewner, Lijun Ni, Sarita Yardi
Venue: ACM SIGCSE Bulletin (2009)

Computing education suffers from low enrollment and a lack of diversity. Both of these problems require changes across the entire computing education pipeline. The "Georgia Computes!" alliance, funded by the National Science Foundation's Broadening Participation in Computing program, seeks to improve the computing education pipeline in Georgia. "Georgia Computes!" is having a measurable effect at each stage of the pipeline, but has not yet shown an impact across the whole pipeline.