ppxscal/embedding_network huggingface dataset:
Cooperative xml (coxml) query answering
Authors: Wesley W. Chu
Venue:  (2006)

The growing use of XML in scientific data repositories, digital libraries and Web applications has increased the need for effective XML search methods. Due to the heterogeneous nature of XML data, it is often difficult and unrealistic for users to completely grasp the structure properties of the data before asking queries. As a result, it may be often the case that there are no exactly matched answers for a query. In this case, it is more cooperative to derive approximate answers than to return users an empty answer set. In this dissertation, we propose a cooperative XML (CoXML) query answering system that relaxes query conditions to less restricted forms, i.e., query relaxation, and derives approximate answers. The key features of the system include: (1) a query language that extends the standard W3C XQuery with relaxation constructs and controls. Relaxation constructs enable users to specify approximate conditions and relaxation controls allow users to control the approximate matching process; (2) a multi-level hierarchical relaxation index structure that provides systematic approximate matching guidance and controls at different granularity; and (3) similarity metrics that evaluate the relevancies of approximate answers based on both their structure and content aspects. We evaluate the system's performance by using the INEX test collection with its relevant assessments as the "gold standard." The results reveal that the proposed relaxation constructs and controls allow users to effectively express their approximate matching specifications, which in turn enable the system to provide answers with more accuracy. The results also demonstrate the effectiveness of the proposed content and structure similarity metrics in result ranking. Furthermore, compared to other systems participated in the INEX, our query relaxation methodology not only enables the system to systematically retrieve approximate answers but also with greater relevancy.
Color reduction based on ant colony
Authors: Avazeh Tashakkori Ghanbarian, Ehsanollah Kabir, Nasrollah Moghaddam Charkari
Venue: Pattern Recognition Letters (2007)

In this article a method for color reduction based on ant colony algorithm is presented. Generally color reduction involves two steps: choosing a proper palette and mapping colors to this palette. This article is about the first step. Using ant colony algorithm, pixel clusters are formed based on their colors and neighborhood information to make the final palette. A comparison between the results of the proposed method and some other methods is presented. There are some parameters in the proposed method which can be set based on user needs and priorities. This increases the flexibility of the method.
Enforcing Access Control Using Risk Assessment
Authors: Nguyen Ngoc Diep, Le Xuan Hung, Yonil Zhung, Sungyoung Lee, Young-Koo Lee, Heejo Lee
Venue: Proceedings of the Fourth European Conference on Universal Multiservice Networks (2007)

Context-based access control is an emerging approach for modeling adaptive solution, making access control management more flexible and powerful. But in the ubiquitous environment, this approach is not enough for many emerging security vulnerabilities. Thus, improving current access control mechanisms is still necessary. Risk is an effective tool used for decision-making in economics. In this paper, we design a new model for risk assessment in ubiquitous environment and use risk as a key component in decision-making process in our access control model. This solution makes access control management more dynamic and precise.
Modeling personal and social network context for event annotation in images
Authors: Bageshree Shevade, Hari Sundaram, Lexing Xie
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

This paper describes a framework to annotate images using personal and social network contexts. The problem is important as the correct context reduces the number of image annotation choices.. Social network context is useful as real-world activities of members of the social network are often correlated within a specific context. The correlation can serve as a powerful resource to effectively increase the ground truth available for annotation. There are three main contributions of this paper: (a) development of an event context framework and definition of quantitative measures for contextual correlations based on concept similarity in each facet of event context; (b) recommendation algorithms based on spreading activations that exploit personal context as well as social network context; (c) experiments on real-world, everyday images that verified both the existence of inter-user semantic disagreement and the improvement in annotation when incorporating both the user and social network context. We have conducted two user studies, and our quantitative and qualitative results indicate that context (both personal and social) facilitates effective image annotation.
Computer aided human-machine interface design
Authors: A. K. Sengupta
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

Computer generated models of three dimensional mannequins can be used to visually and objectively analyze the human fit to the equipment being designed. A computer program has been developed which runs under an AutoCAD platform and enables users to conduct evaluations of human fit from the early stage of design. The program is useful in both classroom demonstrations and industrial applications. The program features are described and its application illustrated with an example. 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
Compilation of a Functional Language for the Multithreaded Architecture: DAVRID
Authors: E. H. Rho, S. H. Ha, S. Y. Han, H. H. Kim, D. J. Hwang
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

