ppxscal/embedding_network huggingface dataset:
Specification of Software Component Requirements Using the Trace Function Method
Authors: Colm Quinn, Sergiy Vilkomir, David Parnas, Srdjan Kostic
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

This paper describes the application of the Trace Function Method to specify the requirements of a software component. We illustrate the method on a software component of a telecommunications system that was developed by Ericsson. Beginning with incomplete informal descriptions, we analysed the requirements of the system and wrote a description that contains all pertinent information in one easily used reference document. The resulting documentation is more compact and complete than traditional software documentation and provides precise information that will be useful for testing and inspection.
A Framework for Evaluating Video Object Segmentation Algorithms
Authors: Elisa Drelie Gelasca, Touradj Ebrahimi, Mustafa Karaman, Thomas Sikora
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

Segmentation of moving objects in image sequences plays an important role in video processing and analysis. Evaluating the quality of segmentation results is necessary to allow the appropriate selection of segmentation algorithms and to tune their parameters for optimal performance. Many segmentation algorithms have been proposed along with a number of evaluation criteria. Nevertheless, no psychophysical experiments evaluating the quality of different video object segmentation results have been conducted. In this paper, a generic framework for segmentation quality evaluation is presented. A perceptually driven automatic method for segmentation evaluation is proposed and compared against an existing approach. Moreover, on the basis of subjective results, perceptual factors are introduced into the novel objective metric to meet the specificity of different segmentation applications such as video compression. Experimental results confirm the efficiency of the proposed evaluation criteria.
A discrete event simulation model simplification technique
Authors: Rachel T. Johnson, John W. Fowler, Gerald T. Mackulak
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Cycle Time -- Throughput curves (CT-TH), which plot the average cycle time versus start rate for a given product mix, are often used to support decisions made in manufacturing settings, such as the impact of proposed changes in start rate on mean cycle time. Discrete event simulation is often used to generate estimations of cycle time at a significant number of traffic intensities (start rates). However, simulation often requires long run lengths and extensive output analysis. In most manufacturing environments, the time and/or budget available for such simulations is limited. As demands for faster and more accurate results are required, alternative approaches to improving simulation efficiency must be investigated. This research seeks to develop a procedure for simplifying a detailed model into a fast (abstract) simulation model that achieves a statistically indistinguishable level of accuracy and precision. This technique has particular application in the simulation of semiconductor manufacturing facilities.
Stable and Topology-Preserving Extraction of Medial Axes
Authors: Kimikazu Kato, Hiroshi Imai
Venue: Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering (2006)

The paper presents a simple method for extracting global medial axes in a stable manner. A new index, called the normalized boundary distance, is introduced in order to measure the degree of importance of a point on the conventional medial axis. This index has a remarkable property that the set of points whose index values are greater than an arbitrarily chosen threshold is topologically equivalent to the original figure. In the proposed method, first the boundary of a given figure is replaced with a dense set of points, next the Voronoi diagram for these points is constructed, then the approximation of the medial axis is extracted from the Voronoi diagram, and finally the global medial axis is constructed by pruning the branches according to the new index. The performance of the proposed method is also shown by examples.
HotMobile 2006: Workshop on Mobile Computing Systems and Applications Digest of Proceedings
Authors: Maria R. Ebling
Venue: Proceedings of the Seventh IEEE Workshop on Mobile Computing Systems & Applications (2006)

Like the first WMCSA, the goal of this workshop was to foster interaction between practitioners of mobile computing. In keeping with this goal, we decided to return a small, informal workshop with few papers, but significant discussions. We accepted just nine papers, but we had two significant group discussions, two exciting panels, and an insightful keynote address. Approximately 40 people attended the two-day event. To reflect these changes, the organizers announced a name change for this workshop during the Opening Remarks. They reported that the workshop will now be known as "HotMobile 2006: The 7th IEEE Workshop on Mobile Computing Systems and Applications". What follows is a summary of the workshop's proceedings. It is intended as a supplement to the papers that appear in this volume, but not as a substitute for reading those papers. You can expect to find precious little information summarizing the papers because you can presumably read them in the preceding pages. Instead, I present a very short summary of the paper - just enough to remind you of its premise - and I focus my attention on the discussions that took place during the workshop.
Mobile Learning: Is Anytime + Anywhere = Always Online?
Authors: Anna Trifonova, Marco Ronchetti
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

