ppxscal/embedding_network huggingface dataset:
Usages of the Secondary Screen in an Interactive Television Environment: Control, Enrich, Share, and Transfer Television Content
Authors: Pablo Cesar, Dick C. Bulterman, A. J. Jansen
Venue: Proceedings of the 6th European conference on Changing Television Environments (2008)

This paper investigates a number of techniques and services around a unifying concept: the secondary screen. Far too often television consumption is considered a passive activity. While there are specific genres and programs that immerse the viewer into the media experience, there are other times in which whilst watching television, people talk, scan the program guide, record another program or recommend a program by phone. This paper identifies four major usages of the secondary screen in an interactive digital television environment: control, enrich, share, and transfer television content. By control we refer to the decoupling of the television stream, optional enhanced content, and television controls. Moreover, the user can use the secondary screen to enrich or author media content by, for example, including personalized media overlays such as an audio commentary that can be shared with his peer group. Finally, the secondary screen can be used to bring along the television content. This paper reviews previous work on the secondary screen, identifies the key usages, and based on a working system provides the experiences of developing relevant scenarios as well as an initial evaluation of them.
Switched multiband filters for IEEE 802.11a/b/g WLANs
Authors: S. Raghavan, P. Sion
Venue: Proceedings of the 7th WSEAS International Conference on Instrumentation, Measurement, Circuits and Systems (2008)

Switched Multiband Microstrip bandpass filters for IEEE 802.11a/b/g WLANs are presented. Cross coupled square open loop resonator type of filter is used as the basic design. These filters were selected since there was a tuning parameter available in the structure which changed the center frequency without change in performance. Two MEMS reconfigurable filter structures are proposed. Static simulations for each position of the MEMS switches were performed for S11 and S12 to observe the bandwidth and insertion loss of the filter. The simulations were performed on IE3D 10.06.
Automated global-to-local programming in 1-D spatial multi-agent systems
Authors: Daniel Yamins, Radhika Nagpal
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

A spatial computer is a distributed multi-agent system that is embedded in a geometric space. A key challenge is engineering local agent interaction rules that enable spatial computers to robustly achieve global computational tasks. This paper develops a principled approach to global-to-local programming, for pattern formation problems in a one-dimensional multi-agent model. We present theoretical analysis that addresses the existence, construction, and resource tradeoffs of robust local rule solutions to global patterns, and which together form a "global-to-local compiler".
A Secure Packet Filtering Mechanism for Tunneling over Internet
Authors: Wan-Jik Lee, Seok-Yeol Heo, Tae-Young Byun, Young-Ho Sohn, Ki-Jun Han
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

Unlike Internet design policies of early stage, various types of tunneling are currently used in Internet for IPv4/IPv6 transition, IP multicasting and IP mobility. As tunneled packets have dual IP headers, general firewall systems apply the filtering rules only to the outer header but not to the inner header when these packets pass the firewall. Thus, many present firewall systems may have serious security problems to packet filtering for tunneled packets. To resolve this issue, a new packet filtering mechanism to filter tunneled packets is proposed in this paper. We design and implement the packet filtering mechanism by using Linux Netfilter. Through this study, the packet filtering system was also found operating correctly in the IPv6-in-IPv4/IP-in-IP tunneling.
Manifold Construction Using the Multilayer Perceptron
Authors: Wei-Chen Cheng, Cheng-Yuan Liou
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

We present a training method which adjusts the weights of the MLP (Multilayer Perceptron) to preserve the distance invariance in a low dimensional space. We apply visualization techniques to display the detailed representations of the trained neurons.
Compact routing design in networks of low doubling dimension
Authors: Donglin Xia
Venue:  (2008)

