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

MIPPR 2005: Geospatial information, Data Mining, and Applications

作者： Yao, Min Jiang, Zhiwei Shen, Bin College of Computer Zhejiang University Hangzhou 310027 China Provincial Key Lab. for Computer Information Processing Technology in Jiangsu Suzhou University Suzhou 215006 China

Self-organization feature mapping (SOFM) networks have strong ability for self-learning and self-adaptive. According to the characteristics of human thought, this paper constructed a kind of combined criterion, which may be used to guide the learning of self-organization feature mapping network. Then this paper presents subsection algorithm, amalgamation algorithm and dynamical adaptive algorithm for SOFM networks so as to solve a kind of problems of classification rule mining. Finally, a practical example shows its flexibility and practicability.

关键词： Self organizing maps

来源：评论

学校读者我要写书评

暂无评论

Assessment of rotamer library for protein structure prediction

Assessment of rotamer library for protein structure predicti...

引用

2nd International Conference on information Science and Engineering, ICISE2010

作者： Huang, Xu Lü, Qiang Miao, Dajun Qian, Peide School of Computer Science and Technology Soochow University Suzhou 215006 China Jiangsu Provincial Key Lab for Information Processing Technologies Suzhou 215006 China

ISBN: (纸本)9781424480968

Side chain packing is a crucial step for protein structure prediction. And the quality of rotamer library has important implications in side chain packing. This paper assess dunbrack rotamer libraries and simple sampling rotamer libraries for certain structures by comparing the native structure and solutions come from rotamer libraries. Results of eleven hard targets in CASP9 show that the best solution is near to the native structure. Otherwise, there is no native structure in protein structure *** compare the best solutions which choosing by lower RMSD and energy, it shows that the best solution which choosing by lower energy is near to the best solution which choosing by low RMSD. So, in the case of unknown native structure, the energy guided choosing is necessary, but it must adopt some other method such as clustering to select the best solution. © 2010 IEEE.

关键词： Chains

来源：评论

学校读者我要写书评

暂无评论

Learning Dual-Domain Calibration and Distance-Driven Correlation Filter:A Probabilistic Perspective for UAV Tracking

引用

computers, Materials & Continua 2023年第12期77卷 3741-3764页

作者： Taiyu Yan Yuxin Cao Guoxia Xu Xiaoran Zhao Hu Zhu Lizhen Deng Jiangsu Province Key Lab on Image Processing and Image Communication Nanjing University of Posts and TelecommunicationsNanjingChina School of Computer Science Qufu Normal UniversityQufuChina National Engineering Research Center of Communication and Network Technology Nanjing University of Posts and TelecommunicationsNanjingChina

Unmanned Aerial Vehicle(UAV)tracking has been possible because of the growth of intelligent information technology in smart cities,making it simple to gather data at any time by dynamically monitoring events,people,the environment,and other aspects in the *** traditional filter creates a model to address the boundary effect and time filter degradation issues in UAV tracking *** these methods ignore the loss of data integrity terms since they are overly dependent on numerous explicit previous regularization *** light of the aforementioned issues,this work suggests a dual-domain Jensen-Shannon divergence correlation filter(DJSCF)model address the probability-based distance measuring issue in the event of filter *** two-domain weighting matrix and JS divergence constraint are combined to lessen the impact of sample imbalance and *** new tracking models that are based on the perspectives of the actual probability filter distribution and observation probability filter distribution are proposed to translate the statistical distance in the online tracking model into response *** model is roughly transformed into a linear equality constraint issue in the iterative solution,which is then solved by the alternate direction multiplier method(ADMM).The usefulness and superiority of the suggested strategy have been shown by a vast number of experimental findings.

关键词： Dual-domain weighting distance measure correlation filter ADMM

来源：评论

学校读者我要写书评

暂无评论

3D Representation of Chinese Event Factuality

3D Representation of Chinese Event Factuality

引用

第十五届汉语词汇语义学国际研讨会

作者： CAO Yuan ZHU Qiaoming LI Peifeng School of Computer Science and Technology of Soochow University Key Lab of Computer Information Processing Technology of Jiangsu Province

