ppxscal/embedding_network huggingface dataset:
Computationally Efficient Estimators for Dimension Reductions Using Stable Random Projections
Authors: Ping Li
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

The method of stable random projections is an efficient tool for computing the lα distances using low memory, where 0 1. We derive its theoretical error bound and establish the explicit (i.e., no hidden constants) sample complexity bound. 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
Design of digital beamforming-based automobile collision avoidance system
Authors: Sundararajan Srinivasan
Venue: Proceedings of the 8th conference on Signal processing, computational geometry and artificial vision (2008)

This paper describes the design of an automobile forward collision avoidance system based on digital beamforming techniques. The advantages of using digital beamforming over the existing system is stressed upon. In the proposed system, an adaptive array of antennas is used in the receiver side to form a pencil beam. The methodology of electronically controlling the direction of the pencil beam is described. Various methods of power spectrum estimation techniques are analyzed and compared both theoretically and through simulation in order to recommend the best approach for the proposed system. Linear prediction-based tracking algorithms are compared and the most accurate and efficient of them is identified. A DSP-based or ASIC-based implementation of this system can perform the entire collision avoidance functionality inside the host vehicleŠs on board computer.
Hybrid Automata in Systems Biology: How Far Can We Go?
Authors: Dario Campagna, Carla Piazza
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

We consider the reachability problem on semi-algebraic hybrid automata. In particular, we deal with the effective cost that has to be afforded to solve reachability through first-order satisfiability. The analysis we perform with some existing tools shows that even simple examples cannot be efficiently solved. We need approximations to reduce the number of variables in our formulae: this is the main source of time computation growth. We study standard approximation methods based on Taylor polynomials and ad-hoc strategies to solve the problem and we show their effectiveness on the repressilator case study.
Research on Data Protection System in Computer Network
Authors: Ying Li, Guifen Zhao, Tong Liu
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

In order to improve the data security over network and provide more effective data protection product, this paper introduces a network data protection system based on combined symmetric key. The system takes into account four main aspects in data protection, including identity authentication, encryption transmission, access controls and encryption storage. The solution combines four aspects into a whole secure system. Meanwhile, hardware equipments and combined symmetric key encryption technique are applied to encrypt the information. Consequently, network data security would be enhanced.
Evaluating Sampling Based Hotspot Detection
Authors: Qiang Wu, Oskar Mencer
Venue: Proceedings of the 22nd International Conference on Architecture of Computing Systems (2009)

In sampling based hotspot detection, performance engineers sample the running program periodically and record the Instruction Pointer (IP) addresses at the sampling. Empirically, frequently sampled IP addresses are regarded as the hotspot of the program. The question of how well the sampled hotspot IP addresses match the real hotspot of the program is seldom studied by the researchers. In this paper, we use instrumentation tool to count how many times the sampled hotspot IP addresses are executed, and compare the real execution result with the sampled one to see how well they match. We define the normalized root mean square error, the sample coverage and the order deviation to evaluate the difference between the real execution and the sampled results. Experiment on the SPEC CPU 2006 benchmarks with various sampling periods is performed to verify the proposed evaluation measurements. Intuitively, the sampling accuracy decreases with the increase of sampling period. The experimental results reveal that the order deviation reflects the intuitive relation between the sampling accuracy and the sampling period better than the normalized root mean square error and the sample coverage.
Pilot-Based Angle-Domain Channel Estimation for MIMO-OFDM Systems
Authors: Peng Xu, Jinkuan Wang, Feng Qi
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

Multiple-input multiple-output combined with orthogonal frequency division multiplexing (MIMO-OFDM) channel estimation could be improved by prior knowledge of the channel spatial correlation. This information is, however, not always unavailable. So, we choose to investigate channel estimation in angle domain, where different channel coefficients can be assumed to be of irrelevance. In this paper, based on traditional LS algorithm using phase shifted orthogonal pilots (PSO-ILS), an algorithm called angle-domain PSO-LS (PSO-ALS) is proposed. This algorithm has low complexity and use most significant taps (MST) to reduce the noise effect. To obtain better performance, an improved PSO-ALS (PSO-AILS) algorithm which exploit MST to improve PSO-LS algorithm firstly and then perform the same course like PSO-ALS algorithm. Simulation results indicate the proposed algorithm perform good MSE performance at low SNRs.
Signed and minus clique-transversal functions on graphs
Authors: Chuan-Min Lee, Maw-Shang Chang
Venue: Information Processing Letters (2009)

