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

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Tian Bai Leiguang Gong Casimir A. Kulikowski Lan Huang Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China College of Computer Science and Technology Jilin University Changchun China Yantai Intelligent Information Technologies Ltd. Yantai China Department of Computer Science Rutgers The State University of New Jersey Piscataway NJ USA

Ontologies, seen as effective representations for sharing and reusing knowledge, have become increasingly important in biomedicine, usually focusing on taxonomic knowledge specific to a subject. Efforts have been made to uncover implicit knowledge within large biomedical ontologies by exploring semantic similarity and relatedness between concepts. However, much less attention has been paid to another potentially helpful approach: discovering implicit knowledge across multiple ontologies of different types, such as disease ontologies, symptom ontologies, and gene ontologies. In this paper, we propose a unified approach to the problem of ontology based implicit knowledge discovery - a Multi-Ontology Relatedness Model (MORM), which includes the formation of multiple related ontologies, a relatedness network and a formal inference mechanism based on set-theoretic operations. Experiments for biomedical applications have been carried out, and preliminary results show the potential value of the proposed approach for biomedical knowledge discovery.

关键词： Biological system modeling Biomedical measurement Ontologies Arthritis Diseases

来源：评论

学校读者我要写书评

暂无评论

A batch-mode active learning method based on the nearest average-class distance (NACD) for multiclass brain-computer interfaces

引用

Journal of Fiber Bioengineering and Informatics 2014年第4期7卷 627-636页

作者： Chen, Minyou Tan, Xuemin Gan, John Q. Zhang, Li Jian, Wenjuan State Key Laboratory of Power Transmission Equipment and System Security and New Technology School of Electrical Engineering Chongqing University Chongqing China School of Computer Science and Electronic Engineering University of Essex Colchester CO4 3SQ United States

In this paper, a novel batch-mode active learning method based on the nearest average-class distance (ALNACD) is proposed to solve multi-class problems with Linear Discriminate Analysis (LDA) classifiers. Using the Nearest Average-class Distance (NACD) query function, the ALNACD algorithm selects a batch of most uncertain samples from unlabeled data to improve gradually pre-trained classifiers' performance. As our method only needs a small set of labeled samples to train initial classifiers, it is very useful in applications like Brain-computer Interface (BCI) design. To verify the e®ectiveness of the proposed ALNACD method, we test the ALNACD algorithm on the Dataset 2a of BCI Competition IV. The test results show that the ALNACD algorithm o®ers similar classification results using less sample labeling e®ort than Random Sampling (RS) method. It also provides competitive results compared with active Support Vector Machine (active SVM), but uses less time than the active SVM in terms of the training.

关键词： Brain computer interface

来源：评论

学校读者我要写书评

暂无评论

A 20 GHz high speed, low jitter, high accuracy and wide correction range duty cycle corrector

A 20 GHz high speed, low jitter, high accuracy and wide corr...

引用

IEEE International SOC Conference

作者： Jun Guo Peng Liu Weidong Wang Jicheng Chen Yingtao Jiang College of Information Science and Electronic Engineering Zhejiang University Hangzhou China State Key Laboratory of High-end Server & Storage Technology Beijing China Department of Electrical and Computer Engineering University of Nevada Las Vegas Las Vegas NV USA

Duty-cycle correctors (DCCs) are employed in most high-speed VLSI systems to calibrate the clock duty-cycle at 50% to reduce the deterministic jitter introduced by duty-cycle distortion. An all-analogue feedback DCC circuitry with high working frequency, low jitter, high accuracy, and wide correction range is proposed in this paper. A common mode voltage adjuster and an active feedback amplifier are used to support the DCC to work at a high frequency up to 20 GHz with a wide correction range from 20% to 80%. On the feedback path, a second order duty cycle detector scheme is adopted including a low pass filter and an integrator to significantly reduce the jitter in the output clock and ensure high correction accuracy. Through simulation using 65 nm TSMC CMOS technology, the output duty cycle is corrected to 50±0.3% over the input duty-cycle range of 20-80% for 12.5-20 GHz. The DCC consumes 5.2 mW at 16 GHz using a 1.0 V supply voltage, and has a 572 fs peak-to-peak jitter and a 249 fs RMS jitter.

关键词： Clocks Jitter Bandwidth Voltage control Detectors Mathematical model computer architecture

来源：评论

学校读者我要写书评

暂无评论

Improved preimage attacks against reduced HAS-160

Improved preimage attacks against reduced HAS-160

引用

10th International Conference on information security Practice and Experience, ISPEC 2014

作者： Hao, Ronglin Li, Bao Ma, Bingke Li, Xiaoqian Department of Electronic Engineering and Information Science University of Science and Technology of China Hefei 230027 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing 100093 China

ISBN: (纸本)9783319063195

HAS-160 is a Korean industry standard for hash functions. It has a similar structure to SHA-1 and produces a 160-bit hash value. In this paper, we propose improved preimage attacks against step-reduced HAS-160 using the differential meet-in-the-middle technique and initial structure. Our work finds a pseudo-preimage of 70 steps of HAS-160 with a complexity of 2155.71 and this pseudo-preimage attack can be converted to a preimage attack with a complexity of 2158.86. Moreover, we reduce the complexity of previous pseudo-preimage attack on 65-step HAS-160 from 2143.4 to 2 139.09. To the best of our knowledge, our result on 70 steps is the best preimage attack on HAS-160 in terms of attacked steps © 2014 Springer International Publishing.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

A database encryption scheme based on the generalized aryabhata remainder theorem

引用

Journal of information Hiding and Multimedia Signal Processing 2014年第4期5卷 603-613页

作者： Liu, Yanjun Liu, Yanjun Chang, Chin-Chen Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei230039 China Department of Computer Science and Information Engineering Asia University Taichung413 Taiwan No.26 Hexing Road Xiangfang District Harbin China Department of Information Engineering and Computer Science Feng Chia University Taichung407 Taiwan

Database security prevents the disclosure of confidential data within a database to unauthorized users, and has become an urgent challenge for a tremendous number of database applications. Data encryption is a widely-used cryptographic technique for realizing database security in which the data kept in the database are encrypted into ciphertext. Inspired by Lin et al.’s database encryption system, we propose a record-oriented database encryption scheme based on the Generalized Aryabhata Remainder Theorem (GART). Analysis showed that our proposed scheme is more efficient than Lin et al.’s scheme, while retaining the same security. ©2014.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Potential predictability of vehicular staying time for large-scale Urban Environment

引用

IEEE Transactions on Vehicular technology 2014年第1期63卷 322-333页

作者： Li, Yong Ren, Wenyu Jin, Depeng Hui, Pan Zeng, Lieguang Wu, Dapeng State Key Laboratory on Microwave and Digital Communications Tsinghua National Laboratory for Information Science and Technology Department of Electronic Engineering Beijing 100084 China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong Hong Kong Telekom Innovation Laboratories Berlin 10587 Germany Department of Electrical and Computer Engineering University of Florida Gainesville FL 32611-6130 United States

The newly emerged vehicular communication network is seen as a key technology for solving increasingly serious vehicular traffic congestion and improving road safety. New applications of vehicular networks are also emerging at the same time. Predicting vehicular staying time is vital to both solving the vehicular system problem and building efficient vehicular networking. How much the vehicular staying duration of visits to different areas can be predicted is still an open and unsolved problem. In this paper, we use real vehicular traces in Beijing and Shanghai to explore the limit of predictability of the vehicular visiting time in different areas in large cities, and we analyze the impact of different precision and slot time on predictability. We conclude that using a proper time slot is an efficient way of prediction, and a higher predictability can be achieved if the requirement for precision is reduced. Among all the cases that we studied, we find the predictability to be 76.3% for Beijing and 82.5% for Shanghai in the case with the smallest slot time and reasonable requirements for precision. © 2013 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Convergence enhanced multi-objective particle swarm optimization with introduction of quorum-sensing inspired turbulence

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8794卷 394-403页

作者： Cheng, Shan Chen, Min-You Hu, Gang College of Electrical Engineering and New Energy China Three Gorges University Yichang443002 China State Key Laboratory of Power Transmission Equipment and System Security and New Technology Chongqing University Chongqing400044 China School of Electrical and Information Engineering Chongqing University of Science and Technology Chongqing401331 China

Enhancing the convergence property is one of the main goals to achieve when designing a multi-objective particle swarm optimization (MOPSO) algorithm. To promote convergence, a turbulence mechanism derived from the bacteria quorum sensing behavior is introduced and a novel MOPSO (MOPSO-QSIT) is proposed. The inspired turbulence mechanism takes into effect only if the whole current population’ velocities are rather small (less than a predefined threshold), which enables to maintain the swarm diversity and avoids declining the swarm evolution. The MOPSO-QSIT algorithm has been tested on a set of benchmark functions and compared with other multiobjective optimization algorithms that are representative of the state-of-the-art. Simulation results illustrate that the proposed algorithm possesses the best convergence performance while keep good diversity performance, and is a competitively effective global optimization tool. © Springer International Publishing Switzerland 2014.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

