ppxscal/embedding_network huggingface dataset:
Oblique Support Vector Machines
Authors: Chih-Chia Yao, Pao-Ta Yu
Venue: Informatica (2007)

In this paper we propose a modified framework of support vector machines, called Oblique Support Vector Machines(OSVMs), to improve the capability of classification. The principle of OSVMs is joining an orthogonal vector into weight vector in order to rotate the support hyperplanes. By this way, not only the regularized risk function is revised, but the constrained functions are also modified. Under this modification, the separating hyperplane and the margin of separation are constructed more precise. Moreover, in order to apply to large-scale data problem, an iterative learning algorithm is proposed. In this iterative learning algorithm, three different schemes for training can be found in this literature, including pattern-mode learning, semi-batch mode learning and batch mode learning. Besides, smooth technique is adopted in order to convert the constrained nonlinear programming problem into unconstrained optimum problem. Consequently, experimental results and comparisons are given to demonstrate that the performance of OSVMs is better than that of SVMs and SSVMs.
The Epsilon Transformation Language
Authors: Dimitrios S. Kolovos, Richard F. Paige, Fiona A. Polack
Venue: Proceedings of the 1st international conference on Theory and Practice of Model Transformations (2008)

Support for automated model transformation is essential for realizing a Model Driven Development (MDD) process. However, model transformation is only one of the many tools in a model engineering toolkit. To apply MDD in the large, automated support for a number of additional tasks such as model comparison, merging, validation and model-to-text transformation, is essential. While a number of successful model transformation languages have been currently proposed, the majority of them have been developed in isolation and as a result, they face consistency and integration difficulties with languages that support other model management tasks. We present the Epsilon Transformation Language (ETL), a hybrid model transformation language that has been developed atop the infrastructure provided by the Epsilon model management platform. By building atop Epsilon, ETL is seamlessly integrated with a number of other task-specific languages to help to realize composite model management workflows.
Exploring CA State Space to Synthesize Cellular Automata with Specified Attractor Set
Authors: Sukanta Das, Chandrama Shaw, Biplab K. Sikdar
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

The cellular automaton (CA) with multiple attractors in its state space creates immense interest to devise solutions for pattern classification, pattern recognition, design of associative memory, query processing, etc. This work characterizes the CA state space to explore the essential properties of 1-dimensional nonlinear cellular automata with single cycle attractors. The characterization of pseudo-exhaustive bits (PE bits) is done to uniquely identify the attractor set of such a CA. Theoretical framework thus evolved provides means to synthesize a CA for a given attractor set with specified PE bits.
The Random Oracle Model and the Ideal Cipher Model Are Equivalent
Authors: Jean-Sébastien Coron, Jacques Patarin, Yannick Seurin
Venue: Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology (2008)

The Random Oracle Model and the Ideal Cipher Model are two well known idealised models of computation for proving the security of cryptosystems. At Crypto 2005, Coron et al. showed that security in the random oracle model implies security in the ideal cipher model; namely they showed that a random oracle can be replaced by a block cipher-based construction, and the resulting scheme remains secure in the ideal cipher model. The other direction was left as an open problem, i.e. constructing an ideal cipher from a random oracle. In this paper we solve this open problem and show that the Feistel construction with 6 rounds is enough to obtain an ideal cipher; we also show that 5 rounds are insufficient by providing a simple attack. This contrasts with the classical Luby-Rackoff result that 4 rounds are necessary and sufficient to obtain a (strong) pseudo-random permutation from a pseudo-random function.
Detecting Moving Targets in Ground Clutter Using RBF Neural Network
Authors: Jian Lao, Bo Ning, Xinchun Zhang, Jianye Zhao
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II (2008)

In this paper, a new structure for moving targets detection and characteristics extraction in ground clutter is proposed. This structure combines Radial Basis Function (RBF) neural network, Burg algorithm, and notch filter. After dynamical reconstruction, the RBF network is used to predict the ground clutter. Spectral characteristics of the ground clutter are estimated using the Burg algorithm. We apply notch filter to cancel the interference caused by the ground clutter. Moreover, a hardware platform based on FPGA is also realized for this paper to demonstrate this proposed structure and sufficient details of the hardware platform are discussed. The results of simulation and hardware implementation show that the presented structure has a good performance in processing target signals mixed with the ground clutter.
A Knowledge Plane for Autonomic Context-Aware Wireless Mobile Ad Hoc Networks
Authors: Daniel F. Macedo, Aldri L. Santos, José Marcos Nogueira, Guy Pujolle
Venue: Proceedings of the 11th IFIP/IEEE international conference on Management of Multimedia and Mobile Networks and Services: Management of Converged Multimedia Networks and Services (2008)

