ppxscal/embedding_network huggingface dataset:
Exact Asymptotic Analysis of Closed BCMP Networks with a Common Bottleneck
Authors: Jonatha Anselmi, Paolo Cremonesi
Venue: Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications (2008)

In this paper, we prove the asymptotic equivalence between closed, open and mixed multiclass BCMP queueing networks. Under the assumption that the service demands of a given station, for sufficiently large population sizes, are greater than the ones of all the other stations, we prove that as the total number of customers semi-proportionally grows to infinity the underlying Markov chain of a closed network converges to the underlying Markov chain of a suitable open or mixed network. The equivalence theorem lets us extend the state of the art exact asymptotic theory of queueing networks considering a general population growth and including the case in which stations have load-dependent rates of service, and provides a natural technique for the approximate on-line solution of closed networks with large populations. We also show the validity of Little's law in the limit.
Bottleneck Analysis for Two-Hop IEEE 802.11e Ad Hoc Networks
Authors: Anne Remke, Boudewijn R. Haverkort, Geert Heijenk, Lucia Cloth
Venue: Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications (2008)

Recently, a quality-of-service (QoS) extension of the IEEE 802.11 standard (known as IEEE 802.11e) for wireless LANs has been proposed. We present a versatile and accurate performance model to study how these new QoS enhancements can be used to improve the performance of wireless nodes competing for bandwidth in a multi-hop ad hoc network. The paper presents the QoS enhancements, and shows how they can be modeled using a simple, yet effective, parameterized quasi-birth-death model. The model is developed hierarchically, in that results at packet level (e.g., as developed by Bianchi and others) are used in our flow-level model, in which a single bottleneck station interacts with a time-varying number of traffic sources. Thus, we are able to study the impact of the QoS enhancements on the flow-level performance. This has not been done before. The results of our analyses are compared with extensive simulations (using Opnet), and show excellent agreement for throughput, mean number of active sources and mean buffer occupancy at the bottleneck station. An important asset of our model is that it allows for very quick evaluations: where simulations require up to an hour per scenario, our model is solved in seconds.
Contextualized Knowledge Acquisition in a Personal Semantic Wiki
Authors: Ludger Elst, Malte Kiesel, Sven Schwarz, Georg Buscher, Andreas Lauer, Andreas Dengel
Venue: Proceedings of the 16th international conference on Knowledge Engineering: Practice and Patterns (2008)

The use of semantic representations in document-oriented environments --- as formal annotations or embedded instances of a formal knowledge base --- is seen as an enabling technology for intelligent services which may help knowledge workers in tasks like finding, structuring, or assessing information. Also, a high level of formalization has potential to directly support problem solving, e.g., by the application of inferencing services. A coupling of textual and formal representations in document-centered knowledge work raises, amongst others, two questions: i) How can the acquisition of formal knowledge in such an environment be facilitated? ii) How can the potential complexity of formal annotations during a document's life and use cycle be adequately handled?We present the Mymory workbench as an approach to investigate and tackle these challenges. Mymory is based on a semantic wiki system and supports manual as well as automated annotations of wiki documents. These annotations can be framed by automatically obtained models of the user's work context, establishing situation-oriented structuring of annotations which can be exploited in semantic search and adapted document presentation.
AI Framework for Decision Modeling in Behavioral Animation of Virtual Avatars
Authors: A. Iglesias, F. Luengo
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

One of the major current issues in Artificial Life is the decision modeling problem (also known as goal selection or action selection). Recently, some Artificial Intelligence (AI) techniques have been proposed to tackle this problem. This paper introduces a new based-on-Artificial-Intelligence framework for decision modeling. The framework is applied to generate realistic animations of virtual avatars evolving autonomously within a 3D environment and being able to follow intelligent behavioral patterns from the point of view of a human observer. Two examples of its application to different scenarios are also briefly reported.
Sustainability and Predictability in a Lasting Human---Agent Interaction
Authors: Toshiyuki Kondo, Daisuke Hirakawa, Takayuki Nozawa
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

Sustainability is one of important features to be considered in a human---agent interaction (HAI) process, because humans are unavoidably accustomed to the agents and it seems to become boredom as the agents' behaviors come to be predictable. To be clear the relationship between the sustainability and the predictability, the interaction processes between human subjects and a virtual entertainment robot with either of three different interaction models are evaluated.
Power efficient video multipath transmission over wireless multimedia sensor networks
Authors: Ilias Politis, Michail Tsagkaropoulos, Tasos Dagiuklas, Stavros Kotsopoulos
Venue: Mobile Networks and Applications (2008)

