ppxscal/embedding_network huggingface dataset:
Evolving intelligent musical materials
Authors: Fred Lerdahl
Venue:  (2003)

For Evolving Intelligent Musical Materials, I have designed and implemented a software based algorithm which employs techniques and concepts drawn from artificial life and artificial intelligence for the generative composition of music. The work involves computational modeling of a musical system, theoretical work with regard to the quantifying of musical features, and creative work including the exploration of computer assisted composition, generative art, and my artistic interests. The end product of this dissertation project is a genetic algorithm that is capable of generating musical works which exhibit features in accordance with my specified musical and aesthetic goals.
Automatic Identification of Text Genres and Their Roles in Subject-Based Categorization
Authors: Yong-Bae Lee, Sung Hyon Myaeng
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 4 - Volume 4 (2004)

Genre characterizes text differently than the usual subject or prepositional content that has been the focus of most information retrieval and classification research. We developed a newmethod for automatic genre classification that is based on statistically selected features obtained from both subject-classified and genre-classified training data. The main idea of the genre classification method is to calculate the weight of a feature for a genre class by using itsfrequency statistics for subject classifications. Having observed that the deviation formula anddiscrimination formula using document frequency ratios work as expected, we went on to study the roles of various types of features such as content-bearing words, function words,morphemes, and punctuations marks. In the first part of this paper, we present some of ourfindings in the roles of the feature types for genre classification, with a brief discussion of the genre-based classification. The genre classes we used are those often found in Web documents: accident reportages, newspaper editorials, personal homepages, product reviews,product specifications, research articles, and Q&A's. The second part of the paper addresses the issue of how text genres help classifying documents based on the subject content of documents. This is a corollary to our original hypothesis that subject classification would help identifying the genre class of a document automatically. Our experimental work shows that while subject classes clearly help improving the genre-based classification, it is not clear whether using the genre class information for documents in the same way helps subject-based classification. However, we found that training a subject classifier with a set of documents belonging to a particular genre class improves subject-based classification.
The FSR-255 family of hash functions with a variable length of hash result
Authors: Tadeusz Gajewski, Izabela Janicka-Lipska, Janusz Stokłosa
Venue: Artificial intelligence and security in computing systems (2003)

In the paper a family of cryptographic hash functions with a variable length of hash result, called the FSR-255 family, is presented. The hash functions are defined by some processing structures based on seventeen 15-stage nonlinear feedback shift registers. The feedback functions can be modified by the user to customize the hash function. An algorithm for computing the hash result of length r≤255 is given. It was successfully tested against the birthday attack: no collisions have been found. The FSR-255 family hardware implementation is presented at the level of logical structure. The circuit is designed for implementing as a full custom ASIC, and is optimized to increase the processing rate. The device is capable of working on-line, and can be customized by the user.
A New Look at Proper Orthogonal Decomposition
Authors: Muruhan Rathinam, Linda R. Petzold
Venue: SIAM Journal on Numerical Analysis (2003)

We investigate some basic properties of the proper orthogonal decomposition (POD) method as it is applied to data compression and model reduction of finite dimensional nonlinear systems. First we provide an analysis of the errors involved in solving a nonlinear ODE initial value problem using a POD reduced order model. Then we study the effects of small perturbations in the ensemble of data from which the POD reduced order model is constructed on the reduced order model. We explain why in some applications this sensitivity is a concern while in others it is not. We also provide an analysis of computational complexity of solving an ODE initial value problem and study the computational savings obtained by using a POD reduced order model. We provide several examples to illustrate our theoretical results.
Aggregate Social Discount Rate Derived from Individual Discount Rates
Authors: Kenneth F. Reinschmidt
Venue: Management Science (2002)

In the economic evaluation of large public-sector projects, an aggregate social discount rate may be used in present worth comparison of alternatives. This paper uses the assumptions that individual discount rates are constant over time and approximately Normally distributed across the affected population, with meanÂµ and variances2, to derive an aggregate discount function that is exponential in form but with time-dependent aggregate discount rate?( t) =Âµ -s2t/2, wheret is the time of occurrence of the cost or benefit. This equation agrees with numerical simulations. Ifs2 > 0, then the aggregate discount rate is less than the mean individual discount rate, and use of the time-dependent aggregate discount rate?( t) =Âµ -s2t/2 instead of the constant discount factor?( t) =Âµ would result in larger discounted present values for public-sector projects for which the benefits lie far in the future. This could mean that public-sector investments that would be rejected under the assumption?( t) =Âµ might be justified using the time-dependent aggregate discount rate?( t) =Âµ -s2t/2.
Modeling location-based services with subject spaces
Authors: Hubert Ka Yau Leung, Ioana Burcea, Hans-Amo Jacobsen
Venue: Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research (2003)

