虫虫首页| 资源下载| 资源专辑| 精品软件
登录| 注册

same

  • This approach addresses two difficulties simultaneously: 1) the range limitation of mobile robot se

    This approach addresses two difficulties simultaneously: 1) the range limitation of mobile robot sensors and 2) the difficulty of detecting buildings in monocular aerial images. With the suggested method building outlines can be detected faster than the mobile robot can explore the area by itself, giving the robot an ability to “see” around corners. At the same time, the approach can compensate for the absence of elevation data in segmentation of aerial images. Our experiments demonstrate that ground-level semantic information (wall estimates) allows to focus the segmentation of the aerial image to find buildings and produce a ground-level semantic map that covers a larger area than can be built using the onboard sensors.

    标签: simultaneously difficulties limitation addresses

    上传时间: 2014-06-11

    上传用户:waitingfy

  • The DHRY program performs the dhrystone benchmarks on the 8051. Dhrystone is a general-performanc

    The DHRY program performs the dhrystone benchmarks on the 8051. Dhrystone is a general-performance benchmark test originally developed by Reinhold Weicker in 1984. This benchmark is used to measure and compare the performance of different computers or, in this case, the efficiency of the code generated for the same computer by different compilers. The test reports general performance in dhrystones per second. Like most benchmark programs, dhrystone consists of standard code and concentrates on string handling. It uses no floating-point operations. It is heavily influenced by hardware and software design, compiler and linker options, code optimizing, cache memory, wait states, and integer data types. The DHRY program is available in different targets: Simulator: Large Model: DHRY example in LARGE model for Simulation Philips 80C51MX: DHRY example in LARGE model for the Philips 80C51MC

    标签: general-performanc benchmarks Dhrystone dhrystone

    上传时间: 2016-11-30

    上传用户:hphh

  • The literature of cryptography has a curious history. Secrecy, of course, has always played a centra

    The literature of cryptography has a curious history. Secrecy, of course, has always played a central role, but until the First World War, important developments appeared in print in a more or less timely fashion and the field moved forward in much the same way as other specialized disciplines. As late as 1918, one of the most influential cryptanalytic papers of the twentieth century, William F. Friedman’s monograph The Index of Coincidence and Its Applications in Cryptography, appeared as a research report of the private Riverbank Laboratories [577]. And this, despite the fact that the work had been done as part of the war effort. In the same year Edward H. Hebern of Oakland, California filed the first patent for a rotor machine [710], the device destined to be a mainstay of military cryptography for nearly 50 years.

    标签: cryptography literature has Secrecy

    上传时间: 2016-12-08

    上传用户:fxf126@126.com

  • Quaternions are hypercomplex numbers (that is generalizations of the complex numbers to higher dimen

    Quaternions are hypercomplex numbers (that is generalizations of the complex numbers to higher dimensions than two). For an introduction, refer to the Wikipedia article on Quaternions. Quaternion toolbox for Matlab® extends Matlab® to allow calculation with matrices of quaternions in almost the same way that one calculates with matrices of complex numbers. This is achieved by defining a private type to represent quaternion matrices and overloadings of many standard Matlab® functions. The toolbox supports real and complex quaternions (that is quaternions with four real or complex components).

    标签: numbers generalizations hypercomplex Quaternions

    上传时间: 2014-11-27

    上传用户:jhksyghr

  • The ZZIPlib provides read access on ZIP-archives. The library uses only the patent-free compression-

    The ZZIPlib provides read access on ZIP-archives. The library uses only the patent-free compression-algorithms supported by Zlib. It provides functions that transparently access files being either real files or zipped files, both with the same filepath

    标签: ZIP-archives compression patent-free The

    上传时间: 2017-01-02

    上传用户:yuzsu

  • This toolbox contains Matlab files that implement the nonsubsample contourlet transform and its util

    This toolbox contains Matlab files that implement the nonsubsample contourlet transform and its utility functions. Some Matlab files are the same as those in Contourlet Toolbox.

    标签: nonsubsample contourlet implement transform

    上传时间: 2017-01-14

    上传用户:lunshaomo

  • Eclipse+Web开发从入门到精通 These files contain all of the code listings in Java: The Complete Referenc

    Eclipse+Web开发从入门到精通 These files contain all of the code listings in Java: The Complete Reference, J2SE 5 Edition The source code is organized into files by chapter. For example, the file Chap7.code contains the programs shown in Chapter 7. Within each chapter file, the listings are stored in the same order as they appear in the book. Simply edit the appropriate file to extract the listing in which you are interested.

    标签: Complete Referenc listings Eclipse

    上传时间: 2017-01-20

    上传用户:as275944189

  • The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some no

    The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some nodes of a complete binary tree of height h (the code tree) to n simultaneous connections, such that no two assigned nodes (codes) are on the same root-to-leaf path. Each connection requires a code on a specified level. The code can change over time as long as it is still on the same level. We consider the one-step code assignment problem: Given an assignment, move the minimum number of codes to serve a new request. Minn and Siu proposed the so-called DCAalgorithm to solve the problem optimally. We show that DCA does not always return an optimal solution, and that the problem is NP-hard. We give an exact nO(h)-time algorithm, and a polynomial time greedy algorithm that achieves approximation ratio Θ(h). Finally, we consider the online code assignment problem for which we derive several results

    标签: combinatorial assignment problem arises

    上传时间: 2014-01-19

    上传用户:BIBI

  • These files contain all of the code listings in Java 2: The Complete Reference The source cod

    These files contain all of the code listings in Java 2: The Complete Reference The source code is organized into files by chapter. Within each chapter file, the listings are stored in the same order as they appear in the book. Simply edit the appropriate file to extract the listing in which you are interested. The code for Scrabblet is in its own ZIP file, called CHAP32.ZIP.

    标签: The Reference Complete listings

    上传时间: 2013-11-29

    上传用户:3到15

  • This sample shows different ways of performing anti-aliasing - both by using only the native hardwa

    This sample shows different ways of performing anti-aliasing - both by using only the native hardware AA support, and by mixing the hardware modes with additional supersampling. There are various ways in which the supersampled image can be down-sampled. The way we do the downsampling in this example is the same technique that was used in 2 of our latest launch demos – “Froggy” and “Adrianne”.

    标签: anti-aliasing performing different sample

    上传时间: 2014-01-11

    上传用户:haohaoxuexi