ppxscal/embedding_network huggingface dataset:
Primitive decompositions of Johnson graphs
Authors: Alice Devillers, Michael Giudici, Cai Heng Li, Cheryl E. Praeger
Venue: Journal of Combinatorial Theory Series A (2008)

A transitive decomposition of a graph is a partition of the edge set together with a group of automorphisms which transitively permutes the parts. In this paper we determine all transitive decompositions of the Johnson graphs such that the group preserving the partition is arc-transitive and acts primitively on the parts.
Forward chaining in HALO: an implementation strategy for history-based logic pointcuts
Authors: Charlotte Herzeel, Kris Gybels, Pascal Costanza, Coen De Roover, Theo D'Hondt
Venue: Proceedings of the 2007 international conference on Dynamic languages: in conjunction with the 15th International Smalltalk Joint Conference 2007 (2007)

In aspect-oriented programming, pointcuts are formulated as conditions over the context of dynamic events in the execution of a program. Hybrid pointcut languages also allow this context to come from interaction between the pointcut language and the base program. While some pointcut languages only allow conditions on the current execution event, more recent proposals have demonstrated the need for expressing conditions over a history of joinpoints. Such pointcut languages require means to balance the expressiveness of the language with the additional memory and runtime overhead caused by keeping a history of joinpoint context data. In this paper, we introduce a logic-based pointcut language that allows interaction with the base program as well as pointcuts over a history of joinpoints. We introduce forward chaining as an implementation model for this language, and discuss possible optimization strategies for the additional overhead.
Cross-lingual thesaurus for multilingual knowledge management
Authors: Christopher C. Yang, Chih-Ping Wei, K. W. Li
Venue: Decision Support Systems (2008)

The Web is a universal repository of human knowledge and culture which has allowed unprecedented sharing of ideas and information in a scale never seen before. It can also be considered as a universal digital library interconnecting digital libraries in multiple domains and languages. Beside the advance of information technology, the global economy has also accelerated the development of inter-organizational information systems. Managing knowledge obtained in multilingual information systems from multiple geographical regions is an essential component in the contemporary inter-organization information systems. An organization cannot claim itself to be a global organization unless it is capable to overcome the cultural and language barriers in their knowledge management. Cross-lingual semantic interoperability is a challenge in multilingual knowledge management systems. Dictionary is a tool that is widely utilized in commercial systems to cross the language barrier. However, terms available in dictionary are always limited. As language is evolving, there are new words being created from time to time. For examples, there are new technical terms and name entities such as RFID and Baidu. To solve the problem of cross-lingual semantic interoperability, an associative constraint network approach is investigated to construct an automatic cross-lingual thesaurus. In this work, we have investigated the backmarking algorithm and the forward evaluation algorithm to resolve the constraint satisfaction problem represented by the associative constraint network. Experiments have been conducted and show that the forward evaluation algorithm outperforms the backmarking one in terms of precision and recall but the backmarking algorithm is more efficient than the forward evaluation algorithm. We have also benchmarked with our earlier technique, Hopfield network, and showed that the associate constraint network (either backmarking or forward evaluation) outperforms in precision, recall, and efficiency.
Muse: a system for understanding and designing mappings
Authors: Bogdan Alexe, Laura Chiticariu, Renée J. Miller, Daniel Pepper, Wang-Chiew Tan
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Schema mappings are logical assertions that specify the relationships between a source and a target schema in a declarative way. The specification of such mappings is a fundamental problem in information integration. Mappings can be generated by existing mapping systems (semi-)automatically from a visual specification between two schemas. In general, the well-known 80-20 rule applies for mapping generation tools. They can automate 80% of the work, covering common cases and creating a mapping that is close to correct. However, ensuring complete correctness can still require intricate manual work to perfect portions of the mapping. Previous research on mapping understanding and refinement and anecdotal evidence from mapping designers suggest that the mapping design process can be perfected by using data examples to explain the mapping and alternative mappings. We demonstrate Muse, a data example driven mapping design tool currently implemented on top of the Clio schema mapping system. Muse leverages data examples that are familiar to a designer to illustrate nuances of how a small change to a mapping specification changes its semantics. We demonstrate how Muse can differentiate between alternative mapping specifications and infer the desired mapping semantics based on the designer's actions on a short sequence of simple data examples.
Design Of The Narrator System: Processing, Storing And Retrieving Medical Narrative Data
Authors: Leo Wolf, Regina Overberg, Pieter Toussaint, Eduard Hoenkamp, Hilke Reckman
Venue: Journal of Integrated Design Process Science (2006)

