Abstract: In this paper, we consider the effect of the initial
sample size on the performance of a sequential approach that used
in selecting a good enough simulated system, when the number
of alternatives is very large. We implement a sequential approach
on M=M=1 queuing system under some parameter settings, with a
different choice of the initial sample sizes to explore the impacts on
the performance of this approach. The results show that the choice
of the initial sample size does affect the performance of our selection
approach.
Abstract: A manufacturing inventory model with shortages with
carrying cost, shortage cost, setup cost and demand quantity as
imprecise numbers, instead of real numbers, namely interval number
is considered here. First, a brief survey of the existing works on
comparing and ranking any two interval numbers on the real line
is presented. A common algorithm for the optimum production
quantity (Economic lot-size) per cycle of a single product (so as
to minimize the total average cost) is developed which works well
on interval number optimization under consideration. Finally, the
designed algorithm is illustrated with numerical example.
Abstract: Cancers could normally be marked by a number of
differentially expressed genes which show enormous potential as
biomarkers for a certain disease. Recent years, cancer classification
based on the investigation of gene expression profiles derived by
high-throughput microarrays has widely been used. The selection of
discriminative genes is, therefore, an essential preprocess step in
carcinogenesis studies. In this paper, we have proposed a novel gene
selector using information-theoretic measures for biological
discovery. This multivariate filter is a four-stage framework through
the analyses of feature relevance, feature interdependence, feature
redundancy-dependence and subset rankings, and having been
examined on the colon cancer data set. Our experimental result show
that the proposed method outperformed other information theorem
based filters in all aspect of classification errors and classification
performance.
Abstract: In this paper we present a method for gene ranking
from DNA microarray data. More precisely, we calculate the correlation
networks, which are unweighted and undirected graphs, from
microarray data of cervical cancer whereas each network represents
a tissue of a certain tumor stage and each node in the network
represents a gene. From these networks we extract one tree for
each gene by a local decomposition of the correlation network. The
interpretation of a tree is that it represents the n-nearest neighbor
genes on the n-th level of a tree, measured by the Dijkstra distance,
and, hence, gives the local embedding of a gene within the correlation
network. For the obtained trees we measure the pairwise similarity
between trees rooted by the same gene from normal to cancerous
tissues. This evaluates the modification of the tree topology due to
progression of the tumor. Finally, we rank the obtained similarity
values from all tissue comparisons and select the top ranked genes.
For these genes the local neighborhood in the correlation networks
changes most between normal and cancerous tissues. As a result
we find that the top ranked genes are candidates suspected to be
involved in tumor growth and, hence, indicates that our method
captures essential information from the underlying DNA microarray
data of cervical cancer.
Abstract: This paper discusses the issues and challenge that
academia faced in knowledge sharing at a research university in
Malaysia. The partial results of interview are presented from the
actual study. The main issues in knowledge sharing practices are
university structure and designation and title. The academia
awareness in sharing knowledge is also influenced by culture. Our
investigation highlight that the concept of reciprocal relationship of
sharing knowledge may hinder knowledge sharing awareness among
academia. Hence, we concluded that further investigation could be
carried out on the social interaction and trust culture among academia
in sharing knowledge within research/ranking university
environment.
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: An original DEA model is to evaluate each DMU
optimistically, but the interval DEA Model proposed in this paper
has been formulated to obtain an efficiency interval consisting of
Evaluations from both the optimistic and the pessimistic view points.
DMUs are improved so that their lower bounds become so large as to
attain the maximum Value one. The points obtained by this method
are called ideal points. Ideal PPS is calculated by ideal of efficiency
DMUs. The purpose of this paper is to rank DMUs by this ideal PPS.
Finally we extend the efficiency interval of a DMU under variable
RTS technology.