ppxscal/embedding_network huggingface dataset:
An authentication and Ballot layout attack against an optical scan voting terminal
Authors: Aggelos Kiayias, Laurent Michel, Alexander Russell, Narasimha Shashidhar, Andrew See, Alexander A. Shvartsman
Venue: Proceedings of the USENIX Workshop on Accurate Electronic Voting Technology (2007)

Recently, two e-voting technologies have been introduced and used extensively in election procedures: direct recording electronic (DRE) systems and optical scanners. The latter are typically deemed safer as many recent security reports have discovered substantial vulnerabilities in a variety of DRE systems. In this paper we present an attack against the Diebold Accuvote optical scan voting terminal (AV-OS). Previously known attacks direct to the AV-OS required physical access to the memory card and use of difficult to find hardware (card reader/writer). Our attack bypasses these issues by using the serial port of the AV-OS terminal and reverse engineering the communication protocol, in essence, using the terminal itself as a reader/writer. Our analysis is based solely on reverse-engineering. We demonstrate how an attacker can exploit the serious security vulnerability of weak (non-cryptographic) authentication properties of the terminal. The attack payload delivers a tampered ballot layout that, depending on the scenario, allows swapping of candidate votes, neutralizing votes, or even shifting votes from one candidate to another.
A buffer overflow benchmark for software model checkers
Authors: Kelvin Ku, Thomas E. Hart, Marsha Chechik, David Lie
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Software model checking based on abstraction-refinement has recently achieved widespread success in verifying API conformance in device drivers, and we believe this success can be replicated for the problem of buffer overflow detection. This paper presents a publicly-available benchmark suite to help guide and evaluate this research. The benchmark consists of 298 code fragments of varying complexity capturing 22 buffer overflow vulnerabilities in 12 open source applications. We give a preliminary evaluation of the benchmark using the SatAbs model checker
Elastic Matching of Online Handwritten Tamil and Telugu Scripts Using Local Features
Authors: L. Prasanth, V. Babu, R. Sharma, G. V. Rao, Dinesh M.
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

This paper describes character based elastic matching using local features for recognizing online handwritten data. Dynamic Time Warping (DTW) has been used with four different feature sets: x-y features, Shape Context (SC) and Tangent Angle (TA) features, Generalized Shape Context feature (GSC) and the fourth set containing x-y, normalized first and second derivatives and curvature features. Nearest neighborhood classifier with DTW distance was used as the classifier. In comparison, the SC and TA feature set was found to be the slowest and the fourth set was best among all in the recognition rate. The results have been compiled for the online handwritten Tamil and Telugu data. On Telugu data we obtained an accuracy of 90.6% with a speed of 0.166 symbols/sec. To increase the speed we have proposed a 2-stage recognition scheme using which we obtained accuracy of 89.77% but with a speed of 3.977 symbols/sec.
Looking Back
Authors: Richard Mateosian
Venue: IEEE Micro (2007)

The author looks back on 20 years of writing Micro Review. Recurring themes include microprocessors and computer architecture, Windows and its challengers, programmers and tools, usability and interaction design, project management, computers and consciousness, and globalization.
On the manipulability of the fuzzy social choice functions
Authors: Fouad Ben Abdelaziz, José Rui Figueira, Olfa Meddeb
Venue: Fuzzy Sets and Systems (2008)

In many social decision-making contexts, a manipulator has incentives to change the social choice in his favor by strategically misrepresenting his preference. Gibbard [Manipulation of voting schemes: a general result, Econometrica 41(4) (1973) 587-601] and Satterthwaite [Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions. J. Econom. Theory 10 (1975) 187-217] have shown that any non-dictatorial voting choice procedure is vulnerable to strategic manipulation. This paper extends their result to the case of fuzzy weak preference relations. For this purpose, the best alternative set is defined in three ways and consequently three generalizations of the Gibbard-Satterthwaite theorem to the fuzzy context are provided.
Bringing NoCs to 65 nm
Authors: Antonio Pullini, Federico Angiolini, Srinivasan Murali, David Atienza, Giovanni De Micheli, Luca Benini
Venue: IEEE Micro (2007)

Very deep submicron process technologies are ideal application fields for NoCs, which offer a promising solution to the scalability problem. This article sheds light on the benefits and challenges of NoC-based interconnect design in nanometer CMOS. The authors present experimental results from fully working 65-nm NoC designs and a detailed scalability analysis.
Decisions decisions plant vessels
Authors: Jenny Liang
Venue: Proceedings of the 2007 conference on Designing pleasurable products and interfaces (2007)

