ppxscal/embedding_network huggingface dataset:
Representations with poles and cuts for the time-domain simulation of fractional systems and irrational transfer functions
Authors: Thomas Hélie, Denis Matignon
Venue: Signal Processing (2006)

Fractional differential systems are infinite-dimensional systems which are difficult to study and simulate: they can be represented with poles and cuts. This representation applies to a wider class of irrational transfer functions, and is most useful for signal processing purposes, such as frequency-domain and time-domain simulations: the approximations in low dimension which give the most striking numerical results are obtained through an optimization procedure, the parameters of which are meaningful from a signal point of view. Ten such systems of increasing complexity are thoroughly investigated.
Short-Time Traffic Flow Forecasting Based on Projection Pursuit Auto-Regression
Authors: Xiao-yuan Wang, Hai-hong Liu, Zhi-ping Liu
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

Accurate short-term traffic flow forecasting is one of the important issues for Intelligent Transportation Systems research, especially for the Advanced Traffic Management Systems and Advanced Traveler Information Systems research. With the shortening of the forecasting term, the uncertainty of traffic flow becomes more and more seriously, so that the forecasting effect of general approaches is decreasing. For an example, the algorithm based on non-parametric regression is a real-time nonparametric forecasting algorithm with the characteristic of high transplantation and accuracy, which plays an important role in traffic flow forecasting, yet there is the problem of"dimension curse" as the dimensions of the sample data increase. For the purpose of solving the question of short-time traffic flow forecasting, a short-time traffic flow forecasting model based on projection pursuit auto-regression technique is established in this paper. The problem of "dimension curse" and non-normality among high-dimensions data are solved. This algorithm satisfies the need of real-time traffic flow forecasting completely through the field data test.
Two Variants of the Constructive Neural Network Tiling Algorithm
Authors: J. R. Bertini Jr., Maria do Carmo Nicoletti, Estevam R. Hruschka Jr., Arthur Ramer
Venue: Proceedings of the Sixth International Conference on Hybrid Intelligent Systems (2006)

Unlike conventional neural network (NN) algorithms that require the definition of the NN architecture before learning starts, constructive neural network (CoNN) algorithms enable the NN architecture to be constructed along with the learning process. CoNN algorithms are very dependent on the TLU training algorithm they employ. Generally in their original proposal CoNN algorithms use a Perceptron-based algorithm for training each individual node added to the network during the learning process. This paper proposes two hybrid variants of the CoNN algorithm known as Tiling, referred to as Tiling_V1 and Tiling_V2. The two variants differ from the original Tiling in respect to the algorithm they use for training individual TLUs added to the NN. The master neuron in each hidden layer constructed by Tiling_V1 can be trained either by PRM (Pocket with Ratchet Modification) or BCPMin (Barycentric Correction Procedure) while the auxiliary neurons are always trained using BCPMin. In Tiling_V2 the same algorithm used to train the master neuron of each hidden layer is also used to train the auxiliary neurons. Both variants as well as the original Tiling (using PRM or BCPMin) have been used in learning tasks involving 7 knowledge domains. In 6 out of 7 domains results obtained with one of the variants are in the top two best results.
Performance prediction based on inherent program similarity
Authors: Kenneth Hoste, Aashish Phansalkar, Lieven Eeckhout, Andy Georges, Lizy K. John, Koen De Bosschere
Venue: Proceedings of the 15th international conference on Parallel architectures and compilation techniques (2006)

A key challenge in benchmarking is to predict the performance of an application of interest on a number of platforms in order to determine which platform yields the best performance. This paper proposes an approach for doing this. We measure a number of microarchitecture-independent characteristics from the application of interest, and relate these characteristics to the characteristics of the programs from a previously profiled benchmark suite. Based on the similarity of the application of interest with programs in the benchmark suite, we make a performance prediction of the application of interest. We propose and evaluate three approaches (normalization, principal components analysis and genetic algorithm) to transform the raw data set of microarchitecture-independent characteristics into a benchmark space in which the relative distance is a measure for the relative performance differences. We evaluate our approach using all of the SPEC CPU2000 benchmarks and real hardware performance numbers from the SPEC website. Our framework estimates per-benchmark machine ranks with a 0.89 average and a 0.80 worst case rank correlation coefficient.
Visualisation of Architectural Design Schemes through Static Computer Generated and Traditional Visual Representations: An Investigation of Subjective Responses
Authors: Nada Bates-Brkljac
Venue: Proceedings of the conference on Information Visualization (2006)

