ppxscal/embedding_network huggingface dataset:
A One-Pass Mode of Operation for Deterministic Message Authentication-- Security beyond the Birthday Barrier
Authors: Kan Yasuda
Venue: Fast Software Encryption: 15th International Workshop, FSE 2008, Lausanne, Switzerland, February 10-13, 2008, Revised Selected Papers (2008)

We present a novel mode of operation which iterates a compression function f:{0,1} n + b ¿{0,1} n meeting a condition b ¿ 2n. Our construction can be viewed as a way of domain extension, applicable to a fixed-input-length PRF (pseudo-random function) $f_k:\{0,1\}^b\to\{0,1\}^n$ meeting the condition b ¿ 2n, which yields an arbitrary-input-length PRF $F_k:\{0,1\}^\ast\to\{0,1\}^n$. Our construction accomplishes both high security (beyond the birthday barrier) and high efficiency (one-pass), with engineering considerations of being stateless, deterministic and single-keyed.
3D Parametric Models for Aeroplanes -- From Idea to Design
Authors: Patrick Rauhut
Venue: Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems (2008)

The early design phase of an aircraft is characterized by a large variation of studies in a short period of time. In order to support the variation of aircraft shapes, an approach is taken in which the different aircraft component models are defined by a limited set of parameters. The challenge lies in fulfilling numerous and partially conflicting engineering requirements. Models should be as flexible as possible so that virtually "any" aircraft shape can be represented, in parallel the model should address the needs of different engineering disciplines located on different sites and in different countries. On the other hand each engineering discipline re-quests simple models with the smallest set of parameters possible to address their specific need. Finally, aircraft design is not only geometric and interfaces with the numerical world need to be established. During this talk we will be exploring the challenges and identified solutions for abstracting the aircraft geometry in a set of parametric models that can be shared and commonly used; we will see how dedicated CAD tools support the engineer and how the geometric models can be linked with the numerical (e.g. systems) world. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Generic Ontology for Collaborative Ontology-Development Workflows
Authors: Abraham Sebastian, Natalya F. Noy, Tania Tudorache, Mark A. Musen
Venue: Proceedings of the 16th international conference on Knowledge Engineering: Practice and Patterns (2008)

As knowledge engineering moves to the Semantic Web, ontologies become dynamic products of collaborative development rather than artifacts produced in a closed environment of a single research group. However, the projects differ--sometimes significantly--in the way the community members can contribute, the different roles they play, the mechanisms they use to carry out discussions and to achieve consensus. We are currently developing a flexible mechanism to support a wide range of collaborative workflows in the Protégé environment. In this paper, we analyze workflows for several active projects, and describe the properties of these workflows. We discuss an ontology that we developed to represent different aspects of workflows for collaborative ontology development. This ontology is a key component of the customizable workflow support in Protégé. We evaluate the coverage and flexibility of this ontology by using it to represent formally two different collaborative workflows described in the literature, Diligent and BiomedGT. This evaluation demonstrates that our workflow ontology is sufficiently flexible to represent these very different workflows.
Analysis of Parallel Preconditioned Conjugate Gradient Algorithms
Authors: Raimondas Čiegis
Venue: Informatica (2005)

The conjugate gradient method is an iterative technique used to solve systems of linear equations. The paper analyzes the performance of parallel preconditioned conjugate gradient algorithms. First, a theoretical model is proposed for estimation of the complexity of PPCG method and a scalability analysis is done for three different data decomposition cases. Computational experiments are done on IBM SP4 computer and some results are presented. It is shown that theoretical predictions agree well with computational results.
SIGEST
Authors: Staff
Venue: SIAM Review (2008)

