ppxscal/embedding_network huggingface dataset:
Introduction to Part I
Authors: Heiner Stuckenschmidt, Christine Parent, Stefano Spaccapietra
Venue: Modular Ontologies: Concepts, Theories and Techniques for Knowledge Modularization (2009)

This part is meant to convey a general introduction to the domain of knowledge modularization. Chapter 1 overviews the issues and the proposed solutions that are relevant to ontology modularization. This chapter is deliberately informal to be accessible to the largest audience, so that readers can quickly get familiar with what will make up the rest of the book. Questions addressed in this initial chapter range from what is a module and how it can be characterized and assessed, to an overview of strategies to build modules and link them whenever needed. Chapters 2 to 4 explore in deeper detail and more formally specific issues that are nevertheless generic in the sense that they can be discussed independently from a specific approach to modularization. Chapter 2 establishes a formal characterization of the concept of module, introducing formal concepts that allow making a clear distinction among different types of modules and different relationships between the modules and the ontologies they come from. Each type of module exhibits different properties in terms of its potential functionalities, so it is important for a module designer to understand exactly how to proceed to get the desired modularity framework. Chapter 3 reports on an experimentation with various modularity techniques in various use case scenarios. Results show significant differences, namely in the size of the modules produced by the modularization techniques. They also provide a feedback on the qualities of the techniques. Next, Chapter 4 investigates how knowledge can be imported into a module from an external source. The aim of the chapter is to establish a clear and sound classification of various import techniques, which again should support designers with ways to choose the most appropriate technique given the goals to be achieved. Finally, Chapter 5 contains the detailed description of the Mads database modularization approach that currently best represents the efforts from the database community in terms of modularization techniques. It also includes, for comparison purposes, a short overview of one of the oldest approaches to modular ontologies, namely the Cyc project. This project represents the main achievement in terms of approaches where the definition and building of the modules and of the ontology they belong to are done in parallel at the same time. A short comparison between Cyc and Mads is also provided.
On Warranted Inference in Possibilistic Defeasible Logic Programming
Authors: Carlos Chesòevar, Guillermo Simari, Lluís Godo, Teresa Alsinet
Venue: Proceeding of the 2005 conference on Artificial Intelligence Research and Development (2005)

Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well the treatment of possibilistic uncertainty and fuzzy knowledge at object-language level. Defeasible argumentation in general and P-DeLP in particular provide a way of modelling non-monotonic inference. From a logical viewpoint, capturing defeasible inference relationships for modelling argument and warrant is particularly important, as well as the study of their logical properties. This paper analyzes a non-monotonic operator for P-DeLP which models the expansion of a given program P by adding new weighed facts associated with warranted literals. Different logical properties are studied and contrasted with a traditional SLD-based Horn logic, providing useful comparison criteria that can be extended and applied to other argumentation frameworks.
Improvements and Performance Evaluation Concerning Synthetic Age Progression and Face Recognition Affected by Adult Aging
Authors: Amrutha Sethuram, Eric Patterson, Karl Ricanek, Allen Rawls
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

Aging of the face degrades the performance of face recognition algorithms. This paper presents recent work in synthetic age progression as well as performance comparisons for modern face recognition systems. Two top-performing, commercial systems along with a traditional PCA-based face recognizer are compared. It is shown that the commercial systems perform better than the baseline PCA algorithm, but their performance still deteriorates on an aged data-set. It is also shown that the use of our aging model improves the rank-one accuracy in these systems.
CMOS voltage reference based on threshold voltage summation
Authors: Wellington Avelino Do Amaral, José Antonio Siqueira Dias,  Wilmar Bueno De Moraes Dias, Wilmar Bueno De Moraes
Venue: Proceedings of the 8th WSEAS international conference on Microelectronics, nanoelectronics, optoelectronics (2009)

The objective of this work is to design a CMOS voltage reference based on threshold voltage summation. An original circuit architecture was used. The circuit uses a threshold voltage extractor, a start-up and an operational amplifier.
Comparisons of Machine Learning Methods for Electricity Regional Reference Price Forecasting
Authors: Ke Meng, Zhaoyang Dong, Honggang Wang, Youyi Wang
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

Effective and reliable electricity price forecast is essential for market participants in setting up appropriate risk management plans in an electricity market. In this paper, we investigate two state-of-the-art statistical learning based machine learning techniques for electricity regional reference price forecasting, namely support vector machine (SVM) and relevance vector machine (RVM). The study results achieved show that, the RVM outperforms the SVM in both forecasting accuracy and computational cost.
WebScylla: a 3D web application to visualise the colonisation of an artificial reef
Authors: Benjamin T. Francis, Robert J. Stone
Venue: Proceedings of the 14th International Conference on 3D Web Technology (2009)

Scylla is Europe's first artificial reef and was created by the scuttling of a former Royal Navy frigate off the UK coast in Cornwall. As well as being a popular attraction for divers, the colonisation of the reef is of great interest to marine biologists. A recent research programme undertaken by the University of Birmingham in conjunction with the National Marine Aquarium (NMA) has delivered an interactive 3D model of the Scylla. The aim of this program is to promote a greater educational and scientific understanding of the fragility of marine ecosystems. In its current form, the Virtual Scylla exists as a "kiosk"-based exhibit, resulting in only limited hands-on access by visitors to the NMA. eXtensible 3D (X3D) is a royalty-free standard which makes it possible to deliver interactive 3D content over the World Wide Web. X3D has previously been used for scientific visualisation in many academic fields. The WebScylla project aims to create an X3D version of the Virtual Scylla which can be delivered over the Web for use as an extensible scientific and educational tool. A web application framework following the Model-View-Controller (MVC) design pattern is used to rapidly develop a 3D web application to visualise colonisation data relating the Scylla reef which is stored in a relational database. AJAX techniques are used to create a highly interactive and responsive user interface to this application using a hybrid of XHTML and X3D components. It is concluded that MVC frameworks can be a powerful tool for the rapid development of 3D web applications and are particularly suited to data-centric applications. Problems encountered and lessons learned include issues in developing effective user interfaces for visualisation tools using interactive computer graphics and a discussion of some limitations of existing X3D implementations.
An active trust model based on zero knowledge proofs for airborne networks
Authors: Kamesh Namuduri
Venue: Proceedings of the 5th Annual Workshop on Cyber Security and Information Intelligence Research: Cyber Security and Information Intelligence Challenges and Strategies (2009)

Trust is a fundamental concept that enables cooperation and collaboration among the nodes in any network. Formal trust models are necessary for sharing information in a collaborative environment. Trust assessment methods that are commonly used in network applications or in social networks passively gather information about other nodes and take significant amount of time for assessing trust. Such models are not convenient for applications such as tactical airborne networks which are typically deployed for short durations of time. This paper presents an active trust model in which the nodes in a network proactively probe other nodes to assess their level of trust before sharing mission specific information. Active trust models are useful for assessing trust within short durations of time making them appropriate for airborne networks. The proposed model is based on zero-knowledge proofs.
A finite volume method parallelization for the simulation of free surface shallow water flows
Authors: A. I. Delis, E. N. Mathioudakis
Venue: Mathematics and Computers in Simulation (2009)

We construct a parallel algorithm, suitable for distributed memory architectures, of an explicit shock-capturing finite volume method for solving the two-dimensional shallow water equations. The finite volume method is based on the very popular approximate Riemann solver of Roe and is extended to second order spatial accuracy by an appropriate TVD technique. The parallel code is applied to distributed memory architectures using domain decomposition techniques and we investigate its performance on a grid computer and on a Distributed Shared Memory supercomputer. The effectiveness of the parallel algorithm is considered for specific benchmark test cases. The performance of the realization measured in terms of execution time and speedup factors reveals the efficiency of the implementation.
Open media service architecture for advanced collaboration environments
Authors: Sang Woo Han, Ju-Won Park, Jongwon Kim
Venue: Multimedia Tools and Applications (2009)

Advanced collaboration environments are extensively utilized for distance learning, e-science, and other distributed global collaboration events. In such environments, high-quality and seamless media services play an important role in improving the quality of user experience to participants. In this paper, to support high-quality media-based services, we design open media service architecture for advanced collaboration environments, by combining the open interface for state-of-the-art media tools, the performance monitoring tools for devices and networks, and application-level adaptation schemes for media streaming. By implementing the proposed architecture on top of an open-source Access Grid (AG) collaboration toolkit, we verify that high-quality collaboration among several collaboration sites can be effectively realized over a multicast-enabled network testbed with improved media quality experience.
SPLAY: distributed systems evaluation made simple (or how to turn ideas into live systems in a breeze)
Authors: Lorenzo Leonini, Étienne Rivière, Pascal Felber
Venue: Proceedings of the 6th USENIX symposium on Networked systems design and implementation (2009)

