ppxscal/embedding_network huggingface dataset:
The Deferred Event Model for Hardware-Oriented Spiking Neural Networks
Authors: Alexander Rast, Xin Jin, Mukaram Khan, Steve Furber
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

Real-time modelling of large neural systems places critical demands on the processing system's dynamic model. With spiking neural networks it is convenient to abstract each spike to a point event. In addition to the representational simplification, the event model confers the ability to defer state updates, if the model does not propagate the effects of the current event instantaneously. Using the SpiNNaker dedicated neural chip multiprocessor as an example system, we develop models for neural dynamics and synaptic learning that delay actual updates until the next input event while performing processing in background between events, using the difference between "electronic time" and "neural time" to achieve real-time performance. The model relaxes both local memory and update scheduling requirements to levels realistic for the hardware. The delayed-event model represents a useful way to recast the real-time updating problem into a question of time to the next event.
On the identification of intra-seasonal changes in the Indian summer monsoon
Authors: Shivam Tripathi, Rao S. Govindaraju
Venue: Proceedings of the Third International Workshop on Knowledge Discovery from Sensor Data (2009)

Intra-seasonal changes in the Indian summer monsoon are generally characterized by its active and break (A&B) states. Existing methods for identifying the A&B states using rainfall data rely on subjective thresholds, ignore temporal dependence in the data, and disregard inherent uncertainty in their identification. This paper develops a method to identify intra-seasonal changes in the monsoon using a hidden Markov model (HMM) that allows objective classification of the monsoon states. The method facilitates probabilistic interpretation which is especially useful during the transition period between the two monsoon states. The developed method can also be used to - (i) identify monsoon states in real time, (ii) forecast rainfall values, and (iii) generate synthetic data. Comparisons of the results from the proposed model with those from existing methods suggest that the new method is a promising for detecting intra-seasonal changes in the Indian summer monsoon.
Stochastic processes with orthogonal polynomial eigenfunctions
Authors: Bob Griffiths
Venue: Journal of Computational and Applied Mathematics (2009)

Markov processes which are reversible with either Gamma, Normal, Poisson or Negative Binomial stationary distributions in the Meixner class and have orthogonal polynomial eigenfunctions are characterized as being processes subordinated to well-known diffusion processes for the Gamma and Normal, and birth and death processes for the Poisson and Negative Binomial. A characterization of Markov processes with Beta stationary distributions and Jacobi polynomial eigenvalues is also discussed.
Based on HSV Space Real-color Image Enhanced by Multi-scale Homomorphic
Authors: Xiong Jie, Han LiNa, Geng GuoHua, Zhou MingQuan
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

Digital image enhancement provides good dynamic range compression in each red, green and blue (RGB)channel, but it fails in color rendition. In this letter, we propose to transform a real-color image from RGB space to HSV space at first.Then, saturation channel is enhanced by Butterworth high-pass homomorphic filter and value channel is enhanced by multi-scale Gaussian high-pass homomorphic filters. In addition , we propose anew method to fix on the cut-off frequency of high-pass filter in homomorphic enhancement algorithm and explain the ratio coefficient of high-pass filter.Experiments show the compression of real-color image dynamic range is obviously effective, and it successes in color rendition.
Study on the Method of Sector Division Based on the Power Diagram
Authors: Fu-qing Dai, Zheng Li, Li-li Wang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

The sector partition is an important part of airspace planning. The research on the sector division methods is of great significance in controlling to clear the air traffic flow in the region, relaxing the pressure of air traffic controlling effectively, and increasing air traffic flow to ensure flight safety. This paper provides the new method of sector division based on the Power diagram. With Power diagram, one sector can be divided into limited units. According to the statistical air traffic complexity of sectors based on the principle of the equilibrium of complexity in each sector, airspace tabu search algorithm is used to optimize the combination of finite unit. The final optimized sector is received when the sector established the foundation for the dynamic adjustment during the heavy traffic,. The simulation results show the effectiveness of the method.
Financial incentives and the "performance of crowds"
Authors: Winter Mason, Duncan J. Watts
Venue: Proceedings of the ACM SIGKDD Workshop on Human Computation (2009)

