Granular computing which imitates the manner of human thinking is a mathematical tool to deal with incomplete, uncertain, imprecise and inconsistent knowledge. Just as a great umbrella, it may be regarded as a label o...
详细信息
ISBN:
(纸本)9781615677207
Granular computing which imitates the manner of human thinking is a mathematical tool to deal with incomplete, uncertain, imprecise and inconsistent knowledge. Just as a great umbrella, it may be regarded as a label of theories, methodologies, techniques and tools about granules, mainly including fuzzy set theory, rough set theory and quotient space theory. In this paper we discuss the relationship of three theories. Then we introduce a general model of granular computing and present a macrocosmic (microcosmic) hierarchical representation of granules.
A novel watermarking sharing scheme for gray-level images is proposed, which has the ability of sharing secret (the gray-level image) with multi-users. Multiple-based number system is used to split the secret into n m...
详细信息
A novel watermarking sharing scheme for gray-level images is proposed, which has the ability of sharing secret (the gray-level image) with multi-users. Multiple-based number system is used to split the secret into n meaningless shares, each share is embedded into cover image with controlled distortion and to be assigned to each user afterwards. The main feature of the proposed scheme is sharing a secret of gray-level image among multi-users; another application of such scheme is ownership verification. To reveal the secret, the necessary amount of shares has to be presented. That is, the secret can be recovered even if some shares are lost. Simulation results show that the recovered secret has robustness against a wide range of imaging processing operations.
End surface grating by direct inscribing an index modulation pattern on optical waveguide surface to control amplitude and direction of the diffracted light is fabricated. Direct inscribing an index modulation pattern...
详细信息
An atom-centered protocol based method for surface sampling in grid space is proposed. Van der Waals, solvent-accessible and solvent-excluded surface can be generated in a unified framework. A spherical hash function ...
详细信息
An atom-centered protocol based method for surface sampling in grid space is proposed. Van der Waals, solvent-accessible and solvent-excluded surface can be generated in a unified framework. A spherical hash function is used to mark whether the points are inside a sphere, and the hash tables are used to record which spheres the surface points locate on. The proposed method can be modified to apply in the parallel computation directly, which is useful for molecular dynamics simulation, docking and surface comparison and so on. Our tests indicate that the proposed method is efficient and the generated surfaces are suitable for quantitative analysis and visualization.
In this paper, a novel camera parameters calibration algorithm is proposed by exploiting defocus information. The proposed algorithm is based on two defocus images of the same scene obtained by changing camera's a...
详细信息
In this paper, a novel camera parameters calibration algorithm is proposed by exploiting defocus information. The proposed algorithm is based on two defocus images of the same scene obtained by changing camera's aperture numbers. Both images can be arbitrarily blurred. The blur difference between the two defocused images was estimated. Combining with imaging geometry of the thin lens, the corresponding camera parameters can be calibrated. This proposed algorithm remove the limit of calibration algorithm given by Soon-Yong Park that one of the images used in calibration must be focused. And it is valid without process of scale normalization. The calibrated parameters yield consistent results in depth estimation. Experimental results on synthetic and real images are presented to demonstrate the effectiveness of the proposed algorithm.
We try to evaluate the sequential and non-sequential and flexible structural alignment methods on SCOP 1.71. Firstly, we compare the flexible method with rigid methods and compare the sequence order dependent methods ...
详细信息
We try to evaluate the sequential and non-sequential and flexible structural alignment methods on SCOP 1.71. Firstly, we compare the flexible method with rigid methods and compare the sequence order dependent methods with sequence order independent methods by two typical cases. Secondly, the performances of the above methods are evaluated using ten protein pairs which are considered as "hard to detect" similarities. Thirdly, we evaluate the methods by comparing the ROC curves based on their native score and geometric measure Qscore. Then we compare the methods directly using geometric match measure Qscore, which also allows the creation of a 'Best- of-All' method. The main conclusions are: (1) we find that the best alignments found by sequential methods are more consistent with the SCOP classification; (2) we show that ROC curves are of limited value and that their ranking of the methods is not consistent with the ranking implied by the quality of the alignments the methods find; (3) we also find that the alignments of flexible method and non-sequential methods are better than the corresponding alignments of rigid sequential method from the viewpoint of geometric superposition, and flexible method and non-sequential methods can find more cross-fold similarities.
Controller synthesis uses hardware description language and synthesis optimization tools from a higher abstract level. State transition graph of completely specified finite state machine is adopted to describe the beh...
详细信息
Controller synthesis uses hardware description language and synthesis optimization tools from a higher abstract level. State transition graph of completely specified finite state machine is adopted to describe the behavior of controller. State transition graph STG_org was generated before synthesized and state transition graph STG_ext was reversely extracted from structure realization of controller synthesis. If STG_org and STG_ext were equivalent then corresponding process of controller synthesis was correct. The paper gives a formal verification algorithm of controller synthesis with time complexity O(B 2 /Aldrt 1 (n)+A ldr t 2 (m,n)) .In order to further improve time complexity of algorithm, a verifying algorithm with synthetic information guidance was proposed. The algorithm is proved efficient in theory for its time complexity is decreased to O(Bldrt 1 (n) + Aldrt 2 (m,n)).
This paperpsilas purpose is to design a novel artificial immune model for network intrusion detection. This novel model can satisfy three main requirements of an efficient network intrusion detection system, namely, d...
详细信息
This paperpsilas purpose is to design a novel artificial immune model for network intrusion detection. This novel model can satisfy three main requirements of an efficient network intrusion detection system, namely, distributed, lightweight and self-organizing, can also quicken the process of affinity maturation of detector population and improve the efficiency of anomaly detection. The algorithms of adaptive extracting vaccines and vaccine operator are given in detail. And then, on the basis of Kimpsilas conceptual model for network intrusion detection, a novel artificial immune model and relevant algorithm for real-time network intrusion detection is proposed, which integrates vaccine operator with negative selection algorithm and clonal selection algorithm.
The measurement of granules is the most foundational problem in granular computing. The paper is intended to study the measurement of granules on a finite or infinite set. For a finite set we discuss the measurement o...
详细信息
ISBN:
(纸本)9781424425389
The measurement of granules is the most foundational problem in granular computing. The paper is intended to study the measurement of granules on a finite or infinite set. For a finite set we discuss the measurement of granules corresponding to an equivalence relation on a finite set and introduce a definition of conditional granularity in order to distinguish those granules with the same granularity. For an infinite set we can define different granularity in different questions, but we give the basic idea of granularity, that is, the granularity of a granule is the sum of the relative information contents of its atomic granules.
暂无评论