ppxscal/embedding_network huggingface dataset:
Design pattern recovery through visual language parsing and source code analysis
Authors: Andrea De Lucia, Vincenzo Deufemia, Carmine Gravino, Michele Risi
Venue: Journal of Systems and Software (2009)

In this paper we propose an approach for recovering structural design patterns from object-oriented source code. The recovery process is organized in two phases. In the first phase, the design pattern instances are identified at a coarse-grained level by considering the design structure only and exploiting a parsing technique used for visual language recognition. Then, the identified candidate patterns are validated by a fine-grained source code analysis phase. The recognition process is supported by a tool, namely design pattern recovery environment, which allowed us to assess the retrieval effectiveness of the proposed approach on six public-domain programs and libraries.
Hybrid Reasoning with Argumentation Schemes
Authors: Thomas F. Gordon, Fraunhofer Fokus
Venue: Proceeding of the 2008 conference on Knowledge-Based Software Engineering: Proceedings of the Eighth Joint Conference on Knowledge-Based Software Engineering (2008)

Practical reasoning typically requires a variety of argumentation schemes to be used together to solve problems and make decisions. For example, a legal case may raise issues requiring argument from precedent cases, rules, policy goals, moral principles, jurisprudential doctrine, social values and evidence. This tutorial presents an introduction to the modern philosophy of argumentation and argumentation technology, including an extensible software architecture which allows diverse computational models of argumentation schemes to be used together in an integrated way to construct and search for arguments. The architecture has been implemented in Carneades, a software library for building argumentation tools. The architecture is illustrated with models of schemes for argument from ontologies, rules, cases and testimonial evidence and compared to blackboard systems for hybrid reasoning.
Reformulating Global Grammar Constraints
Authors: George Katsirelos, Nina Narodytska, Toby Walsh
Venue: Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2009)

An attractive mechanism to specify global constraints in rostering and other domains is via formal languages. For instance, the Regular and Grammar constraints specify constraints in terms of the languages accepted by an automaton and a context-free grammar respectively. Taking advantage of the fixed length of the constraint, we give an algorithm to transform a context-free grammar into an automaton. We then study the use of minimization techniques to reduce the size of such automata and speed up propagation. We show that minimizing such automata after they have been unfolded and domains initially reduced can give automata that are more compact than minimizing before unfolding and reducing. Experimental results show that such transformations can improve the size of rostering problems that we can "model and run".
Part based object detection, segmentation, and tracking by boosting simple shape feature based weak classifiers
Authors: Ram Nevatia
Venue:  (2008)

Detection, segmentation, and tracking of objects of a known class is a fundamental problem in computer vision. For this task, we need to first detect the objects of interest and segment them from the background, and then track them across different frames while maintaining the correct identities. The two principle sources of difficulty in performing this task are: (a) change in appearance of the objects with viewpoint, illumination, and possible articulation, and (b) partial occlusion of objects of interest by other objects. The objective of this work is to develop a system to automatically detect, segment, and track multiple, possibly partially occluded objects of a known class from a single camera. We take pedestrians, which are important for many real-life applications, as the main class of interest to demonstrate our approach. However, some components of the method are also applied to the class of cars to show the generality of our approach. We represent an object as a hierarchy of parts. The use of part based model enables us to detect and track objects when some parts of them are not visible. We develop a new type of shape oriented features, called edgelet, to capture the silhouette based patterns. We integrate the edgelet features with some other existing shape features, and learn tree structured classifiers for object parts. Part detection responses are combined jointly so that the spatial relations, including possible occlusions, between multiple objects are analyzed. For specific applications, an unsupervised, online learning algorithm is used to improve the performance of the detectors by adapting them to the particular environment. Object segmentor, whose output is pixel-level figure-ground segmentation, is learned based on the local shape features. The object detection and segmentation results provide the observations for tracking. Trajectory initialization and termination are both automatic and rely on the detection results. Two complementary techniques, data association and mean-shift, are used to track an object. An automatic object detection and tracking system has been implemented and evaluated on a number of images and videos. The experimental results show that our method achieves the state-of-the-art performance.
'Tis Better to Construct than to Receive? The Effects of Diagram Tools on Causal Reasoning
Authors: Matthew W. Easterday, Vincent Aleven, Richard Scheines
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

