检索结果-内蒙古大学图书馆

IET International Radar Conference 2015

作者： Yalin Qi Qi Zhang Wenfu Yang Shuangjing Yang Tiandong Liu China academy of Launch vehicle technology Beijing 100076 China Beijing Institute of Spacecraft system Engineering CAST Beijing 100094 China Beijing Key Laboratory of Embedded Real-time Information Processing Technology Radar Research Lab. School of Information and Electronics Beijing Institute of Technology Beijing 100081 China

ISBN: (纸本)9781510822023

As an extension of the Interferometric Synthetic aperture radar (InSAR), the multi-frequency InSAR can realize high-accuracy elevation extraction of the steep terrain. Though the maximum likelihood estimation (MLE) is widely used in the signal processing of multi-frequency InSAR, the performance of this method can be influenced by the selection of frequency combination. At the beginning, this paper analyses the elevation estimated effectiveness of different frequency combinations from the aspect of Cramer-Rao Lower Bound (CRLB). Then, it calculates the ambiguity cycle as a further filter for the optimal frequency combination. Finally, this paper discusses the adaptability to the phase noise with the help of Monte Carlo simulation strategy. In consideration of these three aspects, a selection method of frequency combination is proposed, and further simulation results are provided in quantity. Relevant researches can be used in the design of multi-frequency InSAR system.

关键词： CRLB MLE Multi-frequency InSAR ambiguity cycle frequency combination phase noise

来源：评论

学校读者我要写书评

暂无评论

A new automatic mass detection method for breast cancer with false positive reduction

引用

Neurocomputing 2015年 152卷 388-402页

作者： Xiaoming Liu Zhigang Zeng School of Automation Huazhong University of Science and Technology Wuhan 430074 China Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China Wuhan 430074 China College of Computer Science and Technology Wuhan University of Science and Technology Wuhan 430081 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan 430081 China

Mass localization is a crucial problem in computer-aided detection (CAD) system for the diagnosis of suspicious regions in mammograms. In this paper, a new automatic mass detection method for breast cancer in mammographic images is proposed. Firstly, suspicious regions are located with an adaptive region growing method, named multiple concentric layers (MCL) approach. Prior knowledge is utilized by tuning parameters with training data set during the MCL step. Then, the initial regions are further refined with narrow band based active contour (NBAC), which can improve the segmentation accuracy of masses. Texture features and geometry features are extracted from the regions of interest (ROI) containing the segmented suspicious regions and the boundaries of the segmentation. The texture features are computed from gray level co-occurrence matrix (GLCM) and completed local binary pattern (CLBP). Finally, the ROIs are classified by means of support vector machine (SVM), with supervision provided by the radiologist׳s diagnosis. To deal with the imbalance problem regarding the number of non-masses and masses, supersampling and downsampling are incorporated. The method was evaluated on a dataset with 429 craniocaudal (CC) view images, containing 504 masses. Among them, 219 images containing 260 masses are used to optimize the parameters during MCL step, and are used to train SVM. The remaining 210 images (with 244 masses) are used to test the performance. Masses are detected with 82.4% sensitivity with 5.3 false positives per image (FPsI) with MCL, and after active contour refinement, feature analysis and classification, it obtained 1.48 FPsI at the sensitivity 78.2%. Testing on 164 normal mammographic images showed 5.18 FPsI with MCL and 1.51 FPsI after classification. Experiments on mediolateral oblique (MLO) images have also been performed, the proposed method achieved a sensitivity 75.6% at 1.38 FPsI. The method is also analyzed with free response operating characteristi

关键词： Mass detection Breast cancer Level set Local binary pattern Support vector machine

来源：评论

学校读者我要写书评

暂无评论

A Secure and Lightweight Data Access Control Scheme for Mobile Cloud Computing

A Secure and Lightweight Data Access Control Scheme for Mobi...

引用

IEEE International Conference on Big Data and Cloud Computing (BdCloud)

作者： Yu Jin Chuan Tian Heng He Fan Wang Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan P.R.China College of Computer Science and Technology Wuhan University of Science and Technology Wuhan P.R.China

ISBN: (纸本)9781467371841

