Coverage analysis is a structural testing technique that helps to eliminate gaps in atest suite and determines when to stop testing. To compute test coverage, this letter proposes anew concept coverage about variables...
详细信息
Coverage analysis is a structural testing technique that helps to eliminate gaps in atest suite and determines when to stop testing. To compute test coverage, this letter proposes anew concept coverage about variables, based on program slicing. By adding powers accordingto their importance, the users can focus on the important variables to obtain higher test *** letter presents methods to compute basic coverage based on program structure graphs. Inmost cases, the coverage obtained in the letter is bigger than that obtained by a traditionalmeasure, because the coverage about a variable takes only the related codes into account.
To provide system designer a valid measure to evaluate the structure complexityof class diagrams objectively, this letter first proposes a method to transform a class diagramsinto a weighted class dependence graph, th...
详细信息
To provide system designer a valid measure to evaluate the structure complexityof class diagrams objectively, this letter first proposes a method to transform a class diagramsinto a weighted class dependence graph, then presents a structure complexity measure for classdiagrams based on entropy distance.
In this paper, the performance of a distributed mobility management scheme, the Randomized Database Group (RDG), for mobile ad hoc networks is presented. In this scheme, databases are used to store the location of the...
详细信息
In this paper, the performance of a distributed mobility management scheme, the Randomized Database Group (RDG), for mobile ad hoc networks is presented. In this scheme, databases are used to store the location of the network nodes and to manage the mobility of nodes. When a mobile's location changes, a number of randomly selected databases are updated. When a mobile's location is needed, such as upon a call arrival, a number of randomly selected databases are queried. A number of different RDG query schemes are studied and their performance are compared. In particular, the optimum update-group size and the query-group size are found. We also present the probability of the first query being successful and the average query delay to find the mobile's location. Finally, we estimate the cost of implementing the RDG scheme as a function of different number of databases.
Maintenance and evolution are critical for website since the requirements often change, the developing cycle is short, while the life cycle is long. In order to make progress in this area, we focus on the users' r...
详细信息
ISBN:
(纸本)0769519105
Maintenance and evolution are critical for website since the requirements often change, the developing cycle is short, while the life cycle is long. In order to make progress in this area, we focus on the users' responses and attitudes. So we begin our work at the log files on the side of website server, gathering the users' visiting information and the server's responses. Thus we obtain our weighted structure model. Then, we analyze and discuss such information to identify the key pages, the predominate pages and the users' visiting patterns. And we can improve the testing efficiency based on these knowledge. All these will help to improve the structure of the site, fulfill the functionality of the site, and enhance users' visiting efficiency.
In this paper, the IEEE 802.11 multiple access control (MAC) protocol was modified for use in multi-channel, multi-hop ad hoc networks through the use of a new channel-status indicator. In particular, in the modified ...
详细信息
In this paper, the IEEE 802.11 multiple access control (MAC) protocol was modified for use in multi-channel, multi-hop ad hoc networks through the use of a new channel-status indicator. In particular, in the modified protocol, the RTS/CTS dialogue is exchanged on the common access control channel and data packets are transmitted on a selected traffic channel. We have evaluated the improvement due to the multi-channel use and we report in this paper on the results of the per-node throughput and the end-to-end delay for different network sizes. Using these results, we were able to propose a number of per-node throughput scaling laws. Our simulation results show that the per-node throughput with multiple channels for the fully connected, the line, and the grid ad hoc network topologies increases by 90% to 253%, by 47%, and by 139% to 163%, respectively, for networks with 16 to 64 nodes, as compared with that of a single channel.
After introducing the overview of our requirements description model HRFSM,the paper presents a dynamic software execution model (DERTS) of embedded real-time software, which can integrate control flow, data flow and ...
详细信息
After introducing the overview of our requirements description model HRFSM,the paper presents a dynamic software execution model (DERTS) of embedded real-time software, which can integrate control flow, data flow and time. Based on DERTS, a checking method is also presented. It consists of three kinds of checking and can check the consistency and completeness of the requirement specifications of embedded real-time software. Besides providing information helpful to improve the efficiency of analyzing and checking specifications,the checking method is flexible, and easy to understand and to use for the analyst.
Traditional Chinese documents classifiers are based on keywords in the documents, which need dictionaries support and efficient segmentation procedures. This paper explores the techniques of utilizing N-gram informati...
详细信息
With the rapid growth of online text information, efficient text classification has become one of the key techniques for organizing and processing text repositories. In this paper, an efficient text classification app...
详细信息
Text classification is becoming more and more important with the rapid growth of on-line information available. In this paper, we propose an approach to speedup the process of text classification based on pruning the ...
详细信息
In this paper, we propose a field-based collaboration algorithm that can be applied to searching the local-best co-agent within field. The dynamic "field" structure of the collaborating objects limits the ra...
详细信息
In this paper, we propose a field-based collaboration algorithm that can be applied to searching the local-best co-agent within field. The dynamic "field" structure of the collaborating objects limits the range of information communicating and sharing, and adjusts the load of Agents dynamically. An efficient method for Agent's collaboration in MADCE is presented, which can balance the system load, reduce the executive cost, and broaden the ability of Distributed Computing Environment.
暂无评论