The new e-learning trend, called mobile learning opens variety of questions to solve. To allow access to learning content anytime and anyplace a technique called hoarding is sometimes indispensable for covering the periods of disconnection. In this paper we show the outcomes of the hoarding sub-system of Mobile ELDIT system, developed at the University of Trento. Our results demonstrate that in certain scenarios anytime, anywhere m-learning might be reached even without online access available.
Exploratory Mining in Cube Space
Authors: Raghu Ramakrishnan
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

Data Mining has evolved as a new discipline at the intersection of several existing areas, including Database Systems, Machine Learning, Optimization, and Statistics. An important question is whether the field has matured to the point where it has originated substantial new problems and techniques that distinguish it fromits parent disciplines. In this paper, we discuss a class of new problems and techniques that show great promise for exploratory mining, while synthesizing and generalizing ideas from the parent disciplines. While the class of problems we discuss is broad, there is a common underlying objective-to look beyond a single data mining step (e.g., data summarization or model construction) and address the combined process of data selection and transformation, parameter and algorithm selection, and model construction. The fundamental difficulty lies in the large space of alternative choices at each step, and good solutions must provide a natural framework for managing this complexity. We regard this as a grand challenge for DataMining, and see the ideas in this paper as promising initial steps towards a rigorous exploratory framework that supports the entire process.
Using Bilinear Models for View-invariant Action and Identity Recognition
Authors: Fabio Cuzzolin
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

Human identification from gait is a challenging task in realistic surveillance scenarios in which people walking along arbitrary directions are imaged by a single camera. In this paper, motivated by the view-invariance issue in the human ID from gait problem, we address the general problem of classifying the "content" of human motions of unknown "style". Given a dataset of sequences in which different people walking normally are seen from several wellseparated views, we propose a three-layer scheme based on bilinear models, in which image sequences are mapped to observation vectors of fixed dimension using Markov modeling. We test our approach on the CMU Mobo database, showing how bilinear separation outperforms other approaches, opening the way to view- and action-invariant identity recognition, as well as subject- and view-invariant action recognition.
Sinusoidal frequency estimation in chaotic noise
Authors: H. Leung, Xinping Huang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

The problem of sinusoidal frequency estimation in chaotic noise is considered. Since the chaotic noise is inherently deterministic, a new complexity measure called the phase space volume (PSV) is introduced. The PSV quantifies the complexity of a signal by measuring its volume in a reconstructed phase space. To estimate the sinusoidal frequencies, an autoregressive (AR) model is applied to the received signal and the coefficients are estimated by minimizing the PSV of the prediction error. It is shown that the frequencies can indeed be obtained by this MPSV-AR spectral estimator. To illustrate the efficiency of this new technique, simulated chaotic noise and real-life radar clutter (radar backscatter) are used as background noise for sinusoidal frequency estimation. Basically, we assume that chaos is a good model of background noise and apply the MPSV-AR technique to estimate the frequencies. The usefulness of this approach is evaluated using real-life measurement noise (radar clutter). In both simulated and real noise environments, we observe that the MPSV-AR spectral estimator provides an efficient frequency estimates in terms of both the mean square errors and frequency resolution.
Neural Activation During Response Competition
Authors: Eliot Hazeltine, Russell Poldrack, John D. E. Gabrieli
Venue: Journal of Cognitive Neuroscience (2000)

Abstract The flanker task, introduced by Eriksen and Eriksen &lsqb;Eriksen, B. A., & Eriksen, C. W. (1974). Effects of noise letters upon the identification of a target letter in a nonsearch task. Perception & Psychophysics, 16, 143&ndash;149&rsqb;, provides a means to selectively manipulate the presence or absence of response competition while keeping other task demands constant. We measured brain activity using functional magnetic resonance imaging (fMRI) during performance of the flanker task. In accordance with previous behavioral studies, trials in which the flanking stimuli indicated a different response than the central stimulus were performed significantly more slowly than trials in which all the stimuli indicated the same response. This reaction time effect was accompanied by increases in activity in four regions: the right ventrolateral prefrontal cortex, the supplementary motor area, the left superior parietal lobe, and the left anterior parietal cortex. The increases were not due to changes in stimulus complexity or the need to overcome previously learned associations between stimuli and responses. Correspondences between this study and other experiments manipulating response interference suggest that the frontal foci may be related to response inhibition processes whereas the posterior foci may be related to the activation of representations of the inappropriate responses.
Next Step for Educational Modeling Languages: The Model Driven Engineering and Reengineering Approach
Authors: Pierre Laforcade, Christophe Choquet
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This paper argues and discusses a teacher-centered approach for the specification of learning scenarios (design), as well as the comprehension of learning scenarios (reuse), by focusing on the application of theory and results from the Model-Driven Engineering and Model-Driven Re-engineering domains.
Interpolation in Discrete Single Figure Medial Objects
Authors: Qiong Han, Stephen M. Pizer, James N. Damon
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

