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

Identity-based threshold signature secure in the standard model

International Journal of Network Security 2010年第1期10卷 75-80页

作者： Xiong, Hu Qin, Zhiguang Li, Fagen School of Computer Science and Engineering University of Electronic Science and Technology of China No. 4 Section 2 North Jianshe Road Chengdu 610054 China

Recently, design of Identity-based (ID-based) threshold signature schemes which are efficient and provably secure in the standard model has drawn great concerns. In this paper, an ID-based threshold signature scheme based on Paterson and Schuldt's signature scheme is presented. The proposed construction is proved secure in the standard model and its security rests on the hardness of the computational Diffie-Hellman problem. To the best of authors' knowledge, this is the first ID-based threshold signature scheme in the literature to achieve this security level.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Space network time distribution and synchronization protocol development for Mars proximity link

Space network time distribution and synchronization protocol...

引用

SpaceOps 2010 Conference

作者： Woo, Simon S. Gao, Jay L. Mills, David Communication Architecture and Research Section Jet Propulsion Laboratory California Institute of Technology 4800 Oak Grove Drive M/S 238-420 Pasadena CA 91109 United States Electrical and Computer Engineering University of Delaware Newark DE 19716 United States

ISBN: (纸本)9781624101649

Time distribution and synchronization in space networking are challenging due to long propagation delays, spacecraft movements, and relativistic effects, and therefore the Network Time Protocol (NTP) designed for terrestrial networks may not work properly. In this work, we consider a time distribution protocol that is based on time message exchanges similar to Network Time Protocol (NTP) but customized for the proximity space links such as the RF links between Mars orbiters and rovers. This protocol is called the Proximity-1 Space Link Interleaved Time Synchronization (PITS) protocol and is designed with goal of integrating with the CCSDS Proximity-1 Space Data Link Protocol's existing time capture capability. The PITS algorithm provides faster time synchronization via two-way time transfer over proximity links, improves scalability as the number of spacecraft increase, lowers storage space requirement for collecting time samples, and is robust against packet loss and misordering which underlying protocol mechanisms provide. This paper describes the current progress of implementing and validating the correctness of the PITS algorithm at JPL, using the Mars Proximity link communications scenarios as our baseline. © 2010 by the American Institute of Aeronautics and Astronautics, Inc.

关键词： Synchronization

来源：评论

学校读者我要写书评

暂无评论

Experimental validation of RF tomography

Experimental validation of RF tomography

引用

INTERNATIONAL UNION RADIO SCIENCE International Symposium on Electromagnetic Theory

作者： Picco, Vittorio Erricolo, Danilo Lo Monte, Lorenzo Department of Electrical and Computer Engineering University of Illinois at Chicago 851 South Morgan Street Chicago IL 60607-7053 United States General Dynamics Information Technology Navy and Air Force Section 5100 Springfield Pike Dayton OH 45431 United States

RF Tomography is a promising novel technology whose primary goal is the identification of underground cavities or tunnels. In this article, we propose scaled experiments in anechoic chamber to validate the numerical s... 详细信息

ISBN: (纸本)9781424451531

关键词： Tomography

来源：评论

学校读者我要写书评

暂无评论

Techniques for automatic magnetic resonance image classification

Techniques for automatic magnetic resonance image classifica...

引用

International Conference on Genetic and Evolutionary Computing

作者： Chen, Hsian-Min Chen, Shih-Yu Chai, Jyh Wen Chen, Clayton Chi-Chang Wu, Chao-Cheng Ouyang, Yen-Chieh Tsai, Ching Tsorng Yang, Ching-Wen Lee, San-Kan Chang, Chein-I Department of Biomedical Engineering Hungkuang University Taichung Taiwan Department of Electrical Engineering National Chung Hsing University Taichung Taiwan Section of Radiology College of Medicine China Medical University Taichung Taiwan Department of Radiology Taichung Veterans General Hospital Taichung Taiwan Department of Radiological Technology Central Taiwan University of Science and Technology Taichung Taiwan Department of Electrical Engineering National Taipei University of Technology Taipei Taiwan Computer Science Department Tunghai University Taichung Taiwan Computer Center Taichung Veterans General Hospital Taichung Taiwan Remote Sensing Signal and Image Processing Laboratory Department of Computer Science and Electrical Engineering University of Maryland Baltimore County Baltimore MD 21250 United States

ISBN: (纸本)9780769542812

