Bioglass (BG) possesses excellent bioactivity and has been widely used in the manufacture of biomaterials. In this study, a composite with different surface bioactivity was fabricated via in situ melting polymerization by incorporating BG and poly(amino acid) (PAA) at a suitable ratio. The structure of the composite was characterized by Fourier transform infrared spectroscopy and XRD. The compressive strength of the BG/PAA composites was 139 MPa (BG:PAA = 30:70). The BG/PAA composites were degradable, and higher BG in composite showed higher weight loss after 4 weeks of incubation in simulated body fluid. In addition, the BG/PAA composite maintained adequate residual compressive strength during the degradation period. The SEM results showed the differences in surface bioactivities of the composites directly, and 30BG/PAA composite showed thicker apatite layer and higher Ca/p than 15BG/PAA. in vitro MG-63 cell culture experiments showed that the composite was noncytotoxic and thus allows cells to adhere, proliferate, and differentiate. This indicates that the composite has good biocompatibility. The implantations in the bone defects of rabbits for 4 and 12 weeks were studied. The composites had good biocompatibility and were capable of guiding new bone formation without causing any inflammation. The composite may be successfully used in the development of bone implants. 相似文献
With the advent of the powerful editing software and sophisticated digital cameras, it is now possible to manipulate images. Copy-move is one of the most common methods for image manipulation. Several methods have been proposed to detect and locate the tampered regions, while many methods failed when the copied region undergone some geometric transformations before being pasted, because of the de-synchronization in the searching procedure. This paper presents an efficient technique for detecting the copy-move forgery under geometric transforms. Firstly, the forged image is divided into overlapping circular blocks, and Polar Complex Exponential Transform (PCET) is employed to each block to extract the invariant features, thus, the PCET kernels represent each block. Secondly, the Approximate Nearest Neighbor (ANN) Searching Problem is used for identifying the potential similar blocks by means of locality sensitive hashing (LSH). In order to make the algorithm more robust, morphological operations are applied to remove the wrong similar blocks. Experimental results show that our proposed technique is robust to geometric transformations with low computational complexity. 相似文献
Smart transportation has a significantly impact on city management and city planning, which has received extensive attentions from academic and industrial communities. Different from omni-directional sensing system, as a directional sensing system, the multimedia-directional sensor network holds the special coverage scheme, which is usually used for smart cities, smart transportation, and harsh environment surveillance, for instance, nuclear-pollution regions where are inhospitable for people. This paper advances Virtual Stream Artificial Fish-swarm based Coverage-Enhancing Algorithm (VSAFCEA) as a coverage-enhancing means in multimedia directional sensor networks. Firstly, a concept of virtual streams, based on traditional artificial fish-swarm algorithm, is proposed. Then, the traditional behaviors of fishes in artificial fish-swarm algorithm are modified and expanded with several new behaviors. Finally, the presented VSAFCEA is adopted for coverage-enhancing issue in the situation of directional sensor networks with rotational direction-adjustable model. With a sequence of steps of artificial fishes in virtual stream, the presented VSAFCEA can figure out the approximation to the highest area coverage rate. Based on comparison of these simulation results (results of presented VSAFCEA and that of other typical coverage-enhancing ways in directional sensor networks), the conclusion can be drawn that VSAFCEA could attain higher area coverage rate of directional sensor networks with fewer iterative computing times.
In quantum key distribution (QKD), the information theoretically secure authentication is necessary to guarantee the integrity and authenticity of the exchanged information over the classical channel. In order to reduce the key consumption, the authentication scheme with key recycling (KR), in which a secret but fixed hash function is used for multiple messages while each tag is encrypted with a one-time pad (OTP), is preferred in QKD. Based on the assumption that the OTP key is perfect, the security of the authentication scheme has be proved. However, the OTP key of authentication in a practical QKD system is not perfect. How the imperfect OTP affects the security of authentication scheme with KR is analyzed thoroughly in this paper. In a practical QKD, the information of the OTP key resulting from QKD is partially leaked to the adversary. Although the information leakage is usually so little to be neglected, it will lead to the increasing degraded security of the authentication scheme as the system runs continuously. Both our theoretical analysis and simulation results demonstrate that the security level of authentication scheme with KR, mainly indicated by its substitution probability, degrades exponentially in the number of rounds and gradually diminishes to zero. 相似文献
With the motivation of seamlessly extending wireless sensor networks to the external environment, service-oriented architecture comes up as a promising solution. However, as sensor nodes are failure prone, this consequently renders the whole wireless sensor network to seriously faulty. When a particular node is faulty, the service on it should be migrated into those substitute sensor nodes that are in a normal status. Currently, two kinds of approaches exist to identify the substitute sensor nodes: the most common approach is to prepare redundancy nodes, though the involved tasks such as maintaining redundancy nodes, i.e., relocating the new node, lead to an extra burden on the wireless sensor networks. More recently, other approaches without using redundancy nodes are emerging, and they merely select the substitute nodes in a sensor node’s perspective i.e., migrating the service of faulty node to it’s nearest sensor node, though usually neglecting the requirements of the application level. Even a few work consider the need of the application level, they perform at packets granularity and don’t fit well at service granularity. In this paper, we aim to remove these limitations in the wireless sensor network with the service-oriented architecture. Instead of deploying redundancy nodes, the proposed mechanism replaces the faulty sensor node with consideration of the similarity on the application level, as well as on the sensor level. On the application level, we apply the Bloom Filter for its high efficiency and low space costs. While on the sensor level, we design an objective solution via the coefficient of a variation as an evaluation for choosing the substitute on the sensor level. 相似文献