ppxscal/embedding_network huggingface dataset:
E-Tree: affective interactive art
Authors: Stephen W. Gilroy, Marc Cavazza, Remi Chaignon
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

As part of the CALLAS project [1], our aim is to explore multimodal interaction in an Arts and Entertainment context. This creative showcase is an Augmented Reality Art installation, which reacts to user behaviour using multimodal analysis of affective signals. The installation features a virtual tree, whose growth is influenced by the perceived emotional response from the spectators. The system implements a 'magic mirror' paradigm (using a large-screen display or projection system) and produces interactive graphics based on the ARToolkit [2, 3] with extended representations for scene graphs [4]. The system relies on a PAD dimensional model [5] to support the fusion of affective modalities, each input modality being represented as a PAD vector. A further advantage of the PAD model is that it supports the representation of affective responses that relate to aesthetic impressions. The influence of affective input on the visual component is achieved by mapping affective data to an L-System governing virtual tree behaviour. We have performed an early evaluation of the system, both from the technical perspective and in terms of user experience.
Effectiveness of E-Learning System
Authors: Sarmad Mohammad
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

In this paper, a framework has been introduced to be used to evaluate the quality, completeness of the monitoring and to measure effectiveness of e-learning web site which has three areas of focus infrastructure, applications, and business functions. Each area is different; they cover the system aspects of the Web site. We proposed a performance management policy, some security question have been answered and evaluated.
A Clustering Algorithm Based on Communication Facility in WSN
Authors: Yuhua Liu, Jingju Gao, Longquan Zhu, Yugang Zhang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

Clustering algorithm has a significant impact on the operation of wireless sensor network (WSN). Effective clustering algorithm leads wireless sensor network to operate efficiently. In this paper, we propose "communication facility (CF)" for the first time, based on communication facility, we propose a clustering algorithm CABCF (clustering algorithm based on communication facility) in WSN. Different elect cluster heads (CHs) firstly from others traditional clustering algorithms; CABCF generates CH with the formatting of cluster structure. In CABCF, inter-cluster communication and intra-cluster communication are all in multi-hop way so that the algorithm is suitable for large-scale networks. Simulation experiments are conducted to evaluate the performance of our algorithm in terms of the distribution of cluster, the number of alive nodes and the energy consumptions. Results show that our algorithm is more effective than LEACH.
Linear inflation rules for the random yield production control problem with uncertain demand: analysis and computations
Authors: Woonghee Tim Huh, Mahesh Nagarajan
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Since the dawn of wafer fabrication and the production of microelectronic parts a fundamental characteristic of this environment has been uncertainty in production yields and in demand for product. The impact of the uncertainty is so prevalent that even deterministic models in practice have incorporated some allowance for uncertainty through features such as date effective yields, moving average capacity, etc. In this paper, we propose a simple heuristic approach for the inventory control problem with stochastic demand and multiplicative random yield. Our heuristic tries to find the best candidate within a class of policies which are referred to in the literature as the linear inflation rule (LIR) policies. Our approach is computationally fast, easy to implement and intuitive to understand. Moreover, we find that in a significant number of instances our heuristic performs better than several other well-known heuristics that are available in the literature.
On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay
Authors: Taishin Daigo, Kouichi Hirata
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

An acyclic subhypergraph of a hypergraph is maximal if there exists no acyclic subhypergraph containing it. In this paper, first we show that, unless P=NP, there is no polynomial delay algorithm for generating all maximal acyclic subhypergraphs in lexicographic order. Next, by ignoring the order of outputs, we design a polynomial delay algorithm for generating all maximal acyclic subhypergraphs.
Performance Analysis of a Collision Detection Algorithm of Spheres Based on Slab Partitioning
Authors: Takashi Imamichi, Hiroshi Nagamochi
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this paper, we consider a collision detection problem of spheres which asks to detect all pairs of colliding spheres in a set of n spheres located in d-dimensional space. We propose a collision detection algorithm for spheres based on slab partitioning technique and a plane sweep method. We derive a theoretical upper bound on the time complexity of the algorithm. Our bound tells that if both the dimension and the maximum ratio of radii of two spheres are bounded, then our algorithm runs in O(n log n + K) time with O(n + K) space, where K denotes the number of pairs of colliding spheres.
MARS: a multiple access scheme with sender driven and reception first for smart antenna in ad hoc networks
Authors: Wei Kuang Lai, Kuo-Shu Tseng, Jiunn-Ching Chen
Venue: Wireless Communications Mobile Computing (2009)