In the context of patients communicating about their disease, there are several channels along which this can be done. Most of these channels do not take the patient as primary input, but provide authoritative information. The Narrator system supplies patients with information extracted from personal stories in plain text format called "narratives". These will be processed and stored using techniques from both Information Retrieval and Natural Language Processing. As such, the system will be set up as a toolbox implementing different approaches while a Service Oriented Architecture provides the framework for integration. In this paper such approaches are described together with efforts to combine them within a suitable architecture. Furthermore, some of the important implementation details are discussed. As a starting point for the system, experiments have been carried out with initial narratives, the results of which are discussed.
On the saint-Venant problem in a doubly connected domain
Authors: L. Ragoub
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

The Saint-Venant elliptic over-determined problem in a doubly connected domain is considered. The use of Weinberger functional leads us to conclude that the domain is in effect an N-ball. The tool of this investigation are best maximum principles and Rellich's identity.
RFID-Based Locating Management
Authors: Xuan Gu, Dong Wang, Huanye Sheng
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

After manufacturing and retail marketing, locating management is considered to be the next home for Radio Frequency Identification (RFID). RFID technology has gained a great potential in locating management to achieve the flexibility, maintainability and extensibility of the system. However, the challenge will be to incorporate RFID into locating management, especially when relevant experience is limited. The RFID-based locating management system must be deployed quickly according to the requirements of the different applications and generate location data fast and efficiently. The paper investigates the issues related to effective RFID dynamical deployment and RFID data management, and introduces an appropriate architecture for dealing with the problems described above.
"Narrowcast yourself": designing for community storytelling in a rural Indian context
Authors: Matt Jones, Will Harwood, David Bainbridge, George Buchanan, David Frohlich, Dorothy Rachovides, Maxine Frank, Mounia Lalmas
Venue: Proceedings of the 7th ACM conference on Designing interactive systems (2008)

The StoryBank project is examining technologies and practices to allow digitally impoverished communities to take part in the user-generated content revolution. The approach involves combining mobile phones to create audio-visual stories and a touch screen display situated in a community meeting place. This paper discusses the design, evaluation and refinement of the situated display. We consider how our experiences of working with a rural Indian village community influenced design processes, principles and prototypes. The work highlights the value of community-centred design practices and prototypes in such developing-world contexts.
Friends or foes?: a conceptual analysis of self-adaptation and it change management
Authors: Cristina Gacek, Holger Giese, Ethan Hadar
Venue: Proceedings of the 2008 international workshop on Software engineering for adaptive and self-managing systems (2008)

Self-Adaptation as a vision promises to enable software systems which can autonomously adapt to changes of their context and requirements. Thus, it facilitates the autonomous evolution of the software without manual intervention. However, in practice we cannot expect that all systems with self-adaptation are developed anew and that all their behavioral aspects are handled in an autonomous manner. Instead an evolutionary approach leading from today's systems to partially self-managed systems is required. To enable such a path, we explore in this paper what a conceptual model and processes for self-adaptation should look like using the current practice in ITIL Change Management as initial reference point. We define the required responsibilities and a generic conceptual object model and map them to the ITIL Change Management roles to evaluate the similarities and differences. Moreover, the implications for the co-existence of self-adaptation and Change Management are discussed. Finally, examples for self-adaptive systems are used to exemplify our concept.
Sensitive functions and approximate problems
Authors: S. Chaudhuri
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

We investigate properties of functions that are good measures of the CRCW PRAM complexity of computing them. While the block sensitivity is known to be a good measure of the CREW PRAM complexity, no such measure is known for CRCW PRAMs. We show that the complexity of computing a function is related to its everywhere sensitivity, introduced by Vishkin and Wigderson (1985). Specifically we show that the time required to compute a function f:D/sup n//spl rarr/R of everywhere sensitivity es(f) with P/spl ges/n processors and unbounded memory is /spl Omega/(log[log es(f)/(log 4P|D|- log es(f))]). This improves previous results of Azar (1992), and Vishkin and Wigderson. We use this lower bound to derive new lower bounds for some approximate problems. These problems can often be solved faster than their exact counterparts and for many applications, it is sufficient to solve the approximate problem. We show that approximate selection requires time /spl Omega/(log[log n/log k]) with kn, processors and approximate counting with accuracy /spl lambda//spl ges/2 requires time /spl Omega/(log[log n/(log k+log /spl lambda/)]) with kn processors. In particular, for constant accuracy, no lower bounds were known for these problems.
A Node Allocation Algorithm for Parallel Applications
Authors: S. Subha
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