Before architects can begin to make changes in the actual physical environment they must create visual representations of design scheme proposals. Thus, in architecture, information visualisation in graphic form is crucial for discussions and for design review process of architectural design. Within the context of design research and studies there has been a growing interest in recent years in the computer methods of visual representation of architecture. This paper presents the first findings of an Economic and Social science Research Council (ESRC) funded project which explores those factors and issues which determine the perceived credibility of visual representations of architectural design. It specifically considers differences between architects' and other professionals' perceptual responses to the static forms of traditional and computer visualisation. The paper concentrates on the question: what factors are relevant to people's perceptions and which method of information visualisation is perceived as a more reliable way of visualising information about the design proposals?
On quickselect, partial sorting and multiple quickselect
Authors: Markus Kuba
Venue: Information Processing Letters (2006)

We present explicit solutions of a class of recurrences related to the Quickselect algorithm. Thus we are immediately able to solve recurrences arising at the partial sorting problem, which are contained in this class. Furthermore we show how the partial sorting problem is connected to the Multiple Quickselect algorithm and present a method for the calculation of solutions for a class of recurrences related to the Multiple Quickselect algorithm. Further an analysis of an algorithm for sorting a subarray A[r... r + p - 1], given the array A[1... n], is provided.
Online Random Shuffling of Large Database Tables
Authors: Christopher Jermaine
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

Many applications require a randomized ordering of input data. Examples include algorithms for online aggregation, data mining, and various randomized algorithms. Most existing work seems to assume that accessing the records from a large database in a randomized order is not a difficult problem. However, it turns out to be extremely difficult in practice. Using existing methods, randomization is either extremely expensive at the front end (as data are loaded), or at the back end (as data are queried). This paper presents a simple file structure which supports both efficient, online random shuffling of a large database, as well as efficient online sampling or randomization of the database when it is queried. The key innovation of our method is the introduction of a small degree of carefully controlled, rigorously monitored nonrandomness into the file.
Matrix factorizations for reversible integer implementation of orthonormal M-band wavelet transforms
Authors: Tony Lin, Pengwei Hao, Shufang Xu
Venue: Signal Processing (2006)

This paper presents a matrix factorization method for implementing orthonormal M-band wavelet reversible integer transforms. Based on an algebraic construction approach, the polyphase matrix of orthonormal M-band wavelet transforms can be factorized into a finite sequence of elementary reversible matrices that map integers to integers reversibly. These elementary reversible matrices can be further factorized into lifting matrices, thus we extend the classical lifting scheme to a more flexible framework.
Distributed video arrays for tracking, human identification, and activity analysis
Authors: K. S. Huang, M. M. Trivedi
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

In this paper we discuss the intelligent or smart camera based systems for capturing visual contextual information at multiple levels of information abstraction. A distributed video array, with multiple omnidirectional and rectilinear cameras, is used to acquire visual information. System architecture as well as 3D tracking and human identification modules are described. Examples of the use of distributed video arrays in indoor, outdoor, and mobile environments are presented.
The coverage problem in a wireless sensor network
Authors: Chi-Fu Huang, Yu-Chee Tseng
Venue: Mobile Networks and Applications (2005)

One of the fundamental issues in sensor networks is the coverage problem, which reflects howwell a sensor network is monitored or tracked by sensors. In this paper, we formulate this problem as a decision problem, whose goal is to determine whether every point in the service area of the sensor network is covered by at least k sensors, where k is a given parameter. The sensing ranges of sensors can be unit disks or non-unit disks. We present polynomial-time algorithms, in terms of the number of sensors, that can be easily translated to distributed protocols. The result is a generalization of some earlier results where only k =1 is assumed. Applications of the result include determining insufficiently covered areas in a sensor network, enhancing fault-tolerant capability in hostile regions, and conserving energies of redundant sensors in a randomly deployed network. Our solutions can be easily translated to distributed protocols to solve the coverage problem.
Improved security in geographic ad hoc routing through autonomous position verification
Authors: Tim Leinmüller, Christian Maihöfer, Elmar Schoch, Frank Kargl
Venue: Proceedings of the 3rd international workshop on Vehicular ad hoc networks (2006)

Inter-vehicle communication is regarded as one of the major applications of mobile ad hoc networks (MANETs). Compared to other MANETs, these so called vehicular ad hoc networks (VANETs) have special requirements in terms of node mobility and position-dependent applications, which are well met by geographic routing protocols. Functional research on geographic routing has already reached a considerable level, whereas security aspects have been vastly neglected so far. Since position dissemination is crucial for geographic routing, forged position information has severe impact regarding both performance and security.In order to lessen this problem, we propose a detection mechanism that is capable of recognizing nodes cheating about their position in beacons (periodic position dissemination in most single-path geographic routing protocols, e.g. GPSR). Unlike other proposals described in the literature, our detection does not rely on additional hardware or special nodes, which contradicts the ad hoc approach. Instead, this mechanism uses a number of different independent sensors to quickly give an estimation of the trustworthiness of other nodes' position claims without using dedicated infrastructure or specialized hardware.The simulative evaluation proves that our position verification system successfully discloses nodes disseminating false positions and thereby widely prevents attacks using position cheating.
A Requirements Driven Framework for Benchmarking Semantic Web Knowledge Base Systems
Authors: Yuanbo Guo, Abir Qasem, Zhengxiang Pan, Jeff Heflin
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

