ppxscal/embedding_network huggingface dataset:
Modeling Ecosystems Using P Systems: The Bearded Vulture, a Case Study
Authors: Mónica Cardona, M. Angels Colomer, Mario J. Pérez-Jiménez, Delfí Sanuy, Antoni Margalida
Venue: Membrane Computing: 9th International Workshop, WMC 2008, Edinburgh, UK, July 28-31, 2008, Revised Selected and Invited Papers (2009)

The Bearded Vulture (Gypaetus barbatus) is an endangered species in Europe that feeds almost exclusively on bone remains of wild and domestic ungulates. In this paper, we present a model of an ecosystem related to the Bearded Vulture in the Pyrenees (NE Spain), by using P systems. The evolution of six species is studied: the Bearded Vulture and five subfamilies of domestic and wild ungulates upon which the vulture feeds. P systems provide a high level computational modeling framework which integrates the structural and dynamic aspects of ecosystems in a comprehensive and relevant way. P systems explicitly represent the discrete character of the components of an ecosystem by using rewriting rules on multisets of objects which represent individuals of the population and bones. The inherent stochasticity and uncertainty in ecosystems is captured by using probabilistic strategies. In order to experimentally validate the P system designed, we have constructed a simulator that allows us to analyze the evolution of the ecosystem under different initial conditions.
Processing probabilistic spatio-temporal range queries over moving objects with uncertainty
Authors: Bruce S. E. Chung, Wang-Chien Lee, Arbee L. P. Chen
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Range queries for querying the current and future positions of the moving objects have received growing interests in the research community. Existing methods, however, assume that an object only moves along an anticipated path. In this paper, we study the problem of answering probabilistic range queries on moving objects based on an uncertainty model, which captures the possible movements of objects with probabilities. Evaluation of probabilistic queries is challenging due to large objects volume and costly computation. We map the uncertain movements of all objects to a dual space for indexing. By querying the index, we quickly eliminate unqualified objects and employ an approximate approach to examine the remaining candidates for final answer. We conduct a comprehensive performance study, which shows our proposal significantly reduces the number of object examinations and the overall cost of the query evaluation.
Declarative Scheduling for Optimally Graceful QoS Degradation
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

This paper introduces a mechanism for optimally graceful QoS degradation in distributed real-time multimedia services, Declarative Scheduling. We assume that for each medium of a multimedia service there are a set of implementations, both with differing resource consumption and provided QoS, thus allowing to exploit both resource-resource and resource-QoS tradeoffs. If the amount of available resources changes, the service may locally adapt without changing the provided QoS by scheduling a different set of implementations with different resource requirements. Should this kind of re-scheduling not be possible, the service may adapt by scheduling implementations with a lower QoS providable with the resources available. In the latter case Declarative Scheduling degrades the QoS optimally, i.e. the difference between the provided QoS and the requested QoS is minimal with respect to the user's preferences. The problem, which implementations to select to minimize the QoS degradation is shown to be a so far unconsidered instance of the NP-complete knapsack problem. A heuristic for this knapsack problem is proposed and shown to be sufficiently efficient and accurate to implement Declarative Scheduling. 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
MediaWiki, 1 edition
Authors: Daniel J. Barrett
Venue: Wikipedia And Beyond (2008)

"A good book! It's a nice overview of wiki editing and administration, with pointers to handy extensions and further online documentation." -Brion Vibber, Chief Technical Officer, Wikimedia Foundation "This book is filled with practical knowledge based on experience. It's not just spouting some party line." -Rob Church, a developer of MediaWiki MediaWiki is the world's most popular wiki platform, the software that runs Wikipedia and thousands of other websites. Though it appears simple to use at first glance, MediaWiki has extraordinarily powerful and deep capabilities for managing and organizing knowledge. In corporate environments, MediaWiki can transform the way teams write and collaborate. This comprehensive book covers MediaWiki's rich (and sometimes subtle) features, helping you become a wiki expert in no time. You'll learn how to: Find your way around by effective searching and browsing Create and edit articles, categories, and user preferences Use advanced features for authors, such as templates, dynamic lists, logical parser functions, and RSS, to organize and maintain large numbers of articles Install and run your own wiki, and configure its look and behavior Develop custom wiki features, called extensions, with the PHP programming language and MySQL database This book also provides special guidance for creating successful corporate wikis. For beginners who want to create or work on collaborative, community-driven websites with this platform, MediaWiki is the essential one-stop guide. "I was a MediaWiki newbie before reading this book. Now, many aspects of the platform that were murky before are crystal clear." -JP Vossen, author of O'Reilly's Bash Cookbook
A Hybrid Method for Integrating Multiple Ontologies
Authors: Trong Hai Duong, Ngoc Thanh Nguyen, Geun Sik Jo
Venue: Cybernetics and Systems (2009)