Modern optical fiber networks transmit data at astonishingly high rates&mdash;at least a hundred billion ($10^{11}$) bits per second in a single optical fiber. The error rates caused by physical phenomena are amazingly low&mdash;in the range of one error per trillion ($10^{12}$) bits or lower&mdash;but still need to be detected and corrected. How can one simulate such a system effectively and efficiently to understand and deal with the transmission errors? Not by a straightforward Monte Carlo simulation; the number of sample points would be prohibitively high. This is an example of the type of problem addressed in this issue's SIGEST paper, &ldquo;A Method to Compute Statistics of Large, Noise-Induced Perturbations of Nonlinear Schr&ouml;dinger Solitons&rdquo; by R. O. Moore, G. Biondini, and W. L. Kath, originally published in 2007 in the SIAM Journal on Applied Mathematics. As the paper's title suggests, the type of communication network that it considers is a soliton-based transmission system. (Solitons are wave pulses that maintain their shapes while traveling at constant speed.) The mathematical model that is used is the nonlinear Schr&ouml;dinger equation, which governs the propagation of optical pulses under simplified conditions. The authors' approach is not limited to this simplified model, however, as they have shown in subsequent work. The key technique that is used by the authors to conduct effective and efficient simulations is importance sampling. This technique does what the words connote: concentrate the sample points in regions that are most consequential. Of course, this is much easier said than done. In this instance, the authors accomplish this by using approximate analytical knowledge about the behavior of the transmission system that comes from soliton perturbation theory to bias the sampling to regions where events of interest occur. Importance sampling is an important technique in general, and one of the bonus aspects of this paper is that it provides readers with a nice general introduction to importance sampling as well as a specific application. A consequence of this research is the ability to effectively simulate soliton-based optical transmission networks governed by the nonlinear Schr&ouml;dinger equation several orders of magnitude more quickly than by standard Monte Carlo simulations. The numerical simulations towards the end of the paper illustrate this. The overall result is a very nice demonstration of the use of sophisticated and deep mathematics to aid in the understanding of an important practical problem, written in a very accessible manner that should interest a broad range of SIAM readers. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Generating Specialized Rules and Programs for Demand-Driven Analysis
Authors: K. Tuncay Tekle, Katia Hristova, Yanhong A. Liu
Venue: Proceedings of the 12th international conference on Algebraic Methodology and Software Technology (2008)

Many complex analysis problems can be most clearly and easily specified as logic rules and queries, where rules specify how given facts can be combined to infer new facts, and queries select facts of interest to the analysis problem at hand. However, it has been extremely challenging to obtain efficient implementations from logic rules and to understand their time and space complexities, especially for on-demand analysis driven by queries.This paper describes a powerful method for generating specialized rules and programs for demand-driven analysis from Datalog rules and queries, and further for providing time and space complexity guarantees. The method combines recursion conversion with specialization of rules and then uses a method for program generation and complexity calculation from rules. We compare carefully with the best prior methods by examining many variants of rules and queries for the same graph reachability problems, and show the application of our method in implementing graph query languages in general.
Characterization of Logics over Ranked Tree Languages
Authors: Thomas Place
Venue: Proceedings of the 22nd international workshop on Computer Science Logic (2008)

We study the expressive power of the logics EF + F ¿ 1, Δ 2 and boolean combinations of Σ 1 over ranked trees. In particular, we provide effective characterizations of those three logics using algebraic identities. Characterizations had already been obtained for those logics over unranked trees, but both the algebra and the proofs were dependant on the properties of the unranked structure and the problem remained open for ranked trees.
The Design of Web-Based Personal Collaborative Learning System (WBPCLS) for Computer Science Courses
Authors: Zhenlong Li, Xiaoming Zhao
Venue: Proceedings of the 7th international conference on Advances in Web Based Learning (2008)

The Web-based collaborative learning system (WBCLS), which is considered a highly effective teaching method by most theory researchers, could not achieve the goals that can be obtained by traditional in-class teaching method in the teaching practice. Therefore, some problems that are harbored in the operational process of the current popular WBCLS were pointed out. In order to overcome problems mentioned above, a new framework for Computer Science Courses, which support the personal learning, was proposed and the algorithms about the intelligent course recommendation, optimal group formation, and the optimal collaborative partner discovery are discussed in this paper.
A fast intra prediction algorithm for H.264/AVC video coding
Authors: Joohee Kim, Hyo-Jik Lee
Venue: Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation (2008)

Intra prediction is one of the techniques that enables H.264/AVC to achieve a significant improvement in coding efficiency relative to prior video coding standards. To achieve the highest coding efficiency, H.264/AVC uses rate-distortion optimization technique to get the best intra prediction mode which maximizes coding quality and minimizes resulting data bits. As a result, the encoder complexity is increased considerably. This paper presents a fast intra prediction algorithm for H.264/AVC video coding. In the proposed scheme, prior to intra prediction the dominant edge of each block is determined. Based on the edge direction information, only a small number of prediction modes are chosen for RDO calculation. Experimental results show that the proposed algorithm achieves an average of 20% reduction in encoding time compared with the current rate-distortion optimized mode decision algorithm used in H.264/AVC with negligible quality degradation.
CAMNEP: agent-based network intrusion detection system
Authors: Martin Rehak, Michal Pechoucek, Pavel Celeda, Jiri Novotny, Pavel Minarik
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: industrial track (2008)