Designing and developing automatic techniques for magnetic resonance images (MR) for data analysis is very challenging. One popular and public available method, FAST (FMRIB Automatic Segmentation Tool) has been widely used for automatic brain tissue segmentation for this purpose. This paper investigates limitations of this software algorithm on implementation and further develops a new approach to automatic MR brain tissue classification. The proposed new technique first implements an unsupervised training sample generation process (UTSGP) which includes a Pixel Purity Index (PPI) to generate an initial set of training samples that are further refined by a Support Vector Machine. The resulting training samples are then as a set of training samples for an Iterative Fisher's Linear Discriminant Analysis (IFLDA) which implements FLDA iteratively to improve classification. In order to conduct a fair comparison synthetic images are used for performance evaluation. Experimental results show that our proposed technique is superior in practical implementation to this software algorithm in several aspects of generalization ability, flexibility of choosing number of classes to be classified, avoidance of inconsistent results caused by different initial conditions. © 2010 IEEE.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

More on Elicitation of Software Requirements and Prioritization Using AHP

More on Elicitation of Software Requirements and Prioritizat...

引用

International Conference on Data Storage and Data engineering (DSDE)

作者： Mohd. Sadiq Jawed Ahmed Mohammad Asim Aslam Qureshi R. Suman Section of Computer Engineering Department Faculty of Engineering and Technology University Polytechnic Jamia Millia Islamia New Delhi India Department of Computer Science Faculty of Management and Information Technology Hamdard University New Delhi India Department of Computer Science and Engineering AL-Falah School of Engineering and Technology MDU Rohtak Haryana India Department of Computer Science and Engineering World College of Technology and Management MDU Rohtak Haryana India

ISBN: (纸本)9781424456789;9780769539584

The first method developed to translate customer requirements into software specification was the Quality Function deployment (QFD) and the second approach to the identification of software specification comes from the software engineering. Requirements may be defined as a demand or need. In software engineering, a requirement is a description of what a system should do. System may have dozen to thousands of requirements. Software requirements stipulate what must be accomplished, transformed, produced or provided. It is well documented that requirement engineering saves money. There are several techniques to elicit the software requirements like JAD, misuse, RAD, Web Surveys etc. In this paper we have used the Web Surveys approach to elicit the software requirements for a railway projects. The main objective of this paper is to improve the effectiveness and the efficiency of the freight transportation between source and destination using optimization algorithm.

关键词： Quality function deployment computer science Software engineering Manufacturing Costs technology management Software quality Reliability engineering Memory Data engineering

来源：评论

学校读者我要写书评

暂无评论

Volume-based magnetic resonance brain image classification

Volume-based magnetic resonance brain image classification

引用

International Conference on Genetic and Evolutionary Computing

作者： Chiou, Yaw-Jiunn Chai, Jyh-Wen Chen, Clayton Chi-Chang Chen, Shih-Yu Chen, Hsian-Min Ouyang, Yen-Chieh Su, Wu-Chung Tsai, Ching Tsorng Yang, Ching-Wen Lee, San-Kan Chang, Chein-I Department of Electrical Engineering National Chung Hsing University Taichung Taiwan Section of Radiology College of Medicine China Medical University Taichung Taiwan Department of Radiology Taichung Veterans General Hospital Taichung Taiwan Department of Radiological Technology Central Taiwan University of Science and Technology Taichung Taiwan Department of Biomedical Engineering Hungkuang University Taichung Taiwan Computer Science Department Tunghai University Taichung Taiwan Computer Center Taichung Veterans General Hospital Taichung Taiwan Remote Sensing Signal and Image Processing Laboratory Department of Computer Science and Electrical Engineering University of Maryland Baltimore County Baltimore MD 21250 United States

ISBN: (纸本)9780769542812

This paper develops a volume-based technique, called Volume Sphering Analysis (VSA) which can process all acquired Magnetic Resonance (MR) image slices-formed image cube using only one set of training samples obtained from an image slice. So, several significant advantages and benefits can be gained from our proposed VSA. In the past, when MR image classification is performed, each image slice requires its own specific training samples and training samples obtained from one slice are not applied to another slice. The VSA allows users to reduce computational time. In addition, it saves significant effort in selecting training samples for each of image slices. Thirdly, it is robust to all image slices compared to the traditional one-slice MR image classification which is sensitive to each image slice. Experimental results demonstrate that the VSA performs as well as does that using specifically selected training samples for individual image slices. © 2010 IEEE.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Plasma Process. Polym. 11/2011

引用

Plasma Processes and Polymers 2011年第11期8卷

