Welcome to Journal of Theoretical and Applied Information Technology

Author:

Source:

Abstract

Distributed systems can be very large and complex and the many different considerations which influence their design can result in a substantial body of specification, which needs a structuring framework if it is to be managed successfully. The purpose of the RM-ODP is to define such a framework. The Reference Model for Open Distributed Processing (RM-ODP) provides a framework within which support of distribution, inter-working and portability can be integrated. It defines: an object model, architectural concepts and architecture for the development of ODP systems in terms of five viewpoints. However, RM-ODP is a meta-norm, and several ODP standards have to be defined. Indeed, the viewpoint languages are abstract in sense that they define what concepts should be supported and not how these concepts should be represented using the UML/OCL meta-modeling approach. In this paper, we report on the definition and address of the syntax and semantics for a fragment of ODP object concepts defined in the RM-ODP foundations part and in the Engineering language. These concepts are suitable for describing and constraining ODP engineering viewpoint specifications. We give new approach and model it by using the RM-ODP engineering language.

RM-ODP, Engineering Language, Engineering viewpoint, Structural Concepts,Denotational  Meta-modeling Semantics, UML/OCL

 Full Text

Author:

Source:

Abstract

High data rates are a primary concern for wireless system designers today. It is likely that future breakthroughs in wireless communications will be driven mainly by the demand for high data rate applications. Streaming video for example, requires two to three orders of magnitude higher data rates than speech. A simple solution for increasing data rate is to increase channel bandwidth. This however is not usually considered, as it is very costly. Use of multiple element arrays (MEA) at both transmitter & receiver on the other hand can result in the realization of these higher data rates. So far, only partial consideration has been given to the analysis of space-time coding in the practical case of correlated fading. In this work, we will expand newly published results on the performance of space-time codes in the presence of spatial fading correlation, by quantifying the impact of the fading on different classes of space-time codes. Explicitly, we show that in the case of two and above receive antenna, transmit-side correlation has a more brutal impact on the performance of non-orthogonal space-time codes. Orthogonal spacetime codes offer maximum potency against transmit correlation.

Multiple input multiple output MIMO, Capacity, Autonomous Hybrid Power System (AHPS)

Author:

Source:

Abstract

Huffman codes, Huffman encoding, Huffman decoding, symbol, source reduction.

Author:

MOHAMMAD RIAZ AHMED, MD.RUMEN AHMED, MD.RUHUL AMIN ROBIN, MD.ASADUZZAMAN, MD.MAHBUB HOSSAIN, MD.ABDUL AWAL

Source:

Abstract

The comparison of symbol error probability(SEP) for different M-ary modulation techniques over slow, flat, identically independently distributed Rician fading channel is presented in this paper. Because fading is one of the major limitations in wireless communication, so modulation technique with diversity is used to transmit message signal efficiently. Exact analysis of symbol error probability for M-ary differentially encoded or differentially decoded phase shift keying(PSK) and coherent M-ary phase shift keying, transmitted over Rician fading channel has been performed with N branch receive diversity using maximal-ratio-combining(MRC) where channel side information known at the receiver. Also the performance of M-ary quadrature amplitude modulation (QAM) over Rician fading channel has been analyzed here. Approximate formula has been used to represent symbol error probability for M-ary quadrature amplitude modulation over a Gaussian channel. The boundary condition for approximation is M > 4 and 0 ≤ SNR ≤ 30 dB.

Maximal-Ratio-Combining (MRC), Phase Shift Keying (PSK) Symbol Error Probability (SEP), Signal-to-Noise Ratio (SNR), Quadrature Amplitude Modulation (QAM)

Author:

Source:

Abstract

