ppxscal/embedding_network huggingface dataset:
Noise Detection in Agent Reputation Models Using IMM Filtering
Authors: Javier Carbo, Jesus Garcia, Jose M. Molina
Venue: Trust in Agent Societies: 11th International Workshop, TRUST 2008, Estoril, Portugal, May 12 -13, 2008. Revised Selected and Invited Papers (2008)

Inferring Trust in dynamic and subjective environments is a key interesting issue in the way to obtain a complete delegation of human-like decisions in autonomous agents. With this final intention several trust models and strategies have been proposed by researchers, and some of them were tested using the Agent Reputation and Trust (ART) testbed. competitions. In this paper we propose to apply a temporal statistical model to the noisy observations perceived (reputations) that filter out noise (subjectivity) and estimate future state variable (trust). Specifically we have implemented agents that apply Kalman and Interacting Multiple Model (IMM) adaptive filters as a part of ART trust models. Kalman and IMM have been largely applied to make time-dependent predictions in noisy environments, furthermore they are recognized as a reasoning paradigm for time-variable facts, so they seem to be appropriate for agents to infer trust from direct observations and indirect references. In order to show its viability as part of a trust model, we have run ART games with other agents that took part in past ART competitions.
Rapid almost-complete broadcasting in faulty networks
Authors: Rastislav Královi, Richard Královi
Venue: Theoretical Computer Science (2009)

