ppxscal/embedding_network huggingface dataset:
A Tree-Based Approach for Event Prediction Using Episode Rules over Event Streams
Authors: Chung-Wen Cho, Ying Zheng, Yi-Hung Wu, Arbee L. Chen
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

Event prediction over event streams is an important problem with broad applications. For this problem, rules with predicate events and consequent events are given, and then current events are matched with the predicate events to predict future events. Over the event stream, some matches of predicate events may trigger duplicate predictions, and an effective scheme is proposed to avoid such redundancies. Based on the scheme, we propose a novel approach CBS-Tree to efficiently match the predicate events over event streams. The CBS-Tree approach maintains the recently arrived events as a tree structure, and an efficient algorithm is proposed for the matching of predicate events on the tree structure, which avoids exhaustive scans of the arrived events. By running a series of experiments, we show that our approach is more efficient than the previous work for most cases.
No l Grid-Points in Spaces of Small Dimension
Authors: Hanno Lefmann
Venue: Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management (2008)

Motivated by a question raised by Pór and Wood in connection with compact embeddings of graphs in ${\mathbb Z}^d$, we investigate generalizations of the no-three-in-line-problem. For several pairs (k,l) we give algorithmic lower, and upper bounds on the largest sizes of subsets S of grid-points from the d-dimensional T × ¿ ×T-grid, where no l distinct grid-points of S are contained in a k-dimensional affine or linear subspace.
1-Persistent Collision-Free CSMA Protocols for Opportunistic Optical Hyperchannels
Authors: Jing Chen, Jianping Wang, Hui Yu, Ashwin Gumaste, S. Q. Zheng
Venue: Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing (2008)

Recently, a new WDM optical network infrastructure named SMART [1], which is capable of dynamically setting up, modifying, and tearing down optical connections, was proposed. The performance of SMART is determined by the performance of its hyperchannels, which are essentially optical buses or light-trails. Previously proposed CSMA protocols for unidirectional optical buses can be used as distributed medium access control protocols for hyperchannels. However, these protocols are either unfair, or not work-conserving. In this paper, we propose a class of work-conserving, collision-free, and fair CSMA protocols for opportunistic hyperchannels which are tailored hyperchannels for SMART. We show that the performances of our proposed protocols are much better than that of p i -persistent CSMA and that of priority-based CSMA protocol in terms of throughput and fairness.
Analysis and Solution to the Mode Mixing Phenomenon in EMD
Authors: Yunchao Gao, Guangtao Ge, Zhengyan Sheng, Enfang Sang
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

The problem of mode mixing in Empirical Mode Decomposition (EMD) is caused by the intermittency signals and noises, and it should be classified to solve. A new method has been proposed in this paper to remove the large-scale components from the intrinsic mode function (IMF) with small-scales. In this method, the intermittency components were located by Teager-Kaiser Energy Operator firstly. And then difference, EMD and cumulative sum were combined to separate the discrepant components in scale. The algorithm has been used to analyze the simulated signal and the real LOD data. And the results showed that the method can remove the mode mixing phenomena, and a set of IMFs with clear scale range can be obtained.
Abstraction of Graph Transformation Systems by Temporal Logic and Its Verification
Authors: Mitsuharu Yamamoto, Yoshinori Tanabe, Koichi Takahashi, Masami Hagiya
Venue: Verified Software: Theories, Tools, Experiments: First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions (2005)

Abstract model checking has been studied as a promising technique for applying various model checking methods to infinite state systems. Graph transformation systems [11], which can model many distributed and concurrent algorithms, are examples of such infinite systems.We have been studying abstraction of several kinds of link structures, which are instances of graph transformation systems. First, we introduced abstraction of heap structures using regular expressions mainly for verifying concurrent garbage collection algorithms [14,15]. In this setting, each cell has a color and a link to another cell. Since cells can be allocated dynamically during execution, it is impossible to enumerate all the execution states of the heap. Thus we need to use abstraction for applying finite verification methods.
From dense photometric stereo to interactive three-dimensional markup
Authors: Chi-Keung Tang
Venue:  (2007)