We present a prototype of agent-based intrusion detection system designed for deployment on high-speed backbone networks. The main contribution of the system is the integration of several anomaly detection techniques by means of collective trust modeling within a group of collaborative detection agents, each featuring a specific detection algorithm. The anomalies are used as an input for the trust modeling. In this stage, each agent determines the flow trustfulness from aggregated anomalies. The aggregation is performed by extended trust models that model the trustfulness of generalized situated identities, represented by a set of observable features. The system is based on traffic statistics in NetFlow format acquired by dedicated hardware-accelerated network cards, and is able to perform a real-time surveillance of the gigabit networks.
Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
Authors: Mohamed Faouzi Atig, Benedikt Bollig, Peter Habermehl
Venue: Proceedings of the 12th international conference on Developments in Language Theory (2008)

We consider multi-pushdown automata, a multi-stack extension of pushdown automata that comes with a constraint on stack operations: a pop can only be performed on the first non-empty stack (which implies that we assume a linear ordering on the collection of stacks). We show that the emptiness problem for multi-pushdown automata is 2ETIME-complete wrt. the number of stacks. Containment in 2ETIME is shown by translating an automaton into a grammar for which we can check if the generated language is empty. The lower bound is established by simulating the behavior of an alternating Turing machine working in exponential space. We also compare multi-pushdown automata with the model of bounded-phase multi-stack (visibly) pushdown automata.
Trust and Reputation in Dynamic Scientific Communities
Authors: Omer F. Rana, Annika Hinze
Venue: IEEE Distributed Systems Online (2004)

The formation of collaboration networks (or communities) is an important latent effect in many computational science undertakings. Two particularly important factors in this process are trust and reputation.
Post Keynesian Models of the Credit Market and the Reserve Market
Authors: Giuseppe Fontana, Ezio Venturino
Venue: Journal of Computational Methods in Sciences and Engineering (2004)

The paper discusses two Post Keynesian models in a closed economy, for the credit market and the reserve market respectively. The models are grounded on the idea that (a) bank loans create deposits and (b) deposits make monetary reserves. The main differences between these monetary models are due to different assumptions about the state of expectations of agents involved in the money supply process.
A Framework for Interactive Proof
Authors: David Aspinall, Christoph Lüth, Daniel Winterstein
Venue: Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference (2007)

This paper introduces Proof General Kit, a framework for software components tailored to interactive proof development. The goal of the framework is to enable flexible environments for managing formal proofs across their life-cycle: creation, maintenance and exploitation. The framework connects together different kinds of component, exchanging messages using a common communication infrastructure and protocol called PGIP. The main channel connects provers to displays. Provers are the back-end interactive proof engines and displays are components for interacting with the user, allowing browsing or editing of proofs. At the core of the framework is a broker middleware component which manages proof-in-progress and mediates between components.
A Web Based Tool for Novice Programmers: Interaction in Use
Authors: Onur Donmez, Mustafa Murat Inceoglu
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

This paper represents a web based tool model for novice programmers. It is a well known fact that, because of its abstract nature, programming is perceived to be hard amongst novice learners. Aim of this web based tool is to make students feel more comfortable with programming and overcome the abstractness. While designing this software we took the results of recent studies' into consideration to promote the effectiveness, such as getting learner inputs as code and variable values and giving representations of code and variables as learning aids. What is new to this software is placing learners into a more effective role. With this software learners are no more passive viewers of floating graphics, but active "simulators" of their very own code and inputs. With this software, learners simulate the "notional machine" behind the screen. In this paper we will be giving details about the model along with its potential uses.
Faster Unfolding of General Petri Nets Based on Token Flows
Authors: Robin Bergenthum, Robert Lorenz, Sebastian Mauser
Venue: Proceedings of the 29th international conference on Applications and Theory of Petri Nets (2008)

In this paper we propose two new unfolding semantics for general Petri nets combining the concept of prime event structures with the idea of token flows developed in [11]. In contrast to the standard unfolding based on branching processes, one of the presented unfolding models avoids to represent isomorphic processes while the other additionally reduces the number of (possibly non-isomorphic) processes with isomorphic underlying runs. We show that both proposed unfolding models still represent the complete partial order behavior. We develop a construction algorithm for both unfolding models and present experimental results. These results show that the new unfolding models are much smaller and can be constructed significantly faster than the standard unfolding.
Making Speech Technologies Available in (Serviko) Romani Language
Authors: Milan Rusko, Sakhia Darjaa, Marián Trnka, Viliam Zeman, Juraj Glovňa
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

