Abstract: This research is a comparative study of complexity, as a multidimensional concept, in the context of streetscape composition in Algeria and Japan. 80 streetscapes visual arrays have been collected and then presented to 20 participants, with different cultural backgrounds, in order to be categorized and classified according to their degrees of complexity. Three analysis methods have been used in this research: cluster analysis, ranking method and Hayashi Quantification method (Method III). The results showed that complexity, disorder, irregularity and disorganization are often conflicting concepts in the urban context. Algerian daytime streetscapes seem to be balanced, ordered and regular, and Japanese daytime streetscapes seem to be unbalanced, regular and vivid. Variety, richness and irregularity with some aspects of order and organization seem to characterize Algerian night streetscapes. Japanese night streetscapes seem to be more related to balance, regularity, order and organization with some aspects of confusion and ambiguity. Complexity characterized mainly Algerian avenues with green infrastructure. Therefore, for Japanese participants, Japanese traditional night streetscapes were complex. And for foreigners, Algerian and Japanese avenues nightscapes were the most complex visual arrays.
Abstract: In this paper, a new technique for fast painting with
different colors is presented. The idea of painting relies on applying
masks with different colors to the background. Fast painting is
achieved by applying these masks in the frequency domain instead of
spatial (time) domain. New colors can be generated automatically as a
result from the cross correlation operation. This idea was applied
successfully for faster specific data (face, object, pattern, and code)
detection using neural algorithms. Here, instead of performing cross
correlation between the input input data (e.g., image, or a stream of
sequential data) and the weights of neural networks, the cross
correlation is performed between the colored masks and the
background. Furthermore, this approach is developed to reduce the
computation steps required by the painting operation. The principle of
divide and conquer strategy is applied through background
decomposition. Each background is divided into small in size subbackgrounds
and then each sub-background is processed separately by
using a single faster painting algorithm. Moreover, the fastest painting
is achieved by using parallel processing techniques to paint the
resulting sub-backgrounds using the same number of faster painting
algorithms. In contrast to using only faster painting algorithm, the
speed up ratio is increased with the size of the background when using
faster painting algorithm and background decomposition. Simulation
results show that painting in the frequency domain is faster than that in
the spatial domain.
Abstract: Artificial Neural Network (ANN) has been
extensively used for classification of heart sounds for its
discriminative training ability and easy implementation. However, it
suffers from overparameterization if the number of nodes is not
chosen properly. In such cases, when the dataset has redundancy
within it, ANN is trained along with this redundant information that
results in poor validation. Also a larger network means more
computational expense resulting more hardware and time related
cost. Therefore, an optimum design of neural network is needed
towards real-time detection of pathological patterns, if any from heart
sound signal. The aims of this work are to (i) select a set of input
features that are effective for identification of heart sound signals and
(ii) make certain optimum selection of nodes in the hidden layer for a
more effective ANN structure. Here, we present an optimization
technique that involves Singular Value Decomposition (SVD) and
QR factorization with column pivoting (QRcp) methodology to
optimize empirically chosen over-parameterized ANN structure.
Input nodes present in ANN structure is optimized by SVD followed
by QRcp while only SVD is required to prune undesirable hidden
nodes. The result is presented for classifying 12 common
pathological cases and normal heart sound.
Abstract: Knowledge of patterns of genetic diversity enhances
the efficiency of germplasm conservation and improvement. In this
study 96 Iranian landraces of Triticum turgidum originating from
different geographical areas of Iran, along with 18 durum cultivars
from ten countries were evaluated for variation in morphological and
high molecular weight glutenin subunit (HMW-GS) composition.
The first two principal components clearly separated the Iranian
landraces from cultivars. Three alleles were present at the Glu-A1
locus and 11 alleles at Glu-B1. In both cultivars and landraces of
durum wheat, the null allele (Glu-A1c) was observed more
frequently than the Glu-A1a and Glu-A1b alleles. Two alleles,
namely Glu-B1a (subunit 7) and Glu-B1e (subunit 20) represented
the more frequent alleles at Glu-B1 locus. The results showed that
the evaluated Iranian landraces formed an interesting source of
favourable glutenin subunits that might be very desirable in breeding
activities for improving pasta-making quality.
Abstract: In this paper, hybrid FDMA-TDMA access technique in a cooperative distributive fashion introducing and implementing a modified protocol introduced in [1] is analyzed termed as Power and Cooperation Diversity Gain Protocol (PCDGP). A wireless network consists of two users terminal , two relays and a destination terminal equipped with two antennas. The relays are operating in amplify-and-forward (AF) mode with a fixed gain. Two operating modes: cooperation-gain mode and powergain mode are exploited from source terminals to relays, as it is working in a best channel selection scheme. Vertical BLAST (Bell Laboratories Layered Space Time) or V-BLAST with minimum mean square error (MMSE) nulling is used at the relays to perfectly detect the joint signals from multiple source terminals. The performance is analyzed using binary phase shift keying (BPSK) modulation scheme and investigated over independent and identical (i.i.d) Rayleigh, Ricean-K and Nakagami-m fading environments. Subsequently, simulation results show that the proposed scheme can provide better signal quality of uplink users in a cooperative communication system using hybrid FDMATDMA technique.
Abstract: A decomposition of a graph G is a collection ψ of
graphs H1,H2, . . . , Hr of G such that every edge of G belongs
to exactly one Hi. If each Hi is either an induced path in G,
then ψ is called an induced acyclic path decomposition of G and
if each Hi is a (induced) cycle in G then ψ is called a (induced)
cycle decomposition of G. The minimum cardinality of an induced
acyclic path decomposition of G is called the induced acyclic path
decomposition number of G and is denoted by ¤Çia(G). Similarly
the cyclic decomposition number ¤Çc(G) is defined. In this paper we
begin an investigation of these parameters.
Abstract: This paper investigates the inverse problem of determining
the unknown time-dependent leading coefficient in the parabolic
equation using the usual conditions of the direct problem and an additional
condition. An algorithm is developed for solving numerically
the inverse problem using the technique of space decomposition in a
reproducing kernel space. The leading coefficients can be solved by a
lower triangular linear system. Numerical experiments are presented
to show the efficiency of the proposed methods.