In general,Chinese event factuality is determined by the specific vocabularies and syntactic structures of *** Chinese event factuality corpus is to annotate these specific vocabularies and syntactic *** these information is raw and complex,it will result in high computation complexity and low correct rate if we use these information to compute factuality *** paper proposes a 3D representation of Chinese event factuality based on the annotated factual information in a Chinese event factuality *** also presents the transformation rules between the factual information and 3D representation and those between the 3D representation and event *** experimental results demonstrate the effectiveness of our 3D representation.

关键词： Representation of Chinese Event Factuality

来源：评论

学校读者我要写书评

暂无评论

Remote Authentication Scheme for Multi-Server Environment Based on Biometrics with Access Control 9

Remote Authentication Scheme for Multi-Server Environment Ba...

引用

2017 9th IEEE International Conference on Communication Software and Networks (ICCSN 2017)

作者： Min Zhang Wen-rong Tan School of Foreign Languages Southwest Minzu University Sichuan Province Key Lab of Signal and Information Processing Southwest Jiao Tong University School of Computer Science and Technology Southwest Minzu University

ISBN: (纸本)9781509038237;9781509038220

Compared with single-server authentication scheme, the authentication scheme for multi-server environment has a lot of advantages. Such as users needn’t to remember various passwords or register for every application server. In 2016, Irshad et al. proposed a three-factor scheme based on chaotic map for multi-server environment. Irshad’s scheme has high efficiency and strong robustness. However, after careful analysis, this paper shows that Irshad’s scheme still has many disadvantages. In order to solve these problems, a new three-factor authentication scheme based on secure sketch and Chebyshev chaotic map has been proposed in this paper. From the analysis, we can see that the proposed scheme has higher security level and deals with biometric more appropriately in spite of slight higher computation cost than Irshad’s scheme. What’s more, an access control method has been introduced for the purpose of making different users enjoy different access privileges with regard to the data. At the same time, the proposed scheme can achieve key agreement.

关键词： multi-server authentication secure sketch access control biometrics

来源：评论

学校读者我要写书评

暂无评论

An access control model in lager-scale P2P file sharing systems

An access control model in lager-scale P2P file sharing syst...

引用

7th International Conference on Computational Science (ICCS 2007)

作者： Yue Guang-xue Yu Fei Chen Li-ping Chen Yi-jun College of Information Engineering Jiaxing University 314000 China Department of Computer Science and Technology Huaihua University 418000 China State Key Lab. for Novel Software Technology Nanjing University 210093 China Jiangsu Provincial Key Laboratory of Computer Information Processing Technology Suzhou University 2150063 China

ISBN: (纸本)9783540725893

In lager-scale P2P file sharing systems, peers often must interact with unknown or unfamiliar peers without the benefit of trusted third parties or authorities to mediate the interactions. The decentralized and anonymous characteristics of P2P environments make the task of controlling access to sharing information more difficult. In this paper, we identify access control requirements and propose a trust based access control framework for P2P file-sharing systems. The model integrates aspects of trust and recommendation, fairness based participation schemes and access control schemes.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

PASS: An adaptive multi-copy routing scheme for intermittently connected mobile Ad Hoc networks

引用

Journal of Convergence information technology 2012年第14期7卷 315-323页

作者： Xu, Jia Wang, Ru Chuan Sun, Li Juan College of Computer Nanjing University of Posts and Telecommunications Nanjing China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing China Key Lab of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications Ministry of Education Jiangsu Province Nanjing China Key Laboratory for Computer Network and Information Integration Southeast University Ministry of Education Nanjing China State Key Lab. for Novel Software Technology Nanjing University Nanjing China

Intermittently Connected Mobile Ad Hoc Networks (ICMANs) are mobile networks in which complete source-to-destination paths do not exist most of the time. This paper proposed a Predictable Adaptive Seed Spray routing (PASS) for intermittently connected mobile Ad Hoc networks. PASS is a cost-efficient delay-bounded routing protocol without network parameters and provides acceptable and resilient service in the face of challenged environments. Simulations have shown that PASS outperforms existing schemes such as Epidemic, binary spray & wait and AMR with respect to routing cost and adaptability.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

MMLUP: Multi-Source & Multi-Task Learning for User Profiles in Social Network

引用

