ppxscal/embedding_network huggingface dataset:
Ekfrasis: A Formal Language for Representing and Generating Sequences of Facial Patterns for Studying Emotional Behavior
Authors: Nikolaos Bourbakis, Anna Esposito, Despina Kavraki
Venue: Verbal and Nonverbal Features of Human-Human and Human-Machine Interaction: COST Action 2102 International Conference, Patras, Greece, October 29-31, 2007. Revised Papers (2008)

Emotion is a topic that has received much attention during the last few years, both in the context of speech synthesis, image understanding as well as in automatic speech recognition, interactive dialogues systems and wearable computing. This paper presents a formal model of a language (called Ekfrasis) as a software methodology that synthesizes (or generates) automatically various facial expressions by appropriately combining facial features. The main objective here is to use this methodology to generate various combinations of facial expressions and study if these combinations efficiently represent emotional behavioral patterns.
Scaling up Classifiers to Cloud Computers
Authors: Christopher Moretti, Karsten Steinhaeuser, Douglas Thain, Nitesh V. Chawla
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

As the size of available datasets has grown from Megabytes to Gigabytes and now into Terabytes, machine learning algorithms and computing infrastructures have continuously evolved in an effort to keep pace. But at large scales, mining for useful patterns still presents challenges in terms of data management as well as computation. These issues can be addressed by dividing both data and computation to build ensembles of classifiers in a distributed fashion, but trade-offs in cost, performance, and accuracy must be considered when designing or selecting an appropriate architecture. In this paper, we present an abstraction for scalable data mining that allows us to explore these trade-offs. Data and computation are distributed to a computing cloud with minimal effort from the user, and multiple models for data management are available depending on the workload and system configuration. We demonstrate the performance and scalability characteristics of our ensembles using a wide variety of datasets and algorithms on a Condor-based pool with Chirp to handle the storage.
Optimization of BER performance for UWB non-coherence receivers
Authors: Wang Ye, Yang Zhihua, Zhang Qinyu
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

The optimization on BER performance of UWB non-coherent receiver based on On-Off Keying OOK scheme is investigated. The optimum parameters combination of length of integration interval and SNR in the integration interval, which makes the BER minimum, is illustrated. A modified least-squares-based algorithm is proposed in this study, which apply the Gaussian Approximation (GA) to the exact optimal threshold. Meanwhile, the feasibility of the traditional approximation is explored. The results show the optimum parameters proposed in the study increase the system performance greatly while comparing with the conventional method.
Hand-based verification and identification using palm-finger segmentation and fusion
Authors: Gholamreza Amayeh, George Bebis, Ali Erol, Mircea Nicolescu
Venue: Computer Vision and Image Understanding (2009)

Hand-based verification/identification represent a key biometric technology with a wide range of potential applications both in industry and government. Traditionally, hand-based verification and identification systems exploit information from the whole hand for authentication or recognition purposes. To account for hand and finger motion, guidance pegs are used to fix the position and orientation of the hand. In this paper, we propose a component-based approach to hand-based verification and identification which improves both accuracy and robustness as well as ease of use due to avoiding pegs. Our approach accounts for hand and finger motion by decomposing the hand silhouette in different regions corresponding to the back of the palm and the fingers. To improve accuracy and robustness, verification/recognition is performed by fusing information from different parts of the hand. The proposed approach operates on 2D images acquired by placing the hand on a flat lighting table and does not require using guidance pegs or extracting any landmark points on the hand. To decompose the silhouette of the hand in different regions, we have devised a robust methodology based on an iterative morphological filtering scheme. To capture the geometry of the back of the palm and the fingers, we employ region descriptors based on high-order Zernike moments which are computed using an efficient methodology. The proposed approach has been evaluated both for verification and recognition purposes on a database of 101 subjects with 10 images per subject, illustrating high accuracy and robustness. Comparisons with related approaches involving the use of the whole hand or different parts of the hand illustrate the superiority of the proposed approach. Qualitative and quantitative comparisons with state-of-the-art approaches indicate that the proposed approach has comparable or better accuracy.
Bandwidth allocation in a military teleoperation task
Authors: Alia Fisher, Patricia L. McDermott, Shane Fagan
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