This paper proposes an allocation scheme of nodes to distributed applications that minimizes the total execution time. The scheme is based on profiling. An algorithm that models the system as a min-max optimization problem is developed. The algorithm transfers nodes from faster processes to slower process by inspection of the profiled data and arrives at a solution better than existing algorithm.
Variational optimality condition in the problem of control of initial boundary conditions for semilinear hyperbolic systems
Authors: A. V. Arguchintsev, V. P. Poplevko
Venue: Automation and Remote Control (2008)

Consideration is given to the problem of optimal control of a system of semilinear hyperbolic equations at finite-dimensional (pointwise) relations between initial boundary states of the system and control actions. In this case, the optimality condition in the form of a pointwise maximum principle is invalid. A nonclassical optimality condition of a variational type is proved. The sense of the obtained result is in that an optimal boundary or start control nearly at each point is a solution to a special problem of control of initial conditions for the system of ordinary differential equations constructed on the family of characteristics of the initial hyperbolic system. Constructions of the indicated optimality condition are illustrated by two examples. An iterative method based on the obtained result is stated. The method does not require additional assumptions about the differentiability of parameters of the control problem and convexity of the set of admissible controls necessary in using gradient methods.
Goal and path prediction based on user's moving path data
Authors: Taebok Yoon, Jee-Hyong Lee
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

User adaptive services are important features in many applications. To provide such services, techniques with various kinds of data are being used. In this paper, we propose a method to analyze a user's past moving paths to predict the goal position and the path to the goal by observing the user's current moving path. We developed a spatiotemporal similarity measure between paths. We chose a past path that was most similar to the current path using the similarity measure. Based on the chosen path, the user's spatiotemporal position was estimated. We performed experiments to confirm this method as useful and effective
Complement of Source Equation of Elastic Line
Authors: Mirjana Filipovic, Miomir Vukobratovic
Venue: Journal of Intelligent and Robotic Systems (2008)

A new notion of joint, defined in terms of the state of motor (active or locked) and type of the elastic or rigid element, gear and/or link that follows after the motor, is introduced. Special attention is paid to the motion of the flexible links in the robotic configuration. The paper deals with the relationship between the equation of elastic line equilibrium, the "Euler---Bernoulli approach" (EBA), and equation of motion at the point of elastic line tip, the "Lumped-mass approach" (LMA). The Euler---Bernoulli equations (which have for a long time been used in the literature) should be expanded according to the requirements of the motion complexity of elastic robotic systems. The Euler---Bernoulli equation (based on the known laws of dynamics) should be supplemented with all the forces that are participating in the formation of the elasticity moment of the considered mode. This yields the difference in the structure of Euler---Bernoulli equations for each mode. The stiffness matrix is a full matrix. Mathematical model of the actuators also comprises coupling between elasticity forces. Particular integral of Daniel Bernoulli should be supplemented with the stationary character of elastic deformation of any point of the considered mode, caused by the present forces. General form of the elastic line is a direct outcome of the system motion dynamics, and cannot be described by one scalar equation but by three equations for position and three equations for orientation of every point on that elastic line. The choice of reference trajectory is analyzed. Simulation results are shown for a selected robotic example involving the simultaneous presence of elasticity of the gear and of the link (two modes), as well as the environment force dynamics.
Minimum decoupling capacitor insertion in VLSI power/ground supply networks by semidefinite and linear programs
Authors: Bao Liu, Sheldon X.-D. Tan
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

Nanometer-scale VLSI design demands reliable on-chip power/ground (P/G) supply. Decoupling capacitors effectively reduce P/G supply fluctuation at the cost of leakage increase and yield loss. Existing P/G supply network decoupling capacitor insertion techniques are based on sensitivity analysis and greedy optimization. In this paper, we propose a semidefinite program and a linear program for minimum decoupling capacitor insertion in a P/G supply network, which are global optimizations with theoretically guaranteed supply voltage degradation bounds. We also propose scalability improvement schemes which enable application of the proposed semidefinite and linear programs to practical industry designs. Our experimental results on industry designs verify that the proposed semidefinite program guarantees supply voltage degradation bound for all possible supply current sources, while the proposed linear program achieves the most accurate supply voltage degradation control for a given set of supply current sources.
A systematic comparison of flat and standard cascade-correlation using a student-teacher network approximation task
Authors: F. Dandurand, V. Berthiaume, T. R. Shultz
Venue: Connection Science (2007)