Due to the emergence of multimedia context-rich applications and services over wireless networks, networking protocols and services are becoming more and more integrated, thus relying on context and application information to operate. Further, wireless protocols and services have employed information from several network layers and the environment, breaking the layering paradigm. In order to cope with this increasing reliance on knowledge, we propose MANKOP, a middleware for MANETs that instantiates a new networking plane. The Knowledge Plane (KP) is a distributed entity that stores and disseminates information concerning the network, its services and the environment, orchestrating the collaboration among cross-layer protocols, autonomic management solutions and context-aware services. We use MANKOP to support the autonomic reconfiguration of a P2P network over MANETs. Simulation results show that the MANKOP-enabled solution is applicable to more scenarios than the classic approaches, as the network adapts its query dissemination strategy to match the current conditions of the peers.
Design of an Annotation Tool to Support Simulation Training of Medical Teams
Authors: Klas Karlgren, Anders Dahlström, Sari Ponzer
Venue: Proceedings of the 3rd European conference on Technology Enhanced Learning: Times of Convergence: Technologies Across Learning Contexts (2008)

The design of an educational tool for training observational skills of medical practitioners is presented. Using simulators is becoming more and more frequent in the training of medical teams and as a part of such training video often plays an important role providing a way of showing, in retrospect, what happened during critical incidents. Learning to identify and analyze teamwork in critical care is difficult and our objective has been to create a tool to train participants in such skills rather than developing yet another tool for researchers or specially trained observers. The tool is a simple annotation tool for letting users mark problematic and good team behavior which visualizes annotations on a timeline. One central idea is that individual annotations are shown collectively thereby visualizing possible differences and gaps in different users' observations.
A Modified Van der Waerden Algorithm to Decompose Algebraic Varieties and Zero-Dimensional Radical Ideals
Authors: Jia Li, Xiao-Shan Gao
Venue: Computer Mathematics: 8th Asian Symposium, ASCM 2007, Singapore, December 15-17, 2007. Revised and Invited Papers (2008)

In this paper, we introduce a modified Van der Waerden algorithm to decompose a variety into the union of irreducible varieties. We give an effective representation for irreducible varieties obtained by the algorithm, which allows us to obtain an irredundant decomposition easily. We show that in the zero dimensional case, the polynomial systems for the irreducible varieties obtained in the Van der Waerden algorithm generate prime ideals. As a consequence, we have an algorithm to decompose the radical ideal generated by a finite set of polynomials as the intersection of prime ideals and the degree of the polynomials in the computation is bounded by O(d n ) where d is the degree of the input polynomials and n is the number of variables.
The Engineering Workstation. A User's Perspective
Authors: John Fisher, Joseph Halford
Venue: IEEE Computer Graphics and Applications (1984)

Pilot tests seem to be proving that a large corporate design group has solved its engineering workstation needs by custom-tailoring a sophisticated micro.
Brief Communication: Molecular and phylogenetic analysis of a novel family of fibrinogen-related proteins from mosquito Aedes albopictus cell line
Authors: Rajnikant Dixit, Upal Roy, Millind S. Patole, Yogesh S. Shouche
Venue: Computational Biology and Chemistry (2008)

Since lectins have been proposed to function as non-self recognizing molecules, it is important to access the specificity and diversity of lectin molecules that play an important role as pattern recognition receptors (PRRs). Like vertebrates, several lectins containing fibrinogen-like (FBG) domains have been reported as PRRs from different invertebrate species, however, in case of mosquito, very little information is available. In this study, we report identification and characterization of a novel family of fibrinogen-related proteins which exhibits (43-68%) similarities to that of A. gambiae FREPs, isolated from the immune challenged cell line of mosquito Aedes albopictus. Analysis of the longest (790bp) cDNA (AF-1) appears to encode a 263 deduced amino acid sequence that contains a C-terminal fibrinogen-like domain. Amino acid sequence similarity and phylogenetic analysis showed a high degree of conservation with other known insect fibrinogen-related proteins, suggesting that mosquito A. albopictus FREPs may play a similar role in an innate immunity as pattern recognition receptor molecules; however, further characterization is needed to understand their transcriptional regulation and behavior during microbial infection.
Managing Uncertainty in Schema Matcher Ensembles
Authors: Anan Marie, Avigdor Gal
Venue: Proceedings of the 1st international conference on Scalable Uncertainty Management (2007)