The implications of bandwidth allocation are described for teleoperation in a military task that involved navigation, target detection, and target identification. Color versus grayscale imagery was manipulated. Participants themselves traded off resolution and frame rate settings. Participants minimized switching between resolution/frame rate settings and tended to use settings with high resolution/low frame rate. Courses completed with the highest resolution (and lowest frame rate) had the fastest target identification times, but no other differences were observed between settings. Color imagery offered advantages for overall course time and the time to identify a tank as friendly or enemy.
Microprocessor: based multiprocessor ring structured network
Authors: Hoo-Min D. Toong
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

A good deal of interest has been generated by the use of multiprocessor distributed architecture networks for resource sharing, for load equalization, and for interprocessor message communications. Such networks generally employ node processing elements that fall into several distinct categories: general-purpose homogeneous processors, general-purpose nonhomogeneous processors, array computers, and pipe-line computers. Topology spans a multitude of configurations from generalized graph structures, to tree and star networks, to multiple-bus and time-shared bus systems.
Query expansion with a medical ontology to improve a multimodal information retrieval system
Authors: M. C. Díaz-Galiano, M.T Martín-Valdivia, L. A. Ureña-López
Venue: Computers in Biology and Medicine (2009)

Searching biomedical information in a large collection of medical data is a complex task. The use of tools and biomedical resources could ease the retrieval of the information desired. In this paper, we use the medical ontology MeSH to improve a Multimodal Information Retrieval System by expanding the user's query with medical terms. In order to accomplish our experiments, we have used the dataset provided by ImageCLEFmed task organizers for years 2005 and 2006. This dataset is composed of a multimodal collection (images and text) of clinical cases, a list of queries for each year, and a list of relevance judgments for each query to evaluate the results. The results from the experiments show that the use of a medical ontology to expand the queries greatly improves the results.
Interference-aware topology control in wireless mesh network
Authors: Hung-Chin Jang, Ren-Wei Fang
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

In wireless mesh networks, each node should help to relay packets of neighboring nodes toward gateway using multi-hop routing mechanism. Wireless mesh networks usually intensively deploy mesh nodes to cope with the problem of dead spot communication. However, the higher density of nodes deployed the higher radio interference occurred. And, this causes significant degradation of system performance. In this paper, we first transform network problem into geometry problem in graph. We define line intersection in a graph to reflect radio interference problem. We use plan sweep algorithm to find intersection lines, if any, employ Voronoi diagram algorithm to delimit the regions among nodes, use Delaunay triangulation algorithm to reconstruct the graph in order to minimize the interference among nodes. Finally, we use standard deviation to prune off those longer links (higher interference links) to have a further refinement. This hybrid solution is able to significantly reduce interference in O(n log n) time complexity.
Positive Fork Graph Calculus
Authors: Renata Freitas, Sheila R. Veloso, Paulo A. Veloso, Petrucio Viana
Venue: Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science (2009)

We introduce and illustrate a graph calculus for proving and deciding the positive identities and inclusions of fork algebras, i.e., those without occurrences of complementation. We show that this graph calculus is sound, complete and decidable. Moreover, the playful nature of this calculus renders it much more intuitive than its equational counterpart.
Integrated Agent-Based Modeling with GIS for Large Scale Emergency Simulation
Authors: Dan Guo, Bo Ren, Cheng Wang
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

Recent development in the area of complex dynamic systems includes the integration of agent-based modeling (ABM) and Geographical Information Systems (GIS), which is used to simulate spatial dynamic processes. The use of ABM for experimenting and exploring geographical phenomena is still in its infancy. The paper has presented an architecture which integrates ABM with GIS, and developed a generic model for emergency response planning against catastrophes, which applied to an urban firefighting simulation in Foshan city. Through the integration, agent-based models including real-time GIS data feeds to simulate and visualize situations unfolding in real time. It provides an accessible way to model the emergence of phenomena through individual interactions of features and real geographies over time and space.
Exponential stability of periodic solution to Cohen-Grossberg-type BAM networks with time-varying delays
Authors: Hongjun Xiang, Jinde Cao
Venue: Neurocomputing (2009)

Periodic solutions can represent various storage patterns or memory patterns in some applications. In this paper, the existence and global exponential stability of periodic solution are discussed for the Cohen-Grossberg-type bidirectional associative memory (BAM) neural networks with time-varying delays. By applying the analysis method and inequality technique, some novel sufficient conditions are obtained to ensure the existence, uniqueness, global attractivity and exponential stability of the periodic solution to the considered system. Moreover, two examples are also given to demonstrate the feasibility of the obtained results.
SLCA, composite services for ubiquitous computing
Authors: Vincent Hourdin, Jean-Yves Tigli, Stéphane Lavirotte, Gaëtan Rey, Michel Riveill
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

Main concepts to handle in ambient computing applications are hard to integrate at the same time. After studying middlewares handling a part of the challenge, and after studying possiblities of main paradigms in name of CBSE and SOA, we present our Service Lightweight Component Architecture (SLCA) model, based on three main paradigms: Web services, enabling entities interoperability, dynamic discovery, and distribution, lightweight component assemblies to create composite Web services, allowing a high dynamicity, and events, giving applications reactivity and a maximal decoupling between entities, thus enabling an even higher dynamicity. This leads to conciliate both service oriented and event driven approaches in a new way to manage a graph of cooperating services in ubiquitous systems.
Architecture and scalability of a high-speed traffic measurement platform with a highly flexible packet classification
Authors: Detlef Saí, Simon Hauger, Martin Köhn
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

Evolving network technologies, new web services and changing usage patterns continuously change traffic characteristics. But a thorough understanding of the traffic is the basis for many applications in networking. Thus, it is crucial to analyze up-to-date traffic traces collected by passive measurements in many relevant network contexts. As the traces' quality defines the significance of such analysis, the measured data is required to be complete, temporally accurate and reliable. This is especially challenging for measurements on high-speed links. In this paper, we present a scalable architecture for a high-speed, passive measurement platform for obtaining highly accurate packet traces. Its functional blocks are distributed to a specialized hardware unit and a commodity PC unit according to their specific requirements. For pre-processing, the hardware unit integrates a protocol-aware classification and filtering module which allows an easy definition of classification and filtering rules. We analyze the platform's scalability and support this by a implementation with current FPGA technology and a standard server PC.
A framework for software safety in safety-critical systems
Authors: Ben Swarup Medikonda, Seetha Ramaiah Panchumarthy
Venue: ACM SIGSOFT Software Engineering Notes (2009)

Software for safety-critical systems must deal with the hazards identified by safety analysis in order to make the system safe, risk-free, and fail-safe. Because human lives may be lost and tremendous economic costs may result if the software fails, the development of high-integrity software adopts practices that impose greater rigor on the software development processes. Software safety is a composite of many factors. Existing software quality models like McCall's and Boehm's and ISO 9126 are inadequate in addressing the software safety issues of real time safety-critical embedded systems. At present there does not exist any standard framework that comprehensively addresses the factors, criteria and metrics (FCM) approach of the quality models in respect of software safety. The safety of a software component must be considered within the context of both the overall system of which it is a component and the environment in which this system operates. It is not useful to investigate the safety of a software component in isolation. This paper proposes a new framework for software safety based on the McCall's software quality model that specifically identifies the criteria corresponding to software safety in safety critical applications. The criteria in the proposed software safety framework pertains to system hazard analysis, completeness of requirements, identification of software-related safety-critical requirements, safety-constraints based design, run-time issues management, and software safety-critical testing. This framework is then applied to a prototype safety-critical system viz. a software--based Railroad Crossing Control System (RCCS) to validate its utility.
A Novel Visualization Technique for Electric Power Grid Analytics
Authors: Pak Chung Wong, Kevin Schneider, Patrick Mackey, Harlan Foote, George Chin Jr., Ross Guttromson, Jim Thomas
Venue: IEEE Transactions on Visualization and Computer Graphics (2009)

The application of information visualization holds tremendous promise for the electric power industry, but its potential has so far not been sufficiently exploited by the visualization community. Prior work on visualizing electric power systems has been limited to depicting raw or processed infor¬mation on top of a geographic layout. Little effort has been devoted to visualizing the physics of the power grids, which ultimately determines the condition and stability of the electricity infrastructure. Based on this assessment, we developed a novel visualization system prototype, GreenGrid, to explore the planning and monitoring of the North American Electricity Infrastructure. The paper discusses the rationale underlying the GreenGrid design, describes its implementation and performance details, and assesses its strengths and weaknesses against the current geographic-based power grid visualization. We also present a case study using GreenGrid to analyze the information collected moments before the last major electric blackout in the Western United States and Canada, and a usability study to evaluate the practical significance of our design in simulated real-life situations. Our result indicates that many of the disturbance characteristics can be readily identified with the proper form of visualization.
A Smart Design for the TAN Classifier
Authors: Lujie Shao, Zhihai Wang, Shiqiang Wang
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

The naive Bayesian classifier is widely used because of it’s simplicity and effectiveness. But it has a strict assumption about the independence for each attribute, which is not obviously hold in real world domains. Many efforts have been made to relax the independence and improve the performance of the naive Bayesian classifier. Tree Augmented Naive Bayes (TAN) classifier was proved to be one of the best methods. In this paper, we analyze the implementations of distribution-based TAN classifier and the classification-based TAN classifier. Then we utilize the information theory to compute the influence between two attributes, and then proposed a new heuristic searching measurement for the tree structure. The experimental results have shown the advantage of the new classifier.
Buckling and free vibration analysis of magnetic constrained layer damping (MCLD) beam
Authors: S. Sharnappa, N. Ganesan, Raju Sethuraman
Venue: Finite Elements in Analysis and Design (2009)

This paper deals with buckling, free vibration and damping analysis of viscoelastic sandwich beam with constrained magnetostrictive layer. Eight node plane stress element is used for the analysis. The influence of viscoelastic core thickness and magnetostrictive layer thickness on the buckling and dynamic analysis of sandwich beam under magnetic environment is analyzed by considering the initial stresses due to uniform magnetic field. The validation is carried out using commercial package ANSYS 8.1, based on the thermal analogy concept given by Cote et al. [Dynamic and static modeling of piezoelectric composite structures using a thermal analogy with MSC/NASTRAN, Compos. Struct. 65 (2004) 471-484].
General linear methods for ordinary differential equations
Authors: John Butcher
Venue: Mathematics and Computers in Simulation (2009)

General linear methods were introduced as the natural generalizations of the classical Runge-Kutta and linear multistep methods. They have potential applications, especially for stiff problems. This paper discusses stiffness and emphasises the need for efficient implicit methods for the solution of stiff problems. In this context, a survey of general linear methods is presented, including recent results on methods with the inherent RK stability property.
Massively parallel volume rendering using 2--3 swap image compositing
Authors: Hongfeng Yu, Chaoli Wang, Kwan-Liu Ma
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

The ever-increasing amounts of simulation data produced by scientists demand high-end parallel visualization capability. However, image compositing, which requires inter-processor communication, is often the bottleneck stage for parallel rendering of large volume data sets. Existing image compositing solutions either incur a large number of messages exchanged among processors (such as the direct send method), or limit the number of processors that can be effectively utilized (such as the binary swap method). We introduce a new image compositing algorithm, called 2--3 swap, which combines the flexibility of the direct send method and the optimality of the binary swap method. The 2--3 swap algorithm allows an arbitrary number of processors to be used for compositing, and fully utilizes all participating processors throughout the course of the compositing. We experiment with this image compositing solution on a supercomputer with thousands of processors, and demonstrate its great flexibility as well as scalability.
Design of Asymmetric VQ Codebooks Incorporating Channel Coding
Authors: Jong-Ki Han, Jae-Gon Kim
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this paper, a communication system using vector quantization (VQ) and channel coding is considered. Here, a design scheme has been proposed to optimize source codebooks in the transmitter and the receiver. In the proposed algorithm, the overall distortion including both the quantization error and channel distortion is minimized. The proposed algorithm is different from the previous work by the facts that the channel encoder is used in the VQ-based communication system, and the source VQ codebook used in the transmitter is different from the one used by the receiver, i.e. asymmetric VQ system. And the bounded-distance decoding (BDD) technique is used to combat the ambiguousness in the channel decoder. We can see from the computer simulations that the optimized system based on the proposed algorithm outperforms a conventional system based on a symmetric VQ codebook. Also, the proposed algorithm enables a reliable image communication over noisy channels.
Collaborative Ontology Construction Using Template-Based Wiki for Semantic Web Applications
Authors: Sung-Kooc Lim, In-Young Ko
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Collaborative ontology construction and management have become an important issue for allowing domain experts to build domain knowledge that are needed for Semantic Web applications. However, it is normally a difficult task for domain experts to create an ontology-based model and to produce knowledge elements based on the model. In this paper, we propose a Wiki-based environment where domain experts can easily and collaboratively organize domain knowledge. In this approach, templates can be defined and associated with ontology to enable users to arrange knowledge components in a Wiki pages and to store them based on an ontology-based model. We have developed and tested a Template-based Semantic Wiki for u-health applications.