ppxscal/embedding_network huggingface dataset:
Software Defect Classification: A Comparative Study with Rough Hybrid Approaches
Authors: Sheela Ramanna, Rajen Bhatt, Piotr Biernot
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

This paper is an extension of our earlier work in combining strengths of rough set theory and neuro-fuzzy decision trees in classifying software defect data. The extension includes the application of a rough-fuzzy classification trees to classifying defects. We compare classification results for five methods: rough sets, neuro-fuzzy decision trees, partial decision trees, rough-neuro-fuzzy decision trees and rough-fuzzy classification trees. The analysis of the results include a paired t-test for accuracy and number of rules. The results demonstrate that there is improvement in classification accuracy with the rough fuzzy classification trees with a minimal set of rules. The contribution of this paper is a comparative study of several hybrid approaches in classifying software defect data.
Gravel: A Communication Library to Fast Path MPI
Authors: Anthony Danalis, Aaron Brown, Lori Pollock, Martin Swany, John Cavazos
Venue: Proceedings of the 15th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2008)

Remote Direct Memory Access (RDMA) technology allows data to move from the memory of one system into another system's memory without involving either one's CPU. This capability enables communication-computation overlapping, which is highly desirable for addressing the costly communication overhead in cluster computing. This paper describes the consumer-initiated and producer-initiated protocols of a companion library for MPI called Gravel. Gravel works in concert with MPI to achieve increased communication-computation overlap by separating the meta-data exchange from the application data exchange, thus allowing different communication protocols to be implemented at the application layer. We demonstrate performance improvements using Gravel for a set of communication patterns commonly found in MPI scientific applications.
Regularizable singular systems: a complete system of invariants
Authors: M. Isabel García-Planas, A. Díaz
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

Let (E, A, B, C) be a quadruple of matrices with E, A ∈ Mn(C), B ∈ Mn×m(C), C ∈ Mp×n(C) representing a singular time-invariant linear system, Ex = Ax + Bu, y = Cx. In this paper we present a collection of invariants for singular systems in terms of ranks of certain matrices, that permit us to reduce the system in a canonical form in such a way that the system is decomposed in following five independent subsystems: i) controllable and observable system, ii) controllable non observable system, iii) observable non controllable system, iv) Jordan system v) completely singular system.
QUESTO: A Query Language for Uncertain and Exact Spatio-temporal Objects
Authors: Hoda Mokhtar, Jianwen Su
Venue: Proceedings of the 12th East European conference on Advances in Databases and Information Systems (2008)

Querying moving objects is a crucial ingredient in many applications involving moving objects. Being able to query the location of an object is important to achieve services like E-911, m-commerce, fleet management, etc. However, moving objects have inherent uncertainty in their location information. Obtaining the exact location of an object at every time instant is infeasible. In this paper we aim towards designing an algebraic query language that can query and reason about trajectory properties of moving objects both with precise and uncertain trajectories.
An Optimal Dynamic Spanner for Doubling Metric Spaces
Authors: Lee-Ad Gottlieb, Liam Roditty
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

A t-spanner is a graph on a set of points S with the following property: Between any pair of points there is a path in the spanner whose total length is at most t times the actual distance between the points. In this paper, we consider points residing in a metric space equipped with doubling dimension ¿, and show how to construct a dynamic (1 + ¿)-spanner with degree ¿ ¿ O(¿) in $O(\frac{\log n}{\varepsilon^{O(\lambda)}})$ update time. When ¿ and ¿ are taken as constants, the degree and update times are optimal.
A Modified Quadtree Approach To Finite Element Mesh Generation
Authors: Mark Yerry, Mark Shephard
Venue: IEEE Computer Graphics and Applications (1983)

By allowing the use of quadrants with cut corners, this modeling technique overcomes some of the drawbacks of standard quadtree encoding for finite element mesh generation.
Work Processes and Process-Centered Models and Tools
Authors: M. Miatidis, M. Theißen, M. Jarke, W. Marquardt
Venue: Collaborative and Distributed Chemical Engineering. From Understanding to Substantial Design Process Support: Results of the IMPROVE Project (2008)

The first vertical column of the layered process/product model (PPM) addresses the direct, experience-based support at the technical workplaces of designers. More specifically, we demonstrate the transition from application domain models to executable tool models, focussing on the process perspective of the PPM. This vertical column is jointly realized by the A1 subproject, providing the fine-grained application domain models, and the B1 subproject, dealing with their conversion to executable tool models to be used by process-integrated tools. In this contribution, we provide an outline of the cooperation results.
A study of integrating functions of mobile learning: Taiwan elementary as an example
Authors: Rong-Jyue Fang, Chien-Chine Chien-Chine, Jia-Rong Wen, Hung-Jen Yang, Chi-Jen Lee, Hua-Lin Tsai
Venue: Proceedings of the 8th WSEAS International Conference on Multimedia systems and signal processing (2008)

