ppxscal/embedding_network huggingface dataset:
Proving Quadratic Derivational Complexities Using Context Dependent Interpretations
Authors: Georg Moser, Andreas Schnabl
Venue: Proceedings of the 19th international conference on Rewriting Techniques and Applications (2008)

In this paper we study context dependent interpretations, a semantic termination method extending interpretations over the natural numbers, introduced by Hofbauer. We present two subclasses of context dependent interpretations and establish tight upper bounds on the induced derivational complexities. In particular we delineate a class of interpretations that induces quadratic derivational complexity. Furthermore, we present an algorithm for mechanically proving termination of rewrite systems with context dependent interpretations. This algorithm has been implemented and we present ample numerical data for the assessment of the viability of the method.
Reusing Ontological Knowledge about Business Processes in IS Engineering: Process Configuration Problem
Authors: Donatas Ciuksys, Albertas Caplinskas
Venue: Informatica (2007)

Business process engineering is an important part of the advanced enterprise engineering. One of the still open issues is the question how in the enterprise system design to reuse ontological knowledge about business processes. The paper proposes to consider a family of similar business processes as a generic process and to represent knowledge about generic processes in a domain independent way. It describes the main scheme for reuse of such a domain independent knowledge when developing enterprise-wide information systems (IS). The main attention is paid to the process configuration problem. In order to solve this problem, a configurator (human being or machine) must find a set of components that fit together to satisfy the problem specification. An approach based on Description Logics is proposed for this aim. The main contribution of the paper is the proposed process configuration technique.
Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
Authors: Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Mogens Nielsen, Glynn Winskel
Venue: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday (2008)

We recall some memories of the Esprit Basic Research Action CEDISYS, a small, well-focussed and fruitful project which brought together researchers at the meeting point of true concurrency and process algebra, in the period 1988-1991. The project was initiated and effectively animated by Ugo Montanari, a passionate and long-time advocate of both these approaches to the semantics of concurrency.
Diagrammatic Logic of Existential Graphs: A Case Study of Commands
Authors: Ahti-Veikko Pietarinen
Venue: Proceedings of the 5th international conference on Diagrammatic Representation and Inference (2008)

