ppxscal/embedding_network huggingface dataset:
Architecture Model and Tools for Perceptual Dialog Systems
Authors: Jan Cuřín, Jan Kleindienst
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

In this paper, we present an architecture model for context-aware dialog-based services. We consider the term "context" in a broader meaning including presence and location of humans and objects, human behavior, human-to-human or human-to-computer interaction, activities of daily living, etc. We expect that the surrounding environment from which context is gathered is a "smart environment", i.e. a space (such as office, house, or public area) equipped with different sets of sensors, including audio and visual perception. Designing the underlying perceptual systems is a non-trivial task which involves interdisciplinary effort dealing with the integration of voice and image recognition technologies, situation modeling middleware, and context-aware interfaces into a robust and self-manageable software framework. To support fast development and tuning of dialog-based services, we introduce a simulation framework compliant with the proposed architecture. The framework is capable of gathering information from a broad set of sensors, of an event-based abstraction of such information, interaction with an integrated dialog system, and of a virtual representation of a smart environment in schematic 2D or realistic 3D projections. We elaborate on use-cases of architecture model referring the two projects where our system was successfully deployed.
Comparative Study of Three Feature Selection Methods for Regional Land Cover Classification Using MODIS Data
Authors: Shijin Li, Yuelong Zhu, Jun Feng, Ping Ai, Xi Chen
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

Selecting suitable features is very crucial for achieving successful classification of land cover types. This paper presents a comparative study of three typical feature selection methods for the task of regional land cover classification using MODIS data. Comparison results have shown that Branch and Bound is the best for land cover classification with MODIS data, while ReliefF and mRMR achieve nearly the same accuracies on the target application. The experimental results also show that it is necessary to conduct feature selection, which can reduce the computation cost largely, while the accuracy remains the same or even better.
Mitigating catastrophic failure at intersections of autonomous vehicles
Authors: Kurt Dresner, Peter Stone
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

Fully autonomous vehicles promise enormous gains in safety, efficiency, and economy. Before such gains can be realized, safety and reliability concerns must be addressed. We have previously introduced a system for managing such vehicles at intersections that is capable of handling more vehicles and causing fewer delays than traffic lights and stop signs [2]. While the system is safe under normal operating conditions, we have not discussed the possibility or implications of unforeseen mechanical failures. Because the system orchestrates such precarious "close calls" the tolerance for such errors is small. In this paper, we introduce safety features of the system designed to deal with these types of failures, and perform a basic failure mode analysis, demonstrating that without these features, the system is unsuitable for deployment due to a propensity for catastrophic failure modes.
On the Privacy of Concealed Data Aggregation
Authors: Aldar C. Chan, Claude Castelluccia
Venue: Proceedings of the 12th European symposium on Research In Computer Security (2007)

A formal treatment to the privacy of concealed data aggregation (CDA) is given. While there exist a handful of constructions, rigorous security models and analyses for CDA are still lacking. Standard security notions for public key encryption schemes, including semantic security and indistinguishability against chosen ciphertext attacks, are refined to cover the multi-sender nature and aggregation functionality of CDA in the security model. A generic CDA construction based on public key homomorphic encryption is given, along with a proof of its security in the proposed model. The security of two existing schemes is also analyzed in the proposed model.
Evolutionary Algorithm Reinforce with Linear Projection and Clustering
Authors: E. Tomczak, W. Kaminski
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

From the view point of practical applications and the theory of evolutionary algorithms, an important problem is the location of many local extrema showing at the same time the position of a global extremum. To accomplish this task, a new space exploration procedure is proposed by applying a so-called "linear projection". Additionally, a clustering technique is introduced to the selection procedure. Operation of the method is illustrated by searching the function of two and ten variables with extrema with a box-type limitation. Each time, irrespective of the number of clusters, calculations enabled location of many extrema.
Conceptual Modeling of Enterprise Application System Using Social Networking and Web 2.0 "Social CRM System
Authors: Subaji Mohan, Eunmi Choi, Dugki Min
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

Information Technology is moving towards the next generation and is attaining a new paradigm shift with the development of new technologies and its impact towards application development are inevitable. In particular, the focus on Web Services (Web 2.0) are increasing and currently it is been considered as a platform rather than service, due to its capability of data integration and working jointly with other applications. This has helped the enterprise to have new dimension to their application development. Similarly, Social networking is playing a crucial role and it provides organizations with the critical data to build strong relationships with their customers and partners. In this paper, we have proposed the conceptual model of Social CRM System, combining the features of Web 2.0 and Social Networking with the current CRM System. This will certainly provide a new direction and currently organizations have started towards this direction.
Weighted fusion graphs: Merging properties and watersheds
Authors: Jean Cousty, Michel Couprie, Laurent Najman, Gilles Bertrand
Venue: Discrete Applied Mathematics (2008)

