ppxscal/embedding_network huggingface dataset:
Special-Purpose Hardware for Solving the Elliptic Curve Discrete Logarithm Problem
Authors: Tim Güneysu, Christof Paar, Jan Pelzl
Venue: ACM Transactions on Reconfigurable Technology and Systems (TRETS) (2008)

The resistance against powerful index-calculus attacks makes Elliptic Curve Cryptosystems (ECC) an interesting alternative to conventional asymmetric cryptosystems, like RSA. Operands in ECC require significantly less bits at the same level of security, resulting in a higher computational efficiency compared to RSA. With growing computational capabilities and continuous technological improvements over the years, however, the question of the security of ECC against attacks based on special-purpose hardware arises. In this context, recently emerged low-cost FPGAs demand for attention in the domain of hardware-based cryptanalysis: the extraordinary efficiency of modern programmable hardware devices allow for a low-budget implementation of hardware-based ECC attacks---without the requirement of the expensive development of ASICs. With focus on the aspect of cost-efficiency, this contribution presents and analyzes an FPGA-based architecture of an attack against ECC over prime fields. A multi-processing hardware architecture for Pollard's Rho method is described. We provide results on actually used key lengths of ECC (128 bits and above) and estimate the expected runtime for a successful attack. As a first result, currently used elliptic curve cryptosystems with a security of 160 bit and above turn out to be infeasible to break with available computational and financial resources. However, some of the security standards proposed by the Standards for Efficient Cryptography Group (SECG) become subject to attacks based on low-cost FPGAs.
Cultural representations of gender among u. s. computer science undergraduates: statistical and data mining results
Authors: Antonio M. Lopez,  Jr., Kun Zhang, Frederick G. Lopez
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

Worldwide, there is substantial evidence that cultural contexts may either support or hinder the number of women versus men participating in computing. There is also evidence that certain computing disciplines have more appeal to women than others. Hence research on any computing gender gap should be specific to a culture and a computing discipline. In the United States (US) a popular belief is that Computer Science (CS) has a decidedly 'masculine culture'. This paper reports on research that investigates this perception, comparing CS undergraduates to undergraduates in non-computing disciplines (NCD). The data were collected in a nationwide purposeful sampling of US citizens attending Historically Black Colleges and Universities (HBCUs) and Predominantly White Institutions (PWIs) with an ethnic compositional focus on African Americans and Caucasians. The paper describes a survey scale developed in the US to characterize a person's gender role as feminine, masculine, or androgynous. The data were analyzed using statistical and data mining techniques. Surprisingly, CS students were found to be more androgynous than masculine.
Compact gradient tracking in shape optimization
Authors: Karsten Eppler, Heinmt Harbrecht
Venue: Computational Optimization and Applications (2008)

In the present paper we consider the minimization of gradient tracking functionals defined on a compact and fixed subdomain of the domain of interest. The underlying state is assumed to satisfy a Poisson equation with Dirichlet boundary conditions. We proof that, in contrast to the situation of gradient tracking on the whole domain, the shape Hessian is not strictly H1/2-coercive at the optimal domain which implies ill-posedness of the shape problem under consideration. Shape functional and gradient require only knowledge of the Cauchy data of the state and its adjoint on the boundaries of the domain and the subdomain. These data can be computed by means of boundary integral equations when reformulating the underlying differential equations as transmission problems. Thanks to fast boundary element techniques, we derive an efficient algorithm to solve the problem under consideration.
Categorizing and ranking search engine's results by semantic similarity
Authors: Tianyong Hao, Zhi Lu, Shitong Wang, Tiansong Zou, Shenhua GU, Liu Wenyin
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

An automatic method for text categorizing and ranking search engine's results by semantic similarity is proposed in this paper. We first obtain nouns and verbs from snippets obtained from search engine using Name Entity Recognition and part-of speech. A semantic similarity algorithm based on WordNet is proposed to calculate the similarity of each snippet to each of the pre-defined categories. A balanced similarity ranking method combined with Google's rank and timeliness of the pages is proposed to rank these snippets. Preliminary experiments with 500 labeled questions from TREC03 show that 72.7% are correctly categorized.
Algorithm 885: Computing the Logarithm of the Normal Distribution
Authors: Jean Marie Linhart
Venue: ACM Transactions on Mathematical Software (TOMS) (2008)

