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

7th International Conference on Fluid Mechanics

作者： Wang, Chengwu Wei, Zhen Chongqing Univ 174 Shazhengjie Chongqing Peoples R China

The paper describes a virtual particle images generation system for 3D-PTV (Particle Tracking Velocimetry) verification. It's used for evaluating the accuracy of PTV algorithms and simulating the real experimental setup. At the first time, mass of virtual particles are generated in the world coordinate system and placed in the virtual flow field. After the camera system conversion from world coordinate to pixel coordinate is applied, the virtual particle images are produced. And the movement of virtual particles can be specified by researchers or given by the flow simulation results in FLUENT. The numbers of cameras and all the parameters of cameras both can be modified in this system. Even more, the illumination model of visual particles, geometry shape variation of visual particles, and defocus blur of visual particles are carefully considered here. Therefore, the virtual particle images generation system can fairly simulate real PTV setup and generate the virtual particle image sequences. It would be helpful to optimize the placement of cameras and the images quality of a real PTV. In addition, a well-known open-source PTV software is used to test the virtual particle images. The result shows that the virtual particles and its tracks can be calculated out as the images from real PTV cameras. As expected, the mismatching of particles in the results can easily be found through the comparison to the specified particles motion. (C) 2015 The Authors. Published by Elsevier Ltd.

关键词： virtual particles PTV verification matching algorithms flow visualization

来源：评论

学校读者我要写书评

暂无评论

Sieve-in-the-Middle: Improved MITM Attacks

Sieve-in-the-Middle: Improved MITM Attacks

引用

33rd Annual International Cryptology Conference (CRYPTO)

作者： Canteaut, Anne Naya-Plasencia, Maria Vayssiere, Bastien Inria Paris Rocquencourt Project Team SECRET Paris France Univ Versailles St Quentin En Yveline France

ISBN: (纸本)9783642400414;9783642400407

This paper presents a new generic technique, named sieve-in-the-middle, which improves meet-in-the-middle attacks in the sense that it provides an attack on a higher number of rounds. Instead of selecting the key candidates by searching for a collision in an intermediate state which can be computed forwards and backwards, we look for the existence of valid transitions through some middle sbox. Combining this technique with short bicliques allows to freely add one or two more rounds with the same time complexity. Moreover, when the key size of the cipher is larger than its block size, we show how to build the bicliques by an improved technique which does not require any additional data (on the contrary to previous biclique attacks). These techniques apply to PRESENT, DES, PRINCE and AES, improving the previously known results on these four ciphers. In particular, our attack on PRINCE applies to 8 rounds (out of 12), instead of 6 in the previous cryptanalyses. Some results are also given for theoretically estimating the sieving probability provided by some inputs and outputs of a given sbox.

关键词： Meet-in-the-middle bicliques sbox matching algorithms

来源：评论

学校读者我要写书评

暂无评论

End to end distance measurement algorithms in biology sequences 15

End to end distance measurement algorithms in biology sequen...

引用

15th Iberian Conference on Information Systems and Technologies (CISTI)

作者： Martins, Pedro Abbasi, Maryam Polytech Inst Viseu Dept Comp Sci Viseu Portugal Univ Coimbra Dep Comp Sci Coimbra Portugal

ISBN: (纸本)9789895465903

Biological information inside the DNA allows many characteristics variations. The translation of DNA from cells into sequences, is a very demanding computational process, which over the last decades biologists try to decode and understand. Search and match algorithms, mostly oriented to fuzzy search, are essential to define the structural biological sequences, and finding similarities. This paper revises algorithms used to search and match different types of strings. Our study show the complexity of the algorithms, and experimental results show that Boyer Mores algorithm is good, with 91% accuracy and 61 seconds of processing time. On the other hand, Brute Force algorithm was not so good, with 40% accuracy and 147 seconds of processing time.

关键词： DNA Patterns Genome Assembly Graph BigData Assemblers algorithms matching algorithms Keyword Search DNA sequence Distance Measurements

来源：评论

学校读者我要写书评

暂无评论

An Overview of Search and Match algorithms Complexity and Performance 8th

An Overview of Search and Match Algorithms Complexity and Pe...

引用

8th International Work-Conference on Bioinformatics and Biomedical Engineering (IWBBIO)

作者： Abbasi, Maryam Martins, Pedro Univ Coimbra Dept Comp Sci Coimbra Portugal Polytech Inst Viseu Dept Comp Sci Viseu Portugal

