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

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

Coding-Location

  • DAKOTA

    Computational models are commonly used in engineering design and scientific discovery activities for simulating complex physical systems in disciplines such as fluid mechanics, structural dynamics, heat transfer, nonlinear structural mechanics, shock physics, and many others. These simulators can be an enormous aid to engineers who want to develop an understanding and/or predictive capability for complex behaviors typically observed in the corresponding physical systems. Simulators often serve as virtual prototypes, where a set of predefined system parameters, such as size or location dimensions and material properties, are adjusted to improve the performance of a system, as defined by one or more system performance objectives. Such optimization or tuning of the virtual prototype requires executing the simulator, evaluating performance objective(s), and adjusting the system parameters in an iterative, automated, and directed way. System performance objectives can be formulated, for example, to minimize weight, cost, or defects; to limit a critical temperature, stress, or vibration response; or to maximize performance, reliability, throughput, agility, or design robustness. In addition, one would often like to design computer experiments, run parameter studies, or perform uncertainty quantification (UQ). These approaches reveal how system performance changes as a design or uncertain input variable changes. Sampling methods are often used in uncertainty quantification to calculate a distribution on system performance measures, and to understand which uncertain inputs contribute most to the variance of the outputs. A primary goal for Dakota development is to provide engineers and other disciplinary scientists with a systematic and rapid means to obtain improved or optimal designs or understand sensitivity or uncertainty using simulationbased models. These capabilities generally lead to improved designs and system performance in earlier design stages, alleviating dependence on physical prototypes and testing, shortening design cycles, and reducing product development costs. In addition to providing this practical environment for answering system performance questions, the Dakota toolkit provides an extensible platform for the research and rapid prototyping of customized methods and meta-algorithms

    標(biāo)簽: Optimization and Uncertainty Quantification

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

    上傳用戶:huhu123456

  • fpga-coding

    音頻傳輸FPGA代碼。。。。。。。。。咋這個(gè)規(guī)則這么多麻煩

    標(biāo)簽: fpga-coding

    上傳時(shí)間: 2016-05-15

    上傳用戶:DKCJ02

  • Microphone Arrays : A Tutorial

    This report presents a tutorial of fundamental array processing and beamforming theory relevant to microphone array speech processing. A microphone array consists of multiple microphones placed at different spatial locations. Built upon a knowledge of sound propagation principles, the multiple inputs can be manipulated to enhance or attenuate signals emanating from particular directions. In this way, microphone arrays provide a means of enhancing a desired signal in the presence of corrupting noise sources. Moreover, this enhancement is based purely on knowledge of the source location, and so microphone array techniques are applicable to a wide variety of noise types. Microphone arrays have great potential in practical applications of speech processing, due to their ability to provide both noise robustness and hands-free signal acquisition.

    標(biāo)簽: Microphone array Tutorial Array Signal Processing

    上傳時(shí)間: 2016-06-12

    上傳用戶:halias

  • 32feet.NET 3.5 Bluetooth coding

    32feet.NET is a shared-source project to make personal area networking technologies such as Bluetooth, Infrared (IrDA) and more, easily accessible from .NET code. Supports desktop, mobile or embedded systems. 32feet.NET is free for commercial or non-commercial use. If you use the binaries you can just use the library as-is, if you make modifications to the source you need to include the 32feet.NET License.txt document and ensure the file headers are not modified/removed. The project currently consists of the following libraries:- Bluetooth IrDA Object Exchange Bluetooth support requires a device with either the Microsoft, Widcomm, BlueSoleil, or Stonestreet One Bluetopia Bluetooth stack. Requires .NET Compact Framework v3.5 or above and Windows CE.NET 4.2 or above, or .NET Framework v3.5 for desktop Windows XP, Vista, 7 and 8. A subset of functionality is available for Windows Phone 8 and Windows Embedded Handheld 8 in the InTheHand.Phone.Bluetooth.dll library.

    標(biāo)簽: feet 3.5 NET 32

    上傳時(shí)間: 2016-07-06

    上傳用戶:magister2016

  • asp實(shí)現(xiàn)限制一個(gè)ip只能訪問一次的方法

    asp實(shí)現(xiàn)限制一個(gè)ip只能訪問一次的方法 <%  '/////////////////////////////////////////////////////  '// //  '//作用:一個(gè)IP地址只允許訪問本頁一次 //  '//引用:<!-- #include file="Check_Ip.asp" --> //  '// //  '/////////////////////////////////////////////////////    'Response.Charset = 936 '設(shè)置輸出編碼為簡(jiǎn)體中文  'Response.Buffer = false '關(guān)閉緩沖區(qū)    Dim Fso,ts,IpList,Cfs    '設(shè)置Cookies函數(shù)  Function SetCookie()  Response.Cookies("IsBrow") = "Brow" Response.Cookies("IsBrow").Expires = Date+365  End Function    '記錄IP地址函數(shù)  Function WriteIp(FileName, IpAddress)  Set Fso = Server.CreateObject("Scripting.FileSystemObject")  Set ts = Fso.OpenTextFile(Server.MapPath(FileName),8,true)  ts.WriteLine IpAddress  ts.Close  Set ts = Nothing  Set Fso = Nothing  End Function    '讀取IP地址函數(shù)  Function ReadIpList(FileName)  Set Fso = Server.CreateObject("Scripting.FileSystemObject")  If Not Fso.FileExists(Server.MapPath(FileName)) Then  CreateFile("Iplist.txt")  Exit Function  End If    Set ts = Fso.OpenTextFile(Server.MapPath(FileName))  Iplist = ts.ReadAll  ts.Close  Set ts = Nothing  Set Fso = Nothing  ReadIpList = Iplist  End Function    '創(chuàng)建文件函數(shù)  Function CreateFile(FileName)  Set Fso = Server.CreateObject("Scripting.FileSystemObject")  Set Cfs = Fso.CreateTextFile(Server.MapPath(FileName))  Cfs.Close  Set Cfs = Nothing  Set Fso = Nothing  End Function    '關(guān)閉當(dāng)前IE窗口函數(shù)(注:IE6下通過,其他瀏覽器未測(cè)試)  Function CloseWindow()  'Response.Write "<script>window.location='javascript:window.opener=null;window.close();'</script>"  Response.Redirect "http://www.baidu.com" End Function    Ip = Request.ServerVariables("REMOTE_ADDR") '獲取瀏覽者IP地址    Cookie = Request.Cookies("IsBrow") '獲取當(dāng)前Cookies  'Response.Write Cookie    If Request.ServerVariables("HTTP_X_FORWARDED_FOR") <> "" Then  Response.Write "本站不允許使用代理訪問" Response.End()  Else  If Cookie = "Brow" Then  CloseWindow()  Else  If Instr(ReadIpList("Iplist.txt"),Ip) <>0  Then  CloseWindow()  Else  WriteIp "Iplist.txt" , Ip  End If  SetCookie()  End If  End If  %>

    標(biāo)簽: asp 訪問

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

    上傳用戶:helei0915

  • 傳感器網(wǎng)絡(luò)中基于到達(dá)時(shí)間差有效的凸松弛方法的穩(wěn)健定位

    We consider the problem of target localization by a network of passive sensors. When an unknown target emits an acoustic or a radio signal, its position can be localized with multiple sensors using the time difference of arrival (TDOA) information. In this paper, we consider the maximum likelihood formulation of this target localization problem and provide efficient convex relaxations for this nonconvex optimization problem.We also propose a formulation for robust target localization in the presence of sensor location errors. Two Cramer-Rao bounds are derived corresponding to situations with and without sensor node location errors. Simulation results confirm the efficiency and superior performance of the convex relaxation approach as compared to the existing least squares based approach when large sensor node location errors are present.

    標(biāo)簽: 傳感器網(wǎng)絡(luò)

    上傳時(shí)間: 2016-11-27

    上傳用戶:xxmluo

  • Error Correction Coding mathmatical method...

    一本難得得關(guān)于通信糾錯(cuò)碼得好書。對(duì)原文件進(jìn)行了優(yōu)化----添加了目錄,鏈接,大大縮小了體積。

    標(biāo)簽: mathmatical Correction algorithms Coding method Error and

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

    上傳用戶:jinnmy

  • 基于頻率插值的4.0kbps 語音編碼器的性能和設(shè)計(jì)(英文)

    The 4.0 kbit/s speech codec described in this paper is based on a Frequency Domain Interpolative (FDI) coding technique, which belongs to the class of prototype waveform Interpolation (PWI) coding techniques. The codec also has an integrated voice activity detector (VAD) and a noise reduction capability. The input signal is subjected to LPC analysis and the prediction residual is separated into a slowly evolving waveform (SEW) and a rapidly evolving waveform (REW) components. The SEW magnitude component is quantized using a hierarchical predictive vector quantization approach. The REW magnitude is quantized using a gain and a sub-band based shape. SEW and REW phases are derived at the decoder using a phase model, based on a transmitted measure of voice periodicity. The spectral (LSP) parameters are quantized using a combination of scalar and vector quantizers. The 4.0 kbits/s coder has an algorithmic delay of 60 ms and an estimated floating point complexity of 21.5 MIPS. The performance of this coder has been evaluated using in-house MOS tests under various conditions such as background noise. channel errors, self-tandem. and DTX mode of operation, and has been shown to be statistically equivalent to ITU-T (3.729 8 kbps codec across all conditions tested.

    標(biāo)簽: frequency-domain interpolation performance Design kbit_s speech coder based and of

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

    上傳用戶:kilohorse

  • 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

  • Architectures for Baseband Signal Processing

    Mobile communication devices like smart phones or tablet PCs enable us to consume information at every location and at every time. The rapid development of new applications and new services and the demand to access data in real time create an increasing throughput demand. The data have to be transmitted reliably to ensure the desired quality of service. Furthermore, an improved utilization of the bandwidth is desired to reduce the cost of transmission.

    標(biāo)簽: Architectures Processing Baseband Signal for

    上傳時(shí)間: 2020-05-26

    上傳用戶:shancjb

主站蜘蛛池模板: 恩平市| 腾冲县| 贵州省| 绥德县| 元朗区| 山西省| 仁怀市| 浪卡子县| 西林县| 九台市| 浦北县| 临澧县| 天台县| 轮台县| 长海县| 塔城市| 渝北区| 鹤峰县| 元朗区| 南召县| 林芝县| 房山区| 上饶市| 揭东县| 安化县| 中山市| 林州市| 焦作市| 樟树市| 元江| 景洪市| 项城市| 会同县| 满城县| 台中县| 方山县| 台北市| 佛坪县| 长海县| 龙井市| 九龙坡区|