Multithreading has been much focused on as one of the strongest parallel instruction execution paradigms for massively parallel processing. In this paper, we describe the compilation processes of parallel programming language Id- for a multithreaded architecture DAVRID(DAtaflow Von Neumann RISC hybrlD). Two fundamental issues in parallel processing, tolerance to communication latency and inexpensive synchronization, are solved by a compiler-controlled multithreading. Our compiler features a simple mechanism for handling closures, and a loop unfolding technique for handling parallel and sequential loops in separate, which can greatly contribute to parallel execution of loops.
Continuous localization via wide-area Differential Global Positioning System for outdoor navigation of mobile robots
Authors: J. L. Martínez, R. Molina-Mesa, A. Mandow, C. A. Rodríguez-Serrano
Venue: Integrated Computer-Aided Engineering (2004)

Mobile robots must have some effective method for determining their position in the working environment in order to operate appropriately. In this paper, precise outdoor positioning of a vehicle is achieved by continuously fusing odometry with wide-area Differential Global Positioning System (DGPS) data through a Kalman filter. The propagation and reduction of spatial uncertainty is computed together with the mobile robot's coordinates and heading. Two distinct sources of differential corrections have been applied to autonomous and teleoperated navigation of the Aurora mobile robot in a road network. Path teaching and path tracking have been successfully tested in several experiments over a relatively flat surface.
A collaborative framework for collecting Thai unknown words from the web
Authors: Choochart Haruechaiyasak, Chatchawal Sangkeettrakarn, Pornpimon Palingoon, Sarawoot Kongyoung, Chaianun Damrongrat
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

We propose a collaborative framework for collecting Thai unknown words found on Web pages over the Internet. Our main goal is to design and construct a Web-based system which allows a group of interested users to participate in constructing a Thai unknown-word open dictionary. The proposed framework provides supporting algorithms and tools for automatically identifying and extracting unknown words from Web pages of given URLs. The system yields the result of unknown-word candidates which are presented to the users for verification. The approved unknown words could be combined with the set of existing words in the lexicon to improve the performance of many NLP tasks such as word segmentation, information retrieval and machine translation. Our framework includes word segmentation and morphological analysis modules for handling the non-segmenting characteristic of Thai written language. To take advantage of large available text resource on the Web, our unknown-word boundary identification approach is based on the statistical string pattern-matching algorithm.
Anisotropic Measures of Third Order Derivatives and the Quadratic Interpolation Error on Triangular Elements
Authors: Weiming Cao
Venue: SIAM Journal on Scientific Computing (2007)

The main purpose of this paper is to present a closer look at how the $H^1$- and $L^2$-errors for quadratic interpolation on a triangle are determined by the triangle geometry and the anisotropic behavior of the third order derivatives of interpolated functions. We characterize quantitatively the anisotropic behavior of a third order derivative tensor by its orientation and anisotropic ratio. Both exact error formulas and numerical experiments are presented for model problems of interpolating a cubic function $u$ at the vertices and the midpoints of three sides of a triangle. Based on the study on model problems, we conclude that when an element is aligned with the orientation of $\nabla^3 u$, the aspect ratio leading to nearly the smallest $H^1$- and $L^2$-norms of the interpolation error is approximately equal to the anisotropic ratio of $\nabla^3 u$. With this alignment and aspect ratio taken, the $H^1$-seminorm of the error is proportional to the reciprocal of the anisotropic ratio of $\nabla^3 u$, the $L^2$-norm of the error is proportional to the $-\frac 32$th power of the anisotropic ratio, and both of them are insensitive to the internal angles of the element.
Fuzzy Logic Based Model of a New Tool for Measuring E-Readiness
Authors: Reggie Davidrajuh
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

This paper proposes a new tool for measuring e-readiness (the investment climate) of a country. Firstly, this paper presents some of the difficulties (e.g. imprecise data) in measuring e-readiness of a country. Secondly, this paper presents a fuzzy logic model of a new tool for measuring e-readiness, as fuzzy logic is well suited for working with imprecise data. Finally, this paper presents a hybrid tool for measuring e-readiness. The hybrid model uses fuzzy logic together with array-based logic. The main reason for proposing the hybrid tool is to reduce the size of the fuzzy rules base.
Using Tcl/Tk in biology research application development
Authors: Ellen R. Bergeman, Mark Graves
Venue: Proceedings of the 5th conference on Annual Tcl/Tk Workshop 1997 - Volume 5 (1997)