Previous research on the use of diagrams for argumentation instruction has highlighted, but not conclusively demonstrated, their potential benefits. We examine the relative benefits of using diagrams and diagramming tools to teach causal reasoning about public policy. Sixty-three Carnegie Mellon University students were asked to analyze short policy texts using either: 1) text only, 2) text and a pre-made, correct diagram representing the causal claims in the text, or 3) text and a diagramming tool with which to construct their own causal diagram. After a pretest and training, we tested student performance on a new policy text and found that students given a correct diagram (condition 2 above) significantly outperformed the other groups. Finally, we compared learning by testing students on a third policy problem in which we removed all diagram or tool aids and found that students who constructed their own diagrams (condition 3 above) learned the most. We describe these results and interpret them in a way that foreshadows work we now plan for a cognitive-tutor on causal diagram construction.
Mastering Revit Architecture 2008
Authors: Tatjana Dzambazova, Greg Demchak, Eddy Krygiel
Venue:  (2007)

Revit Architecture has revolutionized how architects design, develop, and deliver projects and now you can join the revolution with this expert guide. Authored by a team of Revit aficionados and experts, this in-depth book uses clear explanations, detailed tutorials, and practical examples to show you how to best implement Revit in the real world. Starting with a focused look at the basics of Revit and Building Information Modeling (BIM), you'll move quickly into setting up and customizing your Revit tools, preparing your office/project templates and settings, creating your library of components, and much more.
Simplified ERP development patterns
Authors: Claudia Carstea, Ioan-Gheorghe Ratiu, Doru Plesea, Lucian Patrascu
Venue: Proceedings of the 8th Wseas international conference on Telecommunications and informatics (2009)

Enterprise Resource Planning represents a concept which is too ambitious for its name: forget about planning, therefore forget about the resources, the "enterprise" level (the integration) is what ERP aims to be: an "integrated" system for processing and storing data which is going to replace the independent applications in a unique structure of data and in a joint logic processing. Consequently, ERP brings data which are usually stored and processed by different independent applications having distinct functions within an economic agent. It can easily be assimilated to an "information" plurality of functions: to process unitary and coherently the data of two departments which have different functions (for example: accountancy and financial). This state generally involves storing, processing and reference to the operative documents as well as (probably) their reflection in accountancy. An ERP solution will be capable of at least two practical achievements: it will be able to offer a relational (coherent) data structure and it will be able to serve in an optimum and efficient way the needs of storing / reference concerning the examination and the efficient exploitation of already stored data (documents) of an operative nature.
The Second Rewrite Engines Competition
Authors: Francisco Durán, Manuel Roldán, Emilie Balland, Mark van den Brand, Steven Eker, Karl Trygve Kalleberg, Lennart C. L. Kats, Pierre-Etienne Moreau, Ruslan Schevchenko, Eelco Visser
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

The Second Rewrite Engines Competition (REC) was celebrated as part of the 7th Workshop on Rewriting Logic and its Applications (WRLA 2008). In this edition of the competition participated five systems, namely ASF+SDF, Maude, Stratego/XT, TermWare, and Tom. We explain here how the competition was organized and conducted, and present its main results and conclusions.
The software architect as the guardian of system performance and scalability
Authors: Andre B. Bondi
Venue: Proceedings of the 2009 ICSE Workshop on Leadership and Management in Software Architecture (2009)

System performance and scalability issues often have their roots in architectural and design choices that are made early in the software life cycle. Because he must communicate with developers, designers, product managers, business stake holders, application domain experts, testers, and requirements engineers, the software architect is uniquely placed to play a leadership role in linking performance requirements to business and engineering needs. Ideally, the architectural, technology, and design choices that are made should take performance requirements and artifacts into account. This means that the architect should be equipped with at least a rudimentary understanding of performance engineering concepts. Ideally, an architect should be directly involved in performance concerns. Failing that, he should overtly give a mandate to and remain in close contact with a performance engineer to do this instead, because close architectural involvement with performance concerns is key to the success of the project.
Application of computational modelling to protein folding and aggregation studies
Authors: Nevena Todorova, Andrew Hung, Irene Yarovsky
Venue: Proceedings of the 10th WSEAS international conference on Mathematics and computers in biology and chemistry (2009)

This paper describes computer modelling studies using classical Molecular Dynamics techniques and their derivative methods such as umbrella sampling and bias-exchange metadynamics to study protein behavior in various environments causing folding, unfolding and aggregation of proteins. We present applications related to two important proteins - insulin and apolipoprotein C-II (ApoC-II).
A 2-phase algorithm for solving the single allocation p-hub center problem
Authors: T. Meyer, A. T. Ernst, M. Krishnamoorthy
Venue: Computers and Operations Research (2009)