The language of Romanies seems not to be commercially interesting for big companies. Not only the majority of people from Roma community are very poor, but the language itself is very difficult to work on, because it is extremely rich in local dialects and the standardized form that would be accepted by majority of Romanies does not exist. The Romani language belongs to the "digitally endangered languages". The paper gives a short description of Romani language in Slovakia. An effort to design basic tools needed to start using Romani speech and language in computer technologies is presented. As the authors are familiar with speech synthesis, they have chosen building several types of speech synthesizers in Romani as a pilot project. The paper shortly summarizes some facts on Romani orthography, phonetics, and prosody. The design of text corpus, diphone set, and speech database is described. The application part of the paper presents Romani synthesizers --- both diphone and unit-selection, some of which are bilingual (Romani-Slovak). The demo of the synthesis can be tried on the authors' web-page.
A Service-Oriented MultiAgent Architecture for Cognitive Surveillance
Authors: David Vallejo, Javier Albusac, Carlos Gonzalez-Morcillo, Luis Jimenez
Venue: Proceedings of the 12th international workshop on Cooperative Information Agents XII (2008)

Surveillance systems are being more and more important in a wide variety of environments. In order to obtain better results when analyzing an environment, advanced techniques based on Artificial Intelligence that go beyond segmentation, tracking, and pattern matching are being used. That is, a knowledge layer is needed for improving surveillance. This work describes the architecture of a cognitive surveillance system based on Service-Oriented Principles and Multi-Agent Systems to improve scalability, robustness, and security. Guidelines to expand the surveillance system are covered and the deployment of the architecture in a traffic scenario together with the results obtained are studied.
Optimal Field Splitting, with Applications in Intensity-Modulated Radiation Therapy
Authors: Danny Z. Chen, Chao Wang
Venue: Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics (2008)

We consider an interesting geometric partition problem called field splitting, which arises in intensity-modulated radiation therapy (IMRT). IMRT is a modern cancer treatment technique that delivers prescribed radiation dose distributions, called intensity maps (IMs) and defined on uniform grids, to target tumors via the help of a device called the multileaf collimator (MLC). The delivery of each IM requires a certain amount of beam-on time, which is the total time when a patient is exposed to actual irradiation during the delivery. Due to the maximum leaf spread constraint of the MLCs (i.e., the size and range of an MLC are constrained by its mechanical design), IMs whose widths exceed a given threshold value cannot be delivered by the MLC as a whole, and thus must be split into multiple subfields (i.e., subgrids) so that each subfield can be delivered separately by the MLC. In this paper, we present the first efficient algorithm for computing an optimal field splitting that guarantees to minimize the total beam-on time of the resulting subfields subject to a new constraint that the maximum beam-on time of each individual subfield is no larger than a given a threshold value. Our basic idea is to formulate this field splitting problem as a special integer linear programming problem. By considering its dual problem, which turns out to be a shortest path problem on a directed graph with both positive and negative edge weights, we are able to handle efficiently the upper-bound constraint on the allowed beam-on time of each resulting individual subfield. We implement our new field splitting algorithm and give some experimental results on comparing our solutions with those computed by the previous methods.
Generating Box Invariants
Authors: Ashish Tiwari
Venue: Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control (2008)

Box invariant sets are box-shaped positively invariant sets. We show that box invariants are computable for a large class of nonlinear and hybrid systems. The technique for computing these invariants is based on nonlinear constraint solving. This paper also shows that the class of multiaffine systems, which has been used successfully for modeling and analyzing regulatory and biochemical reaction networks, can be generalized to the class of monotone and quasi-monotone systems without losing any of its nice properties.
Deforming a High-Resolution Mesh in Real-Time by Mapping onto a Low-Resolution Physical Model
Authors: Hans Visser, Olivier Comas, David Conlan, Sébastien Ourselin, Josh Passenger, Olivier Salvado
Venue: Proceedings of the 4th international symposium on Biomedical Simulation (2008)

For interactive surgical simulation the physical model of the soft tissue needs to be solved in real-time. This limits the attainable model density to well below the desired mesh density for visual realism. Previous work avoids this problem by using a high-resolution visual mesh mapped onto a low-resolution physical model. We apply the same approach and present an computationally cheap implementation of a known algorithm to avoid texture artefacts caused by the mapping. We also introduce a spline-based algorithm to prevent groups of high-resolution vertices, mapped to the same low-resolution triangle, from exhibiting movements in which the underlying low-resolution structure can be recognised. The resulting mapping algorithm is very efficient, mapping 54,000 vertices in 8.5 ms on the CPU and in 0.88 ms on the GPU. Consequently, the density of the high-resolution visual mesh is limited only by the detail of the CT data from which the mesh was generated.