The deployment of directional antennas offers many advantages, such as transmission range extension, co-channel interference reducing, the increasing of spatial reuse degree, throughput improving of networks, and transmission power saving. Hence, many ad hoc MAC protocols with directional antennas have been proposed. However, these protocols do not provide significant improvement of network performance due to the lack of supporting multiple transmissions and receptions simultaneously. With the adaptive beam-forming system (Smart Antenna), a newly designed MAC protocol (MARS) that enables nodes with multiple transmissions and receptions is proposed. Simulation results show that our MARS do exploit the advantage of space division multiple access. In terms of total number of data forward and complete sessions in bottleneck nodes, MARS achieves three times better than Novel and nine times better than IEEE 802.11. In addition, the end-to-end delay keeps very short. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Possession System: Adaptation Support Middleware for Collaborative Multimedia Applications in Java
Authors: Masahiro Mochizuki, Hideyuki Tokuda
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

Possession System is middleware which realizes a simple framework to deal with the adaptation of collaborative multimedia application. The system is based on Possession Model which provides users with a consistent view of application components, networked sensors, and distributed devices by introducing two separated abstractions: Body and Soul. The adaptation is achieved through the changes of relationships among Bodies and Souls with a simple operation named possession. The adaptation actions can be invoked both manually and automatically by monitoring the changes of the environment underlying beneath the applications. The middleware is applicable to adaptive systems in mobile and ubiquitous computing environment where unpredictable changes in available computing resources, device configuration, and geographics location frequently occure. We describe how collaborative multimedia applications using our middleware adaptively behave.
Power supply signal calibration techniques for improving detection resolution to hardware Trojans
Authors: Reza M. Rad, Xiaoxiao Wang, Mohammad Tehranipoor, Jim Plusquellic
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Chip design and fabrication is becoming increasingly vulnerable to malicious activities and alternations with globalization. An adversary can introduce a Trojan designed to disable and/or destroy a system at some future time (Time Bomb) or the Trojan may serve to leak confidential information covertly to the adversary. This paper proposes a taxonomy for Trojan classification and then describes a statistical approach for detecting hardware Trojans that is based on the analysis of an ICs power supply transient signals. A key component to improving the resolution of power analysis techniques to Trojans is calibrating for process and test environment (PE) variations. The main focus of this research is on the evaluation of four signal calibration techniques, each designed to reduce the adverse impact of PE variations on our statistical Trojan detection method.
Discovering fuzzy personal moving profiles in wireless networks
Authors: Tzung-Pei Hong, Cheng-Ming Huang, Shi-Jinn Horng
Venue: Applied Soft Computing (2009)

Wireless networks and mobile applications have grown very rapidly and have made a significant impact on computer systems. Especially, the usage of mobile phones and PDA is increased very rapidly. Added functions and values with these devices are thus greatly developed. If some regularity can be known from the user mobility behavior, then these functions and values can be further expanded and used intelligently. This paper thus attempts to discover fuzzy personal mobility patterns for helping systems provide personalized service in a wireless network. The arrival time and the duration time of each location area visited by a mobile user are used as important attributes in representing the results. Since both the arrival time and the duration time are numeric, fuzzy concepts are used to process them and to form linguistic terms. A fuzzy mining algorithm has then been proposed, which is based on the AprioriAll algorithm, but different from it in several ways. The difference causes a delicate consideration in the design of the algorithm. An example is also given to demonstrate the algorithm. The linguistic representation of personal mobility patterns will be more natural and understandable for the system managers to provide better personalized service in a wireless network.
Instructional designs for the development of transferable knowledge and skills: A cognitive load perspective
Authors: Slava Kalyuga
Venue: Computers in Human Behavior (2009)

This paper analyzes the main points and results of a set of the previous papers in this Special Issue from the point of view of developing characteristics of flexible-transferable-expertise. It focuses on cognitive load issues related to the acquisition of deep transferable knowledge structures and developing metacognitive and self-regulation skills. The contributions to this Special Issue demonstrate that appropriate instructional support and optimal levels of control over the learning processes, enhanced by self-explanation and self-visualization techniques, may enhance learners' abilities to transfer their knowledge and skills. Better understanding of the role of germane cognitive load, as well as our abilities to measure different types of load and high-level cognitive processes are essential for further progress in this area.
Securing Layer-2 Path Selection in Wireless Mesh Networks
Authors: Md. Shariful Islam, Md. Abdul Hamid, Byung Goo Choi, Choong Seon Hong
Venue: Information Security Applications: 9th International Workshop, WISA 2008, Jeju Island, Korea, September 23-25, 2008, Revised Selected Papers (2009)