The advance in wireless networks and in positioning systems has led to the development of a new generation of mobile applications: location-based services (LBS). LBS offer highly personalized services to users of mobile devices such as telephones, pagers, and PDAs (mobile users) based on their locations, user profiles and context information. The publish/subscribe paradigm is an information dissemination model for loosely-coupled distributed applications, and is appropriate for the implementation of LBS. However, existing publish/subscribe data models and algorithms have limitations when applied to LBS. In this paper, we show how Subject Spaces -- a state persistent publish/subscribe model -- can be used to model LBS and overcome the limitations of traditional publish/subscribe systems.
Web metasearch: rank vs. score based rank aggregation methods
Authors: M. Elena Renda, Umberto Straccia
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Given a set of rankings, the task of ranking fusion is the problem of combining these lists in such a way to optimize the performance of the combination. The ranking fusion problem is encountered in many situations and, e.g., metasearch is a prominent one. It deals with the problem of combining the result lists returned by multiple search engines in response to a given query, where each item in a result list is ordered with respect to a search engine and a relevance score. Several ranking fusion methods have been proposed in the literature. They can be classified based on whether: (i) they rely on the rank; (ii) they rely on the score; and (iii) they require training data or not. Our paper will make the following contributions: (i) we will report experimental results for the Markov chain rank based methods, for which no large experimental tests have yet been made; (ii) while it is believed that the rank based method, named Borda Count, is competitive with score based methods, we will show that this is not true for metasearch; and (iii) we will show that Markov chain based methods compete with score based methods. This is especially important in the context of metasearch as scores are usually not available from the search engines.
wEBMT: developing and validating an example-based machine translation system using the world wide web
Authors: Andy Way, Nano Gough
Venue: Computational Linguistics (2003)

We have developed an example-based machine translation (EBMT) system that uses the World Wide Web for two different purposes: First, we populate the system's memory with translations gathered from rule-based MT systems located on the Web. The source strings input to these systems were extracted automatically from an extremely small subset of the rule types in the Penn-II Treebank. In subsequent stages, the 〈source, target〉 translation pairs obtained are automatically transformed into a series of resources that render the translation process more successful. Despite the fact that the output from on-line MT systems is often faulty, we demonstrate in a number of experiments that when used to seed the memories of an EBMT system, they can in fact prove useful in generating translations of high quality in a robust fashion. In addition, we demonstrate the relative gain of EBMT in comparison to on-line systems. Second, despite the perception that the documents available on the Web are of questionable quality, we demonstrate in contrast that such resources are extremely useful in automatically postediting translation candidates proposed by our system.
A redundant digit floating point system
Authors: Michael J. Flynn
Venue:  (2003)

Arithmetic operations are among the most basic instructions in microprocessors, digital signal processors and graphics accelerators. Addition is the most frequent arithmetic operation in numerically intensive applications. Multiplication follows closely and then division and other elementary functions. The speed of those arithmetic operations is also often directly linked to the overall performance of the computers. The work presented in this thesis proposes several techniques to improve the effectiveness of floating point arithmetic units. A partially redundant number system is used as an internal format for floating point arithmetic operations. The redundant number system is based on signed digits and enables carry free arithmetic operations to improve the performance. Conversion from the proposed internal format back to the standard IEEE format is done only when an operand is written to memory. A detailed discussion of an adder and a multiplier using the proposed format is presented and the specific challenges of the designs are explained. Beside the redundancy, the proposed units include further enhancements that increase the floating point performance such as a hexadecimal based number format and a postponed rounding technique. A time delay model is developed and applied to analytically predict the performance of the floating point units. The predicted delays are then compared to state-of-the-art designs. The comparison is done over a range of operand widths, fan-in and radices to show the merits of each implementation. The proposed system achieves better performance for double precision and larger operand width. Transistor simulation of the complete adder and multiplier confirm the performance advantage predicted by the analytical model. A brief description of a divider using; the proposed format is also presented. The proposed internal format and arithmetic units comply with all the rounding modes of the IEEE 754 floating point standard.
Design Methodology for a Tightly Coupled VLIW/Reconfigurable Matrix Architecture: A Case Study
Authors: Bingfeng Mei, Serge Vernalde, Diederik Verkest, Rudy Lauwereins
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