作者： Chengxu Zhang Jue Hu Masaaki Nagatsu Yuedong Meng Wei Shen Hirotaka Toyoda Xingsheng Shu Institute of Plasma Physics Chinese Academy of Sciences P. O. Box 1126 Hefei P. R. China Department of Modern Physics University of Science and Technology of China 230026 P. R. China Nanovision Science Section Graduate School of Science and Technology Shizuoka University Naka-ku Hamamatsu Japan Department of Electrical Engineering and Computer Science Nagoya University Chikusa Nagoya Japan

来源：评论

学校读者我要写书评

暂无评论

Prominent boundaries detection technique for color images

Prominent boundaries detection technique for color images

引用

International Conference on Computing and Networking technology (ICCNT)

作者： Darshak G. Thakore A. I. Trivedi Computer Engineering Section Electrical Engineering Department B V M Engineering College Vallabh Vidyanagar Gujarat India Electrical Engineering Department Faculty of Technology & Engineering M. S. University슠of Baroda Vadodara India

The proposed novel method categorizes candidate boundaries into visually-prominent and non-prominent boundaries, considering local intensity cues of multiple color channels and pixel-prominence-values measured as a function of proximity-influence of other contours. The results of the method with and without incorporating a wavelet transform are compared for images of different characteristics, types and resolutions. The method has been exhaustively tested on textured, medical, natural, biometric and synthesized images for prominent boundaries detection. The method results are qualitatively compared with those of human segmented images of benchmark image-segmentation dataset. The results presented show suitability and compatibility of the method for detecting prominent boundaries in various images. These boundaries - forming regions, make the basis for object detection and identification.

关键词： Image segmentation Pixel Image color analysis Biomedical imaging Humans Image edge detection Back

来源：评论

学校读者我要写书评

暂无评论

Search for resonant top quark plus jet production in tt¯+jets events with the ATLAS detector in pp collisions at s=7 TeV

引用

Physical Review D 2012年第9期86卷 091103(R)-091103(R)页

作者： G. Aad T. Abajyan B. Abbott J. Abdallah S. Abdel Khalek A. A. Abdelalim O. Abdinov R. Aben B. Abi M. Abolins O. S. AbouZeid H. Abramowicz H. Abreu E. Acerbi B. S. Acharya L. Adamczyk D. L. Adams T. N. Addy J. Adelman S. Adomeit P. Adragna T. Adye S. Aefsky J. A. Aguilar-Saavedra M. Agustoni M. Aharrouche S. P. Ahlen F. Ahles A. Ahmad M. Ahsan G. Aielli T. Akdogan T. P. A. Åkesson G. Akimoto A. V. Akimov M. S. Alam M. A. Alam J. Albert S. Albrand M. Aleksa I. N. Aleksandrov F. Alessandria C. Alexa G. Alexander G. Alexandre T. Alexopoulos M. Alhroob M. Aliev G. Alimonti J. Alison B. M. M. Allbrooke P. P. Allport S. E. Allwood-Spiers J. Almond A. Aloisio R. Alon A. Alonso F. Alonso B. Alvarez Gonzalez M. G. Alviggi K. Amako C. Amelung V. V. Ammosov S. P. Amor Dos Santos A. Amorim N. Amram C. Anastopoulos L. S. Ancu N. Andari T. Andeen C. F. Anders G. Anders K. J. Anderson A. Andreazza V. Andrei X. S. Anduaga P. Anger A. Angerami F. Anghinolfi A. Anisenkov N. Anjos A. Annovi A. Antonaki M. Antonelli A. Antonov J. Antos F. Anulli M. Aoki S. Aoun L. Aperio Bella R. Apolle G. Arabidze I. Aracena Y. Arai A. T. H. Arce S. Arfaoui J-F. Arguin E. Arik M. Arik A. J. Armbruster O. Arnaez V. Arnal C. Arnault A. Artamonov G. Artoni D. Arutinov S. Asai R. Asfandiyarov S. Ask B. Åsman L. Asquith K. Assamagan A. Astbury M. Atkinson B. Aubert E. Auge K. Augsten M. Aurousseau G. Avolio R. Avramidou D. Axen G. Azuelos Y. Azuma M. A. Baak G. Baccaglioni C. Bacci A. M. Bach H. Bachacou K. Bachas M. Backes M. Backhaus E. Badescu P. Bagnaia S. Bahinipati Y. Bai D. C. Bailey T. Bain J. T. Baines O. K. Baker M. D. Baker S. Baker E. Banas P. Banerjee Sw. Banerjee D. Banfi A. Bangert V. Bansal H. S. Bansil L. Barak S. P. Baranov A. Barbaro Galtieri T. Barber E. L. Barberio D. Barberis M. Barbero D. Y. Bardin T. Barillari M. Barisonzi T. Barklow N. Barlow B. M. Barnett R. M. Barnett A. Baroncelli G. Barone A. J. Barr F. Barreiro J. Barreiro Guimarães da Costa P. Barrillon R. Bartoldus A. E. Barton V. Bartsch A. Basye R. L. Bates L. Batkova J. Fakultät für Mathematik und Physik Albert-Ludwigs-Universität Freiburg Germany Physikalisches Institut University of Bonn Bonn Germany Homer L. Dodge Department of Physics and Astronomy University of Oklahoma Norman Oklahoma USA Institut de Física d’Altes Energies and Departament de Física de la Universitat Autònoma de Barcelona and ICREA Barcelona Spain LAL Université Paris-Sud and CNRS/IN2P3 Orsay France Section de Physique Université de Genève Geneva Switzerland Institute of Physics Azerbaijan Academy of Sciences Baku Azerbaijan Nikhef National Institute for Subatomic Physics and University of Amsterdam Amsterdam Netherlands Department of Physics Oklahoma State University Stillwater Oklahoma USA Department of Physics and Astronomy Michigan State University East Lansing Michigan USA Department of Physics University of Toronto Toronto Ontario Canada Raymond and Beverly Sackler School of Physics and Astronomy Tel Aviv University Tel Aviv Israel DSM/IRFU (Institut de Recherches sur les Lois Fondamentales de l’Univers) CEA Saclay (Commissariat a l’Energie Atomique) Gif-sur-Yvette France INFN Sezione di Milano Italy Dipartimento di Fisica Università di Milano Milano Italy INFN Gruppo Collegato di Udine Italy ICTP Trieste Italy AGH University of Science and Technology Faculty of Physics and Applied Computer Science Krakow Poland Physics Department Brookhaven National Laboratory Upton New York USA Department of Physics Hampton University Hampton Virginia USA Department of Physics Yale University New Haven Connecticut USA Fakultät für Physik Ludwig-Maximilians-Universität München München Germany School of Physics and Astronomy Queen Mary University of London London United Kingdom Particle Physics Department Rutherford Appleton Laboratory Didcot United Kingdom Department of Physics Brandeis University Waltham Massachusetts USA Departamento de Fisica Teorica y del Cosmos and CAFPE Universidad de Granada Granada Spain Albert Einstein Center for