Three-dimensional (3D) model is still the de facto fundamental component for 3D graphic rendering. While significant advances in techniques in 3D rendering have been made, and extremely realistic and fascinating virtual world can be displayed, creating a detailed 3D model, especially for a physically non-existing object, is still a tedious or very time-consuming task that requires a lot of skills and labors. On the other hand, in computer vision, automatic techniques in stereo reconstruction allow us to capture detail geometric information from the real world. Although stereo vision may not be a direct answer to 3D modeling that satisfies the high quality demand necessary for realistic rendering to reveal subtle geometric details, the scientific merits and mathematics underpinning recent advances in stereo vision inspire useful ideas which may lead to new solution to interactive 3D modeling. In this thesis, we will present such a new solution that brings together photometric stereo and interactive modeling under the auspices of human-computer interaction. By starting our study on dense photometric stereo, where a large class of objects can be digitized precisely despite the presence of severe shadows, highlight, transparency and complex geometry, high-quality and accurate normal maps can be produced. Such normal map serves as a vehicle to our innovative and effective interactive 3D markup strategy, which we call the ShapePalette metaphor, which constitutes a bridge connecting human and computer so that they can work in tandem to create complex 3D shapes, where the human user is only required to draw a few simple 2D primitives and a detail 3D model can be quickly materialized from line arts, sketches, and photographs. We present impressive results and propose future work on this thesis.
ECG Signal Classification Using GAME Neural Network and Its Comparison to Other Classifiers
Authors: Miroslav Čepek, Miroslav Šnorek, Václav Chudáček
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

Long term Holter monitoring is widely applied to patients with heart diseases. Many of those diseases are not constantly present in the ECG signal but occurs from time to time. To detect these infrequent problems the Holter long time ECG recording is recorded and analysed. There are many methods for automatic detection of irregularities in the ECG signal. In this paper we will comapare the Support Vector Machine (SVM), J48 decision tree (J48), RBF artificial neural network (RBF), Simple logistic function and our novel GAME neural network for detection of the Premature Ventricular Contractions. We will compare and discuss classification performance of mentioned methods. There are also very many features which describes the ECG signal therefore we will try to identify features important for correct classification and examine how the accuracy is affected with only selected features in training set.
The Two-Criteria Gateways Location and Topology Assignment Problem in Hierarchical WANs: An Exact Algorithm and Computational Results
Authors: Przemyslaw Ryba, Andrzej Kasprzak
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

In the paper the problem of designing two-level hierarchical structure of wide area network (WAN) is considered. The goal is to select gateways location, topology of 2nd level network, channel capacities and flow routes in order to minimize linear combination of the total average delay per packet and the total cost of leasing capacities of channels of 2nd level network, subject to budget constraint. An exact algorithm based on branch and bound method is proposed. Some results of computational experiments are reported. Relying on computational experiments, several properties of the considered problem, important from practical point of view, are formulated.
The Beginning of Model Checking: A Personal Perspective
Authors: E. Allen Emerson
Venue: 25 Years of Model Checking: History, Achievements, Perspectives (2008)

Model checking provides an automated method for verifying concurrent systems. Correctness specifications are given in temporal logic. The method hinges on an efficient and flexible graph-theoretic reachability algorithm. At the time of its introduction in the early 1980's, the prevailing paradigm for verification was a manual one of proof-theoretic reasoning using formal axioms and inference rules oriented towards sequential programs. The need to encompass concurrent programs, the desire to avoid the difficulties with manual deductive proofs, and the small model theorem for temporal logic motivated the development of model checking.
Interface optimization for poly silicon/tungsten gates
Authors: Sven Schmidbauer, Jens Hahn, Axel Buerke, Frank Jakubowski, Olaf Storbeck, Yu-Wei Ting, Thomas Schuster, Jürgen Faul
Venue: Microelectronic Engineering (2008)

Novel dual work function (DWF) based transistors featuring low gate resistances are presented. The process discussed enables extremely fast array timings easily and is thus key to fulfilling the performance requirements for high performance DRAM chips. The key enabler of the advanced gate integration scheme and its properties is the understanding of tuning the interface contact resistance. The objective of this work was to systematically investigate the role of the interface between poly-Si and metal of DRAM gate structures focused on electrical data. Contact resistance values, speed and elemental analysis information summarize the main findings of the gate development and furthermore the stable control of the very thin film stack in high volume production.
Study on separation for the frequency bands of EEG signal and frequency band relative intensity analysis based upon EMD
Authors: Ji Zhong, Qin Shuren, Peng Chenglin
Venue: Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation (2008)

The different background rhythms and their restraint in electroencephalgraph(EEG) signal can reflect the different physiological states of the patient. The concept of frequency band relative intensity ratio(FBRIR) is introduced to evaluate the state of EEG background rhythms of a patient, and empirical mode decomposition(EMD) is used to realize the separation of the frequency bands in EEG signal effectively. Furthermore, Gabor transform is applied for the computation of FBRIR. Then the FBRIR of every frequency band in EEG signal is displayed in a same window, which can show the distribution of every background rhythms in EEG signal intuitionisticly and provide more clincal information for doctors.
A Statistical Approach to Automatic Heart Segmentation and Modelling from Multiple Modalities
Authors: Pavel Krasnopevtsev, Dzmitry Hlindzich, Tudor Poerner, Aleh Kryvanos
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

