ppxscal/embedding_network huggingface dataset:
Fast Discovery of Minimal Sets of Attributes Functionally Determining a Decision Attribute
Authors: Marzena Kryszkiewicz, Piotr Lasek
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

In our paper, we offer an efficient Fun algorithm for discovering minimal sets of conditional attributes functionally determining a given dependent attribute, and in particular, for discovering Rough Sets certain, generalized decision, and membership distribution reducts. Fun can operate either on partitions or alternatively on stripped partitions that do not store singleton groups. It is capable of using functional dependencies occurring among conditional attributes for pruning candidate dependencies. The experimental results show that all variants of Fun have similar performance. They also prove that Fun is much faster than the Rosetta toolkit's algorithms computing all reducts and faster than TANE, which is one of the most efficient algorithms computing all minimal functional dependencies.
A Procedure for Generating Contour Lines From a B-Spline Surface
Authors: Steven Satterfield, David Rogers
Venue: IEEE Computer Graphics and Applications (1985)

A two-step contouring algorithm¿almost twice as fast as traditional algorithms for equal-accuracy contour lines¿is useful for CAD/CAM applications.
Modeling Relations between Inputs and Dynamic Behavior for General Programs
Authors: Xipeng Shen, Feng Mao
Venue: Languages and Compilers for Parallel Computing: 20th International Workshop, LCPC 2007, Urbana, IL, USA, October 11-13, 2007, Revised Selected Papers (2007)

Program dynamic optimization, for being adaptive to runtime behavior changes, has become increasingly important for both performance and energy savings. However, most runtime optimizations often suffer from the lack of a global picture of a program's execution, and cannot afford sophisticated program analysis. On the other hand, offline profiling techniques overcome both obstacles but are oblivious to the effects of program inputs.An approach in the between is to offline find the connections between program inputs and runtime behavior, and then apply the knowledge to runtime optimizations. Although it potentially gets the best of both worlds, it faces a fundamental challenge: How to discover and model the relations between inputs and runtime behavior for general programs.This work tackles the problem from three aspects. It proposes an extensible input characterization language to resolve the complexity of program inputs. A translator to the langauage helps automatically convert a raw input into an attribute vector, which is then refined by a feature selector to remove redundancies and noises. Finally, statistical learning builds input-behavior models. Experiments on IBM XL compilers show accurate prediction of detailed execution profiles, helping profile-directed compilation outperform both static and offline profiling-based compilations, demonstrating the potential of the technique for continuous program optimizations.
A Computational Structure for Generalized Visual Space-Time Chromatic Processing
Authors: D. Freire-Obregón, R. Moreno-Díaz,  Jr., R. Moreno-Díaz, G. Blasio, A. Moreno-Díaz
Venue: Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks (2007)

Traditional interpretation of early visual image processing in a retinal level has focused exclusively on spatial aspects of receptive fields (RFs). We have learned recently that RFs are spatiotemporal entities and this characterization is crucial in understanding and modelling circuits in early visual processing ([1]). We present a generalization of the layered computation concept to describe visual information processing in the joint space-time domain.
Generalized Least Squares-Based Parametric Motion Estimation Under Non-uniform Illumination Changes
Authors: Raúl Montoliu, Filiberto Pla
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

The estimation of parametric global motion has had a significant attention during the last two decades, but despite the great efforts invested, there are still open issues. One of the most important ones is related to the ability to recover large deformation between images in the presence of illumination changes while kipping accurate estimates. In this paper, a Generalized least squared-based motion estimator is used in combination with a dynamic image model where the illumination factors are functions of the localization (x,y) instead of constants, allowing for a more general and accurate image model. Experiments using challenging images have been performed showing that the combination of both techniques is feasible and provides accurate estimates of the motion parameters even in the presence of strong illumination changes between the images.
SemEval-2007 Task 01: Evaluating WSD on Cross-Language Information Retrieval
Authors: Eneko Agirre, Oier Lopez De Lacalle, Bernardo Magnini, Arantxa Otegi, German Rigau, Piek Vossen
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

This paper presents a first attempt of an application-driven evaluation exercise of WSD. We used a CLIR testbed from the Cross Lingual Evaluation Forum. The expansion, indexing and retrieval strategies where fixed by the organizers. The participants had to return both the topics and documents tagged with WordNet 1.6 word senses. The organization provided training data in the form of a pre-processed Semcor which could be readily used by participants. The task had two participants, and the organizer also provided an in-house WSD system for comparison. The results do not improve over the baseline, which is not surprising given the simplistic CLIR strategy used. Other than that the exercise was succesful, and provides the foundation for more ambitious follow-up exercises where the participants would be able to build up on the WSD results already available.
Mobile Discovery of Requirements for Context-Aware Systems
Authors: Norbert Seyff, Florian Graf, Paul Grünbacher, Neil Maiden
Venue: Proceedings of the 14th international conference on Requirements Engineering: Foundation for Software Quality (2008)

