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

IEEE International Symposium on Geoscience and Remote Sensing (IGARSS)

作者： Bor-Chen Kuo Chih-Sheng Huang Chih-Cheng Hung Yu-Lung Liu I-Ling Chen Graduate Institute of Educational Measurement and Statistics National Taichung University Taichung Taiwan School of Computing and Software Engineering Southern Polytechnic State University GA USA Department of Computer Science and Information Engineering Asia University Taichung Taiwan

In this study, a novel spatial information based support vector machine for hyperspectral image classification, named spatial-contextual semi-supervised support vector machine (SC 3 SVM), is proposed. This approach modifies the SVM algorithm by using the spectral information and spatial-contextual information. The concept of SC 3 SVM is to utilize other information, obtain from the pixels of a neighborhood system in the spatial domain, to modify the effective of each patterns. Experimental results show a sound performance of classification on the famous hyperspectral images, Indian Pine site. Especially, the overall classification accuracy of whole hyperspectral image (Indian Pine site with 16 classes) is up to 96.4%, the kappa accuracy is up to 95.9%.

关键词： Support vector machines Accuracy Hyperspectral imaging Training Classification algorithms Pixel

来源：评论

学校读者我要写书评

暂无评论

Robustify a job-shop schedule according to the payload of the machine

Robustify a job-shop schedule according to the payload of th...

引用

International Conference on Services Systems and Services Management, ICSSSM

作者： Zhiyang You Zhigang Sun Xibin Zhao Daxin Zang Department of Computer Science and Technology Tsinghua University Beijing China School of Software Tsinghua University Beijing China Key Laboratory of Information System Security Ministry of Education School of Software Tsinghua University Beijing China Software Engineering Institute Beijing Aeronautics and Astronautics University Beijing China

Robust scheduling is an effective way to solve job-shop scheduling problem (JSP) under a dynamic and stochastic environment with uncertainties, which may lead to numerous schedule disruptions. Maintaining the optimization obtained, the robust schedule is more stable in execution. The vast majority of the researches on robust scheduling concentrate on the development of the robustness and stabilization with an optimization target that minimizes makespan. However, other optimization targets are needed in reality, and in this paper, we introduce another optimization target that maximizes the payload of the machine, which can reflect the capacity of machine. This work applies a two-step way to achieve a robust schedule. A baseline schedule in the deterministic environment is generated first, which pursues standard optimization criterions, and then the temporal buffers are inserted into the baseline schedule which make the schedule absorb some level of unexpected disruption without rescheduling. According to the payload of each machine which should be close to the maximum at any time in execution, we can get each size of the temporal buffers inserted into the different operations. An extensive experiment is used to show the relative performance of the proposed robust schedule. It is shown that the schedule is robust and stable under the stochastic disturbance coupling with minimal makespan tardiness and symmetry payload.

关键词： Robustness Payloads Job shop scheduling Uncertainty Processor scheduling Dynamic scheduling Stochastic processes Switches computer science Space technology

来源：评论

学校读者我要写书评

暂无评论

A New Forward-Secure Proxy Signature Scheme

A New Forward-Secure Proxy Signature Scheme

引用

International Forum on information Technology and Applications, IFITA

作者： Jun He Ximei Li Lijuan Li Chunming Tang Computer and Information Engineering Department HuaiHua Vocational and Technical College Huaihua Hunan China School of Computer and Communication Hunan University Changsha Hunan China State Key Laboratory of Information Security CAS State Key Laboratory of Information Security Hunan China CAS Institute of Software Science Beijing China School of Mathematics and Information Science Guangzhou University Guangzhou Guangdong China

Based on the shortcomings of WCF scheme, this paper proposed an improved forward-secure proxy signature scheme. The new scheme does not evolve the authorized keys, but the proxy signer's private key, making it have the forward security. Even if the proxy signer's signature key at a certain time segment is given away, the attacker could not get the proxy signer's signature key in the previous time segment. Under these assumptions of strong RSA problem, computational Diffie-Hellman problem being hard, and discrete logarithm problem being hard in a finite field, the scheme has favorable security.

