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

IEEE International Conference on Software engineering and Service Sciences (ICSESS)

作者： Shuai Yi Xueli Hu Hao Wu State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China Information Engineering University Zhengzhou China

ISBN: (纸本)9781479983544

Automatic reassembly of log file fragments from a collection of mixed fragments is one of the most important process during log file carving. In this paper we propose a general process model and design an algorithm based on graph theory for automatic reassembly of log file fragments. Finally, an experiment is designed and explored and results demonstrated the validity of the proposed model and algorithm.

关键词： Algorithm design and analysis Finite element analysis Graph theory File systems Semantics Probability Manganese

来源：评论

学校读者我要写书评

暂无评论

Exploiting Pure Superword Level Parallelism for Array Indirections

Exploiting Pure Superword Level Parallelism for Array Indire...

引用

International Symposium on Parallel Architectures, Algorithms and Programming (PAAP)

作者： Huihui Sun Rongcai Zhao Wei Gao Yi Gong Gang Li State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China Information Engineering University Zhengzhou China

SIMD (Single Instruction Multiple Data) extension units are ubiquitous in modern processors. Array indirections raise several challenges for SIMD vectorization including disjoint memory access, unknown alignment and dependence cycle. Existing SIMD automatic vectorization methods fail to handle these challenges very well. This paper presents a new method exploiting Pure SLP (Superword Level Parallelism) to address these problems. Dependence equation is rewritten to work out the dependence testing for index array. To address the problem of non-aligned and disjoint challenges, data alignment in recombinant registers and redundant statements are employed respectively. In addition, a precise cost model is proposed to guarantee positive benefits. Experiments on three typical array indirection applications extracted from SPEC2006 benchmarks verified the validity of this method.

关键词： Arrays Testing Indexes Parallel processing mathematical model Registers Program processors

来源：评论

学校读者我要写书评

暂无评论

An Algorithm of City-Level Landmark Mining Based on Internet Forum

An Algorithm of City-Level Landmark Mining Based on Internet...

引用

International Conference on Network-Based Information Systems (NBIS)

作者： Guang Zhu Xiangyang Luo Fenlin Liu Jingning Chen State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Science and Technology Institute Zhengzhou China

Density and accuracy of network entity landmarks are an important foundation of IP geolocation. For the existing problems of the limited quantity and low reliability of landmarks mined by current landmark mining methods, an algorithm of city-level landmark mining based on Internet forum is proposed in this paper. Firstly, the basic principle of Web-Based landmark mining methods and their existing flaws are analyzed, and then according to existing a huge amount of individual IP addresses in the Internet forums, a technical framework of network entity landmark mining based on the Internet forum is given, Next, the Internet forum selection strategy, IP addresses extraction, IP addresses screening and other major processing steps are described respectively for two major parts of the framework, including landmark extraction algorithm and landmark evaluation algorithm. The classic GeoTrack, a network entity geolocation algorithm, is improved and used for evaluating the candidate landmarks. Finally, the feasibility of our framework and algorithm are studied from 2 aspects: forum selection strategy, and Forum-Based landmark mining algorithm. Experimental results based on 27 Internet forums of 3 types forums in 3 cities show that compared with the classic Web-Based landmark mining methods, the proposed algorithm can not only mine huge amounts of city-level landmarks, but also improve the city-level network entity geolocation accuracy obviously.

关键词： IP networks Geology Web servers Reliability Data mining HTML

来源：评论

学校读者我要写书评

暂无评论

An Embedded FPGA Operating System Optimized for Vision computing (Abstract Only) 15

An Embedded FPGA Operating System Optimized for Vision Compu...

引用

Proceedings of the 2015 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays

作者： Zhilei Chai Jin Yu Zhibin Wang Jie Zhang Haojie Zhou Jiangnan University Wuxi China State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi China

ISBN: (纸本)9781450333153