Biology research is an area which presents many problems for software application development. Biology application development occurs within a framework of rapidly changing needs; unspecified or incomplete requirements; short term versus long term needs; complex, often incompletely defined concepts; and multiple platforms with varying infrastructure. Biology researchers rely heavily on applications developed to analyze data, access databases, and store ongoing research data. Often the bottlenecks in research projects are not in the laboratory but instead are in the lack of software needed to handle the data. Biology research changes rapidly and new laboratory techniques can be brought into a laboratory quickly, becoming integral elements in a very short time. Often a new technique is brought in because it will speed up the work in the lab, and therefore it changes the requirements for software support. For biology application developers, the need for an application is often not known until there is a bottleneck in the research process.
Parallel Algorithms for the Two-Dimensional Discrete Wavelet Transform
Authors: Dilip Krishnaswamy, Michael Orchard
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

We present in this paper two parallel algorithms for the two-dimensional discrete wavelet transform. A mathematical model for the computation vs. communication tradeoff for these algorithms is presented and the scalability of the algorithms is analyzed. The wormhole routing model was used to model the communication costs involved. The algorithms were implemented on the Connection Machine-5 (CM-5^{a}). The theoretical results obtained were validated by the simulations on the CM-5.
A Simple Operator for Very Precise Estimation of Ellipses
Authors: Jean-Nicolas Ouellet, Patrick Hebert
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

This paper presents a simple linear operator that ac- curately estimates the position and parameters of ellipse features. Based on the dual conic model, the operator avoids the intermediate stage of precisely extracting indi- vidual edge points by exploiting directly the raw gradient information in the neighborhood of an ellipse's boundary. Moreover, under the dual representation, the dual conic can easily be constrained to a dual ellipse when minimizing the algebraic distance. The new operator is assessed and com- pared to other estimation approaches in simulation as well as in real situation experiments and shows better accuracy than the best approaches, including those limited to the cen- ter position.
Interval completion with few edges
Authors: Pinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

We present an algorithm with runtime O(k(2k)n3 * m) for the following NP-complete problem: Given an arbitrary graph G on n vertices and m edges, can we obtain an interval graph by adding at most k new edges to G? This resolves the long-standing open question, first posed by Kaplan, Shamir and Tarjan, of whether this problem could be solved in time f(k) * n(O(1)).The problem has applications in Physical Mapping of DNA and in Profile Minimization for Sparse Matrix Computations. For the first application, our results show tractability for the case of a small number k of false negative errors, and for the second, a small number k of zero elements in the envelope. Our algorithm performs bounded search among possible ways of adding edges to a graph to obtain an interval graph, and combines this with a greedy algorithm when graphs of a certain structure are reached by the search. The presented result is surprising, as it was not believed that a bounded search tree algorithm would suffice to answer the open question affirmatively.
Retrofitting quality of service into a time-sharing operating system
Authors: John Bruno, José Brustoloni, Eran Gabber, Banu Özden, Abraham Silberschatz
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1999)