This paper proposes a power efficient multipath video packet scheduling scheme for minimum video distortion transmission (optimised Video QoS) over wireless multimedia sensor networks. The transmission of video packets over multiple paths in a wireless sensor network improves the aggregate data rate of the network and minimizes the traffic load handled by each node. However, due to the lossy behavior of the wireless channel the aggregate transmission rate cannot always support the requested video source data rate. In such cases a packet scheduling algorithm is applied that can selectively drop combinations of video packets prior to transmission to adapt the source requirements to the channel capacity. The scheduling algorithm selects the less important video packets to drop using a recursive distortion prediction model. This model predicts accurately the resulting video distortion in case of isolated errors, burst of errors and errors separated by a lag. Two scheduling algorithms are proposed in this paper. The Baseline scheme is a simplified scheduler that can only decide upon which packet can be dropped prior to transmission based on the packet's impact on the video distortion. This algorithm is compared against the Power aware packet scheduling that is an extension of the Baseline capable of estimating the power that will be consumed by each node in every available path depending on its traffic load, during the transmission. The proposed Power aware packet scheduling is able to identify the available paths connecting the video source to the receiver and schedule the packet transmission among the selected paths according to the perceived video QoS (Peak Signal to Noise Ratio--PSNR) and the energy efficiency of the participating wireless video sensor nodes, by dropping packets if necessary based on the distortion prediction model. The simulation results indicate that the proposed Power aware video packet scheduling can achieve energy efficiency in the wireless multimedia sensor network by minimizing the power dissipation across all nodes, while the perceived video quality is kept to very high levels even at extreme network conditions (many sensor nodes dropped due to power consumption and high background noise in the channel).
A pen and speech-based storytelling system for Chinese children
Authors: Danli Wang, Jie Li, Jie Zhang, Guozhong Dai
Venue: Computers in Human Behavior (2008)

Storytelling plays an important role in language learning. Storytelling by a child, as an educational activity, influences the child's linguistic ability, thought process, imagination, and creativity significantly. Many researchers have made extensive studies in storytelling systems for children. While there presently exist many software-based storytelling applications, most are deemed not completely suitable for Chinese children. In this paper, combining the characteristics of Chinese children and using the multimodal interaction pattern based on speech and pen-gesture, we present children a 3D storytelling system which uses user-centered scenario-based design method. The usability of the storytelling system is evaluated and the results suggest that all the users generally feel pretty satisfied with the system.
Projection Pursuit Constructive Neural Networks Based on Quality of Projected Clusters
Authors: Marek Grochowski, Włodzisław Duch
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part II (2008)

Linear projection pursuit index measuring quality of projected clusters (QPC) is used to discover non-local clusters in high-dimensional multiclass data, reduce dimensionality, select features, visualize and classify data. Constructive neural networks that optimize the QPC index are able to discover simplest models of complex data, solving problems that standard networks based on error minimization are not able to handle. Tests on problems with complex Boolean logic, and tests on real world datasets show high efficiency of this approach.
An examination of security issues in multiprotocol label switching (mpls) networks
Authors: Sujeet Shenoi
Venue:  (2007)

This dissertation examines the Multi-Protocol Label Switching (MPLS) technology architecture fundamentals, core components, label distribution, most used implementations, label distribution protocols, and security aspects. Its purpose is to research the security aspects of MPLS technology. Since the early 2000's, most large commercial telecommunications carriers and service providers Have migrated their Internet Protocol (IP)-to-Asynchronous Transfer Mode (ATM) networks to IP-to-MPLS networks. Like any other computer application, MPLS software code is expected not to be exempt from careless coding, less-than optimal implementation, inherent programming language flaws, and improper configuration that could be intentionally exploited to disrupt the normal operation of MPLS networks. Also, previous research has uncovered hardware vulnerabilities which may be triggered by software vulnerabilities. These include denial-of-service and reloading of devices. These hardware vulnerabilities, if left unsolved, could be exploited in parallel with other software vulnerabilities. It is only a matter of time for hackers, cyber-criminals, cyber-terrorists, and other rogue individuals including hostile governments to exploit MPLS vulnerabilities for financial gain or to advance their political agendas. It is imperative for MPLS networks owners and operators to expose, mitigate, and eliminate the most possible vulnerabilities present on their MPLS networks implementations. This dissertation offers recommendations to advance the security awareness and understanding of MPLS networks operation and importance.
Single-Patch NURBS Face
Authors: Ken Yano, Koichi Harada
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

