-
剖析Intel IA32 架構下C 語言及CPU 浮點數機制
Version 0.01
哈爾濱工業大學 謝煜波
（email: xieyubo@126.com 網址:http://purec.binghua.com）
（QQ:13916830 哈工大紫丁香BBSID:iamxiaohan）
前言
這兩天翻看一本C 語言書的時候，發現上面有一段這樣寫到
例：將同一實型數分別賦值給單精度實型和雙精度實型，然后打印輸出。
#include <stdio.h>
main()
{
float a
double b
a = 123456.789e4
b = 123456.789e4
printf(“％f\n％f\n”,a,b)
}
運行結果如下：
標簽：
Version
xieyubo
Intel
email
上傳時間：
2013-12-25
上傳用戶：徐孺
-
最新的支持向量機工具箱，有了它會很方便 1. Find time to write a proper list of things to do! 2. Documentation. 3. Support Vector Regression. 4. Automated model selection. REFERENCES ========== [1] V.N. Vapnik, "The Nature of Statistical Learning Theory", Springer-Verlag, New York, ISBN 0-387-94559-8, 1995. [2] J. C. Platt, "Fast training of support vector machines using sequential minimal optimization", in Advances in Kernel Methods - Support Vector Learning, (Eds) B. Scholkopf, C. Burges, and A. J. Smola, MIT Press, Cambridge, Massachusetts, chapter 12, pp 185-208, 1999. [3] T. Joachims, "Estimating the Generalization Performance of a SVM Efficiently", LS-8 Report 25, Universitat Dortmund, Fachbereich Informatik, 1999.
標簽：
支持向量機
工具箱
上傳時間：
2013-12-16
上傳用戶：亞亞娟娟123
-
源代碼\用動態規劃算法計算序列關系個數
用關系"<"和"="將3個數a，b，c依次序排列時，有13種不同的序列關系：
a=b=c,a=b<c,a<b=v,a<b<c,a<c<b
a=c<b,b<a=c,b<a<c,b<c<a,b=c<a
c<a=b,c<a<b,c<b<a
若要將n個數依序列，設計一個動態規劃算法，計算出有多少種不同的序列關系，
要求算法只占用O(n),只耗時O(n*n).
標簽：
lt
源代碼
動態規劃
序列
上傳時間：
2013-12-26
上傳用戶：siguazgb
-
The government of a small but important country has decided that the alphabet needs to be streamlined and reordered. Uppercase letters will be eliminated. They will issue a royal decree in the form of a String of B and A characters. The first character in the decree specifies whether a must come ( B )Before b in the new alphabet or ( A )After b . The second character determines the relative placement of b and c , etc. So, for example, "BAA" means that a must come Before b , b must come After c , and c must come After d .
Any letters beyond these requirements are to be excluded, so if the decree specifies k comparisons then the new alphabet will contain the first k+1 lowercase letters of the current alphabet.
Create a class Alphabet that contains the method choices that takes the decree as input and returns the number of possible new alphabets that conform to the decree. If more than 1,000,000,000 are possible, return -1.
Definition
標簽：
government
streamline
important
alphabet
上傳時間：
2015-06-09
上傳用戶：weixiao99
-
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
-
單純形法算法,int K,M,N,Q=100,Type,Get,Let,Et,Code[50],XB[50],IA,IAA[50],Indexg,Indexl,Indexe
float Sum,A[50][50],B[50],C[50]
標簽：
50
Indexg
Indexe
Indexl
上傳時間：
2013-12-22
上傳用戶：頂得柱
-
made by: kangkai
data:2008.11.23
this one is used to test arm7 str71x.
use a led to test GPIO.
a---------P0.0
b---------P0.1
c---------P0.2
d---------P0.3
e---------P0.4
f---------P0.5
g---------P0.6
just run it and you will see the led to show 0-9 all the time.
標簽：
test
kangkai
made
2008
上傳時間：
2016-12-16
上傳用戶：moerwang
-
This books presents the research work of COST 273 Towards Mobile Broadband Multimedia
Networks, hence, it reports on the work performed and on the results achieved within the project
by its participants. The material presented here corresponds to the results obtained in four years
of collaborative work by more than 350 researchers from 137 institutions (universities, operators,
manufacturers, regulators, independent laboratories and others – a full list is provided in Appendix
B) belonging to 29 countries (mainly European, but also from Asia and North America) in the area of
mobileradio. Theobjectiveofpublishingtheseresultsasabookisessentiallytomakethemavailable
to an audience wider than the project. In fact, it just follows a ‘tradition’ of previous COST Actions
in this area of telecommunications, i.e. COST 207, 231 and 259.
標簽：
Multimedia
Techniques
Broadband
Networks
Mobile
上傳時間：
2020-05-30
上傳用戶：shancjb
-
HX711是一款專為高精度電子秤而設計的24位A/D轉換器芯片。與同類型其它芯片相比，該芯片集成了包括穩壓電源、片內時鐘振蕩器等其它同類型芯片所需要的外圍電路，具有集成度高、響應速度快、抗干擾性強等優點。降低了電子秤的整機成本，提高了整機的性能和可靠性。該芯片與后端MCU 芯片的接口和編程非常簡單，所有控制信號由管腳驅動，無需對芯片內部的寄存器編程。輸入選擇開關可任意選取通道A 或通道B，與其內部的低噪聲可編程放大器相連。通道A 的可編程增益為128 或64，對應的滿額度差分輸入信號幅值分別為±20mV或±40mV。通道B 則為固定的64 增益，用于系統參數檢測。芯片內提供的穩壓電源可以直接向外部傳感器和芯片內的A/D 轉換器提供電源，系統板上無需另外的模擬電源。芯片內的時鐘振蕩器不需要任何外接器件。上電自動復位功能簡化了開機的初始化過程。
標簽：
hx711
A/D轉換器
上傳時間：
2022-07-24
上傳用戶：
-
隨著電子技術和EDA技術的發展,大規模可編程邏輯器件PLD(Programmable Logic Device)、現場可編程門陣列FPGA(Field Programmable Gates Array)完全可以取代大規模集成電路芯片,實現計算機可編程接口芯片的功能,并可將若干接口電路的功能集成到一片PLD或FPGA中.基于大規模PLD或FPGA的計算機接口電路不僅具有集成度高、體積小和功耗低等優點,而且還具有獨特的用戶可編程能力,從而實現計算機系統的功能重構.該課題以Altera公司FPGA(FLEX10K)系列產品為載體,在MAX+PLUSⅡ開發環境下采用VHDL語言,設計并實現了計算機可編程并行接芯片8255的功能.設計采用VHDL的結構描述風格,依據芯片功能將系統劃分為內核和外圍邏輯兩大模塊,其中內核模塊又分為RORT A、RORT B、OROT C和Control模塊,每個底層模塊采用RTL(Registers Transfer Language)級描述,整體生成采用MAX+PLUSⅡ的圖形輸入法.通過波形仿真、下載芯片的測試,完成了計算機可編程并行接芯片8255的功能.
標簽：
FPGA
計算機
可編程
外圍接口
上傳時間：
2013-06-08
上傳用戶：asddsd
