ppxscal/embedding_network huggingface dataset:
Heuristics for Dynamically Adapting Propagation
Authors: Kostas Stergiou
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

Building adaptive constraint solvers is a major challenge in constraint programming. An important line of research towards this goal is concerned with ways to dynamically adapt the level of local consistency applied during search. A related problem that is receiving a lot of attention is the design of adaptive branching heuristics. The recently proposed adaptive variable ordering heuristics of Boussemart et al. use information derived from domain wipeouts to identify highly active constraints and focus search on hard parts of the problem resulting in important saves in search effort. In this paper we show how information about domain wipeouts and value deletions gathered during search can be exploited, not only to perform variable selection, but also to dynamically adapt the level of constraint propagation achieved on the constraints of the problem. First we demonstrate that when an adaptive heuristic is used, value deletions and domain wipeouts caused by individual constraints largely occur in clusters of consecutive or nearby constraint revisions. Based on this observation, we develop a number of simple heuristics that allow us to dynamically switch between enforcing a weak, and cheap local consistency, and a strong but more expensive one, depending on the activity of individual constraints. As a case study we experiment with binary problems using AC as the weak consistency and maxRPC as the strong one. Results from various domains demonstrate the usefulness of the proposed heuristics.
Flexible behaviour regulation in agent based systems
Authors: Michael Luck
Venue: Proceedings of the 6th international conference on Autonomic computing (2009)

Cooperation is the fundamental underpinning of multi-agent systems, allowing agents to interact to achieve their goals. However, agents must manage the risk associated with interacting with others who have different objectives, or who may fail to fulfill their commitments. There are many ways in which such a desirable social order may be encouraged or even mandated. For example, trust oers a mechanism for modeling and reasoning about reliability, honesty, etc., while organisations and norms provide a framework within which to apply them, and motivations provide a means for representing and reasoning about overall objectives. In this talk, I will consider the role of trust, organisations and norms in a motivation-based view of agency that seeks to regulate behaviour, and will illustrate some of these issues with aspects of several projects, including the CONTRACT project, concerned with contract-based electronic business systems. Finally, I will also seek to identify some key themes entwining these notions of behaviour regulation with autonomic computing.
From abstract qualities to concrete specification using guidance policies
Authors: Scott J. Harmon, Scott A. DeLoach, Robby
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

This research describes a formal method for transforming abstract qualities into concrete specification in the form of policies within a multiagent system design methodology.
Checking Z Data Refinements Using Traces Refinement
Authors: André Didier, Adalberto Farias, Alexandre Mota
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Data refinement is useful in software development because it allows one to build more concrete specifications from abstract ones, as long as there is a mathematical relation between them. It has associated rules (proof obligations) that must be discharged; this is normally performed by interactive theorem proving systems. This work proposes an approach based on refinement checking to automatically check the Z data refinement rules. Our approach captures the relational semantics of these rules by using the functional support of CSP"M (the machine-readable version of process algebra CSP) and uses the traceability feature of CSP to find the rules that cannot be satisfied. Moreover, it is able to automatically calculate the mathematical relation between an abstract and a concrete specification, if one exists. We present our approach using an example.
Articulating complex information needs using query templates
Authors: Olga Vechtomova, Hao Zhang
Venue: Journal of Information Science (2009)

In this paper we investigate the effectiveness of topic-independent query templates as a tool for assisting users in articulating their information needs. We hypothesize that topic-independent query templates can help users with complex information needs to express their requirements more accurately and in greater detail. We developed a set of query templates representing general semantic relationships between concepts, such as causeâeffect and problemâsolution. Each template was written in the form of a fill-in-the-blanks question. A user study was performed comparing the template-based interface with a single-textbox search interface. Results demonstrate that, while users found the template-based query formulation less easy to use, the queries written using templates performed better than the queries written using the control interface with one query textbox.
An ajax-based digital music stand for greenstone
Authors: David Bainbridge, Tim C. Bell
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