A routing scheme is a distributed algorithm that allows any source node to route packets to any destination node in a distributed network. There are two variants of routing scheme design: (i) labeled (name-dependent) routing, where the designer is allowed to rename the nodes so that the names (labels) can contain additional routing information, e.g. topological information; and (ii) name-independent routing, which works on top of the arbitrary original node names in the network, i.e. the node names are independent of the routing scheme. This thesis focuses on the design of routing schemes, in both labeled and name-independent models, in networks whose shortest path metric has low doubling dimension. The main trade-off considered in the design is between the space requirement and the stretch, where the stretch is the maximum ratio of the length of a routing path to the shortest-path distance, over all source-destination pairs. The space requirement of a scheme refers to the size of routing tables maintained at each node and the size of packet headers used by the scheme. A routing scheme is compact if its space requirement is polylogarithmic in the number of nodes. The following paragraphs describe the results, achieved in the thesis, of various of compact routing problems. First, given any constant epsilon in (0, 1), and an n-node edge-weighted network of low doubling dimension in O(loglog n), both a compact labeled routing scheme with (1+epsilon) stretch and a compact name-independent routing scheme with (9 + epsilon) stretch are achieved. In addition, an asymptotically tight lower bound is proved that any name-independent routing scheme with compact space requirement has stretch no less than 9. In spite of the lower bound, compact name-independent routing schemes with better stretch, (1 + epsilon), are presented by relaxing guarantees to allow for (i) a small fraction of nodes to have large storage, or for (ii) a small fraction of source-destination pairs to have larger, but still constant (9 + epsilon), stretch. Furthermore, this thesis also considers scenarios where the network topology may vary over time. In networks in presence of failures, optimal-stretch compact routing schemes are provided. In dynamic networks where nodes may join, leave and move, optimal-stretch compact metric routing schemes with locality-sensitive movement protocol are presented. Finally, constant-stretch compact routing schemes are achieved in bounded decomposable networks, a more general class than bounded doubling networks.
Cryptanalysis of the SFLASH Signature Scheme
Authors: Vivien Dubois, Pierre-Alain Fouque, Adi Shamir, Jacques Stern
Venue: Information Security and Cryptology: Third SKLOIS Conference, Inscrypt 2007, Xining, China, August 31 - September 5, 2007, Revised Selected Papers (2007)

SFLASH is a signature scheme proposed by Patarin, Goubin and Courtois in 2001 [9,7] following a design they had introduced in 1998 [8]. SFLASH is reputed for being very fast and has been recommended by the NESSIE European Consortium since 2003 as the best known solution for implementation on low cost smart cards [5]. In this abstract, we present new attacks on the general design proposed by Patarin et al. [8] which allows to forge signatures in a few minutes for practical instantiations including the SFLASH scheme recommended by NESSIE [5].
A Virtual Reality Patient and Environments for Image Guided Diagnosis
Authors: Barnabas Takacs, David Hanak, Kirby G. Voshburg
Venue: Proceedings of the 4th international workshop on Medical Imaging and Augmented Reality (2008)

We describe a real-time virtual reality platform and a novel visualization technique designed to deliver constant rendering speed of highly detailed anatomical structures at interactive rates using portable, and low-cost computers. Our solution represents the torso section of the human body as a volumetric data set and employs label maps as the prime data format of storing anatomical structures. Multi-channel 3D textures are uploaded to the GPU and a simple pixel shader algorithm allows operators to select structures of interest in real-time. The visualization module described herein was successfully integrated into a virtual-reality 3D Anatomical Guidance System for Ultrasound Operators and its rendering performance tested on a "backpack" system.
Theoretical study of pure (Si$_{n}$) and doped silicon (AlSi$_{n-1}$ and PSi$_{n-1}$) clusters (n=2-13) using ab initio molecular orbital theory
Authors: Sandeep Nigam, S. K. Kulshreshtha, Chiranjib Majumder
Venue: Journal of Computational Methods in Sciences and Engineering (2007)

