ppxscal/embedding_network huggingface dataset:
Web Service Modeling Ontology
Authors: Dumitru Roman, Uwe Keller, Holger Lausen, Jos de Bruijn, Rubén Lara, Michael Stollberg, Axel Polleres, Cristina Feier, Cristoph Bussler, Dieter Fensel
Venue: Applied Ontology (2005)

The potential to achieve dynamic, scalable and cost-effective marketplaces and eCommerce solutions has driven recent research efforts towards so-called Semantic Web Services that are enriching Web services with machine-processable semantics. To this end, the Web Service Modeling Ontology (WSMO) provides the conceptual underpinning and a formal language for semantically describing all relevant aspects of Web services in order to facilitate the automatization of discovering, combining and invoking electronic services over the Web. In this paper we describe the overall structure of WSMO by its four main elements: ontologies, which provide the terminology used by other WSMO elements, Web services, which provide access to services that, in turn, provide some value in some domain, goals that represent user desires, and mediators, which deal with interoperability problems between different WSMO elements. Along with introducing the main elements of WSMO, we provide a logical language for defining formal statements in WSMO together with some motivating examples from practical use cases which shall demonstrate the benefits of Semantic Web Services.
Helping Software Engineers Reusing UML Class Diagrams
Authors: Paulo Gomes, Pedro Gandola, Joel Cordeiro
Venue: Proceedings of the 7th international conference on Case-Based Reasoning: Case-Based Reasoning Research and Development (2007)

Software development is a knowledge-intensive task, with an increasing demand for higher productivity. During the design phase, the use of visual modelling languages like UML (Unified Modeling Language) are wide spread across the software industry. In this paper we present a CBR tool that helps the software engineers to reuse UML diagrams. We describe our system, REBUILDER UML, and present experimental work showing that our system decreases the number of errors made by software engineers during the design of UML diagrams.
Automatic Tag Suggestion Based on Resource Contents
Authors: Bruno Oliveira, Pável Calado, H. Sofia Pinto
Venue: Proceedings of the 16th international conference on Knowledge Engineering: Practice and Patterns (2008)

Although social tagging systems are becoming increasingly popular, tagging is still usually a manual process. When publishing on a social tagging system, the user is asked for the tags he wishes to assign to the resource being made available. In this paper, we present an automatic tag suggester, Tess. Our system makes recommendations based only on the textual contents of the resource and is independent of existing tags, thus allowing the emergence of novel tags. The system was evaluated by a group of users and statistical measures were applied to infer its performance. Results show that the system is not only able to suggest many useful tags, but also to discover new and relevant tags, not suggested by any of the human users.
Evaluating forecasting performance for interval data
Authors: Hui-Li Hsu, Berlin Wu
Venue: Computers Mathematics with Applications (2008)

From the overlapping parts and the non-overlapping parts of the actual intervals and the forecast intervals, it should be defined a criterion which is more efficient to evaluate forecasting performance for interval data. In this paper, we present evaluation techniques for interval time series forecasting. The forecast results are compared by the mean squared error of the interval, mean relative interval error and mean ratio of exclusive-or. Simulation and empirical studies show that our proposed evaluation techniques for interval forecasting can provide a more objective decision space in interval forecasting to policymakers.
An Adaptive GP Strategy for Evolving Digital Circuits
Authors: Mihai Oltean, Laura Dioşan
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

The aim of this research is to develop an adaptive system for designing digital circuits. The investigated system, called Adaptive Genetic Programming (AdGP) contains most of the features required by an adaptive GP algorithm: it can decide the chromosome depth, the population size and the nodes of the GP tree which are the best suitable to provide the desired outputs. We have tested AdGP algorithm by solving some well-known problems in the field of digital circuits. Numerical experiments show that AdGP is able to perform very well on the considered test problems being able to successfully compete with standard GP having manually set parameters.
BDI Model-Based Crowd Simulation
Authors: Kenta Cho, Naoki Iketani, Masaaki Kikuchi, Keisuke Nishimura, Hisashi Hayashi, Masanori Hattori
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

We present a new approach for crowd simulation in which a BDI (Belief-Desire-Intention) model is introduced that makes it possible for a character in a simulated environment to work adaptively. Our approach allows the character to realize realistic behavior by adapting its action with the sensed information in a changing environment. We implemented a demo system simulating the BDI model-based NPCs that extinguishes a forest fire with a 3D game engine, Source Engine. We measured the performance to evaluate the scalability and the bottleneck of the system.
On the Run-Time Dynamics of a Peer-to-Peer Evolutionary Algorithm
Authors: Juan L. Laredo, Agoston E. Eiben, Maarten Steen, Juan J. Merelo
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

In this paper we propose an improvement on a fully distributed Peer-to-Peer (P2P) Evolutionary Algorithm (EA) based on autonomous selection. Autonomous selection means that individuals decide on their own state of reproduction and survival without any central control, using instead estimations about the global population state for decision making. The population size varies at run-time as a consequence of such a decentralized reproduction and death of individuals. In order to keep it stable, we propose a self-adjusting mechanism which has been shown successful in three different search landscapes. Key are the estimations about fitness and size of the population as provided by a gossiping algorithm. Such an algorithm requires several rounds to collect the information while the individuals have to wait for synchronization. As an improvement, we propose a completely asynchronous EA which does not need waiting times. The results show that our approach outperforms quantitatively the execution time of the synchronous version.
An improved CMOS error amplifier design for LDO regulators in communication applications
Authors: Xinquan Lai, Donglai Xu
Venue: Proceedings of the 7th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications (2008)

A new CMOS error amplifier, which is primarily used in LDO regulators for communication applications, is presented in this paper. Using the structure of symmetrical OTA, dynamic frequency compensation and nested Miller compensation, the characteristics and performance of the designed amplifier have been significantly improved. The simulation results based on Hynix 0.5µm CMOS models show that across a wide frequency range, the gain of the amplifier is greater than 60dB, and the PSRR and CMRR reach 65dB and 70dB, respectively.
Storage Encryption: A Cryptographer's View
Authors: Shai Halevi
Venue: Proceedings of the 6th international conference on Security and Cryptography for Networks (2008)

Encryption is the bread-and-butter of cryptography, with well-established notions of security and a large variety of schemes to meet these notions. So what is left for researchers in cryptography to look at when it comes to encrypting storage? In this talk I will cover cryptography issues that arise when introducing encryption to real-world storage systems, with some examples drawn from the work of the IEEE 1619 standard committee that deals with standardizing aspects of storage encryption. The issues that I plan to touch upon include:Encryption Schemes and Modes-of-Operation: The use of "authenticated" vs. "transparent" encryption, "wide block" vs. "narrow block" transparent encryption modes, and other considerations.Issues with Key-Management and IV-Management: How to avoid nonce collision when your nonces are only 96-bit long, why you may want to use deterministic encryption for key-wrapping, what is the difference between key-wrapping and KEM/DEM, and related questions.Self-Encryption of Keys: Can an encryption scheme remain secure when used to encrypt its own secret key? It turns out that this requirement sometimes comes up when encrypting storage. I will talk about several aspects of this problem, including the not-so-bad, the bad, and the ugly.
LogView: Visualizing Event Log Clusters
Authors: Adetokunbo Makanju, Stephen Brooks, A. Nur Zincir-Heywood, Evangelos E. Milios
Venue: Proceedings of the 2008 Sixth Annual Conference on Privacy, Security and Trust (2008)

Event logs or log files form an essential part of any network management and administration setup. While log files are invaluable to a network administrator, the vast amount of data they sometimes contain can be overwhelming and can sometimes hinder rather than facilitate the tasks of a network administrator. For this reason several event clustering algorithms for log files have been proposed, one of which is the event clustering algorithm proposed by Risto Vaarandi, on which his Simple Log file Clustering Tool (SLCT) is based. The aim of this work is to develop a visualization tool that can be used to view log files based on the clusters produced by SLCT. The proposed visualization tool, which is called LogView, utilizes treemaps to visualize the hierarchical structure of the clusters produced by SLCT. Our results based on different application log files show that LogView can ease the summarization of vast amount of data contained in the log files. This in turn can help to speed up the analysis of event data in order to detect any security issues on a given application.
Active Open Learner Models as Animal Companions: Motivating Children to Learn through Interacting with My-Pet and Our-Pet
Authors: Zhi-Hong Chen, Chih-Yueh Chou, Yi-Chan Deng, Tak-Wai Chan
Venue: International Journal of Artificial Intelligence in Education (2007)

This pilot study reports how to portray open learner models as animal companions in order to motivate children to learn in the digital classroom environment. To meet two challenges of motivation and interactivity for open learner models, the concept of open learner models as animal companions is proposed based on the emotional attachment of humans towards pets. Animal companions adopt three strategies and play various educational roles to help children's learning in motivation, reflection and member interactions. A class of students is divided into several teams. A student keeps her own individual animal companion, called My-Pet, which holds the open learner model of the student, and each team has a team animal companion, called Our-Pet, which owns their open group learner model. A preliminary experiment is conducted in a fifth-grade class with 31 eleven year old students in an elementary school to collect initial feedback in cognitive and affective aspects.
Concepts for Autonomous Control Flow Checking for Embedded CPUs
Authors: Daniel Ziener, Jürgen Teich
Venue: Proceedings of the 5th international conference on Autonomic and Trusted Computing (2008)