Theoretical aspects of proportional share schedulers have received considerable attention recently. We contribute practical considerations on how to retrofit such schedulers into mainstream time-sharing systems. In particular, we propose /reserv, a uniform API for hierarchical proportional resource sharing. The central idea in /reserv is associating resource reservations with references to shared objects (and not with the objects themselves). We discuss in detail the implementation of /reserv and several proportional share schedulers on FreeBSD; the modified system is called Eclipse/BSD. Our experiments demonstrate that the proposed modifications allow selected applications to isolate their (or their clients') performance from CPU, disk, or network overloads caused by other applications. This capability is increasingly important for soft real-time, multimedia, Web, and distributed client-server applications.
Insider-secure Hybrid Signcryption SchemeWithout Random Oracles
Authors: Chik How Tan
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Confidentiality and authenticity are two important security requirements in most secure systems. To efficiently provide data privacy (confidentiality) and (data/user) authenticity simultaneously, the notion of signcryption scheme was first introduced by Zheng in 1997. The security model for signcryption scheme was proposed by Baek et al. and An et al. in 2002 independently. Since then, many signcryption schemes were proposed; they are either a public-key signcryption or a hybrid signcryption. But, only few proposed signcryption schemes were supposed to be in the insider security, for example, Libert-Quisquater's signcryption schemes at PKC'2004 and SCN'2004 respectively and Yang-Wong-Deng's signcryption scheme at ISC'2005. Although all the above mentioned signcryption schemes were proved insider-secure against adaptive chosen ciphertext attack in the random oracle models, Tan showed that all the above mentioned signcryption schemes were not insidersecure against adaptive chosen ciphertext attack in 2005 and 2006 respectively. Up to our knowledge, it seems that none of insider-secure hybrid signcryption scheme is constructed without random oracles. In this paper, we proposed a hybrid signcryption scheme and showed that the proposed scheme is insider-secure without random oracles.
Developing attribute acquisition strategies in spoken dialogue systems via user simulation
Authors: Stephanie Seneff
Venue:  (2006)

A spoken dialogue system (SDS) is an application supporting conversational interaction with a human to perform some task. One barrier to the widespread deployment of SDSs exists in the form of communication breakdown in the dialogue, often when the user tries to supply a named entity from a large or open vocabulary set. For example, a weather information system will likely misrecognize an unknown city as some known city, leading to unpredictable system and user behavior. This thesis presents a framework for developing attribute acquisition strategies with a simulated user. We focus on acquiring unknown city names in a flight domain, through a spell-mode subdialogue. Collecting data from real users is costly. Furthermore, our goal is to focus on user behavior that tends to arise sporadically in real dialogues. Therefore, we employed user simulation to efficiently produce many dialogues, and to configure the input as desired in order to exercise specific strategies. We present a novel method of utterance generation for user simulation, combining segments of real and synthesized speech. This method retains the structural variety of real user utterances, while introducing synthesized items, such as unknown city names, that lead to problematic situations, for which we can develop strategies. We also devised a model of generic dialogue management, allowing a developer to quickly specify interaction properties on a per-attribute basis. This model was used to assess the effectiveness of various combinations of dialogue strategies and simulated user behavior. We use simulation to address two problems: the conflict problem requires the system to choose how to act when a new hypothesis for an attribute conflicts with its current belief, while the compliance problem requires the system to decide whether a user complied with a spelling request. Decision models were learned from simulated data, and were tested with real users, showing that the learned model significantly outperformed a heuristic model in choosing the "ideal" response to the conflict problem. The compliance prediction model achieved near perfect accuracy. These results suggest that such models learned from simulated data can attain similar, if not better, performance in dialogues with real users. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Regular directional types for logic programs
Authors: Witold Charatonik
Venue: Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming (2007)

Directional types assign each predicate in a logic program a pair of an input and an output type describing the possible argument terms before and after a call of the predicate. Regular types use tree automata for the effective representation of recursive data structures such as lists. In this talk, we discuss a type system for logic programs based on regular directional types.
GiGi: An Ocean of Gridlets on a "Grid-for-the-Masses"
Authors: Luis Veiga, Rodrigo Rodrigues, Paulo Ferreira
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

There have been a few proposals aiming at bridging the gap between institutional grid infrastructures (e.g., Globus-based), popular cycle-sharing applications (e.g., SETI@home), and massively used decentralized P2P filesharing applications. Nonetheless, no such infrastructure was ever successful in allowing, in a large-scale, home users to run popular desktop applications faster, by using spare cycles in other users' machines and, in return, donate their spare cycles to run other users' applications. We present a novel application and programming model that was designed to overcome some of the barriers to the deployment of a generic peer-to-peer grid infrastructure. In particular, we want to enable a trivial deployment in such infrastructures of existing applications that are in widespread use but do not currently exploit parallelism for improved performance.] The model presented in this paper revolves around the concept of a Gridlet, a semantics-aware unit of workload division and computation off-load. A gridlet is a chunk of data associated with the operations to be performed on the data, and in many cases these operations consist of unmodified application binaries. Moreover, the concept of gridlet is also employed for resource management, and accounting of peer contribution. We believe this new concept, absent in other proposals, will significantly lower the barriers for exploiting parallel execution in popular applications, thus improving the chances of the gridlet model being widely adopted.
From Taylorism to competence-based production
Authors: Peter Br&#x00f6;dner
Venue: AI Society (2007)

During the four decades of my professional career, manufacturing has been subdued to a radical change from objectifying to subjectifying work. The evolution of the originally prevailing Taylor model with its functionally divided and highly mechanised work processes culminated in the 1980s in the rise and fall of computer integrated manufacturing (CIM) contested by the alternative approach of human-centred production systems. The change process then went through phases of confusion and experimentation, in which competence-based manufacturing strategies and structures have been crystallising in sharp contrast to the majority of less sustainable forms of organisational renewal. The paper reflects on main features of this transformation process as it has been mirrored in my own research work and relates major findings to the work of others.