ppxscal/embedding_network huggingface dataset:
On reversibility of random binning based data-hiding techniques: security perspectives
Authors: Sviatoslav Voloshynovskiy, Oleksiy Koval, Emre Topak, José Emilio Vila-Forcén, Thierry Pun
Venue: Proceedings of the 8th workshop on Multimedia and security (2006)

Reversibility of data-hiding refers to the reconstruction of original host data at the decoder from the stego data. Previous works on the subject are concentrated on the reversibility of data-hiding techniques from multimedia perspectives. However, from the security point of view, that at our knowledge was not exploited in existing studies, reversibility could be used by an attacker to remove the complete trace of watermark data from the stego data in the sense of designing the worst case attack. Thus, the aim of this paper is to analyze the reversibility of data-hiding techniques based on random binning from the security perspectives.
Constraint-based Fuzzy Optimization Data Fusion for Sensor Network Localization
Authors: Shao-Long Dong, Jian-Ming Wei, Tao Xing, Hai-Tao Liu
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

Wireless location methods in sensor network have received significant attention in recent years. In this paper, we present a data fusion architecture and explore a Fuzzy Optimization data fusion (FODF). Simulation results show that the overall accuracy of location estimation in wireless location systems can be significantly improved when the fuzzy optimization data fusion methods are used.
Game Design Education: Integrating Computation and Culture
Authors: Janet Murray, Ian Bogost, Michael Mateas, Michael Nitsche
Venue: Computer (2006)

Although many universities focus their digital media curricula on game production and game studies, Georgia Tech defines a third approach that integrates technical and cultural knowledge by emphasizing research into the expressive potential of games.
Scheduling Independent Tasks in Heterogeneous Environments under Communication Constraints
Authors: Petros Lampsas, Thanasis Loukopoulos, Fedon Dimopoulos, Marouso Athanasiou
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

With the advent of the Grid, task scheduling in heterogeneous environments becomes more and more important. Of particular interest is the fact that especially in scientific experiments a non negligible amount of data must be transferred to the processing node before a task can commence execution. Given bandwidth constraints, scheduling both computations and data transfers is required. In this paper we first develop a suitable model that captures heterogeneity in the processing nodes while imposing communication constraints. We proceed by proposing scheduling heuristics with the aim of minimizing the total makespan of a set of independent tasks. Through a series of experiments we illustrate the potential of a particular heuristic that is based on backfilling.
Proposal of Virtual Space Browser Enables Retrieval and Action with Semantics which is Shared by Multi Users
Authors: Kenichi KAKU, Hiroyasu MINAMI, Takashi TOMII, Hiroyuki NASU
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

We proposed "Virtual Office Environment (VOE)", which is a virtual space in which semantics is shared by Ontology. It allows the retrieval and action with users' intentions. Each user can do two things in virtual space. (1) Each user can perform retrieval and action with shared semantics (e.g. put all papers onto an empty bookshelf). (2) Each user can retrieve with history and other's action with users' intention. This paper proposes a design methodology of a browser using VOE. In addition, we have implemented a prototype system. This paper assesses the browser's feasibility.
Crossing number is hard for cubic graphs
Authors: Petr Hliněný
Venue: Journal of Combinatorial Theory Series B (2006)

It was proved by [M.R. Garey, D.S. Johnson, Crossing number is NP-complete, SIAM J. Algebraic Discrete Methods 4 (1983) 312-316] that computing the crossing number of a graph is an NP-hard problem. Their reduction, however, used parallel edges and vertices of very high degrees. We prove here that it is NP-hard to determine the crossing number of a simple 3-connected cubic graph. In particular, this implies that the minor-monotone version of the crossing number problem is also NP-hard, which has been open till now.
Audio Integrity Protection and Falsification Estimation by Embedding Multiple Watermarks
Authors: Michael Gulbis, Erika Muller, Martin Steinebach
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

The recognition of digital audio data manipulation is a challenge addressed by various fragile and contentfragile watermarking algorithms. But so far none of the approaches provides satisfying results with respect to manipulation detection. Especially distinguishing malicious attacks from allowed post production operations is still an open issue. We introduce a novel watermarkingbased approach for audio data falsification recognition. We embed multiple watermarks with various characteristics into the audio data to be protected. By analyzing the quality of the retrieved watermarks we obtain information about the nature of the manipulation of the audio data. In comparison to known feature-embedding algorithms, this is rather a forensic approach using watermarking as a hint. Our method is verified using several audio data sets.
Resource Allocation for Session-Based Two-Dimensional Service Differentiation on e-Commerce Servers
Authors: Xiaobo Zhou, Jianbin Wei, Cheng-Zhong Xu
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

