ppxscal/embedding_network huggingface dataset:
Lessons from the JML Project
Authors: Gary T. Leavens, Curtis Clifton
Venue: Verified Software: Theories, Tools, Experiments: First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions (2005)

To have impact, a grand challenge should provide a way for diverse research to be integrated in a synergistic fashion. Synergy in the JML project comes from a shared specification language, and thus holds several lessons for the verifying compiler grand challenge. An important lesson is that the project should focus considerable resources on specification language design, which still contains many open research problems. Another important lesson is that, to support such a specification language, the project needs to involve groups doing research on extensible compilers and integrated development environments.
Analytically Tuned Simulated Annealing Applied to the Protein Folding Problem
Authors: Juan Frausto-Solis, E. F. Román, David Romero, Xavier Soberon, Ernesto Liñán-García
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

In this paper a Simulated Annealing algorithm (SA) for solving the Protein Folding Problem (PFP) is presented. This algorithm has two phases: quenching and annealing. The first phase is applied at very high temperatures and the annealing phase is applied at high and low temperatures. The temperature during the quenching phase is decreased by an exponential function. We run through an efficient analytical method to tune the algorithm parameters. This method allows the change of the temperature in accordance with solution quality, which can save large amounts of execution time for PFP.
Scheduling applied to air traffic control
Authors: E. Romano, L. C. Santillo, P. Zoppoli
Venue: Proceedings of the 10th WSEAS International Conference on Automatic Control, Modelling & Simulation (2008)

The aim of the paper is to use a simulation approach to analyze and resolve the problem of how to optimize the use of a resource, in the example an airport runway, by correctly sequencing the aircraft arrivals on it. With the ever increasing congestion at airports around the world, studies into ways of maximizing infrastructures capacity and minimizing delay costs while meeting the goals of the airlines are necessary. A simulation model has been used to estimate the airport capacity and also to optimize the air flow management, optimizing the capacity. The methodology has been applied to the traffic data of the Naples International Airport. Finally, we suggest a mathematic algorithm that is able to optimize, a posteriori, the flight operation under the delay restraint. The algorithm determines the best sequence of aircrafts that minimizes the delays and it maximizes the runway capacity.
Checking correctness of business contracts via commitments
Authors: Nirmit Desai, Nanjangud C. Narendra, Munindar P. Singh
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

Business contracts tend to be complex. In current practice, contracts are often designed by hand and adopted by their participants after, at best, a manual analysis. This paper motivates and formalizes two aspects of contract correctness from the perspective of the preferences of the agents participating in them. A contract is safe for a participant if participating in the contract would not leave the participant worse off than otherwise. More strongly, a contract is beneficial to a participant if participating in the contract would leave the participant better off than otherwise. This paper seeks to partially automate reasoning about the correctness of formally modeled business contracts. It represents contracts formally as a set of commitments. It motivates constraints on how cooperative agents might value the various states of commitments. Further, it shows that such constraints are consistent and promote cooperation. Lastly, it presents algorithms for checking the safety and guaranteed benefits of a contract.
Power control in wireless ad hoc networks
Authors: Brahim Bensaou
Venue:  (2007)

Power control in mobile and wireless ad hoc networks has received increasing research interest in recent years. The main idea of power control is to transmit packets at the appropriate power levels that guarantee their successful reception, with the objective of improving the network throughput or lowering the energy consumed by the transmissions. In this thesis, we focus on the study and design of power control algorithms for IEEE 802.11-based wireless ad hoc networks to reduce energy consumption per carried byte, without degrading the network throughput. We first examine the routing layer point of view, and study the relationship between the network throughput capacity and the transmission range, which is determined by the transmission power setting. We notably show that there cannot exist a universal power control algorithm to improve the network performance without access to global network information which is inappropriate in ad hoc networks. We thus focus on the MAC layer point of view, where we study the correlations that exist between the required transmission power of RTS, CTS, DATA and ACK frames to guarantee a successful 4-way handshake and propose novel power control algorithms that take such correlations into consideration in order to reduce energy consumption per carried byte.
Typed iterators for XML
Authors: Giuseppe Castagna, Kim Nguyen
Venue: Proceeding of the 13th ACM SIGPLAN international conference on Functional programming (2008)