Although FPGA's power and performance advantages were recognized widely, designing applications on FPGA-based systems is traditionally a task undertaken by hardware experts. It is significant to allow application-level programmers with less system-level but more algorithm knowledge to realize their applications conveniently on FPGAs. In this paper, an embedded FPGA operating system is proposed to facilitate application-level programmers to use FPGAs. Firstly, it builds specific I/Os and optimizes bus interconnection among I/Os, DDR memory, user IPs etc within the FPGA for vision computing. Secondly, it manages resources of the FPGA such as I/Os, DDR memory, communication etc, frees users from low-level details. Thirdly, it schedules tasks (IPs) executed on the FPGA dynamically in runtime, which makes the FPGA multiplexed when necessary. After porting the FPGA operating system to different FPGA platforms and implementing vision algorithms based on that, it shows the FPGA operating system is able to simplify algorithm development on FPGA platforms and improve portability of user applications. Furthermore, implementation results of several popular vision algorithms show the FPGA operating system is efficient and effective for vision computing. Finally, experimental results shows that for multiple algorithms requiring more FPGA resources, runtime task scheduling of multiple IPs is more efficient than a fixed IP when the SoC of FPGA is considered.

关键词： vision computing operating systems portability of applications application programmers fpgas

来源：评论

学校读者我要写书评

暂无评论

Bandwidth-based Application-Aware Multipath Routing for NoCs

Bandwidth-based Application-Aware Multipath Routing for NoCs

引用

2015 International Conference on Computer Information Systems and Industrial Applications(CISIA2015)

作者： X.T.Ding C.X.Yang X.W.Ren P J.Ren Institute of Artificial Intelligence and Robotics Xi'an Jiaotong University State Key Laboratory of Mathematical Engineering and Advanced Computing

ISBN: (纸本)9781510805750

Most of routing algorithms for On-chip communication are neither application-aware nor routing packets using multiple *** addition,they hardly consider link bandwidth variation resulting from widely applied global asynchronous local synchronous(GALS) *** this paper,we propose a bandwidth-based application-aware multipath routing(BAMR)algorithm to assign multiple routing paths by leveraging the knowledge of application and network bandwidth *** the increase of number of flows resulting from the split of flows,we present a new method named dynamic-amount fixed-number(DAFN) flow control mechanism to avoid *** compare our algorithm with XY,YX,and OITURN with synthetic traffic patterns and traffic trace of parallel implementation of *** demonstrate that BAMR achieves higher throughput with decrease in ***,the proposed algorithm achieves better workload balance by distributing traffic over multiple paths.

关键词： on-chip network GALS multiple routing

来源：评论

学校读者我要写书评

暂无评论

Fast Scalar Multiplication Algorithm Using Constrained Triple-Base Number System and Its Applications

Fast Scalar Multiplication Algorithm Using Constrained Tripl...

引用

International Conference on Broadband, Wireless computing, Communication and Applications (BWCCA)

作者： Yunqi Dou Jiang Weng Chuangui Ma Fushan Wei Zhengzhou Information Science and Technology Institute State key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

With the rapid development of embedded devices, wireless sensor network and Internet of Things, elliptic curve cryptography as a public key cryptography plays an important role to solve the security challenges. How to improve the efficiency of scalar multiplication is a challenging work for future deployment of these new technologies. Because of its sparsity, triple-base number system is used to accelerate the scalar multiplication in elliptic curve cryptography. Instead of using triple base chain, we introduce the concept of constrained tripe-base number system, which sets maximums for exponents of bases 2, 3 and 5. On this basis, we propose two fast scalar multiplication algorithms for the situations with and without precomputations. Our experiments show that the two algorithms are more efficient than 4-NAF, double-base chain and triple-base chain approaches. The improvement of efficiency makes the two scalar multiplication algorithms more suit for wireless sensor network.

关键词： Elliptic curves Elliptic curve cryptography Wireless sensor networks Greedy algorithms Jacobian matrices

来源：评论

学校读者我要写书评

暂无评论

Author Correction: Open-access quantitative MRI data of the spinal cord and reproducibility across participants, sites and manufacturers