Over the last few years, dealing with digital learning and information explosion, students enhance their global vision via international interaction on education experience. It stimulates students' cultural experience and expands learning fields. Many outstanding examples of international interaction were produced. At this stage, it should be emphasized that international interaction on education is not aiming to transfer entire courses of study to the Internet.
A Collaborative Access Control Based on XACML in Pervasive Environments
Authors: Kyu Il Kim, Hyuk Jin Ko, Won Gil Choi, Eun Ju Lee, Ung Mo Kim
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

Pervasive environments consist of the heterogeneous network system. And these mean environment that can be the various web service to sharing of mutual information. However, this requires not only advance security but also districted access control. Because the indiscreet resource access bring on the problem by the mobile devices and wireless network without the time and space, pervasive access control is very important. Access control must be defines the technologies for the new service and the optimized access policy for these environments. Cooperation administration is serious point too. This requires dynamic control how to use the sharing resources. Therefore we propose collaborative access control based XACML in pervasive environments. Proposed mechanism applies to XACML of OASIS standard in pervasive environments. XACML is designed to express authorization policies in XML against objects that are themselves identified in XML. But XACML combination algorithms can not support requirement condition of collaboration. In this paper, we propose extended XACML of collaborative access control based on RBAC hierarchy.
A Segmentation Scheme Based on a Multi-graph Representation: Application to Colour Cadastral Maps
Authors: Romain Raveaux, Jean-Christophe Burie, Jean-Marc Ogier
Venue: Graphics Recognition. Recent Advances and New Opportunities: 7th International Workshop, GREC 2007, Curitiba, Brazil, September 20-21, 2007. Selected Papers (2008)

In this paper, a colour segmentation process is proposed. The novelty relies on an efficient way to introduce a priori knowledge to isolate pertinent regions. Basically, from a pixel classification stage a suitable colour model is set up. A hybrid colour space is built by choosing meaningful components from several standard colour representations. Thereafter, a segmentation algorithm is performed. The region extraction is executed by a vectorial gradient dealing with hybrid colour space. From this point, a merging mechanism is carried out. It is based on a multi-graphs data structure where each graph represents a different point of view of the region layout. Hence, merging decisions can be taken considering graph information and according to a set of applicative rules. The whole system is assessed on ancient cadastral maps and experiments tend to reveal a reliable behaviour in term of information retrieval.
Micromobility Management Enhancement for Fast Handover in HMIPv6-Based Real-Time Applications
Authors: Sungkuen Lee, Eallae Kim, Taehyung Lim, Seokjong Jeong, Jinwoo Park
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

In this paper, we propose a fast handoff algorithm for micromobility management enhancement in HMIPv6 networks, which eliminates the DAD procedure involved in the regular HMIPv6 in order to decrease handoff latency and increase the resource utilization efficiency. In the proposed scheme, the MAP is designed to guarantee the uniqueness of MN's interface identifier within a MAP domain as long as the MN moves in a MAP domain, so that the MN configures the new address without the DAD procedure resulting in the decreased handoff latency significantly. When the MN resides in a subnet, MIPv6 is used adaptively as a mobility management protocol, which is to reduce bandwidth waste from the IP packet header overhead of IP-in-IP tunneling from the regular HMIPv6. Thru various computer simulation results, we verified the superior performance of the proposed scheme by comparing with the results of other schemes, MIPv6 and HMIPv6.
RouteCheckr: personalized multicriteria routing for mobility impaired pedestrians
Authors: Thorsten Völkel, Gerhard Weber
Venue: Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility (2008)

Mobility impaired people use a variety of assistive technologies to navigate independently in everyday life. Although several technical approaches for navigation systems exist, many drawbacks remain due to lack of geospatial resolution, inadequate geographical data provided, and missing adaptation of routes to a multitude of user specific criteria. We developed RouteCheckr, a client/server system for collaborative multimodal annotation of geographical data and personalized routing of mobility impaired pedestrians. The construction of algorithms supporting multiple bipolar criteria is described, applied to route calculation, and demonstrated in our university's campus. To satisfy individual requirements, user profiles are incorporated enabling adaptivity over heterogeneous user groups while preserving privacy. Finally, a general architecture for RouteCheckr is presented and simulation results are analyzed.
The AIT Outdoor Tracker for Vehicles and Pedestrians in CLEAR2007
Authors: Andreas Stergiou, Aristodemos Pnevmatikakis, Lazaros Polymenakos
Venue: Multimodal Technologies for Perception of Humans: International Evaluation Workshops CLEAR 2007 and RT 2007, Baltimore, MD, USA, May 8-11, 2007, Revised Selected Papers (2008)