关键词： Digital signatures Public key Mathematical model Equations Authorization computers

来源：评论

学校读者我要写书评

暂无评论

Friend-based secure routing through challenges in mobile ad hoc networks

Friend-based secure routing through challenges in mobile ad ...

引用

International Symposium on Performance Evaluation of computer & Telecommunication Systems SPECTS

作者： Sanjay K. Dhurandher Mohammad S. Obaidat Karan Verma Pushkar Gupta Pravina Dhurandher Division of Information Technology Netaji Subhas Institute of Technology University of Delhi New Delhi India Department of Computer Science & Software Engineering Monmouth University NJ USA Karnataka State Open University Mysore Karnataka India

This paper proposes a Friend-based security scheme for efficient routing in mobile ad hoc networks. The idea behind this technique is the establishment of friend networks in the same way as the formation of friends in real life scenarios. The algorithm provides authentication of nodes by sending challenges and creating friend lists of nodes that complete the challenge. Friends are rated on the basis of the amount of data they transfer through themselves and according to the rating of other friends, which is obtained during the friend list sharing process. The data is finally routed through the route with the greatest number of trusted friends. One of the greatest advantages of this technique is that the nodes do not need to work in the promiscuous mode. The information about the malicious nodes is gathered effectively by using challenges. This reduces the overhead on the network significantly. Through various simulation experiments it has been found that the proposed algorithm works very efficiently in terms of detecting the malicious nodes and also allowing lesser number of packets to be routed through these detected malicious nodes.

关键词： Routing Peer to peer computing Ad hoc networks Protocols Cryptography Equations

来源：评论

学校读者我要写书评

暂无评论

The influence of AJAX on Web usability

The influence of AJAX on Web usability

引用

International Conference on e-Business

作者： Andreas Holzinger Stefan Mayr Wolfgang Slany Matjaz Debevc Institute of Medical Informatics Statistics and Documentation (IMI) Research Unit HCI4MED MedUni Graz & Institute of Information Systems and Computer Media (IICM) Technical University of Graz Graz Austria Institute of Software Technology (IST) Technische Universität Graz Graz Austria Faculty of Electrical Engineering and Computer Science University of Maribor Maribor Slovenia

In this paper we discusses some pros and cons of using AJAX for increasing the usability of Web applications. As AJAX allows Web applications look like desktop applications, it can increase the learnability of a Web application. Nevertheless, AJAX can also be the source of end user frustration if the XMLHttpRequest is not supported by the browser, Javascript is not available, or an Internet connection is missing. We also provide some workarounds for server response time gaps, for example by providing visible user feedback messages) and enabling the back button to work properly.

关键词： Usability Browsers Servers Web pages Electronic mail Internet

来源：评论

学校读者我要写书评

暂无评论

Leukemia cancer classification based on Support Vector Machine

Leukemia cancer classification based on Support Vector Machi...

引用

IEEE International Conference on Industrial Informatics (INDIN)

作者： Sung-Huai Hsieh Zhenyu Wang Po-Hsun Cheng I-Shun Lee Sheau-Ling Hsieh Feipei Lai Department of Computer Science and Information Engineering Providence University Taiwan Computing Laboratory Oxford University Oxford UK Department of Software Engineering National Kaohsiung Normal University Taiwan Network and Computer Centre National Chiao Tung University Hsinchu Taiwan Graduate Institute of Biomedical Electronics and Bioinformatics National Taiwan University Taiwan

In the paper, we classify cancer with the Leukemia cancer of medical diagnostic data. information gain has been adapted for feature selections. A Leukemia cancer model that utilizes information Gain based on Support Vector Machines (IG-SVM) techniques and enhancements to evaluate, interpret the cancer classification. The experimental results indicate that the SVM model illustrates the highest accuracy of classifications for Leukemia cancer.