XML transformations are very sensitive to types: XML types describe the tags and attributes of XML elements as well as the number, kind, and order of their sub-elements. Therefore, operations, even simple ones, that modify these features may affect the types of documents. Operations on XML documents are performed by iterators that, to be useful, need to be typed by a kind of polymorphism that goes beyond what currently exists. For this reason these iterators are not programmed but, rather, hard-coded in the languages. However, this approach soon reaches its limits, as the hard-coded iterators cannot cover fairly standard usage scenarios. As a solution to this problem we propose a generic language to define iterators for XML data. This language can either be used as a compilation target (e.g., for XPATH) or it can be grafted on any statically typed host programming language (as long as this has product types) to endow it with XML processing capabilities. We show that our language mostly offers the required degree of polymorphism, study its formal properties, and show its expressiveness and practical impact by providing several usage examples and encodings.
Modeling the Survival of Hip Fracture Patients Using a Conditional Phase-Type Distribution
Authors: Adele Heather Marshall, Barry Shaw
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

Previous research has introduced the Conditional phase-type distribution as a model that can suitably represent a skewed survival distribution conditioned on a network of inter-related variables. The technique has successfully been applied to modeling the stay of elderly patients in hospital which typically includes extreme stays in hospital resulting in a highly skewed survival distribution. This paper uses the Conditional phase-type distribution in a different setting whereby the focus is on patients who are in hospital due to having suffered a hip fracture. The model represents the patient length of stay in hospital conditioned on a Bayesian network of inter-related patient variables. In particular, the network highlights the key factors influencing length of stay and identifies relationships between long stay patients, delays in surgery and the patients condition. The delays identified in the system, could therefore be addressed to hopefully reduce the length of stay in hospital and increase the flow of patients in the hospital system.
Another Face of Search Engine: Web Search API's
Authors: Harshit Kumar, Sanggil Kang
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

Since search engine development requires building an index which is a tedious and space consuming process. Now-a-days all major search engines provide developers access to their resources through a set of APIs. In this paper we try to answer the following questions. What differences exist between search engines and their associated search APIs? Does search APIs really surrogate for the actual search engine within the research domain? If yes, then which APIs is more suitable? For our experiments, we have used the following search engines and their web search APIs: Yahoo, Google, MSN, and Naver. Our experimental results will help researchers to choose appropriate web search APIs that suit their requirements.
Harmonization of Informatics Education --- Science Fiction or Prospective Reality?
Authors: Peter Micheuz
Venue: Proceedings of the 3rd international conference on Informatics in Secondary Schools - Evolution and Perspectives: Informatics Education - Supporting Computational Thinking (2008)

Starting from the influential Common European Framework of Reference for Languages, this paper presents a synopsis of current frameworks and curricula in terms of (informatical) education at the secondary school level. Some initiatives from well known organizations and institutions show the global and national efforts to structure the fragmented field of computing at the school level. The definitive answer as to whether a perceptible process of harmonization seems to be realistic in the near future cannot yet be given, but there are some positive indicators.
How Investigative Data Mining Can Help Intelligence Agencies to Discover Dependence of Nodes in Terrorist Networks
Authors: Nasrullah Memon, David L. Hicks, Henrik Legind Larsen
Venue: Proceedings of the 3rd international conference on Advanced Data Mining and Applications (2007)

A new model of dependence centrality is proposed. The centrality measure is based on shortest paths between the pair of nodes. We apply this measure with the demonstration of a small network example. The comparisons are made with betweenness centrality. We discuss how intelligence investigation agencies could benefit from the proposed measure. In addition to that we argue about the investigative data mining techniques we are using, and a comparison is provided with traditional data mining techniques.
Compute and storage clouds using wide area high performance networks
Authors: Robert L. Grossman, Yunhong Gu, Michael Sabala, Wanzhi Zhang
Venue: Future Generation Computer Systems (2009)

We describe a cloud-based infrastructure that we have developed that is optimized for wide area, high performance networks and designed to support data mining applications. The infrastructure consists of a storage cloud called Sector and a compute cloud called Sphere. We describe two applications that we have built using the cloud and some experimental studies.
Sequence Matching for Suspicious Activity Detection in Anti-Money Laundering
Authors: Xuan Liu, Pengzhu Zhang, Dajun Zeng
Venue: Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics (2008)