ISBN: (纸本)9783030453848;9783030453855

DNA data provide us a considerable amount of information regarding our biological data, necessary to study ourselves and learn about variant characteristics. Even being able to extract the DNA from cells and sequence it, there is a long way to process it in one step. Over past years, biologists evolved attempting to "decipher" the DNA code. Keyword search and string matching algorithms play a vital role in computational biology. Relationships between sequences define the biological functional and structural of the biological sequences. Finding such similarities is a challenging research area, comprehending BigData, that can bring a better understanding of the evolutionary and genetic relationships among the genes. This paper studied and analyzed different kinds of string matching algorithms used for biological sequencing, and their complexity and performance are assessed.

关键词： DNA Patterns Genome assembly Graph BigData Assemblers algorithms matching algorithms Keyword search DNA sequence Distance measurements

来源：评论

学校读者我要写书评

暂无评论

Optimal parallel scheduling algorithm for WDM optical interconnects with recirculating buffering

Optimal parallel scheduling algorithm for WDM optical interc...

引用

33rd International Conference on Parallel Processing

作者： Zhang, ZH Yang, YY SUNY Stony Brook Dept Elect & Comp Engn Stony Brook NY 11794 USA

ISBN: (纸本)0769521975

In this paper we study scheduling algorithms in WDM optical interconnects with recirculating buffering. The interconnect we consider has wavelength conversion capabilities. We focus on limited range wavelength conversion while considering full range wavelength conversion as a special case. We formalize the problem of maximizing throughput and minimizing packet delay in such an interconnect as a matching problem in a bipartite graph and give an optimal parallel algorithm that runs in O(Bk-2), as compared to O((N + B)(3)k(3)) time if directly applying other existing matching algorithms, where N is the number of input/output fibers, B is the number of fiber delay lines and k is the number of wavelengths per fiber.

关键词： parallel algorithms wavelength division multiplexing processor scheduling optical interconnections optical fibre networks buffer storage packet switching graph theory communication complexity optimal parallel scheduling algorithm WDM optical interconnects recirculating buffering wavelength conversion packet delay minimization bipartite graph matching algorithms fiber delay lines

来源：评论

学校读者我要写书评

暂无评论

Inter-Plane Inter-Satellite Connectivity in LEO Constellations: Beam Switching vs. Beam Steering

Inter-Plane Inter-Satellite Connectivity in LEO Constellatio...

引用

IEEE Global Communications Conference (GLOBECOM)

作者： Leyva-Mayorga, Israel Roeper, Maik Matthiesen, Bho Dekorsy, Armin Popovski, Petar Soret, Beatriz Aalborg Univ Dept Elect Syst Aalborg Denmark Univ Bremen Gauss Olbers Ctr Dept Commun Engn Bremen Germany Univ Bremen Univ Bremen Excellence Chair Dept Commun Engn Bremen Germany

ISBN: (纸本)9781728181042

Low Earth orbit (LEO) satellite constellations rely on inter-satellite links (ISLs) to provide global connectivity. However, one significant challenge is to establish and maintain inter-plane ISLs, which support communication between different orbital planes. This is due to the fast movement of the infrastructure and to the limited computation and communication capabilities on the satellites. In this paper, we make use of antenna arrays with either Butler matrix beam switching networks or digital beam steering to establish the inter-plane ISLs in a LEO satellite constellation. Furthermore, we present a greedy matching algorithm to establish inter-plane ISLs with the objective of maximizing the sum of rates. This is achieved by sequentially selecting the pairs, switching or pointing the beams and, finally, setting the data rates. Our results show that, by selecting an update period of 30 seconds for the matching, reliable communication can be achieved throughout the constellation, where the impact of interference in the rates is less than 0.7% when compared to orthogonal links, even for relatively small antenna arrays. Furthermore, doubling the number of antenna elements increases the rates by around one order of magnitude.

关键词： Antenna arrays low Earth orbit (LEO) satellites matching algorithms satellite constellations space communications

来源：评论

学校读者我要写书评

暂无评论

A Novel Fingerprinting Positioning Approach in Urban Cellular Networks 8

A Novel Fingerprinting Positioning Approach in Urban Cellula...

引用

8th IEEE International Conference on Communication Software and Networks (ICCSN)

