ppxscal/embedding_network huggingface dataset:
Visualization for biological models, simulation, and ontologies
Authors: Linda Shapiro
Venue:  (2008)

In this dissertation, I present three browsers that I have developed for the purpose of exploring, understanding, and analyzing models, simulations, and ontologies in biology and medicine. The first browser visualizes multidimensional simulation data as an animation. The second browser visualizes the equations of a complex model as a network and puts structure and organization on top of equations and variables. The third browser is an ontology viewer and editor, directly intended for the Foundational Model of Anatomy (FMA), but applicable to other ontologies as well. This browser has two contributions. First, it is a lightweight deliverable that lets someone easily dabble with the FMA. Second, it lets the user edit an ontology to create a view of it. For the ontology browser, I also conduct user studies to refine and evaluate the software.
Constructing Stereotypes for an Adaptive e-Shop Using AIN-Based Clustering
Authors: M. Virvou, A. Savvopoulos, G. A. Tsihrintzis, D. N. Sotiropoulos
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

This paper describes an adaptive electronic video store application that monitors customers' actions and provides dynamic movie recommendation. The adaptive recommendation is formed based on double stereotypes that have been constructed for user modeling. The construction of stereotypes has been based on a novel approach that uses an Immune Network System (INS). In particular, the INS has been applied on data collected from 150 users of an earlier version of the e-commerce application. Specifically, the INS clustered users' interests as well as movies and represented each resulting cluster with corresponding antibodies. The double classification (users' interests --- movies) was performed in a hierarchical way that resulted in several levels of user stereotypes: These stereotypes are then used dynamically by the e-commerce application to infer users' interests in movies based on a small set of observed users' actions.
Formal and Practical Aspects of Implementing Abstract Data Types in the Prolog Instruction
Authors: Bruria Haberman
Venue: Informatica (2008)

Abstract data types constitute a central tool in computer science and play an important role in problem solving, knowledge representation, and programming. In this paper, formal and practical aspects of utilizing abstract data types (ADTs) are discussed in the context of logic programming when using the Prolog programming language. The approach is presented in the following stages: (a) First, alternative ways of implementing ADTs in terms of Prolog constructs are presented and partial encapsulation of ADTs in terms of grey boxes is demonstrated. (b) Next, complete encapsulation of ADTs in terms of black boxes is suggested in a way that strictly reflects the concept's formal computer science definition while taking into consideration the characteristics and constraints of the logic programming paradigm. (c) Finally, implications for instruction are discussed.
Gait Recognition Based on Silhouette, Contour and Classifier Ensembles
Authors: M. Romero-Moreno, J. Fco. Martínez-Trinidad, J. A. Carrasco-Ochoa
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

Gait Recognition is a non-invasive biometric technique for identifying persons through the way they walk. Currently there are many Gait Recognition methods, most of them based on a similarity function. In this paper, we propose two new methods for Gait Recognition based on silhouette and contour, using a classifier ensemble. Experimental results on a public standard database are shown and compared against others Gait Recognition methods.
A Knowledge-Based System for Fashion Trend Forecasting
Authors: Paola Mello, Sergio Storari, Bernardo Valli
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

In this paper, we show how artificial intelligence techniques can be applied for the forecasting of trends in the high creative domain of fashion.We describe a knowledge-based system that, starting from a set of keywords and pictures representing the concepts on which a fashion stylist chooses to base a new collection, is able to automatically create a trend forecast composed by the set of colors that better express these target concepts.In order to model the knowledge used by the system to forecast trends, we experimented Bayesian networks. This kind of model is learned from a dataset of past trends by using different algorithms. We show how Bayesian networks can be used to make the forecast and the experiments made in order to evaluate their performances.
Transitive Reasoning of Before-After Relation Based on Bf-EVALPSN
Authors: Kazumi Nakamatsu, Jair Minoro Abe, Seiki Akama
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

A paraconsistent annotated logic program called bf-EVALPSN has been developed for dealing with before-after relations between processes and applied to real-time process order control. In order to increase the efficiency of bf-EVALPSN process order control, a transitive reasoning system of before-after relations in bf-EVALPSN is introduced.
Simulation and Analysis of DDoS in Active Defense Environment
Authors: Zhongwen Li, Yang Xiang, Dongsheng He
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

Currently there is very few data that can describe the whole profile of a DDoS attack. In this paper, the active DDoS defense system deploys a number of sub-systems, such as Flexible Deterministic Packet Marking (FDPM) and Mark-Aided Distributed Filtering (MADF). In addition, two DDoS tools, TFN2K and Trinoo, are adopted and integrated into SSFNet to create virtual DDoS networks to simulate the attacks. Then, simulation experiments are used to evaluate the performance of the active DDoS defense system. At last, we set up a model to describe the interactions between DDoS attack and defense party, which allows us to have a deep insight of the interactions between the attack and defense parties. Experiment results shows that the model can precisely estimate the defense effectiveness of the system when it encounters attacks.
A New Parallel Multiplier for Type II Optimal Normal Basis
Authors: Chang Han Kim, Yongtae Kim, Sung Yeon Ji, Ilwhan Park
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

In hardware implementation for the finite field, the use of normal basis has several advantages, especially the optimal normal basis is the most efficient to hardware implementation in GF(2 m ). The finite field GF(2 m ) with type I optimal normal basis has the disadvantage not applicable to cryptography since m is even. The finite fields GF(2 m ) with type II optimal normal basis, however, such as GF(2233) are applicable to ECDSA recommended by NIST, and many researchers devote their attentions to efficient arithmetic over them. In this paper, we propose a new type II optimal normal basis parallel multiplier over GF(2 m ) whose structure and algorithm is clear at a glance, which performs multiplication over GF(2 m ) in the extension field GF(22m ). The time and area complexity of the proposed multiplier is the same as the best known type II optimal normal basis parallel multiplier.
Decoding Population Neuronal Responses by Topological Clustering
Authors: Hujun Yin, Stefano Panzeri, Zareen Mehboob, Mathew Diamond
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part II (2008)

In this paper the use of topological clustering for decoding population neuronal responses and reducing stimulus features is described. The discrete spike trains, recorded in rat somatosensory cortex in response to sinusoidal vibrissal stimulations characterised by different frequencies and amplitudes, are first interpreted to continuous temporal activities by convolving with a decaying exponential filter. Then the self-organising map is utilised to cluster the continuous responses. The result is a topologically ordered clustering of the responses with respect to the stimuli. The clustering is formed mainly along the product of amplitude and frequency of the stimuli. Such grouping agrees with the energy coding result obtained previously based on spike counts and mutual information. To further investigate how the clustering preserves information, the mutual information between resulting stimulus grouping and responses has been calculated. The cumulative mutual information of the clustering resembles closely that of the energy grouping. It suggests that topological clustering can naturally find underlying stimulus-response patterns and preserve information among the clusters.
EDIF: The Standard for Workstation Intercommunication
Authors: Esther Marx
Venue: IEEE Micro (1985)

The current version of EDIF, an evolving format for data transfer between CAD/CAE workstations, supports gate array and semicustom IC design. 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
Design and implementation of a QoS-included WiMAX module for NS-2 simulator
Authors: Aymen Belghith, Loutfi Nuaymi
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

WiMAX is a very promising technology. The main promises are the high throughput and the large coverage. As for all new technologies, performance studies are required. The network simulation is considered as a solution to test the performance of technologies and especially the wireless networks. In this paper, we propose a new WiMAX module for NS-2 simulator. This module is based on the NIST implementation of WiMAX [5]. Our contribution consists of the addition of the QoS classes as well as the management of the QoS requirements, unicast and contention request opportunities mechanisms, and scheduling algorithms for the UGS, rtPS and BE QoS classes. Simulation results provide interesting observations about the throughput and mean sojourn time values. Simulation results show that our UGS, rtPS, and BE schedulers are in accordance with the specification of the QoS classes defined in the IEEE 802.16 standard.
Protocol Inference Using Static Path Profiles
Authors: Murali Krishna Ramanathan, Koushik Sen, Ananth Grama, Suresh Jagannathan
Venue: Proceedings of the 15th international symposium on Static Analysis (2008)

Specification inference tools typically mine commonalities among states at relevant program points. For example, to infer the invariants that must hold at all calls to a procedure p requires examining the state abstractions found at all call-sites to p. Unfortunately, existing approaches to building these abstractions require being able to explore all paths (either static or dynamic) to all of p's call-sites to derive specifications with any measure of confidence. Because programs that have complex control-flow structure may induce a large number of paths, naive path exploration is impractical.In this paper, we propose a new specification inference technique that allows us to efficiently explore statically all paths to a program point. Our approach builds static path profiles, profile information constructed by a static analysis that accumulates predicates valid along different paths to a program point. To make our technique tractable, we employ a summarization scheme to merge predicates at join points based on the frequency with which they occur on different paths. For example, predicates present on a majority of static paths to all call-sites of any procedure p forms the pre-condition of p.We have implemented a tool, marga, based on static path profiling. Qualitative analysis of the specifications inferred by marga indicates that it is more accurate than existing static mining techniques, can be used to derive useful specification even for APIs that occur infrequently (statically) in the program, and is robust against imprecision that may arise from examination of infeasible or infrequently occurring dynamic paths. A comparison of the specifications generated using marga with a dynamic specification inference engine based on cute, an automatic unit test generation tool, indicates that marga generates comparably precise specifications with smaller cost.
A new approach to pre-processing digital image for wavelet-based watermark
Authors: Santa Agreste, Guido Andaloro
Venue: Journal of Computational and Applied Mathematics (2008)

The growth of the Internet has increased the phenomenon of digital piracy, in multimedia objects, like software, image, video, audio and text. Therefore it is strategic to individualize and to develop methods and numerical algorithms, which are stable and have low computational cost, that will allow us to find a solution to these problems. We describe a digital watermarking algorithm for color image protection and authenticity: robust, not blind, and wavelet-based. The use of Discrete Wavelet Transform is motivated by good time-frequency features and a good match with Human Visual System directives. These two combined elements are important for building an invisible and robust watermark. Moreover our algorithm can work with any image, thanks to the step of pre-processing of the image that includes resize techniques that adapt to the size of the original image for Wavelet transform. The watermark signal is calculated in correlation with the image features and statistic properties. In the detection step we apply a re-synchronization between the original and watermarked image according to the Neyman-Pearson statistic criterion. Experimentation on a large set of different images has been shown to be resistant against geometric, filtering, and StirMark attacks with a low rate of false alarm.
Automatic Hidden Web Database Classification
Authors: Zhiguo Gong, Jingbai Zhang, Qian Liu
Venue: Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases (2007)

In this paper, a method for automatic classification of Hidden-Web databases is addressed. In our approach, the classification tree for Hidden Web databases is constructed by tailoring the well accepted classification tree of DMOZ Directory. Then the feature for each class is extracted from randomly selected Web documents in the corresponding category. For each Web database, query terms are selected from the class features based on their weights. A hidden-web database is then probed by analyzing the results of the class-specific query. To raise the performance further, we also use Web pages which have links pointing to the hidden-web database (HW-DB) as another important source to represent the database. We combine link-based evaluation and query-based probing as our final classification solution. The experiment shows that the combined method can produce much better performance for classification of hidden Web Databases.
Digital Content Development of Folklore Artifacts and Activities for Folklore Education
Authors: Po-Chou Chan, Ya-Chin Liao, Kuo-An Wang, Hsuan-Hung Lin, Yung-Fu Chen
Venue: Proceedings of the 7th international conference on Advances in Web Based Learning (2008)

Digital preservation of museum artifacts has been widely promoted by governments around the world in recent years. However, the artifacts collected by national or local museums are not very exhaustive. Recently, the collected folklore artifacts accompanied with crafts in how to make them and skills and rituals in how to use them have been digitized in Taiwanese Folklore Museum. In order to supplement insufficiency of artifacts collected by the museum, folklore hobbyists are regularly invited to demonstrate their private collections. At the mean time, the task force of digital preservation team digitizes the artifacts for extending its contents. Another way to aggressively increase the number of digitized contents is to sign cooperation agreements with members of the folklore associations by giving services to digitize their personal collections. After having extended the digital contents, we expect that the website of Taiwanese Folklore Museum will become even more popular for teachers and students, especially in kindergartens and elementary schools, to extract and prepare useful materials for folklore education. In conclusion, the paper presents the digital contents which include folklore artifacts and folklore activities developed in Taiwan Folklore Museum. Additionally, other digital contents developed in other museums or personal collectors can be retrieved by using XML technique. The scheme supplements the insufficiency of national or local museums and provides inter-museum architecture for supporting more complete contents for folklore education.
A Hands-On Approach for Teaching Systematic Review
Authors: Maria Teresa Baldassarre, Nicola Boffoli, Danilo Caivano, Giuseppe Visaggio
Venue: Proceedings of the 9th international conference on Product-Focused Software Process Improvement (2008)

An essential part of a software engineering education is technology innovation. Indeed software engineers, as future practitioners, must be able to identify the most appropriate technologies to adopt in projects. As so, it is important to develop the skills that will allow them to evaluate and make decisions on tools, technologies, techniques and methods according to the available empirical evidence reported in literature. In this sense, a rigorous manner for analyzing and critically addressing literature is Systematic Review. It requires formalizing an answerable research question according to the problem or issues to face; search the literature for available evidence according to a systematic protocol and retrieve data from the identified sources; analyze the collected evidence and use it to support decision making and conclusions. In this paper we report on how Systematic Review has been integrated in the "Empirical Software Engineering Methods" course that is taught at the Department of Informatics at the University of Bari, and how students have been introduced to this type of literature review through a hands-on approach. As far as we know, it is the first attempt of including a complex topic like systematic review in a university course on empirical software engineering. We have no empirical evidence on the effectiveness of the approach adopted, other than practice-based experience that we have acquired. Nonetheless, we have collected qualitative data through a questionnaire submitted to the students of the course. Their positive answers and impressions are a first informal confirmation of the successful application of our strategy.
An Evolutionary Approach for Tuning Artificial Neural Network Parameters
Authors: Leandro M. Almeida, Teresa B. Ludermir
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

The widespread use of artificial neural networks and the difficult work regarding the correct specification (tuning) of parameters for a given problem are the main aspects that motivated the approach purposed in this paper. This approach employs an evolutionary search to perform the simultaneous tuning of initial weights, transfer functions, architectures and learning rules (learning algorithm parameters). Experiments were performed and the results demonstrate that the method is able to find efficient networks with satisfactory generalization in a shorter search time.
PHAL-256 - Parameterized Hash Algorithm
Authors: P. Rodwald, J. Stoklosa
Venue: Proceedings of the 2008 The Fourth International Conference on Information Assurance and Security (2008)

PHAL-256 (Parameterized Hash ALgorithm) is a proposal of a new dedicated hash algorithm designed as an answer to weaknesses of MD/SHA family. Recently proposed attacks on well-known and widely used hash functions motivate a design of new hash functions. In this paper new approach is presented, where a few elements of hash function are parameterized. This approach makes the hash algorithm more secure and more flexible. PHAL-256 consists of two mechanisms: new iteration schema and dedicated compression function.
QGWEngine: A QoS-Aware Grid Workflow Engine
Authors: Yong Wang, Li Wang, Guiping Dai
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

Grid workflow can be executed based on the parameters of some newly introduced non-functional properties such as QoS to satisfy the customer expectations better. Here we propose a QoS-aware grid workflow engine called QGWEngine. First, the supported QoS parameters and the grid workflow model are introduced. Then the architecture of QGWEngine is explained. Finally, the validity of QWGEngine is illustrated through a hypothetical grid workflow example.
First International Workshop on Analysis of Software Product Lines (ASPL'08)
Authors: David Benavides, Antonio Ruiz-Cortés, Don Batory, Patrick Heymans
Venue: Proceedings of the 2008 12th International Software Product Line Conference (2008)

The automation of software product line (SPL) analyses is of growing interest to both practitioners and researchers. In particular, automated analyses of variability models (like feature or decision models) and languages that foster declarative specifications of programs using those models are now common. We note that many of the problems that SPL engineers face are related to configuration problems that have been addressed by the Artificial Intelligence (AI) community. Indeed, the SPL community is using some of their results, e.g., BDD, CSP and SAT solvers.
Synchronization protocols for reliable communication in fully distributed agent systems
Authors: Hywel Dunn-Davies, Jim Cunningham, Shamima Paurobally
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

In order to prevent misunderstandings within groups of interacting agents, it is necessary to ensure that the agents' beliefs regarding the overall state of the interaction are consistent with each other at all times. In [7], Paurobally et al. proposed that these beliefs could be synchronized by adding a specialized protocol layer that incorporates protocols specifically designed to synchronize the agents' beliefs. Here we define the problem that such protocols would need to solve in the worst case, and prove it to be insoluble. We then consider the possibility of synchronizing the beliefs of groups of agents if it is assumed that the communication layer notifies the sender of a message whenever that message is not successfully delivered. Paurobally et al. proved that this assumption allows agents' beliefs to be synchronized in bilateral interactions. However, we prove that this assumption is insufficient to achieve belief synchronization in groups of three or more agents. Finally, we discuss the possibility of achieving adequate synchronization using probabilistic protocols.