The discrete m-rep, a medial representation of anatomical objects made from one or more meshes of medial atoms, has many attractive properties for biomedical image analysis. The nonlinear nature of the m-rep parameters captures nonlinear deformations in anatomical objects such as twisting and bending. Most uses of m-reps require extending them to one or more continuous sheets of medial atoms. To guarantee that a continuous sheet of medial atoms does not fold, we propose an interpolation method on the medial atoms based on two medial shape operators. The radial shape operator describes the rate of swing of a medial atom's spoke. The edge shape operator describes the rate of swing of a planar curve defining the object crest. The two shape operators generate interpolated internal and end atoms, and they join together smoothly. We show the application of our interpolation method on m-reps of synthetic and real-world objects.
Preparation of Topical Reading Lists from the Link Structure of Wikipedia
Authors: Alexander D. Wissner-Gross
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Personalized reading preparation poses an important challenge for education and continuing education. Using a PageRank derivative and graph distance ordering, we show that personalized background reading lists can be generated automatically from the link structure of Wikipedia. We examine the operation of our new tool in professional, student, and interdisciplinary researcher learning models. Additionally, we present desktop and mobile interfaces for the generated reading lists.
Digital Image Watermark Algorithm in the Curvelet Domain
Authors: Zhi-yu Zhang, Wei Huang, Jiu-long Zhang, Hai-yan Yu, Yan-jun Lu
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

Watermark is a new effective digital copyright protection method and data security technology. In this paper, a digital image watermark algorithm operating in the curvelet domain is proposed. Unequally-Spaced Fast Fourier Transforms (USFFT) is employed to implement Fast Discrete Curvelet Transforms (FDCT ) to transform the digital image to the curvelet domain. The following three factors are considered when embedding the watermark in the curvelet domain: (1) the scale distribution of the curvelet coefficients; (2) the variation of high frequency components and low frequency components have different effects on HVS; (3) the impact of the variation of the curvelet coefficients on the robustness of the watermark. Combining these factors with the basic watermark algorithm, we choose the proper position to embed the watermark. The experimental results demonstrate a fine unification of robustness and invisibility and shows advantages over watermark algorithm in the ridgelet domain concerning the two aspects.
A novel coefficient scanning scheme for directional spatial prediction-based image compression
Authors: Xiaopeng Fan, Yan Lu, Wen Gao
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

Spatial prediction is a promising technique for image coding. For example, the coming AVC/H.264 standard adopts directional spatial prediction in the intra frame coding. Similar to the traditional DCT-based image coding schemes, it still scan the transform coefficients in a zigzag order, which is inefficient for coding the residual signals predicted from the different directions. To tackle this problem, a new scheme of scanning the transform coefficients by utilizing the spatial prediction information is proposed in this paper. The distribution of transform coefficients from each direction of spatial predictions is fully studied. According to the statistics, the adaptive scan table is derived for each type of spatial predictions, which is indicated by the prediction mode. Experimental results demonstrate that the proposed scheme can always outperform the JVT codec using zigzag scanning. Moreover, it does not introduce any extra computing costs in software implementation.
AWide Area Log Analyzing System Based on Mobile Agents
Authors: Takashi Katoh, Hiroki Kuzuno, Takuya Kawahara, Atsumu Watanabe, Yushi Nakai, Bhed Bahadur Bista, Toyoo Takata
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

