全文获取类型
收费全文 | 79篇 |
免费 | 0篇 |
专业分类
电工技术 | 1篇 |
化学工业 | 4篇 |
建筑科学 | 1篇 |
轻工业 | 1篇 |
无线电 | 8篇 |
一般工业技术 | 7篇 |
冶金工业 | 10篇 |
原子能技术 | 5篇 |
自动化技术 | 42篇 |
出版年
2015年 | 1篇 |
2014年 | 3篇 |
2013年 | 2篇 |
2012年 | 1篇 |
2011年 | 2篇 |
2010年 | 3篇 |
2009年 | 3篇 |
2007年 | 1篇 |
2006年 | 3篇 |
2005年 | 6篇 |
2004年 | 1篇 |
2003年 | 3篇 |
2002年 | 7篇 |
2001年 | 3篇 |
2000年 | 3篇 |
1999年 | 1篇 |
1998年 | 9篇 |
1997年 | 6篇 |
1996年 | 5篇 |
1993年 | 3篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1987年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1980年 | 1篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1968年 | 1篇 |
1967年 | 2篇 |
1966年 | 1篇 |
排序方式: 共有79条查询结果,搜索用时 15 毫秒
1.
2.
Location-based applications such as Facebook Places, Foursquare, or Loopt typically use location services to manage mobile object positions. However, exposing precise user positions raises user privacy concerns, especially if location service providers are not fully trusted. To enable the secure management of private user positions in non-trusted systems, we present two novel position sharing approaches based on the concept of multi-secret sharing. We improve existing geometric position sharing approaches by Dürr et al. [2] and Skvortsov et al. [3] by considering continuous position updates and by increasing the robustness against various attacks. Furthermore, we present the first position sharing approach for symbolic location models. 相似文献
3.
Orphan detection in distributed systems is a well-researched field for which many solutions exist. These solutions exploit well defined parent-child relationships given in distributed systems. But they are not applicable in mobile agent systems, since no similar natural relationship between agents exist. Thus new protocols have to be developed. In this paper one such protocol for controlling mobile mobile agents and for orphan detection is presented. The shadow approach presented in this paper uses the idea of a placeholder (shadow) which is assigned by the agent system to each new agent. This defines an artificial relationship between agents and shadow. The shadow records the location of all dependent agents. Removing the root shadow implies that all dependent agents are declared orphan and are eventually be terminated. We introduce agent proxies that create a path from shadow to every agent. In an extension of the basic protocol we additionally allow the shadow to be mobile.The shadow approach can be used for termination of groups of agents even if the exact location of each single agent is not known. 相似文献
4.
Selecting a Cost-Effective Test Case Prioritization Technique 总被引:1,自引:0,他引:1
Sebastian Elbaum Gregg Rothermel Satya Kanduri Alexey G. Malishevsky 《Software Quality Journal》2004,12(3):185-210
Regression testing is an expensive testing process used to validate modified software and detect whether new faults have been introduced into previously tested code. To reduce the cost of regression testing, software testers may prioritize their test cases so that those which are more important, by some measure, are run earlier in the regression testing process. One goal of prioritization is to increase a test suite's rate of fault detection. Previous empirical studies have shown that several prioritization techniques can significantly improve rate of fault detection, but these studies have also shown that the effectiveness of these techniques varies considerably across various attributes of the program, test suites, and modifications being considered. This variation makes it difficult for a practitioner to choose an appropriate prioritization technique for a given testing scenario. To address this problem, we analyze the fault detection rates that result from applying several different prioritization techniques to several programs and modified versions. The results of our analyses provide insights into which types of prioritization techniques are and are not appropriate under specific testing scenarios, and the conditions under which they are or are not appropriate. Our analysis approach can also be used by other researchers or practitioners to determine the prioritization techniques appropriate to other workloads. 相似文献
5.
Harrold M.J. Rothermel G. 《IEEE transactions on pattern analysis and machine intelligence》1996,22(7):442-460
Interprocedural data flow information is useful for many software testing and analysis techniques, including data flow testing, regression testing, program slicing and impact analysis. For programs with aliases, these testing and analysis techniques can yield invalid results, unless the data flow information accounts for aliasing effects. Recent research provides algorithms for performing interprocedural data flow analysis in the presence of aliases; however, these algorithms are expensive, and achieve precise results only on complete programs. This paper presents an algorithm for performing alias analysis on incomplete programs that lets individual software components such as library routines, subroutines or subsystems be independently analyzed. The paper also presents an algorithm for reusing the results of this separate analysis when the individual software components are linked with calling modules. Our algorithms let us analyze frequently used software components, such as library routines or classes, independently, and reuse the results of that analysis when analyzing calling programs, without incurring the expense of completely reanalyzing each calling program. Our algorithms also provide a way to analyze large systems incrementally 相似文献
6.
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. 相似文献
7.
Efficient real-time trajectory tracking 总被引:1,自引:0,他引:1
Ralph Lange Frank Dürr Kurt Rothermel 《The VLDB Journal The International Journal on Very Large Data Bases》2011,20(5):671-694
Moving objects databases (MOD) manage trajectory information of vehicles, animals, and other mobile objects. A crucial problem
is how to efficiently track an object’s trajectory in real-time, in particular if the trajectory data is sensed at the mobile
object and thus has to be communicated over a wireless network. We propose a family of tracking protocols that allow trading
the communication cost and the amount of trajectory data stored at a MOD off against the spatial accuracy. With each of these
protocols, the MOD manages a simplified trajectory that does not deviate by more than a certain accuracy bound from the actual
movement. Moreover, the different protocols enable several trade-offs between computational costs, communication cost, and
the reduction in the trajectory data: Connection-Preserving Dead Reckoning minimizes the communication cost using dead reckoning, a technique originally designed for tracking an object’s current position.
Generic Remote Trajectory Simplification (GRTS) further separates between tracking of the current position and simplification of the past trajectory and can be realized
with different line simplification algorithms. For both protocols, we discuss how to bound the space consumption and computing
time at the moving object and thereby present an effective compression technique to optimize the reduction performance of
real-time line simplification in general. Our evaluations with hundreds of real GPS traces show that a realization of GRTS
with a simple simplification heuristic reaches 85–90% of the best possible reduction rate, given by retrospective offline
simplification. A realization with the optimal line simplification algorithm by Imai and Iri even reaches more than 97% of
the best possible reduction rate. 相似文献
8.
Hyunsook Do Rothermel G. 《IEEE transactions on pattern analysis and machine intelligence》2006,32(9):733-752
Regression testing is an important activity in the software life cycle, but it can also be very expensive. To reduce the cost of regression testing, software testers may prioritize their test cases so that those which are more important, by some measure, are run earlier in the regression testing process. One potential goal of test case prioritization techniques is to increase a test suite's rate of fault detection (how quickly, in a run of its test cases, that test suite can detect faults). Previous work has shown that prioritization can improve a test suite's rate of fault detection, but the assessment of prioritization techniques has been limited primarily to hand-seeded faults, largely due to the belief that such faults are more realistic than automatically generated (mutation) faults. A recent empirical study, however, suggests that mutation faults can be representative of real faults and that the use of hand-seeded faults can be problematic for the validity of empirical results focusing on fault detection. We have therefore designed and performed two controlled experiments assessing the ability of prioritization techniques to improve the rate of fault detection of test case prioritization techniques, measured relative to mutation faults. Our results show that prioritization can be effective relative to the faults considered, and they expose ways in which that effectiveness can vary with characteristics of faults and test suites. More importantly, a comparison of our results with those collected using hand-seeded faults reveals several implications for researchers performing empirical studies of test case prioritization techniques in particular and testing techniques in general 相似文献
9.
Test case prioritization provides a way to run test cases with the highest priority earliest. Numerous empirical studies have
shown that prioritization can improve a test suite's rate of fault detection, but the extent to which these results generalize
is an open question because the studies have all focused on a single procedural language, C, and a few specific types of test
suites. In particular, Java and the JUnit testing framework are being used extensively to build software systems in practice,
and the effectiveness of prioritization techniques on Java systems tested under JUnit has not been investigated. We have therefore
designed and performed a controlled experiment examining whether test case prioritization can be effective on Java programs
tested under JUnit, and comparing the results to those achieved in earlier studies. Our analyses show that test case prioritization
can significantly improve the rate of fault detection of JUnit test suites, but also reveal differences with respect to previous
studies that can be related to the language and testing paradigm. To investigate the practical implications of these results,
we present a set of cost-benefits models for test case prioritization, and show how the effectiveness differences observed
can result in savings in practice, but vary substantially with the cost factors associated with particular testing processes. 相似文献
10.
Burnett M. Sheretov A. Bing Ren Rothermel G. 《IEEE transactions on pattern analysis and machine intelligence》2002,28(6):576-594
Although there has been recent research into ways to design environments that enable end users to create their own programs, little attention has been given to helping these end users systematically test their programs. To help address this need in spreadsheet systems (the most widely used type of end-user programming language), we previously introduced a visual approach to systematically testing individual cells in spreadsheet systems. However, the previous approach did not scale well in the presence of largely homogeneous grids, which introduce problems somewhat analogous to the array-testing problems of imperative programs. We present two approaches to spreadsheet testing that explicitly support such grids. We present the algorithms, time complexities, and performance data comparing the two approaches. This is part of our continuing work to bring to end users at least some of the benefits of formalized notions of testing without requiring knowledge of testing beyond a naive level 相似文献