亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

蟲蟲首頁| 資源下載| 資源專輯| 精品軟件
登錄| 注冊(cè)

asymmetric

  • A branch-and-bound algorithm for asymmetric TSP

    A branch-and-bound algorithm for asymmetric TSP

    標(biāo)簽: branch-and-bound asymmetric algorithm TSP

    上傳時(shí)間: 2014-01-27

    上傳用戶:zmy123

  • Abstract-The effect of the companding process on QAM signals has been under investigation for the p

    Abstract-The effect of the companding process on QAM signals has been under investigation for the past several years. The compander, included in the PCM telephone network to improve voice performance, has an unusual affect on digital QAM data signals which are transmitted over the same channel. The quantization noise, generated by the companding process which is multiplicative (and asymmetric), degrades the detectability performance of the outermost points of the QAM constellation more than that of the inner points. The combined effect of the companding noise and the inherent white gaussian noise of the system, leads us to a re-examination of signal constellation design. In this paper we investigate the detectability performance of a number of candidates for signal constellations including, a typical rectangular QAM constellation, the same constellation with the addition of a smear-desmear operation, and two new improved QAM constellation designs with two-dimensional warpi

    標(biāo)簽: investigation Abstract-The companding the

    上傳時(shí)間: 2013-12-20

    上傳用戶:英雄

  • very simple nonvisual Delphi component useful for shareware program developing. It uses crypted lic

    very simple nonvisual Delphi component useful for shareware program developing. It uses crypted license files containing information about exe file (size and crc), expired date and any additional information. As TArtLicense uses RSA asymmetric algorithm and TArtLicense knows only decryption key, nobody can change information inside license file.

    標(biāo)簽: developing nonvisual component shareware

    上傳時(shí)間: 2017-04-08

    上傳用戶:561596

  • Auctions are among the oldest economic institutions in place. They have been used since antiquity to

    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.

    標(biāo)簽: institutions antiquity Auctions economic

    上傳時(shí)間: 2014-07-14

    上傳用戶:Breathe0125

  • a true random number generator (TRNG) in hardware which is targeted for FPGA-based crypto embedded s

    a true random number generator (TRNG) in hardware which is targeted for FPGA-based crypto embedded systems. All crypto protocols require the generation and use of secret values that must be unknown to attackers.Random number generators (RNG) are required to generate public/private key pairs for asymmetric algorithm such as RSA and symmetric algorithm such as AES.

    標(biāo)簽: FPGA-based generator embedded hardware

    上傳時(shí)間: 2014-01-09

    上傳用戶:一諾88

  • Fundamental Limits on a Class of Secure

    Abstract—In the future communication applications, users may obtain their messages that have different importance levels distributively from several available sources, such as distributed storage or even devices belonging to other users. This scenario is the best modeled by the multilevel diversity coding systems (MDCS). To achieve perfect (information-theoretic) secrecy against wiretap channels, this paper investigates the fundamental limits on the secure rate region of the asymmetric MDCS (AMDCS), which include the symmetric case as a special case. Threshold perfect secrecy is added to the AMDCS model. The eavesdropper may have access to any one but not more than one subset of the channels but know nothing about the sources, as long as the size of the subset is not above the security level. The question of whether superposition (source separation) coding is optimal for such an AMDCS with threshold perfect secrecy is answered. A class of secure AMDCS (S-AMDCS) with an arbitrary number of encoders is solved, and it is shown that linear codes are optimal for this class of instances. However, in contrast with the secure symmetric MDCS, superposition is shown to be not optimal for S-AMDCS in general. In addition, necessary conditions on the existence of a secrecy key are determined as a design guideline.

    標(biāo)簽: Fundamental Limits Secure Class on of

    上傳時(shí)間: 2020-01-04

    上傳用戶:kddlas

主站蜘蛛池模板: 铜山县| 普洱| 图们市| 北票市| 遂宁市| 原平市| 新宁县| 黔西| 澎湖县| 交口县| 东乡族自治县| 南投市| 莱阳市| 鄂伦春自治旗| 西青区| 日喀则市| 新民市| 玉山县| 富阳市| 申扎县| 武清区| 柘城县| 甘洛县| 河间市| 曲沃县| 中牟县| 龙岩市| 德兴市| 琼中| 曲水县| 厦门市| 乾安县| 法库县| 汨罗市| 天门市| 洮南市| 土默特右旗| 达拉特旗| 南华县| 左权县| 犍为县|