Добірка наукової літератури з теми "OPTIMAL TEST SUITES"

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "OPTIMAL TEST SUITES".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "OPTIMAL TEST SUITES"

1

Gladston, Angelin, and Niranjana Devi N. "Optimal Test Case Selection Using Ant Colony and Rough Sets." International Journal of Applied Evolutionary Computation 11, no. 2 (April 2020): 1–14. http://dx.doi.org/10.4018/ijaec.2020040101.

Повний текст джерела
Анотація:
Test case selection helps in improving quality of test suites by removing ambiguous, redundant test cases, thereby reducing the cost of software testing. Various works carried out have chosen test cases based on single parameter and optimized the test cases using single objective employing single strategies. In this article, a parameter selection technique is combined with an optimization technique for optimizing the selection of test cases. A two-step approach has been employed. In first step, the fuzzy entropy-based filtration is used for test case fitness evaluation and selection. In second step, the improvised ant colony optimization is employed to select test cases from the previously reduced test suite. The experimental evaluation using coverage parameters namely, average percentage statement coverage and average percentage decision coverage along with suite size reduction, demonstrate that by using this proposed approach, test suite size can be reduced, reducing further the computational effort incurred.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Hasan, Imad H., Bestoun S. Ahmed, Moayad Y. Potrus, and Kamal Z. Zamli. "Generation and Application of Constrained Interaction Test Suites Using Base Forbidden Tuples with a Mixed Neighborhood Tabu Search." International Journal of Software Engineering and Knowledge Engineering 30, no. 03 (March 2020): 363–98. http://dx.doi.org/10.1142/s0218194020500151.

Повний текст джерела
Анотація:
To ensure the quality of current highly configurable software systems, intensive testing is needed to test all the configuration combinations and detect all the possible faults. This task becomes more challenging for most modern software systems when constraints are given for the configurations. Here, intensive testing is almost impossible, especially considering the additional computation required to resolve the constraints during the test generation process. In addition, this testing process is exhaustive and time-consuming. Combinatorial interaction strategies can systematically reduce the number of test cases to construct a minimal test suite without affecting the effectiveness of the tests. This paper presents a new efficient search-based strategy to generate constrained interaction test suites to cover all possible combinations. The paper also shows a new application of constrained interaction testing in software fault searches. The proposed strategy initially generates the set of all possible [Formula: see text]-[Formula: see text] combinations; then, it filters out the set by removing the forbidden [Formula: see text]-[Formula: see text] using the Base Forbidden Tuple (BFT) approach. The strategy also utilizes a mixed neighborhood tabu search (TS) to construct optimal or near-optimal constrained test suites. The efficiency of the proposed method is evaluated through a comparison against two well-known state-of-the-art tools. The evaluation consists of three sets of experiments for 35 standard benchmarks. Additionally, the effectiveness and quality of the results are assessed using a real-world case study. Experimental results show that the proposed strategy outperforms one of the competitive strategies, ACTS, for approximately 83% of the benchmarks and achieves similar results to CASA for 65% of the benchmarks when the interaction strength is 2. For an interaction strength of 3, the proposed method outperforms other competitive strategies for approximately 60% and 42% of the benchmarks. The proposed strategy can also generate constrained interaction test suites for an interaction strength of 4, which is not possible for many strategies. The real-world case study shows that the generated test suites can effectively detect injected faults using mutation testing.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Sugave, Shounak Rushikesh, Yogesh R. Kulkarni, and Balaso. "Multi-Objective Optimization Model and Hierarchical Attention Networks for Mutation Testing." International Journal of Swarm Intelligence Research 14, no. 1 (March 9, 2023): 1–23. http://dx.doi.org/10.4018/ijsir.319714.

Повний текст джерела
Анотація:
Mutation testing is devised for measuring test suite adequacy by identifying the artificially induced faults in software. This paper presents a novel approach by considering multiobjectives-based optimization. Here, the optimal test suite generation is performed using the proposed water cycle water wave optimization (WCWWO). The best test suites are generated by satisfying the multi-objective factors, such as time of execution, test suite size, mutant score, and mutant reduction rate. The WCWWO is devised by a combination of the water cycle algorithm (WCA) and water wave optimization (WWO). The hierarchical attention network (HAN) is used for classifying the equivalent mutants by utilizing the MutPy tool. Furthermore, the performance of the developed WCWWO+HAN is evaluated in terms of three metrics—mutant score (MS), mutant reduction rate (MRR), and fitness—with the maximal MS of 0.585, higher MRR of 0.397, and maximum fitness of 0.652.
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Diniz, Thomaz, Everton L. G. Alves, Anderson G. F. Silva, and Wilkerson L. Andrade. "Reducing the Discard of MBT Test Cases." Journal of Software Engineering Research and Development 8 (August 15, 2020): 4–1. http://dx.doi.org/10.5753/jserd.2020.602.

