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

Incursion-Tolerance Based Secure Routing for Mobile Ad Hoc Networks

Incursion-Tolerance Based Secure Routing for Mobile Ad Hoc N...

The 4th International Conference on Wireless Communications, Networking and Mobile Computing(第四届IEEE无线通信、网络技术及移动计算国际会议)

作者： Hui Zhao Zhiyi Fang Xiuping Hou College of Computer Science and Engineering Changchun University of Technology College of Computer College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation College of Computer Science and Engineering Changchun University of Technology

Mobil Ad Hoc Networks is a dynamic wireless self-organizing networks. Routing techniques is a greatly import part of wireless networks protocol. Some recent routing protocol take into account secure factor, but these protocols yet cannot sufficient the actual demand because of the various forms of attacks to mobile self-organizing networks and self frangibility of mobile Ad Hoc networks. In this paper, the limitation of typical secure protocol has been analyzed, and designing a new routing Incursion-Tolerance based protocol ITDSR. It adopt work in natural monitoring mode to assure building quickest path between original node and destination node, and resolved the problems that baleful node could be contained in path route discovery phase whereas initiate attack on transmit data phase, and jam network on some node because of single path.

关键词： Attack Security Incursion-Tolerance Mobile Ad Hoc Networks

来源：评论

学校读者我要写书评

暂无评论

A New Authentication Protocol for Wireless Communication Network Based on IEEE802.16

A New Authentication Protocol for Wireless Communication Net...

引用

International Symposium on Parallel and Distributed Processing with Applications, ISPA

作者： Ruixue Li Zhiyi Fang Wei Cao Yumei Yin Peng Xu College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun China College of Information Technology Liaodong University Dandong China Changchun Institute of Optics Fine Mechanics and Physics Chinese Academy and Sciences Changchun China

After analyzing the specific security requirements of the wireless communication network based on IEEE802.16, a series of key issues about security methods and techniques were researched. A new authentication protocol for wireless mobile environment was proposed and designed. Then, its security was analyzed from the angle of technical realization and formal analysis to verify whether the original safety goals were achieved. Especially, formal analysis was mostly done. Finally, system testing was also carried out and the results were analyzed to verify function and performance of the new protocol.

关键词： Authentication Wireless application protocol Wireless communication Communication system security Information security Data security Safety Access protocols Clocks Synchronization

来源：评论

学校读者我要写书评

暂无评论

Research on Service-oriented Lifetime and Network Density in WSN

Research on Service-oriented Lifetime and Network Density in...

引用

The 9th International Conference for Young Computer Scientists(第九届国际青年计算机大会)

作者： Dayang Sun Yanheng Liu Aimin Wang Bin Ge College of Computer Science and Technology Jilin University College of Computer Science and Technol College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation School of Science Harbin Engineering University

In recent studies, the lifetime of Wireless Sensor Network(WSN) has been paid more attention to in order to evaluate the network performance. In this paper, service-oriented lifetime is proposed to provide a new method of assessment. The deployment of network can be guided by this assessment through placing more nodes where higher service quality is needed. In this way, the wasted energy can be reduced efficiently. To give a concrete scenario validating the feasibility of this assessment, a quantization process of network density is put forward subsequently. Both the theories and the simulations show that this method is feasible.

关键词： WSN lifetime service-oriented network density

来源：评论

学校读者我要写书评

暂无评论

Multilocus association analysis into susceptibility genes of schizophrenia

引用

Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (engineering and Technology Edition) 2008年第SUPPL. 2期38卷 205-212页

作者： Zhang, Hong-Li Liu, Yuan-Ning Zhang, Hao Yu, Ya-Qin Yu, Qiong Kou, Chang-Gui Shi, Jie-Ping Meng, Xiang-Fei Tao, Lu Qu, Ting College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Changchun 130012 China Research Center for Genomic Medicine School of Public Health Jilin University Changchun 130021 China