computers, Materials & Continua 2019年第9期61卷 1105-1115页

作者： Dongjie Zhu Yuhua Wang Chuiju You Jinming Qiu Ning Cao Chenjing Gong Guohua Yang Helen Min Zhou School of Computer Science and Technology Harbin Institute of TechnologyWeihai264209China College of Information Engineering Sanming University365004SanmingChina Fujian Province University Key Lab for Industry Big Data Analysis and Application FujianChina College of Information Engineering Qingdao Binhai UniversityQingdaoChina Jiangsu Province Wireless Sensing System Application Engneering Technology Research and Development Centre China School of Engineering Manukau Institute of TechnologyAuckland2241New Zealand

With the rapid development of the mobile Internet,users generate massive data in different forms in social network every day,and different characteristics of users are reflected by these social media *** to integrate multiple heterogeneous information and establish user profiles from multiple perspectives plays an important role in providing personalized services,marketing,and recommendation *** this paper,we propose Multi-source&Multi-task Learning for User Profiles in Social Network which integrates multiple social data sources and contains a multi-task learning framework to simultaneously predict various attributes of a ***,we design their own feature extraction models for multiple heterogeneous data ***,we design a shared layer to fuse multiple heterogeneous data sources as general shared representation for multi-task ***,we design each task’s own unique presentation layer for discriminant output of ***,we design a weighted loss function to improve the learning efficiency and prediction accuracy of each *** experimental results on more than 5000 Sina Weibo users demonstrate that our approach outperforms state-of-the-art baselines for inferring gender,age and region of social media users.

关键词： User profiles multi-source multi-task learning social network

来源：评论

学校读者我要写书评

暂无评论

An efficient coverage control algorithm for three-dimensional underwater sensor networks

引用

Advances in information Sciences and Service Sciences 2012年第10期4卷 393-399页

作者： Xiao, Fu Yang, Yang Sun, Li Wang, Ruchuan Nanjing University of Posts and Telecommunications Nanjing 210003 China Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou 215006 China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing 210003 China Key Lab of Broadband Wireless Communication and Sensor Network Technology Ministry of Education Nanjing 210003 China

Strategy of sensor nodes deployment is directly related to the cost and performance for underwater wireless sensor networks, which is largely determined the various service-quality improvement of wireless sensor networks. In order to improve the coverage of the target area, this paper presents a distributed algorithm of coverage control. Assume that nodes initially deployed on the surface of the water and can only move in vertical direction in 3-D space, the algorithm is first to control the nodes in-depth and relocate the nodes at different depths, then the nodes continue to adjust their depths until there is no augment for improving their coverage, and to achieve efficient coverage of the three-dimensional sensor networks ultimately. Experimental results show that compared with traditional random deployment method, the proposed coverage control algorithm can improve coverage of network effectively.

关键词： Quality control

来源：评论

学校读者我要写书评

暂无评论

Vertex-disjoint paths in the generalized hypercube under 1-restricted connectivity 21

Vertex-disjoint paths in the generalized hypercube under 1-r...

引用

21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on Data Science and Systems, HPCC/SmartCity/DSS 2019

作者： Wang, Guijuan Lin, Cheng-Kuan Fan, Jianxi Cheng, Baolei Liu, Zhao School of Computer Science and Technology Soochow University Suzhou215006 China College of Mathematics and Computer Science Fuzhou University Fuzhou350108 China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Jiangsu Province Nanjing210003 China Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou215006 China

ISBN: (纸本)9781728120584

The generalized hypercube is an excellent interconnection network since it includes many interconnection topologies and it can be used to construct many data center networks. Considering the probability that, in general, all neighbors of one vertex becoming faulty at the same time is extremely low, we assume that each vertex has at least one fault-free neighbor. An r-dimensional generalized hypercube is denoted by G(m-r, m-r-1,⋅, m-1). In this paper, we proposed an efficient algorithm which can construct at least κ^1(G) disjoint paths based on any two adjacent vertices in G(m-r, m-r-1, m-1) in O(rm) time where κ^1(G) is the 1-restricted connectivity of G(m-r, m-r-1, m-1). The maximum length of these disjoint paths is bounded by 7. © 2019 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：