Повний текст джерела
Анотація:
Model-Based Testing (MBT) is used for generating test suites from system models. However, as software evolves, its models tend to be updated, which may lead to obsolete test cases that are often discarded. Test case discard can be very costly since essential data, such as execution history, are lost. In this paper, we investigate the use of distance functions and machine learning to help to reduce the discard of MBT tests. First, we assess the problem of managing MBT suites in the context of agile industrial projects. Then, we propose two strategies to cope with this problem: (i) a pure distance function-based. An empirical study using industrial data and ten different distance functions showed that distance functions could be effective for identifying low impact edits that lead to test cases that can be updated with little effort. We also found the optimal configuration for each function. Moreover, we showed that, by using this strategy, one could reduce the discard of test cases by 9.53%; (ii) a strategy that combines machine learning with distance values. This strategy can classify the impact of edits in use case documents with accuracy above 80%; it was able to reduce the discard of test cases by 10.4% and to identify test cases that should, in fact, be discarded.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Fadhil, Heba Mohammed, Mohammed Najm Abdullah, and Mohammed Issam Younis. "TWGH: A Tripartite Whale–Gray Wolf–Harmony Algorithm to Minimize Combinatorial Test Suite Problem." Electronics 11, no. 18 (September 12, 2022): 2885. http://dx.doi.org/10.3390/electronics11182885.

Повний текст джерела
Анотація:
Today’s academics have a major hurdle in solving combinatorial problems in the actual world. It is nevertheless possible to use optimization techniques to find, design, and solve a genuine optimal solution to a particular problem, despite the limitations of the applied approach. A surge in interest in population-based optimization methodologies has spawned a plethora of new and improved approaches to a wide range of engineering problems. Optimizing test suites is a combinatorial testing challenge that has been demonstrated to be an extremely difficult combinatorial optimization limitation of the research. The authors have proposed an almost infallible method for selecting combinatorial test cases. It uses a hybrid whale–gray wolf optimization algorithm in conjunction with harmony search techniques. Test suite size was significantly reduced using the proposed approach, as shown by the analysis of the results. In order to assess the quality, speed, and scalability of TWGH, experiments were carried out on a set of well-known benchmarks. It was shown in tests that the proposed strategy has a good overall strong reputation test reduction size and could be used to improve performance. Compared with well-known optimization-based strategies, TWGH gives competitive results and supports high combinations (2 ≤ t ≤12).
Стилі APA, Harvard, Vancouver, ISO та ін.
6

He, Hongmei, Ana Sălăgean, Erkki Mäkinen, and Imrich Vrt’o. "Various heuristic algorithms to minimise the two-page crossing numbers of graphs." Open Computer Science 5, no. 1 (August 13, 2015): 22–40. http://dx.doi.org/10.1515/comp-2015-0004.

Повний текст джерела
Анотація:
AbstractWe propose several new heuristics for the twopage book crossing problem, which are based on recent algorithms for the corresponding one-page problem. Especially, the neural network model for edge allocation is combined for the first time with various one-page algorithms. We investigate the performance of the new heuristics by testing them on various benchmark test suites. It is found out that the new heuristics outperform the previously known heuristics and produce good approximations of the planar crossing number for severalwell-known graph families. We conjecture that the optimal two-page drawing of a graph represents the planar drawing of the graph.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

De Groff, Dolores, Roxana Melendez, Perambur Neelakanta, and Hajar Akif. "Optimal Electric-Power Distribution and Load-Sharing on Smart-Grids: Analysis by Artificial Neural Network." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 18 (January 24, 2019): 7431–39. http://dx.doi.org/10.24297/ijct.v18i0.8059.