Cascade-correlation (cascor) networks grow by recruiting hidden units to adjust their computational power to the task being learned. The standard cascor algorithm recruits each hidden unit on a new layer, creating deep networks. In contrast, the flat cascor variant adds all recruited hidden units on a single hidden layer. Student-teacher network approximation tasks were used to investigate the ability of flat and standard cascor networks to learn the input-output mapping of other, randomly initialized flat and standard cascor networks. For low-complexity approximation tasks, there was no significant performance difference between flat and standard student networks. Contrary to the common belief that standard cascor does not generalize well due to cascading weights creating deep networks, we found that both standard and flat cascor generalized well on problems of varying complexity. On high-complexity tasks, flat cascor networks had fewer connection weights and learned with less computational cost than standard networks did.
Widgets & Mobile 2.0
Authors: Scott Weiss
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

Widgets & Mobile 2.0: What is it all about? What are the cool toys? How is the user experience going to come to everyday people... What needs to change?
Document similarity based on concept tree distance
Authors: Praveen Lakkaraju, Susan Gauch, Mirco Speretta
Venue: Proceedings of the nineteenth ACM conference on Hypertext and hypermedia (2008)

The Web is quickly moving from the era of search engines to the era of discovery engines. Whereas search engines help you find information you are looking for, discovery engines help you find things that you never knew existed. A common discovery technique is to automatically identify and display objects similar to ones previously viewed by the user. Core to this approach is an accurate method to identify similar documents. In this paper, we present a new approach to identifying similar documents based on a conceptual tree-similarity measure. We represent each document as a concept tree using the concept associations obtained from a classifier. Then, we make employ a tree-similarity measure based on a tree edit distance to compute similarities between concept trees. Experiments on documents from the CiteSeer collection showed that our algorithm performed significantly better than document similarity based on the traditional vector space model.
Personalized iDTV Program in Multimedia Home Platform
Authors: Cin-Shung Yang, Pang-Chieh Wang, Cheng-Liang Lin, Ting-Wei Hou
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Interactive digital TV (iDTV) plays an important role of the future home entertainment. There are a lot of differences between iDTV and traditional TV, such as protocols, standards and operations. The iDTV is more complicated and provides more applications. Under the framework of iDTV, it can provide interactive TV programs for users. An interactive TV program of a channel can bring one or more applications, and a user should choose and use the application. When a user chooses one TV program in a channel, he/she can not know other applications which go with programs in other channels. It means that a user is restricted to select applications of one channel. It is not convenient for a user who wants to watch channel A but also wants to uses the applications of channel B. This paper provides an new design of enhancement to solve the problem on the iDTV middleware. In addition, an extended iDTV program for personalization is also proposed to resolve resource conflict.
Studies of polymer deformation and recovery in micro hot embossing
Authors: Xuechuan Shan, Y. C. Liu, Y. C. Lam
Venue: Microsystem Technologies (2008)

In large areas of micro hot embossing, process temperature plays a critical role to both the local-area fidelity and global uniformity of microstructure formation. Higher embossing temperature could improve structure fidelity, however, at the expense of demoulding easiness. Micro embossing at the lowest possible temperature with acceptable fidelity can improve global flatness after demoulding. This study focuses on polymer deformation and recovery in micro embossing when the process temperature is below the polymer glass transition temperature (Tg). PMMA (Polymethyl Methacrylate) substrates (Tg&#x00a0;=&#x00a0;105&#x00b0;C) were employed with the process temperature ranging from 25&#x00b0;C to its Tg. At temperature below Tg &#x2212;55&#x00b0;C, significant recovery occurred after processing, but permanent structures could still be formed with sufficiently high applied stress. With an increase in temperature, plastic deformation increased and was the dominant polymer deformation mode for permanent cavities formation. However, the formation of protrusive structures was not complete since there was little polymer flow. The polymer will lose its storage modulus at an even higher temperature and microstructures could be formed with high fidelity. A compromise between local fidelity of embossed patterns and global flatness of substrate has to be reached in micro hot embossing.
Relations in Fuzzy Class Theory
Authors: Libor Běhounek, Ulrich Bodenhofer, Petr Cintula
Venue: Fuzzy Sets and Systems (2008)

This paper studies fuzzy relations in the graded framework of Fuzzy Class Theory (FCT). This includes (i) rephrasing existing work on graded properties of binary fuzzy relations in the framework of Fuzzy Class Theory and (ii) generalizing existing crisp results on fuzzy relations to the graded framework. Our particular aim is to demonstrate that Fuzzy Class Theory is a powerful and easy-to-use instrument for handling fuzzified properties of fuzzy relations. This paper does not rephrase the whole theory of (fuzzy) relations; instead, it provides an illustrative introduction showing some representative results, with a strong emphasis on fuzzy preorders and fuzzy equivalence relations.