In this work, we consider a statistical approach to the fully automatic segmentation of heart walls from Magnetic Resonance Imaging (MRI) data and the reconstruction of three-dimensional models from other modalities. The method is based on utilizing a Markov Random Fields (MRF) model that provides powerful opportunities for noise suppressing and, at the same time, for an accurate contour preserving segmentation. Implementing local statistics on pixel neighbourhoods makes possible the detecting weak borders, that are even not detected by observation. The process is followed by the active appearance modelling to reduce the oversegmentation. Further, the statistical shape database can be used for 3D reconstruction of complete heart models from data derived by using other image acquisition techniques, like cardiac Ultrasound. This approach was evaluated on a set of degraded phantom data.
Handling Multiobjective Problems with a Novel Interactive Multi-Swarm PSO
Authors: Yujia Wang, Yupu Yang
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

In this paper, an interactive multi-swarm PSO is proposed to handle the multiobjective optimization problems (MOPs). The preference relation of the objectives is specified during the optimization process. The selective pressure in the main swarm is improved by the preference information from the assistant swarm. The simulation results indicate that the proposed algorithm attains better performance of convergence and diversity.
Video Tracking Association Problem Using Estimation of Distribution Algorithms in Complex Scenes
Authors: Miguel A. Patricio, J. García, A. Berlanga, José M. Molina
Venue: Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II (2007)

In this work an efficient and robust technique of data association will be developed as a search in the hypotheses space defined by the possible association between detections and tracks. The full data association problem in visual tracking is formulated as a hypotheses search with a heuristic evaluation function to take into account structural and specific information such as distance, shape, colour, etc. This heuristic should represent the real problem so that its optimization leads to the solution of each situation. In order to guarantee performance in real time, the search process will have assigned a bounded amount of time to give the solution. The number of evaluations is restricted to accomplish this bound. The use of Estimation Distribution Algorithms (EDA) allows the application of an Evolutionary Computation technique to search in the hypothesis space. The performance of alternative algorithms used to provide the solution with this time constraint will be compared considering complex situations.
Robust digital watermarking in the curvelet domain
Authors: Scott Dexter
Venue:  (2008)

Watermarking is a method in computer security by which identifiers of sources or copyright owners of digital signals are embedded into the respective signals themselves in order to keep track of where a signal comes from or who the copyright owners are. In general, a watermarking system must have two characteristics: perceptual transparency and robustness. This thesis proposes a method for transparently and robustly embedding a watermark into the curvelet transform of grayscale images. The image is partitioned into small blocks; Fast Discrete Curvelet Transform (FDCT) via Unequally-Spaced Fast Fourier Transforms (USFFT) is employed to decompose each block into curvelet domain. We embed the watermark into the selected blocks, scale and curvelet coefficients based on the edge map of the cover image. The embedding strength is adjusted by a Just Noticeable Distortion (JND) model computed for each curvelet coefficient. Robustness is tested against a variety of types of image attacks. Since the curvelet transform enables most of the energy of the object to be localized in just a few coefficients, the optimally sparse representations of image edges allows for the embedded watermarks to recover from severe image degradation. However, the block-based watermarking algorithm in curvelet domain provides low robustness against geometrical distortion because geometrical distortion (e.g. rotation) desynchronizes the embedding location in the cover work. A scheme relying on the radon transforms and edge detection is developed to synchronize embedding location before the watermark detector is applied. The proposed scheme estimates the geometrical distortion the cover image was subjected to and restores the distorted image to its original state. Thus, the improved watermarking system provides high tolerance to geometric attacks as well as normal image processing. We also propose a technique for selecting the threshold for watermarking detection based on statistical analysis over host signals and embedding schemes. Experiments show our scheme is capable of keeping the probability of false positive and false negative both low and is generally robust against a wide range of image attacks. Finally, we present a new quality measure, M-SVD, which expresses the perceived distortion of image/video. We show our measure to be strongly correlated with evaluations by the Human Visual System. The quality of the watermarked images marked by our proposed curvelet based algorithm is evaluated with this approach. The evaluation demonstrates the transparency of our watermarking system, the performance of JND modeling is also confirmed with M-SVD.
Wheat Phenology Extraction from Time-Series of SPOT/VEGETATION Data
Authors: Linlin Lu, Huadong Guo
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

