نتایج جستجو برای: accuracy in calculating optimal bin size
تعداد نتایج: 17123235 فیلتر نتایج به سال:
in this article, vibration analysis of an euler-bernoulli beam resting on a pasternak-type foundation is studied. the governing equation is solved by using a spectral finite element model (sfem). the solution involves calculating wave and time responses of the beam. the fast fourier transform function is used for temporal discretization of the governing partial differential equation into a set ...
A novel optimization algorithm named teaching-learning-based optimization (TLBO) algorithm and its implementation procedure were presented in this paper. TLBO is a meta-heuristic method, which simulates the phenomenon in classes. TLBO has two phases: teacher phase and learner phase. Students learn from teachers in teacher phases and obtain knowledge by mutual learning in learner phase. The suit...
this study investigates the strategies native english and persian speakers employ for expressing gratitude in different situations. the strategies of persian efl learners are also compared with english strategies in order to find the differences that may exist between these two languages. social status and size of imposition of the favor are social variables which are investigated in detail for...
sange siyah dam is located two kilometers down the kabod khani village. the environ of ghorrve city in kurdestan province. this is an clay core dam. in this dam instrumentation is performed in three section and consist of electrical piezometers, total pressure cells, settlement cells and so on. the main objective of instrumentation is to control the behavior of dam body and foundation, end else...
We describe a statistical method to analyze dual-channel photon arrival trajectories from single molecule spectroscopy model-free to identify break points in the intensity ratio. Photons are binned with a short bin size to calculate the logarithm of the intensity ratio for each bin. Stochastic photon counting noise leads to a near-normal distribution of this logarithm and the standard student t...
Bin packing and bin covering are important optimization problems in many industrial fields, such as packaging, recycling, food processing. The problem concerns a set of items, each with its own value, that to be sorted into bins way the total value bin, measured by sum item values, is not above (for packing) or below covering) given target value. minimizing, for packing, maximizing, covering, n...
This paper describes a detailed study of aggregated network traffic using time series analysis techniques. The study is based on three sets of packet traces: 175 short-period WAN traces from the NLANR PMA archive (NLANR), 34 long-period WAN traces from NLANR archive (AUCKLAND), and the four Bellcore LAN and WAN traces (BC). We binned the packets with different bin sizes to produce a set of time...
This paper describes a detailed study of aggregated network traffic using time series analysis techniques. The study is based on three sets of packet traces: 175 short-period WAN traces from the NLANR PMA archive (NLANR), 34 long-period WAN traces from NLANR archive (AUCKLAND), and the four Bellcore LAN and WAN traces (BC). We binned the packets with different bin sizes to produce a set of time...
Bin packing is an NP-hard [10] classical combinatorial optimization problem. The objective is to pack a set of items into a minimum number of unit-size bins such that the total size of the items in a bin does not exceed the bin capacity. The problem has been studied extensively both in the offline and online settings [7, 8, 5]. In the online setting [11, 12], items may arrive at arbitrary time;...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید