نتایج جستجو برای: specific searching efficiency
تعداد نتایج: 1435137 فیلتر نتایج به سال:
abstract improving nitrogen use efficiency (nue) is an important objective of the agroecosystem management. a field experiment was conducted to study the effect of different competition patterns on nitrogen balance in the wheat agroecosystem. experimental design was split–plot based on randomized complete blocks with four replications. the main plots consisted of different nitrogen rates (i.e. ...
A distributed parallel genetic algorithm based on PC cluster was proposed, aiming at the disadvantage of traditional genetic algorithm, such as the bad searching quality and long computation time. It adopts the improved genetic simulated annealing algorithm and distributed parallel technique MPI, to implement the distributed computing on PC cluster. The algorithm uses the individual migration s...
Focusing on improving quantization performance for signals in non-flat region, the rate-distortion based quantization level adjustment algorithm (RDQLA) was proposed in our former work. It can improve the coding performance efficiently. However, exhaustively searching the optimal quantization level is computationally expensive. In this paper, a fast RDQLA algorithm for H.264 is proposed. By ana...
Problem statement: Efficient searching is a fundamental problem for unstructured peer to peer networks. Flooding requires a lot of resources in the network and thus will increase the search cost. Searching approach that utilizes minimum network resources is required to produce efficient searching in the robust and dynamic peer-to-peer network. Approach: This study addressed the need for efficie...
This paper presents a new sequential decoding algorithm based on dynamic searching strategy to improve decoding efficiency. The searching strategy is to exploit both sorting and path recording techniques. By means of sorting, we cun identify the correct path in a very fast way and then, by path recording, we can recover the bit sequence without degmding decoding performance. We also develop a c...
Given a text T = t1t2 ... tn and a set of patterns P = {P1, P2, ..., Pr}, the exact multiple string matching problem (EMSMP) finds the ending positions of all sub-strings in T which is equal to Pi for 1 i r. We regard all substrings in T and patterns in P as data points in an edit distance-based metric space. The data points in T are constructed into a vantage point tree (vp-tree) T. Then, ...
In this paper, non parametric Data Envelopment Analysis (DEA) was subjected to the energy data of wheat producers in Punjab state, India, and technical, pure technical and scale efficiencies were calculated for farms both category wise and zone wise. The main objective was to determine the strength of the correlation between non-parametric efficiencies and indices such as energy ratio and speci...
In this article, the author is in Paris searching for Gilles Deleuze. She wants to become more intimate with him, spending slow time exploring his work. her search intimacy Deleuze, she follows a map that buys at bouquiniste, and chooses take roads toward an ontological conception of love, blurs boundaries between public private love politics. Through exploration, develops understanding diaspor...
Background and aims Today, the environmental pollution caused by fire-proof break producing factories is one of the critical and challenging issues in our country. Aerosols emission concentration of the factory stacks and determining of bag filters efficiency were aims of this study Methods In this research, the concentration of emitting dust from 6 stacks related to Kaolin preparatio...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید