ppxscal/embedding_network huggingface dataset:
The minimum degree threshold for perfect graph packings
Authors: Daniela K&#x00fc;hn, Deryk Osthus
Venue: Combinatorica (2009)

Let H be any graph. We determine up to an additive constant the minimum degree of a graph G which ensures that G has a perfect H-packing (also called an H-factor). More precisely, let &#x03b4;(H,n) denote the smallest integer k such that every graph G whose order n is divisible by |H| and with &#x03b4;(G)&#x2265;k contains a perfect H-packing. We show that $$\delta (H,n) = \left( {1 - \frac{1} {{\chi ^ * (H)}}} \right)n + O(1)$$. The value of &#x03c7;*(H) depends on the relative sizes of the colour classes in the optimal colourings of H and satisfies &#x03c7;(H)&#x2212;1<&#x03c7;*(H)&#x2264;&#x03c7;(H).
The equality problem for infinite words generated by primitive morphisms
Authors: Juha Honkala
Venue: Information and Computation (2009)

We study the equality problem for infinite words obtained by iterating morphisms. In particular, we give a practical algorithm to decide whether or not two words generated by primitive morphisms are equal.
Mathematical modeling of instability of electrically driven jet
Authors: N. J. Carrasquero, D. N. Riahi
Venue: Proceedings of the 15th american conference on Applied mathematics (2009)

This paper considers the problem of linear temporal instability of electrically forced jets. A mathematical model, which is developed for such flow instability, is based on the relevant approximated versions of the equations of the electrohydrodynamics for an electrically forced jet flow. Non-zero background free charge density is admitted only under an externally imposed non-uniform electric field. We found, in particular, that for either uniform or non-uniform field, certain instability modes with different domain in their wavelengths are dominated.
3D Mesh decomposition using Reeb graphs
Authors: Stefano Berretti, Alberto Del Bimbo, Pietro Pala
Venue: Image and Vision Computing (2009)

Decomposition of complex 3D objects into simpler sub-parts is a challenging research subject with relevant outcomes for several application contexts. In this paper, an approach is proposed for decomposition of 3D objects based on Reeb graphs. The approach is motivated by perceptual principles and supports identification of salient object protrusions. Experimental results are presented to demonstrate the effectiveness of the proposed approach with respect to different solutions appeared in the literature, and with reference to ground-truth data obtained by manual decomposition of 3D objects.
Principles of Model Driven Architecture in Knowledge Modeling for the Task of Study Program Evaluation
Authors: Oksana Nikiforova, Marite Kirikova, Natalya Pavlova
Venue: Proceeding of the 2007 conference on Databases and Information Systems IV: Selected Papers from the Seventh International Baltic Conference DB&IS'2006 (2007)

Two-hemisphere model driven (2HMD) approach assumes modeling and use of procedural and conceptual knowledge on equal and related basis according to the principles of Model Driven Architecture (MDA), which separates different aspects of system modeling. This differentiates 2HMD approach from pure procedural, pure conceptual, and object oriented approaches. The approach may be applied in the context of modeling of a particular business domain as well as in the context of modeling the knowledge about the domain. Therefore, the principles of MDA via 2HMD approach may be applied not only in the context of software development but also in the context of the study course and program development. Knowledge modeling by 2HMD approach gives an opportunity to transparently analyze and compare knowledge to be provided and knowledge actually provided by courses belonging to a particular study program, and, thus, to identify and fill gaps between desirable and actual knowledge content of the study program.
Two ID-Free Distributed Distance-2 Edge Coloring Algorithms for WSNs
Authors: André C. Pinho, Alexandre A. Santos, Daniel R. Figueiredo, Felipe M. França
Venue: Proceedings of the 8th International IFIP-TC 6 Networking Conference (2009)

One of the most important problems for Wireless Sensor Networks (WSNs) is energy consumption since it ultimately determines the lifetime of the system. Medium Access Control (MAC) protocols based on schedules (e.g., TDMA) play an important role, since collisions and idle listening can be avoided, effectively reducing energy consumption. The problem of determining good transmission schedules for WSNs can be mapped to the distance-2 edge coloring problem in graphs, where edge colors represent slots in a TDMA-based MAC protocol, for example. In this paper, we propose and evaluate two new probabilistic and distributed distance-2 edge coloring algorithms that require no global node identifiers. We obtain analytical results for the worst-case convergence time. Moreover, we use simulations to evaluate the performance of the algorithms with respect to several metrics. Our findings indicate a tradeoff between convergence time and message overhead versus number of colors used.
On the Ecological/Representational Structure of Virtual Environments
Authors: Omar Rosas
Venue: Proceeding of the 2008 conference on Current Issues in Computing and Philosophy (2008)

This paper introduces an alternative view of virtual environments based on an analysis of two opposing views: the Traditional View and the Ecological View. The Traditional View argues for a representational view of perception and action susceptible of being mapped onto virtual settings. The Ecological View, which is inspired by Gibson's ecological approach to perception, considers that perception and action are inseparable, embodied processes that do not imply mental representations. The alternative view put forward here claims for an articulation of the opposing views, namely the Ecological/Representational view of virtual environments, providing the notion and levels of representation implied in perceptual and agentic processes is functionally defined.
Learning Conflicting Information: Reading versus Discussion
Authors: Heisawn Jeong
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)

This study compared two different ways of learning conflicting information, reading and discussion. College students were surveyed on their views on dam construction, and then learned about a view opposed to their own either by individually studying a text or by discussing the topic with another student. Students in the discussion condition never had a chance to read the opposing text itself and had to learn it from their partner through the discussion. Nonetheless, their performance was comparable to the performance of the students in the individual reading condition who actually read the text. More students changed their belief after discussion than after reading the text. These preliminary results suggest that discussion can be as effective as reading in learning conflicting information, but the process of learning might be different in the two conditions.
Mechanical Reasoning about Families of UTP Theories
Authors: Frank Zeyda, Ana Cavalcanti
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

In this paper we present a semantic embedding of Hoare and He's Unifying Theories of Programming (UTP) framework into the ProofPower-Z theorem prover; it concisely captures the notion of UTP theory, theory instantiation, and, additionally, type restrictions on the alphabet. We show how the encoding can be used to reason about UTP theories and their predicates, including models of particular specifications and programs. We support encoding and reasoning about combinations of elements of collections of theory instantiations, as typically found in UTP models of particular specifications and programs.
Framework for Problem-Solving Based Learning in Nursing Domain --A Practical Study --
Authors: Yukie Majima, Yoichiro So, Kazuhisa Seta
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

This paper describes a summary and learning effects of e-learning materials based on nursing practice examples for the purpose of cultivating problem-solving ability of nursing students. The materials have a structure that incorporates the relationship between imaging promotion and knowledge that has already been learned. For one subject, learning is carried on in accordance with the following procedures: 1. “Grasp” the subject's condition. 2. “Analyze” nursing problems that are faced. 3. “Confirm the results” that were analyzed. We put the materials to practical use in whole class teaching and conducted surveys of nursing students. Results indicated remarkable knowledge: it could promote imaging of subjects and nursing problem scenes, it was effective for positive motivation for learning and it makes learners' self-evaluation criteria get sticker by imaging the real situation.
Developing Teaching Aids for Distance Education
Authors: Jihie Kim, Carole Beal, Zeeshan Maqbool
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

As web-enhanced courses become more successful, they put considerable burdens on instructors and teaching assistants. We present our work on developing software tools to support instructors by A) semi automatic grading of discussions and B) creating instructional tools that handle many student requests. We are using knowledge-based techniques in modelling course components, student queries, and relations between them. The results from our initial analysis in developing such tools are also presented.
Intelligent GIS for solving high-dimensional site selection problems using ant colony optimization techniques
Authors: Xia Li, Jinqiang He, Xiaoping Liu
Venue: International Journal of Geographical Information Science (2009)

This paper presents a new method to solve site selection problems using ant colony optimization (ACO) techniques. Optimal spatial search for siting public facilities is a common task for urban planning. The objective is to find N optimal sites (targets) for sitting a facility so that the total benefits are maximized or the total costs are minimized. It is straightforward to use the brute-force method for identifying the optimal solution by enumerating all possible combinations. However, the brute-force method has difficulty in solving complex spatial search problems because of a huge solution space. Ant colony optimization can provide a useful tool for site selection. In this study, the integration of ACO with geographic information systems is proposed to include various types of spatial variables in the optimization. A number of modifications have also been introduced so that ACO can fit spatial allocation problems. The novelty of this research includes the adoption of the strategies of neighborhood pheromone diffusion, tabu table adjusting, and multi-scale optimization. This method has been applied to the allocation of a hypothetical facility in Guangzhou City, China. The experiment indicates that the proposed model has better performance than the single search and the genetic algorithm for solving common site search problems.
Developing Grid-based E-finance Portals for Intelligent Risk Management and Decision Making
Authors: Jia Hu, Ning Zhong, Yong Shi
Venue: Proceeding of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006 (2006)