A minus (respectively, signed) clique-transversal function of a graph G=(V,E) is a function f:V->{-1,0,1} (respectively, {-1,1}) such that @?"u"@?"Cf(u)>=1 for every maximal clique C of G. The weight of a minus (respectively, signed) clique-transversal function of G is f(V)=@?"v"@?"Vf(v). The minus (respectively, signed) clique-transversal problem is to find a minus (respectively, signed) clique-transversal function of G of minimum weight. In this paper, we present a unified approach to these two problems on strongly chordal graphs. Notice that trees, block graphs, interval graphs, and directed path graphs are subclasses of strongly chordal graphs. We also prove that the signed clique-transversal problem is NP-complete for chordal graphs and planar graphs.
Image Processing by Topological Asymptotic Expansion
Authors: Didier Auroux, Mohamed Masmoudi
Venue: Journal of Mathematical Imaging and Vision (2009)

The aim of this article is to recall the applications of the topological asymptotic expansion to major image processing problems. We briefly review the topological asymptotic analysis, and then present its historical application to the crack localization problem from boundary measurements. A very natural application of this technique in image processing is the inpainting problem, which can be solved by identifying the optimal localization of the missing edges. A second natural application is then the image restoration or enhancement. The identification of the main edges of the image allows us to preserve them, and smooth the image outside the edges. If the conductivity outside edges goes to infinity, the regularized image is piecewise constant and provides a natural solution to the segmentation problem. The numerical results presented for each application are very promising. Finally, we must mention that all these problems are solved with a $\mathcal{O}(n.\log(n))$ complexity.
Better performance of neural networks using functional graph for weather forecasting
Authors: V. Joseph Raj
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Neural networks have been in use in numerous meteorological applications including weather forecasting. Neural Networks have been used as an effective method for solving many problems in a wide range of application areas. As Neural Networks are being more and more widely used in recent years, the need for their more formal definition becomes increasingly apparent. This paper presents a novel architecture of neural network models using the functional graph. The network creates a graph representation by dynamically allocating nodes to code local form attributes and establishing arcs to link them. The application of functional graph in the architecture of Electronic neural network and Opto-electronic neural network are detailed with experimental results. Learning is defined in terms of functional graph. The proposed architectures are applied in weather forecasting and X-OR problem. The percentage of correctness of the weather forecasting of the conventional neural network models, functional graph based neural network models and the meteorological experts are compared.
A Novel WLAN Positioning Technique Employing Time Delay of Successful Transmission
Authors: Peerapong Uthansakul, Monthippa Uthansakul
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

There are many approaches in literatures using the knowledge of time delay to locate the user position in WLAN system. All of them have to modify the existing WLAN infrastructure. The scales of modifications are made on hardware up to the changes in protocol of WLAN. Hence, it is an unattractive approach to use time delay for positioning system. In this paper, the new concept of utilizing time day of successful transmission to locate the position of WLAN user is presented. The advantage of using the proposed technique is no extra modification necessarily appended in the existing system. The measurement results confirm the validation of proposed concept.
Hybrid LZA: a near optimal implementation of the leading zero anticipator
Authors: Amit Verma, Ajay K. Verma, Philip Brisk, Paolo Ienne
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

The Leading Zero Anticipator (LZA) is one of the main components used in floating point addition. It tends to be on the critical path, so it has attracted the attention of many researchers in the past. Most LZAs used today can be classified in two categories: exact and inexact. Inexact LZAs are normally preferred due to their shorter critical paths and reduced complexity; however, the inexact LZA requires an additional correct stage. In this paper we present a new LZA architecture that combines ideas taken from prior exact and inexact LZAs. Our new LZA improves the delay of floating point addition by 7--10% compared to state of art techniques as well as reduces hardware area in most cases. We also establish theoretical lower bounds on the delay of an LZA and we show that our LZA is very close to these bounds.
Cost-efficient SHA hardware accelerators
Authors: Ricardo Chaves, Georgi Kuzmanov, Leonel Sousa, Stamatis Vassiliadis
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

This paper presents a new set of techniques for hard-ware implementations of Secure Hash Algorithm (SHA) hash functions. These techniques consist mostly in operation rescheduling and hardware reutilization, therefore, significantly decreasing the critical path and required area. Throughputs from 1.3 Gbit/s to 1.8 Gbit/s were obtained for the SHA implementations on a Xilinx VIRTEX II Pro. Compared to commercial cores and previously published research, these figures correspond to an improvement in throughput/slice in the range of 29% to 59% for SHA-1 and 54% to 100% for SHA-2. Experimental results on hybrid hardware/software implementations of the SHA cores, have shown speedups up to 150 times for the proposed cores, compared to pure software implementations.
Designing with children with severe motor impairments
Authors: Anthony J. Hornof
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Children with severe motor impairments such as with disabilities resulting from severe cerebral palsy benefit greatly from assistive technology, but very little guidance is available on how to collaborate with this population as partners in the design of such technology. To explore how to facilitate such collaborations, a field-based participant observation study, as well as structured and unstructured interviews, were conducted at a home for children with severe disabilities. Team-building collaborative design activities were pursued. Guidelines are proposed for how to collaborate with children with severe motor impairments.
Tight Local Approximation Results for Max-Min Linear Programs
Authors: Patrik Floréen, Marja Hassinen, Petteri Kaski, Jukka Suomela
Venue: Algorithmic Aspects of Wireless Sensor Networks: Fourth International Workshop, ALGOSENSORS 2008, Reykjavik, Iceland, July 2008. Revised Selected Papers (2008)

