Some Characteristics of Systolic Arrays

In this paper is investigated a possible optimization of some linear algebra problems which can be solved by parallel processing using the special arrays called systolic arrays. In this paper are used some special types of transformations for the designing of these arrays. We show the characteristics of these arrays. The main focus is on discussing the advantages of these arrays in parallel computation of matrix product, with special approach to the designing of systolic array for matrix multiplication. Multiplication of large matrices requires a lot of computational time and its complexity is O(n3 ). There are developed many algorithms (both sequential and parallel) with the purpose of minimizing the time of calculations. Systolic arrays are good suited for this purpose. In this paper we show that using an appropriate transformation implicates in finding more optimal arrays for doing the calculations of this type.

Similarity Measures and Weighted Fuzzy C-Mean Clustering Algorithm

In this paper we study the fuzzy c-mean clustering algorithm combined with principal components method. Demonstratively analysis indicate that the new clustering method is well rather than some clustering algorithms. We also consider the validity of clustering method.

Selective Transverse Modes in a Diode End- Pumped Nd:Yag Pulsed Laser

The output beam quality of multi transverse modes of laser, are relatively poor. In order to obtain better beam quality, one may use an aperture inside the laser resonator. In this case, various transverse modes can be selected. We have selected various transverse modes both by simulation and doing experiment. By inserting a circular aperture inside the diode end-pumped Nd:YAG pulsed laser resonator, we have obtained 00 TEM , 01 TEM , 20 TEM and have studied which parameters, can change the mode shape. Then, we have determined the beam quality factor of TEM00 gaussian mode.

Strongly ω-Gorenstein Modules

We introduce the notion of strongly ω -Gorenstein modules, where ω is a faithfully balanced self-orthogonal module. This gives a common generalization of both Gorenstein projective (injective) modules and ω-Gorenstein modules. We investigate some characterizations of strongly ω -Gorenstein modules. Consequently, some properties under change of rings are obtained.

Block Sorting: A New Characterization and a New Heuristic

The Block Sorting problem is to sort a given permutation moving blocks. A block is defined as a substring of the given permutation, which is also a substring of the identity permutation. Block Sorting has been proved to be NP-Hard. Until now two different 2-Approximation algorithms have been presented for block sorting. These are the best known algorithms for Block Sorting till date. In this work we present a different characterization of Block Sorting in terms of a transposition cycle graph. Then we suggest a heuristic, which we show to exhibit a 2-approximation performance guarantee for most permutations.

Periodic Storage Control Problem

Considering a reservoir with periodic states and different cost functions with penalty, its release rules can be modeled as a periodic Markov decision process (PMDP). First, we prove that policy- iteration algorithm also works for the PMDP. Then, with policy- iteration algorithm, we obtain the optimal policies for a special aperiodic reservoir model with two cost functions under large penalty and give a discussion when the penalty is small.

Fuzzy Adjacency Matrix in Graphs

In this paper a new definition of adjacency matrix in the simple graphs is presented that is called fuzzy adjacency matrix, so that elements of it are in the form of 0 and n N n 1 , ∈ that are in the interval [0, 1], and then some charactristics of this matrix are presented with the related examples . This form matrix has complete of information of a graph.

Prediction of Compressive Strength of Self- Compacting Concrete with Fuzzy Logic

The paper presents the potential of fuzzy logic (FL-I) and neural network techniques (ANN-I) for predicting the compressive strength, for SCC mixtures. Six input parameters that is contents of cement, sand, coarse aggregate, fly ash, superplasticizer percentage and water-to-binder ratio and an output parameter i.e. 28- day compressive strength for ANN-I and FL-I are used for modeling. The fuzzy logic model showed better performance than neural network model.

Magnetohydrodynamics Boundary Layer Flows over a Stretching Surface with Radiation Effect and Embedded in Porous Medium

A steady two-dimensional magnetohydrodynamics flow and heat transfer over a stretching vertical sheet influenced by radiation and porosity is studied. The governing boundary layer equations of partial differential equations are reduced to a system of ordinary differential equations using similarity transformation. The system is solved numerically by using a finite difference scheme known as the Keller-box method for some values of parameters, namely the radiation parameter N, magnetic parameter M, buoyancy parameter l , Prandtl number Pr and permeability parameter K. The effects of the parameters on the heat transfer characteristics are analyzed and discussed. It is found that both the skin friction coefficient and the local Nusselt number decrease as the magnetic parameter M and permeability parameter K increase. Heat transfer rate at the surface decreases as the radiation parameter increases.

Simulation of Sample Paths of Non Gaussian Stationary Random Fields

