ppxscal/embedding_network huggingface dataset:
Neighbor-based pattern detection for windows over streaming data
Authors: Di Yang, Elke A. Rundensteiner, Matthew O. Ward
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

The discovery of complex patterns such as clusters, outliers, and associations from huge volumes of streaming data has been recognized as critical for many domains. However, pattern detection with sliding window semantics, as required by applications ranging from stock market analysis to moving object tracking remains largely unexplored. Applying static pattern detection algorithms from scratch to every window is prohibitively expensive due to their high algorithmic complexity. This work tackles this problem by developing the first solution for incremental detection of neighbor-based patterns specific to sliding window scenarios. The specific pattern types covered in this work include density-based clusters and distance-based outliers. Incremental pattern computation in highly dynamic streaming environments is challenging, because purging a large amount of to-be-expired data from previously formed patterns may cause complex pattern changes including migration, splitting, merging and termination of these patterns. Previous incremental neighbor-based pattern detection algorithms, which were typically not designed to handle sliding windows, such as incremental DBSCAN, are not able to solve this problem efficiently in terms of both CPU and memory consumption. To overcome this, we exploit the "predictability" property of sliding windows to elegantly discount the effect of expiring objects on the remaining pattern structures. Our solution achieves minimal CPU utilization, while still keeping the memory utilization linear in the number of objects in the window. Our comprehensive experimental study, using both synthetic as well as real data from domains of stock trades and moving object monitoring, demonstrates superiority of our proposed strategies over alternate methods in both CPU and memory utilization.
E-snakes and ladders: a hypermedia educational environment for portable devices
Authors: Petros Lalos, Fotis Lazarinis, Dimitris Kanellopoulos
Venue: International Journal of Mobile Learning and Organisation (2009)

This article presents e-snakes and ladders (e-S L), a game-based educational environment for portable devices. The e-S L is based on the classic table game 'snakes and ladders' and enriches the table game with various types of activities, such as questions and answers and webquests. It provides a pleasant electronic-learning environment with an easy to use authoring tool for the instructor. The e-S L is based on communication services and protocols (e.g. e-mail, short message service (SMS), MMS, HTTP and FTP) and on context-aware technologies. It supports learning standards, such as the IMS question and test interoperability (QTI) specification, the IMS Learner Information Package (IMS LIP) specification, e-portfolio, Dublin Core metadata creation and webquest. Furthermore, the article presents a learning scenario which is authored for demonstrating the e-S L functionality. The findings from this study offer interesting insights into the extent to which computer gaming might be employed as a tool for supporting learning.
A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs
Authors: Gustavo Arroyo, J. Guadalupe Ramos, Salvador Tamarit, Germán Vidal
Venue: Logic-Based Program Synthesis and Transformation: 18th International Symposium, LOPSTR 2008, Valencia, Spain, July 17-18, 2008, Revised Selected Papers (2009)

We introduce a transformational approach to improve the first stage of offline partial evaluation of functional programs, the so called binding-time analysis (BTA). For this purpose, we first introduce an improved defunctionalization algorithm that transforms higher-order functions into first-order ones, so that existing techniques for termination analysis and propagation of binding-times of first-order programs can be applied. Then, we define another transformation (tailored to defunctionalized programs) that allows us to get the accuracy of a polyvariant BTA from a monovariant BTA over the transformed program. Finally, we show a summary of experimental results that demonstrate the usefulness of our approach.
Audio Watermarking for DRM Based on Chaotic Map
Authors: B. Lei, I. Y. Soon
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

This paper focuses mainly on using chaos encryption to protect AVS audio efficiently. A novel digital watermarking approach is introduced for audio copyright protection. A meaningful gray image embedded into digital compressed audio data is researched by quantizing MDCT coefficients (using integer lifting MDCT) of audio samples based on chaotic map. The proposed watermarking algorithm can extract the watermarking image without the help from the original digital audio signal. The experimental results show that the proposed digital watermarking approach is robust to the audio degradations and distortions such as noise adding, compression, low pass filtering, resampling, and re-quantization. The digital watermarking scheme is able to provide a feasible and effective audio copyright protection.
The Analysis and the Representation of&#x00a0;Balanced Complex Polytopes in 2D
Authors: Cristina Vagnoni, Marino Zennaro
Venue: Foundations of Computational Mathematics (2009)

