You may read code because you have to-to fix it, inspect it, or improve it. You may read code the way an engineer examines a machine--to discover what makes it tick. Or you may read code because you are scavenging--looking for material to reuse. Code-reading requires its own set of skills, and the ability to determine which technique you use when is crucial. In this indispensable book, Diomidis Spinellis uses more than 600 real-world examples to show you how to identify good (and bad) code: how to read it, what to look for, and how to use this knowledge to improve your own code. Fact: If you make a habit of reading good code, you will write better code yourself.
上傳時(shí)間： 2017-08-13
上傳用戶：jyycc
Consider a BPSK and a QPSK system for the following two cases: 1) The probability that the symbol 1 is sent and the probability that the symbol 0 is sent are all the same. 2) The probability that the symbol 1 is sent is two times than the probability that the symbol 0 is sent. Assume that the noise is Gaussian distributed with mean=0 and 2 = 1.
標(biāo)簽： probability following the Consider
上傳時(shí)間： 2017-08-15
上傳用戶：凌云御清風(fēng)
Hibernate: A Developer s Notebook shows you how to use Hibernate to automate persistence: you write natural Java objects and some simple configuration files, and Hibernate automates all the interaction between your objects and the database. You don t even need to know the database is there, and you can change from one database to another simply by changing a few statements in a configuration file. If you ve needed to add a database backend to your application, don t put it off. It s much more fun than it used to be, and Hibernate: A Developer s Notebook shows you why.
標(biāo)簽： Hibernate persistence Developer you
上傳時(shí)間： 2017-08-17
上傳用戶：曹云鵬
This short paper will give you some VHDL code examples that will help you design synchronous circuits that work first time.The philosophy behind Ten-Commandment code is that synthesizers are not to be trusted too much. Most of the code you will see is close to the structural level some more overtly than others.
標(biāo)簽： will synchronous you examples
上傳時(shí)間： 2014-12-01
上傳用戶：sjyy1001
Click is a modular router toolkit. To use it you ll need to know how to compile and install the software, how to write router configurations, and how to write new elements. Our ACM Transactions on Computer Systems paper, available from the Web site, will give you a feeling for what Click can do. Using the optimization tools under CLICKDIR/tools, you can get even better performance than that paper describes.
標(biāo)簽： compile install modular toolkit
上傳時(shí)間： 2013-12-20
上傳用戶：wangchong
Implementation of Edmonds Karp algorithm that calculates maxFlow of graph. Input: For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, ending vertex and arc weight, separated by a space). The nodes are numbered from 1 to n. The node 1 and node n should be in different sets. There are no more than 30 arcs and 15 nodes. The arc weights vary between 1 and 1 000 000. Output: The output is a single line for each case, with the corresponding minimum size cut. Example: Input: 7 11 1 2 3 1 4 3 2 3 4 3 1 3 3 4 1 3 5 2 4 6 6 4 5 2 5 2 1 5 7 1 6 7 9 Output: 5
標(biāo)簽： Implementation calculates algorithm Edmonds
上傳時(shí)間： 2014-01-04
上傳用戶：kiklkook
The many variants of the Unix operating system require use of a mode of thought that s significantly different from the one that s required by simpler operating systems. Think Unix introduces readers to important fundamental and intermediate Unix commands and, in the process, inculcates them in the Unix way of thinking. It s a worthy goal in a world with more Linux users than ever, and author Jon Lasser accomplishes it. He s both a capable writer and a knowledgeable user of Unix shell commands. Lasser uses bash under Red Hat Linux in most examples--which usually apply equally well to other Unix variants--and makes asides about other shells and environments, as needed.
標(biāo)簽： significantly operating variants of
上傳時(shí)間： 2017-09-04
上傳用戶：qq521
This article describes a new efficient implementation of the Cooley-Tukey fast Fourier transform (FFT) algorithm using C++ template metaprogramming. thank to the recursive nature of the FFT, the source code is more readable and faster than the classical implementation. The efficiency is proved by performance benchmarks on different platforms.
標(biāo)簽： implementation Cooley-Tukey describes efficient
上傳時(shí)間： 2013-12-23
上傳用戶：netwolf
The running time of quicksort can be improved in practice by taking advantage of the fast running time of insertion sort when its input is “nearly” sorted. When quicksort is called on a subarray with fewer than k elements, let it simply return without sorting the subarray. After the top-level call to quicksort returns, run insertion sort on the entire array to finish the sorting process.
標(biāo)簽： running advantage quicksort improved
上傳時(shí)間： 2013-12-01
上傳用戶：梧桐
Behavioral models are used in games and computer graphics for realistic simulation of massive crowds. In this paper, we present a GPU based implementation of Reynolds [1987] algorithm for simulating flocks of birds and propose an extension to consider environment self occlusion. We performed several experiments and the results showed that the proposed approach runs up to three times faster than the original algorithm when simulating high density crowds, without compromising significantly the original crowd behavior.
標(biāo)簽： Behavioral simulation realistic computer
上傳時(shí)間： 2017-09-08
上傳用戶：hanli8870
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
