Earticle

Maintenance reduces the occurrence of failures of a component (or IT product) and also extends its useful life. This way the time to dispose of such a component may be delayed and this reduces the rate at which greenhouse gases enter into the food chain and the atmosphere. It will be helpful to produce set of maintenance intervals for such component at which its extended useful life and cost are most improved. This set will consist of trade-offs between extended life and cost and is known as optimal set. This paper builds on earlier work to define the optimisation of the maintenance intervals of a given component with respect to its extended useful life and cost. The paper also establishes and uses a new approach of hill-climbing search algorithm.

This paper presents a technique that based on a combination of genetic algorithm (GA) and particle swarm optimization (PSO), and is thus called GPSCA (Genetic-Particle Swarm Combined Algorithm) which is used to generate automatic test data for data flow coverage with using dominance concept between two nodes. The performance of the proposed approach is analyzed on a number of programs having different size and complexity. Finally, the performance of GPSCA is compared to both GA and PSO for generation of automatic test cases to demonstrate its superiority.

LTE networks have been rapidly commercialized for 4G cellular communications systems in all over the world as well as Korea. Because many internet applications use TCP as their transport layer protocol, TCP throughput measurements and its performance improvements in LTE networks is very important. In this paper, we analyze the impact of “in-sequence delivery” in LTE link layer on TCP RTT increment. When HARQ or ARQ in LTE link layer is working frequently for error recovery, it increases TCP RTT and decreases TCP throughput seriously. Therefore, in order to get better TCP throughput with the same packet error probability, we should decrease TCP RTT when HARQ or ARQ in LTE link layer is working for error recovery. We propose "out-of-sequence delivery" in LTE link layer in order to decrease TCP RTT. From our test results, "out-of-sequence delivery" outperforms “in-sequence delivery”. While "out-of-sequence delivery" makes LTE link layer design simpler, but its throughput gain is considerable.

In this paper, we present an efficient technique for the BER of OFDM system over Nakagami–m fading channels, using well known characteristics function based analysis approach. The average BER expressed in terms of the higher transcendental function such as the confluent hyper geometric functions. Our numerical results show that depending on the number of channel taps, the BER performance may degrade with increasing values of Nakagami–m fading parameters.

In the scope and vision of using and expanding the types of services e-government portals can offer to citizens, one of the major challenges and possible barriers is the security concern. Unlike typical websites that include largely data to browse and download, such portals are expected to have sensitive private personal data about country citizens. The threat of possible intrusion or identity theft is high and may cause serious consequences. This paper proposes a multilevel security layered architecture for e-government websites based on the data access privileges. The paper evaluates the current security status of selected e-government portals in Jordanian e-government suite of websites. The focus of the evaluation is on possible vulnerabilities in securities and possible candidate threats. The study focuses on showing the weaknesses and problems that face the expansions of e-government services in Jordan to be fully active in the e-business to provide services to citizens throughout the Internet. The study makes some recommendations on how to approach such problems.

Over the past decade, scheduling in grid computing system has been an active research. However, it is still difficult to find an optimal scheduling algorithm in order to achieve load balancing. Gap filling or backfilling is one of the techniques used to optimize First Come First Serve (FCFS) and have been used widely in scheduling area. This paper introduced an improved backfilling technique which not only applied to FCFS but to others Priority Rule algorithms. Experimental results have shown significant improvement compared to the original Priority Rule algorithms.

The main aim of many security algorithms is to provide security to the data that we store. These algorithms provide security only untill the intruder gets hold of the file.With advancements in technology, any security mechanism can be cracked within a specified time period. In our paper we propose an alternative mechanism to this kind of security provision. We propose that the file be splitted into n number of particles and these particles be distributed within the system providing transparency to the user.The GFMS makes sure that the file is splitted and distributed inside the system in such a way that, even if some part of the file is retreived no information can be recognized. Inorder to increase the Security features the file is encrypted and then is being splitted.The information about the file pieces are stored in the GFMS_DB, which can be queried only if all the process other than the required system processes have been stopped. This is to ensure that the GFMS is free from impact of spywares. The implementation of this system has been tested for Image,Documents,video and Audio files.

In this paper we propose a model of bone remodeling which takes in consideration the elasticity with damage properties of the material. Also the non linear equation of the bone apparent density is solved by a finite difference method, particularly a model with n unit elements. We will study the influence of damage damping on the adaptation of the structure under the effect of a controlled mechanical loading.

In the recent years, Governments around the world are embracing the digital revolution to enhance services for their citizens. Government services are provided using electronic media anywhere and anytime. One of the most important issues in e-government is the security. E-government security is considered one of the crucial factors for achieving an advanced stage of e-government. As the number of e-government services introduced to the user increases, a higher level of e-government security is required. A several number of Artificial Intelligence (AI) techniques have been proposed for this purpose; fuzzy considered as the dominant approaches in this area. This paper, firstly, presents reviews and discusses the comparison between variant fuzzy-based techniques. This paper has concluded that; Fuzzy set theory is very useful for evaluation of e-government security.

In this paper we examine the state of research into the domain of information visualization. We start by describing the spectrum of current paradigms of information visualization. We address the problem of their integration in the web applications and precisely in information search systems. Then, we deal about the challenges and directives for a good conception of semantic visualization. Then, we discuss about the existing methods of information visualization evaluation and present the most relevant challenges facing both information visualization construction and evaluation tasks.

Vulnerability of dedicated hash functions to various attacks has made the task of designing hash function much more challenging. This provides us a strong motivation to design a new cryptographic hash function viz. HF-hash. This is a hash function, whose compression function is designed by using first 32 polynomials of HFE Challenge-1 [8] with 64 variables by forcing remaining 16 variables as zero. HF-hash gives 256 bits message digest and is as efficient as SHA-256. It is secure against the differential attack proposed by Chabaud and Joux in [6] as well as by Wang et. al. in [25] applied to SHA-0 and SHA-1. We have also compared the efficiency of our HF-hash with SHA-256.