Schema matching is the task of matching between concepts describing the meaning of data in various heterogeneous, distributed data sources. With many heuristics to choose from, several tools have enabled the use of schema matcher ensembles, combining principles by which different schema matchers judge the similarity between concepts. In this work, we investigate means of estimating the uncertainty involved in schema matching and harnessing it to improve an ensemble outcome. We propose a model for schema matching, based on simple probabilistic principles. We then propose the use of machine learning in determining the best mapping and discuss its pros and cons. Finally, we provide a thorough empirical analysis, using both real-world and synthetic data, to test the proposed technique. We conclude that the proposed heuristic performs well, given an accurate modeling of uncertainty in matcher decision making.
Distributed Director Facilitator in a Multiagent Platform for Networked Embedded Controllers
Authors: Omar J. Orozco, Jose L. Lastra
Venue: Proceedings of the 3rd international conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing (2007)

FIPA-compliant agent platforms must include an Agent Management System, an Agent Communication Channel and a Director Facilitator (DF). The DF is centralized and it administers a register of agents which previously had been registered. Every agent could perform a search for an agent(s) that has specific characteristics or provides a determined service. A centralized DF is a potential point of failure and could cause network overload. The DFs could be distributed through the networked embedded controllers. This paper describes the development of a Distributed Director Facilitator (DDF) which keeps a local register of service providers including the name of the agents and the services provided, this means that every controller could have its own DDF, and agents hosted within a controller could query over the list of service providers.
Head Pose Estimation Based on Tensor Factorization
Authors: Wenlu Yang, Liqing Zhang, Wenjun Zhu
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

This paper investigates head pose estimation problem which is considered as front-end preprocessing for improving multi-view human face recognition. We propose a computational model for perceiving head poses based on the Non-negative Multi-way Factorization (NMWF). The model consists of three components: the tensor representation for multi-view faces, feature selection and head pose perception. To find the facial representation basis, the NMWF algorithm is applied to the training data of facial images. The face tensor includes three factors of facial images, poses, and people. The former two factors are used to construct the computational model for pose estimation. The discriminative measure for perceiving the head pose is defined by the similarity between tensor basis and the representation of testing facial image which is projection of faces on the subspace spanned by the basis "TensorFaces". Computer simulation results show that the proposed model achieved satisfactory accuracy for estimating head poses of facial images in the CAS-PEAL face database.
Investigating Two Different Approaches for Encrypted Traffic Classification
Authors: Riyad Alshammari, A. Nur Zincir-Heywood
Venue: Proceedings of the 2008 Sixth Annual Conference on Privacy, Security and Trust (2008)

The basic objective of this work is to compare the utility of an expert driven system and a data driven system for classifying encrypted network traffic,specifically SSH traffic from traffic log files. Pre-processing is applied to the traffic data to represent as traffic flows. Results show that the data driven system approach outperforms the expert driven system approach in terms of high detection and low false positive rates.
On Minimizing the Position Error in Label Ranking
Authors: Eyke Hüllermeier, Johannes Fürnkranz
Venue: Proceedings of the 18th European conference on Machine Learning (2007)

Conventional classification learning allows a classifier to make a one shot decision in order to identify the correct label. However, in many practical applications, the problem is not to give a single estimation, but to make repeated suggestions until the correct target label has been identified. Thus, the learner has to deliver a label ranking, that is, a ranking of all possible alternatives. In this paper, we discuss a loss function, called the position error, which is suitable for evaluating the performance of a label ranking algorithm in this setting. Moreover, we introduce "ranking through iterated choice", a general strategy for extending any multi-class classifier to this scenario, and propose an efficient implementation of this method by means of pairwise decomposition techniques.
Specification and Verification of Artifact Behaviors in Business Process Models
Authors: Cagdas E. Gerede, Jianwen Su
Venue: Proceedings of the 5th international conference on Service-Oriented Computing (2007)

SOA has influenced business process modeling and management. Recent business process models have elevated data representation to the same level as control flows, for example, the artifact-centric business process models allow the life cycle properties of artifacts (data objects) to be specified and analyzed. In this paper, we develop a specification language ABSL based on computation tree logic for artifact life cycle behaviors (e.g., reachability). We show that given a business model and starting configuration, it can be decided if an ABSL sentence is satisfied when the domains are bounded, and if an ABSL-core (sublanguage of ABSL) sentence is satisfied when the domains are totally ordered but unbounded. We also show that if the starting configuration is not given, ABSL(-core) is still decidable if the number of artifacts is bounded with bounded (resp. unbounded but ordered) domains.
OGC® Sensor Web Enablement: Overview and High Level Architecture
Authors: Mike Botts, George Percivall, Carl Reed, John Davidson
Venue: GeoSensor Networks: Second International Conference, GSN 2006, Boston, MA, USA, October 1-3, 2006, Revised Selected and Invited Papers (2008)