The current draft standard of 802.11s has defined routing for Wireless Mesh Networks (WMNs) in layer-2 and to differentiate from layer-3 routing, it termed layer-2 routing as path selection. The layer-2 path selection (LPS) mechanism is fully specified in the draft of IEEE 802.11s for WMNs. However, routing with security provision is not specified in the standard. Our study identifies that the current path selection mechanism is vulnerable to various types of routing attacks like flooding, route re-direction, spoofing etc. In this paper, we develop a novel Secure Layer-2 Path Selection (SLPS) mechanism that uses cryptographic extensions to provide authenticity and integrity of routing messages. Particularly, the proposed SLPS prevents unauthorized manipulation of mutable fields in the routing messages. Results from analysis and simulation demonstrate that SLPS protocol is robust against identified attacks and provides higher packet delivery ratio, requires no extra communication cost and incurs little path acquisition delay, computational and storage overhead to accomplish secure path selection.
An Optimal Parallel Algorithm for Constructing a Spanning Forest on Trapezoid Graphs
Authors: Hirotoshi Honma, Shigeru Masuyama
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Given a simple graph G with n vertices, m edges and k connected components. The spanning forest problem is to find a spanning tree for each connected component of G. This problem has applications to the electrical power demand problem, computer network design, circuit analysis, etc. An optimal parallel algorithm for finding a spanning tree on the trapezoid graph is given by Bera et al., it takes O(log n) time with O(n/log n) processors on the EREW (Exclusive-Read Exclusive-Write) PRAM. Bera et al.'s algorithm is very simple and elegant. Moreover, it can correctly construct a spanning tree when the graph is connected. However, their algorithm can not accept a disconnected graph as an input. Applying their algorithm to a disconnected graph, Concurrent-Write occurs once for each connected component, thus this can not be achieved on EREW PRAM. In this paper we present an O(log n) time parallel algorithm with O(n/log n) processors for constructing a spanning forest on trapezoid graph G on EREW PRAM even if G is a disconnected graph.
A Theoretical Analysis of On-Line Learning Using Correlated Examples
Authors: Chihiro Seki, Shingo Sakurai, Masafumi Matsuno, Seiji Miyoshi
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this paper we analytically investigate the generalization performance of learning using correlated inputs in the framework of on-line learning with a statistical mechanical method. We consider a model composed of linear perceptrons with Gaussian noise. First, we analyze the case of the gradient method. We analytically clarify that the larger the correlation among inputs is or the larger the number of inputs is, the stricter the condition the learning rate should satisfy is, and the slower the learning speed is. Second, we treat the block orthogonal projection learning as an alternative learning rule and derive the theory. In a noiseless case, the learning speed does not depend on the correlation and is proportional to the number of inputs used in an update. The learning speed is identical to that of the gradient method with uncorrelated inputs. On the other hand, when there is noise, the larger the correlation among inputs is, the slower the learning speed is and the larger the residual generalization error is.
Discriminating the relevance of web search results with measures of pupil size
Authors: Flavio T.P. Oliveira, Anne Aula, Daniel M. Russell
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

The overwhelming amount of information on the web makes it critical for users to quickly and accurately evaluate the relevance of content. Here we tested whether pupil size can be used to discriminate the perceived relevance of web search results. Our findings revealed that measures of pupil size carry information that can be used to discriminate the relevance of text and image web search results, but the low signal-to-noise ratio poses challenges that need to be overcome when using this technique in naturalistic settings. Despite these challenges, our findings highlight the promise that pupillometry has as a technique that can be used to assess interest and relevance in web interaction in a non-intrusive and objective way.
A Perceptually Inspired Variational Framework for Color Enhancement
Authors: Rodrigo Palma-Amestoy, Edoardo Provenzi, Marcelo Bertalmío, Vincent Caselles
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2009)

