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

Sixth International Conference on Semantics,Knowledge and Grids(第六届语义、知识与网格国际会议 SKG 2010)

作者： Hai Zhuge Knowledge Grid Research Group Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences 100190 Beijing China

Natural physical space provides material basis for the birth and evolution of human beings and *** progress of human society has created the cyber space. With the rapid development of information technology, the cyber space is connecting physical space, social space and mental space to form a new world - Cyber Physical Society. The way to explore the cyber physical society is different from the way to explore the natural physical space and society. This paper describes the ideal of the Cyber Physical Society, and presents its distinguished characteristics and scientific issues. research on the Cyber Physical Society could lead to the revolution of society, science and technology.

关键词： Semantics Space technology Aerospace electronics Humans Materials Communities Sensors

来源：评论

学校读者我要写书评

暂无评论

Protein Structure Prediction:Challenges,Advances,and the Shift of research Paradigms

引用

Genomics, Proteomics & Bioinformatics 2023年第5期21卷 913-925页

作者： Bin Huang Lupeng Kong Chao Wang Fusong Ju Qi Zhang Jianwei Zhu Tiansu Gong Haicang Zhang Chungong Yu Wei-Mou Zheng Dongbo Bu Key Laboratory of Intelligent Information Processing Institute of Computing TechnologyChinese Academy of SciencesBeijing 100190China University of Chinese Academy of Sciences Beijing 100049China Changping Laboratory Beijing 102206China Microsoft Research AI4Science Beijing 100080China Huawei Noah’s Ark Lab Wuhan 430206China Zhongke Big Data Academy Zhengzhou 450046China Institute of Theoretical Physics Chinese Academy of SciencesBeijing 100190China

Protein structure prediction is an interdisciplinary research topic that has attracted researchers from multiple fields,including biochemistry,medicine,physics,mathematics,and computer *** researchers adopt various research paradigms to attack the same structure prediction problem:biochemists and physicists attempt to reveal the principles governing protein folding;mathematicians,especially statisticians,usually start from assuming a probability distribution of protein structures given a target sequence and then find the most likely structure,while computer scientists formulate protein structure prediction as an optimization problem-finding the structural conformation with the lowest energy or minimizing the difference between predicted structure and native *** research paradigms fall into the two statistical modeling cultures proposed by Leo Breiman,namely,data modeling and algorithmic ***,we have also witnessed the great success of deep learning in protein structure *** this review,we present a survey of the efforts for protein structure *** compare the research paradigms adopted by researchers from different fields,with an emphasis on the shift of research paradigms in the era of deep *** short,the algorithmic modeling techniques,especially deep neural networks,have considerably improved the accuracy of protein structure prediction;however,theories interpreting the neural networks and knowledge on protein folding are still highly desired.

关键词： Protein folding Protein structure prediction Deep learning Transformer Language model

来源：评论

学校读者我要写书评

暂无评论

Mobile Crowd-Sensing System Based on Participant Selection 15th

Mobile Crowd-Sensing System Based on Participant Selection

引用

15th International Conference on Green, Pervasive, and Cloud computing, GPC 2020

作者： Tu, Chunyu Han, Lei Wang, Leye Yu, Zhiyong College of Mathematics and Computer Science Fuzhou University Fuzhou China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou China Key Lab of High Confidence Software Technologies Peking University Beijing China

ISBN: (纸本)9783030642426

Mobile Crowdsensing (MCS) is often accompanied by various adverse objectives when performing data collection, which makes it difficult to collect accurate data of the entire target area with low cost. Therefore, how to collect a small part of the data to accurately infer the other data of the entire target area is a crucial issue. People’s daily trajectories usually follow a certain pattern, for example, students go to school, company employees go to work. This pattern allows us to find participants who often pass through fixed areas within a certain time span, leading their collected partial data are near optimal for the entire data collection task. This paper models the problem and develops multiple methods to improve the participant selection and the data recovery. Particularly, we use a random method, reinforcement learning, and greedy algorithm to handle this problem and compare the differences among these methods by experiments. © 2020, Springer Nature Switzerland AG.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Adaptively feature matching via joint transformational-spatial clustering