A scalable e-commerce server should be able to provide different levels of quality of service (QoS) to different types of requests based on clients' navigation patterns and the server capacity. E-Commerce workloads are composed of sessions. In this paper, we propose a session-based two-dimensional (2D) service differentiation model for online transactions: intersession and intrasession. The intersession model aims to provide different levels of QoS to sessions from different customer classes, and the intrasession model aims to provide different levels of QoS to requests in different states of a session. A primary performance metric of online transactions is slowdown. It measures the waiting time of a request relative to its service time. We present a processing rate allocation scheme for 2D proportional slowdown differentiation. We then introduce service slowdown as a systemwide QoS metric of an e-commerce server. It is defined as the weighted sum of request slowdown in different sessions and in different session states. We formulate the problem of 2D service differentiation as an optimization of processing rate allocation with the objective of minimizing the service slowdown of the server. We prove that the derived rate allocation scheme based on the optimization guarantees client requests' slowdown to be square-root proportional to their prespecified differentiation weights in both intersession and intrasession dimensions. We evaluate this square-root proportional rate allocation scheme and a proportional rate allocation scheme via extensive simulations. Results validate that both schemes can achieve predictable, controllable, and fair 2D service differentiation on e-commerce servers. The square-root proportional rate allocation scheme provides 2D service differentiation at a minimum cost of service slowdown.
A simulation study to assess the efficacy of linear control theory models for the coordination of a two-stage customized service supply chain
Authors: Douglas J. Morrice, Edward G. Anderson, Saurav Bharadwaj
Venue: Proceedings of the 36th conference on Winter simulation (2004)

In this paper, we conduct a simulation study to evaluate linear control theory models applied to the management and coordination of a two-stage customized service supply chain. Linear models that were proposed in previous research are compared against more general nonlinear models for three different levels of coordination: centralized, decentralized, and no information sharing. Using simulation and regression analysis, we show that the linear models yield results that are off by an average of six percent or less for parameter values observed in practice.
Salient Motion Information Detection Technique Using Weighted Subtraction Image and Motion Vector
Authors: Yeon-sung Choi, Piao Zaijun, Sun-woo Kim, Tae-hun Kim, Chun-bae Park
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

Moving object detection is very important for video surveillance in modern days. In special case, we can categorize motions into two types - salient and non-salient motion. In this paper, we first calculate temporal difference image for extract moving objects and adapt to dynamic environments and next, we also propose a new algorithm to detect salient motion information in complex environment by combining temporal difference image and binary block image which is calculated by motion vector using the newest MPEG-4 and EPZS.
Adaptive nonlinear Wiener-Laguerre-lattice models
Authors: Z. Fejzo, H. Lev-Ari
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

In this work we develop an adaptive nonlinear estimation technique, polynomial model-based, that has guaranteed stability and makes parsimonious use of coefficients. Our approach to the development of reduced-complexity adaptive nonlinear filters is based on a combination of: (a) The Wiener model of nonlinear systems (both FIR and IIR) and its application to nonlinear estimation from white Gaussian signals; (b) Wiener's notion of fixed (Laguerre) pre-orthogonalization, which we have extended to include adaptive pre-orthogonalization with respect to arbitrary (non-white and non-Gaussian) input signals; (c) Efficient implementation of memoryless nonlinear maps for uncorrelated inputs based on (Hermite) orthogonal polynomials; (d) Application of suitably modified RLS and LMS adaptation techniques to determine the coefficients of such nonlinear maps.
Designing the Execution of Learning Activities in Complex Learning Processes Using LPCEL
Authors: Jorge Torres, Juan Manuel Dodero, Ignacio Aedo, Paloma Diaz
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

The contemporary education has begun to observe constructivist position as important in understanding diversity in education. Instructional design on technology (IDT) presents important challenges to integrate principles, models and techniques inspired by this new perspective emerging in educational technology. The complex learning process (CLP) is a vision that can be suitable to facilitate this aim. In order to face these challenges, it is essential to integrate new technology-supported learning. Our vision is focused on the development of learning process composition and execution languages (LPCEL), which can facilitate the design, composition and execution of CLP. This work presents an overview of LPCEL specification, so that it can be a reference for the development of related technologies.
Implementation of cryptosystems based on Tate pairing
Authors: Lei Hu, Jun-Wu Dong, Ding-Yi Pei
Venue: Journal of Computer Science and Technology (2005)

Tate pairings over elliptic curves are important in cryptography since they can be used to construct efficient identity-based cryptosystems, and their implementation dominantly determines the efficiencies of the cryptosystems. In this paper, the implementation of a cryptosystem is provided based on the Tate pairing over a supersingular elliptic curve of MOV degree 3. The implementation is primarily designed to re-use low-level codes developed in implementation of usual elliptic curve cryptosystems. The paper studies how to construct the underlying ground field and its extension to accelerate the finite field arithmetic, and presents a technique to speedup the time-consuming powering in the Tate pairing algorithm.
Conditional Fault-Tolerant Cycle-Embedding of Crossed Cube
Authors: Hao-Shun Hung, Gen-Huey Chen, Jung-Sheng Fu
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

The crossed cube, which is a variation of the hypercube, possesses some properties superior to the hypercube. In this paper, assuming that each node is incident with at least two fault-free links, we show that an n-dimensional crossed cube can tolerate up to 2n - 5 link faults, while retaining a fault-free Hamiltonian cycle. The result is optimal with respect to the number of link faults tolerated. We also verify that the assumption is practically meaningful by evaluating its probability to occur, which is very close to 1, even if n is small.
Decision support for cots selection
Authors: Tom Wanyama
Venue:  (2006)

In the last decade, the world of software development has evolved rapidly. This evolution has led to component-based software development, which in turn, has generated tremendous interest in the development of plug-and-play reusable software, leading to the concept of Commercial Off-The-Shelf (COTS) software components. The use of COTS is increasingly becoming commonplace. This is mainly due to shrinking budgets, accelerating rates of COTS enhancement, development time and effort constraints, and expanding system requirements. However, the COTS marketplace is characterized by a vast array of products and product claims, as well as extreme quality and capability differences among products. Therefore, there is need for a robust Decision Support System (DSS) to assist software developers and other stakeholders to select appropriate components for projects. In this research we propose an agent-based DSS for COTS selection and negotiation. The main task of the agents is to assist COTS selection stakeholders to conduct simulation-based evaluation of COTS products so as to determine the impact of different scenarios of COTS selection needs, preferences and constraints. Being web-based, the proposed DSS improves information sharing among stakeholder. Moreover, it addresses uncertainty issues related to credibility of information source, ability of the COTS selection team, changing system requirements, and changing COTS characteristics due to updates of COTS products.
The Interaction of Social and Emotional Processes in the Brain
Authors: Catherine J. Norris, E. Elinor Chen, David C. Zhu, Steven L. Small, John T. Cacioppo
Venue: Journal of Cognitive Neuroscience (2004)

Social stimuli function as emotional barometers for the immediate environment are the catalysts for many emotional reactions, and have inherent value for relationships and survival independent of their current emotional content. We, therefore, propose that the neural mechanisms underlying social and emotional information processing may be interconnected. In the current study, we examined the independent and interactive effects of social and emotional processes on brain activation. Whole-brain images were acquired while participants viewed and categorized affective pictures that varied on two dimensions: emotional content (i. e., neutral, emotional) and social content (i. e., faces/people, objects/scenes). Patterns of activation were consistent with past findings demonstrating that the amygdala and part of the visual cortex were more active to emotionally evocative pictures than to neutral pictures and that the superior temporal sulcus was more active to social than to nonsocial pictures. Furthermore, activation of the superior temporal sulcus and middle occipito-temporal cortex showed evidence of the interactive processing of emotional and social information, whereas activation of the amygdala showed evidence of additive effects. These results indicate that interactive effects occur early in the stream of processing, suggesting that social and emotional information garner greater attentional resources and that the conjunction of social and emotional cues results in synergistic early processing, whereas the amygdala appears to be primarily implicated in processing biologically or personally relevant stimuli, regardless of the nature of the relevance (i. e., social, emotional, or both).
Simulating airspace redesign for arrivals to Detroit-Wayne County Airport (DTW)
Authors: Justin Boesel, David Bodoh
Venue: Proceedings of the 36th conference on Winter simulation (2004)

In 2001, Detroit Metropolitan Wayne County Airport (DTW) opened a new runway parallel to three existing runways. While this increases DTW's runway capacity, the airport is served by an airspace (routes, procedures, and controller assignments) that was designed only for a three-runway airport. To increase the airport's effective capacity, the Detroit-area Terminal Radar Approach Control facility (D21 TRACON) and nearby Air Route Traffic Control Centers (ARTCC) are redesigning their airspace. This paper describes the simulation modeling effort to estimate delay and cost benefits of the ARTCC redesign for arrival traffic. The model, written in the SLX simulation language, represents miles-in-trail (MIT) restrictions, as well as air traffic controllers' ability to direct flights to different paths dynamically, based on predicted demand downstream. The redesign work is part of the Federal Aviation Administration's Midwest Airspace Capacity Enhancement (MACE) project.
On the potential of norm-governed behavior in different categories of artificial societies
Authors: Paul Davidsson, Stefan Johansson
Venue: Computational Mathematical Organization Theory (2006)

Based on a classification of artificial societies and the identification of four different types of stakeholders in such societies, we investigate the potential of norm-governed behavior in different types of artificial societies. The basis of the analysis is the preferences of the stakeholders and how they influence the state of the society. A general conclusion drawn is that the more open a society is the more it has to rely on agent owners and designers to achieve norm-governed behavior, whereas in more closed societies the environment designers and owners may control the degree of norm-governed behavior.
Informing system design through organizational learning
Authors: Gerhard Fischer, Stefanie Lindstaedt, Jonathan Ostwald, Kurt Schneider, Jay Smith
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

This paper describes a cycle in which organizational learning and work serve each other. Experience in a real-world software development project has led us to identify several key challenges for informing software design through organizational learning. A discussion of these challenges presents steps taken toward addressing them, as well as barriers remaining. The Group Interactive Memory Manager (GIMMe) system is presented along with early results from use of the system in software design projects.
An argument-dependent approach to determining OWA operator weights based on the rule of maximum entropy: Research Articles
Authors: Jian Wu, Chang-Yong Liang, Yong-Qing Huang
Venue: International Journal of Intelligent Systems (2007)

The methods for determining OWA operator weights have aroused wide attention. We first review the main existing methods for determining OWA operator weights. We next introduce the principle of maximum entropy for setting up probability distributions on the basis of partial knowledge and prove that Xu's normal distribution-based method obeys the principle of maximum entropy. Finally, we propose an argument-dependent approach based on normal distribution, which assigns very low weights to these &ldquo;false&rdquo; or &ldquo;biased&rdquo; opinions and can relieve the influence of the unfair arguments. A numerical example is provided to illustrate the application of the proposed approach. &copy; 2007 Wiley Periodicals, Inc. Int J Int Syst 22: 209&ndash;221, 2007.
Human Body Part Labeling and Tracking Using Graph Matching Theory
Authors: Nicolas Thome, Djamel Merad, Serge Miguet
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

Properly labeling human body parts in video sequences is essential for robust tracking and motion interpretation frameworks. We propose to perform this task by using Graph Matching. The silhouette skeleton is computed and decomposed into a set of segments corresponding to the different limbs. A Graph capturing the topology of the segments is generated and matched against a 3D model of the human skeleton. The limb identification is carried out for each node of the graph, potentially leading to the absence of correspondence. The method captures the minimal information about the skeleton shape. No assumption about the viewpoint, the human pose, the geometry or the appearance of the limbs is done during the matching process, making the approach applicable to every configuration. Some correspondences that might be ambiguous only relying on topology are enforced by tracking each graph node over time. Several results present the efficiency of the labeling, particularly its robustness to limb detection errors that are likely to occur in real situations because of occlusions or low level system failures. Finally the relevance of the labeling in an overall tracking system is described.
DNA Computing Model for the 0/1 Knapsack Problem
Authors: Aili Han
Venue: Proceedings of the Sixth International Conference on Hybrid Intelligent Systems (2006)

We have devised a DNA encoding method and a corresponding DNA algorithm for the 0/1 knapsack problem. Suppose that item set I={1,2 ... n}, profit set P={p_1,p_2,...,p_n}, weight set W={w_1,w_2,...,w_n}, and knapsack capacity is c. We use two DNA strands s_i1 and s_i2 to encode each item i, where the DNA strand s_i1 is with a length of wi whose center part is with a length of p_i, and the DNA strand s_i2 is the reverse complement of the center part of s_i1. For any two items i,j we add one DNA strand s_aij as an additional code, which is the reverse complement of the last part of s_i1 and the first part of s_j1. The proposed DNA encoding method is an improvement on the previous ones, and it provides further evidence for the ability of DNA computing to solve numerical optimization problems.
Openness to Electronic Professional Development Planning: Evaluating the Interactive Logbook Project
Authors: Rachel Pilkington, Julia Meek, Dan Corlett, Tony Chan
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Students in Higher Education are increasingly called upon to develop the skills of lifelong learning and are encouraged to construct portfolios as a record of and to reflect on their learning. The Interactive Logbook (IL) project has developed software tools to support students in recording their learning electronically. As part of the ongoing evaluation of these tools we are investigating: tutor and student openness to Professional Development Planning (PDP); their expectations of support tools and the extent to which IL's affordances meet these. In this paper we report on issues arising out of the initial expectations of tutors from focus groups and interviews: Issues emerging concern both the perceived utility of PDP and tutor' openness to electronic support.