ppxscal/embedding_network huggingface dataset:
New results on the genetic cryptanalysis of TEA and reduced-round versions of XTEA
Authors: Julio César Hernández Castro, Pedro Isasi Viñuela
Venue: New Generation Computing (2005)

Recently, a quick and simple way of creating very efficient distinguishers for cryptographic primitives such as block ciphers or hash functions, was presented and proved useful by the authors. In this paper, this cryptanalytic attack (named genetic cryptanalysis after its use of genetic algorithms) is shown to be successful when applied over reduced-round versions of the block cipher XTEA. Efficient distinguishers for XTEA are proposed for up to 1 cycles (8 rounds). Additionally, a variant of this genetic attack is also introduced, and their results over the block cipher TEA presented, which are the most powerful published to date.
On the Lower Bound of Local Optimums in K-Means Algorithm
Authors: Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, the k-means algorithm is very likely to converge to some local optimum which is much worse than the desired global optimal solution. To overcome this problem, current k-means algorithm and its variants usually run many times with different initial centers to avoid being trapped in local optimums that are of unacceptable quality. In this paper, we propose an efficient method to compute a lower bound on the cost of the local optimum from the current center set. After every k-means iteration, k-means algorithm can halt the procedure if the lower bound of the cost at the future local optimum is worse than the best solution that has already been computed so far. Although such a lower bound computation incurs some extra time consumption in the iterations, extensive experiments on both synthetic and real data sets show that this method can greatly prune the unnecessary iterations and improve the efficiency of the algorithm in most of the data sets, especially with high dimensionality and large k.
From simulation to gaming: an object-oriented supply chain training library
Authors: Alexander Verbraeck, Stijn-Pieter A. van Houten
Venue: Proceedings of the 37th conference on Winter simulation (2005)

The development of web-enabled interactive training simulations is far from easy, especially when all models have to be developed from scratch for each training game. Actually, one would like to be able to reuse parts of existing, off-line simulation models in an interactive setting. The challenge is how to set-up simulation models or simulation libraries that are developed for off-line simulations in such a way that they can be reused for on-line situations, and adapted for different educational settings. Using a supply chain context as an example, this paper shows how libraries of simulation components can be applied both for offline simulation studies and for on-line training. The paper also describes the other functionality that is needed to create a generally applicable component library for supply chain training simulations.
Whizbang!
Authors: Roy A. Sykes,  Jr.
Venue: ACM SIGAPL APL Quote Quad (1996)

Originally, APL had only one set function, membership (L&isin;R). Defined as [EQUATION], it simply flagged whether each element of its left argument was found anywhere in its right argument. With the introduction of nested arrays, the definition was refined to [EQUATION] so that nested items could be be searched as well as simple elements. Users immediately noticed the &cup; and &cap; keys on the APL keyboard and wondered why they were not implemented as set union and intersection. Several implementations did include them, but APL2 implemented only without (L~R).
Speech Enhancement Based on Blind Source Separation in Car Environments
Authors: Hiroshi Saruwatari, Katsuyuki Sawai, Tsuyoki Nishikawa, Akinobu Lee, Kiyohiro Shikano, Atsunobu Kaminuma, Masao Sakata, Daisuke Saitoh
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

This paper describes a new speech enhancement system used in car environments, where independent component analysis (ICA)-based blind source separation (BSS) and subband elimination (SBE) processing are combined to achieve a high separation performance. The proposed method consists of two parts, fast-convergence frequency domain ICA and SBE processing based on the independence among the separated subband signals. The SBE enforcedly eliminates the subband components in which the separation could not be performed well. The experiment in a real car environment reveals that the proposed method can improve the qualities of the separated speech and word recognition rates for both directional and diffuse noises.
New audio technology partners to support authentic literacy development
Authors: Sean P. Brophy, Diana Sharp
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

Research indicates that the sheer quantity of reading has a major influence on reading development. Readers who read more become better readers in a cycle that promotes increased fluency and comprehension, as well as an appreciation for the benefits of reading. A conundrum emerges when working with young learners who are just learning to read. Many of these children are developmentally ready to begin comprehending and discussing good stories, but have low decoding skills to process the written text. A new, low cost technology has been developed to provide students with a reading partner that helps students engage in reading. The partner can read text, provide help with vocabulary, and model good questioning to foster comprehension. This paper presents a theoretical perspective for engaging young students in good reading habits in conjunction with practicing basic decoding skills. A unique and affordable audio compact disc controller provides students with the ability to request predefined verbal help with stories. An example is given to demonstrate how this technology can be used to develop literacy skills in the classroom or at home. The potential for this technology can easily be realized in other domains, such as math and science, where students are ready to advance in other skills, but are still developing their basic decoding skills.
Project Visualization for Software
Authors: Kai T. Hansen
Venue: IEEE Software (2006)

