The emergence of large scale distributed memory computers has brought with it a variety of interconnection networks. As it is not feasible to fully interconnect the processors with a diameter of one, routing of messages is necessary. Wormhole routing is an efficient method of routing and in this paper, we derive a model for wormhole routing. Using this model, we determine the optimal buffer siz...

The aim of the present research is to determine the effects of financial information transparency and composition of board of directors on forecast accuracy of corporate earnings in companies. A corporation's key for success is hidden in its optimal direction. So it can be claimed that the secret of the eternal reputation of popular corporations lies in their efficient board of directors. One o...

in this paper, we have proposed a new algorithm which combines pso and ga in such a way that the new algorithm is more effective and efficient.the particle swarm optimization (pso) algorithm has shown rapid convergence during the initial stages of a global search but around global optimum, the search process will become very slow. on the other hand, genetic algorithm is very sensitive to the in...

In the game Knock ’m Down, tokens are placed in N bins. At each step of the game, a bin is chosen at random according to a fixed probability distribution. If a token remains in that bin, it is removed. When all the tokens have been removed, the player is done. In the solitaire version of this game, the goal is to minimize the expected number of moves needed to remove all the tokens. Here we pre...

This paper proposes a visualization tool for analyzing the behavior of metaheuristic algorithms. It works by reproducing graphically the solutions generated in execution time. The tool was evaluated analyzing the Hybrid Grouping Genetic Algorithm for Bin Packing (HGGA_BP). It was used to solve a benchmark with 17 instances of the one dimensional Bin Packing problem (1D-BPP). The use of the visu...

The optimal distribution of jobs among hosts in distributed environments is an important factor to achieve high performance. The optimal strategy depends on the application. In this paper we present a new online scheduling strategy for distributed EDI converter system. The strategy is based on the Bin-Stretching approach. The original algorithm has been enhanced to satisfy the business goals of...

  In this article, vibration analysis of an Euler-Bernoulli beam resting on a Pasternak-type foundation is studied. The governing equation is solved by using a spectral finite element model (SFEM). The solution involves calculating wave and time responses of the beam. The Fast Fourier Transform function is used for temporal discretization of the governing partial differential equation into a se...

ARISA (Automated Ribosomal Intergenic Spacer Analysis) is a low-cost technique that allows for the rapid comparison of different microbial environments. In this study, we asked if a set of ARISA profiles can distinguish human microbial environments from one another with the same accuracy as results generated from 454 high throughput DNA sequencing. Using a set of human microbial communities whe...

We analyze approximation algorithms for bounded-space bin packing by comparing them against the optimal bounded-space packing (instead of comparing them against the globally optimal packing that does not necessarily satisfy the bounded-space constraint). For 2-boundedspace bin packing we construct a polynomial time offline approximation algorithm with asymptotic worst case ratio 3/2, and we sho...