By moving data storage and processing from lightweight mobile devices to powerful and centralized computing platforms located in clouds, Mobile Cloud Computing (MCC) can greatly enhance the capability of mobile devices. However, when data owners outsource sensitive data to mobile cloud for sharing, the data is outside of their trusted domain and can potentially be granted to untrusted parties which include the service providers. Data security and flexible access control have become the most pressing demands for MCC. To address this issue, we design a secure and lightweight data access control scheme based on Ciphertext-Policy Attribute-based Encryption (CP-ABE) algorithm, which can protect the confidentiality of outsourced data and provide fine-grained data access control in MCC. The scheme can obviously improve the overall system performance by greatly reducing the computation overheads in encryption and decryption operations, provide flexible and expressive data access control policy, and meanwhile enable data owners to securely outsource most of the computation overheads at mobile devices to cloud servers. The security and performance evaluation show that our scheme is secure, highly efficient and well suited for lightweight mobile devices.

关键词： Access control Encryption Mobile handsets Mobile communication Algorithm design and analysis Servers

来源：评论

学校读者我要写书评

暂无评论

Pulse repetition frequency design for geosynchronous SAR in ellipcial orbit

Pulse repetition frequency design for geosynchronous SAR in ...

引用

IET International Radar Conference 2015

作者： Wei Yin Wenfu Yang Zegang Ding Wei Liu Qingjun Zhang Jingjing Ren Beijing Key Laboratory of Embedded Real-time Information Processing Technology Radar Research Lab Beijing Institute of Technology Beijing P.R. China 100081 China Academy of Launch Vehicle Technology Beijing P.R. China 100076 Beijing Institute of Spacecraft System Engineering CAST Beijing P.R. China 100094

Elliptical orbit and squint mode are widely used in the system design of geosynchronous synthetics aperture radar (GEO SAR) to improve the coverage performance. In this paper, the effects of orbit height variation and squint mode to pulse repetition frequency (PRF) design are analyzed. The orbit height variation causes the variation of nadir interference and beam illumination region, and squint mode produces large range cell migration (RCM). These can induce invalidations of the designed PRF. Based on this, the constraints of nadir interference and transmit interference are updated for GEO SAR, and the effective time for the designed PRF is derived. PRF number required for imaging in one orbital period is analyzed.

关键词： Pulse repetition frequency (PRF) effective time nadir interference orbit height variation range cell migration (RCM) effective time PULSE REPETITION RATE Prolactin-Releasing Hormone Strabismus Orbits Synthetic aperture radar Rescue Specific absorption rate SAFETY ANALYSIS REPORTS Eye Sockets Genetically engineered organisms

来源：评论

学校读者我要写书评

暂无评论

Graph Pattern Matching through Model Checking

Graph Pattern Matching through Model Checking

引用

International Conference on Database Theory and Application (DTA)

作者： Rui Qiao Xiaolei Zhong Ling Zhang Heng He College of Computer Science and Technology Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan China School of Software Huazhong University of Science Wuhan China College of Management Wuhan University of Science and Technology Wuhan China

Graph pattern matching is a hot spot in the big data era, which is to find answer graphs matching a given query graph in a data graph of graph databases. “Matching” means two graphs satisfy some relation, such as isomorphism, simulation, bisimulation, etc. Since there are seldom algorithms for the subgraph bisimulation, our work commits to solve the graph pattern matching problem involving bisimulation relations through the model checking technology. We characterize query graphs by modal formulas. By model checking the formulas in the data graphs, the answer graphs bisimilar to the query graphs can be discovered. We add * to basic modal logic language resulting in ML + * language, and add r* to form ML + * formulas. Then a theorem which states that ML + * formulas characterize finite directed graphs modulo bisimulation is put forward. Furthermore, we list steps to find answer graphs bisimilar to a query graph.

关键词： Model checking Pattern matching Databases Big data Topology Arrays Computer science

来源：评论

学校读者我要写书评

暂无评论

A new formal modeling method for web service composition

International Journal of Signal Processing, Image Processing...

引用

International Journal of Signal processing, Image processing and Pattern Recognition 2015年第7期8卷 341-350页

作者： Li, Lin Wang, Cheng College of Computer Science and Technology Wuhan University of Science and Technology WuhanHubei China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System WuhanHubei China Department of Common Required Courses Hubei Institute of Fine Arts China