We describe a novel NURBS surface fitting method to a human face model. Our first step is to resample of the original mesh model. The next step we fit a tensor product NURBS surface to the grid points. Our method is characteristic in that we use only one patch to fit the model. By eliminating the need to make patch boundaries, our resampling and fitting method can be used for interactive system with minimum user interactions.
Multi-agent plan diagnosis and negotiated repair
Authors: Huib Aldewereld, Pieter Buzing, Geert Jonker
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: demo papers (2008)

In the complex, dynamic domain of Air Traffic Control (ATC) many unexpected events can happen during the execution of a plan. Sometimes these disruptions make the plan infeasible and require a change of the original plan. Unexpected events may disrupt the execution of a plan leading to conflicts concerning the use of shared resources. By monitoring the possibly disrupted execution of a plan, air traffic controllers identify and repair conflicts before they occur, making the plan 'healthy' again. Model-based diagnosis helps to identify the causes of observed disruptions in the execution of a plan. This information enables the creation of better plan repairs. These repairs should efficient, but moreover they should be fair, i.e., one airline should not be the victim of conflicts caused by another. Due to the complexity of planning tasks, it is beneficial to provide a distributed solution such that the workload is spread instead of centralised. Moreover, since the choice between various possible solutions to a conflict in the plan execution directly influence different parties (with diverting interests), the decision about which solution to choose should not be made by a single (central) decision maker, but agreed upon by the different parties involved. The Multi-Agent Diagnosis and negotiated repair (MAD) demonstrator combines our previous research done on model-based diagnosis, planning and scheduling techniques, and methods for multi-agent negotiation to solve this problem in a distributed manner. The resulting tool is a system to support the control and adaptation of distributed plan execution in the domain of ATC.
An integrated software tool for detecting criminals using DNA databases
Authors: K. S. Kong, E. Y. K. Ng
Venue: Journal of Computational Methods in Sciences and Engineering (2008)

The work showed that the integrated suite of software tools for detecting criminals using DNA databases has achieved the overall objective by providing a working platform for sequence analysis. The work also demonstrated that by integrating BLAST and FASTA (two widely used and freely available algorithms), plus an additional implementation of PSA (custom-built pairwise sequence alignment algorithms) and TR analysis tools (for detecting tandem repeats) with the rest of the utilities supporting tools (databases and files management) developed, it is entirely possible to have an initial working version of the software tool for criminal DNA analysis and detection work. The integrated software tool has great potential and that the results obtained during the tests were satisfactory. The recent South Asia Tsunami incident has renewed the need to establish a quick and reliable system for DNA matching and comparison. This work may also contribute towards the quick identification of victims in many disasters. Future works are to further enhance the existing tools by adding more options and controls, improve upon the visualisation display, and to build robust software architecture to better manage the system loadings. Fault tolerance enhancement to the system is one of the key areas that can further help to make the entire application efficient, robust and reliable.
In or Out?
Authors: J. B. Rainsberger
Venue: IEEE Software (2008)

Many people do great work but still can't satisfy their customers. When this happens to you, either learn to live with the results or take the reins and change them. Whichever path you choose, commit to it.
A generalized proximal-point-based prediction-correction method for variational inequality problems
Authors: Deren Han
Venue: Journal of Computational and Applied Mathematics (2008)

In a class of variational inequality problems arising frequently from applications, the underlying mappings have no explicit expression, which make the subproblems involved in most numerical methods for solving them difficult to implement. In this paper, we propose a generalized proximal-point-based prediction-correction method for solving such problems. At each iteration, we first find a prediction point, which only needs several function evaluations; then using the information from the prediction, we update the iteration. Under mild conditions, we prove the global convergence of the method. The preliminary numerical results illustrate the simplicity and effectiveness of the method.
Characterization of influence zones of simulated droughts and floods of water bodies in a floodplain
Authors: S. Dinesh
Venue: Computers Geosciences (2008)

