ppxscal/embedding_network huggingface dataset:
A new data structure for asynchronous periodic pattern mining
Authors: Jieh-Shan Yeh, Szu-Chen Lin
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

The periodic pattern mining is to discover valid periodic patterns in a time-related dataset. Previous studies mostly concern the synchronous periodic patterns. There are many methods for mining periodic patterns proposed in literature. Nevertheless, asynchronous periodic pattern mining gradually receives more and more attention recently. In this paper, we propose an efficient linked structure and the OEOP algorithm to discover all kinds of valid segments in each single event sequence. Then, refer to the general model of asynchronous periodic pattern mining proposed by Huang and Chang, we combine these valid segments found by OEOP into 1-patterns with multiple events, multiple patterns with multiple events and asynchronous periodic patterns. Besides, we implement these algorithms on two real datasets. The experimental results show that these algorithms have the good performance and scalability.
Image Data Embedding System for Watermarking Using Fresnel Transform
Authors: Seok Kang, Yoshinao Aoki
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

Watermarking is a technique embedding hidden multimedia information imperceptibly, such as images and sounds. Generally original image is transformed and coded watermark data is embedded in frequency domain watermarking models. In this paper, We propose a new data embedding method using Fresnel transform. A watermark image is Fresnel-transformed and the intensity of transformed pattern is embedded into original image. Our watermarking model has the flexibility in data hiding.It is possible to embed watermark in many different observable planes with various distance parameters of Fresnel transform and all kinds of image models such as shape, letter and photo can be used as a watermark data. Using Fresnel transform with various distance parameters, it is possible to get many channels for embedding. So our method can recover the weak point having only one transform plane in DFT and DCT domain methods. The watermarking experiments were conducted to show the validity of the proposed method, and the results show that our method can provide multi frequency domains for embedding watermark.
Perfectly reliable and secure message transmission tolerating mobile adversary
Authors: Arpita Patra, Ashish Choudhary, C. Pandu Rangan, Kannan Srinathan, Prasad Raghavendra
Venue: International Journal of Applied Cryptography (2009)

We study the problem of perfectly reliable message transmission (PRMT) and perfectly secure message transmission (PSMT) in an undirected synchronous network tolerating an all powerful threshold mobile Byzantine adversary. Specifically, we show that the mobility of the threshold adversary does not affect the possibility and optimality of PRMT and PSMT protocols. We also characterise PSMT in directed networks tolerating mobile adversary. All existing PRMT and PSMT protocols abstract the paths between the sender and the receiver as wires, neglecting the intermediate nodes in the paths, thus causing significant over estimation in the communication and round complexity of protocols. Here, we consider the underlying paths as a whole instead of abstracting them as wires and derive a tight bound on the number of rounds required to achieve reliable communication tolerating a threshold mobile adversary with arbitrary roaming speed. Finally, we briefly study PRMT and PSMT protocols in the presence of non-threshold mobile Byzantine adversary. Even though the characterisation for PRMT/PSMT is shown to be same against both threshold static and threshold mobile adversary (in this article), we show that the characterisation for PRMT/PSMT against non-threshold static and non-threshold mobile adversary are not same.
Multimedia Support in Network Protocol Processing Subsystems
Authors: See-Mong Tan, Roy H. Campbell
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Multimedia isochronous data require processing at regular intervals in order to achieve acceptable playback quality. This paper addresses the problem of network subsystem support for distributed multimedia applications in operating systems. The research demonstrates a design for a high performance network subsystem that provides quality of service guarantees to real time data in the presence of non-real time data streams. The design integrates protocol processing, processor scheduling, and parallel implementations in order to support the delivery of real time video and audio.
A new method for redundancy reduction of the time- limited signals using the optimal time domain sampling and interpolation
Authors: M. M. Ghanbarian, A. Kazerooni, Z. Haidari
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

In this paper the authors consider a general method, based on time domain samples for spectral manipulation of the time-limited signals. In this direction, all of the needed formulas for practical periodic time-limited interpolation in two cases of low pass and band pass has been derived. The work begins with dividing an arbitrary signal in time domain into the time limited non-overlapping frames, then each frame is processed to find the effective maximum frequency or equivalently the minimum number of samples that satisfy some error criteria. To find the optimum sampling frequency we used periodic interpolation for resampling and reconstruction, and suitable zero finding of the discrete variable nonlinear equation by combination of the time and frequency computation to increase the speed of convergence.
Understanding Social Robots
Authors: Frank Hegel, Claudia Muhl, Britta Wrede, Martina Hielscher-Fastabend, Gerhard Sagerer
Venue: Proceedings of the 2009 Second International Conferences on Advances in Computer-Human Interactions (2009)