This paper deals with the mathematical properties of watersheds in weighted graphs linked to region merging methods, as used in image analysis. In a graph, a cleft (or a binary watershed) is a set of vertices that cannot be reduced, by point removal, without changing the number of regions (connected components) of its complement. To obtain a watershed adapted to morphological region merging, it has been shown that one has to use the topological thinnings introduced by M. Couprie and G. Bertrand. Unfortunately, topological thinnings do not always produce thin clefts. Therefore, we introduce a new transformation on vertex weighted graphs, called C-watershed, that always produces a cleft. We present the class of perfect fusion graphs, for which any two neighboring regions can be merged, while preserving all other regions, by removing from the cleft the points adjacent to both. An important theorem of this paper states that, on these graphs, the C-watersheds are topological thinnings and the corresponding divides are thin clefts. We propose a linear-time immersion-like algorithm to compute C-watersheds on perfect fusion graphs, whereas, in general, a linear-time topological thinning algorithm does not exist. Furthermore, we prove that this algorithm is monotone in the sense that the vertices are processed in increasing order of weight. Finally, we derive some characterizations of perfect fusion graphs based on the thinness properties of both C-watersheds and topological watersheds.
Spectral Modes of Facial Needle-Maps
Authors: Roberto Fraile, Edwin R. Hancock
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

This paper presents a method to decompose a field of surface normals (needle-map). A diffusion process is used to model the flow of height information induced by a field of surface normals. The diffusion kernel can be decomposed into eigenmodes, each corresponding to approximately independent modes of variation of the flow. The surface normals can then be diffused using a modified kernel with the same eigenmodes but different coefficients. When used as part of a surface integration process, this procedure allows choosing the trade-off between local and global influence of each eigenmode in the modified field of surface normals. This graph-spectral method is illustrated with surface normals extracted from a face. Experiments are carried with local affinity functions that convey both the intrinsic and extrinsic geometry of the surface, and an information-theoretic definition of affinity.
Web reliability analysis and improvement
Authors: Jeff Tian
Venue:  (2008)

With the prevalence of the World Wide Web and people's reliance on it in today's society, ensuring satisfactory performance and reliability of Web servers and websites is becoming increasingly important. Various techniques exist today to test and measure the reliability of software systems. However, the Web environment presents many new challenges, and requires adapted or newly developed techniques. In this dissertation, based on the characterization of Web applications and the overall Web environment, we classify Web problems, focus on the subset of source content problems, and further develop an integrated framework for Web testing and reliability analysis. Using information about Web accesses and related failures extracted from existing Web server logs, we validate the memoryless property for Web testing based on our Unified Markov Models (UMMs), characterize website workload at different levels and from different perspectives, and evaluate Web software reliability. Finally, we identify high-risk components of websites, and explore other alternatives to measure Web quality by using other data sources and from different perspectives. We applied our approach to different kinds of websites: one educational website, one open source software development website, and one commercial website. The results demonstrated the combined viability and effectiveness of our approach.
The Biological Half-Life of Software Engineering Ideas
Authors: Philippe Kruchten
Venue: IEEE Software (2008)

The first installment of this new column on professional development discusses how some software engineering ideas have a half-life. The author conjectures that this half-life is roughly five years, and outlines the need for software engineers to thus stay abreast of new technologies.
Neural Network in Fast Adaptive Fourier Descriptor Based Leaves Classification
Authors: Dariusz Puchala, Mykhaylo Yatsymirskyy
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

In this paper the results in leaves classification with non-parametrized one nearest neighbor and multilayer perceptron classifiers are presented. The feature vectors are composed of Fourier descriptors that are calculated for leaves contours with fast adaptive Fourier transform algorithm. An application of fast adaptive algorithm results in new fast adaptive Fourier descriptors.Experimental results prove that the fast adaptive Fourier transform algorithm significantly accelerates the process of descriptors calculation and enables almost eightfold reduction in the number of contour data with no effect on classification performance. Moreover the neural network classifier gives higher accuracies of classification in comparison to the minimum distance one nearest neighbor classifier.
Network-Adaptive Selection of Transport Error Control (NASTE) for Video Streaming over Embedded Wireless System
Authors: Sungtae Moon, Jongwon Kim
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