This paper studies the problem of broadcasting in synchronous point-to-point networks, where one initiator owns a piece of information that has to be transmitted to all other vertices as fast as possible. The model of fractional dynamic faults with threshold is considered: in every step either a fixed number c(G)-1, where c(G) is the edge connectivity of the communication graph, or a fraction @a of sent messages can be lost depending on which quantity is larger. As the main result we show that in complete graphs and hypercubes it is possible to inform all but a constant number of vertices, exhibiting only a logarithmic slowdown, i.e. in time O(Dlogn) where D is the diameter of the network and n is the number of vertices. Moreover, for complete graphs under some additional conditions (sense of direction, or @a
Charge-coupled devices for computer memories
Authors: J. E. Carnes, W. F. Kosonocky, J. M. Chambers, D. J. Sauer
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

The charge-coupled device (CCD) is an analog shift register which is based upon MOS (metal-oxide semiconductor) technology and is capable of large scale integration. As an analog device it offers exciting and unique capabilities as an image sensor and in a variety of signal processing and filtering applications.
Improved Polynomial Multiplication Formulas over $IF₂$ Using Chinese Remainder Theorem
Authors: Murat Cenk, Ferruh Özbudak
Venue: IEEE Transactions on Computers (2009)

Let $n$ and $\ell$ be positive integers and $f(x)$ be an irreducible polynomial over $\F_2$ such that $\ell deg(f(x))
An effective approach to adaptive bandwidth allocation with QoS enhanced on IP networks
Authors: Mong-Fong Horng, Yau-Hwang Kuo, Liang-Chien Huang, Yi-Ting Chien
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

With the rapidly growth of the network technology, broadband communication systems have become very important. However, most scheduling algorithms in network devices lacks of the ability to dynamically allocate bandwidth among connection with various quality demand. In this paper, we propose an adaptive bandwidth allocation mechanism to enhance the network quality to meet the requirements of various applications. The proposed scheme can allocate the resources of the network bandwidth according to the queue dynamics of each router and a weight-adjusting mechanism that comprises priorities. In this algorithm, we not only consider the priority of each queue, but also will efficiently utilize the link bandwidth. To verify the proposed scheme, we develop a packet schedule based on Linux kernel. The result shows that the proposed scheduling algorithm indeed improves the bandwidth utilization and comprises the priority mechanism.
Personal verification based on extraction and characterisation of retinal feature points
Authors: Marcos Ortega, M. G. Penedo, J. Rouco, N. Barreira, M. J. Carreira
Venue: Journal of Visual Languages and Computing (2009)

This paper describes a methodology of verification of individuals based on a retinal biometric pattern. The pattern consists in feature points of the retinal vessel tree, namely bifurcations and crossovers. These landmarks are detected and characterised adding semantic information to the biometric pattern. The typical authentication process of a person once extracted the biometric pattern includes matching it with the stored pattern for the authorised user obtaining a similarity value between them. A matching algorithm and a deep analysis of similarity metrics performance is presented. The semantic information added for the feature points allows to reduce the computation load in the matching process as only points classified equally can be matched. The system is capable of establishing a safe confidence band in the similarity measure space between scores for patterns of the same individual and between different individuals.
How does user heterogeneity affect performance of P2P caching?: evolutionary game theoretic approach
Authors: Masahiro Sasabe, Yusuke Matsuda, Tetsuya Takine
Venue: Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems (2008)

Ubiquitous information societies enables us to freely obtain information anytime and anywhere. Beyond this concept, achievement of ambient information societies has been expected in recent years, in which we can retrieve desired information in accordance with current conditions of surrounding environments. In this paper, we focus on Peer-to-Peer (P2P) file sharing systems as an example of such ambient information sharing systems. We try to figure out the system performance when all users behave selfishly and autonomously according to their surrounding situations. In P2P file sharing systems, file availability is improved by users cooperatively caching and sharing files. However, many users may hesitate to cache files cooperatively due to the cost for caching, such as storage consumption, processing load, and bandwidth consumption. In such a case, unpopular files are likely to disappear from the system. In this paper, we reveal how the selfish user behavior affects the system performance using evolutionary game theoretic approach. Specifically, we focus on situations where users are heterogeneous in terms of aggressiveness in cooperative caching. Analytical results show that the user heterogeneity contributes to the stability of file availability.
Asymmetrical interval regression using extended ε -SVM with robust algorithm
Authors: Shao-Qing Xu, Qiang-Yi Luo, Guang-Hui Xu, Lei Zhang
Venue: Fuzzy Sets and Systems (2009)

In an asymmetrical interval data set, the error ranges of the upper and lower interval ends are different. This situation is common in practice because of the usual presence of uncertain influences. In prior ''crisp input and interval output'' regression analysis, a crude symmetrical estimation is obtained, and the asymmetrical character of training data cannot be depicted exactly. In this paper, an asymmetrical interval data analysis is proposed for the first time. The two interval ends are studied independently, and a set of regression models and @e-insensitive functions are proposed to strengthen the description of the interval ends. The support vector machine (SVM) is imported into this approach (for its model-free character in nonlinear regression) and further extended by @e-insensitive functions to the extended @e-SVM. A robust algorithm is presented to eliminate the effect of outliers. Experiments are then presented to verify the quality of performance of the extended @e-SVM. Advantages over other approaches are considered in the conclusion.
PISARO: Perceptual Colour and Texture Queries using Stackable Mosaics
Authors: Matthew Seaborn, Lee Hepplewhite, John Stonham
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

This paper introduces PISARO (Perceptual Image Similarity And Retrieval Online), a web based image retrieval system designed for combining, evaluating and comparing Content Based Image Retrieval (CBIR) techniques. The need for a query interface which allows the user to understand both query and subsequent retrievals is identified and implemented together with a stackable mosaic approach to query design which gives the benefit of pre-calculated features whilst allowing the user to paint queries. Several colour and texture based feature extraction methods are evaluated for CBIR including a new Perceptual Colour Histogram. Finally, the suitability of the stackable mosaic approach is demonstrated using colour and texture query combinations.
ARP-like direct link transmission scheme in WLAN
Authors: Yuh-Chung Lin, Wei Kuang Lai, Feng-Jung Liu
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

IEEE 802.11 is the most wide-spread standard for wireless LAN due to easy installation and low cost. Most of the WLAN established around the world are working on infrastructure mode. In such mode, there exists an access point (AP) to be a portal to the Internet for wireless users in its coverage. For communications inside a cell, the infrastructure mode is not an efficient way for data transmission. When the number of traffics increases in the WLAN, the contention for accessing the channel makes the system throughput degrade dramatically. How to improve the effectiveness of bandwidth utilization is always one of the most important issues in wireless communications. A better way would be setting up a direct link connection for transmissions between non-hidden stations. In this paper, we refer to Address Resolution Protocol (ARP) and propose a simple new scheme, called ARP-like Direct Link Transmission scheme, to set up direct link connections among non-hidden stations in the same cell. The proposed scheme can effectively improve the overall system throughput and reduce the delay and jitter as shown in the simulation results.
Accelerating Calculations on the RASC Platform: A Case Study of the Exponential Function
Authors: Maciej Wielgosz, Ernest Jamro, Kazimierz Wiatr
Venue: Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications (2009)

This paper presents results of the tests performed to determine high speed calculations capabilities of the SGI RASC platform. Different data transfer modes and memory management approaches were examined to choose the most effective combination of the Host and RASC memory adjustments. Obtained results of measurements revealed that Direct I/O mode together with DMA transfer provides the highest data throughput between the Host and RASC slice. Nevertheless, for some application multi-buffering may appear to be more suitable in terms of concurrent data transfer capabilities and FPGA algorithm execution. As an example of calculation to be accelerated the exponent function is taken for which computation speed is far beyond data transfer capability of the RASC platform.
Content control
Authors: Leah Hoffmann
Venue: Communications of the ACM (2009)

Entertainment businesses say digital rights management prevents the theft of their products, but access control technologies have been a uniform failure when it comes to preventing piracy. Fortunately, change is on the way.
A biologically inspired technique for sampling of color images
Authors: Rajesh B Raut, K. M. Bhurchandi
Venue: Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems (2008)

Color space dimensionality possesses main problem in fast processing of color images so appropriate sampling of color images is very important. Unlike the existing statistical sampling algorithm, in this paper, a biologically inspired non-linear color image sampling technique has been proposed using non-uniform quantization of RGB space. Response of human retinal receptors to various light intensities is non-linear in nature. Buschbaum has qualitatively presented the non-linear tan-sigmoid model of the human vision as against the logarithmic and power law models. An experiment has been carried out on certified normal color vision observers in broad day light conditions to model their color vision. Readings of this experiment were used to compute the parameters of Red, Green and Blue color vision non-linearity presented by Buchsbaum. These parametric non-linearity equations were used to sample the color images and other applications of the work have been proposed. The non-linearity equations with respective parameters represent the models of Red, Green and Blue color vision receptors. Physiological limitations and facts of human vision have been utilized to compute the parameter.
Efficient computable error bounds for discontinuous Galerkin approximations of elliptic problems
Authors: S. K. Tomar, S. I. Repin
Venue: Journal of Computational and Applied Mathematics (2009)

We present guaranteed and computable both sided error bounds for the discontinuous Galerkin (DG) approximations of elliptic problems. These estimates are derived in the full DG-norm on purely functional grounds by the analysis of the respective differential problem, and thus, are applicable to any qualified DG approximation. Based on the triangle inequality, the underlying approach has the following steps for a given DG approximation: (1) computing a conforming approximation in the energy space using the Oswald interpolation operator, and (2) application of the existing functional a posteriori error estimates to the conforming approximation. Various numerical examples with varying difficulty in computing the error bounds, from simple problems of polynomial-type analytic solution to problems with analytic solution having sharp peaks, or problems with jumps in the coefficients of the partial differential equation operator, are presented which confirm the efficiency and the robustness of the estimates.
Detecting network intrusions using signal processing with query-based sampling filter
Authors: Liang-Bin Lai, Ray-I Chang, Jen-Shiang Kouh
Venue: EURASIP Journal on Advances in Signal Processing (2009)

This paper presents a novel approach for training a network intrusion detection system based on a query-based sampling (QBS) filter. The proposed QBS filter applies the concepts of data quantization to signal processing in order to develop a novel classification system. Through interaction with a partially trained classifier, the QBS filter can use an oracle to produce high-quality training data. We tested the method with a benchmark intrusion dataset to verify its performance and effectiveness. Results show that selecting qualified training data will have an impact not only on the performance but also on overall execution (to reduce distortion). This method can significantly increase the accuracy of the detection rate for suspicious activity and can recognize rare attacks. Additionally, the method can improve the efficiency of real-time intrusion detection models.
Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands
Authors: George Karakostas, Stavros G. Kolliopoulos
Venue: Algorithmica (2009)

We examine how to induce selfish heterogeneous users in a multicommodity network to reach an equilibrium that minimizes the social cost. In the absence of centralized coordination, we use the classical method of imposing appropriate taxes (tolls) on the edges of the network. We significantly generalize previous work (Yang and Huang in Transp. Res. Part B 38:1&#x2013;15, [2004]; Karakostas and Kolliopoulos in Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp.&#x00a0;268&#x2013;276, [2004]; Fleischer et&#x00a0;al. in Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp.&#x00a0;277&#x2013;285, [2004]) by allowing user demands to be elastic. In this setting the demand of a user is not fixed a priori but it is a function of the routing cost experienced, a most natural assumption in traffic and data networks.
Randomized generation of acyclic orientations upon anonymous distributed systems
Authors: Gladstone M. Arantes,  Jr., Felipe M. G. França, Carlos A. Martinhon
Venue: Journal of Parallel and Distributed Computing (2009)

This paper presents two new randomized distributed algorithms for the generation of acyclic orientations upon anonymous distributed systems of arbitrary topology. Both algorithms, called Alg-Neighbors and Alg-Edges, make use of biased and unbiased dice having f>=2 faces, and are analyzed in terms of correctness, expected time complexity and rate of convergence. First, the Alg-Neighbors algorithm is presented as a generalization of the Calabrese/Franca algorithm for dice (or coins) with 2 faces. It is proved that a convenient biasing function applied to all dice changes the expected time complexity from sub-exponential, i.e., O(f(ff-1)^n^-^1) (for unbiased dice with f faces), to O(n), where n is the number of the system's nodes. Next, it is shown that the Alg-Edges algorithm is able to produce acyclic orientations in O(log"fm) steps with high probability, where m denotes the total number of edges. Finally, a speed of convergence versus quality of acyclic orientation generation (associated number of colors) tradeoff is identified between Alg-Neighbors and Alg-Edges algorithms. Computational experiments were carried out in order to provide a more accurate description of the behavior of both algorithms.
Fast and scalable packet classification using perfect hash functions
Authors: Viktor Puš, Jan Korenek
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

Packet classification is an important operation for applications such as routers, firewalls or intrusion detection systems. Many algorithms and hardware architectures for packet classification have been created, but none of them can compete with the speed of TCAMs in the worst case. We propose new hardware-based algorithm for packet classification. The solution is based on problem decomposition and is aimed at the highest network speeds. A unique property of the algorithm is the constant time complexity in terms of external memory accesses. The algorithm performs exactly two external memory accesses to classify a packet. Using FPGA and one commodity SRAM chip, a throughput of 150 million packets per second can be achieved. This makes throughput of 100 Gbps for the shortest packets. Further performance scaling is possible with more or faster SRAM chips.
An efficient signature-based strategy for supporting inexact filtering in information filtering systems
Authors: Ye-In Chang, Lee-Wen Huang, Jun-Hong Shen, Yi-Siang Wang
Venue: Expert Systems with Applications: An International Journal (2009)

To help users find the right information from a great quantity of data, Information Filtering (IF) sends information from servers to passive users through broadcast mediums, rather than being searched by them. To efficiently store many user profiles in servers and filter irrelevant users, many signature-based index techniques are applied in IF systems. By using signatures, IF does not need to compare each item of profiles to filter out irrelevant ones. However, because signatures are incomplete information of profiles, it is very hard to answer the complex queries by using only the signatures. Therefore, a critical issue of the signature-based IF service is how to index the signatures of user profiles for an efficient filtering process. The inexact filtering query is one kind of queries in the signature-based IF systems which is used to filter out the non-qualified data compared with queries. In this paper, we propose an ID-tree index strategy, which indexes signatures of user profiles by partitioning them into subgroups using a binary tree structure according to all of the different items among them. In an ID-tree, each path from the root to a leaf node is the signature of the profile pointed by the leaf node. Because each profile is pointed by only one leaf node of the ID-tree, there will be no collision in the structure. Moreover, only the different items among subgroups of profiles will be checked at one time to filter out irrelevant profiles for queries. Therefore, our strategy can answer the inexact filtering query with less number of accessed profiles as compared to Chen's signature tree strategy. From our simulation results, we have shown that our strategy can access less number of profiles to answer the queries than Chen's signature tree strategy for the inexact filtering.
New Closed-Form of the Largest Eigenvalue PDF for Max-SNR MIMO System Performances
Authors: Jonathan Letessier, Baptiste Vrigneau, Philippe Rostaing, Gilles Burel
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Multiple-input multiple-output (MIMO) maxi-mum-SNR (max-SNR) system employs the maximum ratio combiner (MRC) at the receiver side and the maximum ratio transmitter (MRT) at the transmitter side. Its performances highly depend on MIMO channel characteristics, which vary according to both the number of antennas and their distribution between the transmitter and receiver sides. By using the decomposition of the ordered Wishart distribution in the uncorrelated Rayleigh case, we derived a closed-form expression of the largest eigenvalue probability density function (PDF). The final result yields to an expression form of the PDF where polynomials are multiplied by exponentials; it is worth underlining that, though this form had been previously observed for given couples of antennas, to date no formally-written closed-form was available in the literature for an arbitrary couple. Then, this new expression permits one to quickly and easily get the well known largest eigenvalue PDF and use it to determine the binary error probability (BEP) of the max-SNR.
Recognition of Low-Dimensional Patterns in Radio Access Network Data
Authors: Berna Sayrac
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

In this work, we aim at finding the low dimensional hidden structures or manifolds that exist in the high dimensional data produced by a Radio Access Network (RAN). Specifically, we consider the Key Performance Indicators (KPIs) of a UMTS network. The KPI data is obtained by performing semi-dynamic simulations of a Radio Network Planning (RNP) tool. The low-dimensional manifold, yielding a meaningful and tractable representation of the performance indicators, facilitates the complicated tasks like monitoring, troubleshooting, fault detection, design, radio resource management etc. We have applied one second-order linear (PCA), one high-order linear (ICA) and one nonlinear technique (ISOMAP) of manifold learning and compared the results.