关键词： Cancer Support vector machines Support vector machine classification Gene expression Entropy Machine learning computer science Biomedical engineering Data engineering Biomedical computing

来源：评论

学校读者我要写书评

暂无评论

Assessment of NER solutions against the first and second CALBC Silver Standard Corpus

Assessment of NER solutions against the first and second CAL...

引用

4th International Symposium on Semantic Mining in Biomedicine, SMBM 2010

作者： Rebholz-Schuhmann, Dietrich Yepes, Antonio Jimeno Li, Chen Kafkas, Senay Lewin, Ian Kang, Ning Corbett, Peter Milward, David Buyko, Ekaterina Beisswanger, Elena Hornbostel, Kerstin Kouznetsov, Alexandre Witte, René Laurila, Jonas B. Baker, Christopher J.O. Kuo, Cheng-Ju Clematide, Simone Rinaldi, Fabio Farkas, Richárd Móra, György Hara, Kazuo Furlong, Laura Rautschka, Michael Neves, Mariana Lara Pascual-Montano, Alberto Wei, Qi Collier, Nigel Chowdhury, Md. Faisal Mahbub Lavelli, Alberto Berlanga, Rafael Morante, Roser Van Asch, Vincent Daelemans, Walter Marina, José Luís Van Mulligen, Erik Kors, Jan Hahn, Udo EMBL Outstation European Bioinformatics Institute Hinxton Cambridge CB10 1SD United Kingdom Dept. of Medical Informatics Erasmus University Medical Center Rotterdam NL Netherlands Linguamatics Ltd. St. John's Innovation Centre Cambridge United Kingdom Lab. Friedrich-Schiller-Universität Jena Germany Dept. of Computer Science and Applied Statistics University of New Brunswick Canada Dept. of Computer Science and Software Engineering Concordia University Montreal Canada Institute of Information Science Academia Sinica Taipei 115 Taiwan University of Zürich Switzerland Research Group on Artificial Intelligence Hungarian Academy of Sciences Hungary Institute of Science and Technology Nara Japan IMIM DCEX Universitat Pompeu Fabra Barcelona Spain Madrid Spain National Institute of Informatics Tokyo Japan Fondazione Bruno Kessler Trento Italy Universitat Jaume I Spain CLiPS University of Antwerp Belgium Complutense University of Madrid Spain

Background: Text mining challenges have been organised to measure the performance of automatic text mining solutions against a manually annotated gold standard corpus (GSC). The preparation of the GSC is timeconsuming and costly and the final corpus consists at the most of a few thousand documents annotated with a limited set of semantic groups. To overcome these shortcomings, the CALBC project partners (PPs) have produced a large-scale annotated biomedical corpus with four different semantic groups through the harmonisation of annotations from automatic text mining solutions, the first version of the Silver Standard Corpus (SSC-I). The four semantic groups were chemical entities and drugs (CHED), genes and proteins (PRGE), diseases and disorders (DISO) and species (SPE). This corpus has been used for the First CALBC Challenge asking the participants to annotate the corpus with their annotation solutions.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Passive decoy-state quantum key distribution with practical light sources

引用

Physical Review A 2010年第2期81卷 022310-022310页

作者： Marcos Curty Xiongfeng Ma Bing Qi Tobias Moroder ETSI Telecomunicación Department of Signal Theory and Communications University of Vigo Campus Universitario E-36310 Vigo (Pontevedra) Spain Institute for Quantum Computing & Department of Physics and Astronomy University of Waterloo N2L 3G1 Waterloo Ontario Canada Center for Quantum Information and Quantum Control Department of Physics and Department of Electrical & Computer Engineering University of Toronto M5S 3G4 Toronto Ontario Canada Quantum Information Theory Group Institute of Theoretical Physics I University of Erlangen-Nürnberg D-91058 Erlangen Germany Max Planck Institute for the Science of Light D-91058 Erlangen Germany

