Patch-level features are essential for achieving good performance in computer vision tasks. Besides well- known pre-defined patch-level descriptors such as scalein- variant feature transform （SIFT） and histogram of ...Patch-level features are essential for achieving good performance in computer vision tasks. Besides well- known pre-defined patch-level descriptors such as scalein- variant feature transform （SIFT） and histogram of oriented gradient （HOG）, the kernel descriptor （KD） method [1] of- fers a new way to ＂grow-up＂ features from a match-kernel defined over image patch pairs using kernel principal compo- nent analysis （KPCA） and yields impressive results. In this paper, we present efficient kernel descriptor （EKD） and efficient hierarchical kernel descriptor （EHKD）, which are built upon incomplete Cholesky decomposition. EKD au- tomatically selects a small number of pivot features for gener- ating patch-level features to achieve better computational effi- ciency. EHKD recursively applies EKD to form image-level features layer-by-layer. Perhaps due to parsimony, we find surprisingly that the EKD and EHKD approaches achieved competitive results on several public datasets compared with other state-of-the-art methods, at an improved efficiency over KD.展开更多
Nanoflake-based flower-like CuO nanostruc- tures have been synthesized through thermal decomposi- tion of [Cu（NH3）4]2＋ solution without any surfactants and catalysts at low temperature. The products are character- ...Nanoflake-based flower-like CuO nanostruc- tures have been synthesized through thermal decomposi- tion of [Cu（NH3）4]2＋ solution without any surfactants and catalysts at low temperature. The products are character- ized by X-ray diffraction （XRD） and field-emission scanning electron microscopy （FESEM）. The possible formation process based on the aggregation-recrystalliza- tion mechanism is proposed. Finally, the obtained flower- like CuO hierarchical nanostructures have been used as the photocatalyst in the experiments. It is found that the as- prepared flower-like CuO hierarchical nanostructures exhibit superior photocatalytic property on photocatalytic decomposition of Rhodamine B due to their hierarchical structures.展开更多
Publish/subscribe(pub/sub) paradigm is the main communication model for Information-Centric Network(ICN) proposals.A key issue for pub/sub system is how to route the content objects to the correct subscribers,and ICN ...Publish/subscribe(pub/sub) paradigm is the main communication model for Information-Centric Network(ICN) proposals.A key issue for pub/sub system is how to route the content objects to the correct subscribers,and ICN is no exception.ICN network would be divided into core domain and many edge domains as today's internet does.HHR(Hierarchy Hybrid Routing scheme) is presented for ICN:A Chord-like routing scheme is used in core domain,while edge domains routing structure can be classified into three categories,Local Routing(LR),Delivery of Local Publication to Core domain(DLPC),and Remote Publication Routing into edge domain(RPR).LR can be decided by each edge domain,which determined by many factors,such as locality characteristic for pub/sub information and local policies.A hierarchical routing algorithm is proposed to solve DLPC and RPR simultaneously.Simulation results demonstrate that HHR can be fast deployed,and can be applied in large scale network or dynamic subscription environment.展开更多
文摘Patch-level features are essential for achieving good performance in computer vision tasks. Besides well- known pre-defined patch-level descriptors such as scalein- variant feature transform （SIFT） and histogram of oriented gradient （HOG）, the kernel descriptor （KD） method [1] of- fers a new way to ＂grow-up＂ features from a match-kernel defined over image patch pairs using kernel principal compo- nent analysis （KPCA） and yields impressive results. In this paper, we present efficient kernel descriptor （EKD） and efficient hierarchical kernel descriptor （EHKD）, which are built upon incomplete Cholesky decomposition. EKD au- tomatically selects a small number of pivot features for gener- ating patch-level features to achieve better computational effi- ciency. EHKD recursively applies EKD to form image-level features layer-by-layer. Perhaps due to parsimony, we find surprisingly that the EKD and EHKD approaches achieved competitive results on several public datasets compared with other state-of-the-art methods, at an improved efficiency over KD.
文摘Nanoflake-based flower-like CuO nanostruc- tures have been synthesized through thermal decomposi- tion of [Cu（NH3）4]2＋ solution without any surfactants and catalysts at low temperature. The products are character- ized by X-ray diffraction （XRD） and field-emission scanning electron microscopy （FESEM）. The possible formation process based on the aggregation-recrystalliza- tion mechanism is proposed. Finally, the obtained flower- like CuO hierarchical nanostructures have been used as the photocatalyst in the experiments. It is found that the as- prepared flower-like CuO hierarchical nanostructures exhibit superior photocatalytic property on photocatalytic decomposition of Rhodamine B due to their hierarchical structures.
基金supported by 973 Program(2013CB329103)NSFC Fund (61271165,61301153)Program for Changjiang Scholars and Innovative Research Team (PCSIRT) in University and the 111 Project B14039
文摘Publish/subscribe(pub/sub) paradigm is the main communication model for Information-Centric Network(ICN) proposals.A key issue for pub/sub system is how to route the content objects to the correct subscribers,and ICN is no exception.ICN network would be divided into core domain and many edge domains as today's internet does.HHR(Hierarchy Hybrid Routing scheme) is presented for ICN:A Chord-like routing scheme is used in core domain,while edge domains routing structure can be classified into three categories,Local Routing(LR),Delivery of Local Publication to Core domain(DLPC),and Remote Publication Routing into edge domain(RPR).LR can be decided by each edge domain,which determined by many factors,such as locality characteristic for pub/sub information and local policies.A hierarchical routing algorithm is proposed to solve DLPC and RPR simultaneously.Simulation results demonstrate that HHR can be fast deployed,and can be applied in large scale network or dynamic subscription environment.
