ppxscal/embedding_network huggingface dataset:
Universal test sets for logic networks
Authors: Sheldon B. Akers
Venue: Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972) (1972)

This paper examines the problem of finding a single universal test set that will test any of a variety of different implementations of a given switching function. It is shown that, for and/or networks, universal test sets may be found which detect not only all single faults but all multiple faults as well. The minimality and size of these sets are examined and their derivation for incomplete and multiple-output functions is described. The extension of these results to other network types is discussed.
Maximal Margin Estimation with Perceptron-Like Algorithm
Authors: Marcin Korzeń, Przemysław Klęsk
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

In this paper we propose and analyse a ¿-margin generalisation of the perceptron learning algorithm of Rosenblatt. The difference between the original approach and the ¿-margin approach is only in the update step. We consider the behaviour of such a modified algorithm in both separable and non-separable case and also when the ¿-margin is negative. We give the convergence proof of such a modified algorithm, similar to the classical proof by Novikoff. Moreover we show how to change the margin of the update step in the progress of the algorithm to obtain the maximal possible margin of separation. In application part, we show the connection of the maximal margin of separation with SVM methods.
An Image Segmentation Algorithm in Image Processing Based on Threshold Segmentation
Authors: Shiping Zhu, Xi Xia, Qingrong Zhang, Kamel Belloulata
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

Image segmentation is a key technology in image processing, and threshold segmentation is one of the methods used frequently. Aimed at that only one threshold or several thresholds are set in traditional threshold-based segmentation algorithm, it is difficult to extract the complex information in an image, a new segmentation algorithm that each pixel in the image has its own threshold is proposed. In this algorithm, the threshold of a pixel in an image is estimated by calculating the mean of the grayscale values of its neighbor pixels, and the square variance of the grayscale values of the neighbor pixels are also calculated as an additional judge condition, so that the result of the proposed algorithm is the edge of the image. In fact the proposed algorithm is equal to an edge detector in image processing. Experimental results demonstrate that the proposed algorithm could produce precise image edge, while it is reasonable to estimate the threshold of a pixel through the statistical information of its neighbor pixels.
Knowledge Sharing for Supply Chain Management Based on Fuzzy Ontology on the Semantic Web
Authors: Jun Zhai, Yang Li, Qinglian Wang, Miao Lv
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

Knowledge sharing is the basic means to improve the efficiency of Supply Chain Management (SCM). Ontology is the basis of sharing and reusing knowledge on the Semantic Web. Fuzzy ontology is an extension of domain ontology for solving the uncertainty problems. In order to handle fuzzy phenomenon and uncertainty of knowledge in SCM, this paper proposes a series of fuzzy ontology models using intuitionistic fuzzy set that consists of fuzzy domain ontology and fuzzy linguistic variable ontologies. Then, a fuzzy ontology framework is presented, including three parts: concepts, properties of concepts and values of properties. The application, which uses fuzzy ontology to model customer and product knowledge in supply chain, shows that these models can overcome the localization of other fuzzy ontology models, and this research facilitates the fuzzy knowledge sharing and reuse on the Semantic Web.
Effect of die bonding condition for die attach film performance in 3D QFN stacked die
Authors: A. Jalar, M. F. Rosle, M. A. A. Hamid
Venue: Proceedings of the 7th WSEAS International Conference on Microelectronics, Nanoelectronics, Optoelectronics (2008)

Consumer demand for smaller and lighter products in wiresless application with maximum functionality had drive the semiconductor industries toward the developement of 3-dimensional stacked die. One of the key technology is relies on die stacking process. A suitable bonding condition and material set are essential to achieve required reliability performance. This study is to relate the effects of variables bonding parameter on the mechanical adhesion and delamination of the die attach film in QFN stacked die. Samples are deliberately built with nine combination sets of die attach parameters including bonding temperature, force and time to achieve a minimum reliability performance under IPC/JEDEC Moisture Sensitivity Level 3 at reflow 260°C. Characterisation of die attach film was carried out using differential scanning calorimetry whereas it performance was carried out using shear testing machine and scanning acoustic test (SAT) is used to detect the interfacial delamination between DAF and die. The best die attach process is characterized by stable values of die attach film thermal resistance properties and optimum touch area between die/die attach film and die attach film/die.
Iterative Key Based Routing for Web Services Addressing and Discovery
Authors: Marco Milanesio, Giancarlo Ruffo
Venue: Proceedings of the 1st international conference on Autonomous Infrastructure, Management and Security: Inter-Domain Management (2007)