Wireless sensor networks processing sensitive data are facing the risks of data manipulation, data fraud and sensor destruction or replacement. However, the practical deployment of sensor networks faces many challenges imposed by real-world demands. Sensors are deployed in open environments, and hence are vulnerable to physical attacks, potentially sensor networks faces many challenges. Security is a very important issue when designing or deploying any network or protocol. In this paper we look at Data fusion process. One or several sensors then collect the detection results from other sensors. The collected data must be processed by the sensor to reduce the transmission burden before they are transmitted to the base station. This process is called data fusion. Data fusion Nodes will fuses the collected data from nearby sensor nodes before they are sent to the base station. If a fusion node is compromised, then the base station cannot ensure the correctness of the fusion data sent to it. Various methods are proposed, that deal with providing an assured data transfer to the Base Station. In this paper we present the evaluation of two methods named witnessed based and direct voting. Based on this evaluation here I proposed the new method named silent voting.

Sensor Network, Data Fusion, Fusion Assurance, Security

Author:

Source:

Abstract

Grouping sensor nodes into cluster has been popularly used in order to achieve the network scalability. Every cluster needs a leader, and referred as the cluster-head. Many clustering Schemes for Wireless sensor Networks focus on the stable clustering techniques for mobile environments. In this paper, we have proposed a novel Distributed protocol in randomly deployed Wireless Sensor networks. Our work minimizes the selection of cluster heads in which both energy of the nodes and total energy consumption of the cluster are considered. We have shown the correctness & effectiveness of our protocol by mathematical simulation studies.

Cluster, Maximum Number of Nodes , Sensor Network

Author:

Source:

Abstract

This paper outlines a hybrid approach of neuro-fuzzy based learning and classification approach based on the online learning systems. The effect of fault diagnosis for the suggested fault location tool is evaluated over the conventional fault diagnosis based approaches. The method of fault location based on the conventional offline neuro controller approach is compared with the suggested hybrid approach for learning and convergent time evaluation for distributed systems.

Neuro-Fuzzy Approach, Fault Location, Fault Diagnosis, Online Learning System, System Performance

Author:

Source:

Abstract

The World-Wide Web is developing very fast. Currently, finding useful information on the Web is a time consuming process. The search is still potentially combinatorial explosive, so we put a resource limitation on search activity. This limit is expressed as a maximum number of accesses to non-local Web nodes per minute. Current information retrieval tools mostly use keyword search, which is unsatisfactory option because of its low precision and recall.

IP, Boolean searching, Westlaw is Natural, FREESTYLE, TARGET, PHOAKS, Autonomy

Author:

Source:

Abstract

This study presents a new approach based on a hybrid algorithm consisting of Genetic Algorithm (GA) and Pattern Search (PS) techniques for solving the economic load dispatch (ELD) problem. The objective is to minimize the nonlinear function, which is the total fuel cost of thermal generating units, subject to the usual constraints. The proposed method hybrid GA–PS algorithm has been examined and tested for standard IEEE 30 bus system. The hybrid GA–PS method is demonstrated and compared with conventional OPF method and the intelligence heuristic algorithm such as genetic algorithm, evolutionary programming. From simulation results, it has been found that hybrid GA–PS algorithm method is highly competitive for its better general convergence performance.

Economic dispatch; Direct Search method; Pattern Search method (PS); Genetic Algorithms (GA); Load Flow.

Author:

Source:

Abstract

The understanding of an image deals with the consideration of the most banal information conveyed by each pattern. A crucial anchor for facial expression analysis is to consider not only permanent features but transient ones too. In this work we are interested by all the outcomes of transient features in the analysis of facial expressions. Three processes based on transient features are proposed.
The first process is proposed to classify a facial expression as one of the six universal expressions. The presence or absence of transient features on different facial regions is studied to associate each transient feature to a specific facial expression. The result is generally a doubt between two or more than two expressions. A post processing step is added to reduce doubt if exists between expressions. The second process is proposed to classify expressions into negative, positive or unknown classes. In this process, transient features are associated to negative or positive expressions. The angle formed by the nasolabial furrows (if it exists) came to complete the classification of the considered expression in the two classes. Finally a process to quantify an expression with nasolabial furrow comes to conclude the outcomes of transient features in facial expression analysis, where the angle formed by the nasolabial furrow is calculated to deduce if the expression intensity is High or medium. Obtained results are given to prove the reliability of each process.

Facial expression, Facial Transient features, expression Intensity, quantification, classification, Fusion data, transferable belief model