With the rapid development of e-commerce, the application of web service composition is becoming increasingly important in many areas. If we apply unchecked web service composition, then we can only discover problems afterwards, and we have to devote unnecessary energy to repair. Here, formal modeling serves to be a premise to check. This paper brings up a formal modeling method for web service composition based on BDL (behavioral description language). The structure of this essay is to analyze the description of BPEL process, and we can get the formal model from the BPEL-to-BDL mapping relation. © 2015 SERSC.

关键词： Modeling languages

来源：评论

学校读者我要写书评

暂无评论

A Low-Power Task Mapping Method for Network on Chip

A Low-Power Task Mapping Method for Network on Chip

引用

Chinese Automation Congress

作者： Wenwen Cao Wei Hu Puzhang Wang Mengke Song Ruomiao Li College of Computer Science and Technology Wuhan University of Science and Technology Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System

ISBN: (纸本)9781467371902

When more and more processor cores are integrated onto a single chip, the computing ability has been improved dramatically. And the power consumed by the cores is also increased. More tasks can run in parallel for higher performance. It is a new challenge on how to map the tasks to the cores. The suitable task mapping method can enhance the parallelism of the system. However, it is still a problem to reduce the power-consumption. In this paper, a novel method is proposed to map the tasks to the cores efficiently with lower power consumption. The case study and related experimental results show that our method can have better performance and reduced power consumption.

关键词： Low power Task mapping Network on chip

来源：评论

学校读者我要写书评

暂无评论

Laminated paper counting algorithm based on compressive sensing and hough transform 2

Laminated paper counting algorithm based on compressive sens...

引用

2nd International Conference on information technology and Electronic Commerce, ICITEC 2014

作者： Wang, Hui Chen, Dongfang Wang, Xiaofeng College of Computer Science and Technology Wuhan University of Science and Technology Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan China

ISBN: (纸本)9781479952984

According to the problem that conventional laminated paper counting algorithms have some unavoidable shortcomings such as high dependence on the quality of laminated paper and noise sensitivity, we propose a laminated paper counting algorithm based on compressive sensing (CS) and Hough transform (HT). In the proposed algorithm, the over-complete dictionary which is created by dispersing the Hough transform space of straight lines acts as the sparse matrix. Making use of high degree of sparse nature of the laminated paper image, we can obtain the accurate result through using CS theory. Experimental results on simulation images and laminated paper images have shown that our proposed algorithm can effectively restrain noise of the laminated paper image, and will get accurate experimental results with fewer CS measurements. © 2014 IEEE.

关键词： Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

An efficient algorithm for hamilton cycle based on the enlarged rotation-extension technique

An efficient algorithm for hamilton cycle based on the enlar...

引用

International MultiConference of Engineers and Computer Scientists, IMECS 2014

作者： Du, Lizhi College of Computer Science and Technology Wuhan University of Science and Technology Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System Wuhan430065 China

ISBN: (纸本)9789881925336

Algorithm studies on the Hamilton cycle are mainly based on the Rotation-Extension method developed by Posa. However, due to the deficiency of Posa's method, all these products are only efficient for much denser graphs or sparse but regular graphs. By many years' study, we developed the "Enlarged Rotation-Extension" technique which utterly changed and expanded the Posa's original one and can surmount its deficiency. Based on this technique, our algorithm can quickly calculate randomly produced un-directed graphs with up to ten thousand vertices on personal computer, no matter dense or sparse, the correctness is one hundred percent. We also calculated the data of hamilton cycles on a famous web site and we still got one hundred percent correctness.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Topic identification strategy for English academic resources

Topic identification strategy for English academic resources

引用

5th FTRA International Conference on Computer Science and its Applications, CSA 2013

作者： Li, Huang Qing, Hu Xin, Xiong Lijun, Hua College of Computer Science and Technology Wuhan University of Science and Technology Wuhan 430080 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan 430080 China

ISBN: (纸本)9783642416736

The network resource grows up exponentially with the rapid development of Internet. It is very important to identify whether the resources belong to the professional field or not. However, resources in professional field are sorted up mostly manually at present, and some drawbacks exist in the process. To tackle with these problems, the Topic Identification Strategy of Academic Resources proposes topic identification method based on the main text of resources. The strategy first transfers different forms of academic resources into a unified format. And then break up the whole text into parts to calculate the topic degree of relevance. Samples are used to decide the weight of the thresholds. The proposed method could also add labels for resources automatically. Experiments show that, this strategy could effectively deal with English academic resources topic identification. © 2014 Springer-Verlag Berlin Heidelberg.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：