ppxscal/embedding_network huggingface dataset:
Proceedings of the 47th Annual Southeast Regional Conference
Venue: ACM Southeast Regional Conference (2009)

On behalf of the School of Computing at Clemson University welcome to ACM's Southeast Regional Conference in 2009. This is a conference with a long history of providing a venue for exchanging ideas and seeing old friends. I hope you will take advantage of all of the program activities but I also hope that you will take advantage of the breaks and meals to interact with colleagues. This year's conference is held in very trying economic times. Much of the economic progress in recent years has been the result of technological innovations and development efforts by people in our profession. Many of the presentations at this conference are by students, the future of our profession. Support these students with suggestions and encouragement. This proceedings collects a wide range of material across the disciplines within computer science and software engineering. The research papers are reviewed by the program committee while the works in progress are an opportunity to hear about the latest ideas still being worked. Look through the material and identify new collaborators or at least interesting ideas. 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
Fuzzy Annotation of Web Data Tables Driven by a Domain Ontology
Authors: Gaëlle Hignette, Patrice Buche, Juliette Dibie-Barthélemy, Ollivier Haemmerlé
Venue: Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications (2009)

We propose an automatic system for annotating accurately data tables extracted from the web. This system is designed to provide additional data to an existing querying system called MIEL, which relies on a common vocabulary used to query local relational databases. We will use the same vocabulary, translated into an OWL ontology, to annotate the tables. Our annotation system is unsupervised. It uses only the knowledge defined in the ontology to automatically annotate the entire content of tables, using an aggregation approach: first annotate cells, then columns, then relations between those columns. The annotations are fuzzy: instead of linking an element of the table with a precise concept of the ontology, the elements of the table are annotated with several concepts, associated with their relevance degree. Our annotation process has been validated experimentally on scientific domains (microbial risk in food, chemical risk in food) and a technical domain (aeronautics).
Robust registration of manuscript images
Authors: Ryan Baumann, W. Brent Seales
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

In this paper we present an application of image registration techniques to the specific domain of manuscript images. We show the application of this technique to images of the Venetus A, a 10th century manuscript of Homer's Iliad. The same algorithm is used to register images of the MS across time (including photographs separated by over a century), as well as across imaging modalities.
A survey on dynamic Web content generation and delivery techniques
Authors: Jayashree Ravi, Zhifeng Yu, Weisong Shi
Venue: Journal of Network and Computer Applications (2009)

While Web applications serve personal needs and business functions almost in every area, the responsiveness and performance of Web applications is the key factor to their success. With continuous innovation on Web technology, Web sites have evolved from document Web to application Web and further to service Web recently. During the evolution course, Web sites serving dynamic content started to grow exponentially to dominate the area. Dynamic pages require servers to generate the response content per-user request before delivering it back to the user, which introduces network traffic, server workload and results in extra latency. This drew tremendous efforts from both research and industry on how to accelerate the dynamic content generation and distribution in order to reduce the user perceived latency and improve the application performance, among which caching is a vital technology. This paper attempts to survey the innovative research and products recently published in this area and presents them in a road map style. It first examines the dynamic characteristics of Web applications and the inherent challenges for caching. Then the rest of this paper explores the varied acceleration solutions on content generation process and content delivery process, respectively, followed by the analysis of how different caching solutions fit Web applications of different characteristics. Finally it ends with the future trends on Web caching technique and a summary of the survey.
Differential modeling of DAE's solutions for system's control
Authors: Sorin Stefan Radnef
Venue: Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering (2008)

The paper deals with the question of haw to find in a unified manner the solution of DAEs, having a rigorous guide line stated as "necessary and sufficient condition" in an algebraic equation form and than to find a method to use the result to find relevant solutions for system's control DAEs. The view point considers an extended DAE system that allows to formulate this question as an inverse problem and to regard the algebraic equation as a singular implicit solution of the differential subsystem. It is formulate the necessary and sufficient condition for an implicit equation be a singular implicit solution as an algebraic equation and, accordingly, is stated a sequential algorithm to find the differential modeling function for the algebraic variables. These theoretic results are used to find solutions for DAEs in an intuitive manner using additive components for control variables.
Establishing a Probabilistic Model for Cognitive Learning Style
Authors: Yoke-Jin Teh, Choo-Yee Ting, Somnuk Phon-Amnuaisuk
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

