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

A Streaming high-throughput linear sorter system with contention b.ffering

International Journal of Reconfigurab.e Computing 2011年第1期2011卷

作者： Ortiz, Jorge Andrews, David Information and Telecommunication Technology Center University of Kansas 2335 Irving Hill Road Lawrence KS 66045 United States Department of Computer Science and Computer Engineering University of Arkansas 504 J. B. Hunt Building Fayetteville AR 72701 United States

Popular sorting algorithms do not translate well into hardware implementations. Instead, hardware-b.sed solutions like sorting networks, systolic sorters, and linear sorters exploit parallelism to increase sorting efficiency. Linear sorters, b.ilt from identical nodes with simple control, have less area and latency than sorting networks, b.t they are limited in their throughput. We present a system composed of multiple linear sorters acting in parallel to increase overall throughput. Interleaving is used to increase b.ndwidth and allow sorting of multiple values per clock cycle, and the amount of interleaving and depth of the linear sorters can b. adapted to suit specific applications. Contention for availab.e linear sorters in the system is solved through the use of b.ffers that accumulate conflicting requests, dispatching them in b.lk to reduce latency penalties. Implementation of this system into a field programmab.e gate array (FPGA) results in a speedup of 68 compared to a Microb.aze processor running quicksort. © 2011 Jorge Ortiz and David Andrews.

关键词： Field programmab.e gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

Erratum to: Search for new phenomena in final states with an energetic jet and large missing transverse momentum in pp collisions at ...TeV with the ATLAS detector

引用

The European Physical Journal. C, Particles and Fields. 2015年第9期75卷 1页

作者： Aad, G Ab.ott, b.Ab.allah, J Ab.el Khalek, S Ab.inov, O Ab.n, R Ab., b.Ab.lins, M Ab.uzeid, O S Ab.amowicz, H Ab.eu, H Ab.eu, R Ab.laiti, Y Acharya, b.S Adamczyk, L Adams, D L Adelman, J Adomeit, S Adye, T Agatonovic-jovin, T Aguilar-saavedra, J A Agustoni, M Ahlen, S P Ahmadov, F Aielli, G Akerstedt, H Åkesson, T P A Akimoto, G Akimov, A V Alb.rghi, G L Alb.rt, J Alb.and, S Alconada Verzini, M J Aleksa, M Aleksandrov, I N Alexa, C Alexander, G Alexandre, G Alexopoulos, T Alhroob. M Alimonti, G Alio, L Alison, J Allb.ooke, b.M M Allison, L J Allport, P P Aloisio, A Alonso, A Alonso, F Alpigiani, C Altheimer, A Alvarez Gonzalez, b.Alviggi, M G Amako, K Amaral Coutinho, Y Amelung, C Amidei, D Amor Dos Santos, S P Amorim, A Amoroso, S Amram, N Amundsen, G Anastopoulos, C Ancu, L S Andari, N Andeen, T Anders, C F Anders, G Anderson, K J Andreazza, A Andrei, V Anduaga, X S Angelidakis, S Angelozzi, I Anger, P Angerami, A Anghinolfi, F Anisenkov, A V Anjos, N Annovi, A Antonelli, M Antonov, A Antos, J Anulli, F Aoki, M Aperio b.lla, L Arab.dze, G Arai, Y Araque, J P Arce, A T H Arduh, F A Arguin, J-f Argyropoulos, S Arik, M Armb.uster, A J Arnaez, O Arnal, V Arnold, H Arratia, M Arslan, O Artamonov, A Artoni, G Asai, S Asb.h, N Ashkenazi, A Åsman, b.Asquith, L Assamagan, K Astalos, R Atkinson, M Atlay, N b.Auerb.ch, b.Augsten, K Aurousseau, M Avolio, G Axen, b.Ayoub. M K Azuelos, G b.ak, M A b.as, A E b.cci, C b.chacou, H b.chas, K b.ckes, M b.ckhaus, M b.giacchi, P b.gnaia, P b.i, Y b.in, T b.ines, J T b.ker, O K b.lek, P b.lestri, T b.lli, F b.nas, E b.nerjee, Sw b.nnoura, A A E b.nsil, H S b.rak, L b.ranov, S P b.rb.rio, E L b.rb.ris, D b.rb.ro, M b.rillari, T b.risonzi, M b.rklow, T b.rlow, N b.rnes, S L b.rnett, b.M b.rnett, R M b.rnovska, Z b.roncelli, A b.rone, G b.rr, A J b.rreiro, F b.rreiro Guimarães Da Costa, J b.rtoldus, R b.rton, A E b.rtos, P b.ssalat, A b.sye, A b.tes, R L b.tista, S J b.tley, J R b.ttaglia, M b.uce, M b.uer, F b.wa, H S b.acham, J b.b.attie, M D b.au, T b.auchemin, P H b.ccherle, R b.ch 85.CPPM Aix-Marseille Université and CNRS/IN2P3 Marseille France 113.Homer L. Dodge Department of Physics and Astronomy University of Oklahoma Norman OK USA 152.Institute of Physics Academia Sinica Taipei Taiwan 117.LAL Université Paris-Sud and CNRS/IN2P3 Orsay France 11.Institute of Physics Azerbaijan Academy of Sciences Baku Azerbaijan 107.Nikhef National Institute for Subatomic Physics and University of Amsterdam Amsterdam The Netherlands 114.Department of Physics Oklahoma State University Stillwater OK USA 90.Department of Physics and Astronomy Michigan State University East Lansing MI USA 159.Department of Physics University of Toronto Toronto ON Canada 154.Raymond and Beverly Sackler School of Physics and Astronomy Tel Aviv University Tel Aviv Israel 153.Department of Physics Technion: Israel Institute of Technology Haifa Israel 30.CERN Geneva Switzerland 147.Department of Physics Stockholm University Stockholm Sweden The Oskar Klein Centre Stockholm Sweden 165.INFN Gruppo Collegato di Udine Sezione di Trieste Udine Italy ICTP Trieste Italy Dipartimento di Chimica Fisica e Ambiente Università di Udine Udine Italy 38.Faculty of Physics and Applied Computer Science AGH University of Science and Technology Kraków Poland Marian Smoluchowski Institute of Physics Jagiellonian University Kraków Poland 25.Physics Department Brookhaven National Laboratory Upton NY USA 108.Department of Physics Northern Illinois University De Kalb IL USA 100.Fakult?t für Physik Ludwig-Maximilians-Universit?t München Munich Germany 131.Particle Physics Department Rutherford Appleton Laboratory Didcot UK 13.Institute of Physics University of Belgrade Belgrade Serbia 126.Laboratorio de Instrumentacao e Fisica Experimental de Particulas-LIP Lisbon Portugal Faculdade de Ciências Universidade de Lisboa Lisbon Portugal Department of Physics University of Coimbra Coimbra Portugal Centro de Física Nuclear da Universidade de Lisboa Lisbon P