Vegetation phenological dynamics is an indicator of plant response to climate regime. Various methodologies are developed to determine the timing of vegetation greenup and senescence using time series of remote sensing data, but most of them are used for forests. This paper presented a simple phenology model to identify wheat (Triticum aestivum L.) greenup onset date from SPOT/VEGETATION data. An experiment is performed for a wheat field in the North China plain.
The Development of Search Engine in China and its Problems Revealed in Net Information Retrieval
Authors: Mingzhang Zuo, Xia Zhang, Qiang Liu
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

Nowadays, Internet goes deep into people’s daily routines, brings human beings mass information, and becomes an increasingly important channel of obtaining information. Facing such tremendous amount of information, it is a matter of life and death for us to look for a rapid and efficient method of hunting information. This paper revolves around Search Engine, which is a most efficient tool for information organization and retrieval on the Internet. The methods of retrieving information on the Internet have been improved greatly in recent years because of the application of search engines. Nevertheless, for some reasons, search engine does not provide Internet users perfect retrieval service, and often returns unsatisfied results. Basing on the statistical data from authority, this thesis concentrates on the current developmental situation and its problems found in application of search engines in China, aims at providing search engine developers some references.
Approximation Property of Weighted Wavelet Neural Networks
Authors: Shou-Song Hu, Xia Hou, Jun-Feng Zhang
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

A new weighted wavelet neural network is presented, And the approximation capability of such weighted wavelet neural network is also studied based on the traits of Lebesgue partition, the operator theory and the topology structure of the relatively compact set in Hilbert space. The simulation results indicate that the weighted wavelet neural network is a uniformed approximator, which can approximates the nonlinear function in compact set by arbitrary precision.
Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix
Authors: Nor'Aini Aris, Shamsatun Nahar Ahmad
Venue: Computer Mathematics: 8th Asian Symposium, ASCM 2007, Singapore, December 15-17, 2007. Revised and Invited Papers (2008)

The comrade matrix of a polynomial is an analogue of the companion matrix when the matrix is expressed in terms of a general basis such that the basis is a set of orthogonal polynomials satisfying the three-term recurrence relation. We present the algorithms for computing the comrade matrix, and the coefficient matrix of the corresponding linear systems derived from the recurrence relation. The computing times of these algorithms are analyzed. The computing time bounds, which dominate these times, are obtained as functions of the degree and length of the integers that represent the rational number coefficients of the input polynomials. The ultimate aim is to apply these computing time bounds in the analysis of the performance of the generalized polynomial greatest common divisor algorithms.
Online Regret Bounds for Markov Decision Processes with Deterministic Transitions
Authors: Ronald Ortner
Venue: Proceedings of the 19th international conference on Algorithmic Learning Theory (2008)

We consider an upper confidence bound algorithm for Markov decision processes (MDPs) with deterministic transitions. For this algorithm we derive upper bounds on the online regret (with respect to an (¿-)optimal policy) that are logarithmic in the number of steps taken. These bounds also match known asymptotic bounds for the general MDP setting. We also present corresponding lower bounds. As an application, multi-armed bandits with switching cost are considered.
Optimal solution for the two-dimensional facility layout problem using a branch-and-bound algorithm
Authors: Maghsud Solimanpur, Amir Jafari
Venue: Computers and Industrial Engineering (2008)

Facilities layout problem is one of the important issues affecting the productivity of manufacturing systems. This problem deals with the determination of optimum arrangement of manufacturing facilities with respect to different layout patterns. A two-dimensional layout is an arrangement fashion in which the manufacturing facilities are laid in a planar area. In this paper, a mixed-integer nonlinear mathematical programming model is proposed for determining the optimum layout of machines in a two-dimensional area. The parameters considered by the proposed model are (a) production capacity of machines, (b) multiple machines of each type (machine redundancy), (c) processing route of parts, (d) dimensions of machines. A technique is used to linearize the formulated nonlinear model. An algorithm based on branch-and-bound approach is proposed to obtain the optimal solution of the proposed mathematical programming model. A simple illustrative example is discussed to demonstrate the technique, and then small-, medium-, and large-sized problems are solved. Comparison of the layout obtained from the proposed model indicates that the proposed model considerably reduces the total distance traveled by products as compared to an optimum process layout configuration for small- and medium-sized problems. The paper concludes that the proposed branch-and-bound approach performs inefficient for large-sized problems. For large-sized problems, the proposed mathematical programming model should be solved through meta-heuristics like genetic algorithms, tabu search, etc.