The geometric and electronic structures of Si$_{n}$, Si$_{n}^{+}$, Si$_{n}^-$, AlSi$_{n-1}$ and PSi$_{n-1}$ clusters (2 &les; n &les;13) has been investigated using the ab initio molecular orbital theory under the density functional theory formalism. Relative stabilities of these clusters have been analyzed based on their binding energies, second difference in energy ($&Delta;^{2}$E) and fragmentation behavior. The equilibrium geometry of the neutral and charged Si$_{n}$ clusters shows similar structural growth. The geometries of the Si$_{n}^{+}$ and AlSi$_{n-1}$ are similar to those of the Si$_{n}$, but with small distortions. The ground state geometries of the AlSi$_{n-1}$ clusters shows that the impurity Al atom prefers to substitute for the Si atom, that has the highest coordination number in the host Si$_{n}$ cluster. However for Si$_{n}^-$, n=6, 8, 11, and 13, significant changes have been observed in the ground state geometries of the negatively charged clusters as compared to their neutral counterparts. In general the geometries of the P substituted silicon clusters remain similar to that of negatively charged Si$_{n}$ clusters with small local distortions. In general, the average binding energy of charged clusters is found to be higher than that of neutral Si$_{n}$ clusters. However, significant differences have been observed in the electronic structure of neutral and charge cluster leading to their different stability pattern. While for neutral clusters, the Si$_{10}$ is magic, the extra stability of the Si$_{11}^{+}$ cluster over the Si$_{10}^{+}$ and Si$_{12}^{+}$bears evidence for the magic behavior of the Si$_{11}^{+}$ cluster, which is in excellent agreement with the recent experimental observations (ref. [29]). Similarly for AlSi$_{n-1}$ clusters, which is iso-electronic with Si$_{n}^{+}$ clusters show extra stability of the AlSi$_{10}$ cluster suggesting the influence of the electronic structures for different stabilities between neutral and charged clusters. For iso-electronic PSi$_{n-1}$ clusters, it is found that although for small clusters (n< 4) substitution of P atom improves the binding energy of Si$_{n}$ clusters but for larger clusters (n > 4), the effect is opposite. The fragmentation behavior of all these clusters shows that while small clusters prefers to evaporate monomer, the larger ones dissociates into two stable clusters of smaller size. Finally, a good agreement between experimental and our theoretical results suggests good prediction of the lowest energy isomeric structures for all clusters calculated in the present study.
Building and Assessing a Constrained Clustering Hierarchical Algorithm
Authors: Eduardo R. Concepción Morales, Yosu Yurramendi Mendizabal
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

Unsupervised classification or clustering has been used in many disciplines and contexts. Traditional methodologies are mostly based on the minimization of the distance between data and the cluster means without considering any other possible relationship present in data, e.g., spatial interactions. A constrained hierarchical agglomerative algorithm with an aggregation index is introduced which uses neighbouring relations present in the data. Experiments show the behaviour of the proposed constrained algorithm in different situations.
Honeypot Based Routing to Mitigate DDoS Attacks on Servers at ISP Level
Authors: Anjali Sardana, R. C. Joshi
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

DDOS attacks generate flooding traffic from multiple sources towards selected nodes and cause obstruction in flow of legitimate information within a network. If the victim node is the server at ISP level requiring fast information processing, the entire network operation stops. We use various lines of honeypot based defense against such attacks. The first line of defense detects the presence of attacks. The second line of defense identifies and tags attack flows in real time. The work in this paper concentrates on the third line of defense, where a model for honeypot based routing has been proposed in response to identified attack flows. We propose the automatic generation of adequate server nodes to service client requests and honeypots to interact with attackers in contained manner. The judicious mixture of servers and honeypots at different time intervals provide stable network functionality at ISP level. We validate the effectiveness of the approach with modeling on Internet type topology and simulation in ns-2 on a Linux platform.
Blind seismic deconvolution by exploiting the sparsity of mixing matrix and earth signal
Authors: Aws Al-Qaisi, W. L. Woo, S. S. Dlay
Venue: Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation (2008)