The single allocation p-hub center problem is an NP-hard location-allocation problem which consists of locating hub facilities in a network and allocating non-hub nodes to hub nodes such that the maximum distance/cost between origin-destination pairs is minimized. In this paper we present an exact 2-phase algorithm where in the first phase we compute a set of potential optimal hub combinations using a shortest path based branch and bound. This is followed by an allocation phase using a reduced sized formulation which returns the optimal solution. In order to get a good upper bound for the branch and bound we developed a heuristic for the single allocation p-hub center problem based on an ant colony optimization approach. Numerical results on benchmark instances show that the new solution approach is superior over traditional MIP-solver like CPLEX. As a result we are able to provide new optimal solutions for larger problems than those reported previously in literature. We are able to solve problems consisting of up to 400 nodes in reasonable time. To the best of our knowledge these are the largest problems solved in the literature to date.
Health Monitor Agent Based on Neural Networks for Ubiquitous Healthcare Environment*
Authors: Michael Angelo Salvo, Romeo Mark Mateo, Jaewan Lee, Malrey Lee
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

Environments such as healthcare systems rely on wireless sensor networks as one of the trends being established in today's industry. Being one of the most researched topics today, ubiquitous healthcare is mostly concerned with providing fast and efficient service. This paper proposes the Health Monitor Agent (HMA) to monitor patients' conditions, provide early detection of serious cases, and take appropriate action in case of emergency. We present this agent to the Ubiquitous and Intelligent Framework. The proposed agent recognizes medical conditions based on symptom patterns from the biosensors in the ubiquitous healthcare environment. The HMA classifies the symptom patterns into the correct medical condition using the multilayer perceptron (MLP). Our proposed algorithm recorded the highest accuracy rate compared to the ZeroR, Simple Logistic, and J48 algorithms.
Probabilistic Learner Modeling in Scientific Inquiry Exploratory Learning Environment
Authors: Choo-Yee Ting, M. Reza. Beik Zadeh
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)

Research on learning has shown that although computer-based exploratory learning environments have been proven to be beneficial to learners, effectively inferring a learner's actions under a sound teaching and learning model that enhances exploratory behaviours remains uncertain. To address this problem, this article aims at discussing and highlighting the detail methodological approach for designing, and integrating the probabilistic learner modeling leveraging Bayesian networks into Scientific Inquiry Exploratory Learning Model. This integration mainly serves as a basis to support learners with adaptive instructions and facilitating the acquisition of both domain knowledge as well as scientific inquiry skills. To visualize the proposed methodological approach, a computer-based scientific inquiry exploratory learning environment named InQPro is developed. This article ends with presenting the preliminary investigation on employing Artificial Students technique to investigate the propagation of probabilities between subnetworks, and identifying threshold parameters in the probabilistic learner model.
Community Informatics and Information Systems: Can They Be Better Connected?
Authors: Larry Stillman, Henry Linger
Venue: The Information Society (2009)

There is an ongoing debate in community informatics about the need for a stronger conceptual and theoretical base in order to give the field disciplinary cohesion and direction. By investigating the body of reflective thinking in information systems, researchers in community informatics can develop a more rigorous theoretical context for their work. Information systems can be considered as a fragmented adhocracy that allows many intellectual communities to coexist under its umbrella. A sympathetic reading of information systems offers an opportunity to community informatics, in spite of its different orientation, to address both social and technological issues in its theoretical framework. This framework would be based on a common language that expresses a shared ontology and epistemology with information systems. Such a framework then allows community informatics to fully address its information systems problem-solving agenda as well as its community problem-solving activities. Strengthening this dual agenda will allow community informatics to work effectively with both the technical and social design and implementation problems. But it also provides community informatics with an opportunity to contribute to a discourse within information systems in order to broaden the traditional information systems concept of organization and social action.
Factorization of Kn,n into (0,j)-prisms
Authors: Sylwia Cichacz, Dalibor Froncek
Venue: Information Processing Letters (2009)

We establish a necessary and sufficient condition for the existence of a factorization of the complete bipartite graph K"n","n into some families of 3-regular graphs.
Learning robust cell signalling models from high throughput proteomic data
Authors: Mitchell Koch, Bradley M. Broom, Devika Subramanian
Venue: International Journal of Bioinformatics Research and Applications (2009)

We propose a framework for learning robust Bayesian network models of cell signalling from high-throughput proteomic data. We show that model averaging using Bayesian bootstrap resampling generates more robust structures than procedures that learn structures using all of the data. We also develop an algorithm for ranking the importance of network features using bootstrap resample data. We apply our algorithms to derive the T-cell signalling network from the flow cytometry data of Sachs et al. (2005). Our learning algorithm has identified, with high confidence, several new crosstalk mechanisms in the T-cell signalling network. Many of them have already been confirmed experimentally in the recent literature and six new crosstalk mechanisms await experimental validation.
Deontic Relevant Logic in Knowledge-based Requirements Engineering
Authors: Jingde Cheng
Venue: Proceeding of the 2008 conference on Knowledge-Based Software Engineering: Proceedings of the Eighth Joint Conference on Knowledge-Based Software Engineering (2008)