As the nodes and the resources in a structured peer-to-peer network are indexed with unique identifiers, and as the identifiers are assigned to nodes whose nodeId (i.e., the identifier of the peer) is closest (by some metrics) to the identifier, at an application level it is an issue to know the unique identifier a resource is indexed with, to route a message to the node that is responsible for the identifier and thus to retrieve the resource itself. We are studying a way to exploit the features of structured peer-to-peer networks in web services addressing and discovery.
Compliance Control for Biped Walking on Rough Terrain
Authors: Masaki Ogino, Hiroyuki Toyama, Sawa Fuke, Norbert Michael Mayer, Ayako Watanabe, Minoru Asada
Venue: RoboCup 2007: Robot Soccer World Cup XI (2008)

In this paper, we propose a control system that changes the compliance based on the walking speed to stabilize biped walking on rough terrain. The proposed system changes walking modes depends on its walking speed. In the downhill terrain, when the walking speed increases, the stiffness of the ankle in the support phase is controlled so as to brake the increased speed. In the uphill terrain, when the walking speed decreases, the stiffness of the waist joint is controlled and the desired trajectory for the supported leg is shifted so as not to falls down backward. To validate the efficiency of the proposed system, the stability of walking with the proposed system is examined in the two dimensional dynamics simulation. It is shown that the robot with the proposed system can walk in the more variable rough terrain and with the broader walking speed than without changing the stiffness of the joints.
Natural Language-Based Approach for Helping in the Reuse of Ontology Design Patterns
Authors: Guadalupe Aguado De Cea, Asunción Gómez-Pérez, Elena Montiel-Ponsoda, Mari Carmen Suárez-Figueroa
Venue: Proceedings of the 16th international conference on Knowledge Engineering: Practice and Patterns (2008)

Experiments in the reuse of Ontology Design Patterns (ODPs) have revealed that users with different levels of expertise in ontology modelling face difficulties when reusing ODPs. With the aim of tackling this problem we propose a method and a tool for supporting a semi-automatic reuse of ODPs that takes as input formulations in natural language (NL) of the domain aspect to be modelled, and obtains as output a set of ODPs for solving the initial ontological needs. The correspondence between ODPs and NL formulations is done through Lexico-Syntactic Patterns, linguistic constructs that convey the semantic relations present in ODPs, and which constitute the main contribution of this paper. The main benefit of the proposed approach is the use of non-restricted NL formulations in various languages for obtaining ODPs. The use of full NL poses challenges in the disambiguation of linguistic expressions that we expect to solve with user interaction, among other strategies.
OCL as the Query Language for UML Model Execution
Authors: Piotr Habela, Krzysztof Kaczmarski, Krzysztof Stencel, Kazimierz Subieta
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

Despite the specification of OCL mentions "query language" as one of its possible applications, there are rather few efforts in that direction. However, the problem becomes central where applying MDA to data intensive application modelling is considered. Recently added UML elements of Actions and Structured Activities make it possible to represent a level of detail similar to the one of common programming languages, but data processing requires adequate querying capability as well. As the OMG specification of the UML family, the Object Constraint Language becomes the most obvious candidate to serve this purpose. In this paper we research this role of OCL. Especially, we address the issues of seamless integration with UML metamodel and the useful features of query languages that are missing from OCL.
About the Time Complexity of Evolutionary Algorithms Based on Finite Search Space
Authors: Lixin Ding, Yingzhou Bi
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

We consider some problems about the computation time of evolutionary algorithms in this paper. First, some exact analytic expressions of the mean first hitting times of general evolutionary algorithms in finite search spaces are obtained theoretically by using the properties of Markov chain associated with evolutionary algorithms considered here. Then, by introducing drift analysis and applying Dynkin's Formula, the general upper and lower bounds of the mean first hitting times of evolutionary algorithms are estimated rigorously under some mild conditions listed in the paper. Those results in this paper are commonly useful. Also, the analytic techniques adopted in the paper are widely instructive for analyzing the computation time of evolutionary algorithms in a given search space as long as some specific mathematical arts are introduced accordingly.
Diagnosis of Plan Structure Violations
Authors: Nico Roos, Cees Witteveen
Venue: Proceedings of the 5th German conference on Multiagent System Technologies (2007)

Failures in plan execution can be attributed to errors in the execution of plan steps or violations of the plan structure. The structure of a plan prescribes which actions have to be performed and which precedence constraints between them have to be respected. Especially in multi-agent environments violations of plan structure might easily occur as the consequence of synchronization errors. While in previous work we have concentrated on the first type of failures, in this paper we introduce the idea of diagnosing plan structure violations. Using a formal framework for plan diagnosis, we describe how Model-Based Diagnosis can applied to identify these violations of plan structure specifications and we analyze their computational complexity.
An Improved Color-Based Particle Filter for Object Tracking
Authors: Yuan Chen, Shengsheng Yu, Jun Fan, Wenxin Chen, Hongxing Li
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

