Abstract: The relationship between different types of Molybdenum disulfide greases under extreme pressure loading and different speed situations have been studied using Design of Experiment (DOE) under 1200rpm steady state rotational speed and cyclic frequencies between 2400 and 1200rpm using a Plint machine software to set up the different rotational speed situations.
Research described here is aimed at providing good friction and wear performance while optimizing cyclic frequencies and MoS2 concentration due to the recent concern about grease behavior in extreme pressure applications. Extreme load of 785 Newton was used in conjunction with different cyclic frequencies (2400rpm -3.75min, 1200rpm -7.5min, 2400rpm -3.75min, 1200rpm -7.5min), to examine lithium based grease with and without MoS2 for equal number of revolutions, and a total run of 36000 revolutions; then compared to 1200rpm steady speed for the same total number of revolutions. 4 Ball wear tester was utilized to run large number of experiments randomly selected by the DOE software. The grease was combined with fine grade MoS2 or technical grade then heated to 750C and the wear scar width was collected at the end of each test. DOE model validation results verify that the data were very significant and can be applied to a wide range of extreme pressure applications. Based on simulation results and Scanning Electron images (SEM), it has been found that wear was largely dependent on the cyclic frequency condition. It is believed that technical grade MoS2 greases under faster cyclic speeds perform better and provides antiwear film that can resist extreme pressure loadings. Figures showed reduced wear scars width and improved frictional values.
Abstract: Optical network uses a tool for routing called Latin
router. These routers use particular algorithms for routing. For
example, we can refer to LDF algorithm that uses backtracking (one
of CSP methods) for problem solving. In this paper, we proposed
new approached for completion routing table (DRA&CRA
algorithm) and compare with pervious proposed ways and showed
numbers of backtracking, blocking and run time for DRA algorithm
less than LDF and CRA algorithm.
Abstract: This work provides a practical method for the
development of rural road networks in rural areas of developing
countries. The proposed methodology enables to determine
obligatory points in the rural road network maximizing the number of
settlements that have access to basic services within a given
maximum distance. The proposed methodology is simple and
practical, hence, highly applicable to real-world scenarios, as
demonstrated in the definition of the road network for the rural areas
of Nepal.
Abstract: Mobile ad hoc network is a collection of mobile
nodes communicating through wireless channels without any
existing network infrastructure or centralized administration.
Because of the limited transmission range of wireless network
interfaces, multiple "hops" may be needed to exchange data
across the network. Consequently, many routing algorithms
have come into existence to satisfy the needs of
communications in such networks. Researchers have
conducted many simulations comparing the performance of
these routing protocols under various conditions and
constraints. One question that arises is whether speed of nodes
affects the relative performance of routing protocols being
studied. This paper addresses the question by simulating two
routing protocols AODV and DSDV. Protocols were
simulated using the ns-2 and were compared in terms of
packet delivery fraction, normalized routing load and average
delay, while varying number of nodes, and speed.
Abstract: The work describes the use of a synthetic transmit
aperture (STA) with a single element transmitting and all elements
receiving in medical ultrasound imaging. STA technique is a novel
approach to today-s commercial systems, where an image is acquired
sequentially one image line at a time that puts a strict limit on the
frame rate and the amount of data needed for high image quality. The
STA imaging allows to acquire data simultaneously from all
directions over a number of emissions, and the full image can be
reconstructed.
In experiments a 32-element linear transducer array with 0.48 mm
inter-element spacing was used. Single element transmission aperture
was used to generate a spherical wave covering the full image region.
The 2D ultrasound images of wire phantom are presented obtained
using the STA and commercial ultrasound scanner Antares to
demonstrate the benefits of the SA imaging.
Abstract: In this paper, we investigate multihop polling and data gathering schemes in layered sensor networks in order to extend the life time of the networks. A network consists of three layers. The lowest layer contains sensors. The middle layer contains so called super nodes with higher computational power, energy supply and longer transmission range than sensor nodes. The top layer contains a sink node. A node in each layer controls a number of nodes in lower layer by polling mechanism to gather data. We will present four types of data gathering schemes: intermediate nodes do not queue data packet, queue single packet, queue multiple packets and aggregate data, to see which data gathering scheme is more energy efficient for multihop polling in layered sensor networks.
Abstract: In this paper, a new face recognition method based on
PCA (principal Component Analysis), LDA (Linear Discriminant
Analysis) and neural networks is proposed. This method consists of
four steps: i) Preprocessing, ii) Dimension reduction using PCA, iii)
feature extraction using LDA and iv) classification using neural
network. Combination of PCA and LDA is used for improving the
capability of LDA when a few samples of images are available and
neural classifier is used to reduce number misclassification caused by
not-linearly separable classes. The proposed method was tested on
Yale face database. Experimental results on this database
demonstrated the effectiveness of the proposed method for face
recognition with less misclassification in comparison with previous
methods.
Abstract: In this paper, we define distance partition of vertex set of a graph G with reference to a vertex in it and with the help of the same, a graph with metric dimension two (i.e. β (G) = 2 ) is characterized. In the process, we develop a polynomial time algorithm that verifies if the metric dimension of a given graph G is two. The same algorithm explores all metric bases of graph G whenever β (G) = 2 . We also find a bound for cardinality of any distance partite set with reference to a given vertex, when ever β (G) = 2 . Also, in a graph G with β (G) = 2 , a bound for cardinality of any distance partite set as well as a bound for number of vertices in any sub graph H of G is obtained in terms of diam H .
Abstract: The absolute Cu atoms density in Cu(2S1/22P1/2)
ground state has been measured by Resonance Optical Absorption
(ROA) technique in a DC magnetron sputtering deposition with
argon. We measured these densities under variety of operation
conditions: pressure from 0.6 μbar to 14 μbar, input power from
10W to 200W and N2 mixture from 0% to 100%. For measuring the
gas temperature, we used the simulation of N2 rotational spectra
with a special computer code. The absolute number density of Cu
atoms decreases with increasing the N2 percentage of buffer gas at
any conditions of this work. But the deposition rate, is not decreased
with the same manner. The deposition rate variation is very small
and in the limit of quartz balance measuring equipment accuracy. So
we conclude that decrease in the absolute number density of Cu
atoms in magnetron plasma has not a big effect on deposition rate,
because the diffusion of Cu atoms to the chamber volume and
deviation of Cu atoms from direct path (towards the substrate)
decreases with increasing of N2 percentage of buffer gas. This is
because of the lower mass of N2 atoms compared to the argon ones.
Abstract: This study mainly aims at assessing the level of
microbial pollution of the water used in the chair system in dental
clinics. For this purpose 36 samples have been randomly collected
from a number of dental surgeries in the city of Tripoli in Libya.
However, 32 of the samples have tested positive to microbial
pollution including 13 of the samples, which have tested positives to
Pseudomonas aeruginosa. Based on the results of the test a further
investigation of the biofilms incorporated within the dental chair
system has been conducted. The laboratory tests of biofilms with
similar design to those found in dental chairs have proved that
bacterial pollution takes place through saliva of the patients who use
the chairs, and that this saliva is rich with nutrients which provides a
suitable breeding ground for all types of bacteria.
Abstract: We demonstrate that it is possible to compute wave function normalization constants for a class of Schr¨odinger type equations by an algorithm which scales linearly (in the number of eigenfunction evaluations) with the desired precision P in decimals.
Abstract: Industrial robots become useless without end-effectors
that for many instances are in the form of friction grippers.
Commonly friction grippers apply frictional forces to different
objects on the basis of programmers- experiences. This puts a
limitation on the effectiveness of gripping force that may result in
damaging the object. This paper describes various stages of design
and development of a low cost sensor-based robotic gripper that
would facilitate the task of applying right gripping forces to different
objects. The gripper is also equipped with range sensors in order to
avoid collisions of the gripper with objects. It is a fully functional
automated pick and place gripper which can be used in many
industrial applications. Yet it can also be altered or further developed
in order to suit a larger number of industrial activities. The current
design of gripper could lead to designing completely automated robot
grippers able to improve the efficiency and productivity of industrial
robots.
Abstract: Nowadays, precipitation prediction is required for proper planning and management of water resources. Prediction with neural network models has received increasing interest in various research and application domains. However, it is difficult to determine the best neural network architecture for prediction since it is not immediately obvious how many input or hidden nodes are used in the model. In this paper, neural network model is used as a forecasting tool. The major aim is to evaluate a suitable neural network model for monthly precipitation mapping of Myanmar. Using 3-layerd neural network models, 100 cases are tested by changing the number of input and hidden nodes from 1 to 10 nodes, respectively, and only one outputnode used. The optimum model with the suitable number of nodes is selected in accordance with the minimum forecast error. In measuring network performance using Root Mean Square Error (RMSE), experimental results significantly show that 3 inputs-10 hiddens-1 output architecture model gives the best prediction result for monthly precipitation in Myanmar.
Abstract: Analysis and visualization of microarraydata is veryassistantfor biologists and clinicians in the field of diagnosis and treatment of patients. It allows Clinicians to better understand the structure of microarray and facilitates understanding gene expression in cells. However, microarray dataset is a complex data set and has thousands of features and a very small number of observations. This very high dimensional data set often contains some noise, non-useful information and a small number of relevant features for disease or genotype. This paper proposes a non-linear dimensionality reduction algorithm Local Principal Component (LPC) which aims to maps high dimensional data to a lower dimensional space. The reduced data represents the most important variables underlying the original data. Experimental results and comparisons are presented to show the quality of the proposed algorithm. Moreover, experiments also show how this algorithm reduces high dimensional data whilst preserving the neighbourhoods of the points in the low dimensional space as in the high dimensional space.
Abstract: We develop a three-step fuzzy logic-based algorithm for clustering categorical attributes, and we apply it to analyze cultural data. In the first step the algorithm employs an entropy-based clustering scheme, which initializes the cluster centers. In the second step we apply the fuzzy c-modes algorithm to obtain a fuzzy partition of the data set, and the third step introduces a novel cluster validity index, which decides the final number of clusters.
Abstract: A local municipality has decided to build a sewage pit
to receive residential sewage waste arriving by tank trucks. Daily
accumulated waste are to be pumped to a nearby waste water
treatment facility to be re-consumed for agricultural and construction
projects. A discrete-event simulation model using Arena Software
was constructed to assist in defining the capacity of the system in
cubic meters, number of tank trucks to use the system, number of
unload docks required, number of standby areas needed and
manpower required for data collection at entrance checkpoint and
truck tank load toxicity testing. The results of the model are
statistically validated. Simulation turned out to be an excellent tool
in the facility planning effort for the pit project, as it insured smooth
flow lines of tank trucks load discharge and best utilization of
facilities on site.
Abstract: Laminar natural-convective heat transfer from a
horizontal cylinder is studied by solving the Navier-Stokes and
energy equations using higher order compact scheme in cylindrical
polar coordinates. Results are obtained for Rayleigh numbers of 1,
10, 100 and 1000 for a Prandtl number of 0.7. The local Nusselt
number and mean Nusselt number are calculated and compared with
available experimental and theoretical results. Streamlines, vorticity -
lines and isotherms are plotted.
Abstract: In this paper a deterministic polynomial-time
algorithm is presented for the Clique problem. The case is considered
as the problem of omitting the minimum number of vertices from the
input graph so that none of the zeroes on the graph-s adjacency
matrix (except the main diagonal entries) would remain on the
adjacency matrix of the resulting subgraph. The existence of a
deterministic polynomial-time algorithm for the Clique problem, as
an NP-complete problem will prove the equality of P and NP
complexity classes.
Abstract: In this work, a characterization and modeling of
packet loss of a Voice over Internet Protocol (VoIP) communication
is developed. The distributions of the number of consecutive received
and lost packets (namely gap and burst) are modeled from the
transition probabilities of two-state and four-state model.
Measurements show that both models describe adequately the burst
distribution, but the decay of gap distribution for non-homogeneous
losses is better fit by the four-state model. The respective
probabilities of transition between states for each model were
estimated with a proposed algorithm from a set of monitored VoIP
calls in order to obtain representative minimum, maximum and
average values for both models.
Abstract: In this paper an alternative analysis in the time
domain is described and the results of the interpolation process are
presented by means of functions that are based on the rule of
conditional mathematical expectation and the covariance function. A
comparison between the interpolation error caused by low order
filters and the classic sinc(t) truncated function is also presented.
When fewer samples are used, low-order filters have less error. If the
number of samples increases, the sinc(t) type functions are a better
alternative. Generally speaking there is an optimal filter for each
input signal which depends on the filter length and covariance
function of the signal. A novel scheme of work for adaptive
interpolation filters is also presented.