ppxscal/embedding_network huggingface dataset:
Thinking about Technology
Authors: Richard Mateosian
Venue: IEEE Micro (2007)

The columnist reviews Devices of the Soul by Steve Talbott (O'Reilly, 2007). Since 1995, Talbott has edited an online newsletter, NetFuture: Technology and Human Responsibility (http://www.netfuture.org). This book, which includes material first published in the newsletter, interweaves many themes that reinforce one basic message: Talbott believes that we are not analyzing and mitigating against the risks of technology. We are letting the repeated assurances of progress through technology lull us into self-forgetfulness.
Dynamic tag reduction for low-power caches in embedded systems with virtual memory
Authors: Peter Petrov, Alex Orailoglu
Venue: International Journal of Parallel Programming (2007)

This paper presents a low-power tag organization for physically tagged caches in embedded processors with virtual memory support. An exceedingly small subset of tag bits is identified for each application hot-spot so that only these tag bits are used for cache access with no performance sacrifice as they provide complete address resolution. The minimal subset of physical tag bits is dynamically updated following the changes in the physical address space of the application. Operating system support is introduced in order to maintain the reduced tags during program execution. Efficient algorithms are incorporated within the memory allocator and the dynamic linker in order to achieve dynamic update of the reduced tags. The only hardware support needed within the I/D-caches is the support for disabling bitlines of the tag arrays. An extensive set of experimental results demonstrates the efficacy of the proposed approach.
Help-A Computer System for Medical Decision Making
Authors: T. A. Pryor
Venue: Computer (1975)

The medical record is maintained for the express purpose of enabling the physician to deliver better care to the patient. But its usefulness in achieving that purpose has often been hampered by its inflation with voluminous, unorganized notes, and test results. The medical profession has begun to recognize this, and work has recently been done in reviewing the structure of the medical record with hopes of making improvements.1 Based on what has been learned so far, it appears that the most effective record is one containing a broad data base including many investigative procedures, while at the same time focusing the physician's attention on problems or diagnoses derived from the data base.2 These problems express only the essential information derived from the data base-that information which forms the basis for the treatment regimen.
DFM/DFY practices during physical designs for timing, signal integrity, and power
Authors: Shi-Hao Chen, Ke-Cheng Chu, Jiing-Yuan Lin, Cheng-Hong Tsai
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

We present our experience of DFM (design for manufacturability) and DFY (design for yield) considerations on physical designs at 0.13 mum and below technology nodes. The impact of some DFM approaches on timing and signal integrity are addressed. We also present our experience of yield analysis and improvement for the designs with process variation and dynamic IR drop issues.
An optimal scheduling of cells in ATM switch using neural network
Authors: Mohamed L. Hambaba, Wook-Jin Jang
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1999)

In asynchronous transfer mode (ATM), the traffic cells from various information sources are statistically multiplexed at the physical layer to efficiently utilize the network resources. An ATM switching node must successfully route the many arriving traffic cells to the correct output without collisions of cells in the switch fabrics while sustaining the user-required quality of services (QoS) for all application. For scheduling of cells in a switch, neural networks are noted for their ability to process large amounts of data quickly using a copious number of highly interconnected processors. In this paper, we propose an optimal cell scheduling algorithm for ATM switch using Hopfield neural network. The proposed algorithm finds a set of nonblocking cells with the ideal energy functions for Hopfield neural networks and efficiently minimizes the cell-delay time using a delay matrix scheme. Every cell transmission time, the algorithm gives the optimal scheduling which minimizes cell-loss and cell-delay time in buffer, and also solves the cell blocking and cell-sequence problems.
Build shape-shifting tries for fast IP lookup in O(n) time
Authors: Mian Pan, Haibin Lu
Venue: Computer Communications (2007)

Most data structures for packet forwarding are optimized for IPv4, and less capable of handling IPv6 routing tables. Shape-Shifting Trie (SST) is specifically designed to be scalable to IPv6. To reduce the worst-case lookup time that is proportional to the height of SST, it is desirable to construct a minimum-height SST. Breadth-First Pruning (BFP) algorithm takes O(n^2) time to construct a minimum-height SST, where n is the number of nodes in the binary trie corresponding to the routing table. In this paper, we propose a Post-Order Minimum-Height Pruning (POMHP) algorithm that takes only O(n) time to construct a minimum-height SST. We further propose nodes merging algorithm to cut down SST size without affecting SST height.
Identification of Non-Black Inks Using HSV Colour Space
Authors: H. Dasari, C. Bhagvati
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