This extended abstract describes a digital music stand integrated with the Greenstone digital library software. It features text annotation and an animated fast-to-slow page wipe. Figure 1 illustrates both these features, although it is best appreciated in a live demonstration. Digital annotation provides a non-destructive alternative to a musician's habit of penciling in notes. In Figure 1, slightly over half way down the page, there is a note to watch the fingering. A user can have as many of these as they like, positioned anywhere on the page. The animated page wipe alleviates (somewhat) the issue of when to turn to the next page. Unlike its physical counterpart, where turning to the next page means you can no longer see the current page, with a digital music stand the next page can gradually be overlaid. The page transition occurring in Figure 1 can be seen as a marked horizontal bar not quite half-way down the page. The speed of the wipe is initially fast, but when it reaches the point where the scroll-bar marker is on the right-hand side of the page, it slows down significantly. This is to give the musician time to finishing playing the last line of the current page. In the event they have already finished playing that line, they will have naturally moved on to playing the top of the next page (which is already displayed). Rather than adopt a traditional client-side "helper" application for the digital music stand, we have integrated it within Greenstone using AJAX. For instance: next and previous pages are asynchronously loaded in the background; when generating a page, the dimensions of the user's screen is sent to the DL server so it can produce a version that maximizes the available space; and interactions such as adding an annotation, or altering the position of the animation-break are immediately stored as metadata associated with that document. Initially the animated page breaks are set to be between the last two staff systems. This is accomplished as part of the DL ingest process, leveraging off the staff detection step of Optical Music Recognition software.
Reasoning with Prioritized Data by Aggregation of Distance Functions
Authors: Ofer Arieli
Venue: Proceeding of the 2008 conference on Artificial General Intelligence 2008: Proceedings of the First AGI Conference (2008)

We introduce a general framework for reasoning with prioritized data by aggregation of distance functions, study some basic properties of the entailment relations that are obtained, and relate them to other approaches for maintaining uncertain information.
Towards an actor-based concurrent machine model
Authors: Hans Schippers, Tom Van Cutsem, Stefan Marr, Michael Haupt, Robert Hirschfeld
Venue: Proceedings of the 4th workshop on the Implementation, Compilation, Optimization of Object-Oriented Languages and Programming Systems (2009)

In this position paper we propose to extend an existing delegation-based machine model with concurrency primitives. The original machine model which is built on the concepts of objects, messages, and delegation, provides support for languages enabling multi-dimensional separation of concerns (MDSOC). We propose to extend this model with an actor-based concurrency model, allowing for both true parallelism as well as lightweight concurrency primitives such as coroutines. In order to demonstrate its expressiveness, we informally describe how three high-level languages supporting different concurrency models can be mapped onto our extended machine model. We also provide an outlook on the extended model's potential to support concurrency-related MDSOC features.
On Decomposing an Unseen 3D Face into Neutral Face and Expression Deformations
Authors: Faisal R. Al-Osaimi, Mohammed Bennamoun, Ajmal Mian
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

This paper presents a technique for decomposing an unseen 3D face under any facial expression into an estimated 3D neutral face and expression deformations (the shape residue between the non-neutral and the estimated neutral 3D face). We show that this decomposition gives a robust facial expression classification and improves the accuracy of an off-the-shelf 3D face recognition system. The proposed decomposition system is a multistage data-driven process in which training expression residues and neutral faces reciprocally guide the decomposition of the 3D face. A plausible decomposition was achieved. The shapes and the normals of the expression residue are used for expression classification while the neutral face estimates are used for expression robust face recognition. Experiments were performed on a large number of non-neutral scans and significant expression classification rates were achieved. Moreover, 6% increase in face recognition rate was achieved for probes with severe facial expressions.
Reinforcement Learning with the Use of Costly Features
Authors: Robby Goetschalckx, Scott Sanner, Kurt Driessens
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

A common solution approach to reinforcement learning problems with large state spaces (where value functions cannot be represented exactly) is to compute an approximation of the value function in terms of state features. However, little attention has been paid to the cost of computing these state features (e.g., search-based features). To this end, we introduce a cost-sensitive sparse linear-value function approximation algorithm ---FOVEA ---and demonstrate its performance on an experimental domain with a range of feature costs.
The variety of ways in which instructors implement a modular digital library curriculum
Authors: Barbara M. Wildemuth, Jeffrey P. Pomerantz, Sanghee Oh, Seungwon Yang, Edward A. Fox
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

With support from the National Science Foundation, researchers at Virginia Tech and the University of North Carolina developed a curriculum framework and a number of modules for instruction in the area of digital libraries. In 2008, 15 different modules were field tested by 11 instructors at 10 different institutions. As might be expected, instructors adapted these modules to fit the context of their courses, some of which are described here.
Ginger: implementing a new Lisp family syntax
Authors: James Dean Palmer
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

In this paper we introduce G-expressions, a new syntax based on the S-expression syntax utilized by most Lisp family languages. We have implemented a new homoiconic language, Ginger, based on this syntax and a Smalltalk inspired object system. Like the Scheme language, Ginger employs only a few special forms and observes a minimalist discipline allowing users to define functions that act like the primitive forms in many Algol-like languages. But unlike Scheme, G-expressions allow Ginger to emulate the aesthetic feel of an Algol-like language syntax. While fundamentally a dialect of Lisp, Ginger implements an attractive modern syntax which can superficially resemble Python or Ruby. This syntactic flexibility exemplifies Ginger's true power as a tool for developing task or domain-specific micro-languages.
Technology Lessons For The Classroom: Integrated Multimedia Volume 2
Authors: Charlotte Haley, Rene Fuller, David Hoerger
Venue:  (2007)