Повний текст джерела
Анотація:
This study refers to developing an electric-power distribution system with optimal/suboptimal load-sharing in the complex and expanding metro power-grid infrastructure. That is, the relevant exercise is to indicate a smart forecasting strategy on optimal/suboptimal power-distribution to consumers served by a smart-grid utility. An artificial neural network (ANN) is employed to model the said optimal power-distribution between generating sources and distribution centers. A compatible architecture of the test ANN with ad hoc suites of training/prediction schedules is indicated thereof. Pertinent exercise is to determine smartly the power supported on each transmission-line between generating to distribution-nodes. Further, a “smart” decision protocol prescribing the constraint that no transmission-line carries in excess of a desired load. An algorithm is developed to implement the prescribed constraint via the test ANN; and, each value of the load shared by each distribution-line (meeting the power-demand of the consumers) is elucidated from the ANN output. The test ANN includes the use of a traditional multilayer architecture with feed-forward and backpropagation techniques; and, a fast convergence algorithm (deduced in terms of eigenvalues of a Hessian matrix associated with the input data) is adopted. Further, a novel method based on information-theoretic heuristics (in Shannon’s sense) is invoked towards model specifications. Lastly, the study results are discussed with exemplified computations using appropriate field data.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Wang, Zhendong, Jianlan Wang, Dahai Li, and Donglin Zhu. "A Multi-Strategy Sparrow Search Algorithm with Selective Ensemble." Electronics 12, no. 11 (June 1, 2023): 2505. http://dx.doi.org/10.3390/electronics12112505.

Повний текст джерела
Анотація:
Aiming at the deficiencies of the sparrow search algorithm (SSA), such as being easily disturbed by the local optimal and deficient optimization accuracy, a multi-strategy sparrow search algorithm with selective ensemble (MSESSA) is proposed. Firstly, three novel strategies in the strategy pool are proposed: variable logarithmic spiral saltation learning enhances global search capability, neighborhood-guided learning accelerates local search convergence, and adaptive Gaussian random walk coordinates exploration and exploitation. Secondly, the idea of selective ensemble is adopted to select an appropriate strategy in the current stage with the aid of the priority roulette selection method. In addition, the modified boundary processing mechanism adjusts the transgressive sparrows’ locations. The random relocation method is for discoverers and alerters to conduct global search in a large range, and the relocation method based on the optimal and suboptimal of the population is for scroungers to conduct better local search. Finally, MSESSA is tested on CEC 2017 suites. The function test, Wilcoxon test, and ablation experiment results show that MSESSA achieves better comprehensive performance than 13 other advanced algorithms. In four engineering optimization problems, the stability, effectiveness, and superiority of MSESSA are systematically verified, which has significant advantages and can reduce the design cost.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Sung, Tien-Wen, Baohua Zhao, and Xin Zhang. "Quasi-Affine Transformation Evolutionary with Double Excellent Guidance." Wireless Communications and Mobile Computing 2021 (April 17, 2021): 1–15. http://dx.doi.org/10.1155/2021/5591543.

Повний текст джерела
Анотація:
The Quasi-Affine Transformation Evolutionary (QUATRE) algorithm is a swarm-based collaborative optimization algorithm, which has drawn attention from researchers due to its simple structure, easy implementation, and powerful performance. However, it needs to be improved regarding the exploration, especially in the late stage of evolution, and the problem of easy falling into a local optimal solution. This paper proposes an improved algorithm named Quasi-Affine Transformation Evolutionary with double excellent guidance (QUATRE-DEG). The algorithm uses not only the global optimal solution but also the global suboptimal solution to guide the individual evolution. We establish a model to determine the guiding force by the distance between the global optimal position and the suboptimal position and propose a new mutation strategy through the double population structure. The optimization of population structure and the improvement of operation mechanisms bring more exploration for the algorithm. To optimize the algorithm, the experiments on parameter settings were made to determine the size of the subpopulation and to achieve a balance between exploration and development. The performance of QUATRE-DEG algorithm is evaluated under CEC2013 and CEC2014 test suites. Through comparison and analysis with some ABC variants known for their strong exploration ability and advanced QUATRE variants, the competitiveness of the proposed QUATRE-DEG algorithm is validated.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Aggarwal, Sakshi, and Krishn K. Mishra. "Multi-operator Differential Evolution with MOEA/D for Solving Multi-objective Optimization Problems." Journal of Telecommunications and Information Technology 3, no. 2022 (September 29, 2022): 85–95. http://dx.doi.org/10.26636/jtit.2022.161822.

Повний текст джерела
Анотація:
In this paper, we propose a multi-operator differentia evolution variant that incorporates three diverse mutation strategies in MOEA/D. Instead of exploiting the local region, the proposed approach continues to search for optimal solutions in the entire objective space. It explicitly maintains diversity of the population by relying on the benefit of clustering. To promowe convergence, the solutions close to the ideal position, in the objective space are given preference in the evolutionary process. The core idea is to ensure diversity of the population by applying multiple mutation schemes and a faster convergence rate, giving preference to solutions based on their proximity to the ideal position in the MOEA/D paradigm. The performance of the proposed algorithm is evaluated by two popular test suites. The experimental results demonstrate that the proposed approach outperforms other MOEA/D algorithms.
Стилі APA, Harvard, Vancouver, ISO та ін.

Дисертації з теми "OPTIMAL TEST SUITES"

1

YADAV, TRILOCAAN. "MINIMIZING AND OPTIMIZING THE SOLUTION SPACE OF TEST DATA." Thesis, DELHI TECHNOLOGICAL UNIVERSITY, 2020. http://dspace.dtu.ac.in:8080/jspui/handle/repository/18828.

Повний текст джерела
Анотація:
In the software development lifecycle (SDL), testing of software is the most stressful and exhausting operation which consumes lots of time. Every aspect of software is very hard to test. Consequently, in recent times some automatic data generation research methods were added to reduce the time expended during the software testing. And the solution space of the automated generated test data is very large. It is not easy to check all the test data which is generated because it is time consuming, forces to check whole solution space of automated generated test data. We present in this paper demonstrating the design framework, implementing it and discovering the tool 's capabilities to minimize the test data generated. Our concrete concepts on the test cases for the optimal set is based on the mutation function Specified by the user. The system was implemented in language C++. We introduce mutation function to calculate mutant score with value and path to the test cases generated to minimize the solution space for the tester.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Lounis, Tewfik. "Inférences dans les modèles ARCH : tests localement asymptotiquement optimaux." Thesis, Université de Lorraine, 2015. http://www.theses.fr/2015LORR0222/document.

Повний текст джерела
Анотація:
L'objectif de cette thèse est la construction des tests localement et asymptotiquement optimaux. Le problème traité concerne un modèle qui contient une large classe de modèles de séries chronologiques. La propriété de la normalité asymptotique locale (LAN) est l'outil fondamental utilisé dans nos travaux de recherches. Une application de nos travaux en finance est proposée
The purpose of this phD thesis is the construction of alocally asymptotically optimal tests. In this testing problem, the considered model contains a large class of time series models. LAN property was the fundamental tools in our research works. Our results are applied in financial area
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Sundquist, Margareta. "Translating a text on the American Indian Wars: : A study of what kinds of adaption are required to make the TT suit the intended readers." Thesis, Linnéuniversitetet, Institutionen för språk och litteratur, SOL, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-12434.

Повний текст джерела
Анотація:
Abstract The aim of this essay is to find out what kinds of adaption are necessary when translating an English text from a specialist book into a text that will suit Swedish students in upper secondary school. In order to obtain the data needed for the study I translated a part of a chapter from the book North American Indian Wars by Richard H. Dillon. The analysis focuses on how to make the target text as clear and unambiguous as possible for the intended readers and what methods can be used to reach this aim. The analysis shows that one kind of adaption that had to be made during the translation process mainly consisted of additions and omissions. The additions were made in order to clarify certain passages in the source text that otherwise could have been difficult for the target readers to understand. The omissions, on the other hand, were often made due to the fact that some of the words or phrases in the source text are very specific and may refer to things that may be unknown to the target readers. In some cases such words or phrases could be omitted without making the target text lose any vital information, and in some cases they had to be exchanged with an explanation or a word that would be easier for the intended readers to understand. Apart from addition and omission of information, Vinay and Darbelnet’s procedures of modulation and equivalence were used in order to make the target text accessible to the target readers. The analysis shows that obligatory modulation had to be used due to differences in point of view between English and Swedish, whereas optional modulation was used to suit the target readers’ level of attainment. The analysis also shows that Vinay and Darbelnet’s procedure of equivalence was very useful when translating idioms, metaphors and similes in order to make the target text easy to understand for the target readers.
Стилі APA, Harvard, Vancouver, ISO та ін.

Частини книг з теми "OPTIMAL TEST SUITES"

1