This paper presents SPLAY, an integrated system that facilitates the design, deployment and testing of large-scale distributed applications. Unlike existing systems, SPLAY covers all aspects of the development and evaluation chain. It allows developers to express algorithms in a concise, simple language that highly resembles pseudocode found in research papers. The execution environment has low overheads and footprint, and provides a comprehensive set of libraries for common distributed systems operations. SPLAY applications are run by a set of daemons distributed on one or several testbeds. They execute in a sandboxed environment that shields the host system and enables SPLAY to also be used on nondedicated platforms, in addition to classical testbeds like PlanetLab or ModelNet. A controller manages applications, offering multi-criterion resource selection, deployment control, and churn management by reproducing the system's dynamics from traces or synthetic descriptions. SPLAY's features, usefulness, performance and scalability are evaluated using deployment of representative experiments on PlanetLab and ModelNet clusters
Using Case-based Reasoning to Control Traffic Consumption
Authors: Markus Schade
Venue:  (2007)

Quality of Service (QoS) is commonly used to shape network traffic to meet specified criteria. The various scenarios include limiting and reserving bandwidth for a particular application, host or user, prioritizing latency sensitive traffic or equal distribution of unreserved bandwidth. There are, however, other applications, such as distributing and controlling a traffic quota. These are very common in shared networks, where QoS provides more sophisticated means than fixed per user limits and simple disconnection after the user reaches the limit. The simplest approach to restrict the bandwidth to a fixed rate is a rather awkward albeit effective solution. The DynShaper software takes a more sophisticated approach to this problem. This book covers the algorithms used by the DynShaper software to create a fair and efficient distribution of a traffic quota in shared networks. 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
Premiere Pro CS3 for Windows and Macintosh: Visual QuickPro Guide, 1st edition
Authors: Antony Bolante
Venue:  (2007)

Here to get filmmakers and digital video pros up to speed on Premiere Pro CS3 - in time to meet their next deadline -is everyone's favorite task-based guide, but geared toward more advanced users. Through step-by-step instructions, enhanced by tips, sidebars, and plenty of visual aids, veteran video editor Antony Bolante shows you how to effectively and efficiently work with audio, create transitions and titles, manipulate subclips and virtual clips, and more. you'll learn about key features with real-world examples of how and when features should be used, including all that's new in Premiere Pro CS3: the ability to build Blu-ray Disc, DVD, and Flash projects with Adobe Encore CS3 (now included with Premiere Pro CS3); Adobe OnLocation CS3, which lets on-the-road users record footage directly to their computer disk--removing the need to capture video to tape later. You will enjoy learning to create slow-motion effects with Time Remapping, and will get up to speed on Premiere's new editing tools.
Adaptive Community Identification on Semantic Social Networks with Contextual Synchronization: An Empirical Study
Authors: Jason J. Jung
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

To support prompt collaborations, an ontology-based social network platform has been proposed to find the most relevant users by context representation (i.e., personal and group contexts) and matching. Consequently, groups can be dynamically organized with respect to the similarities among the personal contexts by context synchronization. Individual users can engage in complex collaborations related to multiple semantics. In this paper, we want to show and discuss the experimental results collected from a collaborative information searching system with context synchronization. Main empirical issues are i) setting thresholds, ii) searching performance, and iii) scalability testing.
Supervised Fuzzy Control of Dissolved Oxygen in a SBR Pilot Plant
Authors: M. F. Teran, J. Colomer, J. Meléndez, J. Colprim
Venue: Proceeding of the 2005 conference on Artificial Intelligence Research and Development (2005)

This work is focused on controlling the Dissolved Oxygen in a SBR pilot plant fed with real wastewater. Two different implementations of Dissolved Oxygen control are presented. On the one hand, an ON/OFF control produces oscillations around the set point, this cycling behavior affects other process variables and makes the supervisory tasks more difficult. On the other hand fuzzy control allows a better Dissolved Oxygen behavior, which means a global process behavior. The results of using both methods are shown and compared.
Adaptation of team-based learning on a first term programming class
Authors: Patricia Lasserre
Venue: ACM SIGCSE Bulletin (2009)

First year computer science programming has always been a challenge for many students as the course expectation is not only for them to be able to understand programming concepts, but also to produce creative solutions to problems. Team-based learning seems a natural solution to increase the amount of practice each student will get, and to increase students' interest and confidence. The initial results of these two years of experimentation with team-based learning suggests that it helps reduce the dropping rate in the class to a reasonable level (10%) and give greater confidence to students in their ability to succeed. In this paper, we present how team-based learning has been adapted for our first semester programming class and we discuss the advantages of this techniques and difficulties encountered.
Information Maximization in a Linear Manifold Topographic Map
Authors: Peyman Adibi, Reza Safabakhsh
Venue: Neural Processing Letters (2009)