These creative and innovative lessons are designed to support the core curriculum for grades 8- 12. The lessons are appropriate for use in core classes as well as a variety of technology classes. Additional teaching resources include examples, presentations to introduce specific topics, photos for editing, and Web sites. Appropriate for a variety of classes, this collection of teaching resources is classroom tested and created by teachers for teachers. Includes 50 multimedia, project-based lesson plans with correlation to the new ISTE Standards for Students and NBEA Standards Lesson plans are applicable to many multimedia classes and core subjects Teacher instructions have level of difficulty, deliverables, photos for editing, and reflections
The HuGS platform: a toolkit for interactive optimization
Authors: Gunnar W. Klau, Neal Lesh, Joe Marks, Michael Mitzenmacher, Guy T. Schafer
Venue: Proceedings of the working conference on Advanced visual interfaces (2002)

In this paper we develop a generalized approach to visualizing and controlling an optimization process. Our framework, called Human-Guided Search, actively involves people in the process of optimization. We provide simple and general visual metaphors that allow users to focus and constrain the exploration of the search space. We demonstrate that these metaphors apply to a wide variety of problems and optimization algorithms. Our software toolkit supports rapid development of human-guided search systems. Our approach addresses many often-neglected aspects of optimization that are critical to providing people with practical solutions to their optimization problems. Users need to understand and trust the generated solutions in order to effectively implement, justify, and modify them. Furthermore, it is often impossible for users to specify, in advance, all appropriate constraints and selection criteria for their problem. Thus, automatic methods can only find solutions that are optimal with regard to an invariably over-simplified problem description. In contrast, human-in-the-loop optimization allows people to find and better understand solutions that reflect their knowledge of real-world constraints. Finally, interactive optimization leverages people's abilities in areas in which humans currently outperform computers, such as visual perception, learning from experience, and strategic assessment. Given a good visualization of the problem, people can employ these skills to direct a computer search into the more promising regions of the search space. The software we describe is written in Java and is available under a free research license for research or educational purposes.
Analysis on fuzzy risk of landfall typhoon in Zhejiang province of China
Authors: Li-Hua Feng, Gao-Yuan Luo
Venue: Mathematics and Computers in Simulation (2009)

The simplest way to perform a fuzzy risk assessment is to calculate the fuzzy expected value and convert fuzzy risk into non-fuzzy risk, i.e. a crisp value. In doing so, there is a transition from a fuzzy set to crisp set. Therefore, the first step is to define an @a level value, and then select the elements x with a subordinate degree A(x)>=@a. The higher the value of @a, the lower the degree of uncertainty-the probability is closer to its true value. The lower the value of @a, the higher the degree of uncertainty-this results in a lower probability serviceability. The possibility level @a is dependent on technical conditions and knowledge. A fuzzy expected value of the possibility-probability distribution is a set with E_"@a(x) and E@?"@a(x) as its boundaries. The fuzzy expected values E_"@a(x) and E@?"@a(x) of a possibility-probability distribution represent the fuzzy risk values being calculated. Therefore, we can obtain a conservative risk value, a venture risk value and a maximum probability risk value. Under such an @a level, three risk values can be calculated. As @a adopts all values throughout the set [0,1], it is possible to obtain a series of risk values. Therefore, the fuzzy risk may be a multi-valued risk or set-valued risk. Calculation of the fuzzy expected value of landfall typhoon risk in Zhejiang province has been performed based on the interior-outer set model. Selection of an @a value depends on the confidence in different groups of people, while selection of a conservative risk value or venture risk value depends on the risk preference of these people.
Basic Marketing Research Using Microsoft Excel Data Analysis, 2nd edition
Authors: Alvin C. Burns, Ronald F. Bush
Venue:  (2007)

This book is targeted for those who need to learn the marketing research process and basic data analysis techniques. This is the first book on the market that offers a software add-in (XL Data Analyst) designed specifically to use the power of Excel for marketing research applications. XL Data Analyst also features data analysis output that is exceptionally easy to understand and in professional table/report-ready format. All marketing research concepts are presented simply and intuitively. KEY TOPICS: 11 Step marketing research process; the industry; ethical issues, global applications. Basic descriptive statistics, confidence intervals and hypothesis testing, differences tests through one-way ANOVA, cross-tabulation/Chi-square, Pearson Correlation, and simple and multiple regression are all comprehensively covered. This is the ideal book for those who wish to teach basic marketing research to undergraduate students without learning cumbersome statistical analysis software but who have access to Excel. The XL Data Analysis Add-in is easy to master and use and performs analyses such as tests of proportions and hypothesis tests for percentages, not typically available on standard statistical analysis software.
Preface
Authors: Conor Mcbride, Tarmo Uustalu
Venue: Journal of Functional Programming (2009)