Developing effective suspicious activity detection methods has become an increasingly critical problem for governments and financial institutions in their efforts to fight money laundering. Previous anti-money laundering (AML) systems were mostly rule-based systems which suffered from low efficiency and could can be easily learned and evaded by money launders. Recently researchers have begun to use machine learning methods to solve the suspicious activity detection problem. However nearly all these methods focus on detecting suspicious activities on accounts or individual level. In this paper we propose a sequence matching based algorithm to identify suspicious sequences in transactions. Our method aims to pick out suspicious transaction sequences using two kinds of information as reference sequences: 1) individual account's transaction history and 2) transaction information from other accounts in a peer group. By introducing the reference sequences, we can combat those who want to evade regulations by simply learning and adapting reporting criteria, and easily detect suspicious patterns. The initial results show that our approach is highly accurate.
Redundancies of correction capability optimized Reed-Muller codes
Authors: Maria Bras-Amorós, Michael E. O'Sullivan
Venue: Discrete Applied Mathematics (2008)

This article is focused on some variations of Reed-Muller codes that yield improvements to the rate for a prescribed decoding performance under the Berlekamp-Massey-Sakata algorithm with majority voting. Explicit formulas for the redundancies of the new codes are given.
Classification of Voltage Sags Based on MPCA Models
Authors: Abbas Khosravi, Joaquim Melendez, Joan Colomer
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

In this paper, we introduce a new framework for classification of short duration voltage reductions in the area of Power Quality Monitoring using Multiway Principal Component Analysis (MPCA). Firstly, we recast the sags occurred in High Voltage (HV) and Medium Voltage (MV) lines in a format which is suitable for MPCA. Then, MPCA technique is employed for building statistical models for classification of sags originated in HV and MV networks and recorded in the same substation. Projecting sags registered in different substations to MPCA models of other substations has been also explored to deduce similarities and dissimilarities between different substations according to the sags registered in them.
Smartness of Pervasive Computing Systems through Context-Awareness
Authors: Arkady Zaslavsky
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)

Emerging pervasive computing and communications technologies evolved into ample pioneering initiatives, leading towards a world in which computing systems are distributed, mobile, intelligent, supportive, unobtrusive, invisible and cooperative. Central to the notion of a pervasive systems is context-awareness. Context-aware computing endeavours to make systems aware of specific, relevant circumstances in the computing environment, and enable them to adapt their behaviour accordingly. Context-aware systems can process (intelligently) the context information acquired by any type of a sensor (either physical, computational or virtual). This, in turn, enhances services provided to users (including service personalization), makes pervasive systems smart by reacting (and possibly pro-acting) to changing circumstances, and enables adaptability and autonomy of systems, freeing users from avoidable sometimes routine interactions.
Coordinating Tasks in Agent Organizations
Authors: Virginia Dignum, Frank Dignum
Venue: Coordination, Organizations, Institutions, and Norms in Agent Systems II: AAMAS 2006 and ECAI 2006 International Workshops, COIN 2006 Hakodate, Japan, May 9, 2006 Riva del Garda, Italy, August 28, 2006. Revised Selected Papers (2007)

Support for new forms of organization and social interaction requires understanding the influence of structure on behavior. Goal dependencies indicate some relationship between roles, through which actions can be coordinated. Social relationships determine different types of power links between roles. Efficient coordination requires that goal dependency and power structure are well tuned to each other. In this paper, we will investigate what is the exact nature of this relationship between roles in an organization and what are the consequences of different structure forms. We will also see what is the difference if the relations are not hierarchical but organized through a market or network structure.
Liquid Metal: Object-Oriented Programming Across the Hardware/Software Boundary
Authors: Shan Shan Huang, Amir Hormati, David F. Bacon, Rodric Rabbah
Venue: Proceedings of the 22nd European conference on Object-Oriented Programming (2008)

The paradigm shift in processor design from monolithic processors to multicore has renewed interest in programming models that facilitate parallelism. While multicores are here today, the future is likely to witness architectures that use reconfigurable fabrics (FPGAs) as coprocessors. FPGAs provide an unmatched ability to tailor their circuitry per application, leading to better performance at lower power. Unfortunately, the skills required to program FPGAs are beyond the expertise of skilled software programmers. This paper shows how to bridge the gap between programming software vs. hardware. We introduce Lime, a new Object-Oriented language that can be compiled for the JVM or into a synthesizable hardware description language. Lime extends Java with features that provide a way to carry OO concepts into efficient hardware. We detail an end-to-end system from the language down to hardware synthesis and demonstrate a Lime program running on both a conventional processor and in an FPGA.
Agent Shell for the Development of Tutoring Systems for Expert Problem Solving Knowledge
Authors: Vu Le, Gheorghe Tecuci, Mihai Boicu
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