Decoy states have been proven to be a very useful method for significantly enhancing the performance of quantum key distribution systems with practical light sources. Although active modulation of the intensity of the laser pulses is an effective way of preparing decoy states in principle, in practice passive preparation might be desirable in some scenarios. Typical passive schemes involve parametric down-conversion. More recently, it has been shown that phase-randomized weak coherent pulses (WCP) can also be used for the same purpose [M. Curty et al., Opt. Lett. 34, 3238 (2009).] This proposal requires only linear optics together with a simple threshold photon detector, which shows the practical feasibility of the method. Most importantly, the resulting secret key rate is comparable to the one delivered by an active decoy-state setup with an infinite number of decoy settings. In this article we extend these results, now showing specifically the analysis for other practical scenarios with different light sources and photodetectors. In particular, we consider sources emitting thermal states, phase-randomized WCP, and strong coherent light in combination with several types of photodetectors, like, for instance, threshold photon detectors, photon number resolving detectors, and classical photodetectors. Our analysis includes as well the effect that detection inefficiencies and noise in the form of dark counts shown by current threshold detectors might have on the final secret key rate. Moreover, we provide estimations on the effects that statistical fluctuations due to a finite data size can have in practical implementations.

关键词： Photodetectors

来源：评论

学校读者我要写书评

暂无评论

Multi-error-correcting amplitude damping codes

Multi-error-correcting amplitude damping codes

引用

IEEE International Symposium on information theory

作者： Runyao Duan Markus Grassl Zhengfeng Ji Bei Zeng State Key Laboratory of Intelligent Technology and Systems Tsinghua National Laboratory for Information Science and Technology Department of Computer Science and Technology Tsinghua University Beijing China Centre for Quantum Computation and Intelligent Systems (QCIS) Faculty of Engineering and Information Technology University of Technology Sydney NSW Australia Centre for Quantum Technologies National University of Singapore Singapore Perimeter Institute of Theoretical Physics Waterloo ONT Canada State Key Laboratory of Computer Science Institute of Software Chinese Academy and Sciences Beijing China Institute for Quantum Computing and the Department of Combinatorics and Optimization University of Waterloo Waterloo ONT Canada

ISBN: (纸本)9781424478903

We construct new families of multi-error-correcting quantum codes for the amplitude damping channel. Our key observation is that, with proper encoding, two uses of the amplitude damping channel simulate a quantum erasure channel. This allows us to use concatenated codes with quantum erasure-correcting codes as outer codes for correcting multiple amplitude damping errors. Our new codes are degenerate stabilizer codes and have parameters which are better than the amplitude damping codes obtained by any previously known construction.

关键词： Damping Quantum mechanics Quantum computing Error correction codes Noise level Laboratories Phase noise Physics computing Intelligent systems computer science

来源：评论

学校读者我要写书评

暂无评论

A new method for people-counting based on support vector machine

A new method for people-counting based on support vector mac...

引用

2nd International Conference on Intelligent Networks and Intelligent Systems, ICINIS 2009

作者： Zhu, Fang Gu, Junhua Yang, Xinwei Yang, Ruixia Information Engineering Institute Hebei University of Technology Tianjin China Computer Science and Software Institute Hebei University of Technology Tianjin China

ISBN: (纸本)9780769538525

This paper proposed a new method for infrared people-counting. According to the characteristics of the time continuous data collected by infrared sensors, the pattern recognition idea is introduced in the data processing procedure. After the special pretreatment, adaptive segmentation and feature extraction for the people-counting data, the feature vector is used as the inputs of the trained support vector machine classifier to classify and statistic the total number of the people who go through the infrared sensor area in a period of time. Compared with traditional people-counting using sensor, this method is more accurate and it can count the people number at the situation that several people go through the infrared sensor at the same time. Finally, the experiments indicate that the method can be applied in actual application. © 2009 IEEE.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：