The relationship between financial incentives and performance, long of interest to social scientists, has gained new relevance with the advent of web-based "crowd-sourcing" models of production. Here we investigate the effect of compensation on performance in the context of two experiments, conducted on Amazon's Mechanical Turk (AMT). We find that increased financial incentives increase the quantity, but not the quality, of work performed by participants, where the difference appears to be due to an "anchoring" effect: workers who were paid more also perceived the value of their work to be greater, and thus were no more motivated than workers paid less. In contrast with compensation levels, we find the details of the compensation scheme do matter---specifically, a "quota" system results in better work for less pay than an equivalent "piece rate" system. Although counterintuitive, these findings are consistent with previous laboratory studies, and may have real-world analogs as well.
GALS for Bursty Data Transfer based on Clock Coupling
Authors: Miloš Krstić, Xin Fan, Eckhard Grass, Frank K. Gürkaynak
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

In this paper we introduce a novel burst-mode GALS technique. The goal of this technique is improving the performance of the GALS approach for systems with predominantly bursty data transfer. This new technique has been used to implement a GALS-based version of a hardware accelerator of a 60 GHz OFDM baseband processor. The simulation results show a significant performance improvement in comparison with a classical implementation of GALS using pausible clocking.
Shadow Removal in Outdoor Video Sequences by Automatic Thresholding of Division Images
Authors: Srinivasa Rao Dammavalam, Claudio Piciarelli, Christian Micheloni, Gian Luca Foresti
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

Several video-based applications, such as video surveillance, traffic monitoring, video annotation, etc., rely on the correct detection and tracking of moving objects within the observed scene. Even though several works have been proposed in the field of moving object detection, many of them do not consider the problem of segmenting real objects from their shadows. The shadow is considered part of the object, thus leading to possibly large errors in the subsequent steps of object localisation and tracking. In this paper we propose a shadow detection algorithm able to remove shadows from the blobs of moving objects, using division images and Expectation-Maximization histogram analysis. Experimental results prove that the use of the proposed method can significantly increase the performance of a video analysis system.
Software Architecture Knowledge Management: Theory and Practice, 1st edition
Authors: Muhammad Ali Babar, Torgeir Dingsyr, Patricia Lago, Hans van Vliet
Venue:  (2009)

A software architecture manifests the major early design decisions, which determine the systems development, deployment and evolution. Thus, making better architectural decisions is one of the large challenges in software engineering. Software architecture knowledge management is about capturing practical experience and translating it into generalized architectural knowledge, and using this knowledge in the communication with stakeholders during all phases of the software lifecycle. This book presents a concise description of knowledge management in the software architecture discipline. It explains the importance of sound knowledge management practices for improving software architecture processes and products, and makes clear the role of knowledge management in software architecture and software development processes. It presents many approaches that are in use in software companies today, approaches that have been used in other domains, and approaches under development in academia. After an initial introduction by the editors, the contributions are grouped in three parts on "Architecture Knowledge Management", "Strategies and Approaches for Managing Architectural Knowledge", and "Tools and Techniques for Managing Architectural Knowledge". The presentation aims at information technology and software engineering professionals, in particular software architects and software architecture researchers. For the industrial audience, the book gives a broad and concise understanding of the importance of knowledge management for improving software architecture process and building capabilities in designing and evaluating better architectures for their mission- and business-critical systems. For researchers, the book will help to understand the applications of various knowledge management approaches in an industrial setting and to identify research challenges and opportunities.
A Hybrid Image Segmentation Approach Based on Mean Shift and Fuzzy C-Means
Authors: Ruhan He, Yong Zhu
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

Image segmentation is an important task in many applications. For large-scale, general image dataset, however, there are the competing requirements, including not making complex prior assumptions about the scene, having fast speed and good segmentation quality. In this paper, a hybrid approach for image segmentation is presented that incorporates two famous methods, i.e. Mean Shift (MS) and Fuzzy C-Means (FCM). The first stage extracts many regions by MS approach, which provides an initial over-segmentation. The second stage groups together these primitive regions into meaningful objects to produce the final segmentation results by FCM. The proposed approach is efficient while provide good segmentation performance. The experimental results demonstrate the effectiveness of the proposed approach.
Coronary Lumen Segmentation Using Graph Cuts and Robust Kernel Regression
Authors: Michiel Schaap, Lisan Neefjes, Coert Metz, Alina Giessen, Annick Weustink, Nico Mollet, Jolanda Wentzel, Theo Walsum, Wiro Niessen
Venue: Proceedings of the 21st International Conference on Information Processing in Medical Imaging (2009)

