ppxscal/embedding_network huggingface dataset:
Fast BWT in small space by blockwise suffix sorting
Authors: Juha Kärkkäinen
Venue: Theoretical Computer Science (2007)

We present a new space- and time-efficient algorithm for computing the Burrow-Wheeler transform (BWT). For any choice of a parameter v@?[3,n^2^/^3], the computation of BWT for a text of length n takes O(nlogn+vn) worst-case time and O(nlogn+vn) average-case time using O(nlogn/v) bits of space in addition to the text and the BWT. For example, if v=log^2n, the time is O(nlog^2n) in the worst case and O(nlogn) on an average with the additional space requirement of O(n) bits. The algorithm is alphabet-independent: it uses only character comparisons, and the complexities do not depend on the alphabet size unless v does. A practical implementation is 2-3 times slower than one of the fastest and most space-efficient previous algorithms while needing only one-third of the main memory. The algorithm is based on suffix arrays, but unlike any other algorithm, it can construct the suffix array a small block at a time without storing the rest of the suffix array anywhere.
Merging models based on given correspondences
Authors: Rachel A. Pottinger, Philip A. Bernstein
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

A model is a formal description of a complex application artifact, such as a database schema, an application interface, a UML model, an ontology, or a message format. The problem of merging such models lies at the core of many meta data applications, such as view integration, mediated schema creation for data integration, and ontology merging. This paper examines the problem of merging two models given correspondences between them. It presents requirements for conducting a merge and a specific algorithm that subsumes previous work.
Macros in Scheme
Authors: William Clinger
Venue: ACM SIGPLAN Lisp Pointers (1991)

Although macros are even older than Lisp, Scheme has just become the first block-structured programming language to support a reliable macro system. This macro system is described in the appendix to the Revised4 Report on the Algorithmic Language Scheme, which appeared in the previous issue of Lisp Pointers. This issue contains three more articles on the subject of macros in Scheme, counting the article you are reading. I wrote this as an introduction to the other two articles, because it is very hard to understand their purpose without some background on macros in Scheme.
Computing block importance for searching on web sites
Authors: David Fernandes, Edleno S. de Moura, Berthier Ribeiro-Neto, Altigran S. da Silva, Marcos André Gonçalves
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

In this paper we consider the problem of using the block structure of a Web page to improve ranking results when searching for information on Web sites. Given the block structure of the Web pages as input, we propose a method for computing the importance of each block (in the form of block weights) in a Web collection. As we show through experiments, the deployment of our method may allow a significant improvement in the quality of search results. We ran experiments to compare the quality of search results when using our method to the quality obtained when using no structure information. When compared to a ranking method that considered pages as monolithic units, our block-based ranking method led to improvements in the quality of search results in experiments with two sites with heterogeneous structures. Further, our method does not increase the cost of processing queries when compared to the systems using no structural information.
Multi-domain collaborative exploration mechanisms for query expansion in an agent-based filtering framework
Authors: Sahin Albayrak, Dragan Milosevic
Venue: Electronic Commerce Research and Applications (2007)

Novice users often do not have enough domain knowledge to create good queries for searching information on-line. To help alleviate the situation, exploration techniques have been used to increase the diversity of the search results so that not only those explicitly asked will be returned, but also those potentially relevant ones will be returned too. Most existing approaches, such as collaborative filtering, do not allow the level of exploration to be controlled. Consequently, the search results can be very different from what is expected. We propose an exploration strategy that performs intelligent query processing by first searching usable old queries, and then utilising them to adapt the current query, with the hope that the adapted query will be more relevant to the user's areas of interest. We applied the proposed strategy to the implementation of a personal information assistant (PIA) set up for user evaluation for 3 months. The experimental results showed that the proposed exploration method outperformed collaborative filtering, and mutation and crossover methods by around 25% in terms of the elimination of off-topic results.
The Computer in Choreography
Authors: J. Lansdown
Venue: Computer (1978)

Computer-aided choreography illustrates some basic relationships between the computer artist and the computer procedures he employs to achieve certain artistic outcomes. 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
Contour Detection Based on Self-Organizing Feature Clustering
Authors: Yu Ma, Xiaodong Gu, Yuanyuan Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