A key challenge for the Semantic Web is to acquire the capability to effectively query large knowledge bases. As there will be several competing systems, we need benchmarks that will objectively evaluate these systems. Development of effective benchmarks in an emerging domain is a challenging endeavor. In this paper, we propose a requirements driven framework for developing benchmarks for Semantic Web Knowledge Base Systems (SW KBSs). In this paper, we make two major contributions. First, we provide a list of requirements for SW KBS benchmarks. This can serve as an unbiased guide to both the benchmark developers and personnel responsible for systems acquisition and benchmarking. Second, we provide an organized collection of techniques and tools needed to develop such benchmarks. In particular, the collection contains a detailed guide for generating benchmark workload, defining performance metrics, and interpreting experimental results.
A tight lower bound for restricted PIR protocols
Authors: Richard Beigel, Lance Fortnow, William Gasarch
Venue: Computational Complexity (2006)

We show that any 1-round 2-server Private Information Retrieval Protocol where the answers are one bit long must ask questions that are at least n - 2 bits long, which is nearly equal to the known n - 1 upper bound. This improves upon the approximately 0.25n lower bound of Kerenidis and de Wolf while avoiding their use of quantum techniques.
Provably Secure Proxy Blind Signature Scheme
Authors: Young-Seol Kim, Jik-Hyun Chang
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

A proxy blind signature scheme is a digital signature scheme which combines the properties of a proxy signature and a blind signature scheme. Recently, Guilin Wang proposed a provably secure proxy signature scheme, which is based on a two-party Schnorr signature scheme. In this paper, on the basis of Guilin Wang's proxy signature scheme and the Okamoto-Schnorr blind signature, we propose a provably secure proxy blind signature scheme against adaptive chosen message attack on random oracle model. And proposed scheme satisfies the security properties of both the blind signature and the proxy signature scheme.
Auditory Spatial Tuning in Late-onset Blindness in Humans
Authors: Anne Fieger, Brigitte Röder, Wolfgang Teder-sälejärvi, Steven A. Hillyard, Helen J. Neville
Venue: Journal of Cognitive Neuroscience (2006)

Blind individuals who lost their sight as older children or adults were compared with normally sighted controls in their ability to focus auditory spatial attention and to localize sounds in a noisy acoustic environment. Event-related potentials (ERPs) were recorded while participants attended to sounds presented in free field from either central or peripheral arrays of speakers with the task of detecting infrequent targets at the attended location. When attending to the central array of speakers, the two groups detected targets equally well, and their spatial tuning curves for both ERPs and target detections were highly similar. By contrast, late blind participants were significantly more accurate than sighted participants at localizing sounds in the periphery. For both groups, the early N1 amplitude to peripheral standard stimuli displayed no significant spatial tuning. In contrast, the amplitude of the later P3 elicited by targets/deviants displayed a more sharply tuned spatial gradient during peripheral attention in the late blind than in the sighted group. These findings were compared with those of a previous study of congenitally blind individuals in the same task [R&ouml;der, B., Teder-S&auml;lej&auml;rvi, W., Sterr, A., R&ouml;sler, F., Hillyard, S. A., & Neville, H. J. Improved auditory spatial tuning in blind humans. Nature, 400, 162&ndash;166, 1999]. It was concluded that both late blind and congenitally blind individuals demonstrate an enhanced capability for focusing auditory attention in the periphery, but they do so via different mechanisms: whereas congenitally blind persons demonstrate a more sharply tuned early attentional filtering, manifested in the N1, late blind individuals show superiority in a later stage of target discrimination and recognition, indexed by the P3.
CONOISE-G: agent-based virtual organisations
Authors: Jigar Patel, W. T. Luke Teacy, Nicholas R. Jennings, Michael Luck, Stuart Chalmers, Nir Oren, Timothy J. Norman, Alun Preece, Peter M. D. Gray, Gareth Shercliff, Patrick J. Stockreisser, Jianhua Shao, W. Alex Gray, Nick J. Fiddian, Simon Thompson
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