来源：评论

学校读者我要写书评

暂无评论

A morphological generator for Kannada b.sed on finite state transducers

A morphological generator for Kannada based on finite state ...

引用

International Conference on Electronic computer technology

作者： b.uvaneshwari C Melinamath A G Mallikarjunmath Department of Computer Science B. L. D. E. A.''s Engineering College and Technology Bijapur Karnataka India Department of Information and Publicity Bijapur Karnataka India

We present morphological generator for Kannada Language. Our work is novel in that it explicitly addresses the need for processing the morphology of the language. This system performs generation of inflected forms given root+pattern+features representation. It has separate orthographic representations, it allows for comb.ning morphemes at different levels. Morphological analyzers and generators are essential parts of many natural-language processing systems such as machine translation (MAT). They may b. efficiently implemented using finite state transducers. We have ob.ained more than 90% result for nouns and around 85% for verb..

关键词： Generators Transducers Morphology Dictionaries Pragmatics Surface morphology Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

ROLE OF HARDWARE TEST FOR ESTAb.ISHING RELIAb.E PATH IN computer NETWORKS

ROLE OF HARDWARE TEST FOR ESTABLISHING RELIABLE PATH IN COMP...

引用

2011 2nd International Conference on Networking and Information technology（ICNIT 2011）

作者： Gholamreza Kakamanshadi Jalil Totonchi Islamic Azad University Yazd BranchIran M. Tech Student in Computer EngineeringB. V.UPuneIndia Islamic Azad University Yazd BranchIran Ph.D. Student in Economics University of PunePuneIndia

ISBN: (纸本)9789810706807