作者： Abdelghani, Belaabed Qiang, Gao BUAA Univ Sch Elect & Informat Engn Beijing Peoples R China

ISBN: (纸本)9781509017812

In recent years, location-based services have become a fundamental application in smartphones. This kind of service can be applied in many fields, e.g., navigation, security, advertising, social networks, etc. The aim of this paper is to study the received signal strength-based fingerprinting positioning system in urban cellular networks. We investigate several classification algorithms through simulations. Furthermore, a new positioning method based on k-nearest neighbors has been proposed. This method was developed as a good solution for the design of hardware location systems, and to ensure a real time application.

关键词： fingerprinting positioning cellular positioning matching algorithms k-nearest neighbors

来源：评论

学校读者我要写书评

暂无评论

Developing a system for detecting the same content within the UBT academic institution, including special characters 19

Developing a system for detecting the same content within th...

引用

19th International-Federation-of-Automatic-Control (IFAC) Conference on Technology, Culture and International Stability (TECIS)

作者： Hajrizi, Edmond Zylfiu, Blerim Menxhiqi, Lavdim UBT Comp Sci Dept Prishtina Kosovo

One of the most acute problems in the academic world is plagiarism (prevention and detection). Based on this fact, numerous software systems have been developed in line with the growing demand from educational institutions. In principle, systems use string sort algorithms (matching algorithms) to detect possible cases of plagiarism. Each of them, although the original solution is prone to being sensitive in terms of security. These software platforms have some problems mainly in terms of the incompatibility of the character with the control system. This allows two identical documents (plagiarism and original) even though the same content is not detected by the system since they are written in a different alphabet (for the same characters). Plagiarism detection system addresses this problem by "translating" all data into a format where all characters are readable, exposing any document that is plagiarized (data). This is achieved by giving each character a unique value, regardless of the alphabet in which it is written in the document. This is accomplished through the implementation of different algorithms for sorting. This enables the system to face eventual errors where the client "cheats" the system and forces the system to compare documents in the database, written in an unsupported alphabet. (c) 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： matching algorithms String Sort Levenshtein Distance Knuth Morris Pratt Software Platform Plagiarism Detection

来源：评论

学校读者我要写书评

暂无评论

Mining Human Mobility Data and Social Media for Smart Ride Sharing 20

Mining Human Mobility Data and Social Media for Smart Ride S...

引用

20th IEEE International Conference on Mobile Data Management (IEEE MDM)

作者： de Lira, Vinicius Monteiro Univ Pisa Dipartimento Informat Pisa Italy CNR Pisa ISTI Pisa Italy Univ Fed Pernambuco Ctr Informat Recife PE Brazil

ISBN: (纸本)9781728133638

People living in highly-populated cities increasingly suffer an impoverishment of their quality of life due to pollution and traffic congestion problems caused by the huge number of circulating vehicles. The focus of this thesis is on improving ride sharing systems as a possible solution to reduce the number of circulating vehicles.

关键词： Ride-sharing matching algorithms Activity-Based Social Media Attendance Prediction

来源：评论

学校读者我要写书评

暂无评论

Impact Evaluation of Investments in the Appalachian Region: A Reappraisal

引用

INTERNATIONAL REGIONAL SCIENCE REVIEW 2018年第6期41卷 601-629页

作者： Sayago-Gomez, Juan-Tomas Piras, Gianfranco Jackson, Randall Lacombe, Donald Univ Icesi Dept Econ Cali Colombia Catholic Univ Amer Sch Business & Econ Washington DC 20064 USA West Virginia Univ Dept Geol & Geog Reg Res Inst Morgantown WV 26506 USA West Virginia Univ Reg Res Inst Morgantown WV 26506 USA

We evaluate the impact of a half century of nontransportation Appalachian Regional Commission (ARC) investments on its constituent counties using quasi-experimental methods. We apply a set of propensity score methods and select the most appropriate matching algorithm for use in identifying the effects of policy implementation. The results of the analyses indicate that counties that received ARC funding grew faster than the control counties. The long-run per capita income growth rate in ARC investment counties was an average of 5.5 percent higher than in the control counties. Employment also grew significantly faster in these ARC counties than in the control counties for most of the study period. The average difference in the long-run employment growth rates between the counties that received ARC investments and those counties that did not was approximately 4.2 percent.

关键词： quasi-experimental methods matching algorithms regional economic development

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：