Priyanka, Inderveer Chana, and Ajay Rana. "An Effective Approach to Build Optimal T-way Interaction Test Suites over Cloud Using Particle Swarm Optimization." In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 193–98. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-35615-5_28.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Kovács, Gábor, Gábor Árpád Németh, Mahadevan Subramaniam, and Zoltán Pap. "Optimal String Edit Distance Based Test Suite Reduction for SDL Specifications." In Lecture Notes in Computer Science, 82–97. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04554-7_6.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Kitamura, Takashi, Quentin Maissonneuve, Eun-Hye Choi, Cyrille Artho, and Angelo Gargantini. "Optimal Test Suite Generation for Modified Condition Decision Coverage Using SAT Solving." In Developments in Language Theory, 123–38. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-99130-6_9.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Shekhawat, Sonal, Arshad Iqbal, Usha Srinivsan, and Pratibha Menon. "Automation of MC/DC Coverage Test Case Suite Deploying the Optimal Strategic Choice for Tool Development." In ICT with Intelligent Applications, 433–43. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-4177-0_44.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Renato, Nazzini. "Part I Normative Foundations, 3 The Design of the Optimal Abuse Tests." In The Foundations of European Union Competition Law. Oxford University Press, 2011. http://dx.doi.org/10.1093/law-ocl/9780199226153.003.0003.

Повний текст джерела
Анотація:
This chapter examines the possible abuse tests applicable to exclusionary, exploitative, and discriminatory abuses. No single test for abuse of dominance is conceivable in theory and as a matter of enforcement policy. This does not mean, however, that the law is left without clear guiding principles so that competition law is in reality a set of ad hoc solutions perhaps suited to the facts of individual cases but devoid of any underpinning rationale. Exclusionary abuses may be assessed under tests of intent, the as efficient competitor test, and the consumer harm test. Meanwhile, exploitative abuses are clearly assessed under the consumer harm test. Beyond exclusionary and exploitative conduct, there may be a case for prohibiting discrimination on intermediate markets that distorts the competitive relationship between downstream buyers of the dominant firm. The hallmark of abusive discrimination is the impairment of the ability to compete of firms.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Gupta, Varun. "An Optimal Hybrid Regression Testing Approach Based on Code Path Pruning." In Multidisciplinary Approaches to Service-Oriented Engineering, 265–86. IGI Global, 2018. http://dx.doi.org/10.4018/978-1-5225-5951-1.ch013.

Повний текст джерела
Анотація:
Hybrid regression testing approaches involve the combinations of test suite selections, prioritizations, and minimizations. The hybrid approaches must reduce size of test suite to minimal level and enhance fault detection rate. The chapter proposes a new hybrid regression testing approach that reduces the number of test cases by reducing the paths of source code on the basis of the dependency between the statements and the changes. The proposed technique is evaluated to be better than the existing hybrid approach in terms of percentage savings in test cases and fault detection rate.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Sanseverino, Eleonora Riva, Gaetano Zizzo, and Giuseppe Fileccia Scimemi. "A New Meta-Heuristic Multi-Objective Approach For Optimal Dispatch of Dispersed and Renewable Generating Units in Power Distribution Systems." In Knowledge-Based Intelligent System Advancements, 162–81. IGI Global, 2011. http://dx.doi.org/10.4018/978-1-61692-811-7.ch009.

Повний текст джерела
Анотація:
The application of stochastic methods in engineering research and optimization has been increasing over the past few decades. Ant Colony Optimization, in particular, has been attracting growing attention as a promising approach both in discrete and continuous domains. The present work proposes a multi-objective Ant Colony Optimization for continuous domains showing good convergence properties and uniform coverage of the non-dominated front. These properties have been proved both with mathematical test functions and with a complex real world problem. Besides the second part of the chapter presents the application of the new algorithm to the problem of optimal dispatch of dispersed power generation units in modern electrical distribution networks. The issue is intrinsically multi-objective and the objectives are calculated based on the solution of the power load flow problem. The performances of the algorithm have been compared to those of the Non-dominated Sorting Genetic Algorithm II on all applications. The chapter is organized as follows, in the introductory part, the relevance of multi-objective optimization problems to modern power distribution operation is outlined. Then the Non-dominated Sorting Genetic Algorithm II is described as well as the proposed Multi-objective Ant Colony Optimization algorithm in details. Both approaches are compared on a test suite of mathematical test functions. Finally, an interesting case study in the field of modern electrical distribution systems management is proposed.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Apostolico, A. "On-line String Searching." In Pattern Matching Algorithms. Oxford University Press, 1997. http://dx.doi.org/10.1093/oso/9780195113679.003.0006.

