ppxscal/embedding_network huggingface dataset:
Speaker Classification Concepts: Past, Present and Future
Authors: David R. Hill
Venue: Speaker Classification I: Fundamentals, Features, and Methods (2007)

Speaker classification requires a sufficiently accurate functional description of speaker attributes and the resources used in speaking, to be able to produce new utterances mimicking the speaker's current physical, emotional and cognitive state, with the correct dialect, social class markers and speech habits. We lack adequate functional knowledge of why and how speakers produce the utterances they do, as well as adequate theoretical frameworks embodying the kinds of knowledge, resources and intentions they use. Rhythm and intonation - intimately linked in most language - provide a wealth of information relevant to speaker classification. Functional - as opposed to descriptive - models are needed. Segmental cues to speaker category, and markers for categories like fear, uncertainty, urgency, and confidence are largely un-researched. What Eckman and Friesen did for facial expression must be done for verbal expression. The chapter examines some potentially profitable research possibilities in context.
A Parameterized Perspective on Packing Paths of Length Two
Authors: Henning Fernau, Daniel Raible
Venue: Proceedings of the 2nd international conference on Combinatorial Optimization and Applications (2008)

We study (vertex-disjoint) packings of paths of length two (i.e., of P 2's) in graphs under a parameterized perspective. Starting from a maximal P 2-packing $\mathcal {P}$ of size j we use extremal combinatorial arguments for determining how many vertices of $\mathcal {P}$ appear in some P 2-packing of size (j + 1) (if it exists). We prove that one can 'reuse' 2.5j vertices. Based on a WIN-WIN approach, we build an algorithm which decides if a P 2-packing of size at least k exists in a given graph in time ${\mathcal{O}}^*(2.482^{3k})$.
Obstacle Detection from Uncalibrated Cameras
Authors: Nadia Baha Touzene, Slimane Larabi
Venue: Proceedings of the 2008 Panhellenic Conference on Informatics (2008)

In this paper, we propose a new approach for obstacle detection based on the analysis of images taken by uncalibrated stereo rig. This system can be divided in to two main stages. The first one deals with computing the fundamental matrix from the matching between points of interest in order to compute a dense disparity map. Whereas the second one presents a very simple and faster method for obstacle detection, by using the segmentation image. Indeed, the combination of the segmented image and the disparity map are going to permit us to extract the vertical 3D segments that will indicate us the presence of obstacles in the scene. This approach allows us to detect several numbers of obstacles of varied shapes and sizes. This obstacle detection stage can be viewed as the first stage of a free space estimator which can be implemented in a mobile robot.
The Design of IIR Digital Filter Based on Chaos Particle Swarm Optimization Algorithm
Authors: Yunhong Gao, Yibo Li, Hongjuan Qian
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

This paper discusses the IIR digital filter design based on the chaos particle swarm optimization algorithm (CPSO). CPSO algorithm not only maintains the feature of simple structure, but also improves PSO algorithm global optimization capability, and enhances the convergence speed and accuracy of the algorithm. The simulation results of the low-pass and band-pass filter design show that the IIR digital filter can be designed with good performance using the CPSO algorithm and the precision and the iterative count compared with PSO have been improved greatly.
A Hybrid System for the Semantic Annotation of Sulco-Gyral Anatomy in MRI Images
Authors: Ammar Mechouche, Xavier Morandi, Christine Golbreich, Bernard Gibaud
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

This paper presents an interactive system for the annotation of brain anatomical structures in Magnetic Resonance Images. The system is based on hybrid knowledge and techniques. First, it exploits both numerical knowledge from atlases and symbolic knowledge from a rule-extended ontology represented in OWL, the Web ontology language, and combines them with graphical data about cortical sulci, automatically extracted from the images. Second, the annotations of the parts of gyri and of sulci located in a region of interest are obtained with different reasoning techniques: Constraint Satisfaction Solving and Description Logics techniques. Preliminary experiments have been achieved on normal and also pathological data. The results obtained so far are very promising.
User-Centered Interface Design of Social Websites
Authors: Yang-Cheng Lin, Chung-Hsing Yeh
Venue: Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics (2008)

This paper develops neural network (NN) models to examine how key design elements of a social website will affect users' feelings or perceptions. An experimental study of 96 university websites is conducted based on a user-centered approach. The study identifies seven website design elements and 33 representative websites as experimental samples for training and testing four NN models. These four NN models are built to formulate the relationship between seven website design elements and three users' feelings of websites. The result of the study shows that the combined NN model has an accuracy rate of 83.93% for predicting the values of three users' feelings of websites. This suggests that the combined NN model is a promising approach for modeling users' specific expectations of websites, thus providing an effective mechanism for facilitating user-centered interface design of social websites.
A Routing Scheme for Supporting Network Mobility of Sensor Network Based on 6LoWPAN
Authors: Jin Ho Kim, Choong Seon Hong, Koji Okamura
Venue: Proceedings of the 10th Asia-Pacific Network Operations and Management Symposium on Managing Next Generation Networks and Services (2007)

Network Mobility (NEMO) and IPv6 over Low power Wireless PAN (6LoWPAN) protocols are the two significant important technologies in the current networking research areas and seem to be vital for the future ubiquitous environment. It can maximize the ripple effect of ubiquitous revolution due to the close correlation between NEMO and 6LoWPAN. In this paper, we propose an interoperable architecture between NEMO and 6LoWPAN. To accomplish our goal we have enhanced the routing protocol: An extended routing scheme for mobile routers to support mobility in 6LoWPAN sensor nodes. Enhanced routing scheme performs default gateway discovery and mobile network prefix discovery operations for packet forwarding, path optimization and backup route maintenance. Simulation shows that our mechanism is capable of minimizing the routing overheads, and end-to-end packet delay.
Metrics for Measuring the Quality of Modularization of Large-Scale Object-Oriented Software
Authors: Santonu Sarkar, Avinash C. Kak, Girish Maskeri Rama
Venue: IEEE Transactions on Software Engineering (2008)

The metrics formulated to date for characterizing the modularization quality of object-oriented software have considered module and class to be synonymous concepts. But a typical class in object oriented programming exists at too low a level of granularity in large object-oriented software consisting of millions of lines of code. A typical module (sometimes referred to as a superpackage) in a large object-oriented software system will typically consist of a large number of classes. Even when the access discipline encoded in each class makes for "clean" class-level partitioning of the code, the intermodule dependencies created by associational, inheritance-based, and method invocations may still make it difficult to maintain and extend the software. The goal of this paper is to provide a set of metrics that characterize large object-oriented software systems with regard to such dependencies. Our metrics characterize the quality of modularization with respect to the APIs of the modules, on the one hand, and, on the other, with respect to such object-oriented inter-module dependencies as caused by inheritance, associational relationships, state access violations, fragile base-class design, etc. Using a two-pronged approach, we validate the metrics by applying them to popular open-source software systems.
jTRASTO: A Development Toolkit for Real-Time Multi-Agent Systems
Authors: Martí Navarro, Vicente Julian, Vicente Botti
Venue: Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V (2007)

Nowadays, there exist some toolkits that design and implement multi-agent systems. However, these toolkits have certain deficiencies when applied in specific environments (i.e. real-time environments). In these environment there may be strict temporal restrictions that require the use of specific agent architectures. Since these architectures are not covered in the development process of existing tools, this paper presents a new toolkit for the implementation of real-time multi-agent systems based on the jART platform.
How to Make the Quantitative Analysis in Evolutionary Game Theory? A Forecasting Analysis of Chinese Rural Labor Transfer
Authors: De-hai Liu, Wei-guo Wang
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

Based on the Perfect Rationality and Common Knowledge theoretically hypotheses, the out-of-equilibrium outcome or out of subgame perfect equilibrium path couldn't achieve in traditional game theory. Evolutionary game theory analyzes the population's dispersive behaviors under the Bounded Rational hypothesis. The theoretical payoffs of different strategies are decided by the practical observed outcome, so we can make the quantitative analysis. The paper puts forward the basic method for the evolutionary game quantitative analysis in social economy system, including bounded rationality derived from individual local information, imitation derived from local search decision-making and the social statistical investigating data reflected the total interactional outcome of social populations. At last, as a case of quantitative forecasting analysis, Chinese rural labor transferring course should be discussed.
The effect of negative online consumer reviews on product attitude: An information processing view
Authors: Jumin Lee, Do-Hyung Park, Ingoo Han
Venue: Electronic Commerce Research and Applications (2008)

Online consumer reviews provide product information and recommendations from the customer perspective. This study investigates the effects of negative online consumer reviews on consumer product attitude. In particular, it examines the proportion and quality of negative online consumer reviews from the perspective of information processing. The elaboration likelihood model is used to explain the persuasive effect of the proportion and quality depending on product involvement. A high proportion of negative online consumer reviews elicits a conformity effect. As the proportion of negative online consumer reviews increases, high-involvement consumers tend to conform to the perspective of reviewers, depending on the quality of the negative online consumer reviews; in contrast, low-involvement consumers tend to conform to the perspective of reviewers regardless of the quality of the negative online consumer reviews. The experiment in this study uses 248 college students in Korea. The proposed hypotheses are tested by three-way analysis of covariance.
Sharing Event Information in Distributed Environment Based on Three-Layered Structure
Authors: Masakazu Ikezaki, Toyohide Watanabe, Tomoko Kojiri, Taketoshi Ushiama
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

Recently, geographic information models for handling events have been proposed. However, the models are not always suitable to handle broadly spreading events, specifically in a distributed environment. This is because event data should be synchronized between geographic objects. In this paper, we propose a three-layered structure model with a view to handling events successfully in the distributed environment. In our model, event data and geographic objects are represented independently in the 1st layer, and they are associated dynamically according to a query in the 2nd layer. In the 3rd layer, data propagated from the 2nd layer are aggregated so as to be used in application systems. Based on this framework, event data and geographic objects could be represented independently, and event data computed in the 2nd layer would be shared and re-used.
High-Performance Agent System for Intrusion Detection in Backbone Networks
Authors: Martin Rehák, Michal Pěchouček, Pavel Čeleda, Vojtěch Krmíček, Jiří Moninec, Tomáš Dymáček, David Medvigy
Venue: Proceedings of the 11th international workshop on Cooperative Information Agents XI (2007)

This paper presents a design of high-performance agent-based intrusion detection system designed for deployment on high-speed network links. To match the speed requirements, wire-speed data acquisition layer is based on hardware-accelerated NetFlow like probe, which provides overview of current network traffic. The data is then processed by detection agents that use heterogenous anomaly detection methods. These methods are correlated by means of trust and reputation models, and the conclusions regarding the maliciousness of individual network flows is presented to the operator via one or more analysis agents, that automatically gather supplementary information about the potentially malicious traffic from remote data sources such as DNS, whois or router configurations. Presented system is designed to help the network operators efficiently identify malicious flows by automating most of the surveillance process.
Extending Pattern Specification for Design the Collaborative Learning at Analysis Level
Authors: Jaime Muñoz Arteaga, Ma. Lourdes Margain Fuentes, Fco. Álvarez Rodríguez, Carlos Alberto Ochoa Ortíz Zezzatti
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

The collaborative learning offers for students a rich collaborative learning space before, during and after the sessions given for a teacher. In order to design and develop properly technological support for the collaborative learning with the learning objects, the designers require speciation tools to take into account the different stakeholders notably students and teachers since the early phases. The analysis level is one of the engineering software phases, where the current work purpose at this phase the use of pattern paradigm as an specification tool in order to specify the best practices of collaborative learning and also as a common language between instructional and technological designers.
Extending Home Agent Migration to Mobile IPv6 Based Protocols
Authors: Guillaume Valadon, Ryuji Wakikawa
Venue: Proceedings of the 3rd Asian conference on Internet Engineering: Sustainable Internet (2007)

Defined at the IETF, the Mobile IPv6 protocol allows a single mobile node to keep the same IPv6 address independently of its network of attachment. It was recently enhance so as to augment its applicability. One of these extensions, NEMO, NEtwork MObility makes it possible to move a whole network, such as sensors deployed in a car, in the Internet topology. On the other hand, Proxy Mobile IPv6 provides Mobile IPv6-like services to standard IPv6 nodes. While these three protocols are actually heavily supported by the industry and deployed in 3GGP2, WiMAX and ITS, they suffer from several performances issues. Most of them are caused by the Home Agent, a specific router located on the home network, that hides movements of mobile nodes to their correspondents. The restricted position of the home agent is responsible for longer communications delays and higher path lengths. In one of our previous work, Home Agent Migration, we described how to significantly reduce these issues by deploying multiple home agents in the Internet topology. In this paper, we discuss the possible extensions to this specific architecture in order to support and enhance NEMO and Proxy Mobile IPv6. Furthermore, we analyze Home Agent Migration in terms of security so as to provide detailed guidance for secure real life deployments and safe usages.
On the construction of local quadratic spline quasi-interpolants on bounded rectangular domains
Authors: C. Dagnino, P. Lamberti
Venue: Journal of Computational and Applied Mathematics (2008)

In this paper local bivariate C^1 spline quasi-interpolants on a criss-cross triangulation of bounded rectangular domains are considered and a computational procedure for their construction is proposed. Numerical and graphical tests are provided.
A finite volume method for the approximation of Maxwell's equations in two space dimensions on arbitrary meshes
Authors: F. Hermeline, S. Layouni, P. Omnes
Venue: Journal of Computational Physics (2008)

A new finite volume method is presented for discretizing the two-dimensional Maxwell equations. This method may be seen as an extension of the covolume type methods to arbitrary, possibly non-conforming or even non-convex, n-sided polygonal meshes, thanks to an appropriate choice of degrees of freedom. An equivalent formulation of the scheme is given in terms of discrete differential operators obeying discrete duality principles. The main properties of the scheme are its energy conservation, its stability under a CFL-like condition, and the fact that it preserves Gauss' law and divergence free magnetic fields. Second-order convergence is demonstrated numerically on non-conforming and distorted meshes.
Calculating Colimits Compositionally
Authors: Robert Rosebrugh, Nicoletta Sabadini, Robert F. Walters
Venue: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday (2008)

We show how finite limits and colimits can be calculated compositionally using the algebras of spans and cospans, and give as an application a proof of the Kleene Theorem on regular languages.
From Biologically Realistic Imitation to Robot Teaching Via Human Motor Learning
Authors: Erhan Oztop, Jan Babic, Joshua Hale, Gordon Cheng, Mitsuo Kawato
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

Understanding mechanisms of imitation is a complex task in both human sciences and robotics. On the one hand, one can build systems that analyze observed motion, map it to their own body, and produce the motor commands to needed to achieve the inferred motion using engineering techniques. On the other hand, one can model the neural circuits involved in action observation and production in minute detail and hope that imitation will be an emergent property of the system. However if the goal is to build robots capable of skillful actions, midway solutions appear to be more appropriate. In this direction, we first introduce a conceptually biologically realistic neural network that can learn to imitate hand postures, either with the help of a teacher or by self-observation. Then we move to a paradigm we have recently proposed, where robot skill synthesis is achieved by exploiting the human capacity to learn novel control tasks.
Nanocomputing by Self-assembly
Authors: Lila Kari
Venue: Proceedings of the 6th international conference on Unconventional Computation (2007)

Biomolecular (DNA) computing is an emergent field of unconventional computing, lying at the crossroads of mathematics, computer science and molecular biology. The main idea behind biomolecular computing is that data can be encoded in DNA strands, and techniques from molecular biology can be used to perform arithmetic and logic operations. The birth of this field was the 1994 breakthrough experiment of Len Adleman who solved a hard computational problem solely by manipulating DNA strands in test-tubes. This led to the possibility of envisaging a DNA computer that could be thousand to a million times faster, trillions times smaller and thousand times more energy efficient than today's electronic computers.I will present one of the most active directions of research in DNA computing, namely DNA nanocomputing by self-assembly. I will namely discuss the computational potential of self-assembly, the process by which objects autonomously come together to form complex structures. I will bring forth evidence that self-assembly of DNA molecules can be used to perform computational tasks. Lastly, I will address the problem of self-assembly of arbitrarily large super-shapes, its solution and implications.
Adapting Hierarchical Social Organisation by Introducing Fear into an Agent Architecture
Authors: Pablo Lucas Anjos, Ruth Aylett, Alison Cawsey
Venue: Proceedings of the 7th international conference on Intelligent Virtual Agents (2007)

This paper considers possible affective roles in an agent-based social simulation, and in particular the effect of adding a simple model of fear into a replication of an agent-based social simulation.
GridCast: Improving peer sharing for P2P VoD
Authors: Bin Cheng, Lex Stein, Hai Jin, Xiaofei Liao, Zheng Zhang
Venue: ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) (2008)