We present and compare three C functions to compute the logarithm of the cumulative standard normal distribution. The first is a new algorithm derived from Algorithm 304&rsquo;s calculation of the standard normal distribution via a series or continued fraction approximation, and it is good to the accuracy of the machine. The second is based on Algorithm 715&rsquo;s calculation of the standard normal distribution via rational Chebyshev approximation. This is related to, and an improvement on, the algorithm for the logarithm of the normal distribution available in the software package R. The third is a new and simple algorithm that uses the compiler&rsquo;s implementation of the error function, and complement of the error function, to compute the log of the normal distribution.
Using automatically labelled examples to classify rhetorical relations: An assessment
Authors: Caroline Sporleder, Alex Lascarides
Venue: Natural Language Engineering (2008)

Being able to identify which rhetorical relations (e.g., contrast or explanation) hold between spans of text is important for many natural language processing applications. Using machine learning to obtain a classifier which can distinguish between different relations typically depends on the availability of manually labelled training data, which is very time-consuming to create. However, rhetorical relations are sometimes lexically marked, i.e., signalled by discourse markers (e.g., because, but, consequently etc.), and it has been suggested (Marcu and Echihabi, 2002) that the presence of these cues in some examples can be exploited to label them automatically with the corresponding relation. The discourse markers are then removed and the automatically labelled data are used to train a classifier to determine relations even when no discourse marker is present (based on other linguistic cues such as word co-occurrences). In this paper, we investigate empirically how feasible this approach is. In particular, we test whether automatically labelled, lexically marked examples are really suitable training material for classifiers that are then applied to unmarked examples. Our results suggest that training on this type of data may not be such a good strategy, as models trained in this way do not seem to generalise very well to unmarked data. Furthermore, we found some evidence that this behaviour is largely independent of the classifiers used and seems to lie in the data itself (e.g., marked and unmarked examples may be too dissimilar linguistically and removing unambiguous markers in the automatic labelling process may lead to a meaning shift in the examples).
Delayed filter update: an acoustic echo canceler structure for improved doubletalk detection handling
Authors: Fredric Lindstrom, Mattias Dahl, Ingvar Claesson
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

This paper proposes an algorithm for doubletalk detection handling. The algorithm is aimed for a delayed filter update structure of an acoustic echo canceler. Key features employing this method are: avoidance of filter divergence in situations of undetected doubletalk and fast recovery from erroneous doubletalk detection, i.e. mistaken echo path change for doubletalk. The virtues of the proposed algorithm is demonstrated through simulations using real speech signals.
Error analysis of Parallel Multivalue Hybrid Methods for index-2 Differential-Algebraic Equations
Authors: Aiguo Xiao, Jialan Liu
Venue: International Journal of Computing Science and Mathematics (2008)

The main purpose of this paper is to present some convergence results of a class of Parallel Multivalue Hybrid Methods (PMHMs) for semi-explicit index-2 differential-algebraic equations. Some numerical examples confirm our theoretical results and show that the computed orders of the 2-step 2-order PMHM (PMHM2) and the 3-step 3-order PMHM(PMHM3) are higher than the corresponding theoretical orders and the corresponding computed orders of the 2-step 2-order BDF method and the 3-step 3-order BDF method. This interesting phenomenon is due to the apparently smaller residual error constants of PMHM2 and PMHM3 than those of the corresponding BDF methods.
Rethinking internet routing
Authors: Jennifer Rexford
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

Internet routing introduces many interesting challenges, far beyond the basic problem of computing paths on a graph. This talk presents an overview of several open research questions in Internet routing, with the broader goal of placing the design of future routing architectures on a stronger theoretical foundation.
Deterministic on-line routing on area-universal networks
Authors: P. Bay, G. Bilardi
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

Two deterministic routing networks, the pruned butterfly and the sorting fat-tree, are presented. Both networks are area universal, i.e. they can simulate with polylogarithmic slowdown, any other routing network fitting in similar area. Previous area-universal networks were either for the offline problem, where the message set to be routed is known in advance and substantial precomputation is permitted, or involved randomization, yielding results that hold only with high probability. The present networks are the first that are simultaneously deterministic and online, and they use two substantially different routing techniques. The performance of the routing algorithms depends on the difficulty of the problem instance, which is measured by a quantity lambda , known as the load factor. The pruned butterfly algorithm runs in time O( lambda log/sup 2/N), where N is the number of possible sources and destinations for messages and lambda is assumed to be polynomial in N. The sorting fat-free algorithm runs in O( lambda log N + log/sup 2/N) time for a restricted class of message sets, including partial permutations. Other results include a new type of sorting circuit, an area universal circuit, and an area-time lower bound for routers.
Optimization of WAMDAS: A Web Service-Based Wireless Alarm Monitoring and Data Acquisition System for Pharmaceutical Plants
Authors: Edith Quispe Holgado, Manuel Rodríguez Martínez, Edilberto García Rodríguez
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