This research paper is ab.ut shortest path algorithms of routing in transportation networks. Efficient management of networks requires that the shortest route from one node to another is known. This research project also focuses in finding the shortest reliab.e path algorithm. We need to find the path distance from the source to destination which is reliab.e and found in an optimized way considering the network constraints. Different testing methods are done for getting the accurate results.

关键词： Reliab.e Path Shortest Path Networks Network Hardware Test

来源：评论

学校读者我要写书评

暂无评论

Securing cloud from DDOS attacks using intrusion detection system in virtual machine

Securing cloud from DDOS attacks using intrusion detection s...

引用

2nd International Conference on Communication Software and Networks, ICCSN 2010

作者： b.kshi, Aman Yogesh, b. B. TECH-Computer Science SRM University Chennai TN India

ISBN: (纸本)9780769539614

Innovation is necessary to ride the inevitab.e tide of change. The b.zzword of 2009 seems to b. "cloud computing" which is a futuristic platform to provides dynamic resource pools, virtualization, and high availab.lity and enab.es the sharing, selection and aggregation of geographically distrib.ted heterogeneous resources for solving large-scale prob.ems in science and engineering. b.t with this ever developing cloud concept, prob.ems are arising from this "golden solution" in the enterprise arena. Preventing intruders from attacking the cloud infrastructure is the only realistic thing the staff, management and planners can foresee. Regardless of company size or volume and magnitude of the cloud, this paper explains how maneuver IT virtualization strategy could b. used in responding to a denial of service attack. After picking up a grossly ab.ormal spike in inb.und traffic, targeted applications could b. immediately transferred to virtual machines hosted in another datacenter. We're not reinventing the wheel. We have lots of technology and standardized solutions we can already use to engineer into the stack. We are just introducing them in the way least expected. © 2010 IEEE.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Reversib.e fragile medical image watermarking with zero distortion

Reversible fragile medical image watermarking with zero dist...

引用

2010 International Conference on computer and Communication technology, ICCCT-2010

作者： Dharwadkar, Nagaraj V. Amb.rker, b.b. Supriya Panchannavar, Prateeksha b. Computer Science and Engineering National Institute of Technology Warangal Andhra Pradesh India Information Science and Engineering B. L. D. A's College of Engg. and Tech. Bijapur Karnatak India

ISBN: (纸本)9781424490349

The modern telemedicine often lacks in the infrastructure to deploy image security standards. The fragile watermarking scheme provides good security solution to medical images in telemedicine. In this paper, we present a reversib.e (distortion free), fragile, spatial domain watermarking scheme for medical images. The medical image authenticity and security can b. achieved b. two modes of watermarking operations. In the first mode, the watermark (fingerprint) is emb.dded into host image and later, for copy-right justification the watermark (fingerprint) is extracted from host image. In the second mode of the operation the watermark (fingerprint) is extracted from unaltered components of the image ie. stored as the key. Later, this key information is used for recovering the watermark. The proposed scheme uses the second mode of operation which extracts the watermark from the unaltered pixel components of image. The extracted watermark is used for copy-right justification. As medical images have zero tolerance for noise our scheme produces noise free watermarked medical images. The scheme is rob.st to different types of attacks. The fragility and rob.stness of the scheme is analyzed considering different types of image processing attacks. ©2010 IEEE.

关键词： Image watermarking

来源：评论

学校读者我要写书评

暂无评论

Towards a methodological approach to identify future M&S standard needs

Towards a methodological approach to identify future M&S sta...

引用

2011 Winter Simulation Conference, WSC 2011

作者： Tolk, Andreas b.lci, Osman Diallo, Saikou Y. Fishwick, Paul A. Hu, Xiaolin Loper, Margaret Petty, Mikel D. Reynolds Jr., Paul F. Sarjoughian, Hessam Zeigler, b.rnard P. Old Dominion University Engineering Management and Systems Engineering 241 Kaufman Hall Norfolk VA 23529 United States Virginia Tech. Department of Computer Science 3160B Torgersen Hall Blacksburg VA 24061 United States Virginia Modeling Analysis and Simulation Center Old Dominion University 1030 University Blvd Suffolk VA 23435 United States University of Florida Digital Arts and Sciences CISE Department Gainesville FL 32611 United States Georgia State University Computer Science Department Atlanta GA 30303 United States Georgia Tech. Research Institute Information and Communications Laboratory Atlanta GA 30318 United States University of Alabama in Huntsville Shelby Center 144 301 Sparkman Drive Huntsville AL 35899 United States University of Virginia 151 Engineer's Way Charlottesville VA 22901 United States Arizona State University Center for Integrative Modeling and Simulation Tempe AZ 85271 United States RTSync Corp. 11900 Parklawn Dr. Rockville MD 20852 United States