Coarse-grained reconfigurable architectures have seen growing importance recently. Design tools and methodology are essential to their success. Based on our previous work on modulo scheduling algorithms and a novel architecture with tightly coupled VLIW/reconfigurable matrix, we present a C-based design flow using an MPEG-2 decoder as a design example. The application is mapped to the architecture in less than one person-week starting from a software implementation. The kernel and overall speedup over the reference VLIW are 4.84 and 3.05 respectively. The case study shows that our methodology and architecture can deliver a competitive package in terms of design efforts and performance over other programmable architectures.
Scalability and efficiency in multi-relational data mining
Authors: Hendrik Blockeel, Michèle Sebag
Venue: ACM SIGKDD Explorations Newsletter (2003)

Efficiency and Scalability have always been important concerns in the field of data mining, and are even more so in the multi-relational context, which is inherently more complex. The issue has been receiving an increasing amount of attention during the last few years, and quite a number of theoretical results, algorithms and implementations have been presented that explicitly aim at improving the efficiency and Scalability of multi-relational data mining approaches. With this article we attempt to present a structured overview.
A characteristic-wise hybrid compact-WENO scheme for solving hyperbolic conservation laws
Authors: Yu-Xin Ren, Miao'er Liu, Hanxin Zhang
Venue: Journal of Computational Physics (2003)

This paper presents a fifth-order conservative hybrid compact-WENO scheme for shock-capturing calculation. The hybrid scheme is considered as the weighted average of two sub-schemes: the conservative compact scheme proposed by Pirozzoli and the WENO scheme. The weight function is designed so that the abrupt transition from one sub-scheme to another is avoided and the resulting hybrid scheme is essentially oscillation free near the flow discontinuities. A Roe type, characteristic-wise finite difference scheme is proposed which generalizes the hybrid scheme for the scalar equation to the system of conservation laws. Several test cases are presented to validate the proposed scheme.
A Tool for Automatic Generation of RTL-Level VHDL Description of RNS FIR Filters
Authors: A. Del Re, A. Nannarelli, M. Re
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

Although digital filters based on the Residue Number System (RNS) show high performance and low power dissipation, RNS filters are not widely used in DSP systems, because of the complexity of the algorithms involved. We present a tool to design RNS FIR filters which hides the RNS algorithms to the designer, and generates a synthesizable VHDL description of the filter taking into account several design constraints such as: delay, area and energy.
Merlot: a tool for analysis of real-time specifications
Authors: Carlo Bellettini, Miguel Felder, Mauro Pezzè
Venue: Proceedings of the 7th international workshop on Software specification and design (1993)

Real-time systems are becoming increasingly important in the everyday life. The use of such systems for critical applications requires tools and techniques for increasing correctness and reliability of the final product. In this paper, we describe a toolset (Merlot) for analyzing real-time system specifications. Merlot allows the automatic verification of temporal properties for a large set of specifications and requires the interaction with the user only when the complexity of the specification overcomes a reasonable automatable level. Merlot has been built with the aim of verifying both the feasibility of the approach and the applicability of the analysis techniques to real problems, that is to identify classes of problems that can be analyzed with little or no interaction with the user in a reasonable amount of time.
Securing Java through software watermarking
Authors: D. Curran, N. J. Hurley, M. Ó Cinnéide
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

An important advantage of Java is its portability due to its use of bytecode. However the use of bytecode allows decompilation of Java programs to gain access to their source code. This makes it easier to pirate Java programs, infringing their copyright. This is a disadvantage of Java in comparison with programming languages that compile to native object code.Software watermarking is a relatively new approach to the problem of copyright protection that involves embedding ownership information in an executable program. Watermarking has been extensively researched in the context of multimedia and significant progress has been made toward the development of robust and secure techniques. In this paper we investigate a new software watermarking scheme. This is derived from signal detection theory which is used in multimedia watermarking.
Involving young girls in product concept design
Authors: Minna Isomursu, Pekka Isomursu, Kaisa Still
Venue: Proceedings of the 2003 conference on Universal usability (2003)

Young girls are a user group often neglected in the design of technical devices. In this paper, we describe a method for involving pre-teen and teen girls in a concept design process. With this target group we have experienced serious challenges in applying traditional participatory design methods, such as observations or interviews. As a solution, we have adopted a web-based storytelling environment where our target group is encouraged to create usage scenarios of a mobile terminal that would support their activities in a virtual community. Our results show that this approach is a very natural and fruitful method for involving this target group.
Optimal Sequential and Parallel Algorithms to Compute All Cut Vertices on Trapezoid Graphs
Authors: Mrinmoy Hota, Madhumangal Pal, Tapan K. Pal
Venue: Computational Optimization and Applications (2004)