In this paper, we introduce new concepts and methods for checking the correctness of control flow instructions during the execution of programs in embedded CPUs. Detecting and avoiding the execution of faulty control flow instructions is a problem of growing importance w.r.t. reliability and security. On the other hand, hardware cost overheads and an easy integration into the design flow are of utmost important for cost sensitive embedded systems. Our proposed methodology is able to monitor all direct jumps and branches as well as calls and returns form subroutines autonomously during program execution. Furthermore, we propose and evaluate an implementation of an autonomous checker unit which is closely coupled to the processor and can detect and even avoid the execution of a faulty control flow instruction. Upon detection of a faulty instruction, we propose a method to refetch and reexecute the incorrect jump or branch instruction. Other benefits of this novel approach are that the application code must not be changed or augmented by signatures or additional instructions, and that there is no measurable performance impact in terms of execution latency. From the user point of view, our approach is completely transparent to a program developer.
Copeland voting: ties matter
Authors: Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

We study the complexity of manipulation for a family of election systems derived from Copeland voting via introducing a parameter &alpha; that describes how ties in head-to-head contests are valued. We show that the thus obtained problem of manipulation for unweighted Copeland&alpha; elections is NP-complete even if the size of the manipulating coalition is limited to two. Our result holds for all rational values of &alpha; such that 0 < &alpha; < 1 except for &alpha; = 1/2. Since it is well known that manipulation via a single voter is easy for Copeland, our result is the first one where an election system originally known to be vulnerable to manipulation via a single voter is shown to be resistant to manipulation via a coalition of a constant number of voters.
Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
Authors: Peng Liu, Lixin Tang
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

This paper considers the two-agent scheduling problems with linear deteriorating jobs to be processed on a single machine. By a deteriorating job we mean that the processing time of the job is a function of its starting time. Two agents compete for the usage of a common single machine and each agent has his own criterion to optimize. There are four objective functions: makespan, maximum lateness, maximum cost, and total completion time. Some basic properties of two different scheduling problems to minimize the objective function for one agent with a constraint on the other agent's objective function are proved. Based on these properties, the optimal algorithms with polynomial time are presented for two different scheduling problems, respectively.
KPC-Toolbox: Simple Yet Effective Trace Fitting Using Markovian Arrival Processes
Authors: Giuliano Casale, Eddy Z. Zhang, Evgenia Smirni
Venue: Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems (2008)

We present the KPC-Toolbox, a collection of MATLAB scripts for fitting workload traces into Markovian Arrival Processes (MAPs) in an automatic way. We first present detailed sensitivity analysis that builds intuition on which trace descriptors are most important for queueing. This sensitivity analysis stresses the importance of matching higher-order correlations (i.e., joint moments) of the process inter-arrival times rather than higher order moments of the distribution and provides guidance on the relative importance of different descriptors on queueing. Given that the MAP parameterization space can be very large, we focus on first determining the order of the smallest MAP that can fit the trace well, using the Bayesian Information Criterion (BIC) for determining the best order-accuracy tradeoff. Having determined the order of the target MAP, the KPC-Toolbox automatically derives a MAP that captures accurately the most essential features of the trace. Extensive experimentation illustrates the effectiveness of the KPC-Toolbox in fitting traces that are well-documented in the literature as very challenging to fit, showing that the KPC-Toolbox provides a simple and powerful solution to fitting accurately trace data into MAPs.
A Self-Organising Environment for Evolving Business Activities
Authors: A. Razavi, S. Moschoyiannis, P. Krause
Venue: Proceedings of the 2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008) (2008)

In this paper we are concerned with providing support for business activities in moving from value chains to value networks. We describe a fully distributed P2P architecture which reflects the dynamics of business processes that are not governed by a single organisation. The temporary virtual networks of long-term business transactions are used as the building block of the overall scale-free business network. The design is based on dynamically formed permanent clusters resulting in a topology that is highly resilient to failures (and attacks) and is capable of reconfiguring itself to adapt to changes in business models and respond to global failures of conceptual hubs. This fosters an environment where business communities can evolve to meet emerging business opportunities and achieve sustainable growth within a digital ecosystem.
Efficient Incremental Maintenance of Derived Relations and BLAST Computations in Bioinformatics Data Warehouses
Authors: Gabriela Turcu, Svetlozar Nestorov, Ian Foster
Venue: Proceedings of the 10th international conference on Data Warehousing and Knowledge Discovery (2008)