Research on social robots is mainly comprised of research into algorithmic problems in order to expand a robot's capabilities to improve communication with human beings. Also, a large body of research concentrates on the appearance, i.e. aesthetic form of social robots. However, only little reference to their definition is made. In this paper we argue that form, function, and context have to be taken systematically into account in order to develop a model to help us understand social robots. Therefore, we address the questions: What is a social robot, what are the interdisciplinary research aspects of social robotics, and how are these different aspects interlinked? In order to present a comprehensive and concise overview of the various aspects we present a framework for a definition towards social robots.
MCTS Windows Server 2008 Active Directory Services Study Guide (Exam 70-640) (SET), 1 edition
Authors: Dennis Suhanovs
Venue: Exam 70-640 (2008)

The Best Fully Integrated Study System Available for Exam 70-640 With hundreds of practice questions and hands-on exercises, MCTS Configuring Windows Server 2008 Active Directory Study Guide covers what you need to know-and shows you how to prepare-for this challenging exam. 100% complete coverage of all official objectives for exam 70-640Exam Readiness Checklist at the front of the book--you're ready for the exam when all objectives on the list are checked offTwo-Minute Drills for quick review at the end of every chapterSimulated exam questions match the format, tone, topics, and difficulty of the real examCovers all the exam topics, including:Directory Services &middot; DNS &middot; AD DS Forest and Domain Structure &middot; Global Catalog Servers &middot; Flexible Single Master Operation Roles &middot; AD DS Site Topology &middot; Organizational Units and Delegation &middot; Replication &middot; Troubleshooting, Backup, and Recovery &middot; Groups and User Accounts &middot; User Authentication &middot; Group Policy &middot; AD Certificate Services &middot; AD Federated Services &middot; AD Lightweight Directory Service &middot; AD Rights Management ServiceCD-ROM includes:Complete MasterExam practice testing engine, featuring: one full practice exam; detailed answers with explanations; and Score Report performance assessment toolMasterSim interactive task simulation softwareElectronic book for studying on the goTable of contentsChapter 1. Directory ServicesChapter 2. Overview of Domain Name System (DNS)Chapter 3. Configuring DNS for Active DirectoryChapter 4. Planning and Implementing the Active Directory InfrastructureChapter 5. Planning and Implementing the Active Directory Sites and ServicesChapter 6. Managing and Maintaining an Active Directory InfrastructureChapter 7. Active Directory Troubleshooting, Backup, and RecoveryChapter 8. Creating and Maintaining Active Directory ObjectsChapter 9. Planning and Implementing Group PolicyChapter 10. Additional Active Directory Server RolesAppendix A: Windows Server 2008 Network Port ReferenceAppendix B: Windows Server 2008 Command ReferenceAppendix C: About the CDGlossaryIndex
Quicklook: A Content-Based Image Retrieval System with Learning Capabilities
Authors: G. Ciocca, I. Gagliardi, R. Schettini
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

In this demo we present a prototype system that allows the user to query an image database and progressively refine the system's response to his query by indicating the relevance, or non-relevance of the retrieved items. Tests performed on different databases have shown that the system is, even in its present proto stage, already very versatile.
Explicit multi-symplectic methods for Klein-Gordon-Schrödinger equations
Authors: Jialin Hong, Shanshan Jiang, Chun Li
Venue: Journal of Computational Physics (2009)

In this paper, we propose explicit multi-symplectic schemes for Klein-Gordon-Schrodinger equation by concatenating suitable symplectic Runge-Kutta-type methods and symplectic Runge-Kutta-Nystrom-type methods for discretizing every partial derivative in each sub-equation. It is further shown that methods constructed in this way are multi-symplectic and preserve exactly the discrete charge conservation law provided appropriate boundary conditions. In the aim of the commonly practical applications, a novel 2-order one-parameter family of explicit multi-symplectic schemes through such concatenation is constructed, and the numerous numerical experiments and comparisons are presented to show the efficiency and some advantages of the our newly derived methods. Furthermore, some high-order explicit multi-symplectic schemes of such category are given as well, good performances and efficiencies and some significant advantages for preserving the important invariants are investigated by means of numerical experiments.
Applications of Bayesian Classifiers: Uncertainty Modeling, Global Optimization, and SolidMechanics Problems
Authors: Haoyang Liu
Venue:  (2008)

In this book, it is shown how pattern recognitionapproaches developed in computer science can beseamlessly combined with statistical techniques toproduce a knowledge driven search algorithm. Twodifferent classes of applications are used todemonstrate the wide applicability of the algorithm.The first class of applications is in global designoptimization. In design optimization applications,Bayesian classification tree is used to generatehigh-performing design alternatives. The second is inthe structural mechanics of systems with spatiallyrandom properties. In applications involvingspatially random properties, the classification treeprovides pattern-based features that can be used toidentify regions of a system with desirable orundesirable local properties. The theories andexample applications should be especially useful toresearchers and professionals in the field ofuncertainty modeling and design optimization.
Numerical solution of the linearized Boltzmann equation for an arbitrary intermolecular potential
Authors: Felix Sharipov, Guilherme Bertoldo
Venue: Journal of Computational Physics (2009)

A numerical procedure to solve the linearized Boltzmann equation with an arbitrary intermolecular potential by the discrete velocity method is elaborated. The equation is written in terms of the kernel, which contains the differential cross section and represents a singularity. As an example, the Lennard-Jones potential is used and the corresponding differential cross section is calculated and tabulated. Then, the kernel is calculated so that to overcome its singularity. Once, the kernel is known and stored it can be used for many kinds of gas flows. In order to test the method, the transport coefficients, i.e. thermal conductivity and viscosity for all noble gases, are calculated and compared with those obtained by the variational method using the Sonine polynomials expansion. The fine agreement between the results obtained by the two different methods shows the feasibility of application of the proposed technique to calculate rarefied gas flows over the whole range of the Knudsen number.
Patch clustering for massive data sets
Authors: Nikolai Alex, Alexander Hasenfuss, Barbara Hammer
Venue: Neurocomputing (2009)

The presence of huge data sets poses new problems to popular clustering and visualization algorithms such as neural gas (NG) and the self-organising-map (SOM) due to memory and time constraints. In such situations, it is no longer possible to store all data points in the main memory at once and only a few, ideally only one run over the whole data set is still affordable to achieve a feasible training time. In this contribution we propose single pass extensions of the classical clustering algorithms NG and SOM which are based on a simple patch decomposition of the data set and fast batch optimization schemes of the underlying cost function. The algorithms only require a fixed memory space. They maintain the benefits of the original ones including easy implementation and interpretation as well as large flexibility and adaptability. We demonstrate that parallelization of the methods becomes easily possible and we show the efficiency of the approach in a variety of experiments.
A multi-view approach to semi-supervised document classification with incremental Naive Bayes
Authors: Ping Gu, QingSheng Zhu, Cheng Zhang
Venue: Computers Mathematics with Applications (2009)

Many semi-supervised learning algorithms only consider the distribution of word frequency, ignoring the semantic and syntactic information underlying the documents. In this paper, we present a new multi-view approach for semi-supervised document classification by incorporating both semantic and syntactic information. For this purpose, a co-training style algorithm, Co-features, is proposed. In the phase of active querying, we assign a weight to each sample document according to its uncertainty factor. Then the most informative samples are selected and labeled by other ''teachers''. In contrast to batch training mode, we developed an incremental Naive Bayes update method, which allows for more efficient training even with a large pool of unlabeled data. Experimental results show that our algorithm works successfully on the datasets Reuters-21578 and WebKB, and is superior to Co-testing in the learning efficiency.
A tangible user interface for assessing cognitive mapping ability
Authors: Ehud Sharlin, Benjamin Watson, Steve Sutphen, Lili Liu, Robert Lederer, John Frazer
Venue: International Journal of Human-Computer Studies (2009)

Wayfinding, the ability to recall the environment and navigate through it, is an essential cognitive skill relied upon almost every day in a person's life. A crucial component of wayfinding is the construction of cognitive maps, mental representations of the environments through which a person travels. Age, disease or injury can severely affect cognitive mapping, making assessment of this basic survival skill particularly important to clinicians and therapists. Cognitive mapping has also been the focus of decades of basic research by cognitive psychologists. Both communities have evolved a number of techniques for assessing cognitive mapping ability. We present the Cognitive Map Probe (CMP), a new computerized tool for assessment of cognitive mapping ability that increases consistency and promises improvements in flexibility, accessibility, sensitivity and control. The CMP uses a tangible user interface that affords spatial manipulation. We describe the design of the CMP, and find that it is sensitive to factors known to affect cognitive mapping performance in extensive experimental testing.
Mining inter-sequence patterns
Authors: Chun-Sheng Wang, Anthony J. T. Lee
Venue: Expert Systems with Applications: An International Journal (2009)

Sequential pattern and inter-transaction pattern mining have long been important issues in data mining research. The former finds sequential patterns without considering the relationships between transactions in databases, while the latter finds inter-transaction patterns without considering the ordered relationships of items within each transaction. However, if we want to find patterns that cross transactions in a sequence database, called inter-sequence patterns, neither of the above models can perform the task. In this paper, we propose a new data mining model for mining frequent inter-sequence patterns. We design two algorithms, M-Apriori and EISP-Miner, to find such patterns. The former is an Apriori-like algorithm that can mine inter-sequence patterns, but it is not efficient. The latter, a new method that we propose, employs several mechanisms for mining inter-sequence patterns efficiently. Experiments show that EISP-Miner is very efficient and outperforms M-Apriori by several orders of magnitude.
Resource management policies for fixed relays in cellular networks
Authors: Won-Hyoung Park, Saewoong Bahk
Venue: Computer Communications (2009)

Mobile stations in the cell boundary experience poor spectral efficiency due to the path loss and interference from adjacent cells. Therefore, satisfying QoS requirements of each MS at the cell boundary has been an important issue. To resolve this spectral efficiency problem at the cell boundary, deploying fixed relay stations has been actively considered. In this paper, we consider radio resource management policies concerned with fixed relays that include path selection rules, frequency reuse pattern matching, and frame transmission pattern matching among cells. We evaluate performance of each policy by varying parameter values such as relay station's position and frequency reuse factor. Through Monte Carlo simulations and mathematical analysis, we suggest some optimal parameter values for each policy and discuss some implementation issues that need to be considered in practical deployment of relay stations.
Plenary lecture II: human-integrated supervisory control of remotely piloted vehicles
Authors: S. Narayanan
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

In many complex systems, such as applications in nuclear power plants; emergency response situations, such as search and rescue missions; and in military domains, human decision makers are required to make critical decisions in a time-pressured environment. Typically, most of these applications are dynamic and uncertain and require humans making supervisory control decisions through monitoring, re-planning, troubleshooting, and control. Due to the critical nature of decision making, human operators are responsible for the safe and efficient operation of these applications. Human supervisory controllers with computerized processes must work together in achieving overall system objectives. Research on human-centered automation in aviation, satellite ground control, and nuclear power plant control has resulted in broad guidelines on system design involving human and computerized processes in supervisory control. However, problems such as increased human error, lack of situational awareness, and opacity from poorly automated systems remain, particularly in scenarios where human operators must make decisions in time-pressured planning. This talk will use human interaction with multiple remotely piloted vehicles as the domain and outline a modeling and simulation architecture for analysis of these systems from a human-centered perspective. Included in this presentation are results from an empirical evaluation focusing on decision support systems design and development.
A Utility-Based QoS Model for Emerging Multimedia Applications
Authors: Mu Mu, Andreas Mauthe, Francisco Garcia
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

Existing network QoS models do not sufficiently reflect the challenges faced by high-throughput, always-on, inelastic multimedia applications. In this paper, a utility-based QoS model is proposed as a user layer extension to existing communication QoS models to better assess the requirements of multimedia applica-tions and manage the QoS provisioning of multimedia flows. Network impairment utility functions are derived from user experiments and combined to application utility functions to evaluate the application quality. Simulation is used to demonstrate the validity of the proposed QoS model.
Uncertainty under a multivariate nested-error regression model with logarithmic transformation
Authors: Isabel Molina
Venue: Journal of Multivariate Analysis (2009)

This work aims to predict exponentials of mixed effects under a multivariate linear regression model with one random factor. Such quantities are of particular interest in prediction problems where the dependent variable is the logarithm of the variable that is the object of inference. Bias-corrected empirical predictors of the target quantities are defined. A second-order approximation for the mean crossed product error of two of these predictors is obtained, where the mean squared error is a particular case. An estimator of the mean crossed product error with second-order bias is proposed. Finally, results are illustrated through an application related to small area estimation.
A Novel Biology-Inspired Virus Detection Model with RVNS
Authors: Renchao Qin, Tao Li, Yu Zhang
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

A virus detection model based on artificial immune principles with real-valued negative selection (RVNS) is proposed. Feature vectors of program code are mapped into high dimension real-valued space. The architecture of this model, the formal definitions of self, nonself, antigen, antibody, and gene library are given. Then the process of self-tolerance of variable-sized detectors in real-valued space is discussed in detail. Variable-sized detectors provide concise representation of the detectors derived from benign files, which reduces the size of detectors set and advances the detection rate. The experimental results show that the model can detect obfuscated and firstly unknown virus more effectively than traditional model.