Project team leaders can use software project "blueprints"--in the form of graphical expressions such as code- and function-oriented visualizations-to update stakeholders on the project's progress through the development cycle. These graphical visualization can represent artifacts produced in a software project. The author gives both theoretical and real-world examples showing how the visualizations map to architectural views and discusses how these visualizations could be linked to standard project management tools.
Evaluating Centrality Measures in Large Call Graphs
Authors: Christine Kiss, Andreas Scholz, Martin Bichler
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

Analytical methods for Customer Relationship Management (CRM) have gained increasing importance in today's businesses. Some industry sectors such as the telecommunication industry accumulate huge amounts of data not only about the usage behaviour of individual customers, but also about how customers interact. In addition to traditional data mining and statistical techniques, methods from the field of Social Network Analysis (SNA) are essential to leverage this special set of data. For example, call detail records of telephone operators can be used to evaluate the network of customers and derive measures for the influence of persons in such a network. This information is relevant to viral marketing, as well as various other forms of advertising and campaign management. Research in network analysis has led to a number of different centrality measures, which are potentially useful statistics for such purposes. In this paper, we compare different centrality measures based on a variety of different network topologies and model assumptions.
Non-cooperative games for service differentiation in CDMA systems
Authors: Mainak Chatterjee, Haitao Lin, Sajal K. Das
Venue: Mobile Networks and Applications (2005)

In this paper, we address the problem of user-class based service differentiation in CDMA networks. Users are categorized into three classes who get differentiated services based on their expected quality of service (QoS) from the service provider and the price they are willing to pay. We adopt a game theoretic approach for allocating resources through a two-step process. During a service admission, resource distribution is determined for each class. Then, the resource allocated to each class is distributed among the active users in that class. We devise a utility function for the providers which considers the expected revenue and the probability of users leaving their service provider if they are not satisfied with the service. Our model demonstrates how power can be controlled in a CDMA network to differentiate the service quality. Also, we show the impact of admitting high paying users on other users.
Monotone Iterates for Solving Nonlinear Monotone Difference Schemes
Authors: I. Boglaev
Venue: Computing (2006)

This paper is concerned with monotone iterative algorithms for solving nonlinear monotone difference schemes of elliptic type. Firstly, the monotone method (known as the method of lower and upper solutions) is applied to computing the nonlinear monotone difference schemes in the canonical form. Secondly, a monotone domain decomposition algorithm based on a modification of the Schwarz alternating method is constructed. This monotone algorithm solves only linear discrete systems at each iterative step and converges monotonically to the exact solution of the nonlinear monotone difference schemes. Numerical experiments are presented.
New reconstruction formulas for oversampled processes and functions
Authors: B. Lacaze, M. Chabert
Venue: Signal Processing (2006)

This paper addresses the reconstruction of band-limited oversampled stationary processes and functions. The reconstruction is performed from a multiperiodic subset of the periodic sampling sequence and from some isolated samples. Reconstruction performance can be characterized at the omitted sample points. The omission of some sample points provides a time-varying nature to the reconstruction formulas. This particular sampling scheme associated to specific interpolation functions result in an exact reconstruction with an arbitrarily tunable convergence rate. Moreover, the convergence properties hold when the reconstruction is performed in the neighbourhood of any lost sample. Indeed, the formulas can be fitted to any sample loss or deterioration by a simple time index translation. Specific expressions of the general reconstruction formula are derived for different process bandwidth ranges.
An Effective Visibility Culling Method Based on Cache Block
Authors: Moon-Hee Choi, Woo-Chan Park, Francis Neelamkavil, Tack-Don Han, Shin-Dug Kim
Venue: IEEE Transactions on Computers (2006)