In the data driven field of bioinformatics, data warehouses have emerged as common solutions to facilitate data analysis. The uncertainty, complexity and change rate of biological data underscore the importance of capturing its evolution. To capture information about our database's evolution, we incorporate a temporal dimension in our data model, which we implement by means of lifespan timestamps attached to every tuple in the warehouse. This temporal information allows us to keep a full history of the warehouse and recreate any past version for purposes of auditing. Equally importantly, this information facilitates the incremental maintenance of the warehouse. We maintain the warehouse incrementally not only for relations derived by applying the standard relational operators but also for computed relations. In particular, we consider computed relations obtained through external BLAST sequence alignment computations, which are often identified as a bottleneck in the integrated warehouse maintenance process. Our experiments with subsets of protein sequences from the NCBI non-redundant database demonstrate at least 10-fold speedups for realistic target space size increases of 1% to 5%.
Profitability Comparison Between Gas Turbines and Gas Engine in Biomass-Based Power Plants Using Binary Particle Swarm Optimization
Authors: P. Reche López, M. Gómez González, N. Ruiz Reyes, F. Jurado
Venue: Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II (2007)

This paper employs a binary discrete version of the classical Particle Swarm Optimization to compare the maximum net present value achieved by a gas turbines biomass plant and a gas engine biomass plant. The proposed algorithm determines the optimal location for biomass turbines plant and biomass gas engine plant in order to choose the most profitable between them. Forest residues are converted into biogas . The fitness function for the binary optimization algorithm is the net present value. The problem constraints are: the generation system must be located inside the supply area, and its maximum electric power is 5 MW. Computer simulations have been performed using 20 particles in the swarm and 50 iterations for each kind of power plant. Simulation results indicate that Particle Swarm Optimization is a useful tool to choose successful among different types of biomass plant technologies. In addition, the comparison is made with reduced computation time (more than 800 times lower than that required for exhaustive search).
EuroPVM/MPI Full-Day Tutorial. Using MPI-2: A Problem-Based Approach
Authors: William Gropp, Ewing Lusk
Venue: Proceedings of the 15th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2008)

MPI-2 introduced many new capabilities, including dynamic process management, one-sided communication, and parallel I/O. Implementations of these features are becoming widespread. This tutorial shows how to use these features by showing all of the steps involved in designing, coding, and tuning solutions to specific problems. The problems are chosen for their practical use in applications as well as for their ability to illustrate specific MPI-2 topics. Complete examples that illustrate the use of MPI one-sided communication, MPI parallel I/O, and hybrid programming with MPI and threads will be discussed and full source code will be made available to the attendees. Each example will include a hands-on lab session; these sessions will also introduce the use of performance and correctness debugging tools that are available for the MPI environment. Guidance on tuning MPI programs will be included, with examples and data from MPI implementations on a variety of parallel systems, including Sun, IBM, SGI, and clusters. Examples in C, Fortran, and C++ will be included. Familiarity with basic MPI usage will be assumed.
A novel device for recognition of human physiological state
Authors: G. G. Shishkin, A. G. Shishkin, I. M. Ageev, V. N. Litvinov, Yu M. Rybin, S. M. Yes'kin
Venue: Proceedings of the 6th WSEAS International Conference on Applied Electromagnetics, Wireless and Optical (2008)

The ability to recognize human psychophysiological state is an important problem. A novel integrated hardware - software setup has been developed to achieve automatic assessment of the affective status of a human. Several signal processing techniques are applied to the collected signals to extract the most relevant features in the physiological responses. The experimental data demonstrate a strong correlation between obtained signals and human physiological states.
SPREADSPACES: Mathematically-Intelligent Graphical Spreadsheets
Authors: Nachum Dershowitz, Claude Kirchner
Venue: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday (2008)

Starting from existing spreadsheet software, like Lotus 1-2-3®, Excel®, or Spreadsheet 2000®, we propose a sequence of enhancements to fully integrate constraint-based reasoning, culminating in a system for reactive, graphical, mathematical constructions. This is driven by our view of constraints as the essence of (spreadsheet) computation, rather than as an add-on tool for expert users. We call this extended computational metaphor, spreadspaces.
Jet Engine Turbine and Compressor Characteristics Approximation by Means of Artificial Neural Networks
Authors: Maciej Ławryńczuk
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II (2007)

This paper is concerned with the approximation problem of the SO-3 jet engine turbine and compressor characteristics. Topology selection of multilayer feedforward artificial neural networks is investigated. Neural models are compared with Takagi-Sugeno fuzzy models in terms of approximation accuracy and complexity.