Current focus in education systems is to develop SCORM-based ITS that is able to adapt instructional contents to student's learning method and preferences. In order to adapt to the student's preference, the ITS must be able to capture the student's preferred learning style. However, this involves inherent uncertainty in understanding and categorizing student's learning style. This paper highlights the probabilistic model of student's cognitive learning style and its integration into SCORM e-learning environment. Our student model uses Bayesian Networks to handle uncertainties by computing a probabilistic assessment of predicting the student's cognitive learning style based on the student's interactions captured by the SCORM CAM and SCORM RTE commands. Towards the end of this paper, a review of student model and preliminary investigation to assess and evaluate our initial network is presented.
Optimal collusion-resistant mechanisms with verification
Authors: Paolo Penna, Carmine Ventre
Venue: Proceedings of the tenth ACM conference on Electronic commerce (2009)

We present the first general positive result on the construction of collusion-resistant mechanisms, that is, mechanisms that guarantee dominant strategies even when agents can form arbitrary coalitions and exchange compensations (sometimes referred to as transferable utilities or side payments). This is a much stronger solution concept as compared to truthful or even group-strategyproof mechanisms, and only impossibility results were known for this type of mechanisms in the "classical" model. We describe collusion-resistant mechanisms with verification that return optimal solutions for a wide class of mechanism design problems (which includes utilitarian ones as a special case). Note that every collusion-resistant mechanism without verification has an unbounded approximation factor and, in general, optimal solutions cannot be obtained even if we content ourselves with truthful ("non-collusion-resistant") mechanisms. All these results apply to problems that have been extensively studied in the algorithmic mechanism design literature such as task scheduling and inter-domain routing.
Measuring importance and query relevance in topic-focused multi-document summarization
Authors: Surabhi Gupta, Ani Nenkova, Dan Jurafsky
Venue: Proceedings of the 45th Annual Meeting of the ACL on Interactive Poster and Demonstration Sessions (2007)

The increasing complexity of summarization systems makes it difficult to analyze exactly which modules make a difference in performance. We carried out a principled comparison between the two most commonly used schemes for assigning importance to words in the context of query focused multi-document summarization: raw frequency (word probability) and log-likelihood ratio. We demonstrate that the advantages of log-likelihood ratio come from its known distributional properties which allow for the identification of a set of words that in its entirety defines the aboutness of the input. We also find that LLR is more suitable for query-focused summarization since, unlike raw frequency, it is more sensitive to the integration of the information need defined by the user.
Counting canonical partitions in the random graph
Authors: Jean A. Larson
Venue: Combinatorica (2008)

Joyce trees have concrete realizations as J-trees of sequences of 0&#x2019;s and 1&#x2019;s. Algorithms are given for computing the number of minimal height J-trees of d-ary sequences with n leaves and the number of them with minimal parent passing numbers to obtain polynomials &#x03c1; n (d) for the full collection and &#x03b1; n (d) for the subcollection. The number of traditional Joyce trees is the tangent number &#x03b1; n (1); &#x03b1; n (2) is the number of cells in the canonical partition by Laflamme, Sauer and Vuksanovic of n-element subsets of the infinite random (Rado) graph; and &#x03c1; n (2) is the number of weak embedding types of rooted n-leaf J-trees of sequences of 0&#x2019;s and 1&#x2019;s.
Learning Computers, Speaking English: Cooperative Activities for Learning English and Basic Word Processing
Authors: Stephen Curtis Quann, Diana Rebeccah Satin
Venue:  (2007)

Become computer savvy while learning English at the same time! This innovative course combines language learning with training in basic computer skills and word processing appropriate for most versions of Microsoft Word (Windows 95 and later). Its illustrated, easy-to-read computer instructions make it very accessible to high beginner ESL students. The 8 units include Learning About the Mouse, Desktop, and The Future Tense; Learning the Keyboard and Gerunds/Infinitives; Learning About Windows and the Past Tense; Learning the File Menu and the Present Perfect; and Learning the Format Menu and the Passive. Most activities are communicative and designed for students to work in pairs. There are also speaking, listening, pronunciation, and writing tasks. Each unit ends with a dialogue between students who regularly practice in the computer lab. The characters find themselves discussing provocative topics such as bringing up children in a new country and balancing work and study. The book is available with an optional disk that includes activities, projects, and letter templates that students can apply to what they have learned.
Design and development of an adaptive neuro-fuzzy based early detection system
Authors: Syed Haque
Venue:  (2008)

