這個連接池是直接從JIVE中取出來的，進行了一下修改，使得連接參數(shù)直接在程序中設(shè)定而不是從屬性文件中讀取。 [b]用法：[/b] 先設(shè)定自己的連接參數(shù)，在DbConnectionDefaultPool.java文件的loadProperties方法中。注意你也需要設(shè)定連接池的log文件的存放位置。
上傳時間： 2016-11-21
上傳用戶：TF2015
This approach addresses two difficulties simultaneously: 1) the range limitation of mobile robot sensors and 2) the difficulty of detecting buildings in monocular aerial images. With the suggested method building outlines can be detected faster than the mobile robot can explore the area by itself, giving the robot an ability to “see” around corners. At the same time, the approach can compensate for the absence of elevation data in segmentation of aerial images. Our experiments demonstrate that ground-level semantic information (wall estimates) allows to focus the segmentation of the aerial image to find buildings and produce a ground-level semantic map that covers a larger area than can be built using the onboard sensors.
標(biāo)簽： simultaneously difficulties limitation addresses
上傳時間： 2014-06-11
上傳用戶：waitingfy
支持多進程環(huán)境，多線程環(huán)境的多級別log打印，log文件可以自定義大小，每日都會生成新文件
上傳時間： 2016-12-05
上傳用戶：Late_Li
基于PSO的BP訓(xùn)練算法論文：在BP訓(xùn)練算法中，關(guān)于變權(quán)值、學(xué)習(xí)速率、步長的問題已被廣泛地研究，幾種基于啟發(fā)式改進的技術(shù)也表明具有改善訓(xùn)練時間以及避免陷入局部最小的明顯效果。這里BP訓(xùn)練過程由基于PSO同時優(yōu)化log—Sigmoid函數(shù)與網(wǎng)絡(luò)權(quán)值的新算 法(PSO。GainBP)實現(xiàn)。實驗結(jié)果表明，PSO—GainBP比傳統(tǒng)基于PSO的BP算法在網(wǎng)絡(luò)訓(xùn)練方面具有更好的性能。
上傳時間： 2017-01-19
上傳用戶：rishian
:: 幻靈私服賬號添加Bat工具 Ver1.1 :: 本程序只為幻靈私服添加賬號使用 :: Code by Duckyの復(fù)活（QQ:462363） :: 轉(zhuǎn)載請保留版權(quán)，謝謝合作！ Echo. Echo. Echo ---------------------------------- Echo - 作者的話 - Echo ---------------------------------- Echo. Echo 感謝各位使用本軟件 Echo 往后本人會繼續(xù)開發(fā)幻靈相關(guān)的工具 Echo 而且都是以開源的形式 Echo 希望大家多多支持 Echo 也希望能吸引更多高手一齊來研究 Echo 通過游戲提高自己的技術(shù) Echo. Echo. 1.1更新： 1、添加ini配置文件 2、自動生成log日志文件 3、附帶上mysql.exe，方便遠(yuǎn)程使用
標(biāo)簽： 462363 Ducky Code Bat
上傳時間： 2013-12-12
上傳用戶：stewart·
.NET平臺下專題地圖實現(xiàn)的C#代碼 private void 點密度圖ToolStripMenuItem_Click(object sender, EventArgs e) { //獲取當(dāng)前圖層 ，并把它設(shè)置成IGeoFeatureLayer的實例 IMap pMap = axMapControl1.Map ILayer pLayer = pMap.get_Layer(0) as IFeatureLayer IFeatureLayer pFeatureLayer = pLayer as IFeatureLayer IGeoFeatureLayer pGeoFeatureLayer = pLayer as IGeoFeatureLayer //獲取圖層上的feature IFeatureClass pFeatureClass = pFeatureLayer.FeatureClass IFeatureCursor pFeatureCursor = pFeatureClass.Search(null, false) IFeature pFeature = pFeatureCursor.NextFeature()
標(biāo)簽： ToolStripMenuItem_Click EventArgs private object
上傳時間： 2013-11-27
上傳用戶：xlcky
Description The art galleries of the new and very futuristic building of the Center for Balkan Cooperation have the form of polygons (not necessarily convex). When a big exhibition is organized, watching over all of the pictures is a big security concern. Your task is that for a given gallery to write a program which finds the surface of the area of the floor, from which each point on the walls of the gallery is visible. On the figure 1. a map of a gallery is given in some co-ordinate system. The area wanted is shaded on the figure 2.
標(biāo)簽： Description futuristic galleries the
上傳時間： 2017-02-17
上傳用戶：1427796291
Input : A set S of planar points Output : A convex hull for S Step 1: If S contains no more than five points, use exhaustive searching to find the convex hull and return. Step 2: Find a median line perpendicular to the X-axis which divides S into SL and SR SL lies to the left of SR . Step 3: Recursively construct convex hulls for SL and SR. Denote these convex hulls by Hull(SL) and Hull(SR) respectively. Step 4: Apply the merging procedure to merge Hull(SL) and Hull(SR) together to form a convex hull. Time complexity: T(n) = 2T(n/2) + O(n) = O(n log n)
標(biāo)簽： contains Output convex planar
上傳時間： 2017-02-19
上傳用戶：wyc199288
1. socket通信：有客戶端和服務(wù)端的socket代碼。 2. 多線程：客戶端和服務(wù)端各用一線程發(fā)送信息；服務(wù)端另有一監(jiān)聽線程，用于把超時的信息刪除。 這里應(yīng)用到了同步，使兩個線程可以操作同一個map。
標(biāo)簽： socket 服務(wù)端 線程 通信
上傳時間： 2017-02-27
上傳用戶：lanwei
cordic methods describe essentially the same algorithm that with suitably chosen inputs can be used to calculate a whole range of scientific functions including sin, cos, tan, arctan, arcsin, arccos, sinh, cosh, tanh, arctanh, log, exp, square root and even multiply and divide. the method dates back to volder [1959], and due to its versatility and compactness, it made possible the microcoding of the hp35 pocket scientific calculator in 1972. here is some code to illustrate the techniques. ive split the methods into three parts linear, circular and hyperbolic. in the hp35 microcode these would be unified into one function (for space reasons). because the linear mode can perform multiply and divide, you only need add/subtract and shift to complete the implementation. you can select in the code whether to do the multiples and divides also by cordic means. other multiplies and divides are all powers of 2 (these dont count). to eliminate these too, would involve ieee hackery.
標(biāo)簽： essentially algorithm describe suitably
上傳時間： 2017-03-02
上傳用戶：litianchu
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
<strike id="sq0mm"></strike>