Requirements engineering is inherently concerned with discovering and/or predicting purposes, goals, and objectives of software systems. To discover/predict, analyze, elicit, specify, and reason about various requirements of software systems, we need a right fundamental logic system to provide us with a logical validity criterion of reasoning as well as a formal representation and specification language. This short position paper briefly shows that deontic relevant logic is a hopeful candidate for the fundamental logic we need.
Document relevance assessment via term distribution analysis using fourier series expansion
Authors: Patricio Galeas, Ralph Kretschmer, Bernd Freisleben
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

In addition to the frequency of terms in a document collection, the distribution of terms plays an important role in determining the relevance of documents for a given search query. In this paper, term distribution analysis using Fourier series expansion as a novel approach for calculating an abstract representation of term positions in a document corpus is introduced. Based on this approach, two methods for improving the evaluation of document relevance are proposed: (a) a function-based ranking optimization representing a user defined document region, and (b) a query expansion technique based on overlapping the term distributions in the top-ranked documents. Experimental results demonstrate the effectiveness of the proposed approach in providing new possibilities for optimizing the retrieval process.
Computability In Context: Computation and Logic in the Real World
Authors: S. Barry Cooper
Venue:  (2009)

Computability has played a crucial role in mathematics and computer science, leading to the discovery, understanding and classification of decidable/undecidable problems, paving the way for the modern computer era, and affecting deeply our view of the world. Recent new paradigms of computation, based on biological and physical models, address in a radically new way questions of efficiency and challenge assumptions about the so-called Turing barrier. This volume addresses various aspects of the ways computability and theoretical computer science enable scientists and philosophers to deal with mathematical and real-world issues, covering problems related to logic, mathematics, physical processes, real computation and learning theory. At the same time it will focus on different ways in which computability emerges from the real world, and how this affects our way of thinking about everyday computational issues. The list of contributors includes: S Abramsky, P Adriaans, M Agrawal, M Arslanov, G Ausiello, J Diaz, Y Ershov, G Longo, W Maass, I Nemeti, A Nerode, D Normann, G Odifreddi, M Rathjen, G Rozenberg, M Vardi, and P Welch.
Guaranteeing correctness of component bindings in dynamic adaptive systems based on runtime testing
Authors: Dirk Niebuhr, Andreas Rausch
Venue: Proceedings of the 4th international workshop on Services integration in pervasive environments (2009)

Component-based software engineering has been successfully applied over the past years. Future system generations, like pervasive systems, are a vast array of decentralized, distributed, autonomic, heterogeneous, organically grown and continually evolving subsystems respectively components. Components may join or leave these systems during the whole system life-cycle -- even during runtime. We depend more and more on these dynamic adaptive systems. Hence we have to guarantee their correctness although the systems are evolving during runtime. In this paper we will show that existing approaches cannot guarantee the correctness of component bindings in dynamic adaptive systems. To guarantee system correctness and to support binding of components during runtime we integrate runtime testing into our component infrastructure DAiSI.
Technical Metadata and Standards for Digitisation of Cultural Heritage in Poland
Authors: Grzegorz Płoszajski
Venue: Proceeding of the 2008 conference on New Trends in Multimedia and Network Information Systems (2008)

The digitisation of national heritage is supported in Poland by the government who want to establish standards and recommendations that could be used by all types of cultural institutions and organizations involved in digitisation process, including museums, libraries and archives. This paper describes an approach to establishing standards concerning technical aspects of digitisation, first of all technical and structural metadata and a set of rules, parameters and formats. The presented solutions are based on an unpublished report prepared by a working team.
xDOC: a system for XML based document annotation and searching
Authors: Michael K. Baldwin
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

XDoc is an XML based annotation tool and document repository. An annotator uses a tool to add annotations to a document, highlighting the most important parts. The annotation tool allows an annotator to select areas of text within a document and then select an annotation type. The annotations are then uploaded into a document repository. A document repository uses these electronically captured annotations as the basis for searching. From the document repository users can build queries based on the annotations to locate relevant documents. A user can specify the type of annotations that should be included in the search. Because searches are only performed over the selected annotations searches can be performed faster. Additionally, search queries can be specified using traditional keyword based approaches or by more powerful query languages such as XPath.