The wireless networking is embedded into a wide variety of common devices. In many embedded networking situations, there have been increasing demands on the embedded wireless system for video streaming. However, it is inherently vulnerable to loss from dynamic wireless channel. In order to alleviate the effect of losses in the transport layer, the error control schemes are used. However, since each error control scheme shows different performance, a suitable scheme should be selected and applied. In this paper, we propose and implement a network-adaptive selection of transport error control (NASTE). To verify the feasibility of the proposed NASTE, we have implemented it in the embedded system which includes IEEE 802.11g WLAN environment. The experimental results indicate that the proposed mechanism can enhance the overall transport performance by recovering packet losses.
A Metric to Discriminate the Selection of Algorithms for the General ATSP Problem
Authors: Jorge A. Ruiz-Vanoye, Ocotlán Díaz-Parra, Vanesa Landero N.
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

In this paper we propose: (1) the use of discriminant analysis as a means for predictive learning (data-mining techniques) aiming at selecting metaheuristic algorithms and (2) the use of a metric for improving the selection of the algorithms that best solve a given instance of the Asymmetric Traveling Salesman Problem (ATSP). The only metric that had existed so far to determine the best algorithm for solving an ATSP instance is based on the number of cities; nevertheless, it is not sufficiently adequate for discriminating the best algorithm for solving an ATSP instance, thus the necessity for devising a new metric through the use of data-mining techniques.
A Margin Maximization Training Algorithm for BP Network
Authors: Kai Wang, Qingren Wang
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

Generalization problem is a key problem in NN society, which can be grouped into two classes: the generalization problem with unlimited size of training sample and that with limited size of training sample. The generalization problem with limited size of training sample is considered in this paper. Similar to margin maximization criterion in SVM, we propose a margin maximization training algorithm for BP network to further improve the generalization ability of BP network. Experimental results show that the margin maximization training algorithm proposed in this paper does improve the performance of BP network, and shows a comparable performance with SVM.
Decomposing EEG Data into Space-Time-Frequency Components Using Parallel Factor Analysis and Its Relation with Cerebral Blood Flow
Authors: Fumikazu Miwakeichi, Pedro A. Valdes-Sosa, Eduardo Aubert-Vazquez, Jorge Bosch Bayard, Jobu Watanabe, Hiroaki Mizuhara, Yoko Yamaguchi
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

Finding the means to efficiently summarize electroencephalographic data has been a long-standing problem in electrophysiology. Our previous works showed that Parallel Factor Analysis (PARAFAC) can effectively perform atomic decomposition of the time-varying EEG spectrum in space/ frequency/time domain. In this study, we propose to use PARAFAC for extracting significant activities in EEG data that is concurrently recorded with functional Magnetic Resonance Imaging (fMRI), and employ the temporal signature of the atom for investigating the relation between brain electrical activity and the changing of BOLD signal that reflects cerebral blood flow. We evaluated the statistical significance of dynamical effect of BOLD respect to EEG based on the modeling of BOLD signal by plain autoregressive model (AR), its AR with exogenous EEG input (ARX) and ARX with nonlinear term (ARNX).
An Analysis of UCT in Multi-player Games
Authors: Nathan R. Sturtevant
Venue: Proceedings of the 6th international conference on Computers and Games (2008)

The UCT algorithm has been exceedingly popular for Go, a two-player game, significantly increasing the playing strength of Go programs in a very short time. This paper provides an analysis of the UCT algorithm in multi-player games, showing that UCT, when run in a multi-player game, is computing a mixed-strategy equilibrium, as opposed to maxn, which computes a pure-strategy equilibrium. We analyze the performance of UCT in several known domains and show that it performs as well or better than existing algorithms.
The Software Rejuvenation Model with Pre-start Technology
Authors: Xin He, Wei Wei, Xiaolin Gui
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

Software aging related failures can be prevented by applying software rejuvenation technology. But the restart operation in the software rejuvenation phase makes the system unable to provide services, which leads to system unavailability. The software rejuvenation model with pre-start technology is therefore proposed to reduce downtime and improve availability by switching between active copy and backup copy, which can substitute for restart operation and resolve unavailability problem. First of all, the rejuvenation operation of model with pre-start technology is described and improvements on the conventional model are presented. Second, the model availability is calculated by Markov Regenerative process. And finally, according to the experimental results, current model proves to be more available than the conventional one.
A Schedulerless Semantics of TLM Models Written in SystemC Via Translation into LOTOS
Authors: Olivier Ponsini, Wendelin Serwe
Venue: Proceedings of the 15th international symposium on Formal Methods (2008)