This paper describes concepts for a family of plant vessels that help users make decisions or reach goals. The concepts use plants to mark time or answer questions for the user, creating a connection between the user and the individual plant. These concepts seek to ultimately foster a connection between users and nature and raise awareness about nature's cycles. This paper describes the concepts and the process (including sketches) followed to derive these vessels.
The equation for response to selection and its use for prediction
Authors: Heinz Mühlenbein
Venue: Evolutionary Computation (1997)

The Breeder Genetic Algorithm (BGA) was designed according to the theories and methods used in the science of livestock breeding. The prediction of a breeding experiment is based on the response to selection (RS) equation. This equation relates the change in a population's fitness to the standard deviation of its fitness, as well as to the parameters selection intensity and realized heritability. In this paper the exact RS equation is derived for proportionate selection given an infinite population in linkage equilibrium. In linkage equilibrium the genotype frequencies are the product of the univariate marginal frequencies. The equation contains Fisher's fundamental theorem of natural selection as an approximation. The theorem shows that the response is approximately equal to the quotient of a quantity called additive genetic variance, VA, and the average fitness. We compare Mendelian two-parent recombination with gene-pool recombination, which belongs to a special class of genetic algorithms that we call univariate marginal distribution (UMD) algorithms. UMD algorithms keep the genotypes in linkage equilibrium. For UMD algorithms, an exact RS equation is proven that can be used for long-term prediction. Empirical and theoretical evidence is provided that indicates that Mendelian two-parent recombination is also mainly exploiting the additive genetic variance. We compute an exact RS equation for binary tournament selection. It shows that the two classical methods for estimating realized heritability---the regression heritability and the heritability in the narrow sense---may give poor estimates. Furthermore, realized heritability for binary tournament selection can be very different from that of proportionate selection. The paper ends with a short survey about methods that extend standard genetic algorithms and UMD algorithms by detecting interacting variables in nonlinear fitness functions and using this information to sample new points.
Design of Real-Time Embedded Music System
Authors: Sungmin Choi, Hoon Oh
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Embedded music software for music embedded system is designed and analyzed by applying the DARTS (Design Approach for Real-Time Systems) that appropriately deals with concurrent tasking architecture. The existing approaches for the music application have not considered a real-time multi-tasking model. So, it suffers from more complexity and less flexibility in design as well as lack of predictability for the timely execution of critical tasks. In this paper, we design a new concurrent tasking architecture for a real-time embedded music system and examine its feasibility, wherein all real-time tasks are examined for satisfying their respective constraints. The design is implemented on the Linux based Xhyper272 Board that uses the Intel Bulverde microprocessor.
Original paper: A vision based row detection system for sugar beet
Authors: Tijmen Bakker, Hendrik Wouters, Kees van Asselt, Jan Bontsema, Lie Tang, Joachim Müller, Gerrit van Straten
Venue: Computers and Electronics in Agriculture (2008)

One way of guiding autonomous vehicles through the field is using a vision based row detection system. A new approach for row recognition is presented which is based on grey-scale Hough transform on intelligently merged images resulting in a considerable improvement of the speed of image processing. A colour camera was used to obtain images from an experimental sugar beet field in a greenhouse. The colour images are transformed into grey scale images resulting in good contrast between plant material and soil background. Three different transformation methods were compared. The grey scale images are divided in three sections that are merged into one image, creating less data while still having information of three rows. It is shown that the algorithm is able to find the row at various growth stages. It does not make a difference which of the three colour to grey scale transformation methods is used. The mean error between the estimated and real crop row per measurement series varied from 5 to 198@?mm. The median error from the crop row detection was 22@?mm. The higher errors are mainly due to factors that do not occur in practice or that can be avoided, such as a limited number and a limited size of crop plants, overexposure of the camera, and the presence of green algae due to the use of a greenhouse. Inaccuracies created by footprints indicate that linear structures in the soil surface in a real field might create problems which should be considered in additional investigations. In two measurement series that did not suffer from these error sources, the algorithm was able to find the row with mean errors of 5 and 11@?mm with standard deviations of 6 and 11@?mm. The image processing time varied from 0.5 to 1.3@?s per image.
Hyperlink Classification: A New Approach to Improve PageRank
Authors: Li Cun-he, Lv Ke-qiang
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Hyperlink Structure is widely used in the hypertext classification, but it has not been paid enough attention. We propose a hyperlink classification approach to improve PageRank algorithm which is widely used in the link analysis of search engine. The cause of the topic drift problem is analyzed and the hyperlinks are classified according to their creating motivations and effects. The improved PageRank algorithm is implemented on the open source search engine NUTCH in Chinese Internet. The experimental results show that the improved PageRank algorithm performs better than the standard PageRank.
A Similar Resource Auto-Discovery Based Adaptive Fault-tolerance Method for Embedded Distributed System
Authors: Kailong Zhang, Ke Liang, Xingshe Zhou, Kaibo Wang, Xiao Wu, Zhiyi Yang
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