Повний текст джерела
Анотація:
In the previous two chapters, we have examined various serial and parallel methods to perform exact string searching in a number of operations proportional to the total length of the input. Even though such a performance is optimal, our treatment of exact searches cannot be considered exhausted yet: in many applications, searches for different, a-priorily unknown patterns are performed on a same text or group of texts. It seems natural to ask whether these cases can be handled better than by plain reiteration of the procedures studied so far. As an analogy, consider the classical problem of searching for a given item in a table with n entries. In general, n comparisons are both necessary and sufficient for this task. If we wanted to perform k such searches, however, it is no longer clear that we need kn comparisons. Our table can be sorted once and for all at a cost of O(n log n) comparisons, after which binary search can be used. For sufficiently large k, this approach outperforms that of the k independent searches. In this chapter, we shall see that the philosophy subtending binary search can be fruitfully applied to string searching. Specifically, the text can be pre-processed once and for all in such a way that any query concerning whether or not a pattern occurs in the text can be answered in time proportional to the length of the pattern. It will also be possible to locate all the occurrences of the pattern in the text at an additional cost proportional to the total number of such occurrences. We call this type of search on-line, to refer to the fact that as soon as we finish reading the pattern we can decide whether or not it occurs in our text. As it turns out, the auxiliary structures used to achieve this goal are well suited to a host of other applications. There are several, essentially equivalent digital structures supporting efficient on-line string searching. Here, we base our discussion on a variant known as suffix tree. It is instructive to discuss first a simplified version of suffix trees, which we call expanded suffix tree.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Kumar, Dheeraj, Nadeem Faisal, Ramit Choudhury, and Swarup S. Deshmukh. "Experimental Investigation of the Mechanical and Thermal Properties of Natural Green Fibres." In Optimum Composite Structures - Recent Advances, New Perspectives and Applications [Working Title]. IntechOpen, 2022. http://dx.doi.org/10.5772/intechopen.102453.

Повний текст джерела
Анотація:
Biomaterials and green products rely heavily on natural lignocellulosic fibres. They have a wide variety of potential capabilities and characteristics, making them suitable for many applications. These fibres offer all the components required for renewable energy deployment. Fibre polymers from Jharkhand such as palm, datura, lemon, and mustard were studied for their thermal, mechanical, and interfacial adhesion properties. There were also tests on tensile strength, elongation to break, and thermogravimetric analyses (TGA). The effects of heating on weight loss, water loss, and disintegration have also been studied. A comparison was made between frequently used global fibres and the fibres analysed in this research article. Jharkhand’s fibres are shown to be more compromising than worldwide fibres. Palm fibres have excellent tensile strength (160 MPa) and modulus of elasticity (5 GPa). The thermal behaviour of lemon and datura fibres is the most similar. Palm and mustard fibres respond similarly in warm temperatures. At 140°C and 240°C, mass loss was 18.8 and 24.3%, respectively. TGA shows that the studied fibres are more suited for industrial applications owing to their stable thermal behaviour. Plastics, textiles, packaging, and papers may all use palm fibres in insulators, circuit boards, switches, and terminals, as well as in furniture and window frames.
Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "OPTIMAL TEST SUITES"

1

Merayo, Mercedes G., Manuel Nunez, and Ismael Rodriguez. "Generation of optimal finite test suites for timed systems." In 2007 First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering. IEEE, 2007. http://dx.doi.org/10.1109/tase.2007.29.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Johansson, Bjo¨rn, Raghu Kacker, Ru¨ediger Kessel, Charles McLean, and Ram Sriram. "Utilizing Combinatorial Testing on Discrete Event Simulation Models for Sustainable Manufacturing." In ASME 2009 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2009. http://dx.doi.org/10.1115/detc2009-86522.