Understanding the work context of future system users is essential in requirements engineering. It is particularly crucial when developing ubiquitous systems that react on context changes. This paper discusses the need for in-situ requirements elicitation approaches to build mobile and context-aware systems. We identify three different levels of support: The first level covers contextual techniques without tool support. Second level support is based on existing RE approaches and mobile tools. Third level support utilizes context-aware tools receiving context-specific information to guide analysts in the field. These tools enhance requirements gathering for ubiquitous systems. We present a context-aware tool prototype for on-site scenario walkthroughs and discuss how the underlying scenario-based approach needs to be adapted. Our tool-based approach was tested in an initial evaluation study. Finally, the paper presents requirements for RE approaches supporting ubiquitous system development based on lessons learned from using level II and III tools.
Pedestrian Counting Using an IR Line Laser
Authors: Gwang-Gook Lee, Hyeong-ki Kim, Ja-Young Yoon, Jae-Jun Kim, Whoi-Yul Kim
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

This paper presents a method of pedestrian counting using an IR line laser. In the proposed method, only reflection of IR line laser onto pedestrians is obtained using an IR filter. Hence acquisition of moving object images is extremely simple and reliable compared to other vision-based method. The number of pedestrians is counted using simple blob analysis and their moving directions are obtained from slopes of the blobs. Experiments showed that the proposed method is able to count the number of pedestrians effectively (with accuracy of about 95%) and efficiently (9ms for one frame on a standard PC).
Monochromatic and Heterochromatic Subgraphs in Edge-Colored Graphs - A Survey
Authors: Mikio Kano, Xueliang Li
Venue: Graphs and Combinatorics (2008)

Nowadays the term monochromatic and heterochromatic (or rainbow, multicolored) subgraphs of an edge-colored graph appeared frequently in literature, and many results on this topic have been obtained. In this paper, we survey results on this subject. We classify the results into the following categories: vertex-partitions by monochromatic subgraphs, such as cycles, paths, trees; vertex partition by some kinds of heterochromatic subgraphs; the computational complexity of these partition problems; some kinds of large monochromatic and heterochromatic subgraphs. We have to point out that there are a lot of results on Ramsey type problem of monochromatic and heterochromatic subgraphs. However, it is not our purpose to include them in this survey because this is slightly different from our topics and also contains too large amount of results to deal with together. There are also some interesting results on vertex-colored graphs, but we do not include them, either.
A Time and Storage Efficient Solution to Remote File Integrity Check
Authors: Sarad AV, Sankar K, Vipin M
Venue: Proceedings of the 2008 The Fourth International Conference on Information Assurance and Security (2008)

Checking the integrity of a file on a remote untrusted or compromised server is to be achieved with minimal computational and storage requirements on part of a healthy verifier. Existing solutions are time and storage intensive. A fast protocol comprising of maximum period linear congruence generators and linear feedback shift registers with compact storage requirements is proposed.
Evolution of Solitary and Group Transport Behaviors for Autonomous Robots Capable of Self-Assembling
Authors: Roderich Groβ, Marco Dorigo
Venue: Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems (2008)

Group transport is performed in many natural systems and has become a canonical task for studying cooperation in robotics. We simulate a system of simple, insect-like robots that can move autonomously and grasp objects as well as each other. We use artificial evolution to produce solitary transport and group transport behaviors. We show that robots, even though not aware of each other, can be effective in group transport. Group transport can even be performed by robots that behave as in solitary transport. Still, robots engaged in group transport can benefit from behaving differently from robots engaged in solitary transport. The best group transport behaviors yielded by half of the evolutions let robots organize into self-assembled structures. This provides evidence that self-assembly can provide adaptive value to individuals that compete in an artificial evolution based on task performance. We conclude the article by discussing potential implications for evolutionary biology and robotics.
On the relationship of model transformations based on triple and plain graph grammars
Authors: Hartmut Ehrig, Claudia Ermel, Frank Hermann
Venue: Proceedings of the third international workshop on Graph and model transformations (2008)

