Welcome to Journal of Theoretical and Applied Information Technology

Author:

Source:

Abstract

The paper presents to formulate an experimental data based ANN model for a Human Powered Fodder Chopper. The authors in their research paper published earlier have suggested the design of the experimentation for the formulation of such model. The experimentation has been carried out on a Fodder Chopper energized by human power. Mathematical models have been formulated, validated and optimized as per the suggested procedure. In this paper the ANN model is formulated to generate the correct values of the output parameters corresponding to the various values of the input parameters. The regression coefficient between the observed values and the values of the response variables computed by the ANN justifies this as best fit model. The developed ANN can now be used to select the best values of the various independent features for the designed chaff cutter to match the features of the machine operator performing the chaff cutting task so as to maximize the productivity and minimize torque, cutting time. Thus the entrepreneur selecting the best possible combinations of the input parameters by using this ANN can now improve the productivity of an experimental setup.

Human Powered, Flywheel Motor, Spiral jaw Clutch, Fodder Cutter, Models, Optimization, ANN Simulation

 Full Text

Author:

Source:

Abstract

The SOA enables the development of flexible large scale-applications in open environments by dynamically combining the web services. There exist many web services which exhibit similar functional characteristics. It is imperative to provide service consumers with facilities for selecting required web services according to their non-functional characteristics or QoS. An important issue arising from Web Service applications is how to conveniently, accurately and efficiently retrieve services from large-scale and expanding service repositories. The QoS based web service discovery play an essential role in SOA because most of the applications want to use services that accurately meet their requirements. This work proposes a web service discovery mechanism in which the functional and non-functional requirements are taken into account during service discovery. In this paper, we propose a novel approach for designing and developing a agent-based architecture and its QoS-based matching, ranking and selection algorithm for evaluating web services. The paper presents an optimal approach for discovering the most suitable web service according to the consumer’s functional and quality requirements.

Agent, Quality of Service (QoS), Service Selection, Web Services, Web Service Discovery

Author:

Source:

Abstract

We propose an Energy-aware Maximal Leaf Nodes Data Gathering (EMLN-DG) algorithm for periodic data collection and transmission in wireless sensor networks. For each round of data gathering, an EMLN-DG tree spanning the entire sensor network is formed based on the residual energy level available at the nodes and the number of uncovered neighbors of a node during tree formation. Only nodes that have a relatively larger number of neighbors as well as a higher energy level are included as intermediate nodes in the EMLN-DG tree. By maximizing the number of leaf nodes in a DG tree and considering the energy level available at the nodes while forming the tree, we reduce energy consumption per round as well as balance the energy level across all the nodes in the network. This contributes to a significantly larger network lifetime, measured as the number of rounds before the first node failure due to exhaustion of battery charge. Performance comparison studies with the well-known data gathering algorithms such as LEACH and PEGASIS illustrate that EMLN-DG can help to sustain the network for a significantly larger number of rounds and at the same time incur a lower, or if not comparable, energy loss, delay and energy loss*delay per round of data gathering.

Algorithm, Data Aggregation, Data Gathering Trees, Energy-awareness, Maximal Leaf Nodes, Network Lifetime, Sensor Networks

Author:

Source:

Abstract

Object-Oriented development methodology is currently the main trend in software industry. Many tools were introduced to aid in the analysis and design phases of the object-oriented development methodology. However, tools that can aid in the requirements phase of the object-oriented development methodology and that can generate class diagrams as a major step in the design phase have attracted little attention and efforts. This paper introduces a tool to automate the process of constructing a static class diagram from software requirements. The CASE tool takes the static class diagram a step further and generates a skeleton code for popular object-oriented languages.

Software requirements, Object-oriented development, CASE tools

Author:

Source:

Abstract

The existing system available for fuzzy filters for noise reduction deals with fat-tailed noise like impulse noise and median filter. Only impulse noise reduction uses fuzzy filters. Gaussian noise is not specially concentrated; it does not distinguish local variation due to noise and due to image structure. The proposed system presents a new technique for filtering narrow-tailed and medium narrow-tailed noise by a fuzzy filter. The system first estimates a “fuzzy derivative” in order to be less sensitive to local variations due to image structures such as edges. Second, the membership functions are adapted accordingly to the noise level to perform “fuzzy smoothing.” A new fuzzy filter is presented for the noise reduction of images corrupted with additive noise. The filter consists of two stages. The first stage computes a fuzzy derivative for eight different directions. The second stage uses these fuzzy derivatives to perform fuzzy smoothing by weighting the contributions of neighboring pixel values. Both stages are based on fuzzy rules which make use of membership functions. The filter can be applied iteratively and effectively reduce heavy noise. In particular, the shape of the membership functions is adapted according to the remaining noise level after each iteration, making use of the distribution of the homogeneity in the image. A statistical model for the noise distribution can be incorporated to relate the homogeneity to the adaptation scheme of the membership functions. Experimental results are obtained to show the feasibility of the proposed approach. These results are also compared to other filters by numerical measures and visual inspection

AFuzzy sets, Fuzzy filters, Fuzzy smoothing, Fuzzy derivative

Author:

Source:

Abstract