Adaptively feature matching via joint transformational-spati...

引用

作者： Wang, Linbo Tan, Li Fang, Xianyong Guo, Yanwen Wan, Shaohua MOE Key Laboratory of Intelligent Computing and Signal Processing School of Computer Science and Technology Anhui University Hefei China National Key Lab for Novel Software Technology Nanjing University Nanjing China School of Information and Safety Engineering Zhongnan University of Economics and Law Wuhan China

The transformational and spatial proximities are important cues for identifying inliers from an appearance based match set because correct matches generally stay close in input images and share similar local transformations. However, most existing approaches only check one type of them or both types consecutively with manually set thresholds, and thus their matching accuracy and flexibility in handling large-scale images are limited. In this paper, we present an efficient clustering based approach to identify match inliers with both proximities simultaneously. It first projects the putative matches into a joint transformational-spatial space, where mismatches tend to scatter all around while correct matches gather together. A mode-seeking process based on joint kernel density estimation is then proposed to obtain significant clusters in the joint space, where each cluster contains matches mapping the same object across images with high accuracy. Moreover, kernel bandwidths for measuring match proximities are adaptively set during density estimation, which enhances its applicability for matching different images. Experiments on three standard datasets show that the proposed approach delivers superior performance on a variety of feature matching tasks, including multi-object matching, duplicate object matching and object retrieval. © 2021, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Clustering Density estimation Feature matching Mode-seeking

来源：评论

学校读者我要写书评

暂无评论

Efficient Facial Landmark Detector by Knowledge Distillation

Efficient Facial Landmark Detector by Knowledge Distillation

引用

International Conference on Automatic Face and Gesture Recognition

作者： Yuyang Sha Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology Beijing CAS China

ISBN: (纸本)9781665431774

Facial landmark detection aims to locate some predefined points on human face images, which is the basis of many facial analysis tasks and applications. Compared with traditional methods, facial landmark detector based on deep learning has made significant progress in accuracy and efficiency. However, the model parameters and computational cost have not received enough attention, leading to the algorithm facing many challenges in practical applications. In this paper, we propose a novel method named efficient facial landmark detector (EFLD), which significantly compresses the model size and computational cost while achieving superior performance compared with state-of-the-art frameworks. We introduce a knowledge distillation framework suitable for facial landmark detection, which can transfer geometric information from the pre-trained teacher model to the lightweight student model. In addition, we integrate adversarial learning into the knowledge distillation framework to guide the student model to imitate the heatmap distribution generated by the teacher model. Extensive experiments demonstrate the superior performance of our approach against state-of-the-art methods.

关键词： Knowledge engineering Heating systems Computational modeling Face recognition Neural networks Detectors Gesture recognition

来源：评论

学校读者我要写书评

暂无评论

A cascaded linear model for joint Chinese word segmentation and part-of-speech tagging

A cascaded linear model for joint Chinese word segmentation ...

引用

46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, ACL-08: HLT

作者： Jiang, Wenbin Huang, Liang Liu, Qun Lü, Yajuan Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing 100190 China Department of Computer and Information Science Levine Hall University of Pennsylvania 3330 Walnut Street Philadelphia PA 19104 United States

ISBN: (纸本)9781932432046

We propose a cascaded linear model for joint Chinese word segmentation and partof- speech tagging. With a character-based perceptron as the core, combined with realvalued features such as language models, the cascaded model is able to efficiently utilize knowledge sources that are inconvenient to incorporate into the perceptron directly. Experiments show that the cascaded model achieves improved accuracies on both segmentation only and joint segmentation and part-of-speech tagging. On the Penn Chinese Treebank 5.0, we obtain an error reduction of 18.5% on segmentation and 12% on joint segmentation and part-of-speech tagging over the perceptron-only baseline. © 2008 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Efficient incremental decoding for tree-to-string translation

Efficient incremental decoding for tree-to-string translatio...

引用

Conference on Empirical Methods in Natural Language processing, EMNLP 2010

作者： Huang, Liang Mi, Haitao Information Sciences Institute University of Southern California 4676 Admiralty Way Marina del Rey CA 90292 United States Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing 100190 China