引用

Scientific data 2021年第1期8卷 242页

作者： Julien Cohen-Adad Eva Alonso-Ortiz Mihael Abramovic Carina Arneitz Nicole Atcheson Laura Barlow Robert L Barry Markus Barth Marco Battiston Christian Büchel Matthew Budde Virginie Callot Anna J E Combes Benjamin De Leener Maxime Descoteaux Paulo Loureiro de Sousa Marek Dostál Julien Doyon Adam Dvorak Falk Eippert Karla R Epperson Kevin S Epperson Patrick Freund Jürgen Finsterbusch Alexandru Foias Michela Fratini Issei Fukunaga Claudia A M Gandini Wheeler-Kingshott Giancarlo Germani Guillaume Gilbert Federico Giove Charley Gros Francesco Grussu Akifumi Hagiwara Pierre-Gilles Henry Tomáš Horák Masaaki Hori James Joers Kouhei Kamiya Haleh Karbasforoushan Miloš Keřkovský Ali Khatibi Joo-Won Kim Nawal Kinany Hagen H Kitzler Shannon Kolind Yazhuo Kong Petr Kudlička Paul Kuntke Nyoman D Kurniawan Slawomir Kusmia René labounek Maria Marcella Laganà Cornelia Laule Christine S Law Christophe Lenglet Tobias Leutritz Yaou Liu Sara Llufriu Sean Mackey Eloy Martinez-Heras Loan Mattera Igor Nestrasil Kristin P O'Grady Nico Papinutto Daniel Papp Deborah Pareto Todd B Parrish Anna Pichiecchio Ferran Prados Àlex Rovira Marc J Ruitenberg Rebecca S Samson Giovanni Savini Maryam Seif Alan C Seifert Alex K Smith Seth A Smith Zachary A Smith Elisabeth Solana Y Suzuki George Tackley Alexandra Tinnermann Jan Valošek Dimitri Van De Ville Marios C Yiannakas Kenneth A Weber Ii Nikolaus Weiskopf Richard G Wise Patrik O Wyss Junqian Xu NeuroPoly Lab Institute of Biomedical Engineering Polytechnique Montreal Montreal QC Canada. jcohen@polymtl.ca. Functional Neuroimaging Unit CRIUGM Université de Montréal Montreal QC Canada. jcohen@polymtl.ca. Mila - Quebec AI Institute Montreal QC Canada. jcohen@polymtl.ca. NeuroPoly Lab Institute of Biomedical Engineering Polytechnique Montreal Montreal QC Canada. Department of Radiology Swiss Paraplegic Centre Nottwil Switzerland. Centre for Advanced Imaging The University of Queensland Brisbane Australia. Department of Radiology University of British Columbia Vancouver BC Canada. Athinoula A. Martinos Center for Biomedical Imaging Department of Radiology Massachusetts General Hospital Charlestown MA USA. Department of Radiology Harvard Medical School Boston MA USA. Harvard-Massachusetts Institute of Technology Health Sciences & Technology Cambridge MA USA. School of Information Technology and Electrical Engineering The University of Queensland Brisbane Australia. NMR Research Unit Queen Square MS Centre UCL Queen Square Institute of Neurology Faculty of Brain Sciences University College London London UK. Department of Systems Neuroscience University Medical Center Hamburg-Eppendorf Hamburg Germany. Department of Neurosurgery Medical College of Wisconsin Milwaukee WI USA. Aix-Marseille Univ CNRS CRMBM Marseille France. APHM Hopital Universitaire Timone CEMEREM Marseille France. Vanderbilt University Institute of Imaging Science Vanderbilt University Medical Center Nashville TN USA. Department of Computer and Software Engineering Polytechnique Montreal Montreal Canada. CHU Sainte-Justine Research Centre Montreal QC Canada. Centre de Recherche CHUS CIMS Sherbrooke Canada. Sherbrooke Connectivity Imaging Lab (SCIL) Computer Science department Université de Sherbrooke Sherbrooke Canada. Université de Strasbourg CNRS ICube Strasbourg France. UHB - University Hospital Brno and Masaryk University Department of Radiology and Nuclear

