This collection of C++ templates wraps the FORTRAN or C interfaces for LAPACK so that they integrate with the Boost uBLAS library. Currently implements Cholesky decomposition, LU decomposition, inversion and determinant for general and positive-definite matrices.
標(biāo)簽： collection interfaces integrate templates
上傳時(shí)間： 2015-08-10
上傳用戶：chfanjiang
ACM試題An Easy Problem Description As we known, data stored in the computers is in binary form. The problem we discuss now is about the positive integers and its binary form. Given a positive integer I, you task is to find out an integer J, which is the minimum integer greater than I, and the number of 1 s in whose binary form is the same as that in the binary form of I. For example, if "78" is given, we can write out its binary form, "1001110". This binary form has 4 1 s. The minimum integer, which is greater than "1001110" and also contains 4 1 s, is "1010011", i.e. "83", so you should output "83".
標(biāo)簽： Description computers Problem binary
上傳時(shí)間： 2013-12-11
上傳用戶：libenshu01
HDOJ ACM input:The input consists of T test cases. The number of test cases ) (T is given in the first line of the input. Each test case begins with a line containing an integer N , 1<=N<=200 , that represents the number of tables to move. Each of the following N lines contains two positive integers s and t, representing that a table is to move from room number s to room number t (each room number appears at most once in the N lines). From the N+3-rd line, the remaining test cases are listed in the same manner as above.
標(biāo)簽： input cases test The
上傳時(shí)間： 2015-10-18
上傳用戶：三人用菜
/* This a simple genetic algorithm implementation where the */ /* evaluation function takes positive values only and the */ /* fitness of an individual is the same as the value of the */ /* objective function
標(biāo)簽： implementation evaluation algorithm function
上傳時(shí)間： 2016-01-18
上傳用戶：wkchong
PlotSphereIntensity(azimuth, elevation) PlotSphereIntensity(azimuth, elevation, intensity) h = PlotSphereIntensity(...) Plots the intensity (as color) of a number of points on a unit sphere. Input: azimuth (phi), in degrees elevation (theta), in degrees intensity (optional, if not provided, a green sphere is produced) All inputs must be vectors or matrices of the same size. Data does not have to be evenly spaced. When there aren t enough points to draw a smooth sphere, additional points (with color) are interpolated. Output: h - a handle to the patch object The axes are also plotted: positive x axis is red positive y axis is green positive z axis is blue
標(biāo)簽： PlotSphereIntensity elevation azimuth intensity
上傳時(shí)間： 2014-01-15
上傳用戶：ruan2570406
基于UDP實(shí)現(xiàn)E-Mail傳輸 工作過程描述： 客戶端描述： 1． Client（以下簡稱C端）端將郵件以規(guī)定的大小封裝為符合要求的UDP包。 2． 將封裝好的UDP包發(fā)出，并等待Server(以下簡稱S端)端收到相應(yīng)的UDP包后返回的回應(yīng)Acknowledge(以下簡稱為ACK)。若收到的為positive ACK,則繼續(xù)發(fā)包；若收到的為Negtive ACK,則將應(yīng)發(fā)的包重發(fā)。 3． 直到C端將所有要發(fā)的包都發(fā)完，并都已經(jīng)收到S端的回應(yīng)，最后發(fā)一個(gè)End包，直接關(guān)閉此進(jìn)程。 服務(wù)器端描述： 1． S端啟動(dòng)服務(wù)進(jìn)程，并監(jiān)聽相應(yīng)端口。 2． 若收到C端發(fā)出的有關(guān)請(qǐng)求，按如下情況給出相應(yīng)的反映： a． 將收到的包進(jìn)行檢測(cè)，若收到的包有錯(cuò)則拋棄（discard），并發(fā)給C端一個(gè)negtive ACK。 b． 將收到的包進(jìn)行檢測(cè)，若收到的包正常，則將此包進(jìn)行解包，將內(nèi)容輸出至一臨時(shí)文件；并發(fā)給C端一個(gè)positive ACK。 3．依次收到來自C斷的包，直到收到end為止，并關(guān)閉此進(jìn)程，轉(zhuǎn)回監(jiān)聽狀態(tài)。
標(biāo)簽： UDP E-Mail Client 封裝
上傳時(shí)間： 2014-12-08
上傳用戶：sxdtlqqjl
In this paper, we present LOADED, an algorithm for outlier detection in evolving data sets containing both continuous and categorical attributes. LOADED is a tunable algorithm, wherein one can trade off computation for accuracy so that domain-specific response times are achieved. Experimental results show that LOADED provides very good detection and false positive rates, which are several times better than those of existing distance-based schemes.
標(biāo)簽： algorithm detection containi evolving
上傳時(shí)間： 2014-01-08
上傳用戶：aeiouetla
An optimal neuron evolution algorithm for the restoration of linearly distorted images is presented in this paper. The proposed algorithm is motivated by the symmetric positive-definite quadratic programming structure inherent in restoration. Theoretical analysis and experimental results show that the algorithm not only significantly increases the convergence rate of processing, hut also produces good restoration results. In addition, the algorithm provides a genuine parallel processing structure which ensures computationally feasible spatial domain image restoration
標(biāo)簽： restoration evolution algorithm distorted
上傳時(shí)間： 2013-12-21
上傳用戶：yy541071797
//通過18B20檢測(cè)的數(shù)字溫度可在電腦上顯示當(dāng)前溫度值 #include <reg52.h> #define uchar unsigned char #define uint unsigned int sbit DS=P2^2 //define interface uint temp // variable of temperature uchar flag1 // sign of the result positive or negative sbit dula=P2^6 sbit wela=P2^7
標(biāo)簽： define unsigned include 18B20
上傳時(shí)間： 2014-01-19
上傳用戶：Andy123456
步進(jìn)電機(jī)驅(qū)動(dòng)程序 用C8051F330單片機(jī)控制L297和L298驅(qū)動(dòng)步進(jìn)電機(jī)。能夠?qū)崿F(xiàn)正反轉(zhuǎn)-C8051F330 SCM with L297 and L298 stepper motor drive. To achieve positive
標(biāo)簽： L297 L298 C8051F330 stepper
上傳時(shí)間： 2013-12-21
上傳用戶：yoleeson
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