The object tracking problem in a nonlinear and/or non-Gaussian circumstance can be solved by particle filter estimation based on the concept of sequential importance sampling and the use of Bayesian theory. An improved object tracking scheme is proposed, which is based on the Markov Chain Monte Carlo (MCMC) particle filter and object color distribution. This scheme is robust to clutter, deformation of non-rigid object, rotation, and partial occlusion. In our scheme, a novel MCMC sampling method is applied to adjust particles distribution to obtain a more efficient particle filter. Object appearance is represented by color distribution within the specified primitive region. Experiments results demonstrate that the improved particle filtering method is robust and effective for object tracking.
On the Influence of Description Logics Ontologies on Conceptual Similarity
Authors: Claudia D'Amato, Steffen Staab, Nicola Fanizzi
Venue: Proceedings of the 16th international conference on Knowledge Engineering: Practice and Patterns (2008)

Similarity measures play a key role in the Semantic Web perspective. Indeed, most of the ontology related operations such as ontology learning, ontology alignment, ontology ranking and ontology population are grounded on the notion of similarity. In the last few years several similarity functions have been proposed for measuring both concept similarity and ontology similarity. However, they lack of a comprehensive formal characterization that is able to explain their behavior and value added, in particular when the ontologies are formulated in description logics languages like OWL-DL. Concept similarity functions need to be able to deal with the high expressive power of the ontology representation language, and to convey the underlying semantics of the ontology to which concepts refer. We propose a semantic similarity measure for complex Description Logics concept descriptions that elicits the underlying ontology semantics. Furthermore, we theorize a set of criteria that a measure has to satisfy in order to be compliant with a semantic expected behavior.
Using Support Vector Regression for Classification
Authors: Bo Huang, Zhihua Cai, Qiong Gu, Changjun Chen
Venue: Proceedings of the 4th international conference on Advanced Data Mining and Applications (2008)

In this paper, a new method to solve the classified problems by using Support Vector Regression is introduced. Proposed method is called as SVR-C for short. In the method, through reconstructing the training set, each class through reconstructing the training set, each class value corresponding to a new training set, then use the SVR algorithm to train it and get a constructed model. And then, to a new instance, use the constructed model to train it and approximate the target class to the maximization of output value. Compared with M5P-C, SMO, J48, the effectiveness of our approach is tested on 16 publicly available datasets downloaded from the UCI. Comprehensive experiments are performed, and the results show that the SVR-C outperforms M5P-C and J48, and takes on comparative performance to SMO but has low standard-deviation. Moreover, our approach performs well on multi-class problems.
The Behavior Markup Language: Recent Developments and Challenges
Authors: Hannes Vilhjálmsson, Nathan Cantelmo, Justine Cassell, Nicolas E. Chafai, Michael Kipp, Stefan Kopp, Maurizio Mancini, Stacy Marsella, Andrew N. Marshall, Catherine Pelachaud, Zsofi Ruttkay, Kristinn R. Thórisson, Herwin Welbergen, Rick J. Werf
Venue: Proceedings of the 7th international conference on Intelligent Virtual Agents (2007)

Since the beginning of the SAIBA effort to unify key interfaces in the multi-modal behavior generation process, the Behavior Markup Language (BML) has both gained ground as an important component in many projects worldwide, and continues to undergo further refinement. This paper reports on the progress made in the last year in further developing BML. It discusses some of the key challenges identified that the effort is facing, and reviews a number of projects that already are making use of BML or support its use.
FACTS: an OMNeT++ based simulator for aeronautical communications
Authors: Felix Hoffmann, Christian Bauer, Daniel Medina, Serkan Ayaz
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

In this paper, we present a concept for an aeronautical communications simulator based on the discrete event simulation platform OMNeT++. In the aeronautical environment, there is a mutual dependency between the movement of the aircraft and the data traffic that is generated, making an accurate modeling particularly difficult. In addition, such a simulator requires a modular architecture due to the heterogeneous link situation and variety of application scenarios that it will have to deal with.
Analytical synthesis of digitally programmable versatile-mode high-order OTA-equal C universal filter structures with the minimum number of components
Authors: Chun-Ming Chang, Jen Hung Lo, Li-Der Jeng
Venue: Proceedings of the 7th WSEAS International Conference on Instrumentation, Measurement, Circuits and Systems (2008)