An important problem in questioned document examina- tion is detection of alterations done by inserting words or additional lines of text. In this paper, we present a statistical pattern recognition driven approach that views it as a two- class problem. Given two sample words, one of which is a suspected alteration, it is necessary to determine if the two belong to the same class or different classes. Our approach is defined in two stages. We start with a 11-dimensional vector that comprises colour features defined in HSV space and texture features. During the training phase, we de- rive within-class and between-class L1 distance distribu- tions and identify an optimal threshold that minimizes Type I and Type II errors. During the second or test phase, we take a pair of unkown samples and use the threshold value obtained from the training phase to decide if the two belong to the same class or distinct classes. Our experimental re- sults involving more than 95000 pairs of word images show that the approach gives an accuracy of over 90% for gel and roller pens and an accuracy of 85% for ball pen writings.
Measuring high-speed TCP performance during mobile handovers
Authors: Gabor Nemeth, Peter Tarjan, Gergely Biczok, Ferenc Kubinszky, Andras Veres
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

We analyse throughput adaptation of high-speed TCP protocols during handovers in an emulation testbed. We use emulation characteristics reflecting current mobile networks and future network specifications as set by the relevant standards. We found that the performance of TCP protocols is satisfactory, except as follows. Traditional loss-based TCP-s like BIC, HighSpeed and Scalable adapt slowly to sudden link capacity increases caused by handovers. FAST TCP adapts much faster, however depending on parameter settings it may under-utilise after a capacity decrease coupled with RTT increase. We also calculate the probability of buffer overflows at handover as the function of the buffer size and transmission parameters at the bottleneck link. This probability turns out to be significant for reasonable scenarios, and we suggest a dynamic buffer re-allocation method to eliminate such buffer overruns in mobile networks.
Inferring functional brain states using temporal evolution of regularized classifiers
Authors: Andrey Zhdanov, Talma Hendler, Leslie Ungerleider, Nathan Intrator
Venue: Computational Intelligence and Neuroscience (2007)

We present a framework for inferring functional brain state from electrophysiological (MEG or EEG) brain signals. Our approach is adapted to the needs of functional brain imaging rather than EEG-based brain-computer interface (BCI). This choice leads to a different set of requirements, in particular to the demand for more robust inference methods and more sophisticated model validation techniques. We approach the problem from a machine learning perspective, by constructing a classifier from a set of labeled signal examples. We propose a framework that focuses on temporal evolution of regularized classifiers, with cross-validation for optimal regularization parameter at each time frame. We demonstrate the inference obtained by this method on MEG data recorded from 10 subjects in a simple visual classification experiment, and provide comparison to the classical nonregularized approach.
On dominating your neighborhood profitably
Authors: Cuiping Li, Anthony K. H. Tung, Wen Jin, Martin Ester
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Recent research on skyline queries has attracted much interest in the database and data mining community. Given a database, an object belongs to the skyline if it cannot be dominated with respect to the given attributes by any other database object. Current methods have only considered so-called min/max attributes like price and quality which a user wants to minimize or maximize. However, objects can also have spatial attributes like x, y coordinates which can be used to represent relevant constraints on the query results. In this paper, we introduce novel skyline query types taking into account not only min/max attributes but also spatial attributes and the relationships between these different attribute types. Such queries support a micro-economic approach to decision making, considering not only the quality but also the cost of solutions. We investigate two alternative approaches for efficient query processing, a symmetrical one based on off-the-shelf index structures, and an asymmetrical one based on index structures with special purpose extensions. Our experimental evaluation using a real dataset and various synthetic datasets demonstrates that the new query types are indeed meaningful and the proposed algorithms are efficient and scalable.
Design of Reliable Synchronous Sequential Circuits
Authors: D. H. Sawin
Venue: IEEE Transactions on Computers (1975)

Fail-safe synchronous sequential machines produce safeside outputs when failures occur within the machine. This correspondence presents a procedure to design such machines using a modification of the on-set equation form originally presented by Tohma et al. [1] and later improved by Diaz et al. [2]. A systematic procedure for state assignment and next-state equation derivation, using partition theory, is presented. From this method an easily calculated upper bound on the number of gates required-to realize a fail-safe circuit is derived.
A Distributed Scheduling Approach for Ethernet-based Passive Optical Networks
Authors: Marilet De Andrade, Lluis Gutierrez, Sebastia Sallent
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Ethernet-based Passive Optical Networks (EPON) are being considered as the best candidates for the next generation broadband access networks. Several algorithms for dynamic bandwidth allocation in EPON have been proposed, as this is an open issue that was left out of the scope of the standard IEEE 802.3ah. Very few of those works address the possibilities for an on-the-fly (immediate) distributed scheduling method. In this paper we propose and simulate a distributed scheduling method where the user devices perform most of the dynamic distribution process. The results show an important improvement in terms of delay and queue size for high network loads.
Levels of Authentication Assurance: an Investigation
Authors: Aleksandra Nenadic, Ning Zhang, Li Yao, Terry Morrow
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