ISBN: (纸本)1932432868

Syntax-based translation models should in principle be efficient with polynomially-sized search space, but in practice they are often embarassingly slow, partly due to the cost of language model integration. In this paper we borrow from phrase-based decoding the idea to generate a translation incrementally left-to-right, and show that for tree-to-string models, with a clever encoding of derivation history, this method runs in average-case polynomial-time in theory, and linear-time with beam search in practice (whereas phrase-based decoding is exponential-time in theory and quadratic-time in practice). Experiments show that, with comparable translation quality, our tree-to-string system (in Python) can run more than 30 times faster than the phrase-based system Moses (in C++). © 2010 Association for Computational Linguistics.

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

Exploring multi-loss function based attention framework for vehicle re-identification 10

Exploring multi-loss function based attention framework for ...

引用

10th International Conference on information Technology in Medicine and Education, ITME 2019

作者： Liu, Wei Zhang, Yi Luo, Zhiming Li, Shaozi East China Jiaotong University Jiangxi China Cognitive Science Department Xiamen University Fujian China Postdoc Center of Information and Communication Engineering Xiamen University China Key Lab. of Cogn. Computing and Intelligent Information Processing of Fujian Education Institutions Wuyishan China Hubei Key Laboratory of Intelligent Vision Based Monitoring for Hydroelectric Engineering Yi Chang China

ISBN: (纸本)9781728139173

Vehicle Re-identification(Re-ID) refers to the task of matching a specific vehicle across multiple non-overlapping cameras. Precise vehicle Re-ID suffers from two main challenges: (1) different vehicle identities with a similar appearance of the same type have a subtle inter-instance discrepancy, (2) one vehicle usually has large intra-instance differences due to viewpoint and illumination variations. To address these challenges, in this paper, we proposed an Attention-based Framework for Vehicle Re-ID named AFVR, which combines the benefits of both the cross-entropy loss function and the triplet loss function. Experimental results on two popular vehicle Re-ID benchmarks demonstrate the effectiveness of our proposed method, compared with the state of the arts. © 2019 IEEE.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

Representative local features mining for large-scale near-duplicates retrieval

Representative local features mining for large-scale near-du...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Xiaoguang Gu Yongdong Zhang Dongming Zhang Jintao Li Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology CAS Beijing China

Local features have been widely used in many computer vision related researches, such as near-duplicate image and video retrieval. However, the storage and query cost of local features become prohibitive on large-scale database. In this paper, we propose a representative local features mining method to generate a compact but more effective feature subset. First, we do an unsupervised annotation for all similar images(or frames in video) in the database. Second, we compute a comprehensive score for every local feature. The score function combines the robustness and discrimination. Finally, we sort all the local features in an image by their scores and the low-score local features can be removed. The selected local features are robust and discriminative, which can guarantee the better retrieval quality than using full of the original feature set. By our method, the number of local features can be significantly reduced and a large amount of storage and computational cost can be saved. The experimental results show that we can use 30% of the features to get a better query performance than that of full feature set.

关键词： Databases Robustness Vectors Visualization Feature extraction Binary codes Complexity theory

来源：评论

学校读者我要写书评

暂无评论

Forest-based translation

Forest-based translation

引用

46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, ACL-08: HLT

作者： Mi, Haitao Huang, Liang Liu, Qun Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing 100190 China Department of Computer and Information Science Levine Hall University of Pennsylvania 3330 Walnut Street Philadelphia PA 19104 United States

ISBN: (纸本)9781932432046

Among syntax-based translation models, the tree-based approach, which takes as input a parse tree of the source sentence, is a promising direction being faster and simpler than its string-based counterpart. However, current tree-based systems suffer from a major drawback: they only use the 1-best parse to direct the translation, which potentially introduces translation mistakes due to parsing errors. We propose a forest-based approach that translates a packed forest of exponentially many parses, which encodes many more alternatives than standard n-best lists. Large-scale experiments show an absolute improvement of 1.7 BLEU points over the 1-best baseline. This result is also 0.8 points higher than decoding with 30-best parses, and takes even less time. © 2008 Association for Computational Linguistics.

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：