A model based on multilocus interaction of schizophrenia was designed. Using the program of MATLAB through a C-language interface, combined with Fisher's exact test, a total of 18 SNPs that came from 9 susceptibility genes of the cPLA2 and PNPLA8 family were analyzed to detect positive sites of schizophrenia in multilocus association analysis. Results show that 4 positive sites at rs3816533, rsl668589, rsl356410 and rs40848 were detected in 13 SNPs, which did not deviate from the Hardy-Weinberg equilibrium (P>0.05). The haplotype significance test of these positive sites indicates that 6 haplotypes passing through rs3816533, rsl668589, rsl356410 and 2 haplotypes passing through rs40848 are associated with schizophrenia.

关键词： MATLAB

来源：评论

学校读者我要写书评

暂无评论

An improved particle swarm optimization algorithm for flowshop scheduling problem

An improved particle swarm optimization algorithm for flowsh...

引用

International Conference on Information and Automation (ICIA)

作者： Bo Li Changsheng Zhang Ge Bai Erliang Zhang a. The computing center of Changchun Institute of Technology b. Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education c. Aviation university of air force Changchun China

The flowshop scheduling problem has been widely studied in the literature and many techniques have been applied to it, but few algorithms have been proposed to solve it using particle swarm optimization algorithm (PSO) based algorithm. In this paper, an improved PSO algorithm (IPSO) based on the ldquoall differentrdquo constraint is proposed to solve the flowshop scheduling problem with the objective of minimizing makespan. It combines the particle swarm optimization algorithm with genetic operators together effectively. When a particle is going to stagnates, the mutation operator is used to search its neighborhood. The proposed algorithm is tested on different scale benchmarks and compared with the recently proposed efficient algorithms. The results show that both the solution quality and the convergent speed of the IPSO algorithm precede the other two recently proposed algorithms. It can be used to solve large scale flowshop scheduling problem effectively.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Research and Design of Drawings Retrieval System Based on Spatial Relationships and Shape

Research and Design of Drawings Retrieval System Based on Sp...

引用

ISECS International Colloquium on Computing, Communication, Control, and Management, CCCM

作者： Haiyu Song Pengjie Wang Xiongfei Li Houjie Li Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun Jilin China The Research Institute of Computer Graphics and Image Processing Dalian Nationalities of University Dalian Liaoning China

CAD drawings reuse is of great importance in promoting design efficiency and productivity. The ability to retrieve CAD drawings is the core of drawings reuse task. Most of the existing drawings retrieval systems rely only on text descriptions. Due to complexity of visual feature, a little system is based on content. A simplified topological relationship is proposed to describe visual features for dimension reduction. An effective topological relationship vector is constructed by graph spectra. A novel retrieval system based on visual contents, including topological relationships, shape, and directional relationships, is proposed. The experiments show that the proposed approach and system are superior to the text-based and traditional content-based retrieval systems.

关键词： Shape Feature extraction Topology Indexing Design automation Data mining Visualization

来源：评论

学校读者我要写书评

暂无评论

Dynamic watermarking scheme based on the Shamir threshold and branch structure

引用

Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (engineering and Technology Edition) 2008年第SUPPL. 2期38卷 221-225页

作者： Yin, Ke Wang, Zhi-Quan Zhu, Jian-Qi Dong, Gang School of Automation Nanjing University of Science and Technology Nanjing 210094 China Electric Power Simulation and Control Engineering Center Nanjing Institute of Technology Nanjing 211167 China Key Laboratory of Symbol Computation and Knowledge Engineer College of Computer Science and Technology Jilin University Changchun 130012 China

A novel dynamic software watermark scheme based on the Shamir threshold and branch structure is presented. First, we split the watermark into a set of shares using the Shamir threshold scheme. Second, these values are encrypted with the DES block cipher that forms the watermark shares to be embedded into different methods of program according to the dynamic behavior of the branch structure. Our scheme can withstand most semantics-preserving attacks and can retrieve the original watermark based on partial information. Simulation tests show that our scheme is very robust, stealthy and has a high price performance rate compared with other methods.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Combining Immune with Ant Colony Algorithm for Geometric Constraint Solving