The Internet is being widely used these days and many users are required to manage their network environments, because damages caused by worms, which spread using security holes of software, are also increasing rapidly. One of the effective means of detecting the damages caused by the worms in early stage is to analyze the network communication logs stored in computers that are spread over a wide area. However, almost all network administrators are not able to install many observation points, though a large number of observation points over a wide area of a network are needed to grasp symptoms of attacks precisely. In this paper, we propose an agent based log analyzing system by integrating the concepts of P2P network and mobile agents to realize detection and protection from the damages which may be caused by the worms in early stage. We also show results of experiments using our prototype system. The results show that our system can collect useful information from a wide area of a network, and provide means of flexible and on-demand analysis of network traffic logs to detect hostile attacks on the network.
Region-Tree Based Stereo Using Dynamic Programming Optimization
Authors: Cheng Lei, Jason Selzer, Yee-Hong Yang
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

In this paper, we present a novel stereo algorithm that combines the strengths of region-based stereo and dynamic programming on a tree approaches. Instead of formulating an image as individual scan-lines or as a pixel tree, a new region tree structure, which is built as a minimum spanning tree on the adjacency-graph of an over-segmented image, is used for the global dynamic programming optimization. The resulting disparity maps do not contain any streaking problem as is common in scanline-based algorithms because of the tree structure. The performance evaluation using the Middlebury benchmark datasets shows that the performance of our algorithm is comparable in accuracy and efficiency with top ranking algorithms.
A Comparison of Decision Tree Ensemble Creation Techniques
Authors: Robert E. Banfield, Lawrence O. Hall, Kevin W. Bowyer, W. P. Kegelmeyer
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

We experimentally evaluate bagging and seven other randomization-based approaches to creating an ensemble of decision tree classifiers. Statistical tests were performed on experimental results from 57 publicly available data sets. When cross-validation comparisons were tested for statistical significance, the best method was statistically more accurate than bagging on only eight of the 57 data sets. Alternatively, examining the average ranks of the algorithms across the group of data sets, we find that boosting, random forests, and randomized trees are statistically significantly better than bagging. Because our results suggest that using an appropriate ensemble size is important, we introduce an algorithm that decides when a sufficient number of classifiers has been created for an ensemble. Our algorithm uses the out-of-bag error estimate, and is shown to result in an accurate ensemble for those methods that incorporate bagging into the construction of the ensemble.
An Online Heuristic for Maximum Lifetime Routing in Wireless Sensor Networks
Authors: Joongseok Park Sartaj Sahni
Venue: IEEE Transactions on Computers (2006)

We show that the problem of routing messages in a wireless sensor network so as to maximize network lifetime is NP-hard. In our model, the online model, each message has to be routed without knowledge of future route requests. We also develop an online heuristic to maximize network lifetime. Our heuristic, which performs two shortest path computations to route each message, is superior to previously published heuristics for lifetime maximization—our heuristic results in greater lifetime and its performance is less sensitive to the selection of heuristic parameters. Additionally, our heuristic is superior on the capacity metric.
Visual data mining using principled projection algorithms and information visualization techniques
Authors: Dharmesh M. Maniyar, Ian T. Nabney
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

We introduce a flexible visual data mining framework which combines advanced projection algorithms from the machine learning domain and visual techniques developed in the information visualization domain. The advantage of such an interface is that the user is directly involved in the data mining process. We integrate principled projection algorithms, such as generative topographic mapping (GTM) and hierarchical GTM (HGTM), with powerful visual techniques, such as magnification factors, directional curvatures, parallel coordinates and billboarding, to provide a visual data mining framework. Results on a real-life chemoinformatics dataset using GTM are promising and have been analytically compared with the results from the traditional projection methods. It is also shown that the HGTM algorithm provides additional value for large datasets. The computational complexity of these algorithms is discussed to demonstrate their suitability for the visual data mining framework.
A Secure Threshold Proxy Signature Scheme for Mobile Agent-Based Electronic Commerce Transactions
Authors: Wenqi Liu, Jianhua Yang, Lei Wei
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

The mobile agent technology plays an important role in electronic commerce. However, security issues need to be tackled. Some schemes have been proposed to protect the private key of the agent's owner, but seldom pay attention to the abuse of the information in the agent. Threshold proxy signature scheme can be applied for avoiding the abuse of the information in the agent. However, most existing proxy signature schemes are not available for mobile agent-based electronic transactions because they have some disadvantages of the security and stability. A new threshold proxy signature scheme for the mobile agent-based electronic transactions is proposed in this paper. In the proposed scheme, the owner's private key is secure, and the information in mobile agents is protected as well because of the distribution of the information. With security and property analysis, we show that the scheme is secure and practical for mobile agent-based electronic transactions.