The traditional RBAC model already cannot express the complicated secure access control constraint of the workflow. Based on the traditional RBAC model, a new conditioned RBAC model named as CMWRBSAC is proposed on th...
详细信息
The traditional RBAC model already cannot express the complicated secure access control constraint of the workflow. Based on the traditional RBAC model, a new conditioned RBAC model named as CMWRBSAC is proposed on the basis of multi-weighted roles. A conditioned RBAC strategy is discussed on the basis of dynamic role assignment. A new concept of workflow access authorization is defined on the basis of roles with multi-weights, including the hierarchy weight, the degree weight and the sequence weight. Furthermore, in order to solve the problems of the sequence constraint of cooperative activating task by multi-roles and multi-users, a sort algorithm based on token and a sort algorithm based on weighted roles synthesis are presented respectively. Finally, an example is given to show the work processes of these algorithms. This model can express complicated workflow secure access control constraint.
A new method is presented for robustly estimating fundamental matrix from matched points. The method comprises two parts. The first uses a robust technique - the random sample consensus (RANSAC) to discard outliers in...
详细信息
A new method is presented for robustly estimating fundamental matrix from matched points. The method comprises two parts. The first uses a robust technique - the random sample consensus (RANSAC) to discard outliers in an initial set of matched points. It adopts the sampling strategy to generate inliers from the initial set. The second part of the method is an algorithm for computing fundamental matrix, using the output of the RANSAC. This algorithm is based on the consistent fundamental matrix estimation in a quadratic measurement error model. An extended system for determining the estimator is proposed, and an efficient implementation for solving the system - a continuation method is developed. The proposed algorithm avoids solving total eigenvalue problems. Results for both synthetic and real images show the effectiveness of the proposed method.
In this article, we investigate the problem of preparing qualitative spatial relations before implementing spatial data mining by checking consistency in a constraint network, which includes topological and cardinal d...
详细信息
In this article, we investigate the problem of preparing qualitative spatial relations before implementing spatial data mining by checking consistency in a constraint network, which includes topological and cardinal directional relations between pairs of spatial objects. We aim to explore potential spatial relations and possible inconsistency among the data of relationships for enforcing the correctness of spatial data mining. This task is carried out through qualitative spatial reasoning method, specifically consistency checking. We try to lay the theoretical foundation for this kind of problem. Instead of using conventional composition tables, we investigate the interactions between topological and cardinal directional relations with the aid of rules. These rules are shown to be sound, i.e. the deductions are logically correct. Based on these rules, an improved constraint propagation algorithm is introduced to enforce the path consistency. An example is presented to show the utility of these rules.
Fourier-Mellin transform (FMT) is frequently used in content-based image retrieval and digital image watermarking. This paper extends the application of FMT into image registration and proposes an improved registratio...
详细信息
ISBN:
(纸本)076952432X
Fourier-Mellin transform (FMT) is frequently used in content-based image retrieval and digital image watermarking. This paper extends the application of FMT into image registration and proposes an improved registration algorithm based on FMT for the alignment of images differing in translation, rotation angle, and uniform scale factor. The proposed algorithm can eliminate the conversion from Cartesian to log-polar coordinates, avoid the process of interpolation required in the conversion, and obtain a more significant improvement than the conventional method using cross-correlation. Experiments show that the algorithm is accurate and robust regardless of white noise
It is well recognized that sequential pattern mining plays an essential role in many scientific and business domains. In this paper, a new extension of sequential pattern, attributes' sequential pattern, is propos...
详细信息
It is well recognized that sequential pattern mining plays an essential role in many scientific and business domains. In this paper, a new extension of sequential pattern, attributes' sequential pattern, is proposed. An attributes' sequential pattern is a sequence of attributes, whose values commonly occur in ascending order over data set. After each record in data set is transformed into an attributes' sequence according to their ordinal values, attributes' sequential patterns can be mined by means of mining sequential patterns. But our work is different from sequential pattern mining. One use of attributes' sequential patterns is to identify possible errors in data set for data cleaning, in which the values of attributes break the attributes' sequential patterns which most of the data conform to. Experiments verify the high efficiency of the method presented.
This paper presents a method of medicine composition concentration analysis based on least square support vector machines (LS-SVMs) and examines the importance of the hyperparameter choice in improvement of algorithm ...
详细信息
The modeling of topological relations between spatial regions is a primary topic in spatial reasoning, geographic information systems (GIS) and spatial databases. In many geographical applications spatial regions do n...
详细信息
The modeling of topological relations between spatial regions is a primary topic in spatial reasoning, geographic information systems (GIS) and spatial databases. In many geographical applications spatial regions do not always have homogeneous interiors and sharply defined boundaries, but frequently their interiors and boundaries are fuzzy. Recently, representing fuzzy spatial regions and modeling the topological relations between them plays an increasingly important theory and application role. Based on the characteristics of fuzzy regions in raster data model and the requirement of topological relations analysis in applications, a hierarchical topological relations model is proposed. The model can determine the topological relation between fuzzy raster regions on multiple levels with the values of three predicate. When predicates are evaluated within two values, it can deal with crisp raster regions as a specific case and there are 5 possible cases of topological relations. When predicates are evaluated within three values, there are 27 possible cases. There are 51 possible cases when predicates are evaluated within six values. In practical applications, the model can analyze topological relations of fuzzy raster regions according to the existing facts and the requirement. The model is wieldy in practical applications and achieves satisfactory results.
Concept lattice, the core data structure in formal concept analysis, has been used widely in machine learning, data mining and knowledge discovery, information retrieval, etc. The main difficulty with concept lattice-...
详细信息
Concept lattice, the core data structure in formal concept analysis, has been used widely in machine learning, data mining and knowledge discovery, information retrieval, etc. The main difficulty with concept lattice-based system comes from the lattice construction itself. This paper proposes a new algorithm called SSPCG (search space partition based concepts generation) based on the closures search space partition. The algorithm divides the closures search space into several subspaces in accordance with the criterions prescribed ahead, and introduces an efficient scheme to recognize the valid ones, which bounds searching just in these valid subspaces. An intermediate structure is employed to judge the validity of a subspace and compute closures more efficiently. Since the partition of the search space is recursive and the searching in subspaces is independent, a parallel version can be directly reached. The algorithm is experimental evaluated and compared with the famous NextClosure algorithm proposed by Ganter for random generated data, as well as for real application data. The results show that the algorithm performs much better than the later.
A method for simultaneous analysis of the two components of compound paracetamol and diphenhydramine hydrochloride powdered drugs on near-infrared (NIR) spectroscopy is developed by using a Radial Basis Function (RBF)...
详细信息
In this paper, we propose a new supervised compound learning algorithm for training our constructed approximated bivariate non-tensor product adaptive pre-wavelet neural network (APWNN). On the one hand, the linear we...
详细信息
In this paper, we propose a new supervised compound learning algorithm for training our constructed approximated bivariate non-tensor product adaptive pre-wavelet neural network (APWNN). On the one hand, the linear weights of APWNN are trained by the self-adaptive learning rate method. On the other hand an extended Kalman filter method is used to update the nonlinear parameters such as dilation parameters and translation parameters. Additionally we demonstrate the efficiency of our proposed method through a concrete example of function approximation.
暂无评论