Because of the resource constraints and high reliability requirement of Embedded Distributed System (EDS), some new fault-tolerance means, which are different from the traditional hardwareredundancy ones, should be studied. In this article, a fault-tolerance method that based on similar resources and related technologies are proposed and discussed. First, several mathematical models of key elements, such as computing nodes, similar nodes and tasks, are constructed. Then, the similarity computation methods and evaluation criteria are evinced by two different views: tasks and resources. Supported by theories above, numerous methods, such as similar nodes auto-discovery (SNAD) and its optimization one (oSNAD), redundant tasks auto-deployment, and reconfiguration policies of fault tasks and nodes are highlighted respectively. Simulation results show that these approaches and schemes can improve the adaptive fault-tolerance abilities of complicated embedded distributed systems.
Comments on "Multiple Fault Detection in Combinational Networks"
Authors: P. Goel
Venue: IEEE Transactions on Computers (1974)

Some comments on a recent contribution on multiple fault detection using test sets for single fault detection are presented. A counter example that shows some defects in generalizing from a tree to an arbitrary network are also included.
Generalization Error Bounds in Semi-supervised Classification Under the Cluster Assumption
Authors: Philippe Rigollet
Venue: The Journal of Machine Learning Research (2007)

We consider semi-supervised classification when part of the available data is unlabeled. These unlabeled data can be useful for the classification problem when we make an assumption relating the behavior of the regression function to that of the marginal distribution. Seeger (2000) proposed the well-known cluster assumption as a reasonable one. We propose a mathematical formulation of this assumption and a method based on density level sets estimation that takes advantage of it to achieve fast rates of convergence both in the number of unlabeled examples and the number of labeled examples.
Image Noise Removal via Hierarchical Subbands Shrinkage Modified by Particle Swarm Optimization
Authors: Baolong Guo, Yunyi Yan, Xiang Fu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

An image noise removal method based on hierarchal subbands shrinkage (HSS) via smooth-shrinking method is proposed in this paper. Small coefficients are often thought to be due to noise, but some of them may be due to fine image features. Unlike the soft- or hard-thresholding just set those small coefficients to zero,smooth-shrinking shrinks them to some extent. Universal thresholding shrinks all subbands by a universal threshold, but HSS shrinks each subband by special selected thresholds. As an efficient optimization method, Particle Swarm Optimization (PSO) is adopted to modify or optimize those special thresholds for smooth shrinkage. HSS was superior to universal shrinkage and Wiener filering in terms of MSE. HSS could keep more fine details preserved and obtain better subjective image quality. The optimization achieved by PSO improved the noise removal performance of HSS.
ROI Based Natural Image Retrieval Using Color and Texture Feature
Authors: Jing Zhang, Choong-Woong Yoo, Seok-Wun Ha
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Region of interest(ROI) plays an important role in image analysis. In this paper, an efficient approach for content based image retrieval combining both color and texture features using three ROIs is proposed. Firstly, segment image to three parts using K-means algorithm. Secondly, select three ROIs from the three parts and then extract color features and texture features of ROIs. The similarity of two images will be determined by the similarities between pairs of ROIs. The experimental results demonstrate that the proposed method is encouraging with a successful retrieval rate.
Legacy Migration to Service-Oriented Computing with Mashups
Authors: Semih Cetin, N. Ilker Altintas, Halit Oguztuzun, Ali H. Dogru, Ozgur Tufekci, Selma Suloglu
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

Although Service-Oriented Computing holds great promises, it is still not clear when and how the existing systems will exploit this new computational model. The problem is particularly severe for the software having several years of use. This work provides a roadmap for the migration of legacy software to Service-Oriented Computing by means of right levels of abstraction. The key idea is having integration even at the presentation layer, not only at backend layers such as application or data. This requires re-inventing the popular mashup technology of Web 2.0 at the enterprise level. Domain- Specific-Kits and Choreography Engine concepts that were originally introduced by the Software Factory Automation approach have been reshaped as another enabling technology towards migrating to the service harmonization platform. The paper also exemplifies the proposed approach on a simple case problem.
Protein secondary structure prediction using distance based classifiers
Authors: Ashish Ghosh, Bijnan Parai
Venue: International Journal of Approximate Reasoning (2008)