How to simultaneously involve and merge four distinct kinds of modes, i.e., voltage, current, trans-admittance, and trans-impedance modes, into an analytical synthesis method (ASM) for synthesizing a complicated versatile mode high-order universal (namely, low-pass, band-pass, high-pass, band-reject, and all-pass) filter transfer function is presented in this paper employing (i) all single-ended-input operational transconductance amplifiers (OTAs), (ii) all grounded capacitors, and (iii) the minimum number of active and passive components. The new filter structure enjoys the important merits of digital programmability and low sensitivity in addition to have a controllable gain (except the current-mode one), cascadable voltage input and current output terminals, and the absence of the need to impose component matchings. H-spice frequency-dependent simulation results, using TSMC 0.18µm process and ±0.9V supply voltages, demonstrate precise filtering responses (for example, the current-mode high-pass response has only 0.3% error) at the operating frequency, 10 MHz.
A Study of Emotion Recognition and Its Applications
Authors: Won-Joong Yoon, Kyu-Sik Park
Venue: Proceedings of the 4th international conference on Modeling Decisions for Artificial Intelligence (2007)

In this paper, a speech emotion recognition system and its application for call-center system is proposed. In general, a speech captured by cellular-phone contains noises due to the mobile network and speaker environment. In order to minimize the effect of these noises and so improve the system performance, we employ a simple MA filter at the feature domain. Two pattern classification methods, k-NN and SVM with probability estimate, are compared to distinguish two emotional states- neutral and anger- for call-center application. The experimental results indicate that the proposed method provides very stable and successful emotional classification performance and it promises the feasibility of the agent for mobile communication services.
Visualizing Real-Time Network Resource Usage
Authors: Ryan Blue, Cody Dunne, Adam Fuchs, Kyle King, Aaron Schulman
Venue: Proceedings of the 5th international workshop on Visualization for Computer Security (2008)

We present NetGrok, a tool for visualizing computer network usage in real-time. NetGrok combines well-known information visualization techniques--overview, zoom filter, details on demand--with network graph and treemap visualizations. NetGrok integrates these tools with a shared data store that can read PCAP-formatted network traces, capture traces from a live interface, and filter the data set dynamically by bandwidth, number of connections, and time. We performed an expert user case study that demonstrates the benefits of applying these techniques to static and real-time streaming packet data. Our user study shows NetGrok serves as an "excellent real-time diagnostic," enabling fast understanding of network resource usage and rapid anomaly detection.
Semantic Web Framework for Knowledge-Centric Clinical Decision Support Systems
Authors: Sajjad Hussain, Samina Raza Abidi, Syed Sibte Raza Abidi
Venue: Proceedings of the 11th conference on Artificial Intelligence in Medicine (2007)

Lately, there have been considerable efforts to computerize Clinical Practice Guidelines (CPG) so that they can be executed via Clinical Decision Support Systems (CDSS) at the point of care. We present a Semantic Web framework to both model and execute the knowledge within a CPG to develop knowledge-centric CDSS. Our approach entails knowledge modeling through a synergy between multiple ontologies---i.e. a domain ontology, CPG ontology and patient ontology. We develop decision-rules based on the ontologies, and execute them with a proof engine to derive CPG-based patient specific recommendations. We present a prototype of our CPG-based CDSS to execute the CPG for Follow-up after Treatment for Breast Cancer.
Emotion Recognition with Poincare Mapping of Voiced-Speech Segments of Utterances
Authors: Krzysztof Ślot, Jaroslaw Cichosz, Lukasz Bronakowski
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

The following paper introduces a set of novel descriptors of emotional speech, which allows for a significant increase in emotion classification performance. The proposed characteristics - statistical properties of Poincare Maps, derived for voiced-speech segments of utterances - are used in recognition in combinations with a variety of both commonly used and some other, original descriptors of emotional speech. The introduced features proved to provide useful information into a classification process. Emotion recognition is performed using binary decision trees, which perform extraction of different emotions at consecutive decision levels. Classification rates for the considered six-category problem, which involved anger, boredom, joy, fear, neutral and sadness, are at the level up to 79% for both speaker-dependent and speaker-independent cases.
Integrating Gesture Recognition in Airplane Seats for In-Flight Entertainment
Authors: Rick Westelaken, Jun Hu, Hao Liu, Matthias Rauterberg
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

In order to reduce both the psychological and physical stress in air travel, sensors are integrated in airplane seats to detect the gestures as input for in-flight entertainment systems. The content provided by the entertainment systems helps to reduce the psychological stress, and the gesture recognition is used as input for the content and hence stimulates people to move, which as a result would reduce the physical stress as well.
Evaluation of ASIPs Design with LISATek
Authors: Rashid Muhammad, Ludovic Apvrille, Renaud Pacalet
Venue: Proceedings of the 8th international workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2008)

This paper evaluates an ASIP design methodology based on the extension of an existing instruction set and architecture described with LISA 2.0 language. The objective is to accelerate the ASIPs design process by using partially predefined, configurable RISC-like embedded processor cores that can be quickly tuned to given applications by means of ISE (Instruction Set Extension) techniques. A case study demonstrates the methodological approach for the JPEG algorithm.