ppxscal/embedding_network huggingface dataset:
Detecting Masqueraders Using High Frequency Commands as Signatures
Authors: Ming Dong Wan, Han-Ching Wu, Ying-Wei Kuo, James Marshall, Shou-Hsuan Stephen Huang
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Network intruders commonly use stolen passwords or other means to log into legitimate users’ computer accounts. To prevent this from happening, it is important that we are able to distinguish a user as a true user or a masquerader. Uniqueness of user command has been used in the past as signature of users. This project explores the high frequency commands to see if they work well as signatures. Experimental result was provided to show that they work as well as the Uniqueness method. Besides, the comparisons with other methods were also presented.
FPGA realization of a smart processing system for clinical diagnostic applications using pipelined datapath architectures
Authors: Shubhajit Roy Chowdhury, Dipankar Chakrabarti, Hiranmay Saha
Venue: Microprocessors Microsystems (2008)

The paper describes the implementation of a novel smart data processing hardware system having medical diagnostic capabilities. The system is implemented in a FPGA chip for fast design cycle. The system employs a smart agent that can predict the future pathophysiological state of a patient using the past pathophysiological data and can thus predict the approaching critical condition of the patient before criticality actually occurs. This feature has been realized using fuzzy logic. In order to speed up the computation process, pipelined data processing architectures have been employed leading to a speed up of approximately three times. The whole system is realized on Altera Cyclone EP1K6Q240C8 FPGA chip requiring 5308 logic blocks. The system has been designed to be inexpensive, portable and user friendly for rural applications in developing countries.
Simulation of the Impact of the Plough Body Parameters, Soil Properties and Working Modes on the Ploughing Resistance
Authors: Adolfs Rucins, Arvids Vilde
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

A computer algorithm has been worked out for the simulation of the operation of the plough body, the forces exerted by soil upon the operating parts and simulation of the impact of the plough body parameters, soil properties and working modes on the ploughing resistance. The main parameters of the plough body that determine the ploughing efficiency are the initial and the final lifting angles of the soil slice on the share-mouldboard surface, the angle of its horizontal generatrix, the radius of this surface and the working width of the body. From the soil properties, the greatest influence upon the draft resistance is exerted by soil hardness, density and slip resistance. The ploughing resistance depends also on the working speed and the aggregation mode with tractors. Such a way of simulation allows the assessment of the share of each partial resistance in the total resistance of the plough body and obtaining its optimal parameters for cost-efficient ploughing.
Sensing-based interaction for information navigation on handheld displays
Authors: Michael Rohs, Georg Essl
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

Information navigation on handheld displays is characterized by the small display dimensions and limited input capabilities of today's mobile devices. Special strategies are required to help users navigate to off-screen content and develop awareness of spatial layouts despite the small display. On the other hand, handheld devices offer interaction possibilities that desktop computers do not. Handheld devices can easily be moved in space and used as a movable window into a large virtual workspace. We investigate different information navigation methods for small-scale handheld displays using a range of sensor technologies for spatial tracking. We compare user performance in an map navigation task and discuss the tradeoffs of the different sensor and visualization techniques.
An approach to mobility management in Cellular IP networks utilising power-save mode of IEEE 802.11
Authors: Joungwoong Lee, Shigetomo Kimura, Yoshihiko Ebihara
Venue: International Journal of Ad Hoc and Ubiquitous Computing (2008)

Although FMIPv6, HMIPv6, and F-HMIPv6 have been proposed as enhancements to Mobile IPv6, they still have some technical barriers for fast and seamless handovers. We propose an intelligent mobility protocol benefiting from Cellular IP. To speed up the entire handover procedure, our proposed scheme enables L2 and L3 handovers to be performed in parallel by utilising power-save mode of IEEE 802.11. We provide analytical considerations on the handover latency and packet delivery cost of each protocol. Through our simulation experimental results, we have verified that our proposed scheme shows much better performance over the others under various parameter sets.
The role of a Data Grid in worldwide imaging-based clinical trials
Authors: Z. Zhou, M. Gutierrez, J. Documet, L. Chan, H. K. Huang, B. Liu
Venue: Journal of High Speed Networks (2007)

