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

problem-solving

  • Mobile phones are constantly decreasing in size, thereby complicating the acoustical functionality.

    Mobile phones are constantly decreasing in size, thereby complicating the acoustical functionality. Signal processing methods can be used to partially mitigate this problem. In this paper we suggest a method which uses multiple spectral subtraction functions and two microphones, introducing only a short signal delay.

    标签: functionality complicating acoustical constantly

    上传时间: 2015-11-15

    上传用户:youth25

  • The ability to write efficient, high-speed arithmetic routines ultimately depends upon your knowled

    The ability to write efficient, high-speed arithmetic routines ultimately depends upon your knowledge of the elements of arithmetic as they exist on a computer. That conclusion and this book are the result of a long and frustrating search for information on writing arithmetic routines for real-time embedded systems. With instruction cycle times coming down and clock rates going up, it would seem that speed is not a problem in writing fast routines. In addition, math coprocessors are becoming more popular and less expensive than ever before and are readily available. These factors make arithmetic easier and faster to use and implement. However, for many of you the systems that you are working on do not include the latest chips or the faster processors. Some of the most widely used microcontrollers used today are not Digital Signal Processors (DSP), but simple eight-bit controllers such as the Intel 8051 or 8048 microprocessors.

    标签: arithmetic high-speed ultimately efficient

    上传时间: 2014-11-30

    上传用户:lizhen9880

  • From the point of view of quality management, it is an important issue to reduce the transmission ti

    From the point of view of quality management, it is an important issue to reduce the transmission time in the network. The quickest path problem is to 6ndthe path in the network to senda given amount of data from the source to the sink such that the transmission time is minimized.

    标签: transmission management the important

    上传时间: 2013-12-19

    上传用户:nairui21

  • SharpZipLib之前叫做NZipLib

    SharpZipLib之前叫做NZipLib,完全由 C# 开发的压缩库,支持Zip, GZip, Tar and BZip2 ,为2007年8月最新0852release版的源文件和文档说明! Changes for v0.85.2 release Minor tweaks for CF, ZipEntryFactory and ZipFile. Fix for zip testing and Zip64 local header patching. FastZip revamped to handle file attributes on extract + other fixes Null ref in path filter fixed. Extra data handling fixes Revamped build and conditional compilation handling Many bug fixes for Zip64. Minor improvements to C# samples. ZIP-1341 Non ascii zip password handling fix. ZIP-355 Fix for zip compression problem at low levels

    标签: SharpZipLib NZipLib

    上传时间: 2015-12-11

    上传用户:84425894

  • SharpZipLib之前叫做NZipLib

    SharpZipLib之前叫做NZipLib,完全由 C# 开发的压缩库,支持Zip, GZip, Tar and BZip2 ,为2007年8月最新0852release版的代码实例! Changes for v0.85.2 release Minor tweaks for CF, ZipEntryFactory and ZipFile. Fix for zip testing and Zip64 local header patching. FastZip revamped to handle file attributes on extract + other fixes Null ref in path filter fixed. Extra data handling fixes Revamped build and conditional compilation handling Many bug fixes for Zip64. Minor improvements to C# samples. ZIP-1341 Non ascii zip password handling fix. ZIP-355 Fix for zip compression problem at low levels

    标签: SharpZipLib NZipLib

    上传时间: 2015-12-11

    上传用户:love_stanford

  • 旅行商问题

    旅行商问题,即TSP问题(Travelling Salesman Problem)是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市,他必须选择所要走的路径,路经的限制是每个城市只能拜访一次,而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。

    标签: 旅行商问题

    上传时间: 2013-12-21

    上传用户:1109003457

  • Carrier-phase synchronization can be approached in a general manner by estimating the multiplicativ

    Carrier-phase synchronization can be approached in a general manner by estimating the multiplicative distortion (MD) to which a baseband received signal in an RF or coherent optical transmission system is subjected. This paper presents a unified modeling and estimation of the MD in finite-alphabet digital communication systems. A simple form of MD is the camer phase exp GO) which has to be estimated and compensated for in a coherent receiver. A more general case with fading must, however, allow for amplitude as well as phase variations of the MD. We assume a state-variable model for the MD and generally obtain a nonlinear estimation problem with additional randomly-varying system parameters such as received signal power, frequency offset, and Doppler spread. An extended Kalman filter is then applied as a near-optimal solution to the adaptive MD and channel parameter estimation problem. Examples are given to show the use and some advantages of this scheme.

    标签: synchronization Carrier-phase multiplicativ approached

    上传时间: 2013-11-28

    上传用户:windwolf2000

  • An unsatisfactory property of particle filters is that they may become inefficient when the observa

    An unsatisfactory property of particle filters is that they may become inefficient when the observation noise is low. In this paper we consider a simple-to-implement particle filter, called ‘LIS-based particle filter’, whose aim is to overcome the above mentioned weakness. LIS-based particle filters sample the particles in a two-stage process that uses information of the most recent observation, too. Experiments with the standard bearings-only tracking problem indicate that the proposed new particle filter method is indeed a viable alternative to other methods.

    标签: unsatisfactory inefficient property particle

    上传时间: 2014-01-11

    上传用户:大三三

  • 《为Windows Vista编写安全的代码》

    《为Windows Vista编写安全的代码》,2007年出版 Providing developers with first-hand insights into design decisions and practical advice for solving real-world security issues, this authoritative guide urges developers to write more secure code on the Vista platform to support a growing customer base. Table of Contents Writing Secure Code for Windows Vista Foreword Introduction Chapter 1 - Code Quality Chapter 2 - User Account Control, Tokens, and Integrity Levels Chapter 3 - Buffer Overrun Defenses Chapter 4 - Networking Defenses Chapter 5 - Creating Secure and Resilient Chapter 6 - Internet Explorer 7 Defenses Chapter 7 - Cryptographic Enhancements Chapter 8 - Authentication and Authorization Chapter 9 - Miscellaneous Defenses and Security-Related Technologies Index List of Figures List of Tables List of Sidebars

    标签: Windows Vista 编写 代码

    上传时间: 2016-01-07

    上传用户:zxc23456789

  • We have a group of N items (represented by integers from 1 to N), and we know that there is some tot

    We have a group of N items (represented by integers from 1 to N), and we know that there is some total order defined for these items. You may assume that no two elements will be equal (for all a, b: a<b or b<a). However, it is expensive to compare two items. Your task is to make a number of comparisons, and then output the sorted order. The cost of determining if a < b is given by the bth integer of element a of costs (space delimited), which is the same as the ath integer of element b. Naturally, you will be judged on the total cost of the comparisons you make before outputting the sorted order. If your order is incorrect, you will receive a 0. Otherwise, your score will be opt/cost, where opt is the best cost anyone has achieved and cost is the total cost of the comparisons you make (so your score for a test case will be between 0 and 1). Your score for the problem will simply be the sum of your scores for the individual test cases.

    标签: represented integers group items

    上传时间: 2016-01-17

    上传用户:jeffery