In a bipartite max-min LP, we are given a bipartite graph $\mathcal{G} = (V \cup I \cup K, E)$, where each agent v&thinsp;&isin;&thinsp;V is adjacent to exactly one constraint i&thinsp;&isin;&thinsp;I and exactly one objective k&thinsp;&isin;&thinsp;K. Each agent v controls a variable x v . For each i&thinsp;&isin;&thinsp;I we have a nonnegative linear constraint on the variables of adjacent agents. For each k&thinsp;&isin;&thinsp;K we have a nonnegative linear objective function of the variables of adjacent agents. The task is to maximise the minimum of the objective functions. We study local algorithms where each agent v must choose x v based on input within its constant-radius neighbourhood in . We show that for every &epsilon;>&thinsp;0 there exists a local algorithm achieving the approximation ratio &Delta; I (1&thinsp;&minus;&thinsp;1/&Delta; K )&thinsp;+&thinsp;&epsilon;. We also show that this result is the best possible &ndash; no local algorithm can achieve the approximation ratio &Delta; I (1&thinsp;&minus;&thinsp;1/&Delta; K ). Here &Delta; I is the maximum degree of a vertex i&thinsp;&isin;&thinsp;I, and &Delta; K is the maximum degree of a vertex k&thinsp;&isin;&thinsp;K. As a methodological contribution, we introduce the technique of graph unfolding for the design of local approximation algorithms.
Air quality modelling by decision trees in the Czech Republic locality
Authors: Kašparová Miloslava, Křupka Jiří
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

This paper deals with air quality modelling by decision trees in the Czech Republic locality. We focused on daily observations of air polluting substances concentrations in one of the cities in the Pardubice region. After data collection, data description, and data preprocessing, we worked on the creation of classification models and the analysis of the achieved results. As modelling algorithms we selected C5.0 algorithm, boosting, and CHAID method.
Mobility Management with OLSR Protocol for Fourth Generation (4G) Mobile Networks
Authors: Shabnam Jazayeri
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

Trends in fourth generation (4G) wireless networks are clearly identified by the full-IP concept where all traffic (data, control, voice and video services,etc.) will be transported in IP packets. Many proposals are being made to enhance IP with the functionalities necessary to manage the mobility of nodes, so that networks can provide global seamless roaming between heterogeneous wireless and wired networks. OLSR (Optimized Link State Routing) is that way for IPv6 management, this cause of reduction of overhead and recovery routing. OLSR for adhoc networks with fast nodes have poor efficiency. therefore kind of OLSR that named fast-OLSR is perposed. In this paper, we propose implementation of fast-OLSR for improvement efficiency of fourh generation (4G) mobile networks. In this implementation, use IP protocol for macro-mobility management and for micro-mobility use fast-OLSR to manage mobility. Efficiency evaluation show that loss rate proportion of use OLSR is decrease. As a result increase reliability of services.
One-way queuing delay measurement and its application on detecting DDoS attack
Authors: Wei-Zhou Lu, Wei-Xuan Gu, Shun-Zheng Yu
Venue: Journal of Network and Computer Applications (2009)

This paper presents a novel approach to measure and estimate end-to-end one-way queuing delay in a network, which carries information about traffic characteristics and congestion properties. The measurement results can be used to describe the normal behavior of the network and detect distributed denial-of-service attacks (DDoS attacks). The measurement does not require any synchronization between the two measurement ends. Pairs of probe packets are sent from the source to the destination and intra-gaps between the probes are separately measured at the two ends. By performing an iterative Fourier-to-time reconstruction algorithm on the measured intra-gaps, distribution of the end-to-end one-way queuing delay is estimated. The packet loss rate and delay jitter are simultaneously measured as well. The simulations and experiments are conducted to validate the approach.
Exploring a heterogeneous and fragmented digital ecosystem: Mobile content
Authors: Claudio Feijóo, Ioannis Maghiros, Fabienne Abadie, José-Luis Gómez-Barroso
Venue: Telematics and Informatics (2009)