This paper presents a brief survey on coarse grained Reconfigurable architectures for motion estimation. The motion estimation processor demands a very large amount of computing power in recent video coding standard H.264/AVC. To reduce computational complexity without affecting image quality, Motion estimation algorithms are implemented on various course grained Reconfigurable architectures such as Morphosys, Matrix, Rapid, Mora and Chess. The purpose of this study is to compare these architectures based on Granularity, resource utilization, memory bandwidth and computation model. The methodology and results presented here provide useful guidelines to system designers in selecting coarse grained Reconfigurable Architectures for motion estimation

Coarse grained, Reconfigurable architectures, motion estimation, H.264

Author:

Source:

Abstract

The phase information extraction of atrial fibrillation (AF) is significant in medical applications. In this method, atrial activity is decomposed into fundamental and harmonic components. Each component is divided into short blocks for which the amplitudes, frequencies, and phases are estimated. The phase delays between the fundamental and each of the harmonics, here referred to as harmonic phase relationships, are used as features of f-wave morphology. The estimated waves are clustered into typical morphologic patterns. The performance of the method is illustrated by simulated signals, ECG signals recorded from 50 patients with organized AF, and an ECG signal recorded during drug loading. The results show that the method can distinguish a wide variety of f-wave morphologies, and that typical morphologies can be established for further analysis of AF

Atrial fibrillation (AF), Electrocardiogram (ECG), Reverse biorthogonal wavelets, waveform characterization

Author:

Source:

Abstract

Now-a-days the requirements of wireless communication are to have high voice quality, high data rates, multimedia features, lightweight communication devices etc. But the wireless communication channel suffers from much impairment .One of them is fading which is due to the effect of multiple propagation paths, and the rapid movement of mobile communication devices. In a typical wireless communication environment, multiple propagation paths often exist from a transmitter to a receiver due to scattering by different objects. Signal copies following different paths can undergo different attenuation, distortions, delays and phase shifts. So, this is necessary to reduce the problem of fading, but not at the cost of extra power or additional bandwidth. One effective solution is proposed for wireless system named diversity, with out the requirement of power or extra bandwidth. This paper discusses about the characteristics of fading channels and a broad classification of various diversity techniques. To overcome the effect of fading various combining techniques are used at the receiver to get good signal at the receiver for improving the overall performance of the communication system. They are explained using very simple mathematics

Fading, Diversity, Fading channels, Combining techniques, Wireless Communications, MIMO

Author:

Source:

Abstract

As embedded systems become increasingly networked, and interact with the physical world, Real Time Distributed Embedded Systems are emerging. This research work mainly focuses on the performance estimation and analysis of Real Time Distributed embedded systems. Performance evaluation is one of the key challenge in the system analysis. Major design parameters that influence the performance includes real-time properties, such as ask execution times, communication delays, the degree of parallelism in computations, and the throughput of the communication architecture. Here the performance estimation is done by discrete event simulation methodology which is based on repetitive simulations of the model, and therefore does not suffer from memory consumption limits. Moreover, it can provide partial results in case the models are too large for exhaustive analysis. They provide the platform for the implementation of cyber-physical systems that run in open environments, in less predictable conditions by providing a highly adaptive infrastructure for reusable resource management services than previous generations of real-time embedded systems that are specialized for specific application domains. The proposed algorithm is scalable for large-scale systems as well, and performs well for finding task mappings that satisfy real-time constraints. Obtaining a feasible mapping for a model of this size will be in the order of seconds. The proposed algorithm is implemented and the results are compared with that of Random Simulations.

Embedded systems, real time, distributed systems, performance, task, event

Author:

Source:

Abstract

We have introduced and studied the new class of functions called fuzzy minimal generalized continuous function, a new class of fuzzy closed and fuzzy open maps called fuzzy minimal generalized closed functions

Fuzzy Minimal space, fmg-continuous, fuzzy minimal strongly, perfectly continuous, pre-continuous

Author:

Source:

Abstract

A Mobile Ad hoc NETwork (MANET) is an infrastructure-less, spontaneous, and arbitrary multi-hop wireless network, consisting of group of mobile nodes. The topology of the network changes randomly due to unpredictable mobility of nodes. In order to allow truly spontaneous and infrastructure-less networking, a protocol for dynamic allocation of unique addresses is needed, The pre-configuration of addresses is not a possibility in MANET and every node must configure its network interface with a unique address in order to communicate with other nodes so that the packets can be relayed hop by hop and delivered ultimately to the destination. Allocating addresses in mobile ad hoc network is a challenging task. In recent years, various address auto configuration protocols have been proposed in the literature to solve this problem. However, address auto configuration in mobile ad hoc networks is still an unresolved issue. The main task of an address auto configuration protocol is to manage the resource address space. When a node leaves the network, the corresponding address must eventually be de-allocated to prevent exhaustion of the address space. This paper proposes a spanning tree based variable length dynamic address auto configuration, a novel method to solve the problem of address auto configuration of mobile ad hoc networks. Network partitioning and merging as well as duplicate address detection are well supported by our approach.

 Mobile Ad hoc Network, Variable Length Addressing,, Auto-configuration,, Spanning Tree, Duplicate Address