Video-on-Demand (VoD) is a compelling application, but costly. VoD is costly due to the load it places on video source servers. Many have proposed using peer-to-peer (P2P) techniques to shift load from servers to peers. Yet, nobody has implemented and deployed a system to openly and systematically evaluate how these techniques work. This article describes the design, implementation and evaluation of GridCast, a real deployed P2P VoD system. GridCast has been live on CERNET since May of 2006. It provides seek, pause, and play operations, and employs peer sharing to improve system scalability. In peak months, GridCast has served videos to 23,000 unique users. From the first deployment, we have gathered information to understand the system and evaluate how to further improve peer sharing through caching and replication. We first show that GridCast with single video caching (SVC) can decrease load on source servers by an average of 22&percnt; from a client-server architecture. We analyze the net effect on system resources and determine that peer upload is largely idle. This leads us to changing the caching algorithm to cache multiple videos (MVC). MVC decreases source load by an average of 51&percnt; over the client-server. The improvement is greater as user load increases. This bodes well for peer-assistance at larger scales. A detailed analysis of MVC shows that departure misses become a major issue in a P2P VoD system with caching optimization. Motivated by this observation, we examine how to use replication to eliminate departure misses and further reduce server load. A framework for lazy replication is presented and evaluated in this article. In this framework, two predictors are plugged in to create the working replication algorithm. With these two simple predictors, lazy replication can decrease server load by 15&percnt; from MVC with only a minor increase in network traffic.