While there has been a variety of research focusing on ontology integration based on simple techniques (e.g., element-or structure-level techniques), the hybrid approaches combining the simple techniques have not been explored. In this paper we describe a hybrid method to integrate multiple ontologies in several levels, such as the element level, internal structure, and relational structure. A semantic supporting environment (SSE) combining special domains (e.g., WordNet) and text corpus are defined in the proposed approach. An enriched ontology model (EOM) has been proposed to reduce the initial complexity of the process of ontology integration. Subsequently, the semantic network called OnConceptSNet is provided. The relations between the concepts in the OnConceptSNet are derived from the SSE. An enhanced algorithm (EA) has been proposed to enhance OnConceptSNet.
Enterprise Communications Platform Support for Integrated Location-Based Applications
Authors: John Buford, Xiaotao Wu, Ratan Bajpai, S. Karthikeyan, Venkatesh Krishnaswamy
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

Location-based services can be used by enterprises to enhance the customer experience and improve workforce operational efficiency. The focus of our work is to provide a scalable architecture for location-based services which integrates into the enterprise communications platform to support new types of converged communications services involving real-time location processing. Unlike prior work in location servers and middleware, we separate application-level processing and raw location event stream processing into two separate components. We show analytically that this leads to performance advantage. By leveraging existing event driven architecture technologies, our approach integrates with the enterprise event bus, is highly scalable, and permits other real-time event streams to be used by location-based applications. We have implemented a prototype to demonstrate the generality and validity of this approach.
Turing's Imitation Game: Still an Impossible Challenge for All Machines and Some Judges------An Evaluation of the 2008 Loebner Contest
Authors: Luciano Floridi, Mariarosaria Taddeo, Matteo Turilli
Venue: Minds and Machines (2009)

An evaluation of the 2008 Loebner contest
Critical success factors for implementing knowledge based models for electronic public services (EPS)
Authors: Seyed Kamal Vaezi
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

To date, identifying barriers and Critical Success Factors (CSFs) and integrating knowledge-based models for the application and implementation of Electronic Public Services (EPS) have not been systematically investigated. These models are creative and systematic methods undertaken by governments to enhance policy quality and administrative services based on e-Government. This paper aims to review these models and investigate related critical success factors. In this work, the different models were revived and their limitations were identified. By integrating and adding some new factors, we discussed about the 9 CSFs which are considered more useful for implementing EPS based on knowledge management systems which focus on the management of information resources. The objective of this paper is to show how EPS can follow path for achieving the needs for establishing Knowledge-Based Management System (KBMS) in this domain. The final set of CSFs and the integrated model show they can act as a list of items and an easy method for modeling EPS based on a knowledge focused system.
An Unmanned Surface Vehicle for Multi-mission Applications
Authors: Jianhua Wang, Wei Gu, Jianxin Zhu, Jubiao Zhang
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

This paper presents an Unmanned Surface Vehicle (USV) for multi-mission applications. A small catamaran equipped with remotely operated system based on wireless local area network is developed and used as a universal platform. Outfitted with different appliances and instruments, the USV is tested for various applications including harbor surveillance, water quality sampling, hydrologic survey, maritime search and rescue. Experiments show that the USV is applicable.
Adobe Acrobat 9 Quick Source Guide
Authors: Quick Source
Venue:  (2008)

Do you need an easy-to-follow software reference right at your fingertips? Our 6 page, tri-fold guides are the answer. These quick reference guides include step by step instructions to help users to learn software features more quickly, as well as full color screen graphics to highlight important features. Quick Source reference guides also include the software program &#44s NEW features and give you quick access to time saving shortcuts. The Adobe Acrobat 9 Quick Source guide is a clear and concise tool for learning the features in Acrobat 9. Features contained in this guide include NEW features such as PDF Portfolios, Comparing Document Versions, Searching Across Multiple Documents, Using the Forms Wizard, and Searching and Redacting Words. It also includes Opening a Document, Using the Navigation Pane, Converting a File to PDF, Creating Page Thumbnails, Adding Multimedia Content, Distributing a Form, Printing a PDF Document, and much more.
Self-Service e-Transactions for Citizens - Concept and Case Study
Authors: Freimut Bodendorf
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