This paper presents the tracking system from Athens Information Technology that participated to the pedestrian and vehicle surveillance task of the CLEAR 2007 evaluations and the obtained results. The system is based on the CLEAR 2006 one, with some important modifications that are detailed. Since the test data in CLEAR 2006 and 2007 are the same, it is easy to quantify the obtained performance gain from the older system to the proposed one.
Structural equation modeling assessment of key causal factors in computer crime victimization
Authors: Dennis Giever
Venue:  (2008)

This dissertation empirically assesses a computer-crime victimization model by applying Routine Activities Theory. Routine Activities Theory is arguably, as presented in detail in the main body of this study, merely an expansion of Hindelang, Gottfredson, and Garofalo's Lifestyle Exposure Theory. The components of Routine Activities Theory were tested via structural equation modeling to assess the existence of any statistical significance between individual online lifestyles, levels of computer security, and levels of individual computer-crime victimization. A self-report survey, which contained multiple measures of computer security, online lifestyles, and computer-crime victimization, was administered to 204 college students to gather data to test the model. This study was designed to convey two specific significant contributions to the empirical literature in Criminology. First, this study is the first empirical test focusing on individual computer-crime victimization via a theoretical approach using Routine Activities Theory. Second, utilizing structural equation modeling facilitates the assessment of the new theoretical model by illustrating an overall picture of the relationship among the causal factors in the proposed model. The findings from this study provide empirical supports for the components of Routine Activities Theory by delineating patterns of computer-crime victimization.
"I Know What You Feel": Analyzing the Role of Conjunctions in Automatic Sentiment Analysis
Authors: Ritesh Agarwal, T. V. Prabhakar, Sugato Chakrabarty
Venue: Proceedings of the 6th international conference on Advances in Natural Language Processing (2008)

We are interested in finding how people feel about certain topics. This could be considered as a task of classifying the sentiment: sentiment could be positive, negative or neutral. In this paper, we examine the problem of automatic sentiment analysis at sentence level. We observe that sentence structure has a fair contribution towards sentiment determination, and conjunctions play a major role in defining the sentence structure. Our assumption is that in presence of conjunctions, not all phrases have equal contribution towards overall sentiment. We compile a set of conjunction rules to determine relevant phrases for sentiment analysis. Our approach is a representation of the idea to use linguistic resources at phrase level for the analysis at sentence level. We incorporate our approach with support vector machines to conclude that linguistic analysis plays a significant role in sentiment determination. Finally, we verify our results on movie, car and book reviews.
Old Handwritten Musical Symbol Classification by a Dynamic Time Warping Based Method
Authors: Alicia Fornés, Josep Lladós, Gemma Sánchez
Venue: Graphics Recognition. Recent Advances and New Opportunities: 7th International Workshop, GREC 2007, Curitiba, Brazil, September 20-21, 2007. Selected Papers (2008)

A growing interest in the document analysis field is the recognition of old handwritten documents, towards the conversion into a readable format. The difficulties when we work with old documents are increased, and other techniques are required for recognizing handwritten graphical symbols that are drawn in such these documents. In this paper we present a Dynamic Time Warping based method that outperforms the classical descriptors, being also invariant to scale, rotation, and elastic deformations typical found in handwriting musical notation.
From Smart Homes to Smart Cities: Opportunities and Challenges from an Industrial Perspective
Authors: Cornel Klein, Gerald Kaefer
Venue: Proceedings of the 8th international conference, NEW2AN and 1st Russian Conference on Smart Spaces, ruSMART on Next Generation Teletraffic and Wired/Wireless Advanced Networking (2008)

Driven by the advances in hardware technologies, smart environments (or "pervasive computing") already penetrate many spaces of our daily live. Smart Homes, Smart Buildings and larger ensembles like airports, hospitals or university campuses are already equipped with a multitude of mobile terminals, embedded devices as well as connected sensors and actuators. Some activities already envision the "Smart City" which uses the opportunities provided by pervasive computing technologies to the benefits of their inhabitants. In such a setting, smart environments are expected to play a crucial role for coping with the challenges of urbanization and demographic chance e.g. regarding sustainability, energy distribution, mobility, health or public safety/security.While "smartness" is often centered on a user perspective, we give the business perspective of a large industrial supplier of infrastructures and solutions. This includes application scenarios for smart cities and an outline of the involved business- and research challenges. A particular focus will be the setup and energy efficient operation of smart infrastructures and data centers. While "autonomic computing principles" like self-configuration, self-healing, self-protection, and self-optimization are well understood for enterprise IT infrastructures, their application to highly-distributed, heterogeneous pervasive computing systems is less straightforward. A particular concern is the incorporation of energy efficiency in such settings. This involves a reduction of the rapidly raising IT energy costs and concepts for making software applications and services more aware of their energy consumption. It is therefore the basis for the identification of IT energy hotspots in software and IT system architecture and therefore for a sustainable development and operation of smart environments
Plenary lecture three: clustering with an N-dimensional extension of Gielis superformula
Authors: Angel Kuri-Morales
Venue: Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation (2008)