Diagrammatic logics have advantages over symbolic cousins. Peirce thought that logical diagrams (Existential Graphs, EG) are capable of "expression of all assertions", as our reason is no longer limited to the "line of speech" (MS 654). This paper points out one such value: the economy resulting from combining multi-dimensional diagrams with multi-modal features. In particular, EGs are well-suited for representing and reasoning about non-declarative assertions, such as questions (interrogatives, vert), commands (e.g., imperatives, vair) and the compelled (potent). An advantage over symbolic-logical counterparts is multi-dimensionality that entitles recognition of non-declarative moods in an instantaneous fashion: there is no need to attune to the phonetics of expressions. The paper suggest an application of diagrammatic logic of commands to the cases where (i) minimal reaction time to commands is of essence, (ii) a full comprehension of the meaning of imperatives (`search for their objects') is needed, and (iii) an effective discrimination of commands from other non-declarative moods is critical.
FlyTact: A Tactile Display Improves a Helicopter Pilot's Landing Performance in Degraded Visual Environments
Authors: Chris Jansen, Antoon Wennemers, Wouter Vos, Eric Groen
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

Helicopter landings are more challenging in `brownout' conditions, in which sand and dust is stirred up by the rotary wing aircraft, obscuring visibility. Safe brownout landings require new sensor and display technologies to provide the pilot with information on helicopter motion. In this respect tactile displays are promising: The pilot can maintain visual references as much as possible while `feeling' the crucial helicopter speed and altitude information. The Royal Netherlands Air Force and TNO developed a tactile display to provide the helicopter pilot with information on groundspeed and altitude during landings in degraded visual environments like brownouts. The tactile display was tested in flight trials with a Cougar helicopter. The test pilot performed brownout-like landing manoeuvres faster, more accurate, better controlled, and with less mental effort when altitude and/or groundspeed information was presented on the tactile display.
Handling Missing Data from Heteroskedastic and Nonstationary Data
Authors: Fulufhelo V. Nelwamondo, Tshilidzi Marwala
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

This paper presents a computational intelligence approach for predicting missing data in the presence of concept drift using an ensemble of multi-layered feed forward neural networks. An algorithm that detects concept drift by measuring heteroskedasticity is proposed. Six instances prior to the occurrence of missing data are used to approximate the missing values. The algorithm is applied to simulated time series data sets resembling non-stationary data from a sensor. Results show that the prediction of missing data in non-stationary time series data is possible but is still a challenge. For one test, up to 78% of the data could be predicted within 10% tolerance range of accuracy.
Inclusion of Video Information for Detection of Acoustic Events Using the Fuzzy Integral
Authors: Taras Butko, Andrey Temko, Climent Nadeu, Cristian Canton
Venue: Proceedings of the 5th international workshop on Machine Learning for Multimodal Interaction (2008)

When applied to interactive seminars, the detection of acoustic events from only audio information shows a large amount of errors, which are mostly due to the temporal overlaps of sounds. Video signals may be a useful additional source of information to cope with that problem for particular events. In this work, we aim at improving the detection of steps by using two audio-based Acoustic Event Detection (AED) systems, with SVM and HMM, and a video-based AED system, which employs the output of a 3D video tracking algorithm. The fuzzy integral is used to fuse the outputs of the three detection systems. Experimental results using the CLEAR 2007 evaluation data show that video information can be successfully used to improve the results of audio-based AED.
Tutorials at the second IIiX symposium
Authors: Peter Ingwersen, Eero Sormunen
Venue: Proceedings of the second international symposium on Information interaction in context (2008)

Information Interaction in Context 2008 began with two half day tutorials. The role of a tutorial is to give a detailed introduction to a single topic related to the themes of the symposium. The first tutorial by Ayse G&ouml;ker and her colleagues focused on information interaction in mobile environments. The second tutorial by Peter Ingwersen proposed and demonstrated a research framework for semi-controlled field studies in interactive IR. The contents of tutorials are summarized below.
Privacy-Preserving Collaborative Social Networks
Authors: Justin Zhan, Gary Blosser, Chris Yang, Lisa Singh
Venue: Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics (2008)

A social network is the mapping and measuring of relationships and flows between individuals, groups, organizations, computers, web sites, and other information/knowledge processing entities. The nodes in the network are the people and groups, while the links show relationships or flows between the nodes. Social networks provide both a visual and a mathematical model for analyzing of relationships. While social network construction and analysis has taken place for a long time, social network analysis in the context of privacy-preservation is a relatively new area of research. In this paper, we focus on privately constructing a social network involving multiple independent parties. Because of privacy concerns, the parties cannot share their individual social network data directly. However, the parties could all benefit from the construction of a collaborative social network containing all the independent party network data. How multiple parties collaboratively construct a social network without breaching data privacy presents a challenge. The objective of this paper is to present a cryptographic approach for privately constructing collaborative social networks.
Role-oriented process-driven enterprise cooperative work using the combined rule scheduling strategies
Authors: Wenan Tan, Chuanqun Jiang, Ling Li, Zhenhong Lv
Venue: Information Systems Frontiers (2008)

The key to enterprise process simulation and process enactment is to implement enterprise process cooperative schedule, i.e., how to control the execution order of the scheduled activities according to cooperative behavior rules under resource constraints. This paper proposes a dynamic PERT/CPM approach using a compound number, and discusses its applications to dynamic enterprise process scheduling for Computer Supported Cooperative Work (CSCW). By using the compound number, activity's duration, the earliest start time, and the latest start time of activities in a process model can be defined and calculated effectively to facilitate the enterprise process flexible scheduling and process forecast during process enactment. A framework to role-oriented process-driven enterprise cooperative work is proposed, some schedule strategies and the algorithm implementation are discussed, as well as the process-driven enterprise application integration.
Joining to High Degrees
Authors: Jiang Liu, Guohua Wu
Venue: Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms (2008)

Cholak, Groszek and Slaman proved in [1] that there is a nonzero computably enumerable (c.e.) degree cupping every low c.e. degree to a low c.e. degree. In the same paper, they pointed out that every nonzero c.e. degree can cup a low2 c.e. degree to a nonlow2 degree. In [2], Jockusch, Li and Yang improved the latter result by showing that every nonzero c.e. degree c is cuppable to a high c.e. degree by a low2 c.e. degree b. It is natural to ask in which subclass of low2 c.e. degrees b in [2] can be located. Wu proved [6] that b can be cappable. We prove in this paper that b in Jockusch, Li and Yang's result can be noncuppable, improving both Jockusch, Li and Yang, and Wu's results.
Real-Time Short-Term Traffic Flow Forecasting Based on Process Neural Network
Authors: Shan He, Cheng Hu, Guo-Jie Song, Kun-Qing Xie, Yi-Zhou Sun
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II (2008)

Existing short-term Traffic flow forecasting models have not fully considered the characteristics of spatio-temporal process and online analysis, we imported the process neural network which can model spatio-temporal process well into short-term traffic forecasting. The model use wavelet radix as weighted function expanding radix of process neurons to deal with the inputs on multi-scale. By using principal component analysis to consider the space affect of traffic flow, the model was optimized. In addition, online learning algorithm of the model was proposed. The experimental results show that the forecasting accuracy of the model is better than ordinary neural networks, and the model can meet the demand of real-time forecasting of short-term traffic flow.
Comparing Two IRT Models for Conjunctive Skills
Authors: Hao Cen, Kenneth Koedinger, Brian Junker
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

A step in ITS often involve multiple skills. Thus a step requiring a conjunction of skills is harder than steps that require requiring each individual skill only. We developed two Item-Response Models --- Additive Factor Model (AFM) and Conjunctive Factor Model (CFM) --- to model the conjunctive skills in the student data sets. Both models are compared on simulated data sets and a real assessment data set. We showed that CFM was as good as or better than AFM in the mean cross validation errors on the simulated data. In the real data set CFM is not clearly better. However, AFM is essentially performing as a conjunctive model.
Improving Artificial Immune System Performance: Inductive Bias and Alternative Mutations
Authors: Pupong Pongcharoen, Warattapop Chainate, Sutatip Pongcharoen
Venue: Proceedings of the 7th international conference on Artificial Immune Systems (2008)

Research works related to the Artificial Immune System (AIS) and their applications have been extensively reported during the last decade. In this work, we proposed an inductive bias heuristic called neighbourhood improvement within the classical AIS for improving its performance. We also demonstrated alternative mutation mechanisms for cloning the elite antibodies. Computational experiments using the proposed heuristic and mechanisms to find the near optimal solutions of travelling salesman problems were conducted. The results obtained from the modified AIS were compared with those obtained from other metaheuristics. It was found that the performance of the modified AIS adopting the proposed heuristic and mechanisms outperformed the conventional AIS and other metaheuristics.
Efficient Motion Estimation Scheme for H.264 Based on BP Neural Network
Authors: Wei Zhou, Haoshan Shi, Zhemin Duan, Xin Zhou
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

In the new H.264 video coding standard, motion estimation takes up a significant encoding time especially when using the straightforward full search algorithm (FS). We present an efficient scheme based on BP neural network algorithm which we believe can overcome to a significant degree this shortcoming. The mean squared error (MSE) between the current block and the same position in the reference frame is an often used matching criteria in block matching process. The scheme presented is very well suited to neural network training where the performance index is the mean squared error. The experimental results in Table 1 and Table 2 in the full paper compare our method with the full search algorithm. These comparisons show preliminarily but clearly that our method dose overcome to a significant degree the shortcoming of FS mentioned at the beginning of this abstract with neglectable coding efficiency loss.Keywords:Motion Estimation; mean squared error; BP neural network.
On the Toric Graph as a Tool to Handle the Problem of Sorting by Transpositions
Authors: Rodrigo A. Hausen, Luerbio Faria, Celina M. Figueiredo, Luis Antonio Kowada
Venue: Proceedings of the 3rd Brazilian symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology (2008)

To this date, neither a polynomial algorithm to sort a permutation by transpositions has been found, nor a proof that it is an NP-hard problem has been given. Therefore, determining the exact transposition distance d t (¿) of a generic permutation ¿, relative to the identity, is generally done by an exhaustive search on the space S n of all permutations of n elements. In a 2001 paper, Eriksson et al. [1] made a breakthrough by proposing a structure named by them as toric graph, which allowed the reduction of the search space, speeding-up the process, such that greater instances could be solved. Surprisingly, Eriksson et al. were able to exhibit a counterexample to a conjecture by Meidanis et al. [2] that the transposition diameter would be equal to the distance of the reverse permutation $\lfloor{n/2}\rfloor+1$. The goal of the present paper is to further study the toric graph, focusing on the case when n + 1 is prime. We observe that the transposition diameter problem for n = 16 is still open. We determine that there are exactly $\frac{n!-n}{n+1} + n$ vertices in the toric graph and find a lower bound $d_t(\pi) \ge \lfloor{n/2}\rfloor$ on the transposition distance for every permutation ¿ in a unitary toric class that is not the identity permutation. We provide experimental data on the exact distance of those permutations to back our conjecture that $d_t(\pi) \le \lfloor{n/2}\rfloor + 1$, where ¿ belongs to a unitary toric class, and that $\lfloor{n/2}\rfloor + 1$ is equal to the transposition diameter when n + 1 is prime.
Analyzing Co-training Style Algorithms
Authors: Wei Wang, Zhi-Hua Zhou
Venue: Proceedings of the 18th European conference on Machine Learning (2007)

Co-training is a semi-supervised learning paradigm which trains two learners respectively from two different views and lets the learners label some unlabeled examples for each other. In this paper, we present a new PAC analysis on co-training style algorithms. We show that the co-training process can succeed even without two views, given that the two learners have large difference, which explains the success of some co-training style algorithms that do not require two views. Moreover, we theoretically explain that why the co-training process could not improve the performance further after a number of rounds, and present a rough estimation on the appropriate round to terminate co-training to avoid some wasteful learning rounds.
Real-world polymorphic attack detection using network-level emulation
Authors: Michalis Polychronakis, Kostas G. Anagnostakis, Evangelos P. Markatos
Venue: Proceedings of the 4th annual workshop on Cyber security and information intelligence research: developing strategies to meet the cyber security and information intelligence challenges ahead (2008)

As state-of-the-art attack detection technology becomes more prevalent, attackers have started to employ techniques such as code obfuscation and polymorphism to defeat these defenses. We have recently proposed network-level emulation, a heuristic detection method that scans network traffic to detect polymorphic attacks. Our approach uses a CPU emulator to dynamically analyze every potential instruction sequence in the inspected traffic, aiming to identify the execution behavior of certain malicious code classes, such as self-decrypting polymorphic shellcode. Network-level emulation does not rely on any exploit or vulnerability specific signatures, which allows the detection of previously unknown attacks, while the actual execution of the attack code makes the detector robust to evasion techniques such as self-modifying code. After more than a year of continuous operation in production networks, our prototype implementation has captured more than a million attacks against real systems, employing a highly diverse set of exploits, often against less widely used vulnerable services, while so far has not resulted to any false positives.
Enabling Next Generation Peer-to-Peer Services
Authors: Fabio Victora Hecht, Burkhard Stiller
Venue: Proceedings of the 2nd international conference on Autonomous Infrastructure, Management and Security: Resilient Networks and Services (2008)

Peer-to-peer (P2P) applications have the potential to improve net- work scalability and create a community in which resources are under the shared responsibility of its members. Current popular solutions target specific applications, such as file sharing and VoIP (Voice-over-IP), but important challenges prevent P2P technology from having wider acceptance in other services. Overwhelmed by interdomain traffic generated by P2P applications that build overlays asymmetric to the network topology, ISPs offer at a home user level only connections with asymmetric bandwidth. This measure efficiently hinders P2P applications. This paper introduces a new incentive model for overlay applications and ISPs to collaborate and to create at the same time a win-win situation. The approach combines two principles: (1) ISPs and P2P applications communicate to correct overlay asymmetry and (2) ISPs diminish bandwidth asymmetry by providing users additional bandwidth reserved for intradomain traffic.
A First Step towards Live Botmaster Traceback
Authors: Daniel Ramsbrock, Xinyuan Wang, Xuxian Jiang
Venue: Proceedings of the 11th international symposium on Recent Advances in Intrusion Detection (2008)

Despite the increasing botnet threat, research in the area of botmaster traceback is limited. The four main obstacles are 1) the low-traffic nature of the bot-to-botmaster link; 2) chains of "stepping stones;" 3) the use of encryption along these chains; and 4) mixing with traffic from other bots. Most existing traceback approaches can address one or two of these issues, but no single approach can overcome all of them. We present a novel flow watermarking technique to address all four obstacles simultaneously. Our approach allows us to uniquely identify and trace any IRC-based botnet flow even if 1) it is encrypted (e.g., via SSL/TLS); 2) it passes multiple intermediate stepping stones (e.g., IRC server, SOCKs); and 3) it is mixed with other botnet traffic. Our watermarking scheme relies on adding padding characters to outgoing botnet C C messages at the application layer. This produces specific differences in lengths between randomly chosen pairs of messages in a network flow. As a result, our watermarking technique can be used to trace any interactive botnet C C traffic and it only requires a few dozen packets to be effective. To the best of our knowledge, this is the first approach that has the potential to allow real-time botmaster traceback across the Internet.We have empirically validated the effectiveness of our botnet flow watermarking approach with live experiments on PlanetLab nodes and public IRC servers on different continents. We achieved virtually a 100% detection rate of watermarked (encrypted and unencrypted) IRC traffic with a false positive rate on the order of 10¿ 5. Due to the message queuing and throttling functionality of IRC servers, mixing chaff with the watermarked flow does not significantly impact the effectiveness of our watermarking approach.
Malicious Code on Java Card Smartcards: Attacks and Countermeasures
Authors: Wojciech Mostowski, Erik Poll
Venue: Proceedings of the 8th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications (2008)

When it comes to security, an interesting difference between Java Card and regular Java is the absence of an on-card bytecode verifier on most Java Cards. In principle this opens up the possibility of malicious, ill-typed code as an avenue of attack, though the Java Card platform offers some protection against this, notably by code signing.This paper gives an extensive overview of vulnerabilities and possible runtime countermeasures against ill-typed code, and describes results of experiments with attacking actual Java Cards currently on the market with malicious code.