Using the batch processing of Photoshop to process and improve digital photographs;
利用Photoshop批處理功能快速處理數(shù)碼相片
This paper presented a new acquisition method to solve this foundational problem,using the batch processing based method to enhance the ability of receiving weak signal and improve the speed of computation.
針對傳統(tǒng)方法難以實(shí)現(xiàn)微弱GPS信號的精確捕獲,繼而影響后續(xù)的信號跟蹤及導(dǎo)航電文解碼,提出了一種新的捕獲方法解決這一基礎(chǔ)性問題,采用基于批處理的手段來捕獲低信噪比的GPS信號并提高運(yùn)算速度,為高靈敏度GPS接收機(jī)的實(shí)現(xiàn)提供保證。
Starting from the service for readers of university library,this paper researches the batch processing of university library readers’ entering and leaving data in ILASⅡ system.
從高校圖書館讀者工作出發(fā),深入細(xì)致地研究了ILASⅡ系統(tǒng)中高校學(xué)生讀者入館和離館數(shù)據(jù)的批處理方法。
In this paper,a new stochastic scheduling model of a batch processing machine is presented under the background of freight traffic,aimed at coping with the uncertainty of the transportation time and the delivery time during freight.
本文以貨物運(yùn)輸為背景新建立了一個(gè)批處理機(jī)隨機(jī)調(diào)度模型,目的是為了應(yīng)付貨物運(yùn)輸中運(yùn)輸時(shí)間的不確定性和貨主取貨時(shí)間的不確定性。
In the paper we consider the problem of scheduling jobs with chain precedence constraints on a batching machine and identical parallel machines to minimize makespan.
在滿足優(yōu)先約束的條件下，將工件安排在單臺(tái)批處理機(jī)上加工，使其目標(biāo)函數(shù)值最大完工時(shí)間最小，即問題1|prec，B|C_(max)。
In the second chapter, we studies the problem of scheduling n jobs on a single batching machine to minimize total weighted late work.
模型為：一臺(tái)批處理機(jī)要加工n個(gè)工件，已知每個(gè)工件的加時(shí)間p_j，權(quán)重w_j以及交貨期d_j，問怎樣分批，怎樣排序，使得目標(biāo)函數(shù)sum from j=1 to n (w_j V_j)達(dá)到最小。