The ability to create reliable, scalable virtual organisations (VOs) on demand in a dynamic, open and competitive environment is one of the challenges that underlie Grid computing. In response, in the CONOISE-G project, we are developing an infrastructure to support robust and resilient virtual organisation formation and operation. Specifically, CONOISE-G provides mechanisms to assure effective operation of agent-based VOs in the face of disruptive and potentially malicious entities in dynamic, open and competitive environments. In this paper, we describe the CONOISE-G system, outline its use in VO formation and perturbation, and review current work on dealing with unreliable information sources.
Web based information for product ranking in e-business: a fuzzy approach
Authors: B. K. Mohanty, K. Passi
Venue: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet (2006)

In this paper we have introduced a methodology to rank the available products in the Internet market. These rankings are based on the customers' own preferences and also on the information in the different search engines about the products. Linguistically defined customers' preferences about the products or product attributes are directly collected from the customers. Where as the search engines are used to accumulate the web based information of other customers' about the product. The aggregation of buyer's preferences and search engines' information is interpreted here as a measure of relevance of the search engines in providing the need based information to the buyer. Weighted average of the products across the search engines with weights as the relevance degrees of the search engines help us to obtain the product rankings in Internet market. The methodology of ordering of fuzzy subsets in the unit interval assists to obtain the preference ranking of the products in the e-business site.
Requirement error abstraction and classification: an empirical study
Authors: Gursimran S. Walia, Jeffrey Carver, Thomas Philip
Venue: Proceedings of the 2006 ACM/IEEE international symposium on Empirical software engineering (2006)

Software quality and reliability is a primary concern for successful development organizations. Monitoring and controlling quality by helping developers detect as many faults as possible is a subjective and intricate approach. Due to the inherent difficulties and limitations, additional methods are required to obtain a more complete solution to the software quality problem. This paper analyzes the software quality problem from a different perspective involving a step back from faults to focus on the fundamental causes of faults. The first step in this direction is the application of the Error Abstraction Process (EAP) to the requirements phase of the software lifecycle to develop a Requirement Error Taxonomy (RET). This paper presents an empirical study on the application of the EAP and RET to requirement documents in a controlled classroom setting. The results show that the EAP significantly improves the productivity of subjects, that the RET is useful for improving software quality, that it provides useful insights into the requirements document, and that various context variables also impact the results. These results are promising and are important to motivate further investigation, to refine the RET, and to derive more formalized tools and methods for assisting developers. The result of this investigation will be a sound verification process for requirements phase.
Applying multipath routing to a video surveillance system deployed over a wireless mesh network
Authors: Francesco Licandro, Alfio Lombardo, Giovanni Schembra
Venue: Proceedings of the 2nd ACM international workshop on Wireless multimedia networking and performance modeling (2006)

Large-scale distributed video surveillance systems typically consists of many video sources distributed over a wide area, transmitting live video streams to a central location for processing and monitoring. The target of this paper to bring down the overall system cost, increasing deployability, scalability, and performance is to propose a new architecture for a WVSN, which is based on a wireless mesh network, and to analyze its performance in order to choose some project parameters to achieve the best trade-off between video encoding quality and the generated network traffic
Involvement of the Superior Temporal Cortex and the Occipital Cortex in Spatial Hearing: Evidence from Repetitive Transcranial Magnetic Stimulation
Authors: Jörg Lewald, Ingo G. Meister, Jürgen Weidemann, Rudolf Töpper
Venue: Journal of Cognitive Neuroscience (2004)

The processing of auditory spatial information in cortical areas of the human brain outside of the primary auditory cortex remains poorly understood. Here we investigated the role of the superior temporal gyrus (STG) and the occipital cortex (OC) in spatial hearing using repetitive transcranial magnetic stimulation (rTMS). The right STG is known to be of crucial importance for visual spatial awareness, and has been suggested to be involved in auditory spatial perception. We found that rTMS of the right STG induced a systematic error in the perception of interaural time differences (a primary cue for sound localization in the azimuthal plane). This is in accordance with the recent view, based on both neurophysiological data obtained in monkeys and human neuroimaging studies, that information on sound location is processed within a dorsolateral ''where'' stream including the caudal STG. A similar, but opposite, auditory shift was obtained after rTMS of secondary visual areas of the right OC. Processing of auditory information in the OC has previously been shown to exist only in blind persons. Thus, the latter finding provides the first evidence of an involvement of the visual cortex in spatial hearing in sighted human subjects, and suggests a close interconnection of the neural representation of auditory and visual space. Because rTMS induced systematic shifts in auditory lateralization, but not a general deterioration, we propose that rTMS of STG or OC specifically affected neuronal circuits transforming auditory spatial coordinates in order to maintain alignment with vision.