Повний текст джерела
Анотація:
This paper describes how combinatorial testing using covering arrays can be implemented to optimize discrete event simulation models of manufacturing systems for measures of sustainability. Discrete event simulation models often have hundreds of parameters and many test values for each parameter. Generally the interactions between the parameter-values are not well understood; this can lead to sub-optimization of the system. Most optimization engines and software for discrete event simulation packages use full factorial designs, which require many runs and hence a lot of computation time. In this paper we introduce combinatorial testing using a test-suite generation tool called NIST-ACTS (National Institute of Standards and Technology - Advanced Combinatorial Test Suites) to dramatically decrease the number of runs required to detect the interactions and determine an optimal solution.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Chen, Hao, Shu-Yan Wang, and Xiao-Ying Pan. "An optimal combination test suite construction method." In 2012 8th International Conference on Natural Computation (ICNC). IEEE, 2012. http://dx.doi.org/10.1109/icnc.2012.6234766.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Gotlieb, Arnaud, and Dusica Marijan. "FLOWER: optimal test suite reduction as a network maximum flow." In the 2014 International Symposium. New York, New York, USA: ACM Press, 2014. http://dx.doi.org/10.1145/2610384.2610416.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Bozkurt, Mustafa. "Cost-aware pareto optimal test suite minimisation for service-centric systems." In Proceeding of the fifteenth annual conference. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2463372.2463551.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Wang, Xiaodong, Yaohui Jin, Zhu Li, Emmanuel Dubois, and Weisheng Hu. "Experience on conformance abstract test suite development of E-NNI signaling for ASON." In Asia-Pacific Optical Communications, edited by Kwok-wai Cheung, Gee-Kung Chang, Guangcheng Li, and Ken-Ichi Sato. SPIE, 2005. http://dx.doi.org/10.1117/12.635824.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Lopez-Herrejon, Roberto E., Francisco Chicano, Javier Ferrer, Alexander Egyed, and Enrique Alba. "Multi-objective Optimal Test Suite Computation for Software Product Line Pairwise Testing." In 2013 IEEE International Conference on Software Maintenance (ICSM). IEEE, 2013. http://dx.doi.org/10.1109/icsm.2013.58.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Kuester, Michele A., James K. Lasnik, Tanya Ramond, Tony Lin, Brian Johnson, Paul Kaptchen, and William Good. "Airborne prototype instrument suite test flight of a low-light high-dynamic range imager and visible spectrometer." In Optical Engineering + Applications, edited by James J. Butler and Jack Xiong. SPIE, 2007. http://dx.doi.org/10.1117/12.730522.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Clark, D. A., J. L. Tevaarwerk, and D. E. Brewe. "The Journal Bearing Analysis Suite: A New Analytical Tool Applied and Presented." In World Tribology Congress III. ASMEDC, 2005. http://dx.doi.org/10.1115/wtc2005-64314.

Повний текст джерела
Анотація:
Planetary gear systems with hydrodynamic journal bearings can efficiently achieve high gear reduction ratios with minimum space and weight. For optimal designs, analytical tools are needed which provide accurate journal bearing modeling capabilities. At NASA Glenn a journal bearing is being prepared to support a compressor test. During check-out tests, a lubricant temperature problem came to light. As the unloaded bearing reached 6000 RPM, the lubricant exceeded the 93° C facility maximum. With a 30% increase in clearance, the bearings ran to 16,200 RPM; however, testing conditions entail 18,100 RPM with 9000 HP load. A parametric study was performed to determine the effects of clearance and loading upon lubricant temperature. A 1-D analysis was used, followed by the newly developed 3-D Journal Bearing Analysis Suite. The new software package incorporates the Army/NASA PGear Journal Bearing code. An overview of suite features and study results is presented.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Arditi, Aries, and Ron Cagenello. "A Computer-Based Optotype Acuity Test System Suitable for Evaluation of Acuity Charts." In Noninvasive Assessment of the Visual System. Washington, D.C.: Optica Publishing Group, 1992. http://dx.doi.org/10.1364/navs.1992.mb1.

Повний текст джерела
Анотація:
Although computerized visual acuity testing is psychophysically more flexible than “manual” testing using printed or projected optotype charts, the quality of currently available and affordable pixel-oriented computer images makes computers poorly suited for clinical testing. This is mainly because low spatial resolution in one or both dimensions limits the range of sizes available for testing at a single optical distance.
Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "OPTIMAL TEST SUITES"

1

Kwasnitschka, Tom. Open-Water Test of the LIGHTHOUSE Situational Awareness System, Cruise No. AL555, 28.4.21 – 11.5.21, Kiel (Germany) – Kiel (Germany) LIGHTHOUSE-DM, Alkor-Berichte AL555. GEOMAR Helmholtz Centre for Ocean Research Kiel, 2021. http://dx.doi.org/10.3289/cr_al555.