The Open Geospatial Consortium (OGC) standards activities that focus on sensors and sensor networks comprise an OGC focus area known as Sensor Web Enablement (SWE). Readers interested in greater technical and architecture details can download the OGC SWE Architecture Discussion Paper titled "The OGC Sensor Web Enablement Architecture" (OGC document 06-021r1).
Multi-agent Cooperative Planning and Information Gathering
Authors: Fariba Sadri
Venue: Proceedings of the 11th international workshop on Cooperative Information Agents XI (2007)

In this paper we propose a multi-agent architecture, made of co-operative information agents, where agents can share with one another their knowledge of the environment and expertise in planning for achieving goals. In particular we consider how through communication such agents can incrementally learn partial and full plans. Such information exchange is particularly useful in the case of situated agents which have diverse abilities and expertise and which have partial views of their environments. It is also useful in the case of agent systems where agents collaborate towards achieving joint or individual goals. We describe an agent model based on abductive logic programming and give detailed protocols and policies of communication. We then define formally what it means for such information exchanges to be effective, and prove results regarding termination and effectiveness of dialogues based on the formalized policies.
Toward Multi-disciplinary Model-Based (Re)Design of Sustainable User Interfaces
Authors: Jan Bergh, Mieke Haesen, Kris Luyten, Sofie Notelaers, Karin Coninx
Venue: Interactive Systems. Design, Specification, and Verification: 15th International Workshop, DSV-IS 2008 Kingston, Canada, July 16-18, 2008 Revised Papers (2008)

This paper reports on our experience in using the MuiCSer process framework for the redesign of the user interface for operating an industrial digital printing system. MuiCSer is created to support the user-centered interface design of new and legacy systems by a multi-disciplinary team. The process framework is created to enhance increased flexibility, usability and sustainability of the designed user interfaces. Resulting user interfaces are decoupled from the application logic, but still help to maintain consistency with the available functionality even when this changes over time. This report focuses on the usage of the task model during the analysis of the current user interface, the creation of user interface prototypes at various fidelity levels and the still ongoing realization of a flexible user interface management system to support future changes of the deployed user interfaces.
Optimization of Face Relevance Maps with Total Classification Error Minimization
Authors: Michal Kawulok
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

This paper presents a concept of optimizing parameters used for solving image identification tasks developed during research aimed at improving recognition of human face images. Effectiveness of closed-set identification is measured in a form of Total Classification Error (TCE) which can be expressed as a function of parameters used for calculating similarity between samples. TCE can be minimized for a defined training set in order to obtain optimal values of the parameters. This method was implemented to optimize face relevance maps applied to improve the Eigenfaces method for human face recognition. Results of the experiments presented in this paper confirm effectiveness of the developed approach. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A study of project scheduling optimization using Tabu Search algorithm
Authors: Nai-Hsin Pan, Po-Wen Hsaio, Kuei-Yen Chen
Venue: Engineering Applications of Artificial Intelligence (2008)

The research will focus on investigating a more efficient alternative to solve resource-constrained project scheduling problems (RCPSP). Also, instead of using traditional Tabu Search (TS) algorithm and the other Artificial Intelligence (AI)-based heuristic approaches, this research develops an improved TS model by modifying the way of finding a starting solution instead of traditional TS algorithm to solve the problems described above. The model can effectively provide better results in reducing project duration for solving RCPSP compared to traditional TS-based search techniques and Artificial Intelligence (AI)-based approaches. The paper suggests the optimum parameters' setting values for the models the paper presented through sensitivity analysis to obtain better solution quality more easily. Also, the method the paper presented provides a good user interface linking with existing commercial software systems to help for the practitioner in the application of project management in the real world.
Extreme inaccuracies in Gaussian Bayesian networks
Authors: Miguel A. Gómez-Villegas, Paloma Maín, Rosario Susi
Venue: Journal of Multivariate Analysis (2008)

To evaluate the impact of model inaccuracies over the network's output, after the evidence propagation, in a Gaussian Bayesian network, a sensitivity measure is introduced. This sensitivity measure is the Kullback-Leibler divergence and yields different expressions depending on the type of parameter to be perturbed, i.e. on the inaccurate parameter. In this work, the behavior of this sensitivity measure is studied when model inaccuracies are extreme, i.e. when extreme perturbations of the parameters can exist. Moreover, the sensitivity measure is evaluated for extreme situations of dependence between the main variables of the network and its behavior with extreme inaccuracies. This analysis is performed to find the effect of extreme uncertainty about the initial parameters of the model in a Gaussian Bayesian network and about extreme values of evidence. These ideas and procedures are illustrated with an example.