De novo structure determination of proteins is a significant research issue of bioinformatics. Biochemical procedures for protein structure determination are costly. Use of different pattern classification techniques are proved to ease this task. In this article, the secondary structure prediction task has been mapped into a three-class problem of pattern classification, where the classes are helix, sheet and coil. Here we have made an attempt to analyze this secondary structure prediction problem using three distance based classifiers (minimum distance, K-nearest neighbor and fuzzy K-nearest neighbor). The only information about the proteins used is the primary structure (sequence of amino acids) itself. A matrix-based new representation of such categorical data is used to convert the sequence into real numbers. A comparative study among these classifiers has been made based on some standard classification performance measures. From this study, it is found that the simple minimum distance classifier performs better compared to others.
Traffic Measurement Mechanisms for High Precision Internet Applications
Authors: Zhenqi Wang, Jin Liu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

The large number of applications and their use of dynamic sessions cause one of the main problems with traffic analysis in the recent Internet. The traditional wellknown port number based traffic analysis mechanism is not sufficient to analyze newly emerging Internet traffic, such as P2P, streaming media, and game traffic. And more sophisticated high precision traffic measurement is required for control of current Internet traffic. In this paper, we propose mechanisms based on signature-mapping and subgroup to cope with the challenges and presented the system architecture.
Impact of Simultaneous Switching Noise on the Static behavior of Digital CMOS Circuits
Authors: F. Azais, L. Larguier, M. Renovell
Venue: Proceedings of the 16th Asian Test Symposium (2007)

This paper analyzes the logic errors in digital circuits due to the presence of Simultaneous Switching Noise (SSN). It is demonstrated that 2 conditions must be fulfilled in order to guarantee the correct logic behaviour of a digital circuits. The first condition called "Minimum Switch Condition' is proved to be fulfilled whatever the amount of SSN in the power and ground lines. The second condition called "Signal Coherence Condition' is proved to be fulfilled within power coherent logic blocks. However the interface between non-coherent logic blocks may originate logic dysfunction. DFT and ATPG recommendations are derived from this analysis.
Milestones of New-Generation ATE
Authors: Tohru Kazamaki
Venue: IEEE Design Test (1985)

Work began in 1976 to produce an accurate, high-speed, multipin tester in the 100-MHz range. Takeda Riken shipped the firstsuch device, the 100 MHz, 384-pin, split I/O Advantest T3380, in early 1979. Although it offered speed and accuracy, the T3380series was expensive, and it was later determined that the 40-MHz range was more practical and cost-effective for generaluse. This article describes the T3340 and T3341 testers developed to meet those needs. The T3340 provides signal integrityand a highfidelity DUT-to-tester interface, accurate timing, and innovative architecture to meet modem VLSI circuit testingrequirements. Delivery of the T3341 began this year; this improved version has extended timing edges, advanced failure analysiscapability, and a standard algorithmic pattern generator for testing memory-embedded generic gate arrays. 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
The XML-based Information Extraction on Data-intensive Page
Authors: Yanheng Li
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

This paper puts forward an XML-based information extraction method which applies XSLT and XPath technology to construct extraction rules. The aim of this method is to extract useful information from dataintensive pages. This paper firstly analyzes the traits of data- intensive pages. Aiming at those traits, we proposed a path induction method to conclude record pattern of pages, to obtain the path expression of useful information, and eventually to construct extraction rules. Furthermore, this paper presents the method of optimization of extraction rules in order to getting more robust rules.
The simple genetic algorithm and the walsh transform: Part ii, the inverse
Authors: Michael D. Vose, Alden H. Wright
Venue: Evolutionary Computation (1998)

This paper continues the development, begun in Part I, of the relationship between the simple genetic algorithm and the Walsh transform. The mixing scheme (comprised of crossover and mutation) is essentially “triangularized” when expressed in terms of the Walsh basis. This leads to a formulation of the inverse of the expected next generation operator. The fixed points of the mixing scheme are also determined, and a formula is obtained giving the fixed point corresponding to any starting population. Geiringer's theorem follows from these results in the special case corresponding to zero mutation.
Softare Configuration Management: A Tutonal
Authors: E. H. Bersoff
Venue: Computer (1979)

Developers and buyers can avoid disappointments and cost overruns by carefully tracking software system configurations through the system life cycle.
Availability-based Task Monitoring and Adaptation Mechanism in Desktop Grid System
Authors: HUANG, WANG Zhijiang, WANG Congming, WANG Yu, CHEN Yongshang, SHANG Ling
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Compliance with the time constraint of the QoS requirement is challenging in the desktop grid environment. Measurements of node behavior indicate the availability of node is cyclic. It is helpful to estimate the execution time of a submitted task on the allocated resource. This paper proposes a novel approach based on available time model to monitor the task execution process and provide running-time adaptation mechanism. Based on this model, a new notion, i.e. Emergency Degree, is proposed to quantitatively indicate the risk of whether the node can complete the task in time. The approach has been implemented and validated on a desktop grid platform -- XtremWeb. The evaluation shows the model and mechanism are practical and effective to guarantee the time constraint of the task.