This special issue of the Journal of Functional Programming collects revised selected articles arising from the inaugural meeting of the Workshop on Mathematically Structured Functional Programming, MSFP 2006, held in Kuressaare, Estonia, on 2 July 2006, with support from the European Union's FP6 IST Coordination Action TYPES. This workshop raised the curtain for the Eighth International Conference on Mathematics of Program Construction, MPC 2006, but where MPC is concerned primarily with extrinsic mathematics supporting the programming process, MSFP has a complementary focus on the mathematics intrinsic to programs themselves. MSFP is about the extraction of functionality from structure.
Testing different color spaces based on hue for the environmentally adaptive segmentation algorithm (EASA)
Authors: G. Ruiz-Ruiz, J. Gómez-Gil, L. M. Navas-Gracia
Venue: Computers and Electronics in Agriculture (2009)

Research work was made about crop segmentation in order to achieve real-time processing in real farm fields. The environmentally adaptive segmentation algorithm (EASA) for crop recognition was in-depth analyzed to take advantage of its key points and to look for potential improvements. The EASA was modified to test different color spaces than rgb. Hue-saturation (HS) and hue (H) were proposed as new color spaces with the objective of improving the algorithm performance by reducing the computer calculation time. In these modified algorithms, the clustering process and Bayesian classifier only require two and one variables, respectively, instead of the three variables necessary in the rgb algorithm. The segmentation effectiveness was also analyzed to evaluate the compromise between increased errors and decreased computation time. An image bank was used to develop and evaluate the algorithms, which contained sunflower crop images taken at real farm fields. As expected, the results of the segmentation process for HS and H color spaces differed slightly from the results obtained by the EASA on rgb. Specifically, the average rates of false negatives for the EASA on HS and H were 24% and 20%, respectively, while the rates of false positives were 22% and 26%, respectively, slightly worse than the EASA on rgb. This was due to the fact that the HS and H color spaces did not include an intensity component, as in rgb space, which was normalized from RGB (red, green and blue) space. In this way, variations in illumination, typical in real farm fields, did not significantly affect the segmentation results. The time spent in the global segmentation process was 25 and 46 times lower for HS and H, respectively, compared to the original EASA. Therefore, compared to the EASA on rgb, the EASA on HS and H color spaces showed a significant reduction in processing time without a significant loss in effectiveness.
DDE: from dewey to a fully dynamic XML labeling scheme
Authors: Liang Xu, Tok Wang Ling, Huayu Wu, Zhifeng Bao
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

Labeling schemes lie at the core of query processing for many XML database management systems. Designing labeling schemes for dynamic XML documents is an important problem that has received a lot of research attention. Existing dynamic labeling schemes, however, often sacrifice query performance and introduce additional labeling cost to facilitate arbitrary updates even when the documents actually seldom get updated. Since the line between static and dynamic XML documents is often blurred in practice, we believe it is important to design a labeling scheme that is compact and efficient regardless of whether the documents are frequently updated or not. In this paper, we propose a novel labeling scheme called DDE (for Dynamic DEwey) which is tailored for both static and dynamic XML documents. For static documents, the labels of DDE are the same as those of dewey which yield compact size and high query performance. When updates take place, DDE can completely avoid re-labeling and its label quality is most resilient to the number and order of insertions compared to the existing approaches. In addition, we introduce Compact DDE (CDDE) which is designed to optimize the performance of DDE for insertions. Both DDE and CDDE can be incorporated into existing systems and applications that are based on dewey labeling scheme with minimum efforts. Experiment results demonstrate the benefits of our proposed labeling schemes over the previous approaches.
A Modular Framework for Ontology-based Representation of Patent Information
Authors: Mark Giereth, Steffen Koch, Yiannis Kompatsiaris, Symeon Papadopoulos, Emanuele Pianta, Luciano Serafini, Leo Wanner
Venue: Proceeding of the 2007 conference on Legal Knowledge and Information Systems: JURIX 2007: The Twentieth Annual Conference (2007)

In this paper, we present a new ontology-based formalism for representing patent information. The framework defines concepts and relations for the major aspects of patent information pertaining to patent metadata, patent content structure, patent semantics, and patent classification. Each aspect is logically covered by an individual ontology module. The paper further discusses aspects of ontology learning and integration of non-textual information for the patent domain.