Recently blind seismic deconvolution has received a great deal of attention. In seismic deconvolution, blind approaches can be considered in situations where the reflectivity sequence and the source wavelet, are unknown from given seismic traces. This paper provides a novel method to solve the blind seismic deconvolution problem using independent component analysis by exploiting the sparsity of both the reflectivity sequence and the mixing matrix. The reflectivity sequence can be modelled as Bernoulli Gaussian process where the nonzero elements of the sparse mixing matrix contain the convolution filter. Our technique incorporates the sparsity of the mixing matrix into the pre-processing step and a novel logistic function that matches the sparsity of reflectivity sequence distribution has been proposed and fitted into the information maximization algorithm. These results in a more accurate estimation of both the wavelet and the reflectivity sequence compared with conventional independent component analysis (ICA) algorithm. The mean square error (MSE) of estimated wavelet and estimated reflectivity sequence shows the improvement of proposed algorithm.
Computer performance tests employed by the National Bureau of Standards
Authors: S. N. Alexander, R. D. Elbourn
Venue: Papers and discussions presented at the Dec. 8-10, 1953, eastern joint AIEE-IRE computer conference: information processing systems---reliability and requirements (1953)

During the past five years the National Bureau of Standards has collaborated with five government agencies in technical programs that involved the performance testing of complete electronic digital-computing systems. Devising a meaningful evaluation procedure proved to be a surprisingly elusive task. Because digital computers are highly integrated assemblies, there is not much value that the prospective user gains from a detailed check on each of the individual facilities and units.
Performance tuning policies for application level fault tolerance in distributed object systems
Authors: Theodoros Soldatos, Nantia Iakovidou
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

In distributed object systems, application level fault tolerance is often attained by appropriate object replication policies. These policies aim at increasing the exhibited service availability by masking potential faults that do not recur after recovery. Existing middleware support infrastructures allow customizing object replication properties. However, since fault tolerance has a significant impact in the perceived service performance, there is a need for a suitable quantitative design technique, which allows comparing different replication policies by trading off the caused overhead cost against the achieved fault-tolerance effectiveness. We are also interested in taking into account different concerns in a combined manner (e.g. fault tolerance combined with load balancing and multithreading). This paper presents experimental evidence for the most important performance tradeoffs revealed in a simulation-based study. We considered different cases of object request loss behavior for the faulty objects, as well as, a number of request-retry strategies. The experiments took place in two different application workload levels for varied fault detection settings. We provide results for the combined effects of the studied replication policies with two specific load-balancing strategies. The presented results constitute a valuable experience report for performance tuning object replication policies for application level fault tolerance.
PCA and SVD with nonnegative loadings
Authors: Stan Lipovetsky
Venue: Pattern Recognition (2009)

Principal component analysis (PCA) and singular value decomposition (SVD) are widely used in multivariate statistical analysis for data reduction. The work considers exponential, logit, and multinomial parameterization of the eigenvectors' elements that always yields nonnegative loadings of shares for variable aggregation. In contrast to regular PCA and SVD, matrix decomposition by the positive shares shows explicitly which variables and with which percent are composed into each group, so what is each variable contribution to data approximation. The least squares objective of matrix fit is reduced to Rayleigh quotient for variational description of the eigenvalues. Eigenvectors with the nonlinear parameterization can be found in Newton-Raphson optimizing procedure. Numerical examples compare the classical and nonnegative loadings results, with interpretation by the Perron-Frobenius theory for each subset of variables identified by sparse loading vectors.
Parallel external sort of floating-point data by integer conversion
Authors: Changsoo Kim, Sungroh Yoon, Dongseung Kim
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

This paper introduces a fast external sorting algorithm of floating point numbers with integer operations only, which shortens the computing time significantly. Conversion overhead to integer can be avoided if the floating point data are stored in the disk since integer conversion is made while they are read from the data file. Experimentally large-scale data stored in the disk are sorted in a cluster computer with various data distributions, where speedups over two fold or more are observed.
Channel Adaptive Power Control in the Uplink of CDMA Systems
Authors: Seung-Ok Choi, Kwan-Ho You
Venue: Wireless Personal Communications: An International Journal (2008)

