نتایج جستجو برای: based hyper

تعداد نتایج: 2952779  

Journal: :Turkish journal of haematology : official journal of Turkish Society of Haematology 2009
Babu Narayanan

OBJECTIVE We determined the morphological changes of erythrocytes in blood samples of diabetic patients with varying levels of hyperglycemia with normo- and hyper-cholesterol concentrations and compared them with cells of healthy subjects. METHODS The shape analysis was carried out by shape descriptors based on projected area, perimeter and form factor, as measured by the processing of erythr...

2003
Elango Ganesan Dhiraj K. Pradhan

The order-(m, n) hyper-deBruijn graph HD(m,n) is the direct product of an order-m hypercube and an order-n debruijn graph. The hyper-deBruijn graph offers flexibility in terms of connections per node and the level of fault-tolerance. These networks as well possess logarithmic diameter, simple routing algorithms and support many computationally important subgraphs and admit efficient implementat...

2003
Elango Ganesan

The order-(m,n) hyper-deBruijn graph H D ( m , n) is the direct product of an order-m hypercube and an order-n debruijn graph. The hyper-deBruijn graph offers flexibility in terms of connections per node and the level of fault-tolerance. These networks as well possess logarithmic diameter, simple routing algorithms and support many computationally imponant subgraphs and admit efficient implemen...

Journal: :JITR 2011
He Jiang Junying Qiu Jifeng Xuan

The goal of hyper-heuristics is to design and choose heuristics to solve complex problems. The primary motivation behind the hyper-heuristics is to generalize the solving ability of the heuristics. In this paper, the authors propose a Hyper-heuristic using GRASP with Path-Relinking (HyGrasPr). HyGrasPr generates heuristic sequences to produce solutions within an iterative procedure. The procedu...

2002
Vasileios Megalooikonomou Dragoljub Pokrajac Aleksandar Lazarevic Zoran Obradovic

We propose partitioning-based methods to facilitate the classification of 3-D binary image data sets of regions of interest (ROIs) with highly non-uniform distributions. The first method is based on recursive dynamic partitioning of a 3-D volume into a number of 3-D hyper-rectangles. For each hyper-rectangle, we consider, as a potential attribute, the number of voxels (volume elements) that bel...

 Background: Generalized joint hyper mobility predisposes some individuals to a wide variety of musculoskeletal complaints. Given the critical role of scapular position in function of shoulder, the aim of this study was to compare scapular position between persons with and without general joint hyper mobility. Methods: By nonprobability sampling 30 hyper mobile persons at average of 22.86 ±2.77...

2014
Chitra valavan

In our proposed system the random noise present in hyper spectral image is removed by means of tensor based decomposition methods. The noises present in hyper spectral images are classified into two categories namely: signal independent noise and signal dependent noise. The noises present in the hyper spectral images have dependence on the noise variance of the signal. The input image is separa...

2013
C. E. Nugraheni L. Abednego

This paper introduces a framework based on the collaboration of multi agent and hyper-heuristics to find a solution of the real single machine production problem. There are many techniques used to solve this problem. Each of it has its own advantages and disadvantages. By the collaboration of multi agent system and hyper-heuristics, we can get more optimal solution. The hyper-heuristics approac...

2004
Gregory S. Chirikjian Joel W. Burdick

“Hyper-redundant” robots have a very large or infinite degree of kinematic redundancy. This paper develops new methods for determining “optimal” hyper-redundant manipulator configurations based on a continuum formulation of kinematics. This formulation uses a backbone curve model to capture the robot’s essential macroscopic geometric features. The calculus of variations is used to develop diffe...

2015

Data partitioning can significantly improve query performance in distributed database systems. Most proposed data partitioning techniques choose the partitioning based on a particular expected query workload or use a simple upfront scheme, such as uniform range partitioning or hash partitioning on a key. However, these techniques do not adequately address the case where the query workload is ad...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید