ppxscal/embedding_network huggingface dataset:
Algorithms for time series knowledge mining
Authors: Fabian Moerchen
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

Temporal patterns composed of symbolic intervals are commonly formulated with Allen's interval relations originating in temporal reasoning. This representation has severe disadvantages for knowledge discovery. The Time Series Knowledge Representation (TSKR) is a new hierarchical language for interval patterns expressing the temporal concepts of coincidence and partial order. We present effective and efficient mining algorithms for such patterns based on itemset techniques. A novel form of search space pruning effectively reduces the size of the mining result to ease interpretation and speed up the algorithms. On a real data set a concise set of TSKR patterns can explain the underlying temporal phenomena, whereas the patterns found with Allen's relations are far more numerous yet only explain fragments of the data.
Camera-based observation of football games for analyzing multi-agent activities
Authors: Michael Beetz, Nico v. Hoyningen-Huene, Jan Bandouch, Bernhard Kirchlechner, Suat Gedikli, Alexis Maldonado
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

This paper describes a camera-based observation system for football games that is used for the automatic analysis of football games and reasoning about multi-agent activity. The observation system runs on video streams produced by cameras set up for TV broadcasting. The observation system achieves reliability and accuracy through various mechanisms for adaptation, probabilistic estimation, and exploiting domain constraints. It represents motions compactly and segments them into classified ball actions.
An optimization for query answering on ALC database
Authors: Pakornpong Pothipruk, Guido Governatori
Venue: Proceedings of the 17th Australasian Database Conference - Volume 49 (2006)

Query answering over OWLs and RDFs on the Semantic Web is, in general, a deductive process. To this end, OWL, a family of web ontology languages based on description logic, has been proposed as the language for the Semantic Web. However, reasoning even on ALC, a description logic weaker than OWL, faces efficiency problem. To obviate this problem, at least for ALC, we propose a partition approach that improves the efficiency by splitting the search space into independent Aboxes. Each partition class, i.e., an Abox, can be queried independently. The answer to a query is the simple combination of the answers from each Abox. We prove the correctness of this approach and we outline how to represent compactly the content of each independent Abox. This work can be seen as an optimization for querying a deductive semi-structured database.
Generating Structured Documents from HTML Tables
Authors: Yeon-Seok Kim, Kyong-Ho Lee
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

A table is a facility for presenting relational information structurally and concisely. As a prerequisite for extracting information from the Web, This paper presents an efficient method for extracting logical structures from HTML tables and transforming them into XML documents. The proposed method consists of two phases: area segmentation and structure analysis. The area segmentation step cleans up the table and segments the normalized table into attribute and value areas by checking visual and semantic coherency. Particularly, heuristic rules are also proposed to handle complex tables. In the structure analysis phase, the hierarchical structure between attribute and value areas is analyzed and transformed into an XML representation using the proposed table model. Experimental results with a large number of HTML tables show that the proposed method performs better than the conventional method.
Towards Scaleable Self-Governance through Situated Cognitive Systems: Utilising Deliberative Logic to Provide an Encompassing Epistemic Layer
Authors: M. Randles, A. Taleb-Bendiab, P. Miseldine
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

A knowledge meta-system, to include and encompass a complex system, is proposed as a deliberative cognitive structure to enable selfgovernance and autonomic management. It is shown how, using a propositional sentential account of system epistemology via an observer model with known metrics and dimensions, as signatures for selforganising behaviour, associated with large scale networks, may be used to infer behaviour. Finally it is demonstrated how such a system can control and determine the type of evolving networks through an example generic network building example.
Partitioning Methodology for Heterogeneous Reconfigurable Functional Units
Authors: Michalis D. Galanis, Gregory Dimitroulakos, Costas E. Goutis
Venue: The Journal of Supercomputing (2006)

A partitioning methodology between the reconfigurable hardware blocks of different granularity, which are embedded in a generic heterogeneous architecture, is presented. The fine-grain reconfigurable logic is realized by an FPGA unit, while the coarse-grain reconfigurable hardware by a 2-Dimensional Array of Processing Elements. Critical parts, called kernels, are mapped on the coarse-grain reconfigurable logic for improving performance. The partitioning method is mainly composed by three steps: the analysis of the input code, the mapping onto the Coarse-Grain Reconfigurable Array and the mapping onto the FPGA. The partitioning flow is implemented by a prototype software framework. Analytical partitioning experiments, using five real-world applications, show that the execution time speedup relative to an all-FPGA solution ranges from 1.4 to 5.0.
Design and Analysis of a Fully Non-blocking Quantum Switch
Authors: Chuan-Ching Sue, Wei-Ren Chen, Chin-Yu Huang
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 2 (2006)

A switching device is required to build a realistic network which can handle the explosive growth of network traffic. However, the drawback of the switching device is mainly focused on the blocking problem. Previous studies have presented the solutions in the quantum context to avoid blocking at the expense of increasing packet loss and the exponential size of quantum gates. In this paper, we design a fully non-blocking quantum switch using the linear number O(N2) of quantum SWAP gates. Comparisons with a previously proposed quantum self-routing packet switch is also presented in terms of the hardware complexity, the propagation delay and packet loss probability
A Robust Watermarking Algorithm Adopting Double Embedding
Authors: Xiao-hua Qiao, Shu-xun Wang, Quan Wen, Zhao Xu
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

In this paper, an adaptive blind watermarking algorithm is proposed, which presents a new method of block classification based on the characteristic of visual masking of HVS (human visual system) model, including energy and variance. According to the new classification method, classify image blocks and select quantization pedometers adaptively to embed the watermark into DC component. At the same time, because of the shortage of watermark intensity only embedded into DC components, the algorithm presents that the same watermark is embedded into mid-frequency subbands by changing the order of these coefficients under invisibility. This is a blind watermarking algorithm, the watermark can be extracted without the original picture needed. Experimental results and attacks analysis show that the proposed algorithm is effective and robust to common image processing and some geometric attacks, such as JPEG lossy compression, scaling, additive noise, rotation, histogram equilibrium, contrast adjusting, brightness adjusting, filtering and so on.
State-dependent Importance Sampling and large Deviations
Authors: Jose Blanchet, Jingchen Liu, Peter Glynn
Venue: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools (2006)

Large deviations analysis for light-tailed systems provides an asymptotic description of the optimal importance sampler in the scaling of the Law of Large Numbers. As we will show by means of a simple example related to computational finance, such asymptotic description can be interpreted indifferent ways suggesting several importance sampling algorithms, some of them state-dependent. In turn, the performance of the suggested algorithms can be substantially different.
Impulse noise removal by a global-local noise detector and adaptive median filter
Authors: Shi-Qiang Yuan, Yong-Hong Tan
Venue: Signal Processing (2006)

Noise detection-based median filters have been widely adopted to reduce impulse noise. However, the number of misclassified pixels is obviously increased at high noise density. In order to overcome this drawback, a global-local noise detector is proposed in this paper. Based on the noise detection, an adaptive median algorithm is presented. Simulation results show that the new filter can effectively reduce impulse noise and preserve more details of original images.
Studying Design Collaboration in DesignWorld: An Augmented 3D Virtual World
Authors: Leman Figen Gul, Mary Lou Maher
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

New technological developments offer new collaborative design environments to designers. There is a great interest in these new tools however it is clear that we know very little about how these new design media would affect the way architects collaborate. The study reported in this paper characterizes the collaborative design behaviour of a pair of designers in a prototype which has a 3D modelling tool and 2D sketch pad. The experimental study involves collecting data while a pair of architects work on a prescribed design task. The collected data includes video, verbal protocol data, and screen images. Our study shows that while 2D sketching encourages development of design ideas, the 3D virtual world encourages collaborative modelling of design solutions, in particular designers collaboratively refine the 3D model to visually analyse the design idea as they effectively develop realistic design representations.
Evaluation of Parallel EDAs to Create Chemical Calibration Models
Authors: A. Mendiburu, J. Miguel-Alonso, J. A. Lozano
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

Estimation of Distribution Algorithms (EDAs) are a set of optimization techniques that have been successfully applied to different kinds of problems. In this paper, we deal with the creation of multivariate calibration models in quantitative chemistry. For this purpose, we use parallel implementations of two EDAs (EBNABIC and UMDA), using different approaches to create a calibration model using data obtained from controlled reactions. Once the calibration model has been trained, it can be used to predict initial concentrations for some species taking part in new reactions. The results show that these new approaches are able to obtain good-quality calibration models. Moreover, the use of parallel algorithms allows researchers to complete experiments faster and to study a wider set of alternative solutions.
SEVA: A Soft-Error- and Variation-Aware Cache Architecture
Authors: Luong D. Hung, Masahiro Goshima, Shuichi Sakai
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

As SRAM devices are scaled down, the number of variation-induced defective memory cells increases rapidly. Combination of ECC, particularly SECDED, with a redundancy technique can effectively tolerate a high number of defects. While SECDED can repair a defective cell in a block, the block becomes vulnerable to soft errors. This paper proposes SEVA, an original soft-error- and variationaware cache architecture. SEVA exploits SECDED to tolerate variation-induced defects while preserving high resilience against soft errors. Information about the defectiveness and data dirtiness is maintained for each SECDED block. SEVA allows only the clean data to be stored in defective (but still usable) blocks of a cache. An error occurring in a defective block can be detected and the correct data can be obtained from the lower level of the memory hierarchy. SEVA improves yield and reliability with low overheads.
A reputation mechanism for layered communities
Authors: Elodie Fourquet, Kate Larson, William Cowan
Venue: ACM SIGecom Exchanges (2006)

The exchange of digital goods via peer-to-peer (P2P) systems is a challenging problem for e-commerce. Participants rarely know each other, and may be completely anonymous, so the self-interest of the participants works against trust and they miss out on the benefits of cooperation. Reputation mechanisms help to remedy selfish misbehaviour. In this paper a new layered reputation mechanism establishes a trusted P2P environment, with bad content filtered out and novel content continuously introduced, by giving appropriate incentives to participants. A simulation was created and experiments run to validate the design.
CIOs Discuss the Role of IT in Organizational Change
Authors: William W. Agresti
Venue: IT Professional (2006)

Once looked upon as a back-ffice enabler, IT now is an important part of the business and stratetgic plan of many companies.
A Bayes-spectral-entropy-based measure of camera focus using a discrete cosine transform
Authors: Matej Kristan, Janez Perš, Matej Perše, Stanislav Kovačič
Venue: Pattern Recognition Letters (2006)

In this paper we present a novel measure of camera focus based on the Bayes spectral entropy of an image spectrum. In order to estimate the degree of focus, the image is divided into non-overlapping sub-images of 8x8 pixels. Next, sharpness values are calculated separately for each sub-image and their mean is taken as a measure of the overall focus. The sub-image spectra are obtained by an 8x8 discrete cosine transform (DCT). Comparisons were made against four well-known measures that were chosen as reference, on images captured with a standard visible-light camera and a thermal camera. The proposed measure outperformed the reference measures by exhibiting a wider working range and a smaller failure rate. To assess its robustness to noise, additional tests were conducted with noisy images.
A privacy-preserving protocol for neural-network-based computation
Authors: M. Barni, C. Orlandi, A. Piva
Venue: Proceedings of the 8th workshop on Multimedia and security (2006)

The problem of secure data processing by means of a neural network (NN) is addressed. Secure processing refers to the possibility that the NN owner does not get any knowledge about the processed data since they are provided to him in encrypted format. At the same time, the NN itself is protected, given that its owner may not be willing to disclose the knowledge embedded within it. Two different levels of protection are considered: according to the first one only the NN weights are protected, whereas the second level also permits to protect the node activation functions. An efficient way of implementing the proposed protocol by means of some recently proposed multi-party computation techniques is described.
High-Quality Real Time Motion Detection Using PTZ Cameras
Authors: Alessandro Bevilacqua, Pietro Azzari
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

The approaches based on background difference are the most used with fixed cameras to perform motion detection, because of the high quality of the segmentation achieved. However, real time requirements prevent most of the algorithms proposed in literature to exploit the background difference with Pan-Tilt-Zoom (PTZ) cameras in real world applications. Nevertheless, using color information to detect motion yields a sensible improvement in terms of accuracy of segmented masks, by helping reducing camouflage and detecting shadows. To our knowledge, the algorithm we have conceived is the first to exploit color information and perform real time alignment and background difference based on background mosaicing, with PTZ cameras. In addition, no prior information regarding scene or camera parameters have been used for either spatial or tonal alignment. Accurate experiments performed on indoor and outdoor sequences allow to assess both quality and performance of the method we devised.
Mobile Technology and Content Delivery in Education
Authors: Rory McGreal, Prof. Kinshuk
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

The purpose of this workshop is to identify various issues that are pertinent to the development and delivery of content in the context of mobile devices. The workshop will focus on identifying ways to achieve reusability, interoperability, adaptivity of content delivery to the user and to the devices, and user friendliness while still focusing on pedagogical requirements and enhanced learning experiences.
Understanding the Dynamic Behavior of Modern DPLL SAT Solvers through Visual Analysis
Authors: Cameron Brien, Sharad Malik
Venue: Proceedings of the Formal Methods in Computer Aided Design (2006)

Despite the many recent improvements in the speed and robustness of DPLL-based SAT solvers, we still lack a thorough understanding of the working mechanisms and dynamic behaviour of these solvers at run-time. In this paper, we present TIGERDISP, a tool designed to allow researchers to visualize the dynamic behaviour of modern DPLL solvers in terms of time-dependent metrics such as decision depth, implications and learned conflict clauses. It is our belief that inferences about dynamic behaviour can be drawn more easily by visual analysis than by purely aggregate post-execution metrics such as total number of decisions/implications/conflicts. These inferences can then be validated through detailed quantitative analysis on larger sets of data. To this end, we have used TIGERDISP with the HAIFASAT and MINISAT solvers and have generated a few specific inferences about their relatively efficient and inefficient solving runs. We have then tested one of these inferences through quantitative analysis on a larger data set and have presented our findings in this paper. An important application of TIGERDISP would be in the development of a solver that employs adaptive algorithms. This is an area that has intrigued researchers in the past, but has not seen significant results for lack of a clear understanding as to what constitutes good progress during the run of a SAT solver. With better knowledge of dynamic behaviour, it is conceivable that an adaptive solver could be designed such that it switches between several competitive heuristics at runtime based on a quantitative analysis of its own dynamic behaviour.
A 4 Gsample/s 2 bits flash ADC with 2---4 GHz input bandwidth for radio astronomy applications
Authors: Deschans David
Venue: Analog Integrated Circuits and Signal Processing (2006)

This paper presents the design and the measurement results of a high speed A/D converter (ADC or digitizer) developed for radio-astronomy applications and especially for the ALMA (Atacama Large Millimeter Array) project. This monolithic digitizer is implemented in a BiCMOS 0.35 ¿m SiGe process for high frequency mixed-signal applications. The main characteristics of this circuit are a 2 bits resolution with 3 quantization levels (equivalent to 1.5 bits) with 4 Gsample/s rate, a wide input bandwidth from 2 GHz up to 4 GHz under full Nyquist condition. The adopted digitizer architecture is that of a conventional flash analog to digital converter structure. The overall chip dissipates 652 mW under ± 1.25 V supply and the die area is 5.4 mm2.
3D game design with programming blocks in StarLogo TNG
Authors: Kevin Wang, Corey McCaffrey, Daniel Wendel, Eric Klopfer
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

Research on the effectiveness of using a block programming language with a three-dimensional environment and game design as the basis for curriculum to teach children concepts in Computer Science. We observed a lower barrier to entry and faster learning in seventh to ninth graders exposed to the new curriculum using StarLogo TNG.
Active Service Quality Management in ASEMA system
Authors: Markus Sihvonen, Mikko Nieminen, Johannes oikarinen, Tomi Raty
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

One of the purposes of the Active Service Environment Management system (ASEMA) is to provide the best possible multimedia service experience to end users. This is realized by dynamically adapting to changes in service environment's configuration and used network infrastructure's quality of service (QoS) changes. The research problem of the paper is to find a solution for proactive approach to manage multimedia service performance in a dynamic service environment. The research is based on the constructive method by analyzing the related publications and experimentation with the selected technologies by implementing the solutions part of the ASEMA prototype. The prototype has profile negotiation functionality that dynamically updates ASEMA profiles according to dynamic changes in an end user's service environment. The quality of service management functionality in ASEMA monitor's actively underlying network's QoS level. It adjusts quality of video stream according to the changes in QoS levels of the used network infrastructure.
Optimum stuff threshold modulation schemes for digital data transmission
Authors: S. S. Abeysekera
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

The method of 'stuff threshold modulation' (STM) is widely used with pulse stuffing in network synchronizers to obtain reduced jitter power at the output of desynchronizers. Of the various STM waveforms that appear in the published literature, none have been selected as an optimum for a given set of synchronizer-desynchronizer operating conditions. This paper formulates the problem of STM waveform optimization for arbitrary desynchronizer PLL characteristics and a specified range of synchronizer clock frequency offsets. By comparing three waveforms, i.e. a random sequence, a saw tooth sequence and a modified wave sequence, it has been shown that one particular type of STM waveform does not always produce optimum jitter performances under all conditions.