The ES-LoA project, funded by the UK Joint Information Systems Committee (JISC) under its e- Infrastructure Security Programme, investigates current and future needs among UK research and education community for a more fine-grained authorisation scheme that would allow service providers to take into account of the levels of confidence in identifying a remote entity requesting for service access. Such a fine-grained authorisation scheme is attractive to service providers offering resources with varying levels of sensitivity and/or wishing to tailor their security protections based upon risk levels. Service providers may wish to restrict access to more sensitive resources only to those who have gone through a more stringent authentication process, or given the same remote entity, require the use of a stronger authentication token should the access request come from a more risky environment. In this way, the quality of an authentication instance, expressed as an authentication Level of Assurance (LoA), becomes one of the parameters used in access control decision making. This paper investigates the current worldwide efforts in defining LoA and identifies gaps in existing definitions when they are applied to a federated environment.
Robustness of transmultiplexed images
Authors: Przemysław Sypka, Mariusz Ziółko
Venue: VLSI Design (2007)

Transmultiplexation changes the parallel transmission into a serial transmission. Integer-to-integer filters ensure the perfect reconstruction. The paper presents a suitable serialization method which improves the robustness of images transmitted by a trans-multiplexer system. The solution is based on blocks of sizes adequate to separation filter orders, used in detransmultiplexation. The proposed method results directly from the detransmultiplexation algorithm. An example of a four-channel transmultiplexer system, equipped with integer filters, is presented and analyzed to illustrate the suggested method. A simple and effective filter design method is also presented.
New Products
Venue: Computer (1977)

Bipolar emulation of the Intel 8080A microcomputer system is now possible with an emulator kit from Signetics. The kit is a microprogrammed microprocessor using Schottky LSI components to implement the 8080A emulation at speeds that allow expansion of existing 8080A-based systems with no change in software. According to Signetics, the emulator provides a 150 nsec microinstruction cycle time and a 150 nsec RAM access time. 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
XSS Application Worms: New Internet Infestation and Optimized Protective Measures
Authors: Jayamsakthi Shanmugam, M. Ponnavaikko
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

There has been considerable increase in Application layer attacks in the recent years. Research surveys show that the cross site scripting (XSS) attack is most common among all the application layer attacks. Ajax web technology, by design makes number of calls to the web server to process a user request. This increases the bandwidth usage and response time due increase in the number of calls to the web server. If security mechanisms are implemented to protect the application, then the server performance will suffer due to the additional processing required thereby resulting in increased response time. If security mechanisms are implemented to protect the application, then the server performance will suffer due to the increased response time because of the increase in number of requests. This problem demands an efficient approach to protect the web application from XSS attacks and to block the malicious attempts from reaching the web application. This paper presents a thread based solution for efficient process utilization of the web server and to prevent XSS threats. The proposed solution has been tested using Java/JSP on JBOSS server on around 2000 vulnerable XSS input collected from various research sites, white hat and black hat sites. The model is also tested with the combination of non vulnerable input and vulnerable input to assess the performance. The approach is found to be effective compared to the earlier research works.
Bayesian Quadratic Discriminant Analysis
Authors: Santosh Srivastava, Maya R. Gupta, Béla A. Frigyik
Venue: The Journal of Machine Learning Research (2007)

Quadratic discriminant analysis is a common tool for classification, but estimation of the Gaussian parameters can be ill-posed. This paper contains theoretical and algorithmic contributions to Bayesian estimation for quadratic discriminant analysis. A distribution-based Bayesian classifier is derived using information geometry. Using a calculus of variations approach to define a functional Bregman divergence for distributions, it is shown that the Bayesian distribution-based classifier that minimizes the expected Bregman divergence of each class conditional distribution also minimizes the expected misclassification cost. A series approximation is used to relate regularized discriminant analysis to Bayesian discriminant analysis. A new Bayesian quadratic discriminant analysis classifier is proposed where the prior is defined using a coarse estimate of the covariance based on the training data; this classifier is termed BDA7. Results on benchmark data sets and simulations show that BDA7 performance is competitive with, and in some cases significantly better than, regularized quadratic discriminant analysis and the cross-validated Bayesian quadratic discriminant analysis classifier Quadratic Bayes.
Using Random Forests for Handwritten Digit Recognition
Authors: S. Bernard, S. Adam, L. Heutte
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