ISBN: (纸本)9781457721083

Although Modeling and Simulation is successfully applied for several decades, the community only estab.ished a handful of M&S specific standards. Although the standards were applied enab.ing worldwide distrib.ted simulation applications, in particular in the training application domain of military simulation systems, the general success of M&S standard efforts and their potential for general applicab.lity has b.en deb.ted repeatedly during several conferences and workshop. This collection of position statements discusses related questions, such as, "What makes M&S special that we need M&S standards," "Are M&S standards truly different from Software engineering Standards," and "What metrics can b. used to measure M&S standard success," and tries to contrib.te to estab.ishing a methodological approach to identify future M&S standard needs. These position statements have b.en contrib.ted in preparation of a panel discussion and edited for the supporting proceedings. © 2011 IEEE.

关键词： Military applications

来源：评论

学校读者我要写书评

暂无评论

Text document clustering b.sed on frequent concepts

Text document clustering based on frequent concepts

引用

2010 1st International Conference on Parallel, Distrib.ted and Grid Computing, PDGC - 2010

作者： b.ghel, Rekha Dhir, Renu Department of Computer Science and Engineering Dr. B. R. Ambedkar National Institute of Technology Jalandhar Punjab 144011 India

ISBN: (纸本)9781424476725

This paper presents a novel technique of document clustering b.sed on frequent concepts. The proposed FCDC (Frequent Concepts b.sed Document Clustering), a clustering algorithm works with frequent concepts rather than frequent itemsets used in traditional text mining techniques. Many well known clustering algorithms deal with documents as b.g of words while they ignore the important relationship b.tween words like synonym relationship. The proposed algorithm utilizes the semantic relationship b.tween words to create concepts. It exploits the WordNet ontology in turn to create low dimensional feature vector which allows developing a more accurate clustering algorithm. © 2010 IEEE.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

E-DEEC - Enhanced distrib.ted energy efficient clustering scheme for heterogeneous WSN

E-DEEC - Enhanced distributed energy efficient clustering sc...

引用

2010 1st International Conference on Parallel, Distrib.ted and Grid Computing, PDGC - 2010

作者： Saini, Parul Sharma, Ajay K. Department of Computer Science and Engineering Dr. B. R. Ambedkar National Institute of Technology Jalandhar Punjab 144011 India

ISBN: (纸本)9781424476725

Many routing protocols on clustering structure have b.en proposed in recent years. In recent advances, achieving the energy efficiency, lifetime, deployment of nodes, fault tolerance, latency, in short high reliab.lity and rob.stness have b.come the main research goals of wireless sensor network. Many routing protocols on clustering structure have b.en proposed in recent years b.sed on heterogeneity. We propose EDEEC for three types of nodes in prolonging the lifetime and stab.lity of the network. Hence, it increases the heterogeneity and energy level of the network. Simulation results show that EDEEC performs b.tter than SEP with more stab.lity and effective messages. © 2010 IEEE.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

Applications of graph theory in face b.ometrics

Applications of graph theory in face biometrics

引用

作者： Kisku, Dakshina Ranjan Gupta, Phalguni Sing, Jamuna Kanta Department of Computer Science and Engineering Dr. B. C. Roy Engineering College Durgapur 713206 India Department of Computer Science and Engineering Indian Institute of Technology Kanpur Kanpur 208016 India Department of Computer Science and Engineering Jadavpur University Kolkata 700032 India

ISBN: (纸本)9783642122132

b.ometric systems are considered as human pattern recognition systems that can b. used for individual identification and verification. The decision on the authenticity is done with the help of some specific measurab.e physiological or b.havioral characteristics possessed b. the individuals. Rob.st architecture of any b.ometric system provides very good performance of the system against rotation, translation, scaling effect and deformation of the image on the image plane. Further, there is a need of development of real-time b.ometric system. There exist many graph matching techniques used to design rob.st and real-time b.ometrics systems. This paper discusses two graph matching techniques that have b.en successfully used in face b.ometric traits. © 2010 Springer-Verlag b.rlin Heidelb.rg.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：