One of the most important issues regarding the analysis of raw data is the adequate identification of groups within such data. There have been many attempts to define a measure of what is "adequate" clustering. In all published cases, however, the adequateness of a cluster depends on a measure of distance chosen a priori. A metric or distance function is a function which defines a distance between elements of a set (for instance, one of the Ln family or Mahalanobis' distances have been utilized). Once a metric has been defined it remains to prove that the resulting clusters do, indeed, correspond to a proper classification. An obvious disadvantage of this methodology is, however, that in the space of the metric all clusters are hyperspherical. The shortcoming is that this fact immediately invalidates the attempt to find irregular shapes in such N-dimensional space. A metric induces a topology on a set but not all topologies can be generated by a metric. Topological unmetrisable spaces correspond, in this case, to a family of formulas developed originally by Gielis which he called a "superformula" (S). By replacing a metric by the elements of the hull defined by S we allow the search for more general shapes for our clusters. We report on the application of Vasconcelos Genetic Algorithm to find the parameters of S whose hulls encompass a large number of observations and the application of this method to data mining.
A Model-Based Relevance Estimation Approach for Feature Selection in Microarray Datasets
Authors: Gianluca Bontempi, Patrick E. Meyer
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part II (2008)

The paper presents an original model-based approach for feature selection and its application to classification of microarray datasets. Model-based approaches to feature selection are generally denoted as wrappers. Wrapper methods assess subsets of variables according to their usefulness to a given prediction model which will be eventually used for classification. This strategy assumes that the accuracy of the model used for the wrapper selection is a good estimator of the relevance of the feature subset. We first discuss the limits of this assumption by showing that the assessment of a subset by means of a generic learner (e.g. by cross-validation) returns a biased estimate of the relevance of the subset itself. Secondly, we propose a low-bias estimator of the relevance based on the cross-validation assessment of an unbiased learner. Third, we assess a feature selection approach which combines the low-bias relevance estimator with state-of-the-art relevance estimators in order to enhance their accuracy. The experimental validation on 20 publicly available cancer expression datasets shows the robustness of a selection approach which is not biased by a specific learner.
A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations
Authors: Xiaowen Lou, Daming Zhu
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

We consider sorting unsigned circular permutations by cut-and-paste operations. For a circular permutation, a cut-and-paste operation can be a reversal, a transposition, or a transreversal. For the sorting of signed permutations, there are several approximation algorithms allowing various combinations of these operations. For the sorting of unsigned permutations, we only know a 3-approximation algorithm and an improved algorithm with ratio 2.8386+¿, both allowing reversals and transpositions. In this paper, by new observations on the breakpoint graph, we present a 2.25-approximation algorithm for cut-and-paste sorting of unsigned circular permutations.
Mining Association Rules with Respect to Support and Anti-support-Experimental Results
Authors: Roman Słowiński, Izabela Szczęch, Mirosław Urbanowicz, Salvatore Greco
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

Evaluating the interestingness of rules or trees is a challenging problem of knowledge discovery and data mining. In recent studies, the use of two interestingness measures at the same time was prevailing. Mining of Pareto-optimal borders according to support and confidence, or support and anti-support are examples of that approach. Here, we consider induction of "if..., then..." association rules with a fixed conclusion. We investigate ways to limit the set of rules non---dominated wrt support and confidence or support and anti-support, to a subset of truly interesting rules. Analytically, and through experiments, we show that both of the considered sets can be easily reduced by using the valuable semantics of confirmation measures.
Unreal PowerPointTM: Immersing PowerPoint presentations in a virtual computer game engine world
Authors: Colin B. Price
Venue: Computers in Human Behavior (2008)

At a recent conference on games in education, we made a radical decision to transform our standard presentation of PowerPoint slides and computer game demonstrations into a unified whole, inserting the PowerPoint presentation to the computer game. This opened up various questions relating to learning and teaching theories, which were debated by the conference delegates. In this paper, we reflect on these discussions, we present our initial experiment, and relate this to various theories of learning and teaching. In particular, we consider the applicability of ''concept maps'' to inform the construction of educational materials, especially their topological, geometrical and pedagogical significance. We supplement this ''spatial'' dimension with a theory of the dynamic, temporal dimension, grounded in a context of learning processes, such as Kolb's learning cycle. Finally, we address the multi-player aspects of computer games, and relate this to the theories of social and collaborative learning. This paper attempts to explore various theoretical bases, and so support the development of a new learning and teaching virtual reality approach.