In this paper, we deepen the theoretical study of the geometric structure of a balanced complex polytope (b.c.p.), which is the generalization of a real centrally symmetric polytope to the complex space. We also propose a constructive algorithm for the representation of its facets in terms of their associated linear functionals. The b.c.p.s are used, for example, as a tool for the computation of the joint spectral radius of families of matrices. For the representation of real polytopes, there exist well-known algorithms such as, for example, the Beneath&#x2013;Beyond method. Our purpose is to modify and adapt this method to the complex case by exploiting the geometric features of the b.c.p. However, due to the significant increase in the difficulty of the problem when passing from the real to the complex case, in this paper, we confine ourselves to examine the two-dimensional case. We also propose an algorithm for the computation of the norm the unit ball of which is a b.c.p.
Evaluation of Reorientation Techniques and Distractors for Walking in Large Virtual Environments
Authors: Tabitha C. Peck, Henry Fuchs, Mary C. Whitton
Venue: IEEE Transactions on Visualization and Computer Graphics (2009)

Vir tual Environments (VEs) that use a real-walking locomotion interface have typically been restricted in size to the area of the tracked lab space. Techniques proposed to lift this size constraint, enabling real walking in VEs that are larger than the tracked lab space, all require reorientation techniques (ROTs) in the worst-case situation&#x2014;when a user is close to walking out of the tracked space. We propose a new ROT using visual and audial distractors&#x2014;objects in the VE that the user focuses on while the VE rotates&#x2014;and compare our method to current ROTs through three user studies. ROTs using distractors were preferred and ranked more natural by users. Our findings also suggest that improving visual realism and adding sound increased a user's feeling of presence. Users were also less aware of the rotating VE when ROTs with distractors were used.
Enabling nonexpert construction of basic sensor-based systems
Authors: Susan Lysecky, Frank Vahid
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2009)

Technology trends have enabled deployment of low-cost sensor-based systems, but designing customized sensor-based systems to carry out specific tasks still requires costly engineering by experts. We briefly summarize eBlocks, a technology enabling nonexperts to quickly construct basic customized sensor-based systems, without requiring electronics or knowledge of programming languages. We describe experiments illustrating successful construction of Boolean sensor-based systems by novice users, focusing on intuitive logic and state block design. Additionally, we present preliminary experiments demonstrating usability of integer-based blocks and introduce a programmable block and the corresponding configuration methodology intended for nonexpert users.
On candidates selection for hysteresis thresholds in edge detection
Authors: R. Medina-Carnicer, F. J. Madrid-Cuevas, A. Carmona-Poyato, R. Muñoz-Salinas
Venue: Pattern Recognition (2009)

Manual determination of hysteresis thresholds is time-consuming. Several methods approach the problem of unsupervised determination of edge detector parameters, but they require human intervention to establish the initial range of values in which to detect the best parameter value and the result depends on the range of values initially used. In this paper, a method is proposed to determine candidates to hysteresis thresholds in an unsupervised manner. The method provides a criterion to reduce in a significant way the number of initial values to be considered as threshold candidates. The proposed method can be applied to any feature image provided by an edge detector upon which hysteresis must be implemented.
Intelligent vibrating dosing system using automation through microcontroller
Authors: Mihai Manescu, Luciana Cristea
Venue: Proceedings of the 8th conference on Signal processing, computational geometry and artificial vision (2008)

This paper presents an intelligent vibrating dosing system that is controlled using a microcontroller and a precision integrate circuit that makes the analog-digital conversion between the sensors and the microcontroler. This stand allows a better understanding of the flow behavior for different food bulk solids that are dosed using vibrator dosing systems and can be applied to other volumetric systems, too. A better understanding of dosing process can help us to project dosing system more advanced from speed and precision point of view.
A local search heuristic for the pre- and end-haulage of intermodal container terminals
Authors: A. Caris, G. K. Janssens
Venue: Computers and Operations Research (2009)

Pre- and end-haulage of intermodal container terminals involves the pickup or delivery of containers at customer locations. The attractiveness of intermodal transport can be increased by organizing the road segment in the intermodal transport chain more efficiently. In this paper the drayage of containers in the service area of an intermodal terminal is modelled as a full truckload pickup and delivery problem with time windows (FTPDPTW). A two-phase insertion heuristic is proposed to construct an initial solution. This solution is improved with a local search heuristic based on three neighbourhoods. Numerical experiments are described to demonstrate the mechanisms of the heuristics.
Working memory retrieval: Contributions of the left prefrontal cortex, the left posterior parietal cortex, and the hippocampus
Authors: Ilke Öztekin, Brian McElree, Bernhard P. Staresina, Lila Davachi
Venue: Journal of Cognitive Neuroscience (2009)