TLM (Transaction-Level Modeling) was introduced to cope with the increasing complexity of Systems-on-Chip designs by raising the modeling level. Currently, TLM is primarily used for system-level functional testing and simulation using the SystemC C++ API widely accepted in industry. Nevertheless, TLM requires a careful handling of asynchronous concurrency. In this paper, we give a semantics to TLM models written in SystemC via a translation into the process algebra LOTOS, enabling the verification of the models with the CADP toolbox dedicated to asynchronous systems. Contrary to other works on formal verification of TLM models written in SystemC, our approach targets fully asynchronous TLM without the restrictions imposed by the SystemC simulation semantics. We argue that this approach leads to more dependable models.
Consistent Data Integration in P2P Deductive Databases
Authors: L. Caroprese, E. Zumpano
Venue: Proceedings of the 1st international conference on Scalable Uncertainty Management (2007)

Data Integration in Peer-to-Peer (P2P) systems is concerned with the ability of physically connect autonomous sources (peer) for sharing and reuse information and for the creation of new information from existing one. In a P2P system a query can be posed to any peer and the answer is provided by integrating locally stored data with data provided from its neighbors. Anyhow, while collecting data for answering queries, imported data may corrupt the local database due to the violation of some integrity constraint, therefore inconsistencies have to be managed. This paper contributes to the proposal of a logic based framework for data integration and query answering in a Peer-to-Peer environment. It is based on [11,12] in which the Preferred Weak Model Semantics, capturing a different perspective for P2P data integration, has been proposed: just data not violating integrity constraints are exchanged among peers by using mapping rules. The motivation of this work stems from the observation that the complexity of computing preferred weak models in [11,12] does not let the approach to be implemented in practical applications. Therefore, a more pragmatic solution seems to be desirable for assigning semantics to a P2P system. First, the paper proposes a rewriting technique that allows modeling a P2P system, ${\mathcal {PS}}$, as a unique logic program, Rew t (${\mathcal {PS}}$), whose stable models correspond to the preferred weak models of ${\mathcal {PS}}$. Then, it presents the Well Founded Model Semantics, that allows obtaining a deterministic model whose computation is polynomial time. This is a (partial) stable model obtained by evaluating with a three-value semantics a logic program obtained from Rew t (${\mathcal {PS}})$. Finally, the paper provides results on the complexity of answering queries in a P2P system.
Extracting Fuzzy Linguistic Summaries Based on Including Degree Theory and FCA
Authors: Li Zhang, Zheng Pei, Honghua Chen
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

In information systems (or database), generally, attribute values of objects are numeral or symbols, from application point of view, linguistic information or decision rules are widely used. Hence, fuzzy linguistic summaries would be very desirable and human consistent. In this paper, extracting fuzzy linguistic summaries from a continuous information system is discussed. Due to fuzzy linguistic summaries can not be extracted directly in the information system, fuzzy information system is used to discretize the continuous information system, and level cut set is used to obtain classical information system firstly. Then based on including degree theory and formal concept analysis (FCA), simple fuzzy linguistic summaries are extracted. To extract complex linguistic summaries, logical conjunctions ¿ , ¿ and ¿ are used. An Example of checking quality of sweetened full cream milk powder is also provided.
A Cooperative ARQ for Delay-Tolerant Vehicular Networks
Authors: Julián Morillo Pozo, Oscar Trullols, José M. Barceló, Jorge García Vidal
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

This paper proposes a Cooperative ARQ protocol to be used in delay-tolerant vehicular networks. The proposed scheme has been implemented and evaluated through an experimental testbed, showing that packet losses in transmissions from an access point to cars can be reduced to the half without any cost as long as cooperation takes place on areas where connectivity with access points is not present. In these areas, cars in a platoon recover from other cars packets that they have failed to receive from the access point.
Measuring the Level of Abstraction and Detail of Models in the Context of MDD
Authors: Jens Pilgrim
Venue: Models in Software Engineering: Workshops and Symposia at MoDELS 2007, Nashville, TN, USA, September 30 - October 5, 2007, Reports and Revised Selected Papers (2008)

In model driven development (MDD), models are transformed automatically into other models. This leads to transformation chains. The goal of MDD is to set up efficient transformation chains, i.e. adding semantics first and platform detail later. When the platform is changed, only the later, platform specific models have to be replaced. This paper constructs metrics for measuring and comparing the models obtained through transformations in MDD processes, in order to help to set up the more efficient transformation chains.