An experiment comparing the effectiveness of the all-uses and all-edges test data adequacy criteria was performed. The experiment was designed so as to overcome some of the deficiencies of previous software testing experiments. A large number of test sets was randomly generated for each of nine subject programs with subtle errors. For each test set, the percentages of executable edges and definition-use associations covered were measured and it was determined whether the test set exposed an error. Hypothesis testing was used to investigate whether all-uses adequate test sets are more likely to expose errors than are all-edges adequate test sets. All-uses was significantly more effective than all-edges for five of the subjects, and appeared guaranteed to detect the error in four of them. Further analysis showed that in four of these subjects, all-uses-adequate test sets were more effective than all-edges-adequate test sets of similar size. Logistic regression analysis was used to investigate whether the probability that a test set exposes an error increases as the percentage of definition-use associations or edges covered by it increases. The evidence did not strongly support this conjecture. Error exposing ability was shown to be strongly positively correlated to percentage of covered definition-use associations in only four of the nine subjects. Error exposing ability was also shown to be positively correlated to the percentage of covered edges in four (different) subjects, but the relationship was weaker. Author's address: Computer Science Dept., Polytechnic University, 6 Metrotech Center, Brooklyn, N.Y. 11201. E-mail: pfrankl@poly.edu. Supported in part by NSF Grants CCR-8810287 and CCR9206910 and by the New York State Science and Technology Founda...

Abstract not found

We examine a generalization of the concept of Feistel networks, which we call Unbalanced Feistel Networks (UFNs). Like conventional Feistel networks, UFNs consist of a series of rounds in which one part of the block operates on the rest of the block. However, in a UFN the two parts need not be of equal size. Removing this limitation on Feistel networks has interesting implications for designing ciphers secure against linear and differential attacks. We describe UFNs and a terminology for discussing their properties, present and analyze some UFN constructions, and make some initial observations about their security. It is notable that almost all the proposed ciphers that are based on Feistel networks follow the same design construction: half the bits operate on the other half. There is no inherent reason that this should be so; as we will demonstrate, it is possible to design Feistel networks across a much wider, richer design space. In this paper, we examine the nature of the...

The effectiveness of a test data adequacy criterion for a given program and specification is the probability that a test set satisfying the criterion will expose a fault. Experiments were performed to compare the effectiveness of the mutation testing and all-uses test data adequacy criteria at various coverage levels, for randomly generated test sets. Large numbers of test sets were generated and executed, and for each, the proportion of mutants killed or def-use associations covered was measured. This data was used to estimate and compare the effectiveness of the criteria. The results were mixed: at the highest coverage levels considered, mutation was more effective than all-uses for five of the nine subjects, all-uses was more effective than mutation for two subjects, and there was no clear winner for two subjects. However, mutation testing was much more expensive than all-uses. The relationship between coverage and effectiveness for fixed-sized test sets was also explored and was fo...

Abstract. This paper considers the use of randomly generated directed graphs as neighborhoods for particle swarm optimizers (PSO) using fully informed particles (FIPS), together with dynamic changes to the graph during an algorithm run as a diversity-preserving measure. Different graph sizes, constructed with a uniform out-degree were studied with regard to their effect on the performance of the PSO on optimization problems. Comparisons were made with a static random method, as well as with several canonical PSO and FIPS methods. The results indicate that under appropriate parameter settings, the use of random directed graphs with a probabilistic disruptive re-structuring of the graph produces the best results on the test functions considered. 1

. We present a methodology that enables the use of classification algorithms on regression tasks. We implement this method in system RECLA that transforms a regression problem into a classification one and then uses an existent classification system to solve this new problem. The transformation consists of mapping a continuous variable into an ordinal variable by grouping its values into an appropriate set of intervals. We use misclassification costs as a means to reflect the implicit ordering among the ordinal values of the new variable. We describe a set of alternative discretization methods and, based on our experimental results, justify the need for a search-based approach to choose the best method. Our experimental results confirm the validity of our search-based approach to class discretization, and reveal the accuracy benefits of adding misclassification costs. Keywords : Regression, Classification, Discretization methods. 1 Introduction Machine learning (ML) researchers have...