During flooding processes, randomly situated water bodies of varying sizes and shapes in a floodplain tend to self-organize. At high degrees of flooding intensity, water bodies contact together to form influence zones, which indicate the self-organized criticality of the flooding of water bodies. The characterization of water bodies and their influence zones provides useful insight into the geomorphic properties of floodplain terrains. In this paper, characterization of the influence zones of simulated droughts and floods of water bodies in a floodplain is performed. First, drought and flood simulations are implemented by performing morphological erosion and dilation, respectively, on water bodies using square kernels of increasing sizes. The level of droughting/flooding is indicated by the kernel size. The average areas of the influence zones of the generated simulated droughts and floods of water bodies are computed. It is observed that as the droughting level increases from 1 to 5, the average area of the influence zones of water bodies reduces due to the shrinking of water bodies. As the droughting level increases from 5 to 15, the average area of the influence zones of water bodies increases due the vanishing of small water bodies. Flooding causes an increase in the average area of the influence zones of water bodies due to the merging of adjacent water bodies. A power law relationship is observed between the average area of the influence zones of the simulated droughts/floods and the level of droughting/flooding. The scaling exponent of this power law, which is named as a fractal dimension, indicates the rate of change of average area of the influence zones of simulated droughts/floods of water bodies in a floodplain over varying levels of droughting/flooding.
Plenary lecture IV: travelling waves of the form of compactons, peakons, cuspons and their CNN realization
Authors: Petar Popivanov
Venue: Proceedings of the 9th WSEAS International Conference on Neural Networks (2008)

This paper deals with the construction of travelling waves of some equations of mathematical physics as generalized Camassa-Holm equation, generalized KdV equation and several others. We construct compactly supported solutions as well as solutions forming singularities of the type peak (angle) and cusp. To do this tools of classical analysis and ODE are used. The CNN realization enables us to obtain numerical results and computer visualization of the corresponding solutions.
GTQ: A Language and Tool for Game-Tree Analysis
Authors: Jónheiður Ísleifsdóttir, Yngvi Björnsson
Venue: Proceedings of the 6th international conference on Computers and Games (2008)

The search engines of high-performance game-playing programs are becoming increasingly complex as more and more enhancements are added. To maintain and enhance such complex engines is a challenging task, and the risk of introducing bugs or other unwanted behavior during modifications is substantial. In this paper we introduce the Game Tree Query Language (GTQL), a query language specifically designed for analyzing game trees. The language can express queries about complex game-tree structures, including hierarchical relationships and aggregated attributes over subtree data. We also discuss the design and implementation of the Game Tree Query Tool (GTQT), a software tool that allows efficient execution of GTQL queries on game-tree log files. The tool helps program developers to gain added insight into the search process of their engines, as well as making regression testing easier. Furthermore, we use the tool to analyze and find interesting anomalies in search trees generated by a competitive chess program.
A Global Convergence Algorithm with Stochastic Search for Constrained Optimization Problems
Authors: Changyin Zhou, Guoping He
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

In this paper we investigate the global optimization problems with bounded variables and linear equality constraints. We suggest an approach to drawing sample points randomly from the feasible region. A new population-based global optimization algorithm is proposed. We also show that the algorithm converges to the global optimal solution with probability one. The method is easily extended to global optimization problems with general constraints.
An Improved Weight Decision Rule Using SNNR and Fuzzy Value for Multi-modal HCI
Authors: Jung-Hyun Kim, Kwang-Seok Hong
Venue: Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory (2007)

In this paper, we suggest an improved weight decision rule depending on SNNR (Signal Plus Noise to Noise Ratio) and fuzzy value for simultaneous multi-modality including a synchronization between audio-gesture modalities. In order to insure the validity of the suggested weight decision rule, we implement a wireless PDA-based Multi-Modal Fusion Architecture (hereinafter, MMFA) by coupling embedded speech and KSSL recognizer, which fuses and recognizes 130 word-based instruction models that are represented by speech and KSSL (Korean Standard Sign Language), and then translates recognition result into synthetic speech (TTS) and visual illustration in real-time. In the experimental results, the average recognition rate of the MMFA fusing 2 sensory channels based on wireless PDA was 96.54% in clean environments (e.g. office space), and 93.21% in noisy environments, with the 130 word-based instruction models.
SQL/XML Performance Analysis of Parent/Ancestor Queries
Authors: Eric Pardede, J. Wenny Rahayu, David Taniar, Ramanpreet Kaur Aujla
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

The fact that XML data can be stored in different repositories creates a layer of complexity in efficient XML query processing. Most existing works discussed the query analysis for Native XML Database using XML Query Language such as XQuery and XPath. However, it is inevitable that many XML users still use established database repositories, such as relational and object-relational database, for their XML storage (called XML-Enabled Database), and an extended SQL, such as SQL/XML, for their query processing. Query analysis using SQL/XML on the XML-Enabled Database System family has not been well-researched. In this paper, we present our research on parent/ancestor XML queries using the SQL/XML standard.