Detecting of requirements inconsistency is key to the development of heterogeneous software system. But at present, although there is a lot of work on the detecting of requirements inconsistency, most of them is limit...
详细信息
Detecting of requirements inconsistency is key to the development of heterogeneous software system. But at present, although there is a lot of work on the detecting of requirements inconsistency, most of them is limited in detecting of requirements inconsistency at syntax level, we still lack of a promising method for the detection of requirements inconsistency at semantic level. Based on an abstract requirement refinement process model, this paper takes domain ontology as infrastructure for the refinement of software requirements, software requirements can then be seen as interactions between software agents and the ambiences they exist. We assume that the real effect of these interactions is to make the state of ambience changed, so we explicitly represent requirements of software agents as a set of state transition diagrams, each is for one entity in the ambience. And we realized semantic level inconsistency detecting of software requirements based on state transition of ambience.
In this paper, we present a brief summary to 3D mesh model segmentation techniques, including definition, latest achievements, classification and application in this field. Then evaluations on some of typical methods,...
详细信息
In this paper, we present a brief summary to 3D mesh model segmentation techniques, including definition, latest achievements, classification and application in this field. Then evaluations on some of typical methods, such as Watershed, topological and geometrical method, are introduced. After some applications are presented, problems and prospect of the techniques are also discussed.
This paper presents a novel segmentation method based on a non-parametric background model that has the ability of modeling multi-model. Firstly, both the intensity and edge features are used to improve robustness of ...
详细信息
This paper presents a novel segmentation method based on a non-parametric background model that has the ability of modeling multi-model. Firstly, both the intensity and edge features are used to improve robustness of the foreground detection. Secondly, we also present an adaptive shadow detection model to find the accurate moving objects. The experiment results show that our proposed method is effective.
Management of requirements inconsistency is key to the development of complex trustworthy software system, and precise measurement is precondition for the management of requirements inconsistency properly. But at pres...
详细信息
ISBN:
(纸本)076952284X
Management of requirements inconsistency is key to the development of complex trustworthy software system, and precise measurement is precondition for the management of requirements inconsistency properly. But at present, although there are a lot of work on the detection of requirements inconsistency, most of them are limited in treating requirements inconsistency according to heuristic rules, we still lacks of promising method for handling requirements inconsistency properly. Based on an abstract requirements refinement process model, this paper takes domain ontology as infrastructure for the refinement of software requirements, the aim of which is to get requirements descriptions that are comparable. Thus we can measure requirements inconsistency based on tangent plane of requirements refinement tree, after we have detected inconsistent relations of leaf nodes at semantic level.
The number of arithmetic units used in the one-dimensional (1D) discrete wavelet transform (DWT) is the main consideration for reducing the area of VLSI implementation of 1D DWT, while the size of intermediate memory ...
详细信息
ISBN:
(纸本)0780390156
The number of arithmetic units used in the one-dimensional (1D) discrete wavelet transform (DWT) is the main consideration for reducing the area of VLSI implementation of 1D DWT, while the size of intermediate memory used for data buffering is another dominate factor of effecting hardware complexity of VLSI implementation for two-dimensional (2D) DWT. In this paper, we exploit the essential relationship between the size of temporal buffer (TB) required in the line-based architecture for 2D DWT (LBA2DDWT) and the number of registers used in the 1D DWT module, and present an improved method of mapping the registers used in the 1D DWT to the TB required in LBA2DDWT. Comparison results with the other design reported in previous literature demonstrate that, the proposed mapping method can reduce efficiently the size of memory required in LBA2DDWT.
An efficient generic architecture for two-dimensional discrete wavelet transform (2-D DWT) with line-based method is proposed with using lifting scheme, in which the parallelism of four subbands transform in lifting-b...
详细信息
ISBN:
(纸本)0780390059
An efficient generic architecture for two-dimensional discrete wavelet transform (2-D DWT) with line-based method is proposed with using lifting scheme, in which the parallelism of four subbands transform in lifting-based 2-D DWT is exploited. The proposed architecture is designed to generate 4 subbands coefficients concurrently per clock cycle that :an perform a 1-level decomposition of a N/spl times/N image in approximately N/sup 2//4 working clock cycles, which has faster throughput rate but requires less hardware cost compared 10 the designs reported in previous literature.
An important obstacle to the success of the Semantic Web is that the establishment of the semantic relationship is labor-intensive. This paper proposes an automatic semantic relationship discovering approach for const...
详细信息
ISBN:
(纸本)158113844X
An important obstacle to the success of the Semantic Web is that the establishment of the semantic relationship is labor-intensive. This paper proposes an automatic semantic relationship discovering approach for constructing the semantic link network. The basic premise of this work is that the semantics of a web page can be reflected by a set of keywords, and the semantic relationship between two web pages can be determined by the semantic relationship between their keyword sets. The approach adopts the data mining algorithms to discover the semantic relationships between keyword sets, and then uses deductive and analogical reasoning to enrich the semantic relationships. The proposed algorithms have been implemented. Experiment shows that the approach is feasible.
The future Web cart be imagined as a life network consisting of resource nodes and semantic relationship links between them. Any node has a life span from birth - adding it to the network - to death - removing it from...
详细信息
ISBN:
(纸本)158113844X
The future Web cart be imagined as a life network consisting of resource nodes and semantic relationship links between them. Any node has a life span from birth - adding it to the network - to death - removing it from the network. Through establishing and investigating two types of models for such a network, we obtain the same scale free distribution of semantic links. Simulations and comparisons validate the rationality of the proposed models.
An important obstacle to the success of the Semantic Web is that the establishment of the semantic relationship is labor-intensive. This paper proposes an automatic semantic relationship discovering approach for const...
详细信息
ISBN:
(纸本)1581139128
An important obstacle to the success of the Semantic Web is that the establishment of the semantic relationship is labor-intensive. This paper proposes an automatic semantic relationship discovering approach for constructing the semantic link network. The basic premise of this work is that the semantics of a web page can be reflected by a set of keywords, and the semantic relationship between two web pages can be determined by the semantic relationship between their keyword sets. The approach adopts the data mining algorithms to discover the semantic relationships between keyword sets, and then uses deductive and analogical reasoning to enrich the semantic relationships. The proposed algorithms have been implemented. Experiment shows that the approach is feasible.
The future Web can be imagined as a life network consisting of resource nodes and semantic relationship links between them. Any node has a life span from birth -?adding it to the network -?to death -?removing it from ...
详细信息
ISBN:
(纸本)1581139128
The future Web can be imagined as a life network consisting of resource nodes and semantic relationship links between them. Any node has a life span from birth -?adding it to the network -?to death -?removing it from the network. Through establishing and investigating two types of models for such a network, we obtain the same scale free distribution of semantic links. Simulations and comparisons validate the rationality of the proposed models.
暂无评论