This paper introduces the concept of learning and tutoring agent shell as a general and powerful tool for rapid development of a new type of intelligent assistants that can learn complex problem solving expertise directly from human experts, can support human experts in problem solving and decision making, and can teach their problem solving expertise to non-experts. This shell synergistically integrates general problem solving, learning and tutoring engines and has been used to build a complex cognitive assistant for intelligence analysts. This assistant has been successfully used and evaluated in courses at US Army War College and George Mason University. The goal of this paper is to provide an intuitive overview of the tutoring-related capabilities of this shell which rely heavily on its problem solving and learning capabilities. They include the capability to rapidly acquire the basic abstract problem solving strategies of the application domain, directly from a subject matter expert. They allow an instructional designer to rapidly design lessons for teaching these abstract problem solving strategies, without the need of defining examples because they are automatically generated by the system from the domain knowledge base. They also allow rapid learning of test questions to assess students' problem solving knowledge. The proposed type of cognitive assistant, capable of learning, problem solving and tutoring, as well as the learning and tutoring agent shell used to build it, represent a very promising and expected evolution for the knowledge-based agents for "ill-defined" domains.
Improving Web Search by Categorization, Clustering, and Personalization
Authors: Dengya Zhu, Heinz Dreher
Venue: Proceedings of the 4th international conference on Advanced Data Mining and Applications (2008)

This research combines Web snippet categorization, clustering and personalization techniques to recommend relevant results to users. RIB --- Recommender Intelligent Browser which categorizes Web snippets using socially constructed Web directory such as the Open Directory Project (ODP) is to be developed. By comparing the similarities between the semantics of each ODP category represented by the category-documents and the Web snippets, the Web snippets are organized into a hierarchy. Meanwhile, the Web snippets are clustered to boost the quality of the categorization. Based on an automatically formed user profile which takes into consideration desktop computer information and concept drift, the proposed search strategy recommends relevant search results to users. This research also intends to verify text categorization, clustering, and feature selection algorithms in the context where only Web snippets are available.
Sparse Least Squares Support Vector Machines by Forward Selection Based on Linear Discriminant Analysis
Authors: Shigeo Abe
Venue: Proceedings of the 3rd IAPR workshop on Artificial Neural Networks in Pattern Recognition (2008)

In our previous work, we have developed sparse least squares support vector machines (sparse LS SVMs) trained in the reduced empirical feature space, spanned by the independent training data selected by the Cholesky factorization. In this paper, we propose selecting the independent training data by forward selection based on linear discriminant analysis in the empirical feature space. Namely, starting from the empty set, we add a training datum that maximally separates two classes in the empirical feature space. To calculate the separability in the empirical feature space we use linear discriminant analysis (LDA), which is equivalent to kernel discriminant analysis in the feature space. If the matrix associated with the LDA is singular, we consider that the datum does not contribute to the class separation and permanently delete it from the candidates of addition. We stop the addition of data when the objective function of LDA does not increase more than the prescribed value. By computer experiments for two-class and multi-class problems we show that in most cases we can reduce the number of support vectors more than with the previous method.
SOA Generic Views In the Eye of the Beholder
Authors: Stefan Eicker, Reinhard Jung, Widura Schwittek, Thorsten Spies
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

This paper presents an approach called Generic View Concept which facilitates the creation and visualization of role-based, task-oriented views on service-oriented architectures. Those views enhance the understanding from the technical and functional point of view, and thus reduce the inherent complexity arising during the creation, use and maintenance of service-oriented architectures. The unique aspect of the Generic View Concept is that it does not constrain stakeholders to a set of predefined views. In order to examine the usefulness of Generic Views in real world scenarios, a prototype has been implemented applying 3D visualization techniques.
Towards Designing Operationalizable Models of Man-Machine Interaction Based on Concepts from Human Dialog Systems
Authors: Helmut Horacek
Venue: Proceedings of the 13th international conference on Natural Language and Information Systems: Applications of Natural Language to Information Systems (2008)

Designing interfaces for human-computer interaction components is time-consuming, error-prone, and requires substantial programming skills. Therefore, a variety of models for designing interfaces on a more abstract and intuitive level have been proposed, a few of them being based on ingredients of human discourse processing techniques. In this paper, we compare and contrast two of these approaches, and we develop essentials of a joint model which profits from their complementary advantages. Essential factors in this model are an adequate distribution of labor between the design made by the user and the operationalization capabilities of the system, suitable elements for the design language available to the user, and techniques that allow the specification of effective interaction sequences. The model is intended as the basis for an interaction design tool that allows the specification of graphical user interfaces as well as multi-modal interaction with a robot in a restricted real-world environment.