全文获取类型
收费全文 | 82篇 |
免费 | 3篇 |
专业分类
电工技术 | 1篇 |
化学工业 | 11篇 |
能源动力 | 1篇 |
轻工业 | 10篇 |
一般工业技术 | 19篇 |
冶金工业 | 21篇 |
自动化技术 | 22篇 |
出版年
2023年 | 1篇 |
2022年 | 1篇 |
2021年 | 1篇 |
2019年 | 1篇 |
2018年 | 3篇 |
2017年 | 4篇 |
2016年 | 1篇 |
2015年 | 2篇 |
2014年 | 2篇 |
2013年 | 4篇 |
2012年 | 2篇 |
2011年 | 3篇 |
2010年 | 4篇 |
2009年 | 4篇 |
2008年 | 6篇 |
2007年 | 4篇 |
2006年 | 4篇 |
2005年 | 2篇 |
2004年 | 2篇 |
2003年 | 2篇 |
2002年 | 1篇 |
2001年 | 1篇 |
2000年 | 3篇 |
1999年 | 1篇 |
1998年 | 5篇 |
1997年 | 3篇 |
1996年 | 2篇 |
1995年 | 1篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1986年 | 2篇 |
1985年 | 1篇 |
1981年 | 1篇 |
1979年 | 3篇 |
1976年 | 1篇 |
排序方式: 共有85条查询结果,搜索用时 15 毫秒
1.
Combinatorial interaction testing (CIT) is a cost-effective sampling technique for discovering interaction faults in highly-configurable
systems. Constrained CIT extends the technique to situations where some features cannot coexist in a configuration, and is
therefore more applicable to real-world software. Recent work on greedy algorithms to build CIT samples now efficiently supports
these feature constraints. But when testing a single system configuration is expensive, greedy techniques perform worse than
meta-heuristic algorithms, because greedy algorithms generally need larger samples to exercise the same set of interactions.
On the other hand, current meta-heuristic algorithms have long run times when feature constraints are present. Neither class
of algorithm is suitable when both constraints and the cost of testing configurations are important factors. Therefore, we
reformulate one meta-heuristic search algorithm for constructing CIT samples, simulated annealing, to more efficiently incorporate
constraints. We identify a set of algorithmic changes and experiment with our modifications on 35 realistic constrained problems
and on a set of unconstrained problems from the literature to isolate the factors that improve performance. Our evaluation
determines that the optimizations reduce run time by a factor of 90 and accomplish the same coverage objectives with even
fewer system configurations. Furthermore, the new version compares favorably with greedy algorithms on real-world problems,
and, though our modifications were aimed at constrained problems, it shows similar advantages when feature constraints are
absent. 相似文献
2.
Zhihong Xu Yunho Kim Moonzoo Kim Myra B. Cohen Gregg Rothermel 《Software Testing, Verification and Reliability》2015,25(2):77-114
Test suite augmentation techniques are used in regression testing to identify code elements in a modified program that are not adequately tested and to generate test cases to cover those elements. A defining feature of test suite augmentation techniques is the potential for reusing existing regression test suites. Our preliminary work suggests that several factors influence the efficiency and effectiveness of augmentation techniques that perform such reuse. These include the order in which target code elements are considered while generating test cases, the manner in which existing regression test cases and newly generated test cases are used, and the algorithm used to generate test cases. In this work, we present the results of two empirical studies examining these factors, considering two test case generation algorithms (concolic and genetic). The results of our studies show that the primary factor affecting augmentation using these approaches is the test case generation algorithm utilized; this affects both cost and effectiveness. The manner in which existing and newly generated test cases are utilized also has a substantial effect on efficiency and in some cases a substantial effect on effectiveness. The order in which target code elements are considered turns out to have relatively few effects when using concolic test case generation but in some cases influences the efficiency of genetic test case generation. The results of our first study, on four relatively small programs using a large number of test suites, are supported by our second study of a much larger program available in multiple versions. Together, the studies reveal a potential opportunity for creating a more cost‐effective hybrid augmentation approach leveraging both concolic and genetic test case generation techniques, while appropriately utilizing our understanding of the factors that affect them. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
3.
Myra K. Derbyshire Keith G. Weinstock Jeffrey N. Strathern 《Yeast (Chichester, England)》1996,12(7):631-640
A novel Saccharomyces cerevisiae gene, HST1, was identified from among anonymous cDNAs and the complete corresponding genomic clone was isolated and sequenced. HST1 is very closely related to SIR2, showing 71% sequence identity over 84% of its length. Polymerase chain reaction with degenerate primers on S. cerevisiae DNA identified three additional SIR2-related genes designated HST2, HST3 and HST4. The sequences of HST2, HST3 and HST4 correspond to sequences previously released by the S. cerevisiae genome sequencing project as U33335, NCBI gi:965078; X87331, NCBI gi:829135; and Z48784, YD9346.03, respectively. Disruption of HST1 has shown no phenotype with respect to mechanisms in which SIR2 has a role, namely, regional silencing of HMLα, or in rDNA recombination. The sequence of HST1 has been deposited in the DDBJ, EMBL and GenBank at NCBI database under Accession Number L47120. 相似文献
4.
Dipl.-Wirt.Inf. Christian Czarnecki Prof. Dr. Axel Winkelmann Prof. Dr. rer.nat./Griechenland habil. Myra Spiliopoulou 《WIRTSCHAFTSINFORMATIK》2013,55(2):83-97
The telecommunication market is experiencing substantial changes. New business models, innovative services, and technologies require reengineering, transformation, and process standardization. Enterprise Architecture Frameworks support the transformation by specifying methods, procedures, and reference models. With the Enhanced Telecom Operation Map (eTOM), the TM Forum offers an international de facto reference process framework, based on specific features and requirements of the telecommunication industry. However, this reference framework only offers a hierarchical collection of processes on different levels of abstraction; a control view in terms of a sequential ordering of tasks and hence a real process flow as well as an end-to-end view on the customer are missing. In this paper, we extend the eTOM reference model by reference process flows, in which we abstract and generalize the knowledge about processes in telecommunication companies. With reference process flows, we aim to assist companies in achieving a structured and transparent re-structuring and re-design of their processes. We demonstrate the applicability and usefulness of our reference process flows in two case studies, and evaluate them by means of criteria for reference model evaluation. Our reference process flows have been accepted as a standard by the TM Forum and published as part of eTOM version 9. We further elaborate on those components of our approach which can be applied outside the telecommunication industry. 相似文献
5.
Content-addressable data storage by use of volume holograms 总被引:2,自引:0,他引:2
Data stored as volume holograms-optical interference patterns imprinted into a photosensitive storage material-can be accessed both by address and by content. An optical correlation-based search compares each input query against all stored records simultaneously, a massively parallel but inherently noisy analog process. With data encoding and signal postprocessing we demonstrate a holographic content-addressable data-storage system that searches digital data with high search fidelity. 相似文献
6.
The AA. investigated the frequency of antibodies against Toxoplasma gondii in 426 women with repeated abortions, perinatal mortality and malformed newborns. They showed on the whole a low incidence even if they demonstrated a high incidence (77.7%) of antibodies in women with malformed newborns. The meaning of the observations are briefly discussed. 相似文献
7.
Web Mining 总被引:1,自引:0,他引:1
8.
A new code is presented for solving linear eigenvalue problems from fluid models of the edge plasma of tokamaks. The 2DX code solves linearized fluid equations in a 2D cross-section of the plasma, with toroidal mode number resolving the third dimension. Geometry capabilities include both closed and open field lines, allowing solution of X-point problems as well as a variety of other toroidal and cylindrical systems. The code generates a pair of sparse matrices forming a generalized eigenvalue problem which is then solved using a standard sparse eigensolver package. Use of a specialized equation parser permits a high degree of flexibility in both equations and coordinate systems. Both analytic and full geometry benchmark cases are presented. 相似文献
9.
10.
This study examined the effectiveness of 3 different training types on commercial motor vehicle (CMV) drivers’ skill levels. The training types included a conventional 8-week certified course, a conventional 8-week certified course with approximately 60% of driving time spent in a CMV driving simulator, and a Commercial Driver's License (CDL) test focused short course. Participants’ scores on the Division of Motor Vehicles (DMV) road and range tests were assessed. In addition to their DMV scores, participants replicated DMV road and range driving tests in an instrumented vehicle and the CMV driving simulator. Results indicated no training group differences in DMV road tests. There were differences between training groups on DMV range tests and real truck and simulator versions of the DMV road and range tests; on these tests conventional- and simulator-trained participants generally scored higher than CDL-focused participants. However, all groups performed higher in the real truck than in the simulator for both road and range tests. These findings indicate the need for a minimum standard of entry-level CMV driver training as well as support of the use of a driving simulator for training entry-level drivers; however, testing using a simulator does not appear to be feasible with current technology. 相似文献