This paper presents a novel method for segmenting the coronary lumen in CTA data. The method is based on graph cuts, with edge-weights depending on the intensity of the centerline, and robust kernel regression. A quantitative evaluation in 28 coronary arteries from 12 patients is performed by comparing the semi-automatic segmentations to manual annotations. This evaluation showed that the method was able to segment the coronary arteries with high accuracy, compared to manually annotated segmentations, which is reflected in a Dice coefficient of 0.85 and average symmetric surface distance of 0.22 mm.
An ecological approach to agent population management
Authors: Maxim D. Peysakhov, Robert N. Lass, William C. Regli, Moshe Kam
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 1 (2005)

The problem of maintaining a desired number of mobile agents on a network is not trivial, especially if what is required is a completely decentralized solution. Decentralized control makes a system more robust and less susceptible to partial failures. The problem of agent population management is exacerbated on wireless ad hoc networks where host mobility can result in significant changes in the network size and topology. System stability is also of critical importance. This paper analyzes the stability of a previously proposed ecology-inspired approach to agent population management, and proposes improvements. The stability of the new ecology based strategy is proved theoretically, and the conclusions are verified with a set of experiments.
IBM Z/Os V1r10 Communications Server Tcp/Ip Implementation: Base Functions, Connectivity, and Routing
Venue:  (2009)

For more than 40 years, IBM mainframes have supported an extraordinary portion of the world's computing work, providing centralized corporate databases and mission-critical enterprise-wide applications. The IBM System z, the latest generation of the IBM distinguished family of mainframe systems, has come a long way from its IBM System/360 heritage. Likewise, its IBM z/OS operating system is far superior to its predecessors in providing, among many other capabilities, world class and state-of-the-art support for the TCP/IP Internet protocol suite. CP/IP is a large and evolving collection of communication protocols managed by the Internet Engineering Task Force (IETF), an open, volunteer organization. Because of its openness, the TCP/IP protocol suite has become the foundation for the set of technologies that form the basis of the Internet. The convergence of IBM mainframe capabilities with Internet technology, connectivity, and standards (particularly TCP/IP) is dramatically changing the face of information technology and driving requirements for even more secure, scalable, and highly available mainframe TCP/IP implementations. The z/OS Communications Server TCP/IP Implementation series provides understandable, step-by-step guidance about how to enable the most commonly used and important functions of z/OS Communications Server TCP/IP. n this IBM Redbooks publication, we provide an introduction to z/OS Communications Server TCP/IP. We then discuss the System Resolver, showing the implementation of global and local settings for single and multi-stack environments. Next, we present implementation scenarios for TCP/IP Base functions, Connectivity, Routing, Virtual MAC support, and sysplex subplexing. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Replicating real-time garbage collector for Java
Authors: Tomas Kalibera
Venue: Proceedings of the 7th International Workshop on Java Technologies for Real-Time and Embedded Systems (2009)

Real-time Java is becoming a viable platform for real-time applications, bringing new challenges to a garbage collector. A real-time collector has to be incremental as not to cause deadline misses by suspending an application for too long. In particular, a real-time collector has to relocate objects in the heap, incrementally and transparently to the application. This is usually achieved via an indirection that has to be followed on every read and write to the heap. We present an alternative solution, based on object replication, which does not need any special handling for memory reads, but writes are more expensive: every value is written twice. As writes are less frequent than reads, the total overhead is reduced. With our implementation in a research real-time Java VM and DaCapo, pseudo-jbb, and SPEC JVM 98 benchmarks, we observe an average speed-up of 3%. A similar technique was implemented in Sapphire, a copying concurrent collector targeting highly parallel systems. Sapphire requires that all accesses to non-volatile shared variables in applications are protected by locks. Our uniprocessor non-concurrent mostly non-copying collector, targeting green-threading embedded systems, does not have this requirement. The mutator barriers supporting our collector are simpler and more predictable.
TagCaptcha: annotating images with CAPTCHAs
Authors: Donn Morrison, Stéphane Marchand-Maillet, Éric Bruno
Venue: Proceedings of the ACM SIGKDD Workshop on Human Computation (2009)