Functional magnetic resonance imaging was used to identify regions involved in working memory (WM) retrieval. Neural activation was examined in two WM tasks: an item recognition task, which can be mediated by a direct-access retrieval process, and a judgment of recency task that requires a serial search. Dissociations were found in the activation patterns in the hippocampus and in the left inferior frontal gyrus (LIFG) when the probe contained the most recently studied serial position (where a test probe can be matched to the contents of focal attention) compared to when it contained all other positions (where retrieval is required). The data implicate the hippocampus and the LIFG in retrieval from WM, complementing their established role in long-term memory. Results further suggest that the left posterior parietal cortex (LPPC) supports serial retrieval processes that are often required to recover temporal order information. Together, these data suggest that the LPPC, the LIFG, and the hippocampus collectively support WM retrieval. Critically, the reported findings support accounts that posit a distinction between representations maintained in and outside of focal attention, but are at odds with traditional dual-store models that assume distinct mechanisms for short-and long-term memory representations.
Issues with the construct of quality
Authors: Nele Van den Ende, Jettie Hoonhout, Lydia Meesters
Venue: Proceedings of the 21st British HCI Group Annual Conference on HCI 2008: People and Computers XXI: HCI...but not as we know it - Volume 2 (2007)

This paper proposes an outline for a framework that aims to give a comprehensive view of perceived video quality, including physical characteristics, perceptual attributes and cognitive factors.
Generalization of the dynamic programming scheme
Authors: Yu. V. Bugaev, S. V. Chikunov
Venue: Automation and Remote Control (2009)

A new generalization of the Bellman optimality principle and the scheme of dynamic programming in terms of the language of choice functions was proposed. Proved were their correctness and applicability to the multistage decision making.
Semi-automatic integrated segmentation approaches and contour extraction applied to computed tomography scan images
Authors: B. Dhalila S. Y. Khoodoruth, Harry C. S. Rughooputh, Wilfrid Lefer
Venue: Journal of Biomedical Imaging (2008)

We propose to segment two-dimensional CT scans traumatic brain injuries with various methods. These methods are hybrid, feature extraction, level sets, region growing, and watershed which are analysed based upon their parametric and nonparametric arguments. The pixel intensities, gradient magnitude, affinity map, and catchment basins of these methods are validated based upon various constraints evaluations. In this article, we also develop a new methodology for a computational pipeline that uses bilateral filtering, diffusion properties, watershed, and filtering with mathematical morphology operators for the contour extraction of the lesion in the feature available based mainly on the gradient function. The evaluations of the classification of these lesions are very briefly outlined in this context and are being undertaken by pattern recognition in another paper work.
Integrating nonlinear graph based dimensionality reduction schemes with SVMs for credit rating forecasting
Authors: Shian-Chang Huang
Venue: Expert Systems with Applications: An International Journal (2009)

By integrating graph based nonlinear dimensionality reduction with support vector machines (SVMs), this study develops a novel prediction model for credit ratings forecasting. SVMs have been successfully applied in numerous areas, and have demonstrated excellent performance. However, due to the high dimensionality and nonlinear distribution of the input data, this study employed a kernel graph embedding (KGE) scheme to reduce the dimensionality of input data, and enhance the performance of SVM classifiers. Empirical results indicated that one-vs-one SVM with KGE outperforms other multi-class SVMs and traditional classifiers. Compared with other dimensionality reduction methods the performance improvement owing to KGE is significant.
RARE-cumulant algorithm for direction of arrival estimation and array calibration
Authors: Xinbo Li, Yaowu Shi, Han Zhang
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

In this paper, a novel efficient mutual coupling compensation algorithm for estimation of the direction of arrival (DOA) especially tailored to fourth-order cumulant is presented. With the use of special mutual coupling transform model of the uniform linear arrays and the aperture extension property of fourth-order cumulant, we take mutual coupling and virtual arrays into account simultaneously, derive the rank reduce estimator (RARE) and describe a RARE-Cumulant algorithm for both the mutual coupling matrix and DOA estimation. Calibration sources are not required. Although fourth-order cumulant is more complex than traditional second-order method, more spatial information we can get and the number of mutual coupling coefficients is not expanded with the increasing virtual arrays. Simulations show the effectiveness of the proposed technique and illustrate that the algorithm can improve the estimation resolution, and efficiently suppress Guassian color noise.
Performance study of a dual CDC Cyber 170/750 system
Authors: M. Seetha Lakshmi, Tom W. Keller
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

A performance study of a dual CDC Cyber 170/750 system is presented. The purpose of the study was twofold: to predict the maximum number of interactive users the system could satisfactorily support and to predict the effect of changes in workload and configuration. Two noteworthy aspects of the study are the use of a detailed event trace system to parameterize and validate the model and the use of a very-high-level simulation language. The results of the study, including the accuracy of predictions and the feasibility of the approach, are presented.
An Efficient Self Routing Scheme by Using Parent-Child Association for WSNs
Authors: Yeon-Mo Yang, Ilsoo Jeon
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

