This paper demonstrates an experimental and numerical study on the behavior of reinforced concrete (RC) columns with longitudinal steel embedded tubes positioned at the center of the column cross-section. A total of 12 pin-ended square sectional columns of 150 × 150 mm having a total height of 1400 mm were investigated. The considered variables were the steel tube diameters of 29, 58, and 76 mm and the load eccentricity (0, 50, and 150) mm. Accordingly, these columns were divided into three groups (four columns in each group) depending on the load eccentricity (e) to column depth (h) ratio (e/h = 0, 1/3, and 1). For each group, one column was solid (reference), and the other three columns contained steel tubes with hollow rat

To avoid the negative effects due to inflexibility of the domestic production inresponse to the increase in government consumption expenditure leads to more  imports to meet the increase in domestic demand resulting from the increase in government consumption expenditure. Since the Iraqi economy economy yield unilateral depends on oil revenues to finance spending, and the fact government consumer spending is a progressive high flexibility the increase in overall revenues, while being a regressive flexibility is very low in the event of reduced public revenues, and therefore lead to a deficit in the current account position. And that caused the deficit for imbalance are the disruption of the

LK Abood, RA Ali, M Maliki, International Journal of Science and Research, 2015 - Cited by 2

Software testing is a vital part of the software development life cycle. In many cases, the system under test has more than one input making the testing efforts for every exhaustive combination impossible (i.e. the time of execution of the test case can be outrageously long). Combinatorial testing offers an alternative to exhaustive testing via considering the interaction of input values for every t-way combination between parameters. Combinatorial testing can be divided into three types which are uniform strength interaction, variable strength interaction and input-output based relation (IOR). IOR combinatorial testing only tests for the important combinations selected by the tester. Most of the researches in combinatorial testing

Text based-image clustering (TBIC) is an insufficient approach for clustering related web images. It is a challenging task to abstract the visual features of images with the support of textual information in a database. In content-based image clustering (CBIC), image data are clustered on the foundation of specific features like texture, colors, boundaries, shapes. In this paper, an effective CBIC) technique is presented, which uses texture and statistical features of the images. The statistical features or moments of colors (mean, skewness, standard deviation, kurtosis, and variance) are extracted from the images. These features are collected in a one dimension array, and then genetic algorithm (GA) is applied for image clustering.

conventional FCM algorithm does not fully utilize the spatial information in the image. In this research, we use a FCM algorithm that incorporates spatial information into the membership function for clustering. The spatial function is the summation of the membership functions in the neighborhood of each pixel under consideration. The advantages of the method are that it is less
sensitive to noise than other techniques, and it yields regions more homogeneous than those of other methods. This technique is a powerful method for noisy image segmentation. 

Root-finding is an oldest classical problem, which is still an important research topic, due to its impact on computational algebra and geometry. In communications systems, when the impulse response of the channel is minimum phase the state of equalization algorithm is reduced and the spectral efficiency will improved. To make the channel impulse response minimum phase the prefilter which is called minimum phase filter is used, the adaptation of the minimum phase filter need root finding algorithm. In this paper, the VHDL implementation of the root finding algorithm introduced by Clark and Hau is introduced.
VHDL program is used in the work, to find the roots of two channels and make them minimum phase, the obtained output results are