As the complexity of 3D scenes is on the increase, the search for an effective visibility culling method has become one of the most important issues to be addressed in the design of 3D rendering processors. In this paper, we propose a new rasterization pipeline with visibility culling; the proposed architecture performs the visibility culling at an early stage of the rasterization pipeline (especially at the traversal stage) by retrieving data in a pixel cache without any significant hardware logics such as the hierarchical z{\hbox{-}}{\rm buffer}. If the data to be retrieved does not exist in the pixel cache, the proposed architecture performs a prefetch operation in order to reduce the miss penalty of the pixel cache. That is, the cache miss penalty can be reduced as the transfer of a missed cache block from the frame memory into the pixel cache can be handled simultaneously with the rasterization pipeline executions. Simulation results show that the proposed architecture can achieve a performance gain of about 32 percent compared with the conventional pretexturing architecture and about 7 percent compared to the hierarchical z{\hbox{-}}{\rm buffer} visibility scheme.
Decentralized planning under uncertainty for teams of communicating agents
Authors: Matthijs T. J. Spaan, Geoffrey J. Gordon, Nikos Vlassis
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Decentralized partially observable Markov decision processes (DEC-POMDPs) form a general framework for planning for groups of cooperating agents that inhabit a stochastic and partially observable environment. Unfortunately, computing optimal plans in a DEC-POMDP has been shown to be intractable (NEXP-complete), and approximate algorithms for specific subclasses have been proposed. Many of these algorithms rely on an (approximate) solution of the centralized planning problem (i.e., treating the whole team as a single agent). We take a more decentralized approach, in which each agent only reasons over its own local state and some uncontrollable state features, which are shared by all team members. In contrast to other approaches, we model communication as an integral part of the agent's reasoning, in which the meaning of a message is directly encoded in the policy of the communicating agent. We explore iterative methods for approximately solving such models, and we conclude with some encouraging preliminary experimental results.
AMROEBA: computational astrophysics modeling enabled by dynamic lambda switching
Authors: Joe Mambretti, Rachel Gold, Fei Yeh, Jim Chen
Venue: Future Generation Computer Systems (2006)

Many data and compute intensive Grid applications, such as computational astrophysics, may be able to benefit from networking supported by dynamically provisioned lightpaths. To date, the majority of high performance distributed environments have been based on traditional routed packet networks, provisioned as external services rather than as integrated components within those environments. Because this approach often cannot provide high performance capabilities required by these applications, an alternative distributed infrastructure architecture is being designed based on dynamic lightpaths, supported by optical networks. These designs implement communication services and infrastructure as integral components of distributed infrastructure. The resultant environments resemble large scale specialized instruments. Presented here is one such architecture, implemented on a wide-area, optical Grid test bed, featuring a closely integrated dedicated lightpath mesh. The test bed was used to conduct a series of experiments to explore its potential for supporting adaptive mesh refinement (AMR) astrophysics simulations. While preliminary, the results of these experiments indicate that this architecture may provide the deterministic capabilities required by a wide range of high performance distributed services and applications, especially for computational science.
Covariance Tracking using Model Update Based on Lie Algebra
Authors: Fatih Porikli, Oncel Tuzel, Peter Meer
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

We propose a simple and elegant algorithm to track nonrigid objects using a covariance based object description and a Lie algebra based update mechanism. We represent an object window as the covariance matrix of features, therefore we manage to capture the spatial and statistical properties as well as their correlation within the same representation. The covariance matrix enables efficient fusion of different types of features and modalities, and its dimensionality is small. We incorporated a model update algorithm using the Lie group structure of the positive definite matrices. The update mechanism effectively adapts to the undergoing object deformations and appearance changes. The covariance tracking method does not make any assumption on the measurement noise and the motion of the tracked objects, and provides the global optimal solution. We show that it is capable of accurately detecting the nonrigid, moving objects in non-stationary camera sequences while achieving a promising detection rate of 97.4 percent.
Modeling and analysis of mesh tree hybrid power/ground networks with multiple voltage supply in time domain
Authors: Yi-Ci Cai, Jin Shi, Zu-Ying Luo, Xian-Long Hong
Venue: Journal of Computer Science and Technology (2005)

This paper proposes a novel algorithm, which can be used to model and analyze mesh tree hybrid power/ground distribution networks with multiple voltage supply in time domain. Not only this algorithm enhances common method's ability on analysis of power/ground network with irregular topology, but also very high accuracy it keeps. The accuracy and stability of this algorithm is proved using strict math method in this paper. Also, the usage of both precondition technique based on Incomplete Choleskey Decomposition and fast variable elimination technique has improved the algorithm's efficiency a lot. Experimental results show that it can finish the analysis of power/ground network with enormous size within very short time. Also, this algorithm can be applied to analyze the clock network, bus network, and signal network without buffer under high working frequency because of the independence of the topology.
Fairness and Throughput in Switch on Event Multithreading
Authors: Ron Gabor, Shlomo Weiss, Avi Mendelson
Venue: Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture (2006)