A technical transaction support environment to be used in the field of e-government is introduced. A transaction platform provides electronic services offered by public administration. Citizens can access these services by using smartcards and perform transactions as self-service. A case study focuses on automating enquiries previously handled by the registration office. It shows a sample implementation of secure Internet-based self-service transactions and the potential of process optimization in public services.
Composing Quantum Protocols in a Classical Environment
Authors: Serge Fehr, Christian Schaffner
Venue: Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography (2009)

We propose a general security definition for cryptographic quantum protocols that implement classical non-reactive two-party tasks. The definition is expressed in terms of simple quantum- information-theoretic conditions which must be satisfied by the protocol to be secure. The conditions are uniquely determined by the ideal functionality $\mathcal{F}$ defining the cryptographic task to be implemented. We then show the following composition result. If quantum protocols ¿ 1,...,¿ ¿ securely implement ideal functionalities $\mathcal{F}_1,\ldots,\mathcal{F}_\ell$ according to our security definition, then any purely classical two-party protocol, which makes sequential calls to $\mathcal{F}_1,\ldots,\mathcal{F}_\ell$, is equally secure as the protocol obtained by replacing the calls to $\mathcal{F}_1,\ldots,\mathcal{F}_\ell$ with the respective quantum protocols ¿ 1,...,¿ ¿. Hence, our approach yields the minimal security requirements which are strong enough for the typical use of quantum protocols as subroutines within larger classical schemes. Finally, we show that recently proposed quantum protocols for secure identification and oblivious transfer in the bounded-quantum-storage model satisfy our security definition, and thus compose in the above sense.
A Fast Marching Method for Hamilton-Jacobi Equations Modeling Monotone Front Propagations
Authors: Emiliano Cristiani
Venue: Journal of Scientific Computing (2009)

In this paper we present a generalization of the Fast Marching method introduced by J.A. Sethian in 1996 to solve numerically the eikonal equation. The new method, named Buffered Fast Marching (BFM), is based on a semi-Lagrangian discretization and is suitable for Hamilton-Jacobi equations modeling monotonically advancing fronts, including Hamilton-Jacobi-Bellman and Hamilton-Jacobi-Isaacs equations which arise in the framework of optimal control problems and differential games. We also show the convergence of the algorithm to the viscosity solution. Finally we present several numerical tests comparing the BFM method with other existing methods.
Initial observations on economics, pricing, and penetration of the internet of things market
Authors: Jens-Matthias Bohli, Christoph Sorge, Dirk Westhoff
Venue: ACM SIGCOMM Computer Communication Review (2009)

One expectation about the future Internet is the participation of billions of sensor nodes, integrating the physical with the digital world. This Internet of Things can offer new and enhanced services and applications based on knowledge about the environment and the entities within. Millions of micro-providers could come into existence, forming a highly fragmented market place with new business opportunities to offer commercial services. In the related field of Internet and Telecommunication services, the design of markets and pricing schemes has been a vital research area in itself. We discuss how these findings can be transferred to the Internet of Things. Both the appropriate market structure and corresponding pricing schemes need to be well understood to enable a commercial success of sensor-based services. We show some steps that an evolutionary establishment of this market might have to take.
A new hybrid approach for mining breast cancer pattern using discrete particle swarm optimization and statistical method
Authors: Wei-Chang Yeh, Wei-Wen Chang, Yuk Ying Chung
Venue: Expert Systems with Applications: An International Journal (2009)

Breast cancer is one of the leading causes of death among the women in many parts of the world. In 2007, approximately 178,480 women in the United States have been found to have invasive breast cancer. In this paper, we have developed an efficient hybrid data mining approach to separate from a population of patients who have and who do not have breast cancer. The proposed data mining approach has consists of two phases. In first phase, the statistical method will be used to pre-process the data which can eliminate the insignificant features. It can reduce the computational complexity and speed up the data mining process. In second phase, we proposed a new data mining methodology which based on the fundamental concept of the standard particle swarm optimization (PSO) namely discrete PSO. This phase aimed at creating a novel PSO in which each particle was coded in positive integer numbers and has a feasible system structure. Based on the obtained results, our proposed DPSO can improve the accuracy to 98.71%, sensitivity to 100% and specificity to 98.21%. When compared with the previous research, the proposed hybrid approach shows the improvement in both accuracy and robustness. According to the high quality of our research results, the proposed DPSO data mining algorithm can be used as the reference for making decision in hospital and provide the reference for the researchers.
New schemes of carrier frequency offset estimation for DVB systems
Authors: Youngyoon Lee, Taeung Yoon, Sanghun Kim, Seokho Yoon
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