Basic phenomenology of human color vision has been widely taken as an inspiration to devise explicit color correction algorithms. The behavior of these models in terms of significative image features (such as, e.g., contrast and dispersion) can be difficult to characterize. To cope with this, we propose to use a variational formulation of color contrast enhancement that is inspired by the basic phenomenology of color perception. In particular, we devise a set of basic requirements to be fulfilled by an energy to be considered as 'perceptually inspired', showing that there is an explicit class of functionals satisfying all of them. We single out three explicit functionals that we consider of basic interest, showing similarities and differences with existing models. The minima of such functionals is computed using a gradient descent approach. We also present a general methodology to reduce the computational cost of the algorithms under analysis from O(N2) to O(N logN), being N the number of pixels of the input image.
Improving RSVP for Better Support of Internet Multimedia Applications
Authors: Laurent Mathy, David Hutchison, Stefan Schmid, Geoff Coulson
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

We have observed the failure of RSVP to be widely accepted as the solution to resource reservation in the Internet. Because we are convinced of the need for resource reservation, in at least parts of the Internet, to support multimedia communications, we have set about trying to improve RSVP. By careful study of the protocol, we have identified areas for improvement, and propose REDO RSVP, a reduced overhead version that includes a fast establishment mechanism (FEM). In this paper we describe the rationale for REDO RSVP and present an analysis of its features and operations.
Automatic processor customization for zero-overhead online software verification
Authors: Hong Lu, Alessandro Forin
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

The PSL-to-Verilog (P2V) compiler can translate a set of assertions about a block-structured software program into a hardware design to be executed concurrently with the program. The assertions validate the correctness of the software program without altering the program's temporal behavior in any way, a result never previously achieved by any online model-checking system. Additionally, the techniques and implementations described apply to any general purpose program and the absence of execution overhead renders the system ideal for the verification and debugging of real-time systems. Assertions are expressed in a simple subset of the property specification language (PSL), an IEEE standard originally intended for the behavioral specification of hardware designs. The target execution system is the eMIPS processor, a dynamically self-extensible processor realized with a field-programmable gate array (FPGA). The system can concurrently execute and check multiple programs at a time. Assertions are compiled into eMIPS Extensions, which are loaded by the operating system software into a portion of the FPGA, and discarded once the program terminates. If an assertion is violated, the program receives an exception, otherwise, it executes fully unaware of its verifier. The software program is not modified in any way. It can be compiled separately with full optimizations and executes with or without the corresponding hardware checker. The P2V compiler, implemented in Python, generates code for the implementation of the eMIPS processor running on the Xilinx ML401 development board. It is currently used to verify software properties in areas such as testing, debugging, intrusion detection, and the behavioral verification of concurrent and real-time programs.
True and transparent distributed composition of aspect-components
Authors: Bert Lagaisse, Wouter Joosen
Venue: Proceedings of the ACM/IFIP/USENIX 2006 International Conference on Middleware (2006)

Next-generation middleware must support complex compositions that involve dependencies between multiple components residing in different contexts and locations in the network. In this paper we present DyMAC, an aspect-oriented middleware platform that offers an aspect-component model to support such complex distributed compositions by means of advanced remote pointcuts, transparent remote advice and distributed instantiation scopes for aspects. The remote pointcuts can evaluate on calls and executions of remote method invocations and can also evaluate on the distributed context. The remote advice can be executed transparently in a remote environment while still respecting the full semantics of existing types of advice, including around advice. The component model unifies aspects and components into one entity with one interaction standard. To our knowledge, DyMAC middleware is the first AO middleware platform that distributes the concepts of aspect-oriented composition completely and transparently.
A case for mutual notification: a survey of P2P protocols for massively multiplayer online games
Authors: Stephan Krause
Venue: Proceedings of the 7th ACM SIGCOMM Workshop on Network and System Support for Games (2008)

Massively Multiplayer Online Games and Virtual Worlds are among the most popular applications on the Internet. As player numbers increase, the limits of the currently dominant client/server architecture are becoming obvious. To overcome those limits, the research community has developed protocols for these applications based on peer-to-peer technologies. However, no consensus has been found yet on how the potential of peer-to-peer can be optimally used for these applications. In this paper, we compare and evaluate three classes of proposed architectures that within themselves share common design principles. One representative protocol of each class is examined in greater detail. The performance of these protocols is then evaluated in different scenarios in a series of simulations. We show, that the architecture with the best performance in message delay is the one relying on mutual notification for detecting new neighbors and on direct connections to all neighbors for exchanging event messages. Furthermore, this architecture is still competitive regarding the required bandwidth.