In this paper, we propose an adaptive power control algorithm using optimal control theory for CDMA cellular systems. With linear quadratic control, each mobile transmits to achieve a desired SIR under the fast varying environment of practical CDMA cellular systems. We apply Kalman filter theory to estimate a channel variation which is vulnerable to nonconstant link gain, mutual interference and uncertain noise. Through simulation comparison with DCPC algorithm, the suggested power control algorithm shows an increased uplink channel capacity.
Fourth-Order Ambiguity Function Based on the Fractional Fourier Transform
Authors: Tao Shan, Ran Tao, Rongrong Sun
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

Second-order cross ambiguity function based on the fractional Fourier transform (CAF-FRFT-SOS) can be used in joint estimation of time delay, Doppler shift and Doppler rate of the echoes, but it can not restrain the correlated Gaussian noise. This paper presents the fourth-order ambiguity function based on the fractional Fourier transform (FRFT). It can be utilized to overcome the deficiency of CAF-FRFT-SOS and be used in the unknown correlated Gaussian noise environment. The simulations prove the efficiency of this algorithm
Investigating System Navigation Ergonomics through Model Verification
Authors: Alexandre Scaico, Maria F. Q. Vieira, Markson R. Sousa, Charles Santoni
Venue: Interactive Systems. Design, Specification, and Verification: 15th International Workshop, DSV-IS 2008 Kingston, Canada, July 16-18, 2008 Revised Papers (2008)

This paper discusses the use of formal models in the process of investigating the ergonomics of the navigation component in interactive systems. The investigation is based upon model analysis and a set of navigation properties. The formalism employed on this work was Coloured Petri Nets. The paper illustrates how the set of ergonomic properties was mapped into the model properties with the support of the formalism tools and specific functions developed to support the interface designer during model analysis. The context chosen as the basis for discussion is the operation of automated systems in the electricity industry; and a case study is presented to illustrate the analysis.
Matrix Learning for Topographic Neural Maps
Authors: Banchar Arnonkijpanich, Barbara Hammer, Alexander Hasenfuss, Chidchanok Lursinsap
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

The self-organizing map (SOM) and neural gas (NG) constitute popular algorithms to represent data by means of prototypes arranged on a topographic map. Both methods rely on the Euclidean metric, hence clusters are isotropic. In this contribution, we extend prototype-based clustering algorithms such as NG and SOM towards a metric which is given by a full adaptive matrix such that ellipsoidal clusters are accounted for. We derive batch optimization learning rules for prototype and matrix adaptation based on a general cost function for NG and SOM and we show convergence of the algorithm. It can be seen that matrix learning implicitly performs minor local principal component analysis (PCA) and the local eigenvectors correspond to the main axes of the ellipsoidal clusters. We demonstrate the behavior in several examples.
MBabCoNN --- A Multiclass Version of a Constructive Neural Network Algorithm Based on Linear Separability and Convex Hull
Authors: João Roberto Bertini,  Jr., Maria Carmo Nicoletti
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part II (2008)

The essential characteristic of constructive neural network (CoNN) algorithms is the incremental construction of the neural network architecture along with the training process. The BabCoNN (Barycentric-based constructive neural network) algorithm is a new neural network constructive algorithm suitable for two-class problems that relies on the BCP (Barycentric Correction Procedure) for training its individual TLU (Threshold Logic Unit). Motivated by the good results obtained with the two-class BabCoNN, this paper proposes its extension to multiclass domains as a new CoNN algorithm named MBabCoNN. Besides describing the main concepts involved in the MBabCoNN proposal, the paper also presents a comparative analysis of its performance versus the multiclass versions of five well known constructive algorithms, in four knowledge domains as an empirical evidence of the MBabCoNN suitability and efficiency for multiclass classification tasks.