Повний текст джерела
Анотація:
The objective of this cruise was to establish the first order functionality of the LIGHTHOUSE system in terms of mechanics, ROV operations, electrical components and data link. This is a highly integrated suite of optical and acoustic sensors to create a real time 360° scan of an underwater environment, in order to enhance the situational awareness of pilots and mission specialists. The tests were to be conducted in the clear, deep waters of the Norwegian Sognefjord. Due to severe technical malfunctions that became only apparent during mobilization in the port of Kiel, the vessel stayed moored to the east shore and west shore quays in Kiel Harbor, except for an excursion off Boknis Eck in the Eckernförde Bight. Despite these restrictions in locality, the majority of the work programme was carried out with great success.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Hodul, M., H. P. White, and A. Knudby. A report on water quality monitoring in Quesnel Lake, British Columbia, subsequent to the Mount Polley tailings dam spill, using optical satellite imagery. Natural Resources Canada/CMSS/Information Management, 2022. http://dx.doi.org/10.4095/330556.

Повний текст джерела
Анотація:
In the early morning on the 4th of August 2014, a tailings dam near Quesnel, BC burst, spilling approximately 25 million m3 of runoff containing heavy metal elements into nearby Quesnel Lake (Byrne et al. 2018). The runoff slurry, which included lead, arsenic, selenium, and vanadium spilled through Hazeltine Creek, scouring its banks and picking up till and forest cover on the way, and ultimately ended up in Quesnel Lake, whose water level rose by 1.5 m as a result. While the introduction of heavy metals into Quesnel Lake was of environmental concern, the additional till and forest cover scoured from the banks of Hazeltine Creek added to the lake has also been of concern to salmon spawning grounds. Immediate repercussions of the spill involved the damage of sensitive environments along the banks and on the lake bed, the closing of the seasonal salmon fishery in the lake, and a change in the microbial composition of the lake bed (Hatam et al. 2019). In addition, there appears to be a seasonal resuspension of the tailings sediment due to thermal cycling of the water and surface winds (Hamilton et al. 2020). While the water quality of Quesnel Lake continues to be monitored for the tailings sediments, primarily by members at the Quesnel River Research Centre, the sample-and-test methods of water quality testing used, while highly accurate, are expensive to undertake, and not spatially exhaustive. The use of remote sensing techniques, though not as accurate as lab testing, allows for the relatively fast creation of expansive water quality maps using sensors mounted on boats, planes, and satellites (Ritchie et al. 2003). The most common method for the remote sensing of surface water quality is through the use of a physics-based semianalytical model which simulates light passing through a water column with a given set of Inherent Optical Properties (IOPs), developed by Lee et al. (1998) and commonly referred to as a Radiative Transfer Model (RTM). The RTM forward-models a wide range of water-leaving spectral signatures based on IOPs determined by a mix of water constituents, including natural materials and pollutants. Remote sensing imagery is then used to invert the model by finding the modelled water spectrum which most closely resembles that seen in the imagery (Brando et al 2009). This project set out to develop an RTM water quality model to monitor the water quality in Quesnel Lake, allowing for the entire surface of the lake to be mapped at once, in an effort to easily determine the timing and extent of resuspension events, as well as potentially investigate greening events reported by locals. The project intended to use a combination of multispectral imagery (Landsat-8 and Sentinel-2), as well as hyperspectral imagery (DESIS), combined with field calibration/validation of the resulting models. The project began in the Autumn before the COVID pandemic, with plans to undertake a comprehensive fieldwork campaign to gather model calibration data in the summer of 2020. Since a province-wide travel shutdown and social distancing procedures made it difficult to carry out water quality surveying in a small boat, an insufficient amount of fieldwork was conducted to suit the needs of the project. Thus, the project has been put on hold, and the primary researcher has moved to a different project. This document stands as a report on all of the work conducted up to April 2021, intended largely as an instructional document for researchers who may wish to continue the work once fieldwork may freely and safely resume. This research was undertaken at the University of Ottawa, with supporting funding provided by the Earth Observations for Cumulative Effects (EO4CE) Program Work Package 10b: Site Monitoring and Remediation, Canada Centre for Remote Sensing, through the Natural Resources Canada Research Affiliate Program (RAP).
Стилі APA, Harvard, Vancouver, ISO та ін.
Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!

До бібліографії