This article addresses the problem of unsupervised learning of multiple linear manifolds in a topology preserving neural map. The model finds simple linear estimations of the regions of the unknown data manifold. Each neuron of the map corresponds to a linear manifold whose basis and mean vectors and on- and off-manifold standard deviations must be learnt. The learning rules are derived based on competition between neurons and maximizing an approximation of the mutual information between the input and the output of each neuron. Neighborhood functions are also considered in the learning rules in order to develop the topology preserving property for the map. Considering two special density models for the input data, the optimal nonlinear input/output mappings of the neurons are found. Experimental results show a good performance for the proposed method on synthesized and practical problems compared with other relevant techniques.
Call Admission Control Algorithms in OFDM-based Wireless Multiservice Networks
Authors: Yan Zhang, Yifan Chen, Jianhua He, Cheng-Xiang Wang, Athanasios V. Vasilakos
Venue: Wireless Personal Communications: An International Journal (2009)

Orthogonal frequency division multiplexing (OFDM) is becoming a fundamental technology in future generation wireless communications. Call admission control is an effective mechanism to guarantee resilient, efficient, and quality-of-service (QoS) services in wireless mobile networks. In this paper, we present several call admission control algorithms for OFDM-based wireless multiservice networks. Call connection requests are differentiated into narrow-band calls and wide-band calls. For either class of calls, the traffic process is characterized as batch arrival since each call may request multiple subcarriers to satisfy its QoS requirement. The batch size is a random variable following a probability mass function (PMF) with realistically maximum value. In addition, the service times for wide-band and narrow-band calls are different. Following this, we perform a tele-traffic queueing analysis for OFDM-based wireless multiservice networks. The formulae for the significant performance metrics call blocking probability and bandwidth utilization are developed. Numerical investigations are presented to demonstrate the interaction between key parameters and performance metrics. The performance tradeoff among different call admission control algorithms is discussed. Moreover, the analytical model has been validated by simulation. The methodology as well as the result provides an efficient tool for planning next-generation OFDM-based broadband wireless access systems.
Optimal External Memory Planar Point Enclosure
Authors: Lars Arge, Vasilis Samoladas, Ke Yi
Venue: Algorithmica (2009)

In this paper we study the external memory planar point enclosure problem: Given N axis-parallel rectangles in the plane, construct a data structure on disk (an index) such that all K rectangles containing a query point can be reported I/O-efficiently. This problem has important applications in e.g. spatial and temporal databases, and is dual to the important and well-studied orthogonal range searching problem. Surprisingly, despite the fact that the problem can be solved optimally in internal memory with linear space and O(log&#x2009;N+K) query time, we show that one cannot construct a linear sized external memory point enclosure data structure that can be used to answer a query in O(log&#x2009; B N+K/B) I/Os, where B is the disk block size. To obtain this bound, &#x03a9;(N/B 1&#x2212;&#x03b5; ) disk blocks are needed for some constant &#x03b5;>0. With linear space, the best obtainable query bound is O(log&#x2009;2 N+K/B) if a linear output term O(K/B) is desired. To show this we prove a general lower bound on the tradeoff between the size of the data structure and its query cost. We also develop a family of structures with matching space and query bounds.
Clustering and Sequential Pattern Mining of Online Collaborative Learning Data
Authors: Dilhan Perera, Judy Kay, Irena Koprinska, Kalina Yacef, Osmar R. Zaïane
Venue: IEEE Transactions on Knowledge and Data Engineering (2009)

Group work is widespread in education. The growing use of online tools supporting group work generates huge amounts of data. We aim to exploit this data to support mirroring: presenting useful high-level views of information about the group, together with desired patterns characterizing the behavior of strong groups. The goal is to enable the groups and their facilitators to see relevant aspects of the group's operation and provide feedback if these are more likely to be associated with positive or negative outcomes and indicate where the problems are. We explore how useful mirror information can be extracted via a theory-driven approach and a range of clustering and sequential pattern mining. The context is a senior software development project where students use the collaboration tool TRAC. We extract patterns distinguishing the better from the weaker groups and get insights in the success factors. The results point to the importance of leadership and group interaction, and give promising indications if they are occurring. Patterns indicating good individual practices were also identified. We found that some key measures can be mined from early data. The results are promising for advising groups at the start and early identification of effective and poor practices, in time for remediation.