The real vision system has a well-developed ability to detect multiple contours and recognize various objects in images. Previous simulation models to perform this process often employ image segmentation or contour integration algorithms. In this paper a new model is proposed to separate individual object contours from the background by the feature clustering. The model is inspired by the contrast mechanism and the self-organizing characteristic of the vision system. It can group edge elements with similar local features together automatically. The Self- Organizing Map (SOM) is used in the model to classify the edge elements in the image. Experimental results show that the object contours can be separated effectively by this model. The model can be used to supply useful information to higher-level visual mechanism for better object recognition.
Application of Restriction Coefficient in Optimal Comparison of Triangle Fuzzy Numbers
Authors: Hui-sheng Gao, Jing-xue Ran, Yi-qun Sun
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

In the paper, in view of the fact that triangle fuzzy numbers' comparison has importance in actual project and more or less flaw in former comparative method, the necessity of improvement is proposed. Because the restriction coefficient combines fuzzy average valuefuzzy standard dispersion and fuzzy information content and other merits, it is introduced into triangle fuzzy numbers' comparison in order to improve its flaw and shortage in the comparison and make it more perfect. It explains its merit and the validity by examples' analysis.
Attack scenario construction with a new sequential mining technique
Authors: Wang Li, Li Zhi-tang, Li Dong, Lei Jie
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Continuously increasing volume of security data makes it important to develop an advanced alert correlation system that can reduce alert redundancy, intelligently correlate security alerts and detect attack strategies. In this paper, we propose a new method of constructing attack scenarios in order to recognize attacker's high-level strategies and predict upcoming attack intentions. We mine frequent attack sequence patterns from history high level alert database. We then construct attack scenario models with the operation of online attack behavior pattern matching and correlativity calculation. Our technique overcomes the drawback of manual association rule specification used in other relevant systems. It is easy to implement and it can be used to detect novel multi-stage attack strategies compared with other existing techniques. Experiments show our approach can effectively construct attack scenarios and accordingly predict next most possible attack behavior.
CodeGenie: using test-cases to search and reuse source code
Authors: Otávio Augusto Lazzarini Lemos, Sushil Krishna Bajracharya, Joel Ossher, Ricardo Santos Morla, Paulo Cesar Masiero, Pierre Baldi, Cristina Videira Lopes
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

We present CodeGenie, a tool that implements a test-driven approachto search and reuse of code available on large-scale coderepositories. While using CodeGenie developers design test cases fora desired feature first, similar to Test-driven Development (TDD).However, instead of implementing the feature as in TDD, CodeGenieautomatically searches for it based on information available in thetests. To check the suitability of the candidate results in thelocal context, each result is automatically woven into thedeveloper's project and tested using the original tests. Thedeveloper can then reuse the most suitable result. Later, reusedcode can also be unwoven from the project as wished. For the codesearching and wrapping facilities, CodeGenie relies on Sourcerer, anInternet-scale source code infrastructure that we have developed
Derivation of Minimal Complete Sets of Test-Input Sequences Using Boolean Differences
Authors: P. N. Marinos
Venue: IEEE Transactions on Computers (1971)

This paper deals with a fault detection and diagnosis technique based on Boolean differences. A brief review of the notion of a Boolean difference is presented, and the concept of partial Boolean difference is introduced. An algorithm for obtaining minimal, complete sets of test-input sequences based on the partial Boolean differences of a switching function is formulated, and illustrations demonstrating the use of the technique are presented.
Formal methods for scheduling of latency-insensitive designs
Authors: Julien Boucaron, Robert de Simone, Jean-Vivien Millo
Venue: EURASIP Journal on Embedded Systems (2007)

Latency-insensitive design (LID) theory was invented to deal with SoC timing closure issues, by allowing arbitrary fixed integer latencies on long global wires. Latencies are coped with using a resynchronization protocol that performs dynamic scheduling of data transportation. Functional behavior is preserved. This dynamic scheduling is implemented using specific synchronous hardware elements: relay-stations (RS) and shell-wrappers (SW). Our first goal is to provide a formal modeling of RS and SW, that can be then formally verified. As turns out, resulting behavior is k-periodic, thus amenable to static scheduling. Our second goal is to provide formal hardware modeling here also. It initially performs throughput equalization, adding integer latencies wherever possible; residual cases require introduction of fractional registers (FRs) at specific locations. Benchmark results are presented, run on our KPASSA tool implementation.
Chaotic Ant Swarm
Authors: Hongyu Zhu, Zhuzhi Jia, Haipeng Peng, Lixiang Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Inspired by behaviors of real ants of nature, we develop a novel optimization method in this letter, called CAS (chaotic ant swarm), which is a chaotic version to describe our adaptation of the chaotic behavior of individual ant and the intelligent organization actions of ant colony to the solution of optimization problems. Our novel method includes both effects of chaotic dynamics and swarm-based search. It is a deterministic process different from the conventional ant algorithm. The nonlinear dynamics of the proposed method have been analyzed.
Interval-Based Linear Hybrid Dynamical System for Modeling Cross-Media Timing Structures in Multimedia Signals
Authors: Hiroaki Kawashima, Takashi Matsuyama
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