Triple graph grammars have been applied and implemented as a formal basis for model transformations in a variety of application areas. They convince by special abilities in automatic derivation of forward, backward and several other transformations out of just one specified set of rules for the integrated model defined by a triple of graphs. While many case studies and all implementations, which state that they are using triple graph grammars, do not use triples of graphs, this paper presents the justification for many of them. It shows a one to one correspondence between triple graph grammars and suitable plain graph grammars, thus results and benefits of the triple case can be transferred to the plain case. Main results show the relationship between both graph transformation approaches, syntactical correctness of model transformations based on triple graph grammars and a sound and complete condition for functional behaviour. Theoretical results are elaborated on an intuitive case study for a model transformation from class diagrams to database models.
Situation Assessment for Plan Retrieval in Real-Time Strategy Games
Authors: Kinshuk Mishra, Santiago Ontañón, Ashwin Ram
Venue: Proceedings of the 9th European conference on Advances in Case-Based Reasoning (2008)

Case-Based Planning (CBP) is an effective technique for solving planning problems that has the potential to reduce the computational complexity of the generative planning approaches [8,3]. However, the success of plan execution using CBP depends highly on the selection of a correct plan; especially when the case-base of plans is extensive. In this paper we introduce the concept of a situation and explain a situation assessment algorithm which improves plan retrieval for CBP. We have applied situation assessment to our previous CBP system, Darmok [11], in the domain of real-time strategy games. During Darmok's execution using situation assessment, the high-level representation of the game state i.e. situation is predicted using a decision tree based Situation-Classification model. Situation predicted is further used for the selection of relevant knowledge intensive features, which are derived from the basic representation of the game state, to compute the similarity of cases with the current problem. The feature selection performed here is knowledge based and improves the performance of similarity measurements during plan retrieval. The instantiation of the situation assessment algorithm to Darmok gave us promising results for plan retrieval within the real-time constraints.
Simulation of self aeration at steep chute spillway flow using VOF technique in a 3D finite volume software
Authors: Saeed-Reza Sabbagh-Yazdi, Fatemeh Rostami, Nikos E. Mastorakis
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

This paper aims at characterizing the turbulent aerated flow over chutes spillway. The paper starts by giving briefly insight into the dynamics of the flow and discussing mathematical description of self aerated super critical flow parameters. The numerical software utilized in this work is a finite volume flow solver, which include an algorithm for air entrainment. Numerical simulation, which is performed in the present three-dimensional work, uses k-ε turbulent model and the water free surface location is treated using the Volume of Fluid technique. The computed results of flow parameter and air concentration distribution are compared with observations on the AVIMORE chute spillway.
Design and Evaluation of Multitasking-Based Software Communications Architecture for Real-Time Sensor Networking Platforms
Authors: Kyunghoon Jung, Byounghoon Kim, Changsoo Kim, Sungwoo Tak
Venue: Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing (2007)

Real-time wireless sensor networking platform should satisfy requirements of sensor networking features - efficient exploitation of limited resources and energy efficiency, real-time characteristics and scalability. Existing studies on sensor networking platforms, such as TinyOS and DCOS, have been focused on solving the maximization problem of exploitation of limited resources and the energy efficiency. Envisioned application scenarios applied in sensor networking platforms need to perform real-time sensing activity as well as provide good response time with task communication, and support the scalability to improve productivity. The proposed method is able to support task scheduling which meets deadlines of all the periodic tasks and provides aperiodic tasks with good average response time. It also supports the scalability by dividing the functionalities in sensor node into periodic and aperiodic tasks. Experimental results show that our method improves real-time characteristics of sensor networking platforms by means of guaranteeing to complete the execution of all the periodic tasks within their deadlines and having a good response time for aperiodic tasks.
An Integrated Crawling Strategy for Domain-Specific Resource Discovery
Authors: Fuyong Yuan, Chunxia Yin, Jian Liu, Yulian Zhang
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

Topic-specific crawler aims to selectively seek out pages that are relevant to a pre-defined set of topics, rather than to exploit all regions of the Web. It is important for domain-specific resource discovery. Topic-specific crawlers yield good recall as well as good precision by restricting themselves to a specific domain from web pages. In this paper, we present an integrated topic-specific crawling strategy. The main features of the crawling process consist of a topic specification module that mediates between users and search engines to identify starting URLs by computing the hub score using BHIST algorithm, and a URL ordering algorithm that combines features of several previous approaches. Experimental results indicate that the new crawling method has better performance, and it was able to fetch higher topic relevant information.
Intelligent Assembly/Disassembly System with a Haptic Device for Aircraft Parts Maintenance
Authors: Christiand, Jungwon Yoon
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