Mathematical justifications are given for a simulation technique of multivariate nonGaussian random processes and fields based on Rosenblatt-s transformation of Gaussian processes. Different types of convergences are given for the approaching sequence. Moreover an original numerical method is proposed in order to solve the functional equation yielding the underlying Gaussian process autocorrelation function.

Analytical Analysis of Image Representation by Their Discrete Wavelet Transform

In this paper, we present an analytical analysis of the representation of images as the magnitudes of their transform with the discrete wavelets. Such a representation plays as a model for complex cells in the early stage of visual processing and of high technical usefulness for image understanding, because it makes the representation insensitive to small local shifts. We found that if the signals are band limited and of zero mean, then reconstruction from the magnitudes is unique up to the sign for almost all signals. We also present an iterative reconstruction algorithm which yields very good reconstruction up to the sign minor numerical errors in the very low frequencies.

Collective Oscillations in a Magnetized Plasma Subjected to a Radiation Field

In this paper we discuss the behaviour of the longitudinal modes of a magnetized non collisional plasma subjected to an external electromagnetic field. We apply a semiclassical formalism, with the electrons being studied in a quantum mechanical viewpoint whereas the electromagnetic field in the classical context. We calculate the dielectric function in order to obtains the modes and found that, unlike the Bernstein modes, the presence of radiation induces oscillations around the cyclotron harmonics, which are smoothed as the energy stored in the radiation field becomes small compared to the thermal energy of the electrons. We analyze the influence of the number of photon involved in the electronic transitions between the Landau levels and how the parameters such as the external fields strength, plasma density and temperature affect the dispersion relation

CFD Simulation and Validation of Flap Type Wave-Maker

A general purpose viscous flow solver Ansys CFX was used to solve the unsteady three-dimensional (3D) Reynolds Averaged Navier-Stokes Equation (RANSE) for simulating a 3D numerical viscous wave tank. A flap-type wave generator was incorporated in the computational domain to generate the desired incident waves. Authors have made effort to study the physical behaviors of Flap type wave maker with governing parameters. Dependency of the water fill depth, Time period of oscillations and amplitude of oscillations of flap were studied. Effort has been made to establish relations between parameters. A validation study was also carried out against CFD methodology with wave maker theory. It has been observed that CFD results are in good agreement with theoretical results. Beaches of different slopes were introduced to damp the wave, so that it should not cause any reflection from boundary. As a conclusion this methodology can simulate the experimental wave-maker for regular wave generation for different wave length and amplitudes.

Some Relationships between Classes of Reverse Watson-Crick Finite Automata

A Watson-Crick automaton is recently introduced as a computational model of DNA computing framework. It works on tapes consisting of double stranded sequences of symbols. Symbols placed on the corresponding cells of the double-stranded sequences are related by a complimentary relation. In this paper, we investigate a variation of Watson-Crick automata in which both heads read the tape in reverse directions. They are called reverse Watson-Crick finite automata (RWKFA). We show that all of following four classes, i.e., simple, 1-limited, all-final, all-final and simple, are equal to non-restricted version of RWKFA.

The Diameter of an Interval Graph is Twice of its Radius

In an interval graph G = (V,E) the distance between two vertices u, v is de£ned as the smallest number of edges in a path joining u and v. The eccentricity of a vertex v is the maximum among distances from all other vertices of V . The diameter (δ) and radius (ρ) of the graph G is respectively the maximum and minimum among all the eccentricities of G. The center of the graph G is the set C(G) of vertices with eccentricity ρ. In this context our aim is to establish the relation ρ = δ 2  for an interval graph and to determine the center of it.

The Core and Shapley Function for Games on Augmenting Systems with a Coalition Structure

In this paper, we first introduce the model of games on augmenting systems with a coalition structure, which can be seen as an extension of games on augmenting systems. The core of games on augmenting systems with a coalition structure is defined, and an equivalent form is discussed. Meantime, the Shapley function for this type of games is given, and two axiomatic systems of the given Shapley function are researched. When the given games are quasi convex, the relationship between the core and the Shapley function is discussed, which does coincide as in classical case. Finally, a numerical example is given.

Probabilities and the Persistence of Memory in a Bingo-like Carnival Game

Seemingly simple probabilities in the m-player game bingo have never been calculated. These probabilities include expected game length and the expected number of winners on a given turn. The difficulty in probabilistic analysis lies in the subtle interdependence among the m-many bingo game cards in play. In this paper, the game i got it!, a bingo variant, is considered. This variation provides enough weakening of the inter-player dependence to allow probabilistic analysis not possible for traditional bingo. The probability of winning in exactly k turns is calculated for a one-player game. Given a game of m-many players, the expected game length and tie probability are calculated. With these calculations, the game-s interesting payout scheme is considered.