来源：评论

学校读者我要写书评

暂无评论

Ameba: A High-Performance and Energy-Efficient Online Video Retrieval System

Ameba: A High-Performance and Energy-Efficient Online Video ...

引用

IEEE International Conference on Multimedia Big Data (BigMM)

作者： Jin Yang Jianmin Pang Jintao Yu Wei Cao State Key Laboratory of Mathematical Engineering Advanced Computing Zhengzhou China State Key Laboratory of ASIC System Fudan University Shanghai China

ISBN: (纸本)9781479986897

This paper describes a high-performance and energy-efficient online video retrieval system called Ameba. Ameba contains a number of custom reconfigurable nodes which are grouped by a novel architecture. The system aims to address the performance and energy efficiency issues for large scale dynamic concurrent query requests. The open SURF approach and a Hamming distance based matching algorithm were implemented and improved on FPGA to increase the performance and energy efficiency. A predictive algorithm is proposed to forecast the trends of online query requests. This scalability which is obtained from the dynamic reconfiguration, makes the system have ability to improve its energy efficiency with the guarantee of performance. The simulation experiments are conducted with a considerable library which consists of 4650 videos with a combined length of more than 3000 hours. The comparative results demonstrate that Ameba has performance and energy efficiency advantages when facing large scale online video retrieval requests.

关键词： Field programmable gate arrays Energy efficiency Prediction algorithms Servers Computer architecture Streaming media Feature extraction

来源：评论

学校读者我要写书评

暂无评论

GCORE: A Gravitation-Based Approach for Chinese Open Relation

GCORE: A Gravitation-Based Approach for Chinese Open Relatio...

引用

International Conference on Computer Science and Mechanical Automation (CSMA)

作者： Yue Wang Gang Zhou Fei Tian Yu Nan Jiangtao Ma Information and Engineering University State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China Information and Engineering University Zhengzhou China

Traditional Relation Extraction (RE) trains individual extractors for pre-defined relations. Open Relation Extraction (ORE) can eschew domain-specific training data, tackle an unbounded number of relations, and scale up to massive and heterogeneous corpus such as the web. However, It is difficult to process micro log texts: the genre is noisy, utterances are very short, and texts have little context. As such, conventional RE approaches fail when faced with micro log and other Web texts. In this paper, we present a gravitation-based Chinese ORE approach to extracting relations between entities by using the idea of the law of universal gravitation. GCORE produces heuristic rules to extract entity relations, and calculates a confidence score for each relational tuple, which is directly proportional to the product of the frequency of entity pairs and the frequency of relation words, and inversely proportional to the square of the distance between the relation word and the candidate entity pair. The confidence score can be used to show the reliability of relational tuples. The higher the score, the more reliable the candidate tuple is, and vice versa. The experimental evaluation over two data sets from ZORE demonstrates the correctness and effectiveness of our proposed approach, and empirical results on Weibo texts show the universality of GCORE.

关键词： Reliability Data mining Context Information services Electronic publishing Internet Force

来源：评论

学校读者我要写书评

暂无评论

Carrier-depletion Mach-Zehnder silicon optical modulator for high-speed and multi-level applications

Carrier-depletion Mach-Zehnder silicon optical modulator for...

引用

IEEE International Conference on Group IV Photonics

作者： Jianfeng Ding Lin Yang Lei Zhang Ping Zhou State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi China State Key Laboratory on Integrated Optoelectronics Institute of Semiconductors Beijing China

We demonstrate a 64-Gbps carrier-depletion modulator which also can be used to generate the PAM-4 optical signal. This proves that the silicon optical modulator is suitable for different kinds of applications.

ISBN: (纸本)9781479982561

关键词： Optical device fabrication Nonlinear optics Optical modulation High-speed optical techniques Silicon

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：