E-finance is rapidly transforming and evolving toward more dynamic, flexible and automated solutions. This paper describes a conceptual model with dynamic multi-level workflows corresponding to a multi-layer Grid architecture, for multi-aspect analysis in building an e-finance portal on the Wisdom Web. The application and research demonstrate that mining-grid centric three-layer Grid architecture is effective for developing intelligent risk management and decision making financial systems.
Using hand-drawn sketches for modeling and rendering in computer-based design and art
Authors: Baoquan Chen
Venue:  (2008)

Various I/O devices have gained popularity in computing technology in the past decades. However, the counter-intuitiveness of these input technologies is obvious in many engineering, gaming and design applications (drawing with a mouse in a CAD application, driving a car in a computer game with a joystick, etc.). With the advent of commodity sketching devices like tablet PC's, digital sketching has become very intuitive and natural for human users and also affordable for the general user. My research is based on sketch-based computer graphics&mdash;using sketches to create and enhance 2D/3D geometric models for a variety of applications in modeling, design and art. This dissertation addresses four research problems, with sketches as the common theme. In sketch-based modeling, I have worked on converting freely drawn 2D sketches of objects into 3D models automatically, or with the minimal use of sketched gestures. An extension of this work constructs navigable 3D models from a single 2D image by treating manual traces of objects in the image as perspective sketches. The third problem that this dissertation discusses is sketch-based inverse lighting, which infers lighting parameters from desired effects roughly sketched by a user on a 3D model. The dissertation culminates in rendering 2D/3D wire-frame sketches that identifies the intricate interplay between sketch-based and non-photorealistic rendering. The goal of this research is to render line drawings efficiently to reduce screen clutter under dynamic conditions while preserving tone and shape. In addition to sketch-based applications, this research also contributes to the area of efficient non-photorealistic rendering under dynamic conditions. This dissertation identifies the challenges in each problem, then discusses the contributions of my work in detail and identifies the possibilities in each problem beyond the scope of this dissertation.
What is a Biological Function?
Authors: Patricia Diaz-Herrera
Venue: Proceeding of the 2006 conference on Formal Ontology in Information Systems: Proceedings of the Fourth International Conference (FOIS 2006) (2006)

This paper examines the concepts biological function (BF) and functioning as they are used in recent work on formal ontology and its applications in the biomedical domain. My purpose is not to offer an entirely new definition of BF. My objectives are: (1) to find out the basic features of BF mentioned in the reviewed articles; (2) to make more explicit the description of BF already present in those articles by relating it to an ontological category system; and (3) to emphasize the distinction between three cases of predication involving BFs, a distinction that should be taken into account when designing an information system. Hopefully, the results will make a contribution to the goal of providing a general, objective description of biological functions.
Transfer Learning and Intelligence: an Argument and Approach
Authors: Matthew E. Taylor, Gregory Kuhlmann, Peter Stone
Venue: Proceeding of the 2008 conference on Artificial General Intelligence 2008: Proceedings of the First AGI Conference (2008)

In order to claim fully general intelligence in an autonomous agent, the ability to learn is one of the most central capabilities. Classical machine learning techniques have had many significant empirical successes, but large real-world problems that are of interest to generally intelligent agents require learning much faster (with much less training experience) than is currently possible. This paper presents transfer learning, where knowledge from a learned task can be used to significantly speed up learning in a novel task, as the key to achieving the learning capabilities necessary for general intelligence. In addition to motivating the need for transfer learning in an intelligent agent, we introduce a novel method for selecting types of tasks to be used for transfer and empirically demonstrate that such a selection can lead to significant increases in training speed in a two-player game.
Agreement theorems in dynamic-epistemic logic
Authors: Cédric Dégremont, Olivier Roy
Venue: Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (2009)

In this paper we study Aumann's Agreement Theorem in dynamic-epistemic logic. We show that common belief of posteriors is sufficient for agreements in "epistemic-plausibility models", under common and well-founded priors, from which the usual form of agreement results follows, using common knowledge. We do not restrict ourselves to the finite case, and show that in countable structures such results hold if and only if the underlying "plausibility ordering" is well-founded. We look at these results from a syntactic point of view, showing that neither well-foundedness nor common priors are expressible in a commonly used language, but that the static agreement result is finitely derivable in an extended modal logic. We finally consider "dynamic" agreement results, show they have a counterpart in epistemic-plausibility models, and provide a new form of agreements via "public announcements". Comparison of the two types of dynamic agreement reveals that they can indeed be different.
A framework for attaching personal assistants to existing applications
Authors: Marcelo G. Armentano, Analía A. Amandi
Venue: Computer Languages, Systems and Structures (2009)

