Auctions are among the oldest economic institutions in place. They have been used since antiquity to sell a wide variety of goods, and their basic form has remained unchanged. In this dissertation, we explore the efficiency of common auctions when values are interdependent- the value to a particular bidder may depend on information available only to others-and asymmetric. In this setting, it is well known that sealed-bid auctions do not achieve efficient allocations in general since they do not allow the information held by different bidders to be shared.
标签： institutions antiquity Auctions economic
上传时间： 2014-07-14
上传用户：Breathe0125
1. This BSP can support 2443EVT0 board. If you want to use EVT0 BSP, set followings. In smdk2443\smdk2443.bat file set BSP_EVT1=1 -> set BSP_EVT1= In smdk2443\src\inc\bsp_cfg.h file #define EVT1 -> #define EVT0 2. Default system tick mode is changed. The value is fixed tick. Fixed tick means that tick interrupt is occurred every 1ms. Variable tick means that timer interrupt period is changed when power mode is in idle. For changing to variable tick In smdk2443\src\inc\bsp_cfg.h file #define FIXEDTICK -> #define VARTICK In smdk2443\src\Common\Timer\Sources file SOURCES= timer_fixedtick.c watchdog.c -> SOURCES= timer_vartick.c watchdog.c
标签： EVT0 followings BSP support
上传时间： 2014-01-27
上传用户：fnhhs
OTSU Gray-level image segmentation using Otsu s method. Iseg = OTSU(I,n) computes a segmented image (Iseg) containing n classes by means of Otsu s n-thresholding method (Otsu N, A Threshold Selection Method from Gray-Level Histograms, IEEE Trans. Syst. Man Cybern. 9:62-66 1979). Thresholds are computed to maximize a separability criterion of the resultant classes in gray levels. OTSU(I) is equivalent to OTSU(I,2). By default, n=2 and the corresponding Iseg is therefore a binary image. The pixel values for Iseg are [0 1] if n=2, [0 0.5 1] if n=3, [0 0.333 0.666 1] if n=4, ... [Iseg,sep] = OTSU(I,n) returns the value (sep) of the separability criterion within the range [0 1]. Zero is obtained only with images having less than n gray level, whereas one (optimal value) is obtained only with n-valued images.
标签： OTSU segmentation Gray-level segmented
上传时间： 2017-04-24
上传用户：yuzsu
The 2D CFD Program NaSt2D The program is a 2D solver for the incompressible, transient Navier-Stokes equations including the temperature equation and free boundary problems. It uses finite differences for discretization on a structured equidistant staggered grid, central and upwind (donor-cell) discretization of the convective parts and an explicit time stepping scheme. The free boundary value problems are treated with the MAC technique.
标签： incompressible Navier-Sto The transient
上传时间： 2013-11-30
上传用户：xfbs821
VLSi KL partitioning Algorithm based programme for 100 nodes. It s dynamic progremme so by changing the MAX value we can change the number of nodes in the network.
标签： partitioning Algorithm programme progremme
上传时间： 2013-12-05
上传用户：wweqas
< content="Hello,sik" Dim oFCKeditor Set oFCKeditor = New FCKeditor oFCKeditor.BasePath = "../fckeditor/" oFCKeditor.ToolbarSet = "Default" oFCKeditor.Width = "550" oFCKeditor.Height = "400" oFCKeditor.Value = content oFCKeditor.Create "Content" >
标签： oFCKeditor FCKeditor BasePath content
上传时间： 2017-05-20
上传用户：zhuoying119
This is a paragraph on the calculation of current harmonic content of M documents, using MATLAB implementation, high accuracy.
标签： calculation documents paragraph harmonic
上传时间： 2017-05-24
上传用户：lgnf
瑞萨单片机串口通讯的完整例程，初次用此单片可以参考一下。 High-performance Embedded Worshop开发环境，R8C族,E8A仿真开发板
上传时间： 2013-12-27
上传用户：独孤求源
) Compression using huffman code -with a number of bits k per code word -provide huffman table Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree.
标签： code Compression huffman provide
上传时间： 2017-05-30
上传用户：yuchunhai1990
In the last decade the processing of polygonal meshes has emerged as an active and very productive research area. This can basically be attributed to two developments: Modern geometry acquisition devices, like laser scanners and MRT, easily produce raw polygonal meshes of ever growing complexity Downstream applications like analysis tools (medical imaging), computer aided manufacturing, or numerical simulations all require high quality polygonal meshes as input. The need to bridge the gap between raw triangle soup data and high-quality polygon meshes has driven the research on ecient data structures and algorithms that directly operate on polygonal meshes rather than on a (most often not feasible) intermediate CAD representation.
标签： processing productive the polygonal
上传时间： 2017-06-03
上传用户：TF2015