The IEEE standard 802.15.4 for WPAN (Wireless Personal Ares Networks) shows promise of bringing ubiquitous sensor networking (USN) into reality, at least technically. In this paper, an Association based Self Routing (ASR) scheme of a IEEE 802.15.4 beacon-enabled mode is presented to minimize the control packet overhead and surplus beacon channel power during the routing discovery process in the data transmission for the upstream direction. It also maximizes channel utilization under low duty cycles or traffic congestion. The proposed scheme, ASR routes packets from sensor routers to sink based on the parent-child association relationships established by the IEEE 802.15.4 topology formation procedure. By using the ASR, the network resources for control packets are efficiently utilized and adaptively allocated throughout different duty cycles. Extensive simulation results using TOSSIM (TinyOS mote SIMulator) and experimental results with Mica-Z show that the ASR scheme outperforms well in comparison to the conventional Ad-hoc On-Demand Distance Vector (AODV) routing scheme over the parameters such as: average throughput, number of collisions, number of network commands, and delivery ratio under the upstream data transmission.
A preliminary study of optimal splitting for rare-event simulation
Authors: John F. Shortle, Chun-Hung Chen
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Efficiency is a big concern when using simulation to estimate rare-event probabilities, since a huge number of simulation replications may be needed in order to obtain a reasonable estimate of such a probability. Furthermore, when multiple designs must be compared, and each design requires simulation of a rare event, then the total number of samples across all designs can be prohibitively high. This paper presents a new approach to enhance the efficiency for rare-event simulation. Our approach is developed by integrating the notions of level splitting and optimal computing budget allocation. The goal is to determine the optimal numbers of simulation runs across designs and across a number of splitting levels so that the variance of the rare-event estimator is minimized.
Silverlight 2 in Action
Authors: Chad Campbell, John Stockton
Venue:  (2008)

***When you purchase the Print book, you can download a PDF copy from Manning Publications at no additional charge***Microsoft describes Silverlight as a "cross-browser, cross-platform plug-in for delivering the next generation of .NET based media experiences and rich interactive applications for the Web." That's a really boring description for a really exciting new technology. Anyone who has looked at the demos and gotten a taste of what Silverlight can do knows that Silverlight represents an entirely new level of rich web interface technology for Microsoft developers. With Silverlight 2, developers can use JavaScript, VB, C#, Python, and Ruby to build user-friendly, interactive, and visually-dazzling web applications that work in most major browsers. Silverlight 2 in Action covers Silverlight 2, a far more robust implementation of Silverlight than the Silverlight 1 release that supports only JavaScript. The much-anticipated 2 release adds powerful new features along with the ability to code in multiple languages and integrate your work with Visual Studio and the new Expression suite of tools. This book delivers real-world examples and in-depth walkthroughs to help you confidently enhance your web applications using Silverlight 2. Silverlight 2 in Action devotes extensive coverage to flexible layout components, the extensible control model, the communication framework, and the data-binding features "all cornerstones of software development. Author and Microsoft MVP Chad Campbell also describes rich media and vivid graphical and animation features. The final chapters include a variety of Silverlight deployment scenarios. In addition to the fundamentals of Silverlight, you'll be introduced to architectural components such as the Silverlight object model. The book addresses the developer/designer collaboration model Silverlight enables, showing the developer how to include the designer effectively in the project workflow. This model is illustrated throughout the examples. For ongoing reader support, the author will maintain a dedicated book-support website providing up-to-the-minute working examples, complete with source code, all in Silverlight.
Distributed task force scheduling in multi-microcomputer networks
Authors: André M. Van Tilborg, Larry D. Wittie
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

Efficient task scheduling techniques are needed for microcomputer networks to be used as general purpose computers. The Wave Scheduling technique, developed for the MICRO-NET network computer, co-schedules groups of related tasks onto available network nodes. Scheduling managers are distributed over a logical control hierarchy. They subdivide requests for groups of free worker nodes and send waves of requests towards the leaves of the control hierarchy, where all workers are located. Because requests from different managers compete for workers, a manager may have to try a few times to schedule a task force. Each task force manager actually requests slightly more workers than it really needs. It computes a request size which minimizes expected scheduling overhead, as measured by total idle time in worker nodes. Using a Markov queueing model, it is shown that Wave Scheduling in a network of microcomputers is almost as efficient as centralized scheduling.
A novel fingerprint singular point detection algorithm
Authors: Jin Bo, Ying Yu Long, Chen Dan Er
Venue: Proceedings of the 3rd WSEAS international conference on Computer engineering and applications (2009)

In this paper, a novel approach for detection of singular points, the core and delta points, in fingerprint images is proposed. There have been many approaches introduced in the design of feature extraction. Based on orientation field, Firstly, we divide it into blocks to compute the Poincaré Index. Then, the blocks which may have singularities are detected in the block images. Experiment show the present algorithm is robust than the traditional method on poor quality images.