Emergency Medical Services (EMS) are the first healthcare providers on the scene in any medical emergency or disaster situation. Providing this front line defense with tools and applications to alert key medical personal and medical and health organizations of the potential damage in a timely manor is extremely important. The process of developing a scalable and flexible Integrated Disaster Response Information Surveillance (IDRIS) system consists of two complimentary models: the architectural model and the computational model. The architectural model is required for recording, displaying, and storing victim's information at the disaster sites and linking this information with any outside systems while maintaining security policy and compliance with HL7 and HIPAA standards. Many EMS works still use paper and pen solutions for recording information occurring in a medical emergency. To identify early outbreaks these paper based systems need to be converted in to an electronic form so that various algorithms can be applied on this data. Rather than converting this data the approached described in this paper is to change the gathering of this data by training the EMS workers into using electronic devices that mimic their paper based solutions. To reduce the learning curve of using a new system, the paper based forms are converted to electronic based forms. Before applying the computational model, the infrastructure for handling this information is crucial. The computational model can detection anomalies as they occur in the real world and in real time using neural networks and fuzzy logic algorithms combined. The combination of these two key algorithms provides the ability to find patterns in the data gathered and can categorizes these outcomes into new or existing syndromes for addressing syndromic surveillance. Providing the infrastructure for gathering data to key personal and then building various components that can analyze this data in real-time offers the medical and health community features that can adapt to suit different conditions has the potential to be a key component for syndromic surveillance and disaster management strategies.
Reinforcement Learning Control of a Real Mobile Robot Using Approximate Policy Iteration
Authors: Pengcheng Zhang, Xin Xu, Chunming Liu, Qiping Yuan
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

Machine learning for mobile robots has attracted lots of research interests in recent years. However, there are still many challenges to apply learning techniques in real mobile robots, e.g., generalization in continuous spaces, learning efficiency and convergence, etc. In this paper, a reinforcement learning path-following control strategy based on approximate policy iteration (API) is developed for a real mobile robot. It has some advantages such as optimized control policies can be obtained without much a priori knowledge on dynamic models of mobile robot, etc. Two kinds of API-based control method, i.e., API with linear approximation and API with kernel machines, are implemented in the path following control task and the efficiency of the proposed control strategy is illustrated in the experimental studies on the real mobile robot based on the Pioneer3-AT platform. Experimental results verify that the API-based learning controller has better convergence and path following accuracy compared to conventional PD control methods. Finally, the learning control performance of the two API methods is also evaluated and compared.
Using resource management games for mobile phones to teach social behaviour
Authors: Tilmann Bitterberg, Hanno Hildmann, Cherif Branki
Venue: Proceeding of the 2008 conference on Techniques and Applications for Mobile Commerce: Proceedings of TAMoCo 2008 (2008)

Considerable parallels exist between what is commonly considered to constitute a good gaming or a good learning experience [8], which suggests the use of computer games in the education sector. We investigate the design of a resource management computer game (RMG) [5] to raise awareness for environmental issues. We argue that focusing on peoples attitude when investigating their behaviour is an established approach in psychology [1] and that the use of computer games in education is quickly becoming a common practice [3,2]. We present a prototype running on a mobile phone constructed to meet the identified requirements.
Experiential role of artefacts in cooperative design
Authors: Dhaval Vyas, Dirk Heylen, Anton Nijholt, Gerrit van der Veer
Venue: Proceedings of the fourth international conference on Communities and technologies (2009)

The role of material artefacts in supporting distributed and co-located work practices has been well acknowledged within HCI and CSCW research. In this paper, we show that in addition to their ecological, coordinative and organizational support, artefacts also play an 'experiential' role. In this case, artefacts not only improve efficiency or have a purely functional role (e.g. allowing people to complete tasks quickly), but the materiality, use and manifestations of these artefacts bring quality and richness to people's performance and help them make better sense of their everyday lives. In a domain such as industrial design, such artefacts play an important role for supporting creativity and innovation. Based on our ethnographic fieldwork on understanding cooperative design practices of industrial design students and researchers, we describe several experiential practices that are supported by design-related artefacts such as sketches, drawings, physical models and explorative prototypes -- used and developed in designers' everyday work. Our main intention in carrying out this kind of research is to develop technologies to support designers' everyday practices. We believe that with the emergence of ubiquitous computing, there is a growing need to focus on the personal, social and creative side of people's everyday experiences. By focusing on the experiential practices of designers, we can provide a much broader view in the design of new interactive technologies.
A global bibliometric index for a published article
Authors: Sozon Papavlasopoulos, Marios Poulos
Venue: Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems (2008)