ONSA: Optimal non-uniformly statistic-source anonymity protocol in WSN

引用

Tongxin Xuebao/Journal on Communications 2015年第6期36卷 2015143-01-2015143-12页

作者： Niu, Xiao-Guang Wei, Chuan-Bo Feng, Wei-Jiang Peng, Guo-Jun Zhang, Huan-Guo School of Computer Science Wuhan University Wuhan430072 China Key Laboratory of Aerospace Information Security and Trusted Computing MOE Wuhan University Wuhan430072 China School of Computer Science National University of Defense Technology Changsha410073 China

According to the characteristics of hierarchical event source-location privacy (SLP) in wireless sensor networks (WSN). Firstly, the effect of the cluster size and the statistical property of fake packet injection on the privacy, latency and network traffic were analyzed. Then, an optimal non-uniformly statistic-source anonymity protocol (ONSA) was proposed to achieve source anonymity and reduce the network traffic. ONSA is designed to achieve a tradeoff between network traffic and real event report latency through adjusting the transmission rate and the radius of non-uniform clusters. The simulation results demonstrate that ONSA significantly reduces the network traffic while providing source anonymity and meeting the system requirement of the delay. ©, 2015, Editorial Board of Journal on Communications. All right reserved.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Noninvasive electrocardiographic imaging of cardiac arrhythmias: Enhance the diagnosis of bundle branch block

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8680卷 68-75页

作者： Wang, Liansheng Chen, Yiping Lin, Huangjing Ni, Dong Department of Computer Science School of Information Science and Engineering Xiamen University Xiamen China Guangdong Key Laboratory for Biomedical Measurements and Ultrasound Imaging Shenzhen518060 China College of Electronic Science and Engineering National University of Defense Technology Changsha China

Bundle Branch Block (BBB) is a heart disease which is usually diagnosed by the analysis of the ECG morphology and the duration of its QRS complex. Although body surface potential mapping (BSPM) provides more information than 12-lead ECG and is noninvasive, it is still not a visually direct method like in 3D heart model. In this paper we aim to propose a system in which the 3D transmem-brane potential is estimated and visualized in the 3D heart model to improve the diagnosis of BBB. Using patient CT and BSPM data, the system is able to reconstruct details of the complete electrical activity of BBB on the 3D heart model. With the quantitative analysis proposed, BBB patterns can be more easily distinguished in 3D model than by visual inspection of the standard ECG and BSPM, therefore enhancing BBB diagnosis for the physicians. © Springer International Publishing Switzerland 2014.

关键词： Electrocardiograms

来源：评论

学校读者我要写书评

暂无评论

Utility-based cooperative decision in cooperative authentication

Utility-based cooperative decision in cooperative authentica...

引用

33rd IEEE Conference on computer Communications, IEEE INFOCOM 2014

作者： Guo, Yunchuan Yin, Lihua Liu, Licai Fang, Binxing Institute of Information Engineering Chinese Academy of Sciences Beijing China Department of Computer Science Beijing University of Posts and Telecommunications Beijing China Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology China Beijing Key Laboratory of IOT Information Security Institute of Information Engineering CAS China

ISBN: (纸本)9781479933600

In mobile networks, cooperative authentication is an efficient way to recognize false identities and messages. However, an attacker can track the location of cooperative mobile nodes by monitoring their communications. Moreover, mobile nodes consume their own resources when cooperating with other nodes in the process of authentication. These two factors cause selfish mobile nodes not to actively participate in authentication. In this paper, a bargaining-based game for cooperative authentication is proposed to help nodes decide whether to participate in authentication or not, and our strategy guarantees that mobile nodes participating in cooperative authentication can obtain the maximum utility, all at an acceptable cost. We obtain Nash equilibrium in static complete information games. To address the problem of nodes not knowing the utility of other nodes, incomplete information games for cooperative authentication are established. We also develop an algorithm based on incomplete information games to maximize every node's utility. The simulation results demonstrate that our strategy has the ability to guarantee authentication probability and increase the number of successful authentications. © 2014 IEEE.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：