Personal assistants are computer programs that enhance the functionality provided by a software application by implementing a mixed initiative interaction with the user in which both, the assistant and the user, can execute tasks and initiate the interaction with each other. This kind of software is also known as Interface Agents in the Artificial Intelligence community. A key problem in systems implemented so far is that the interface agent and the application are seen as a unit of software and the code of the agent is embedded in the code of the application resulting in highly coupled and hard to maintain systems. In this paper we present a solution to this problem. We propose a framework that will allow attaching an interface agent to a conventional application without modifying the application in any way. This will allow us to enhance an existent application with an interface agent to assist the user for which we do not have the source code available.
Combining binary constraint networks in qualitative reasoning
Authors: Jason Jingshi Li, Tomasz Kowalski, Jochen Renz, Sanjiang Li
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

Constraint networks in qualitative spatial and temporal reasoning are always complete graphs. When one adds an extra element to a given network, previously unknown constraints are derived by intersections and compositions of other constraints, and this may introduce inconsistency to the overall network. Likewise, when combining two consistent networks that share a common part, the combined network may become inconsistent. In this paper, we analyse the problem of combining these binary constraint networks and develop certain conditions to ensure combining two networks will never introduce an inconsistency for a given spatial or temporal calculus. This enables us to maintain a consistent world-view while acquiring new information in relation with some part of it. In addition, our results enable us to prove other important properties of qualitative spatial and temporal calculi in areas such as representability and complexity.
Towards toric absolute factorization
Authors: M. Elkadi, A. Galligo, M. Weimann
Venue: Journal of Symbolic Computation (2009)

This article presents an algorithmic approach to study and compute the absolute factorization of a bivariate polynomial, taking into account the geometry of its monomials. It is based on algebraic criterions inherited from algebraic interpolation and toric geometry.
An Edge-Preserving Multilevel Method for Deblurring, Denoising, and Segmentation
Authors: Serena Morigi, Lothar Reichel, Fiorella Sgallari
Venue: Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision (2009)

We present a fast edge-preserving cascadic multilevel image restoration method for reducing blur and noise in contaminated images. The method also can be applied to segmentation. Our multilevel method blends linear algebra and partial differential equation techniques. Regularization is achieved by truncated iteration on each level. Prolongation is carried out by nonlinear edge-preserving and noise-reducing operators. A thresholding updating technique is shown to reduce "ringing" artifacts. Our algorithm combines deblurring, denoising, and segmentation within a single framework.
Cultural cognition in usability evaluation
Authors: Torkil Clemmensen, Morten Hertzum, Kasper Hornbæk, Qingxin Shi, Pradeep Yammiyavar
Venue: Interacting with Computers (2009)

We discuss the impact of cultural differences on usability evaluations that are based on the thinking-aloud method (TA). The term 'cultural differences' helps distinguish differences in the perception and thinking of Westerners (people from Western Europe and US citizens with European origins) and Easterners (people from China and the countries heavily influenced by its culture). We illustrate the impact of cultural cognition on four central elements of TA: (1) instructions and tasks, (2) the user's verbalizations, (3) the evaluator's reading of the user, and (4) the overall relationship between user and evaluator. In conclusion, we point to the importance of matching the task presentation to users' cultural background, the different effects of thinking aloud on task performance between Easterners and Westerners, the differences in nonverbal behaviour that affect usability problem detection, and, finally, the complexity of the overall relationship between a user and an evaluator with different cultural backgrounds.
Resource control graphs
Authors: Jean-Yves Moyen
Venue: ACM Transactions on Computational Logic (TOCL) (2009)

Resource Control Graphs are an abstract representation of programs. Each state of the program is abstracted by its size, and each instruction is abstracted by the effects it has on the state size whenever it is executed. The abstractions of instruction effects are then used as weights on the arcs of a program's Control Flow Graph. Termination is proved by finding decreases in a well-founded order on state-size, in line with other termination analyses, resulting in proofs similar in spirit to those produced by Size Change Termination analysis. However, the size of states may also be used to measure the amount of space consumed by the program at each point of execution. This leads to an alternative characterisation of the Non Size Increasing programs, that is, of programs that can compute without allocating new memory. This new tool is able to encompass several existing analyses and similarities with other studies, suggesting that even more analyses might be expressable in this framework, thus giving hopes for a generic tool for studying programs.
Building emotion lexicon from weblog corpora
Authors: Changhua Yang, Kevin Hsin-Yih Lin, Hsin-Hsi Chen
Venue: Proceedings of the 45th Annual Meeting of the ACL on Interactive Poster and Demonstration Sessions (2007)

An emotion lexicon is an indispensable resource for emotion analysis. This paper aims to mine the relationships between words and emotions using weblog corpora. A collocation model is proposed to learn emotion lexicons from weblog articles. Emotion classification at sentence level is experimented by using the mined lexicons to demonstrate their usefulness.