VerboseGC demonstrates the use of the java.lang.management API to print the garbage collection statistics and memory usage remotely by connecting to a JMX agent with a JMX service URL: service:jmx:rmi:///jndi/rmi://<hostName>:<portNum>/jmxrmi where <hostName> is the hostname and <portNum> is the port Number to which the JMX agent will be connected.
标签： the demonstrates collection management
上传时间： 2013-12-26
上传用户：lgnf
We address the problem of blind carrier frequency-offset (CFO) estimation in quadrature amplitude modulation, phase-shift keying, and pulse amplitude modulation communications systems.We study the performance of a standard CFO estimate, which consists of first raising the received signal to the Mth power, where M is an integer depending on the type and size of the symbol constellation, and then applying the nonlinear least squares (NLLS) estimation approach. At low signal-to noise ratio (SNR), the NLLS method fails to provide an accurate CFO estimate because of the presence of outliers. In this letter, we derive an approximate closed-form expression for the outlier probability. This enables us to predict the mean-square error (MSE) on CFO estimation for all SNR values. For a given SNR, the new results also give insight into the minimum Number of samples required in the CFO estimation procedure, in order to ensure that the MSE on estimation is not significantly affected by the outliers.
标签： frequency-offset estimation quadrature amplitude
上传时间： 2014-01-22
上传用户：牛布牛
This paper investigates the design of joint frequency offset and carrier phase estimation of a multi-frequency time division multiple access (MF-TDMA) demodulator that is applied to a digital video broadcasting—return channel system via satellite (DVB-RCS). The proposed joint estimation algorithm is based on the interpolation technique for two correlation values in the frequency and phase domains. This simple interpolation technique can significantly improve frequency and phase resolution capabilities of the proposed technique without increasing the Number of the correlation values. In addition, the overall block diagram of a digital communications receiver for DVB-RCS is presented, which was designed using the proposed estimation algorithms. Index Terms—Carrier phase estimation, DVB-RCS, frequency offset estimation, interpolation, joint estimation, MF-TDMA.
标签： investigates estimation frequency carrier
上传时间： 2015-12-30
上传用户：ls530720646
VC6.0核心编程。主要涉及到windows消息，框架，mfc库以及相关编程，com,activex技术，数据库技术，网络编程技术。为英文版本。 The 6.0 release of Visual C++ shows Microsoft s continued focus on Internet technologies and COM, which are key components of the new Windows Distributed interNet Application Architecture (DNA). In addition to supporting these platform initiatives, Visual C++ 6.0 also adds an amazing Number of productivity-boosting features such as Edit And Continue, IntelliSense, AutoComplete, and code tips. These features take Visual C++ to a new level. We have tried to make sure that this book keeps you up to speed on the latest technologies being introduced into Visual C++.
上传时间： 2016-01-02
上传用户：lmeeworm
Linux 2.4.18 s3c2440 led driver 使用dev-C++撰寫，需要linux 2.4.18 kernel include，編譯完成後產生led module。 insmod main.o //安裝模組 mknod /dev/leds c 221 0 使用方法： int main(int argc, char *argv[]) { int testdev //led test... testdev = open("/dev/QuickMarkLed",O_RDWR) ioctl(testdev, 2, 1) //ioctl(device, led Number, open/close) open=1 ioctl(testdev, argv[1][0]- 0 , argv[2][0]- 0 ) //ioctl(device, led Number, open/close) open=1 close(testdev) return 0 }
标签： s3c2440 driver Linux dev-C
上传时间： 2014-01-01
上传用户：qlpqlq
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
TFIND searches for one or more strings (boolean AND) in a text file. TFIND reports all lines where the string(s) were found (or NOT found by option). The search can be limited to a field in a fixed field (i.e. column oriented) list. An extended search mode is available, where only letters and digits are relevant. Other options: case sensitive search, alternative errorlevel with Number of hits, header line with file name, LFN, custom prefix
标签： TFIND searches boolean reports
上传时间： 2016-01-24
上传用户：lindor
实用的单片机开发与应用程序，包括：中值滤波子程序，AD转换类程序，16、32位整型数开方，单片机音乐程序--祝你平安。对初学者很有帮助的。MCU development and practical applications, including: median filter subroutine, AD converter type of proceeding, 16,32-bit integer Number prescribing, SCM music program - I wish you peace. Helpful for beginners.
上传时间： 2016-01-27
上传用户：sunjet
This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given Number of cluster centers using the K-means algorithm. Output is directed to the screen.
标签： code implementing directory algorithm
上传时间： 2014-01-15
上传用户：woshini123456
Ink Blotting One method for escaping from a maze is via ‘ink-blotting’. In this method your starting square is marked with the Number ‘1’. All free, valid squares north, south, east and west around the Number ‘1‘ are marked with a Number ‘2’. In the next step, all free, valid squares around the two are marked with a ‘3’ and the process is repeated iteratively until : The exit is found (a free square other than the starting position is reached on the very edge of the maze), or, No more free squares are available, and hence no exit is possible.
标签： method ink-blotting Blotting escaping
上传时间： 2014-12-03
上传用户：123啊