Various efforts have been made for the development of tools and methods dedicated to the automatic processing of multilingual terminology databases. For that purpose, multilingual parallel corpora have been used as a basis resource. However, most of the neologisms in technical and scientific domains are realised by multiword terms that are rarely identified in parallel corpora. In this paper, we propose the normalisation of the IJS-ELAN Slovene-English parallel corpus by using the language-independent SENTA software. 1 Introduction The need for multilingual terminology resources has become particularly acute owing to the globalization of scientific and technical exchanges and the concurrent development of international communication networks. As a consequence, various efforts have been made for the development of tools and methods dedicated to the automatic processing of multilingual terminology databases. For that purpose, multilingual parallel corpora have been used as a...

The acquisition of multiword terms from large text collections is a fundamental issue in the context of Information Retrieval. Indeed, their identification leads to improvements in the indexing process and allows guiding the user in his search for information. In this paper, we present an original methodology that allows extracting multiword terms by either (1) exclusively considering statistical word regularities or by (2) combining word statistics with endogenously acquired linguistic information. For that purpose, we conjugate a new association measure called the Mutual Expectation with a new acquisition process called the LocalMaxs. On one hand, the Mutual Expectation, based on the concept of Normalised Expectation, evaluates the degree of cohesiveness that links together all the textual units contained in an n-gram (i.e. "n, n 2). On the other hand, the LocalMaxs retrieves the candidate terms from the set of all the valued n-grams by evidencing local maxima of association measure...

Landslides mapped in 14 watershed analyses in Oregon and Washington provide a regional test of a model for shallow landsliding. A total of 3224 landslides were mapped in watersheds covering 2993 km 2 and underlain by a variety of lithologies, including Tertiary sedimentary rocks of the Coast Ranges, volcanic rocks of the Cascade Range and Quaternary glacial sediments in the Puget Lowlands. GIS (geographical information system) techniques were used to register each mapped landslide to critical rainfall values predicted from a theoretical model for the topographic control on shallow landsliding using 30 m DEMs (digital elevation models). A single set of parameter values appropriate for simulating slide hazards after forest clearing was used for all watersheds to assess the regional in¯uence of topographic controls on shallow landsliding. Model performance varied widely between watersheds, with the best performance generally in steep watersheds underlain by shallow bedrock and the worst performance in generally low gradient watersheds underlain by thick glacial deposits. Landslide frequency (slides/km 2) varied between physiographic provinces but yielded consistent patterns of higher slide frequency in areas with lower critical rainfall values. Simulations with variable e€ective cohesion predicted that high root strength e€ectively limits shallow landsliding to topographic hollows with deep soils and locations that experience excess pore pressures, but that low root strength leads to higher probabilities of failure across a greater proportion of the landscape. # 1998 John Wiley & Sons, Ltd. KEY WORDS landslides; GIS; model testing, forest management

: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : xiii 1. INTRODUCTION : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 2. BACKGROUND AND RELATED WORK : : : : : : : : : : : : : : : : : : 7 2.1 Basic Concepts in Heterogeneous Computing : : : : : : : : : : : : : : 7 2.2 Mapping, Matching, and Scheduling : : : : : : : : : : : : : : : : : : : 10 2.3 Characterizing Matching and Scheduling for HC Systems : : : : : : : 11 2.4 Examples of Techniques and Formulations for Matching and Scheduling for HC Systems : : : : : : : : : : : : : : 12 2.4.1 Block-based SIMD/SPMD mode selection technique and its extension : : : : : : : : : : : : : : : : : : : : : : : : : 12 2.4.2 Optimal selection theory and its extensions : : : : : : : : : : : 18 2.4.3 Other formulations and solution techniques : : : : : : : : : : : 23 2.5 Summary and Motivation for Proposed Work : : : : : : : : : : : : : : 25 3. PROBABILITY DEFINITIONS AND NOTATIONS USED : : : : : : : : 27 3.1 Definiti...