In this paper, a sequential algorithm is presented to find all cut-vertices on trapezoid graphs. To every trapezoid graph G there is a corresponding trapezoid representation. If all the 4n corner points of n trapezoids, in a trapezoid representation of a trapezoid graph G with n vertices, are given, then the proposed sequential algorithm runs in O(n) time. Parallel implementation of this algorithm can be done in O(log n) time using O(n/ log n) processors on an EREW PRAM model.
Information-Theoretic Competitive Learning with Inverse Euclidean Distance Output Units
Authors: Ryotaro Kamimura
Venue: Neural Processing Letters (2003)

In this paper, we propose a new information theoretic competitive learning method. We first construct a learning method in single-layered networks, and then we extend it to supervised multi-layered networks. Competitive unit outputs are computed by the inverse of Euclidean distance between input patterns and connection weights. As distance is smaller, competitive unit outputs are stronger. In realizing competition, neither the winner-take-all algorithm nor the lateral inhibition is used. Instead, the new method is based upon mutual information maximization between input patterns and competitive units. In maximizing mutual information, the entropy of competitive units is increased as much as possible. This means that all competitive units must equally be used in our framework. Thus, no under-utilized neurons or dead neurons are generated. When using multi-layered networks, we can improve noise-tolerance performance by unifying information maximization and minimization. We applied our method with single-layered networks to a simple artificial data problem and an actual road classification problem. In both cases, experimental results confirmed that the new method can produce the final solutions almost independently of initial conditions, and classification performance is significantly improved. Then, we used multi-layered networks, and applied them to a character recognition problem and a political data analysis. In these problem, we could show that noise-tolerance performance was improved by decreasing information content on input patterns to certain points.
Case study: visualization of an electric power transmission system
Authors: Pramod M. Mahadev, Richard D. Christie
Venue: Proceedings of the conference on Visualization '94 (1994)

Visualization techniques are applied to an electric power system transmission network to create a graphical picture of network power flows and voltages. A geographic data map is used. Apparent power flow is encoded as the width of an arrow, with direction from real power flow. Flows are superposed on flow limits. Contour plots and color coding failed for representing bus voltages. A two-color thermometer encoding worked well. The resulting visualization is a significant improvement over current user interface practice in the power industry.
Automatic Recognition of a Baby Gesture
Authors: Jigna Bhatt, Niels Da Vitoria Lobo, Mubarak Shah, George Bebis
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

We discuss and present a computer vision system that monitors a sitting baby of ages of 6 months old to one-year-old. The system tracks a baby's mouth and hands and alarms the guardians if it finds some objects in the baby's hand going towards his or her mouth. We useskin detection, grayscale based Sum of Square Differences (SSD) and template matching for tracking the hands and the head of a baby.
Balances for fixed points of primitive substitutions
Authors: Boris Adamczewski
Venue: Theoretical Computer Science (2003)

An infinite word defined over a finite alphabet A is balanced if for any pair (ω,ω') of factors of the same length and for any letter a in the alphabet ||ω|a - |ω'|a| ≤ 1, where |ω|a denotes the number of occurrences of the letter a in the word ω. In this paper, we generalize this notion and introduce a measure of balance for an infinite sequence. In the case of fixed points of primitive substitutions, we show that the asymptotic behaviour of this measure is in part ruled by the spectrum of the incidence matrix associated with the substitution. Connections with frequencies of letters and other balance properties are also discussed.
PEARL: an interactive system for the preparation and validation of structured programs
Authors: R. A. Snowdon
Venue: ACM SIGPLAN Notices (1972)

The PEARL system is an attempt to provide an environment for the writing of correct programs. Facilities are provided for the construction and filing of structured programs, whilst techniques have been developed for the inclusion of assertions involving abstract operations and data types. As a result, programs, possibly incomplete, can be compiled and executed, any error communication with the programmer being in terms of the appropriate level of his source program.
Combining state and model-based approaches for mobile agent load balancing
Authors: Christos Georgousopoulos, Omer F. Rana
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

An approach for dynamic load balancing of mobile agents is described. We demonstrate this approach for a multi-agent system operating on an active digital library composed of multi-spectral images of the Earth, as part of the Synthetic Aperture Radar Atlas (SARA)[25]. In the proposed architecture specialized stationary agents are used to gather system state information and make decisions on the distribution of mobile agents among the servers. Our approach is based on a combination of a state and model-based approaches to load balancing.