In the Pattern Recognition field, growing interest has been shown in recent years for Multiple Classifier Systems and particularly for Bagging, Boosting and Random Sub- spaces. Those methods aim at inducing an ensemble of classifiers by producing diversity at different levels. Fol- lowing this principle, Breiman has introduced in 2001 an- other family of methods called Random Forest. Our work aims at studying those methods in a strictly pragmatic ap- proach, in order to provide rules on parameter settings for practitioners. For that purpose we have experimented the Forest-RI algorithm, considered as the Random Forest ref- erence method, on the MNIST handwritten digits database. In this paper, we describe Random Forest principles and re- view some methods proposed in the literature. We present next our experimental protocol and results. We finally draw some conclusions on Random Forest global behavior ac- cording to their parameter tuning.
Instrumenting Programs for Symbolic-Trace Generation
Authors: J. C. Huang
Venue: Computer (1980)

Symbolic traces increase error-detection capabilities of program tests and indicate the extent of their coverage. This instrumentation system generates traces automatically upon program execution.
Fingerprint scanner focusing estimation by Top Sharpening Index
Authors: Matteo Ferrara, Annalisa Franco, Davide Maltoni
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

The Top Sharpening Index (TSI) is a measure proposed to simply evaluate fingerprint image focusing. In fact, though precise guidelines have been given by NIST and FBI for the evaluation of fingerprint scanners for AFIS applications, no simple and practical techniques have yet been proposed for non-AFIS environments. TSI is based on the measurement of the steepness of the ridge/valley transitions of the fingerprint impressions. In this work a deep analysis of TSI is carried out and its relation to two well known quality indicators (MTF e IQM) is investigated to highlight analogies and differences.
A Design Language Based Approach to Test Sequence Generation
Authors: F. J. Hill
Venue: Computer (1977)

There are two important advantages inherent in test sequence generation based on a design language description:
Tutorial Series 3 Perspectives on Dedicated and Control Processing
Authors: C. H. House
Venue: Computer (1980)

Progress in electronic hardware alone will not ensure success in measurement and control of nonelectronic processes. Nevertheless, the future for stored program controllers has never seemed brighter. 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
Study on Representation of Time Series Based on Subsection Polynomial Fitting
Authors: Daqi Li, Junyi Shen, Jianfeng Xie
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

This paper studied the representation of time series. The signal and the noise separated by wavelet analysis, the whole data sampling was divided into many continuous intervals, in which the signal was monotone. Each interval was fitted by n-degree polynomial and its eigenvector was made up of the coefficients of the polynomial, its width and Signal Noise Ratio (SNR). The eigenvectors of continuous intervals constituted an eigenvector sequence, which could represent the whole sampling. We analyzed respiratory intensity slice of Chinese astronaut, built the eigenvector sequence and finally found the similar intervals by means of cosine distance of eigenvectors.
Latent semantic fusion model for image retrieval and annotation
Authors: Trong-Ton Pham, Nicolas Eric Maillot, Joo-Hwee Lim, Jean-Pierre Chevallet
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

This paper studies the effect of Latent Semantic Analysis (LSA) on two different tasks: multimedia document retrieval (MDR) and automatic image annotation (AIA). The contributions of this paper are twofold. First, to the best of our knowledge, this work is the first study of the influence of LSA on the retrieval of a significant number of multimedia documents (i.e. collection of 20000 tourist images). Second, it shows how different image representations (region-based and keypoint-based) can be combined by LSA to improve automatic image annotation. The document collections used for these experiments are the Corel photo collection and ImageCLEF 2006 collection.
Collaborative Legal Information Sharing on P2P Network
Authors: Yanchun Zhang, Hao Shi, Xin Wang, Jingyuan Zhang
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Peer-to-Peer (P2P) information sharing attracts much attention from both legal and IT communities. P2P architectures have the potential to accelerate communication processes and reduce collaboration costs. A prototype, named vuCRN has been developed for researchers to facilitate document sharing legally. However, some legal issues are preventing P2P to realise its real power. In this paper, the design processes of our P2P-based collaborative legal information sharing system are introduced. First P2P information sharing architecture and legal issues are described. Then legal concerns and the next stage of the prototype vuCRN are analysed from ontological level, conceptual level and functional level respectively.
The numerical evaluation of two integral transforms
Authors: Giovanni Monegato, Antonio Strozzi
Venue: Journal of Computational and Applied Mathematics (2008)

We derive recurrence relationships for the evaluation of two integral transforms which are of interest for the numerical solution of some integral equations and for the construction of certain quadrature rules.