A Centroid Ranking Approach Based Fuzzy MCDM Model

This paper suggests ranking alternatives under fuzzy MCDM (multiple criteria decision making) via an centroid based ranking approach, where criteria are classified to benefit qualitative, benefit quantitative and cost quantitative ones. The ratings of alternatives versus qualitative criteria and the importance weights of all criteria are assessed in linguistic values represented by fuzzy numbers. The membership function for the final fuzzy evaluation value of each alternative can be developed through α-cuts and interval arithmetic of fuzzy numbers. The distance between the original point and the relative centroid is applied to defuzzify the final fuzzy evaluation values in order to rank alternatives. Finally a numerical example demonstrates the computation procedure of the proposed model.

Assessing drought Vulnerability of Bulgarian Agriculture through Model Simulations

This study assesses the vulnerability of Bulgarian agriculture to drought using the WINISAREG model and seasonal standard precipitation index SPI(2) for the period 1951-2004. This model was previously validated for maize on soils of different water holding capacity (TAW) in various locations. Simulations are performed for Plovdiv, Stara Zagora and Sofia. Results relative to Plovdiv show that in soils of large TAW (180 mm m-1) net irrigation requirements (NIRs) range 0-40 mm in wet years and 350-380 mm in dry years. In soils of small TAW (116 mm m-1), NIRs reach 440 mm in the very dry year. NIRs in Sofia are about 80 mm smaller. Rainfed maize is associated with great yield variability (29%

Hybrid Prefix Adder Architecture for Minimizing the Power Delay Product

Parallel Prefix addition is a technique for improving the speed of binary addition. Due to continuing integrating intensity and the growing needs of portable devices, low-power and highperformance designs are of prime importance. The classical parallel prefix adder structures presented in the literature over the years optimize for logic depth, area, fan-out and interconnect count of logic circuits. In this paper, a new architecture for performing 8-bit, 16-bit and 32-bit Parallel Prefix addition is proposed. The proposed prefix adder structures is compared with several classical adders of same bit width in terms of power, delay and number of computational nodes. The results reveal that the proposed structures have the least power delay product when compared with its peer existing Prefix adder structures. Tanner EDA tool was used for simulating the adder designs in the TSMC 180 nm and TSMC 130 nm technologies.

Numerical Simulation of Progressive Collapse for a Reinforced Concrete Building

Though nonlinear dynamic analysis using a specialized hydro-code such as AUTODYN is accurate and useful tool for progressive collapse assessment of a multi-story building subjected to blast load, it takes too much time to be applied to a practical simulation of progressive collapse of a tall building. In this paper, blast analysis of a RC frame structure using a simplified model with Reinforcement Contact technique provided in Ansys Workbench was introduced and investigated on its accuracy. Even though the simplified model has a fraction of elements of the detailed model, the simplified model with this modeling technique shows similar structural behavior under the blast load to the detailed model. The proposed modeling method can be effectively applied to blast loading progressive collapse analysis of a RC frame structure.

Efficient Variants of Square Contour Algorithm for Blind Equalization of QAM Signals

A new distance-adjusted approach is proposed in which static square contours are defined around an estimated symbol in a QAM constellation, which create regions that correspond to fixed step sizes and weighting factors. As a result, the equalizer tap adjustment consists of a linearly weighted sum of adaptation criteria that is scaled by a variable step size. This approach is the basis of two new algorithms: the Variable step size Square Contour Algorithm (VSCA) and the Variable step size Square Contour Decision-Directed Algorithm (VSDA). The proposed schemes are compared with existing blind equalization algorithms in the SCA family in terms of convergence speed, constellation eye opening and residual ISI suppression. Simulation results for 64-QAM signaling over empirically derived microwave radio channels confirm the efficacy of the proposed algorithms. An RTL implementation of the blind adaptive equalizer based on the proposed schemes is presented and the system is configured to operate in VSCA error signal mode, for square QAM signals up to 64-QAM.

Influence of Watertable Depth on Soil Sodicity and Salinity

In order to monitor the water table depth on soil profile salinity buildup, a field study was carried out during 2006-07. Wheat (Rabi) and Sorghum (Kharif) fodder were sown in with three treatments. The results showed that watertable depth lowered from 1.15m to 2.89 m depth at the end of experiment. With lower of watertable depth, pH, ECe and SAR decreased under crops both without and with gypsum and increased in fallowing. Soil moisture depletion was directly proportional to lowering of watertable. With the application of irrigation water (58cm) pH, ECe and SAR were reduced in cropped plots, reduction was higher in gypsum applied plots than non-gypsum plots. In case of fallowing, there was increase in pH, EC, while slight reduction occurred in SAR values. However, soil salinity showed an increasing upward trend under fallowing and its value in 0-30 cm soil layer was the highest amongst the treatments.

Fiber Lens Structure for Large Distance Measurement

We propose a new fiber lens structure for large distance measurement in which a polymer layer is added to a conventional fiber lens. The proposed fiber lens can adjust the working distance by properly choosing the refractive index and thickness of the polymer layer. In our numerical analysis for the fiber lens radius of 120 μm, the working distance of the proposed fiber lens is about 10 mm which is about 30 times larger than conventional fiber lens.

B-VIS Service-oriented Middleware for RFID Sensor Network

One of the most importance of intelligence in-car and roadside systems is the cooperative vehicle-infrastructure system. In Thailand, ITS technologies are rapidly growing and real-time vehicle information is considerably needed for ITS applications; for example, vehicle fleet tracking and control and road traffic monitoring systems. This paper defines the communication protocols and software design for middleware components of B-VIS (Burapha Vehicle-Infrastructure System). The proposed B-VIS middleware architecture serves the needs of a distributed RFID sensor network and simplifies some intricate details of several communication standards.

Periodic Solutions for a Two-prey One-predator System on Time Scales

In this paper, using the Gaines and Mawhin,s continuation theorem of coincidence degree theory on time scales, the existence of periodic solutions for a two-prey one-predator system is studied. Some sufficient conditions for the existence of positive periodic solutions are obtained. The results provide unified existence theorems of periodic solution for the continuous differential equations and discrete difference equations.

A New Approach to Image Segmentation via Fuzzification of Rènyi Entropy of Generalized Distributions

In this paper, we propose a novel approach for image segmentation via fuzzification of Rènyi Entropy of Generalized Distributions (REGD). The fuzzy REGD is used to precisely measure the structural information of image and to locate the optimal threshold desired by segmentation. The proposed approach draws upon the postulation that the optimal threshold concurs with maximum information content of the distribution. The contributions in the paper are as follow: Initially, the fuzzy REGD as a measure of the spatial structure of image is introduced. Then, we propose an efficient entropic segmentation approach using fuzzy REGD. However the proposed approach belongs to entropic segmentation approaches (i.e. these approaches are commonly applied to grayscale images), it is adapted to be viable for segmenting color images. Lastly, diverse experiments on real images that show the superior performance of the proposed method are carried out.

Study of Iranian Biospherical Reservation Areas for Medicinal Plants Diversity

The study was carried out to gather and identify medicinal plants their curative effects and the part of them which is used from the reservation area of Miankaleh. The region under study has an area of 68800 hectares situated 12 kilometers north of the city of Behshahr and northwest of the city of Gorgan. Results obtained showed that out of a total of 43 families, 125 genera, and 155 species found in the region, 33 families, 52 genera and 61 species (39% of all the species) belonged to medicinal plants, among which the class Asteraceae with 6 species and the class Chenopodiaceae with 5 species had the most medicinal species. The most used parts of the plants were the leaves with 31%, the whole plants with 19%, and the roots with 15%.

How the Kinematic Swimming of European Eel Anguilla Anguilla Changes from Axial to Non-axial Velocity Flow

The aim of this study is to investigate the kinematics of undulatory elongated fish swimming against a velocity flow. We perform the experiments on European eel Anguilla Anguilla swimming in a hydrodynamic re-circulating tank with the velocity flow fixed at 0.2 m/s. We find that the undulating shape of overall eel body changes when it swims slantwise from the flow direction, by comparison to axial undulation shape. We examine this kinematics and we propose a general equation describing the lateral position of undulation body taking into account the direction of the eel-s swimming.

Two Stage Control Method Using a Disturbance Observer and a Kalman Filter

This paper describes the two stage control using a disturbance observer and a Kalman filter. The system feedback uses the estimated state when it controls the speed. After the change-over point, its feedback uses the controlled plant output when it controls the position. To change the system continually, a change-over point has to be determined pertinently, and the controlled plant input has to be adjusted by the addition of the appropriate value. The proposed method has noise-reduction effect. It changes the system continually, even if the controlled plant identification has the error. Although the conventional method needs a speed sensor, the proposed method does not need it. The proposed method has a superior robustness compared with the conventional two stage control.

H-ARQ Techniques for Wireless Systems with Punctured Non-Binary LDPC as FEC Code

This paper presents the H-ARQ techniques comparison for OFDM systems with a new family of non-binary LDPC codes which has been developed within the EU FP7 DAVINCI project. The punctured NB-LDPC codes have been used in a simulated model of the transmission system. The link level performance has been evaluated in terms of spectral efficiency, codeword error rate and average number of retransmissions. The NB-LDPC codes can be easily and effective implemented with different methods of the retransmission needed if correct decoding of a codeword failed. Here the Optimal Symbol Selection method is proposed as a Chase Combining technique.

Target Concept Selection by Property Overlap in Ontology Population

An ontology is widely used in many kinds of applications as a knowledge representation tool for domain knowledge. However, even though an ontology schema is well prepared by domain experts, it is tedious and cost-intensive to add instances into the ontology. The most confident and trust-worthy way to add instances into the ontology is to gather instances from tables in the related Web pages. In automatic populating of instances, the primary task is to find the most proper concept among all possible concepts within the ontology for a given table. This paper proposes a novel method for this problem by defining the similarity between the table and the concept using the overlap of their properties. According to a series of experiments, the proposed method achieves 76.98% of accuracy. This implies that the proposed method is a plausible way for automatic ontology population from Web tables.

Semantic Web Agent Communication Capable of Reasoning with Ontology and Agent Locations

Multi-agent communication of Semantic Web information cannot be realized without the need to reason with ontology and agent locations. This is because for an agent to be able to reason with an external semantic web ontology, it must know where and how to access to that ontology. Similarly, for an agent to be able to communicate with another agent, it must know where and how to send a message to that agent. In this paper we propose a framework of an agent which can reason with ontology and agent locations in order to perform reasoning with multiple distributed ontologies and perform communication with other agents on the semantic web. The agent framework and its communication mechanism are formulated entirely in meta-logic.

A Review of Coverage and Routing for Wireless Sensor Networks

The special constraints of sensor networks impose a number of technical challenges for employing them. In this review, we study the issues and existing protocols in three areas: coverage and routing. We present two types of coverage problems: to determine the minimum number of sensor nodes that need to perform active sensing in order to monitor a certain area; and to decide the quality of service that can be provided by a given sensor network. While most routing protocols in sensor networks are data-centric, there are other types of routing protocols as well, such as hierarchical, location-based, and QoS-aware. We describe and compare several protocols in each group. We present several multipath routing protocols and single-path with local repair routing protocols, which are proposed for recovering from sensor node crashes. We also discuss some transport layer schemes for reliable data transmission in lossy wireless channels.

Discrete Time Optimal Solution for the Connection Admission Control Problem

The Connection Admission Control (CAC) problem is formulated in this paper as a discrete time optimal control problem. The control variables account for the acceptance/ rejection of new connections and forced dropping of in-progress connections. These variables are constrained to meet suitable conditions which account for the QoS requirements (Link Availability, Blocking Probability, Dropping Probability). The performance index evaluates the total throughput. At each discrete time, the problem is solved as an integer-valued linear programming one. The proposed procedure was successfully tested against suitably simulated data.

A Hybrid Feature Selection by Resampling, Chi squared and Consistency Evaluation Techniques

In this paper a combined feature selection method is proposed which takes advantages of sample domain filtering, resampling and feature subset evaluation methods to reduce dimensions of huge datasets and select reliable features. This method utilizes both feature space and sample domain to improve the process of feature selection and uses a combination of Chi squared with Consistency attribute evaluation methods to seek reliable features. This method consists of two phases. The first phase filters and resamples the sample domain and the second phase adopts a hybrid procedure to find the optimal feature space by applying Chi squared, Consistency subset evaluation methods and genetic search. Experiments on various sized datasets from UCI Repository of Machine Learning databases show that the performance of five classifiers (Naïve Bayes, Logistic, Multilayer Perceptron, Best First Decision Tree and JRIP) improves simultaneously and the classification error for these classifiers decreases considerably. The experiments also show that this method outperforms other feature selection methods.

Image Magnification Using Adaptive Interpolationby Pixel Level Data-Dependent Geometrical Shapes

World has entered in 21st century. The technology of computer graphics and digital cameras is prevalent. High resolution display and printer are available. Therefore high resolution images are needed in order to produce high quality display images and high quality prints. However, since high resolution images are not usually provided, there is a need to magnify the original images. One common difficulty in the previous magnification techniques is that of preserving details, i.e. edges and at the same time smoothing the data for not introducing the spurious artefacts. A definitive solution to this is still an open issue. In this paper an image magnification using adaptive interpolation by pixel level data-dependent geometrical shapes is proposed that tries to take into account information about the edges (sharp luminance variations) and smoothness of the image. It calculate threshold, classify interpolation region in the form of geometrical shapes and then assign suitable values inside interpolation region to the undefined pixels while preserving the sharp luminance variations and smoothness at the same time. The results of proposed technique has been compared qualitatively and quantitatively with five other techniques. In which the qualitative results show that the proposed method beats completely the Nearest Neighbouring (NN), bilinear(BL) and bicubic(BC) interpolation. The quantitative results are competitive and consistent with NN, BL, BC and others.