This paper presents the development of an intelligent Assembly/Disassembly (A/D) system with the utilization of a haptic device. The development was aimed to assist the A/D process of aircraft parts maintenance with an intelligent algorithm. A comprehensive methodology is presented by an intelligent algorithm generating the best sequence for the assembled/disassembled parts. For this purpose, a genetic algorithm was chosen because of its effectiveness and compatibility dealing with the A/D sequencing problem. Furthermore, A/D process of the parts will also be calculated in the genetic algorithm process, which will show the effectiveness of the algorithm. Moreover, the concept of both natural and artificial constraints are applied to generate the path planning of the assembled/disassembled parts. It is believed that the combination of haptic, optimized sequence algorithm and intelligent path planning will increase efficiency for the overall aircraft parts maintenance process.
Technical Section: Stable haptic rendering with detailed energy-compensating control
Authors: Xiong Lu, Aiguo Song
Venue: Computers and Graphics (2008)

Sampled-data system nature is the main factor for a haptic system to exhibit non-passive behaviors or instabilities through ''energy leaks'', especially for stiff objects rendering. A detailed energy-compensating method is presented aiming to improve the haptic system's performance based on the concept of ''doing work''. Using an ideal continuous-time haptic system as a reference, we calculate the ''work difference'' between interactions in the sampled-data haptic system and the counterparts in the real world. An ''energy-compensating controller'' (ECC) is then designed to compensate for, in every sampling period, the ''energy leaks'' caused by ''work difference''. The ''work difference'' exists both in entering and leaving periods of interaction contacts, which means the ECC not only removes the unwanted ''extra work'' from the virtual environment to eliminate potential non-passive system behaviors, but also compensates for the ''deficient work'' that should be done by the human operator to guarantee the intended rendering stiffness. The proposed method was tested and demonstrated on six human subjects with the implementation of a stiff-wall prototype haptic system via a Delta haptic device.
Design and verification of long-running transactions in a timed framework
Authors: Ruggero Lanotte, Andrea Maggiolo-Schettini, Paolo Milazzo, Angelo Troina
Venue: Science of Computer Programming (2008)

Long-running transactions consist of tasks which may be executed sequentially and in parallel, may contain subtasks, and may require to be completed before a deadline. These transactions are not atomic and, in case of executions which cannot be completed, a compensation mechanism must be provided. In this paper we develop a model of Communicating Hierarchical Timed Automata suitable to describe the mentioned aspects in a framework where also time is taken into account. We develop the patterns for composing long-running transactions sequentially, in parallel or by nesting. The correct compensation of a composed long-running transaction is preserved by these composition patterns. The automaton-theoretic approach allows the verification of properties by model checking. As a case study, we model and analyse an example of e-commerce application described in terms of long-running transactions.
Generalized rough sets based on reflexive and transitive relations
Authors: Keyun Qin, Jilin Yang, Zheng Pei
Venue: Information Sciences: an International Journal (2008)

In this paper, we investigate the relationship between generalized rough sets induced by reflexive and transitive relations and the topologies on the universe which is not restricted to be finite. It is proved that there exists a one-to-one correspondence between the set of all reflexive and transitive relations and the set of all topologies which satisfy a certain kind of compactness condition.
Reconciling Automation and Flexibility in Product Derivation
Authors: Gilles Perrouin, Jacques Klein, Nicolas Guelfi, Jean-Marc Jézéquel
Venue: Proceedings of the 2008 12th International Software Product Line Conference (2008)

Product derivation, i.e. reusing core assets to build products, did not receive sufficient attention from the product-line community, yielding a frustrating situation. On the one hand, automated product derivation approaches are inflexible; they do not allow products meeting unforeseen, customer-specific, requirements. On the other hand, approaches that consider this issue do not provide adequate methodological guidelines nor automated support. This paper proposes an integrated product derivation approach reconciling the two views to offer both flexibility and automation. First, we perform a pre-configuration of the product by selecting desired features in a generic feature model and automatically composing their related product-line core assets. Then, we adapt the pre-configured product to its customer-specific requirements via derivation primitives combined by product engineers and controlled by constraints that flexibly set product line boundaries. Our process is supported by the Kermeta meta modeling environment and illustrated through an example.
Interprocedural Speculative Optimization of Memory Accesses to Global Variables
Authors: Lars Gesellensetter, Sabine Glesner
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

The discrepancy between processor and memory speed, also known as memory gap, is steadily increasing. This means that execution speed is more and more dominated by memory accesses. We investigate the use of globals, which reside inherently in memory, in standard applications and present an approach to reduce the number of memory accesses, thereby reducing the effect of the memory gap. Our approach can explicitly deal with uncertain information and, hence, optimize more aggressively with the help of speculative techniques while not changing the semantics of the optimized programs. We present an implementation of the proposed optimization in our compiler framework for the Intel Itanium and show that our techniques lead to an increased performance for the SPEC CPU2006 benchmarks, thus showing that the impact of the memory gap can be effectively mitigated with advanced speculative optimization.