In this study is investigated an approach to the scholar evaluation problem by taking into account both social and scholar factors that affect the status of a research in a particular research area. We define the ideal global bibliometric indicator as a point of reference consisting of a set of factors such as the impact factor of the journal and the significant relation of the journal to the scientific area considered for the evaluation.
Unsteady boundary layer flow and heat transfer over a stretching surface in a micropolar fluid
Authors: Roslinda Nazar, Anuar Ishak, Maslina Darus, Ioan pop
Venue: Proceedings of the 13th WSEAS international conference on Applied mathematics (2008)

The present study deals with the analysis of unsteady boundary layer flow and heat transfer of an incompressible micropolar fluid over a stretching sheet when the sheet is stretched in its own plane. The velocity and temperature are assumed to vary linearly with the distance along the sheet. Two equal and opposite forces are impulsively applied along the x-axis so that the sheet is stretched, keeping the origin fixed in a micropolar fluid. The transformed unsteady boundary layer equations are solved numerically using the Keller-box method for the whole transient from the initial state flow to the final steady-state flow. Numerical results are obtained for the velocity, microrotation and temperature distributions as well as the skin friction coefficient and local Nusselt number for various values of the material parameter K and Prandtl number Pr, when n= 1/2 (weak concentration particles at the plate).
Recognition of Human Actions using an Optimal Control Based Motor Model
Authors: Sumitra Ganesh, Ruzena Bajcsy
Venue: Proceedings of the 2008 IEEE Workshop on Applications of Computer Vision (2008)

We present a novel approach to the problem of representation and recognition of human actions, that uses an optimal control based model to connect the high-level goals of a human subject to the low-level movement trajectories captured by a computer vision system. These models quantify the high-level goals as a performance criterion or cost function which the human sensorimotor system optimizes by picking the control strategy that achieves the best possible performance. We show that the human body can be modeled as a hybrid linear system that can operate in one of several possible modes, where each mode corresponds to a particular high-level goal or cost function. The problem of action recognition, then is to infer the current mode of the system from observations of the movement trajectory. We demonstrate our approach on 3D visual data of human arm motion.
Integrity Protection for Revision Control
Authors: Christian Cachin, Martin Geisler
Venue: Proceedings of the 7th International Conference on Applied Cryptography and Network Security (2009)

Users of online-collaboration tools and network storage services place considerable trust in their providers. This paper presents a novel approach for protecting data integrity in revision control systems hosted by an untrusted provider. It guarantees atomic read and write operations on the shared data when the service is correct and preserves fork-linearizability when the service is faulty. A prototype has been implemented on top of the Subversion revision control system; benchmarks show that the approach is practical.
Computability and complexity properties of automatic structures and their applications
Authors: Anil Nerode
Venue:  (2008)

Finite state automata are Turing machines with fixed finite bounds on resource use. Automata lend themselves well to real-time computations and efficient algorithms. Continuing a tradition of studying computability in mathematics, we examine automatic structures, mathematical objects which can be represented by automata, and apply resulting observations to computer science. We measure the complexity of automatic structures via well-established concepts from model theory, topology, and set theory. We prove the following results. The ordinal height of any automatic well-founded partial order is bounded by &omega;&omega;. The ordinal heights of automatic well-founded relations are unbounded below wCK1 , the first uncomputable ordinal. For any computable ordinal &alpha;, there is an automatic structure of Scott rank at least &alpha;. Moreover, there are automatic structures of Scott rank wCK1,w CK1+1. . For any computable ordinal &alpha;, there is an automatic successor tree of Cantor-Bendixson rank &alpha;. Next, we study infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations have finite degree and can be described by finite automata over a one-letter alphabet. We investigate algorithmic properties of such graphs in terms of their finite presentations. In particular, we ask how hard it is to check whether a given node belongs to an infinite component, whether two given nodes in the graph are reachable from one another, and whether the graph is connected. We give polynomial-time algorithms answering each of these questions. For a fixed input graph, the algorithm for infinite component membership works in constant time and reachability is decided uniformly by a single automaton. Hence, we improve on previous work, in which nonelementary or nonuniform algorithms were found. We turn our attention to automata techniques for deciding first-order logical theories. These techniques are useful in Integer Linear Programming and Mixed Integer Linear Programming, which in turn have applications in diverse areas of computer science and engineering. We extend known work to address the enumeration problem for linear programming solutions. Then, we apply a similar paradigm to give an automata theoretic decision procedure for the p-adic valued ring under addition and for formal Laurent series over a finite field with valuation and addition.