This paper presents a search for a new heavy particle produced in association with a top or antitop quark. Two models in which the new heavy particle is a color singlet or a color triplet are considered, decaying, respectively, to t¯q or tq, leading to a resonance within the tt¯+jets signature. The full 2011 ATLAS pp collision data set from the LHC (4.7 fb−1) is used to search for tt¯ events produced in association with jets, in which one of the W bosons from the top quarks decays leptonically and the other decays hadronically. The data are consistent with the Standard Model expectation, and a new particle with mass below 430 Gev for both W′ boson and color triplet models is excluded at 95% confidence level, assuming unit right-handed coupling.

关键词： QUARKS JETS (Nuclear physics) NUCLEAR counters COLLISIONS (Nuclear physics) STANDARD model (Nuclear physics) RADIOACTIVE decay ATOMIC mass

来源：评论

学校读者我要写书评

暂无评论

Strategies and approaches for multicast tree stability

Strategies and approaches for multicast tree stability

引用

Conference on Local computer Networks (LCN)

作者： Mohamed Aissa Adel Ben Mnaouer Abdelfettah Belghith College of Mathematical and Physical Sciences Computer Science Section University of Nizwa Nizwa Oman College of Computer Engineering and Information Technology Dar Al Uloom University Saudi Arabia HANA Research group ENSI University of Manouba Tunisia

In a dynamic network environment under heavy traffic load, shortest-path routing algorithms, particularly attempt to adapt to traffic changes, frequently exhibit oscillatory behaviors and cause performance degradation. In this paper, we first analyze, the instability factors and their results in the multicast infrastructure, and then analyze the solutions leading to stability in switched networks. Subsequently, we propose a solution to the above routing problem, where the route computation is based on the actual load on the network links. We propose a fast and simple heuristic algorithm named the Cost-Delay Shortest Path (CDSP) algorithm, which attempts to strike a balance between the different QoS parameters. The CDSP algorithm is based on a simple path exponential selection function taking simultaneously both the cost and delay into consideration and allowing the network load to be distributed in an optimal way.

关键词： Delay Routing Algorithm design and analysis Stability analysis Cost function Quality of service Complexity theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：