In this paper, we propose a computational scheme named an interval-based linear hybrid dynamical system (ILHDS) to represent complex dynamic events based on temporal intervals, each of which is characterized by linear dynamics and its duration. We then propose a cross-media timingstructure model to represent dynamic structures among multiple media signals based on the relation of temporal intervals described by multiple ILHDSs. To evaluate the proposed scheme, we conducted experiments on media conversion that generates lip video from an input audio signal.
A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times
Authors: Gabriella Stecco, Jean-François Cordeau, Elena Moretti
Venue: Computers and Operations Research (2008)

This paper introduces and compares three different formulations of a production scheduling problem with sequence-dependent and time-dependent setup times on a single machine. The setup is divided into two parts: one that can be performed at any time and another one that is restricted to be performed outside of a given time interval. As a result, the setup time between two jobs is a function of the completion time of the first job. The problem can be formulated as a time-dependent traveling salesman problem, where the travel time between two nodes is a function of the departure time from the first node. We show that the resulting formulation can be strengthened to provide better linear programming relaxation lower bounds. We also introduce several families of valid inequalities which are used within a branch-and-cut algorithm. Computational experiments show that this algorithm can solve some instances with up to 50 jobs within reasonable computing times.
PRO: a model for the design and analysis of efficient and scalable parallel algorithms
Authors: Assefaw Hadish Gebremedhin, Mohamed Essaïdi, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle
Venue: Nordic Journal of Computing (2006)

We present a new parallel computation model called the Parallel Resource-Optimal computation model. PRO is a framework being proposed to enable the design of efficient and scalable parallel algorithms in an architecture-independent manner, and to simplify the analysis of such algorithms. A focus on three key features distinguishes PRO from existing parallel computation models. First, the design and analysis of a parallel algorithm in the PRO model is performed relative to the time and space complexity of a sequential reference algorithm. Second, a PRO algorithm is required to be both time- and space-optimal relative to the reference sequential algorithm. Third, the quality of a PRO algorithm is measured by the maximum number of processors that can be employed while optimality is maintained. Inspired by the Bulk Synchronous Parallel model, an algorithm in the PRO model is organized as a sequence of supersteps. Each superstep consists of distinct computation and communication phases, but the supersteps are not required to be separated by synchronization barriers. Both computation and communication costs are accounted for in the runtime analysis of a PRO algorithm. Experimental results on parallel algorithms designed using the PRO model--and implemented using its accompanying programming environment SSCRAP--demonstrate that the model indeed delivers efficient and scalable implementations on a wide range of platforms.
An Effective and Secure Search of Office Documents
Authors: Somchai Chatvichienchai, Katsumi Tanaka
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

In this paper, we present a new search index generation technique that collects fields of office documents which are previously mapped to XML schema elements, and generate an XML-based search index including document types, file locations and fields collected from the documents and their semantic notations. The search index allows users to effectively find the target documents by specifying the document type and field values collected from the documents. In order to allow the search index to be securely shared by many users, access control policy is unified into the search index. We also propose an algorithm that computes the answer of search query corresponding to access permission of the user.
Constructing one-step and limiting fuzzy transition probabilities for finite Markov chains
Authors: Robert M. Kleyle, Andre de Korvin
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1998)