This paper presents the mobile content domain as a heterogeneous and fragmented digital ecosystem. Several taxonomies are considered to distinguish between the different segments that compose the mobile content sector. Although they are useful to acknowledge a first level of fragmentation, the most usual classifications are just translations of other industries into the mobile domain and fail to gauge the attributes of mobile content that can drive its evolution. For this reason, an additional taxonomy is introduced which classifies mobile content as 'adapted', 're-purposed', 'specific', and 'augmented'. Heterogeneity in the mobile content domain is considered to derive from several main sources which are explored in the paper: players' different origins and cultures, the production-delivery-consumption structure of content businesses, the diversity of content suitable for mobile usage and the diversity of circumstances for this usage. Finally, some conclusions are introduced, summarized in the idea that the concepts presented offer a better foundation to search for the drivers and barriers related to market and social acceptance of mobile content. Its main consequence, in the authors' view, is that mobile content success will require a very segmented approach to its users' characteristics and circumstances and a continuous process of interaction and learning.
A multimodal approach for 3D face modeling and recognition using 3D deformable facial mask
Authors: A-Nasser Ansari, Mohamed Abdel-Mottaleb, Mohammad H. Mahoor
Venue: Machine Vision and Applications (2009)

We present a multimodal approach for face modeling and recognition. The algorithm uses three cameras to capture stereo images, two frontal and one profile, of the face. 2D facial features are extracted from one of the frontal images and a dense disparity map is computed from the two frontal images. Using the extracted 2D features and their corresponding disparities, we compute their 3D coordinates. We next align a low resolution 3D mesh model to the 3D features, re-project its vertices onto the frontal 2D image and adjust its profile silhouette vertices using the profile view image. We increase the resolution of the resulting 2D model at its center region to obtain a facial mask model covering distinctive features of the face. The 2D coordinates of the vertices, along with their disparities, result in a deformed 3D mask model specific to a given subject&#x2019;s face. Our method integrates information from the extracted facial features from the 2D image modality with information from the 3D modality obtained from the stereo images. Application of the models in 3D face recognition, for 112 subjects, validates the algorithm with a 95% identification rate and 92% verification rate at 0.1% false acceptance rate.
Computer Simulation of Aṣṭ ādhyā yī: Some Insights
Authors: Pawan Goyal, Amba Kulkarni, Laxmidhar Behera
Venue: Sanskrit Computational Linguistics: First and Second International Symposia Rocquencourt, France, October 29-31, 2007 Providence, RI, USA, May 15-17, 2008 Revised Selected and Invited Papers (2009)

PāniniAṣṭ ādhyā yī is often compared to a computer program for its rigour and coverage of the then prevalent Sanskrit language. The emergence of computer science has given a new dimension to the Pāninian studies as is evident from the recent efforts by Mishra [7], Hyman [5] and Scharf [10]. Ours is an attempt to discover programming concepts, techniques and paradigms employed by Pānini. We discuss how the three sūtras: pūrvatrā siddham 8.2.1, asiddhavad atrābhā t 6.4.22, and ṣatvatukor asiddhah 6.1.86 play a major role in the ordering of the sktras and provide a model which can be best described with privacy of data spaces. For conflict resolution, we use two criteria: utsarga-apavāda relation between sūtras, and the word integrity principle. However, this needs further revision. The implementation is still in progress. The current implementation of inflectional morphology to derive a speech form is discussed in detail.
Lyapunov-Based Nonlinear Output Feedback Control of a Flexible Link
Authors: H. Bolandi, S. M. Esmaeilzadeh
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

In this paper, to cope with highly nonlinear behavior of a flexible link robot dynamic a Lyapunov based nonlinear output feedback control strategy directly based on tip position and strain gauge measurements is investigated. Effectiveness and performance of the controller in vibration suppressing and fast motion duration tracking capability is shown through simulation
Note: On the size of identifying codes in binary hypercubes
Authors: Svante Janson, Tero Laihonen
Venue: Journal of Combinatorial Theory Series A (2009)

In this paper, we consider identifying codes in binary Hamming spaces F^n, i.e., in binary hypercubes. The concept of (r,=~1nlog"2M"r^(^==1 when @r@?[0,1/2). We also show that M"r^(^=
Evaluating existing audio CAPTCHAs and an interface optimized for non-visual use
Authors: Jeffrey P. Bigham, Anna C. Cavender
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Audio CAPTCHAs were introduced as an accessible alternative for those unable to use the more common visual CAPTCHAs, but anecdotal accounts have suggested that they may be more difficult to solve. This paper demonstrates in a large study of more than 150 participants that existing audio CAPTCHAs are clearly more difficult and time-consuming to complete as compared to visual CAPTCHAs for both blind and sighted users. In order to address this concern, we developed and evaluated a new interface for solving CAPTCHAs optimized for non-visual use that can be added in-place to existing audio CAPTCHAs. In a subsequent study, the optimized interface increased the success rate of blind participants by 59% on audio CAPTCHAs, illustrating a broadly applicable principle of accessible design: the most usable audio interfaces are often not direct translations of existing visual interfaces.