Abstract: Heat transfer from two cam shape cylinder in side-byside
arrangement had been studied numerically.
The transverse gap between the centers of cylinders (T) is allowed
to vary to change the pitch ratio (T/Deq). The equivalent diameter of
the cylinder (Deq) is 27.6 mm and pitch ratio varies in range of
1≤T/Deq≤3. The Reynolds numbers based on equivalent circular
cylinder are within 50≤ Reeq≤150. Results show that Nusselt number
of cylinders increases about 1 to 36 percent when pitch ratio
increases from 1 to 3.
Abstract: This paper reports on an effort to address the issue of
inequality in girls- and women-s access to science, engineering and
technology (SET) education and careers through raising awareness on
SET among secondary school girls in South Africa. Girls participated
in hands-on high-tech rapid prototyping environment of a fabrication
laboratory that was aimed at stimulating creativity and innovation as
part of a Fab Kids initiative. The Fab Kids intervention is about
creating a SET pipeline as part of the Young Engineers and Scientists
of Africa Initiative.The methodology was based on a real world
situation and a hands-on approach. In the process, participants
acquired a number of skills including computer-aided design,
research skills, communication skills, teamwork skills, technical
drawing skills, writing skills and problem-solving skills. Exposure to
technology enhanced the girls- confidence in being able to handle
technology-related tasks.
Abstract: Many natural language expressions are ambiguous, and
need to draw on other sources of information to be interpreted.
Interpretation of the e word تعاون to be considered as a noun or a verb
depends on the presence of contextual cues. To interpret words we
need to be able to discriminate between different usages. This paper
proposes a hybrid of based- rules and a machine learning method for
tagging Arabic words. The particularity of Arabic word that may be
composed of stem, plus affixes and clitics, a small number of rules
dominate the performance (affixes include inflexional markers for
tense, gender and number/ clitics include some prepositions,
conjunctions and others). Tagging is closely related to the notion of
word class used in syntax. This method is based firstly on rules (that
considered the post-position, ending of a word, and patterns), and
then the anomaly are corrected by adopting a memory-based learning
method (MBL). The memory_based learning is an efficient method to
integrate various sources of information, and handling exceptional
data in natural language processing tasks. Secondly checking the
exceptional cases of rules and more information is made available to
the learner for treating those exceptional cases. To evaluate the
proposed method a number of experiments has been run, and in
order, to improve the importance of the various information in
learning.
Abstract: There are a number of different cars for transferring hundreds of close contacts of swine influenza patients to hospital, and we need to carefully assign the passengers to those cars in order to minimize the risk of influenza spreading during transportation. The paper presents an approach to straightforward obtain the optimal solution of the relaxed problems, and develops two iterative improvement algorithms to effectively tackle the general problem.
Abstract: Video-on-demand (VOD) is designed by using content delivery networks (CDN) to minimize the overall operational cost and to maximize scalability. Estimation of the viewing pattern (i.e., the relationship between the number of viewings and the ranking of VOD contents) plays an important role in minimizing the total operational cost and maximizing the performance of the VOD systems. In this paper, we have analyzed a large body of commercial VOD viewing data and found that the viewing rank distribution fits well with the parabolic fractal distribution. The weighted linear model fitting function is used to estimate the parameters (coefficients) of the parabolic fractal distribution. This paper presents an analytical basis for designing an optimal hierarchical VOD contents distribution system in terms of its cost and performance.
Abstract: In mechanical and environmental engineering, mixed
convection is a frequently encountered thermal fluid phenomenon
which exists in atmospheric environment, urban canopy flows, ocean
currents, gas turbines, heat exchangers, and computer chip cooling
systems etc... . This paper deals with a numerical investigation of
mixed convection in a vertical heated channel. This flow results from
the mixing of the up-going fluid along walls of the channel with the
one issued from a flat nozzle located in its entry section. The fluiddynamic
and heat-transfer characteristics of vented vertical channels
are investigated for constant heat-flux boundary conditions, a
Rayleigh number equal to 2.57 1010, for two jet Reynolds number
Re=3 103 and 2104 and the aspect ratio in the 8-20 range. The system
of governing equations is solved with a finite volumes method and an
implicit scheme. The obtained results show that the turbulence and
the jet-wall interaction activate the heat transfer, as does the drive of
ambient air by the jet. For low Reynolds number Re=3 103, the
increase of the aspect Ratio enhances the heat transfer of about 3%,
however; for Re=2 104, the heat transfer enhancement is of about
12%. The numerical velocity, pressure and temperature fields are
post-processed to compute the quantities of engineering interest such
as the induced mass flow rate, and average Nusselt number, in terms
of Rayleigh, Reynolds numbers and dimensionless geometric
parameters are presented.
Abstract: The steady-state temperature for one-dimensional transpiration cooling system has been conducted experimentally and numerically to investigate the heat transfer characteristics of combined convection and radiation. The Nickel –Chrome (Ni-Cr) open-cellular porous material having porosity of 0.93 and pores per inch (PPI) of 21.5 was examined. The upper surface of porous plate was heated by the heat flux of incoming radiation varying from 7.7 - 16.6 kW/m2 whereas air injection velocity fed into the lower surface was varied from 0.36 - 1.27 m/s, and was then rearranged as Reynolds number (Re). For the report of the results in the present study, two efficiencies including of temperature and conversion efficiency were presented. Temperature efficiency indicating how close the mean temperature of a porous heat plate to that of inlet air, and increased rapidly with the air injection velocity (Re). It was then saturated and had a constant value at Re higher than 10. The conversion efficiency, which was regarded as the ability of porous material in transferring energy by convection after absorbed from heat radiation, decreased with increasing of the heat flux and air injection velocity. In addition, it was then asymptotic to a constant value at the Re higher than 10. The numerical predictions also agreed with experimental data very well.
Abstract: In-place sorting algorithms play an important role in many fields such as very large database systems, data warehouses, data mining, etc. Such algorithms maximize the size of data that can be processed in main memory without input/output operations. In this paper, a novel in-place sorting algorithm is presented. The algorithm comprises two phases; rearranging the input unsorted array in place, resulting segments that are ordered relative to each other but whose elements are yet to be sorted. The first phase requires linear time, while, in the second phase, elements of each segment are sorted inplace in the order of z log (z), where z is the size of the segment, and O(1) auxiliary storage. The algorithm performs, in the worst case, for an array of size n, an O(n log z) element comparisons and O(n log z) element moves. Further, no auxiliary arithmetic operations with indices are required. Besides these theoretical achievements of this algorithm, it is of practical interest, because of its simplicity. Experimental results also show that it outperforms other in-place sorting algorithms. Finally, the analysis of time and space complexity, and required number of moves are presented, along with the auxiliary storage requirements of the proposed algorithm.
Abstract: This article considers the positional buckling of
composite thick plates under thermal loading . For this purpose , the
complex finite strip method is used . In analysis of complex finite
strip, harmonic complex function in longitudinal direction , cubic
functions in transversal direction and parabola distribution of
transverse shear strain in thickness of thick plate based on higherorder
shear deformation theory are used . In given examples , the
effect of angles of stratification , number of layers , dimensions ratio
and length – to – thick ratio across critical temperature are
considered.
Abstract: As the web continues to grow exponentially, the idea
of crawling the entire web on a regular basis becomes less and less
feasible, so the need to include information on specific domain,
domain-specific search engines was proposed. As more information
becomes available on the World Wide Web, it becomes more difficult
to provide effective search tools for information access. Today,
people access web information through two main kinds of search
interfaces: Browsers (clicking and following hyperlinks) and Query
Engines (queries in the form of a set of keywords showing the topic
of interest) [2]. Better support is needed for expressing one's
information need and returning high quality search results by web
search tools. There appears to be a need for systems that do reasoning
under uncertainty and are flexible enough to recover from the
contradictions, inconsistencies, and irregularities that such reasoning
involves. In a multi-view problem, the features of the domain can be
partitioned into disjoint subsets (views) that are sufficient to learn the
target concept. Semi-supervised, multi-view algorithms, which
reduce the amount of labeled data required for learning, rely on the
assumptions that the views are compatible and uncorrelated. This
paper describes the use of semi-structured machine learning approach
with Active learning for the “Domain Specific Search Engines". A
domain-specific search engine is “An information access system that
allows access to all the information on the web that is relevant to a
particular domain. The proposed work shows that with the help of
this approach relevant data can be extracted with the minimum
queries fired by the user. It requires small number of labeled data and
pool of unlabelled data on which the learning algorithm is applied to
extract the required data.
Abstract: We report a computational study of the spreading
dynamics of a viral infection in a complex (scale-free) network. The
final epidemic size distribution (FESD) was found to be unimodal or
bimodal depending on the value of the basic reproductive
number R0 . The FESDs occurred on time-scales long enough for
intermediate-time epidemic size distributions (IESDs) to be important
for control measures. The usefulness of R0 for deciding on the
timeliness and intensity of control measures was found to be limited
by the multimodal nature of the IESDs and by its inability to inform
on the speed at which the infection spreads through the population. A
reduction of the transmission probability at the hubs of the scale-free
network decreased the occurrence of the larger-sized epidemic events
of the multimodal distributions. For effective epidemic control, an
early reduction in transmission at the index cell and its neighbors was
essential.
Abstract: In this paper a new fast simplification method is presented. Such method realizes Karnough map with large number of variables. In order to accelerate the operation of the proposed method, a new approach for fast detection of group of ones is presented. Such approach implemented in the frequency domain. The search operation relies on performing cross correlation in the frequency domain rather than time one. It is proved mathematically and practically that the number of computation steps required for the presented method is less than that needed by conventional cross correlation. Simulation results using MATLAB confirm the theoretical computations. Furthermore, a powerful solution for realization of complex functions is given. The simplified functions are implemented by using a new desigen for neural networks. Neural networks are used because they are fault tolerance and as a result they can recognize signals even with noise or distortion. This is very useful for logic functions used in data and computer communications. Moreover, the implemented functions are realized with minimum amount of components. This is done by using modular neural nets (MNNs) that divide the input space into several homogenous regions. Such approach is applied to implement XOR function, 16 logic functions on one bit level, and 2-bit digital multiplier. Compared to previous non- modular designs, a clear reduction in the order of computations and hardware requirements is achieved.
Abstract: Shadoo protein (Sho) was described in 2003 as the newest member of Prion protein superfamily [1]. Sho has similar structural motifs like prion protein (PrP) that is known for its central role in transmissible spongiform enchephalopathies. Although a great number of functions have been proposed, the exact physiological function of PrP is not known yet. Investigation of the function and localization of Sho may help us to understand the function of the Prion protein superfamily. Analyzing the subcellular localization of YFP-tagged forms of Sho, we detected the protein in the plasma membrane and in the nucleus of various cell lines. To reveal the localization of the endogenous protein we generated antibodies against Shadoo as well as employed commercially available anti-Shadoo antibodies: i) EG62 anti-mouse Shadoo antibody generated by Eurogentec Ltd.; ii) S-12 anti-human Shadoo antibody by Santa Cruz Biotechnology Inc.; iii) R-12 anti-mouse Shadoo antibody by Santa Cruz Biotechnology Inc.; iv) SPRN antibody against human Shadoo by Abgent Inc. We carried out immunocytochemistry on non-transfected HeLa, Zpl 2-1, Zw 3-5, GT1-1, GT1-7 and SHSY5Y cells as well as on YFP-Sho, Sho-YFP, and YFP-GPI transfected HeLa cells. Their specificity (in antibody-peptide competition assay) and co-localization (with the YFP signal) were assessed.
Abstract: Graph coloring is an important problem in computer
science and many algorithms are known for obtaining reasonably
good solutions in polynomial time. One method of comparing
different algorithms is to test them on a set of standard graphs where
the optimal solution is already known. This investigation analyzes a
set of 50 well known graph coloring instances according to a set of
complexity measures. These instances come from a variety of
sources some representing actual applications of graph coloring
(register allocation) and others (mycieleski and leighton graphs) that
are theoretically designed to be difficult to solve. The size of the
graphs ranged from ranged from a low of 11 variables to a high of
864 variables. The method used to solve the coloring problem was
the square of the adjacency (i.e., correlation) matrix. The results
show that the most difficult graphs to solve were the leighton and the
queen graphs. Complexity measures such as density, mobility,
deviation from uniform color class size and number of block
diagonal zeros are calculated for each graph. The results showed that
the most difficult problems have low mobility (in the range of .2-.5)
and relatively little deviation from uniform color class size.
Abstract: There have been various methods created based on the regression ideas to resolve the problem of data set containing censored observations, i.e. the Buckley-James method, Miller-s method, Cox method, and Koul-Susarla-Van Ryzin estimators. Even though comparison studies show the Buckley-James method performs better than some other methods, it is still rarely used by researchers mainly because of the limited diagnostics analysis developed for the Buckley-James method thus far. Therefore, a diagnostic tool for the Buckley-James method is proposed in this paper. It is called the renovated Cook-s Distance, (RD* i ) and has been developed based on the Cook-s idea. The renovated Cook-s Distance (RD* i ) has advantages (depending on the analyst demand) over (i) the change in the fitted value for a single case, DFIT* i as it measures the influence of case i on all n fitted values Yˆ∗ (not just the fitted value for case i as DFIT* i) (ii) the change in the estimate of the coefficient when the ith case is deleted, DBETA* i since DBETA* i corresponds to the number of variables p so it is usually easier to look at a diagnostic measure such as RD* i since information from p variables can be considered simultaneously. Finally, an example using Stanford Heart Transplant data is provided to illustrate the proposed diagnostic tool.
Abstract: The study investigated the hydrophilic to hydrophobic
transition of modified polyacrylamide hydrogel with the inclusion of
N-isopropylacrylamide (NIAM). The modification was done by
mimicking micellar polymerization, which resulted in better
arrangement of NIAM chains in the polyacrylamide network. The
degree of NIAM arrangement is described by NH number. The
hydrophilic to hydrophobic transition was measured through the
partition coefficient, K, of Orange II and Methylene Blue in hydrogel
and in water. These dyes were chosen as a model for solutes with
different degree of hydrophobicity. The study showed that the
hydrogel with higher NH values resulted in better solubility of both
dyes. Moreover, in temperature above the lower critical solution
temperature (LCST) of Poly(N-isopropylacrylamide) (PNIAM)also
caused the collapse of NIPAM chains which results in a more
hydrophobic environment that increases the solubility of Methylene
Blue and decreases the solubility of Orange II in the hydrogels with
NIPAM present.
Abstract: Hidden Markov Model (HMM) is a stochastic method
which has been used in various signal processing and character
recognition. This study proposes to use HMM to recognize Javanese
characters from a number of different handwritings, whereby HMM
is used to optimize the number of state and feature extraction. An
85.7 % accuracy is obtained as the best result in 16-stated vertical
model using pure HMM. This initial result is satisfactory for
prompting further research.
Abstract: We propose an enhanced key management scheme
based on Key Infection, which is lightweight scheme for tiny sensors.
The basic scheme, Key Infection, is perfectly secure against node
capture and eavesdropping if initial communications after node
deployment is secure. If, however, an attacker can eavesdrop on
the initial communications, they can take the session key. We use
common neighbors for each node to generate the session key. Each
node has own secret key and shares it with its neighbor nodes. Then
each node can establish the session key using common neighbors-
secret keys and a random number. Our scheme needs only a few
communications even if it uses neighbor nodes- information. Without
losing the lightness of basic scheme, it improves the resistance against
eavesdropping on the initial communications more than 30%.
Abstract: The objective of this paper is to present explicit analytical formulas for evaluating important characteristics of Double Moving Average control chart (DMA) for Poisson distribution. The most popular characteristics of a control chart are Average Run Length ( 0 ARL ) - the mean of observations that are taken before a system is signaled to be out-of control when it is actually still incontrol, and Average Delay time ( 1 ARL ) - mean delay of true alarm times. An important property required of 0 ARL is that it should be sufficiently large when the process is in-control to reduce a number of false alarms. On the other side, if the process is actually out-ofcontrol then 1 ARL should be as small as possible. In particular, the explicit analytical formulas for evaluating 0 ARL and 1 ARL be able to get a set of optimal parameters which depend on a width of the moving average ( w ) and width of control limit ( H ) for designing DMA chart with minimum of 1 ARL
Abstract: In this paper, based on a novel synthesis, a set of new simplified circuit design to implement the linguistic-hedge operations for adjusting the fuzzy membership function set is presented. The circuits work in current-mode and employ floating-gate MOS (FGMOS) transistors that operate in weak inversion region. Compared to the other proposed circuits, these circuits feature severe reduction of the elements number, low supply voltage (0.7V), low power consumption (60dB). In this paper, a set of fuzzy linguistic hedge circuits, including absolutely, very, much more, more, plus minus, more or less and slightly, has been implemented in 0.18 mm CMOS process. Simulation results by Hspice confirm the validity of the proposed design technique and show high performance of the circuits.