In this paper, new integer frequency offset estimation schemes are proposed for orthogonal frequency division multiplexing (OFDM)-based digital video broadcasting (DVB) systems. Several pilot-aided integer frequency offset estimation schemes have been proposed for OFDM-based DVB systems. However, the conventional schemes use only some parts of pilot combinations. Thus, in this paper, we propose new integer frequency offset estimation schemes exploiting the additional information of pilot combinations. The simulation results show that the proposed schemes outperform the conventional schemes in terms of the probability of carrier frequency offset estimation failure.
The Reliability Assessment of Legal Reasoning with Evidence Theory
Authors: Ping Wang, Xuemei Zhu
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

There are many evidences for legal reasoning, and the evidence can only support assertion or fact partly. The main job for the jury is to draw the final conclusion with these evidences. To assess and improve the reliability of the final conclusion, the paper proposes a method to fuse the legal evidences based on Dempster-Shafer evidence theory. The method assesses the reliability of evidences at first, and then fuses them with D-S combination evidence theory to draw a final conclusion. The paper expands how to use the method with an example. There are three kinds of evidences in a law case: witness, circumstantial evidence, and authentication, with the introduction of D-S combination theory, three evidences are fused, and then the reliability of the final decision can be assessed.
Algorithm of On-Line Handwriting Signature Verification Based on Discrete Fréchet Distance
Authors: Jianbin Zheng, Xiaolei Gao, Enqi Zhan, Zhangcan Huang
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

A new algorithm for on-line handwriting signature verification is proposed. The algorithm extracts the position coordinates of extreme points of reference signature and test signature in the signature curves, and then uses discrete Fréchet distance as the measure of the curve distance, respectively matching peak points and peak points, and valley points and valley points. Finally, a decision is made to see if the test signature is genuine. A new definition of curve similarity is introduced in the algorithm and a new mathematical model of judging signature curve similarity has been built up on this definition. The algorithm implies shifting and stretching transformation of the signature curves. The experimental results show the efficiency and feasibility of this algorithm.
ARED-CK: an Automated Requirements Elicitation Approach Based on Decision-making with Complete Knowledge
Authors: Lin Liu, Lei Lin
Venue: Proceedings of the 2008 First International Workshop on Managing Requirements Knowledge (2008)

Requirements elicitation, as the first phase of the software life cycle, its importance is becoming more and more prominent. How fast and accurate user requirements can be elicited, is a problem that people wants to solve for a long time. This paper proposes to establish an automated elicitation system based on domain knowledge on user requirements. By gradually perfecting and refining the original requirements description, we can acquire requirements effectively and ultimately improve the quality of requirements and the efficiency of the elicitation process. The decision-making based approach for automated requirements elicitation, ARED-CK, assumes that a fairly complete domain knowledge base is in place, based on which inquiry cycles for eliciting requirements is formulated into a decision-making problem. Through continuous interactions with the user, the requirements decision- making process use requirements models in the domain knowledge base matching with specific instances of requirements model, and ultimately identify a requirements model fit the specific purpose of the target user. Moreover, the paper put forward the proposed decision process for optimization, so that within least steps of user interaction an optimal precise requirements model can be identified.
What Is End-User Software Engineering and Why Does It Matter?
Authors: Margaret Burnett
Venue: Proceedings of the 2nd International Symposium on End-User Development (2009)

End-user programming has become ubiquitous, so much so that there are more end-user programmers today than there are professional programmers. End-user programming empowers--but to do what? Make really bad decisions based on really bad programs? Enter software engineering's focus on quality. Considering software quality is necessary, because there is ample evidence that the programs end users create are filled with expensive errors. In this paper, I consider what happens when we add to end-user programming environments considerations of software quality, going beyond the "create a program" aspect of end-user programming. I describe a philosophy to software engineering for end users, and then survey several projects in this area. A basic premise is that end-user software engineering can only succeed to the extent that it respects the fact that the user probably has little expertise or even interest in software engineering.
A Combination of PSO and Local Search in University Course Timetabling Problem
Authors: Irene Sheau Fen Ho, Deris Safaai, Mohd Hashim Siti Zaiton
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

The university course timetabling problem is a combinatorial optimization problem concerning the scheduling of a number of subjects into a finite number of timeslots in order to satisfy a set of specified constraints. The timetable problem can be very hard to solve, especially when attempting to find a near-optimal solutions, with a large number of instances. This paper presents a combination of particle swarm optimization and local search to effectively search the solution space in solving university course timetabling problem. Three different types of dataset range from small to large are used in validating the algorithm. The experiment results show that the combination of particle swarm optimization and local search is capable to produce feasible timetable with less computational time, comparable to other established algorithms.