In this paper a methodology for constructing one-step and limiting transition probabilities for fuzzy Markov chains is proposed. This method involves employing Dempster-Shafer type mass functions to construct transition probabilities for set-valued Markov chains in which the sets are subsets of the original state space. The relationship between the composition of mass functions via the Dempster-Shafer rule of combination and set-valued Markov chains is utilized to obtain these transition probabilities. Limiting transition probabilities make use of a limit theorem for the infinite composition of homogeneous mass functions. These set-valued transition probabilities are then converted into transition probabilities on the original state space. Since more than one sequence of mass functions can be under consideration with varying degrees of certitude, the resulting transition probabilities are typically fuzzy sets.
Mobile multimodal applications on mass-market devices: experiences
Authors: Giovanni Frattini, Francesco Gaudino, Vladimiro Scotto di Carlo
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Multimodality on mobile terminals has been relegated to very high-end terminals, not spread among normal people. Nevertheless, the evolution of the technologies allows a deployment of synergic multimodal application on smartphones. We have studied how it is possible to build multimodal clients on mobile handsets, using an innovative approach based on what we have called multimodal objects, trying to explore limitations and constraints of the J2ME programming environment. We report in this paper our experience and the results of our research.
Collaborative assignment using belief-desire-intention agent modeling and negotiation with speedup strategies
Authors: Kiam Tian Seow, Kwang Mong Sim
Venue: Information Sciences: an International Journal (2008)

In this paper, we propose a distributed agent model that applies belief-desire-intention (BDI) reasoning and negotiation for addressing the linear assignment problem (LAP) collaboratively. In resource allocation, LAP is viewed as seeking a concurrent allocation of one different resource for every task to optimize a linear sum objective function. The proposed model provides a basic agent-based foundation needed for efficient resource allocation in a distributed environment. A distributed agent algorithm that has been developed based on the BDI negotiation model is examined both analytically and experimentally. To improve performance in terms of average negotiation speed and solution quality, two initialization heuristics and two different reasoning control strategies are applied, with the latter yielding different variants of the basic algorithm. Extensive simulations suggest that all the heuristic-algorithm combinations can produce a near optimal solution soon enough in some specific sense. The significance and applicability of the research work are also discussed.
Research on Steganalysis for Text Steganography Based on Font Format
Authors: Lingyun Xiang, Xingming Sun, Gang Luo, Can Gan
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

In the research area of text steganography, algorithms based on font format have advantages of great capacity, good imperceptibility and wide application range. However, little work on steganalysis for such algorithms has been reported in the literature. Based on the fact that the statistic features of font format will be changed after using font-format-based steganographic algorithms, we present a novel Support Vector Machine-based steganalysis algorithm to detect whether hidden information exists or not. This algorithm can not only effectively detect the existence of hidden information, but also estimate the hidden information length according to variations of font attribute value. As shown by experimental results, the detection accuracy of our algorithm reaches as high as 99.3% when the hidden information length is at least 16 bits.
Compact and efficient generation of radiance transfer for dynamically articulated characters
Authors: Derek Nowrouzezahrai, Patricio Simari, Evangelos Kalogerakis, Karan Singh, Eugene Fiume
Venue: Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia (2007)

We present a data-driven technique for generating the precomputed radiance transfer vectors of an animated character as a function of its joint angles. We learn a linear model for generating real-time lighting effects on articulated characters while capturing soft self-shadows caused by dynamic distant lighting. Indirect illumination can also be reproduced using our framework. Previous data-driven techniques have either restricted the type of lighting response (generating only ambient occlusion), the type of animated sequences (response functions to external forces) or have complicated runtime algorithms and incur non-trivial memory costs. We provide insights into the dimensionality reduction of the pose and coefficient spaces. Our model can be fit quickly as a preprocess, is very compact (~1 MB) and runtime transfer vectors are generated using a simple algorithm in real-time (> 100 Hz using a CPU-only implementation.) We can reproduce lighting effects on hundreds of trained poses using less memory than required to store a single mesh's PRT coefficients. Moreover, our model extrapolates to produce smooth, believable lighting results on novel poses and our method can be easily integrated into existing interactive content pipelines.
Distributed change-point detection of DDoS attacks: experimental results on DETER testbed
Authors: Yu Chen, Kai Hwang, Wei-Shinn Ku
Venue: Proceedings of the DETER Community Workshop on Cyber Security Experimentation and Test on DETER Community Workshop on Cyber Security Experimentation and Test 2007 (2007)

It is highly desired to detect the DDoS flooding attacks at an early stage in order to launch effective countermeasures timely. We have developed a distributed change-point detection scheme to detect flooding type DDoS attacks over multiple network domains. The approach is to monitor the spatiotemporal pattern of the attack traffic. We have simulated the new defense system on the DETER testbed. The new scheme is proven scalable to cover hundreds of ISP-controlled network domains. With 4 network domains working collaboratively, we achieved on the DETER testbed a 98% detection rate with less than 1% false alarms.