Image retrieval has long been plagued by limitations on automatic methods because they cannot reliably extract semantic data from low-level features. The result is that users must formulate awkward and inefficient queries in terms these systems can understand. Humans, on the other hand, have the ability to quickly and accurately summarise visual data. This dichotomy, named the semantic gap, is a fundamental problem in image retrieval. We aim to narrow the semantic gap in a typical retrieval scenario by motivating users to provide semantic image annotations. We propose a system of collecting image annotations based on the need for human verification on the web. Similar in principle to work by von Ahn et al. [2, 3], the idea is to exploit the requirement of users to pass tests in order to incrementally annotate images.
Speeding up learning in real-time search via automatic state abstraction
Authors: Vadim Bulitko, Nathan Sturtevant, Maryia Kazakevich
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 3 (2005)

Situated agents which use learning real-time search are well poised to address challenges of real-time path-finding in robotic and computer game applications. They interleave a local lookahead search with movement execution, explore an initially unknown map, and converge to better paths over repeated experiences. In this paper, we first investigate how three known extensions of the most popular learning real-time search algorithm (LRTA*) influence its performance in a path-finding domain. Then, we combine automatic state abstraction with learning real-time search. Our scheme of dynamically building a state abstraction allows us to generalize updates to the heuristic function, thereby speeding up learning. The novel algorithm converges up to 80 times faster than LRTA* with only one fifth of the response time of A*.
General Adaptive Neighborhood Choquet Image Filtering
Authors: Johan Debayle, Jean-Charles Pinoli
Venue: Journal of Mathematical Imaging and Vision (2009)

A novel framework entitled General Adaptive Neighborhood Image Processing (GANIP) has been recently introduced in order to propose an original image representation and mathematical structure for adaptive image processing and analysis. The central idea is based on the key notion of adaptivity which is simultaneously associated with the analyzing scales, the spatial structures and the intensity values of the image to be addressed. In this paper, the GANIP framework is briefly exposed and particularly studied in the context of Choquet filtering (using fuzzy measures), which generalizes a large class of image filters. The resulting spatially-adaptive operators are studied with respect to the general GANIP framework and illustrated in both the biomedical and materials application areas. In addition, the proposed GAN-based filters are practically applied and compared to several other denoising methods through experiments on image restoration, showing a high performance of the GAN-based Choquet filters.
Semiconcurrent Online Testing of Transition Faults through Output Response Comparison of Identical Circuits
Authors: Irith Pomeranz, Sudhakar M. Reddy
Venue: IEEE Transactions on Dependable and Secure Computing (2009)

We describe a method for online testing of delay faults based on the comparison of output responses of identical circuits. The method allows one of the circuits to participate in useful computations during the testing process, while the other circuit must be idle. We refer to this method as semiconcurrent online testing. While unknown input vectors are applied to the circuit that participates in useful computations, the proposed method applies modified vectors to the idle circuit. In this way, different conditions are created for the detection of delay faults, allowing identical delay faults that affect both circuits to be detected. In designing the modified vectors, we ensure that the expected fault-free responses of the two circuits are identical. We also ensure that the hardware for modifying the vectors applied to the idle circuit will be easy to implement on-chip.
A Pratical Method for Anti-sampling Offset in Digtial Reciver
Authors: Hui Li, Min Zhang, Peng Deng, GongCao Su, XiaoHui Lin, Hui Wang
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

In a digital communication system, in order to recover the transmitted signal, the data receiver samples the received signal periodically. But there exists sampling clock offset between the transmitter and the receiver, and the receiver is very sensitive to synchronization error. For asynchronous sampling, the communication receiver usually requires the rate conversion in its system to make the sampling clock consistent with symbol rate. Traditional timing recovery construction can convert the sampling rate to the expected value, but it depends on the exact sampling rate and symbol rate. The result of signal demodulation will be wrong if the rate is inaccurate. This paper presents a novel simple method, so that the receiver can work well without knowing the actual sampling rate and symbol rate even in multi-path fading channel.
Design of Electronic Toll Collection System in Expressway Based on RFID
Authors: Ren Zhengang, Gao Yingbo
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

In view of shortcomings exist in traditional toll mode of expressway and some defects of electronic toll collection system, such as short distance, high cost, and poor security. A kind of radio frequency chip, nRF9E5, was adopted to design electronic toll collection system of expressway. Structural and process designs were made, in addition, a new RFID authentication and authorization protocol model was used toguarantee system security. The electronic toll collection system based on RFID has advantages of less cost, small size and high reliability. It is very suitable for practical application.