Clinical trials play a crucial role in testing new drugs or devices in modern clinical practice. Medical imaging has become an important tool in clinical trials because images provide a unique and fast diagnosis with visual observance and quantitative assessment. A typical imaging-based clinical trial consists of: (1) A well-defined rigorous clinical trial protocol, (2) a radiology core that has a quality control mechanism, a biostatistics component, and a server for storing and distributing data and analysis results; and (3) many field sites that generate and send clinical trial image studies to the radiology core. With ever-increasing number of clinical trials, it becomes a great challenge for a radiology core which handles multiple clinical trials to have a robust server to administrate multiple trials as well as satisfy the requirements to quickly distribute information to participating radiologists/clinicians worldwide to assess trials' results. Data Grid in the grid computing technology can satisfy the aforementioned requirements of imaging-based clinical trials. In this paper, we present a Data Grid architecture for worldwide imaging-based clinical trials. The Data Grid testbed has been set up in three international sites: Image Processing and Informatics (IPI) Laboratory at University of Southern California, USA; the Hong Kong Polytechnic University; and InCor (Heart Institute) at Sao Paulo, Brazil. The three chosen sites are connected with high speed international networks including the Internet2, the HARNET (Hong Kong Academic and Research Network), and the Brazilian National Research and Education Network (RNP2). The concept, design and implementation of the Data Grid are presented. Grid computing technology open source software Globus Toolkit 4.0 and DICOM technology were used to implement the DICOM compliance Data Grid. This paper also describes results of using Data Grid in imaging-based clinical trails for fault tolerance image data backup. The successful implementation and evaluation of the Data Grid for imaging-based clinical trials provide three major benefits: (1) an understanding of the methodology for using data grid technology and high speed networks in clinical trails; (2) an establishment of the performance benchmarks of Data Grid over high speed networks; and (3) a Data Grid test bed for performing worldwide imaging based clinical trials.
Investigating the Impact of Fill Metal on Crosstalk-Induced Delay and Noise
Authors: Arthur Nieuwoudt, Jamil Kawa, Yehia Massoud
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

In this paper, we investigate the crosstalk-induced delay and noise implications of floating and grounded fill metal generated using each of the rule-based and model-based fill placement techniques. We first examine the impact of fill metal on several interconnect test structures, which provide important insights into the performance and reliability implications of both intra-layer and inter-layer crosstalk coupling due to dummy fill. We then explore the noise and delay implications of fill metal on several large-scale designs implemented in 65 nm process technology. For the grounded fill cases, the fill metal significantly reduces crosstalk-induced delay and noise. Designs with floating fill also experience a reduction in average crosstalk-induced delay and noise, which is in contrast to the predictions of previous studies on small-scale interconnect structures.
Weinberg bounds over nonspherical graphs
Authors: Beifang Chen, Jin Ho Kwak, Serge Lawrencenko
Venue: Journal of Graph Theory (2000)

Let Aut(G) and E(G) denote the automorphism group and the edge set of a graph G, respectively. Weinberg's Theorem states that 4 is a constant sharp upper bound on the ratio |Aut(G)|-|E(G)| over planar (or spherical) 3-connected graphs G. We have obtained various analogues of this theorem for nonspherical graphs, introducing two Weinberg-type bounds for an arbitrary closed surface &Sigma;, namely: $W_{P}(\Sigma)\hbox{ and } W_{T}(\Sigma) {\buildrel{\rm def}\over{=}} {\sup \atop{\rm G}}|\hbox{Aut}(G)|/|E(G)|,$ where supremum is taken over the polyhedral graphs G with respect to &Sigma; for WP(&Sigma;) and over the graphs G triangulating &Sigma; for WT(&Sigma;). We have proved that Weinberg bounds are finite for any surface; in particular: WP = WT = 48 for the projective plane, and WT = 240 for the torus. We have also proved that the original Weinberg bound of 4 holds over the graphs G triangulating the projective plane with at least 8 vertices and, in general, for the graphs of sufficiently large order triangulating a fixed closed surface &Sigma;. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 33: 220&ndash;236, 2000
An RDF Query Language based on Logic Programming
Authors: Jesús M. Almendros-Jiménez
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

In this paper we investigate an extension of XQuery for querying (and inferring) from RDF documents. Following a graph based approach for specifying queries against RDF, XQuery is extended with construction of answers and boolean predicates for RDF entailment relationship inference. We will also study how to implement it in logic programming by using logic rules for executing RDF/XQuery queries.
Hierarchical Modelling of Data Inherent Structures Using Networks of Fuzzy Classifiers
Authors: Arne-Jens Hempel, Steffen F. Bocklisch
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

This work is dedicated to a network oriented modelling approach based on the interconnection of multivariate Fuzzy Pattern Classifier nodes. The main point is the elaboration of a data driven and hierarchical design strategy for such fuzzy classifier network models. In detail two essential issues will be dealt with: the automatic layout of the network and the configuration of the classifier nodes. Both issues are addressed using a multiple cluster analysis approach. Finally the network design and operation ARE illustrated within the scope of an practical example.
A Stable Broadcast Algorithm
Authors: Kei Takahashi, Hideo Saito, Takeshi Shibata, Kenjiro Taura
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

Distributing large data to many nodes, known as a broadcast or a multicast, is an important operation in parallel and distributed computing. Most previous broadcast algorithms explicitly or implicitly try to deliver data to all nodes in the same rate. This assumption is reasonable for homogeneous environments where all nodes have similar receiving capabilities. However, when nodes have various receiving capabilities, nodes with slow-receiving capabilities slow down the entire receiving bandwidth in these algorithms. In such settings, each node desires to receive data at its largest possible bandwidth and to start computation as soon as it receives the data. In this paper, we propose to say a broadcast is stable when the bandwidth to a node is never sacrificed by the presence of other, possibly slow, receiving nodes, and proposes the stability as a desired property of broadcast algorithms. In addition, we show a simple and efficient stable broadcast when the topology among nodes is a tree and each link has a symmetric bandwidth. This work improves upon previously proposed algorithms such as FPFR and Balanced Multicasting. For general graphs, it outperforms them when the network is heterogeneous and for trees, our algorithm is proved to be stable and optimal. In a real environment with 100 machines in 4 clusters, our scheme achieved 2.1 to 2.6 times aggregate bandwidth compared to the best result in the other algorithms. We also demonstrated the stability by adding a slow node to a broadcast. Some simulations also showed that our algorithm also performs well in many bandwidth distributions.
Architectures for the Implementation of a OFDM-WLAN Viterbi Decoder
Authors: F. Angarita, M. J. Canet, T. Sansaloni, J. Valls, V. Almenar
Venue: Journal of Signal Processing Systems (2008)

This paper describes the design of a soft decision Viterbi Decoder for orthogonal frequency division multiplexing-based wireless local area networks and evaluates different architectural options by means of their field programmable gate-array (FPGA) implementation. A finite precision analysis has been performed to reduce the data-path widths under the specifications of IEEE 802.11a and Hiperlan/2 standards. Four implementation strategies (register exchange, trace back, trace back with double rate memory read and pointer trace back) for the survivor management unit have been evaluated together with two different normalization methods for the add---compare---select unit. The results of the implementation in FPGA have been given and it is shown that register exchange and pointer trace back architectures with pre-normalization in the add---compare---select unit achieve the best performance. Both architectures can decode 200 Mbps in a Virtex-4 device with lower latency that the conventional trace back one and pointer trace back exhibits the lowest power consumption, these characteristics make them suitable for future multiple-output multiple-input WLAN systems.
Protection of technological measures: juridical definition of a technical tool
Authors: Lígia Lopes de Sousa Carreto
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

The present work aims to bring to discussion and to analysis, the texts of the 6th article of the 2001/29/EC Directive (22nd of May) and the 217th article of the Portuguese law 50/2004 (24th of August) that talk about protection of technological measures designed to prevent or restrict acts, in respect of works or other subject-matter, which are not authorised by the rightholder of any copyright or any right related to copyright as provided for by law or the sui generis right. These texts have many technical terms that describe technical tolls of Computer Engineering. However, in our modest opinion, these technical terms do not facilitate at all the interpretation of the law, since it is necessary to enter a technical universe of a specific science very distant from the Law Science. Furthermore, we believe that the laws are made to be understood beyond the jurists, that is, by laypeople, and we believe that it is impossible to jurists to legislate about rights in the Information Society without the correspondent partnership between them and the computer scientists and technicians. We analyse the technical definitions in use, and serve ourselves of the juridical hermeneutic to interpret the legal texts. To conclude, we point out our certainties and uncertainties that we expect will be object of debate.
Preconditioned temporal difference learning
Authors: Hengshuai Yao, Zhi-Qiang Liu
Venue: Proceedings of the 25th international conference on Machine learning (2008)

This paper extends many of the recent popular policy evaluation algorithms to a generalized framework that includes least-squares temporal difference (LSTD) learning, least-squares policy evaluation (LSPE) and a variant of incremental LSTD (iLSTD). The basis of this extension is a preconditioning technique that solves a stochastic model equation. This paper also studies three significant issues of the new framework: it presents a new rule of step-size that can be computed online, provides an iterative way to apply preconditioning, and reduces the complexity of related algorithms to near that of temporal difference (TD) learning.
Modeling Disruption Tolerant Networks with Random Geographical Barriers
Authors: Rotimi Iziduh, Lucky Adike, Alicia Nicki Washington
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

In recent years, the need for increased connectivity has extended from urbanized areas to locations previously unreachable via standard telecommunication networks. As a result, packet transmission occurs in a store-and-forward fashion, where nodes relay packets to neighboring nodes as they come in contact with each other, until the packet ultimately reaches its destination. In this paper, we focus on the existence of geographical barriers in the physical network and the performance effects these barriers place on the network. We determine that a threshold exists for which the delay not only peaks, but begins to decrease from this point on.
Fault Tolerance in Cluster Federations with O2P-CF
Authors: Thomas Ropars, Christine Morin
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

Fault tolerance is one of the key issues for large scale applications executed on high performance computing systems. In a cluster federation, clusters are gathered to provide huge computing power. To work efficiently on such systems, networks characteristics have to be taken into account: the latency between two nodes of different clusters is much higher than the latency between two nodes of the same cluster. In this paper, we present O2P-CF a message logging protocol well-suited to provide fault tolerance for message passing applications executed on cluster federations. O2P-CF is based on the combination of O2P, an extremely optimistic message logging protocol, with a pessimistic message logging protocol.
Stamp deformation and its influence on residual layer homogeneity in thermal nanoimprint lithography
Authors: S. Merino, A. Retolaza, H. Schift, V. Trabadelo
Venue: Microelectronic Engineering (2008)

In thermal nanoimprint lithography (NIL), one of the key points to be addressed is the printing uniformity on large areas. During the process, the silicon stamp undergoes significant mechanical stress, function of different parameters and appear under the concurrent influence of both the applied pressure on the backside of the stamp and an opposite force due to the polymer viscoelastic behaviour. It leads to non-negligible deformations within patterned or unpatterned areas, which translates into non uniformity of the printing, stamp pattern break and degradation of the polymer surface. This work studies the relation between the residual layer thickness (RLT) and the patterned area size, fill factor (FF) and stamp thickness (ST) for stamps made in silicon. Important and different variations in the homogeneity of the residual layer are obtained in comparison with the values predicted by the theory. This will help to optimize stamp designs and choose appropriate process setups and parameters for nanoimprint with improved pattern transfer capability.
Designing and Engineering Time: The Psychology of Time Perception in Software, 1 edition
Authors: Steven C. Seow
Venue:  (2008)

Build Applications, Websites, and Software Solutions that Feel Faster, More Efficient, and More Considerate of Users Time! One hidden factor powerfully influences the way users react to your software, hardware, User Interfaces (UI), or web applications: how those systems utilize users time. Now, drawing on the nearly 40 years of human computer interaction researchincluding his own pioneering workDr. Steven Seow presents state-of-the-art best practices for reflecting users subjective perceptions of time in your applications and hardware. Seow begins by introducing a simple model that explains how users perceive and expend time as they interact with technology. He offers specific guidance and recommendations related to several key aspects of time and timingincluding user tolerance, system responsiveness, progress indicators, completion time estimates, and more. Finally, he brings together proven techniques for impacting users perception of time drawn from multiple disciplines and industries, ranging from psychology to retail, animal research to entertainment. Discover how time and timing powerfully impact user perception, emotions, and behavior Systematically make your applications more considerate of users time Avoid common mistakes that consistently frustrate or infuriate users Manage user perceptions and tolerance, and build systems that are perceived as faster Optimize flow to make users feel more productive, empowered, and creative Make reasonable and informed tradeoffs that maximize limited development resources Learn how to test usability issues related to timeincluding actual vs. perceived task duration Designing and Engineering Time is for every technology developer, designer, engineer, architect, usability specialist, manager, and marketer. Using its insights and techniques, technical and non-technical professionals can work together to build systems and applications that provide far more valueand create much happier users. Steven C. Seow has a unique combination of experience in both experimental psychology and software usability. He joined Microsoft as a User Researcher after completing his Ph.D. in Experimental Psychology at Brown University with a research focus on human timing and information theory models of human performance. Seow holds Bachelors and Masters Degrees in Forensic Psychology from John Jay College of Criminal Justice, and wrote his masters thesis on distortions in time perception. For more information about Steven Seow and his research, visit his website at www.StevenSeow.com. informit.com/aw
Handwritten Digits Recognition Using Particle Swarm Optimization
Authors: Nasser Omer Sahel Ba-Karait, Siti Mariyam Shamsuddin
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

As humans, it is easy to recognize numbers, letters, voices, and objects, to name a few. However, making a machine solve these types of problems is a very difficult task. Handwritten digits recognition (HDR) is considered as one of difficult problems in the field of pattern recognition. Hence, evaluating a performance of other algorithms on HDR problem is of great importance. In this study, Particle Swarm Optimization (PSO) based method is exploited to recognize unconstrained handwritten digits. Each class is encoded as a centroid in multidimensional feature space and PSO is employed to probe the optimal position for each centroid. The algorithm evaluates on 5 folds cross validation of handwritten digits data, and the results reveal that PSO gives promising performance and stable behavior in recognizing these digits.