Combining Immune with Ant Colony Algorithm for Geometric Con...

引用

International Workshop on knowledge Discovery and Data Mining (WKDD)

作者： Hua Yuan Yi Li Wenhui Li Kong Zhao Duo Wang Rongqin Yi Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Jilin University Changchun China School of Computer Science & Engineering Changchun University of Technology China Suzhou Top Institute of Information Technology Suzhou China

Geometric constraint problem can be transformed to an optimization problem which the objective function and constraints are non-convex functions. In this paper an evolutionary algorithm based on ant colony optimization algorithm and the immune system model is proposed to provide solution to the geometric constraints problem. In the new algorithm, affinity calculation process and pheromone trail lying is embedded to maintain diversity and carry out the global search and the local search in many directions rather than one direction around the same individual simultaneously. This new algorithm different with current optimization methods in that it gets the good solution by excluding bad solutions. The experimental results reported here will shed more light into how affects the hybrid algorithm's search power in solving geometric constraint problem.

关键词： Immune system Ant colony optimization Nonlinear equations knowledge engineering Computer science Educational technology Evolutionary computation Data mining Laboratories Computer science education

来源：评论

学校读者我要写书评

暂无评论

Unsupervised key-phrases extraction from scientific papers using domain and linguistic knowledge

Unsupervised key-phrases extraction from scientific papers u...

引用

International Conference on Digital Information Management (ICDIM)

作者： Mikalai Krapivin Maurizio Marchese Andrei Yadrantsau Yanchun Liang Department of Information Engineering and Computer Science University of Trento Italy Department of Computer Science Belarusian State University Minsk Belarus College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University China

The domain of Digital Libraries presents specific challenges for unsupervised information extraction to support both the automatic classification of documents and the enhancement of userspsila navigation in the digital content. In this paper, we propose a combined use of machine learning techniques (i.e. Support Vector Machines) and Natural Language Processing techniques (i.e. Stanford NLP parser) to tackle the problem of unsupervised key-phrases extraction from scientific papers. The proposed method strongly depends on the robust structural properties of a scientific paper as well as on the lexical knowledge that we are able to mine from its text. For the experimental assessment we have use a subset of ACM papers in the Computer Science domain containing 400 documents. Preliminary evaluation of the approach shows promising result that improves - on the same data-set - on state-of-the-art Bayesian learning system KEA from a minimum 27% to a maximum 77% depending on KEA parameters tuning and specific evaluation set. Our assessment is performed by comparison with key-phrases assigned by human experts in the specific domain and freely available through ACM portal.

关键词： Data mining Software libraries Navigation Machine learning Support vector machines Support vector machine classification Natural language processing Robustness Computer science Bayesian methods

来源：评论

学校读者我要写书评

暂无评论

A Heuristic Clustering Algorithm for Mining Communities in Signed Networks

引用

Journal of Computer Science & Technology 2007年第2期22卷 320-328页

作者：杨博刘大有 College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China

Signed network is an important kind of complex network, which includes both positive relations and negative relations. Communities of a signed network are defined as the groups of vertices, within which positive relations are dense and between which negative relations are also dense. Being able to identify communities of signed networks is helpful for analysis of such networks. Hitherto many algorithms for detecting network communities have been developed. However, most of them are designed exclusively for the networks including only positive relations and are not suitable for signed networks. So the problem of mining communities of signed networks quickly and correctly has not been solved satisfactorily. In this paper, we propose a heuristic algorithm to address this issue. Compared with major existing methods, our approach has three distinct features. First, it is very fast with a roughly linear time with respect to network size. Second, it exhibits a good clustering capability and especially can work well with complex networks without well-defined community structures. Finally, it is insensitive to its built-in parameters and requires no prior knowledge.

关键词： complex network signed network community clustering graph theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：