The need to reduce power and complexity will increase the interest in Switch on Event multithreading (coarse grained multithreading). Switch On Event multithreading is a low power and low complexity mechanism to improve processor throughput by switching threads on execution stalls. Fairness may, however, become a problem in a mul- tithreaded processor. Unless fairness is properly handled, some threads may starve while others consume all of the processor cycles. Heuristics that were devised in order to improve fairness in Simultaneous Multithreading are not applicable to Switch On Event multithreading. This paper defines the fairness metric using the ratio of the individ- ual threads' speedups, and shows how it can be enforced in Switch On Event multithreading. Fairness is controlled by forcing additional thread switch points. These switch points are determined dynamically by runtime estimation of the single threaded performance of each of the individ- ual threads. We analyze the impact of the fairness enforce- ment mechanism on throughput. We present simulation re- sults of the performance of Switch on Event multithread- ing. Switch on Event multithreading achieves an average speedup over single thread of 24% when no fairness is en- forced. In this case, over a third of our runs achieved poor fairness in which one thread ran extremely slowly (10 to 100 times slower than its single thread performance) while the other thread's performance was hardly affected. By using the proposed mechanism we can guarantee fairness of 1/4, 1/2 and 1 for a small performance loss of 2.2%, 3.7% and 7.2% respectively.
Electronic signatures: a brief review of the literature
Authors: Aashish Srivastava
Venue: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet (2006)

The advent of the Internet saw technological innovations such as electronic signatures, in particular digital signatures, as an electronic equivalent to manuscript signatures in the online environment. However, the use of this technology is still insignificant. The aim of this paper is to review the various studies that have explored the technical and legal issues associated with electronic signatures and digital signatures with an objective to provide insights on their lack of acceptance.
What's on Your Hard Drive?
Authors: Charlene O'Hanlon
Venue: Queue (2006)

One of the interesting things about WOYHD is seeing which tools developers seem to rely on most heavily. Despite the large amount of software available, a few core programs appear again and again. Even more intriguing is that developers often dislike these very same tools. Read on to discover what others think about the software you depend on. Feel like expressing your own opinion? Log on to http://www.acmqueue.com!
An overview of Quantum Cryptography for Wireless Networking Infrastructure
Authors: Kashif Habib Sheikh, Syed. Salahuddin Hyder, M. Mubashir Khan
Venue: Proceedings of the International Symposium on Collaborative Technologies and Systems (2006)

Quantum Key Distribution (QKD) is used in Quantum Cryptographic Systems to exchange secret key between parties who need to communicate secretly. Such a key can be used with a symmetric encryption schemes to establish a secure communication. Until recently, QKD is possible using optical fiber over few tens of kilometers but not more due to single photons getting absorbed by the fiber. There are no commercial wireless quantum crypto products yet, but QKD will soon be used in wireless medium from satellite to the earth so we could get 10,000 miles. But wireless medium brings its own problems. The energy transmitted via a wireless link spreads out, leading to higher and varying transmission losses, ambient daylight, or even light from the moon at night couple into the receiver, leading to a higher error rate. Interference from other photon sources air with clouds, dust and unsettled conditions creates intervention. In this paper, different techniques for communication in Quantum Cryptography using wireless networking infrastructure are discussed.
Similarity of Temporal Query Logs Based on ARIMA Model
Authors: Ning Liu, Shuzhen Nong, Jun Yan, Benyu Zhang, Zheng Chen, Ying Li
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

A challenging issue faced by modern information retrieval is that of determining and satisfying users' requirements relying only on very short text queries. In this paper, we propose an algorithm to find out related queries based on Auto-Regressive Integrated Moving Average (ARIMA) Model. First, we select and estimate ARIMA model of the temporal query logs. And then each query is denoted by a sequence of coefficients. We use the correlation of ARIMA coefficients as the similarity measurement. We call it as the ARIMA Temporal Similarity (ARIMA TS). This similarity describes how strongly two time series are linearly related. On the other hand, the ARIMA model could also be treated as a dimensionality reduction procedure. It can save storage space for a large database of the query logs. In addition, ARIMA model could be used as a tool to predict the trend of a query. The experimental results on two query logs of MSN search engine 1 demonstrate that the proposed approach can achieve better similarity measurement efficiently.