We present a novel infrastructure which allows the Web Service-Based Wireless Alarm Monitoring and Data Acquisition System for Pharmaceutical Plants (WAMDAS) to be a more portable, reliable, secure and robust wireless web service-based middleware system. This infrastructure provides a reliable alarm management mechanism that guarantees timely alarm delivery according with a defined configuration schema for alarms. Also it provides a functionality to help the availability of web services to respond the requests on time. Likewise, a Windows-based application module is provided to permit system administrators to dynamically configure all system information and parameters, as well as define the configuration scheme for alarm management. Furthermore, the device application was improved with a strong security mechanism to access the system, a mechanism to control the system usage, and a redesign of the user interface. We conducted an evaluation of the alarm services protocol; this evaluation shows that the alarm delivery time was optimized, and the alarm delivery process is more reliable and fault tolerant when using message queues instead of TCP/IP sockets
Virtual integrated TCP testbed (VITT)
Authors: Carlo Caini, Rosario Firrincieli, Renzo Davoli, Daniele Lacamera
Venue: Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks & communities (2008)

Research on TCP performance relies either on simulation programs, which run on a single machine, or on the use of real testbeds, where different machines represent different network nodes and data exchange is made through physical network interfaces. This paper proposes a different solution, with the aim of taking the best of both the cited alternative options. The idea is to exploit the most advanced virtualization technologies to integrate the different devices of a real testbed in a single GNU/Linux physical machine. The Virtual Integrated TCP Testbed (VITT) presented in this paper is the practical realization of this concept. Several virtual machines, fully configurable from the host system, are connected through an emulated network, implemented by means of the software tools provided by the Virtual Distributed Ethernet (VDE) project. A simple web interface allows the user to configure the network layout, set the TCP parameters, launch the experiments and gather the results. VITT is built on the experience achieved by the authors in the design and use of a real distributed testbed (TATPA), from which VITT derives some software components. TATPA results proved essential to assess the present limits of the virtualization approach, i.e. the accuracy of results vs. network complexity.
Comparison of ESI-MS Spectra in MassBank Database
Authors: Hisayuki Horai, Masanori Arita, Takaaki Nishioka
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Metabolomics is one of the most important topics in biology and medical science. In metabolomics, metabolites from biological samples are measured by mass spectrometry (MS) and then identified by database searches for similar spectra. Since spectra from the same compound may differ depending on measurement conditions, comparison measure is a crucial issue for identifying compounds from their spectra. A standard method for comparison is normalized dot product or cosine correlation between spectral peaks. We discuss the weighting scheme for preprocessing peak intensities and demonstrate comparison results for about 9,000 spectra in our publicly available MassBank database (http://www.massbank.jp/).
On the automorphism groups of symmetric graphs admitting an almost simple group
Authors: Xin Gui Fang, Lu Jun Jia, Jie Wang
Venue: European Journal of Combinatorics (2008)

This paper investigates the automorphism group of a connected and undirected G-symmetric graph @C where G is an almost simple group with socle T. First we prove that, for an arbitrary subgroup M of Aut@C containing G, either T is normal in M or T is a subgroup of the alternating group A"k of degree k=|M"@a:T"@a|-|N"M(T):T|. Then we describe the structure of the full automorphism group of G-locally primitive graphs of valency d, where d@?20 or is a prime. Finally, as one of the applications of our results, we determine the structure of the automorphism group Aut@C for cubic symmetric graph @C admitting a finite almost simple group.
Seismic reliability of a cable-stayed bridge retrofitted with hysteretic devices
Authors: Fabio Casciati, Gian Paolo Cimellaro, Marco Domaneschi
Venue: Computers and Structures (2008)

This study evaluates the fragility curves of a cable-stayed bridge by an analytical approach based on time history analysis. The presentation of the vulnerability information in the form of fragility curves is a widely practiced approach when several uncertain sources are involved. The ASCE benchmark problem of a cable-stayed bridge is considered as a case study. A passive control technique is adopted and results are compared in term of fragility curves. In order to consider the uncertainties related to the ground motion 24 ground motion time history are considered, corresponding to four different hazard levels, while the uncertainties in the structural characteristics are introduced by defining the different performance thresholds as random variables. The fragility evaluation shows how important a correct estimation of the limit state is for the comparison of different retrofit techniques.
Cryptosystem Based on Extraction of Square Roots of Complex Integers
Authors: Aleksey Koval, Boris S. Verkhovsky
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

This paper introduces an extension of Rabin cryptosystem into the domain of complex integers. The extended cryptosystem employs a new square root algorithm for complex integers that is presented. The extended Rabin cryptosystem is efficient, provably secure and has certain advantages over the real-integer Rabin cryptosystem.
Fast Algorithms for Consistency-Based Diagnosis of Firewall Rule Sets
Authors: Sergio Pozo Hidalgo, Rafael Ceballos, Rafael Martínez Gasca
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Firewalls provide the first line of defence of nearly all networked institutions today. However, Firewall ACL management suffer some problems that need to be addressed in order to be effective. The most studied one is rule set consistency. There is an inconsistency if different actions can be taken on the same traffic, depending on the ordering of the rules. In this paper a new algorithm to diagnose inconsistencies in firewall rule sets is presented. Although many algorithms have been proposed to address this problem, the presented one is a big improvement over them, due to its low algorithmic and memory complexity, even in worst case. In addition, there is no need to pre-process in any way the rule set previous to the application of the algorithms. We also present experimental results with real rule sets that validate our proposal.
A MEMS-based piezoelectric power generator array for vibration energy harvesting
Authors: Jing-Quan Liu, Hua-Bin Fang, Zheng-Yi Xu, Xin-Hui Mao, Xiu-Cheng Shen, Di Chen, Hang Liao, Bing-Chu Cai
Venue: Microelectronics Journal (2008)

Piezoelectric power generator made by microelectromechanical system (MEMS) technology can scavenge power from low-level ambient vibration sources. The developed MEMS power generators are featured with fixed/narrow operation frequency and power output in microwatt level, whereas, the frequency of ambient vibration is floating in some range, and power output is insufficient. In this paper, a power generator array based on thick-film piezoelectric cantilevers is investigated to improve frequency flexibility and power output. Piezoelectric cantilevers array has been designed and fabricated. The cantilevers array can be tuned to the frequency and expanded the excited frequency bandwidth in ambient low frequency vibration. Serial connection among cantilevers of the array is investigated. The prototype generator has a measured performance of 3.98@mW effective electrical power and 3.93 DC output voltage to resistance load. This device is promising to support networks of ultra-low-power, peer-to-peer, wireless nodes.
SYNC-NET: distributed time synchronization in clustered sensor networks
Authors: Ossama Younis, Sonia Fahmy
Venue: Wireless Communications Mobile Computing (2008)

Time synchronization is essential for several ad-hoc network protocols and applications, such as TDMA scheduling and data aggregation. In this paper, we propose a time synchronization framework for clustered, multi-hop sensor networks. We assume that relative node synchronization is sufficient, that is, consensus on one time value is not required. Our goal is to divide the network into connected synchronization regions (nodes within two-hops) and perform inter-regional synchronization in O(LLSync) &times; Niter time, where O(LLSync) denotes the complexity of the underlying low-level synchronization technique (used for single-hop synchronization), and Niter denotes the number of iterations where the low-level synchronization protocol is invoked. Thus, our main objective is rapid convergence. We propose novel fully distributed protocols, SYNC-IN and SYNC-NET, for regional and network synchronization, respectively, and prove that Niter is O(1) for all protocols. Our framework does not require any special node capabilities (e.g., being global positioning systems (GPS)-enabled), or the presence of reference nodes in the network. Our framework is also independent of the particular clustering, inter-cluster routing, and low-level synchronization protocols. We formulate a density model for analyzing inter-regional synchronization, and evaluate our protocols via extensive simulations. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Flutter: directed random browsing of photo collections with a tangible interface
Authors: John Williamson, Lorna M Brown
Venue: Proceedings of the 7th ACM conference on Designing interactive systems (2008)

Large collections of photographs are commonplace, and many interfaces for viewing, sorting and organizing them have been proposed. This work describes the design and implementation of a "living photo frame" - designed not to navigate or browse collections but to create an enjoyable activity from a collection of images. Tangible interactions with a tablet-style PC are used to bind the user closely to the system. Every interaction is logged and used to gradually evolve the structure of photo collections.
A leakage-energy-reduction technique for cache memories in embedded processors
Authors: Seiichiri Fujii, Akihito Sakanaka, Akihiro Chiyonobu, Toshinori Sato
Venue: Journal of Embedded Computing (2006)

Power consumption is becoming one of the most important constraints for microprocessor design in nanometer-scale technologies. Especially, as the transistor supply voltage and threshold voltage are scaled down, leakage energy consumption is increased even when the transistor is not switching. This paper proposes a simple technique to reduce the static energy due to subthreshold leakage current. The key idea of our approach is to allow the ways within a cache to be accessed at different speeds and to place infrequently accessed data into the slow ways. We use dual-V_{t} technique to realize the non-uniform set-associative cache, and propose a simple replacement policy to reduce average access latency. Experimental results on 32-way set-associative caches demonstrate that any severe increase in clock cycles to execute application programs is not observed and significant static energy reduction can be achieved, resulting in the improvement of energy-delay^{2} product.