Abstract: A mobile ad hoc network is a network of mobile nodes
without any notion of centralized administration. In such a network,
each mobile node behaves not only as a host which runs applications
but also as a router to forward packets on behalf of others. Clustering
has been applied to routing protocols to achieve efficient
communications. A CH network expresses the connected relationship
among cluster-heads. This paper discusses the methods for
constructing a CH network, and produces the following results: (1)
The required running costs of 3 traditional methods for constructing a
CH network are not so different from each other in the static
circumstance, or in the dynamic circumstance. Their running costs in
the static circumstance do not differ from their costs in the dynamic
circumstance. Meanwhile, although the routing costs required for the
above 3 methods are not so different in the static circumstance, the
costs are considerably different from each other in the dynamic
circumstance. Their routing costs in the static circumstance are also
very different from their costs in the dynamic circumstance, and the
former is one tenths of the latter. The routing cost in the dynamic
circumstance is mostly the cost for re-routing. (2) On the strength of
the above results, we discuss new 2 methods regarding whether they
are tolerable or not in the dynamic circumstance, that is, whether the
times of re-routing are small or not. These new methods are revised
methods that are based on the traditional methods. We recommended
the method which produces the smallest routing cost in the dynamic
circumstance, therefore producing the smallest total cost.
Abstract: This paper focuses on the development of bond graph
dynamic model of the mechanical dynamics of an excavating mechanism
previously designed to be used with small tractors, which are
fabricated in the Engineering Workshops of Jomo Kenyatta University
of Agriculture and Technology. To develop a mechanical dynamics
model of the manipulator, forward recursive equations similar to
those applied in iterative Newton-Euler method were used to obtain
kinematic relationships between the time rates of joint variables
and the generalized cartesian velocities for the centroids of the
links. Representing the obtained kinematic relationships in bondgraphic
form, while considering the link weights and momenta as
the elements led to a detailed bond graph model of the manipulator.
The bond graph method was found to reduce significantly the number
of recursive computations performed on a 3 DOF manipulator for a
mechanical dynamic model to result, hence indicating that bond graph
method is more computationally efficient than the Newton-Euler
method in developing dynamic models of 3 DOF planar manipulators.
The model was verified by comparing the joint torque expressions
of a two link planar manipulator to those obtained using Newton-
Euler and Lagrangian methods as analyzed in robotic textbooks. The
expressions were found to agree indicating that the model captures
the aspects of rigid body dynamics of the manipulator. Based on
the model developed, actuator sizing and valve sizing methodologies
were developed and used to obtain the optimal sizes of the pistons
and spool valve ports respectively. It was found that using the pump
with the sized flow rate capacity, the engine of the tractor is able to
power the excavating mechanism in digging a sandy-loom soil.
Abstract: Power consumption of nodes in ad hoc networks is a
critical issue as they predominantly operate on batteries. In order to
improve the lifetime of an ad hoc network, all the nodes must be
utilized evenly and the power required for connections must be
minimized. In this project a link layer algorithm known as Power
Aware medium Access Control (PAMAC) protocol is proposed
which enables the network layer to select a route with minimum total
power requirement among the possible routes between a source and a
destination provided all nodes in the routes have battery capacity
above a threshold. When the battery capacity goes below a
predefined threshold, routes going through these nodes will be
avoided and these nodes will act only as source and destination.
Further, the first few nodes whose battery power drained to the set
threshold value are pushed to the exterior part of the network and the
nodes in the exterior are brought to the interior. Since less total
power is required to forward packets for each connection. The
network layer protocol AOMDV is basically an extension to the
AODV routing protocol. AOMDV is designed to form multiple
routes to the destination and it also avoid the loop formation so that it
reduces the unnecessary congestion to the channel. In this project, the
performance of AOMDV is evaluated using PAMAC as a MAC layer
protocol and the average power consumption, throughput and
average end to end delay of the network are calculated and the results
are compared with that of the other network layer protocol AODV.
Abstract: Sensor networks are often deployed in unattended
environments, thus leaving these networks vulnerable to false data
injection attacks in which an adversary injects forged reports into the
network through compromised nodes, with the goal of deceiving the
base station or depleting the resources of forwarding nodes. Several
research solutions have been recently proposed to detect and drop such
forged reports during the forwarding process. Each design can provide
the equivalent resilience in terms of node compromising. However,
their energy consumption characteristics differ from each other. Thus,
employing only a single filtering scheme for a network is not a
recommendable strategy in terms of energy saving. It's very important
the threshold determination for message authentication to identify. We
propose the recursive contract net protocols which less energy level of
terminal node in wireless sensor network.
Abstract: This paper suggests an algorithm for the evaluation
and selection of suppliers. At the beginning, all the needed materials and services used by the organization were identified and categorized
with regard to their nature by ABC method. Afterwards, in order to reduce risk factors and maximize the organization's profit, purchase strategies were determined. Then, appropriate criteria were identified for primary evaluation of suppliers applying to the organization. The output of this stage was a list of suppliers qualified by the organization to participate in its tenders. Subsequently, considering a material in particular, appropriate criteria on the ordering of the
mentioned material were determined, taking into account the particular materials' specifications as well as the organization's needs. Finally, for the purpose of validation and verification of the
proposed model, it was applied to Mobarakeh Steel Company (MSC), the qualified suppliers of this Company are ranked by the means of a Hierarchical Fuzzy TOPSIS method. The obtained results
show that the proposed algorithm is quite effective, efficient and easy to apply.
Abstract: Today, the working areas put forward the administration of change. In order to provide this; it is required from the organizations to be creative. Professional creativity in offices depends on an environment that enables the development of the organization only after the individual or collective exertions within the organization. By providing this environment, the organization will gain efficiency, productivity, and work pleasure. In order to bring up the workforce appropriate to the related expectations, the professional creativity of the office management and secretarial profession candidates should be evaluated, education programs appropriate to this and related directly with the service quality should be prepared and the future of this profession should be directed. The aim of this study is to ensure the attention to improve the prepared education program as well as the creative thoughts and their applications, when carrying out an office management and secretarial training. 144 students took place in this research and a questionnaire of 48 questions was carried out.
Abstract: The control design for unmanned underwater vehicles (UUVs) is challenging due to the uncertainties in the complex dynamic modeling of the vehicle as well as its unstructured operational environment. To cope with these difficulties, a practical robust control is therefore desirable. The paper deals with the application of coefficient diagram method (CDM) for a robust control design of an autonomous underwater vehicle. The CDM is an algebraic approach in which the characteristic polynomial and the controller are synthesized simultaneously. Particularly, a coefficient diagram (comparable to Bode diagram) is used effectively to convey pertinent design information and as a measure of trade-off between stability, response speed and robustness. In the polynomial ring, Kharitonov polynomials are employed to analyze the robustness of the controller due to parametric uncertainties.
Abstract: In this article, we introduce a mechanism by which the same concept of differentiated services used in network transmission can be applied to provide quality of service levels to pervasive systems applications. The classical DiffServ model, including marking and classification, assured forwarding, and expedited forwarding, are all utilized to create quality of service guarantees for various pervasive applications requiring different levels of quality of service. Through a collection of various sensors, personal devices, and data sources, the transmission of contextsensitive data can automatically occur within a pervasive system with a given quality of service level. Triggers, initiators, sources, and receivers are four entities labeled in our mechanism. An explanation of the role of each is provided, and how quality of service is guaranteed.
Abstract: In this study, Li4SiO4 powder was successfully
synthesized via sol gel method followed by drying at 150oC. Lithium
oxide, Li2O and silicon oxide, SiO2 were used as the starting
materials with citric acid as the chelating agent. The obtained powder
was then sintered at various temperatures. Crystallographic phase
analysis, morphology and ionic conductivity were investigated
systematically employing X-ray diffraction, Fourier Transform
Infrared, Scanning Electron Microscopy and AC impedance
spectroscopy. XRD result showed the formation of pure monoclinic
Li4SiO4 crystal structure with lattice parameters a = 5.140 Å, b =
6.094 Å, c = 5.293 Å, β = 90o in the sample sintered at 750oC. This
observation was confirmed by FTIR analysis. The bulk conductivity
of this sample at room temperature was 3.35 × 10-6 S cm-1 and the
highest bulk conductivity of 1.16 × 10-4 S cm-1 was obtained at
100°C. The results indicated that, the Li4SiO4 compound has
potential to be used as host for LISICON structured solid electrolyte
for low temperature application.
Abstract: The wireless link can be unreliable in realistic wireless
sensor networks (WSNs). Energy efficient and reliable data
forwarding is important because each node has limited resources.
Therefore, we must suggest an optimal solution that considers using
the information of the node-s characteristics. Previous routing
protocols were unsuited to realistic asymmetric WSNs. In this paper,
we propose a Protocol that considers Both sides of Link-quality and
Energy (PBLE), an optimal routing protocol that balances modified
link-quality, distance and energy. Additionally, we propose a node
scheduling method. PBLE achieves a longer lifetime than previous
routing protocols and is more energy-efficient. PBLE uses energy,
local information and both sides of PRR in a 1-hop distance. We
explain how to send data packets to the destination node using the
node's information. Simulation shows PBLE improves delivery rate
and network lifetime compared to previous schemes. Moreover, we
show the improvement in various WSN environments.
Abstract: This study is concerned with the investigation of the
suitability of several empirical and semi-empirical drying models
available in the literature to define drying behavior of viscose yarn
bobbins. For this purpose, firstly, experimental drying behaviour of
viscose bobbins was determined on an experimental dryer setup
which was designed and manufactured based on hot-air bobbin
dryers used in textile industry. Afterwards, drying models considered
were fitted to the experimentally obtained moisture ratios. Drying
parameters were drying temperature and bobbin diameter. The fit
was performed by selecting the values for constants in the models in
such a way that these values make the sum of the squared differences
between the experimental and the model results for moisture ratio
minimum. Suitability of fitting was specified as comparing the
correlation coefficient, standard error and mean square deviation.
The results show that the most appropriate model in describing the
drying curves of viscose bobbins is the Page model.
Abstract: A concern that researchers usually face in different
applications of Artificial Neural Network (ANN) is determination of
the size of effective domain in time series. In this paper, trial and
error method was used on groundwater depth time series to determine
the size of effective domain in the series in an observation well in
Union County, New Jersey, U.S. different domains of 20, 40, 60, 80,
100, and 120 preceding day were examined and the 80 days was
considered as effective length of the domain. Data sets in different
domains were fed to a Feed Forward Back Propagation ANN with
one hidden layer and the groundwater depths were forecasted. Root
Mean Square Error (RMSE) and the correlation factor (R2) of
estimated and observed groundwater depths for all domains were
determined. In general, groundwater depth forecast improved, as
evidenced by lower RMSEs and higher R2s, when the domain length
increased from 20 to 120. However, 80 days was selected as the
effective domain because the improvement was less than 1% beyond
that. Forecasted ground water depths utilizing measured daily data
(set #1) and data averaged over the effective domain (set #2) were
compared. It was postulated that more accurate nature of measured
daily data was the reason for a better forecast with lower RMSE
(0.1027 m compared to 0.255 m) in set #1. However, the size of input
data in this set was 80 times the size of input data in set #2; a factor
that may increase the computational effort unpredictably. It was
concluded that 80 daily data may be successfully utilized to lower the
size of input data sets considerably, while maintaining the effective
information in the data set.
Abstract: Cloud Computing is a new technology that helps us to
use the Cloud for compliance our computation needs. Cloud refers to a scalable network of computers that work together like Internet. An
important element in Cloud Computing is that we shift processing, managing, storing and implementing our data from, locality into the
Cloud; So it helps us to improve the efficiency. Because of it is new
technology, it has both advantages and disadvantages that are
scrutinized in this article. Then some vanguards of this technology
are studied. Afterwards we find out that Cloud Computing will have
important roles in our tomorrow life!
Abstract: Although backpropagation ANNs generally predict
better than decision trees do for pattern classification problems, they
are often regarded as black boxes, i.e., their predictions cannot be
explained as those of decision trees. In many applications, it is
desirable to extract knowledge from trained ANNs for the users to
gain a better understanding of how the networks solve the problems.
A new rule extraction algorithm, called rule extraction from artificial
neural networks (REANN) is proposed and implemented to extract
symbolic rules from ANNs. A standard three-layer feedforward ANN
is the basis of the algorithm. A four-phase training algorithm is
proposed for backpropagation learning. Explicitness of the extracted
rules is supported by comparing them to the symbolic rules generated
by other methods. Extracted rules are comparable with other methods
in terms of number of rules, average number of conditions for a rule,
and predictive accuracy. Extensive experimental studies on several
benchmarks classification problems, such as breast cancer, iris,
diabetes, and season classification problems, demonstrate the
effectiveness of the proposed approach with good generalization
ability.
Abstract: Position based routing protocols are the kinds of
routing protocols, which they use of nodes location information,
instead of links information to routing. In position based routing
protocols, it supposed that the packet source node has position
information of itself and it's neighbors and packet destination node.
Greedy is a very important position based routing protocol. In one of
it's kinds, named MFR (Most Forward Within Radius), source node
or packet forwarder node, sends packet to one of it's neighbors with
most forward progress towards destination node (closest neighbor to
destination). Using distance deciding metric in Greedy to forward
packet to a neighbor node, is not suitable for all conditions. If closest
neighbor to destination node, has high speed, in comparison with
source node or intermediate packet forwarder node speed or has very
low remained battery power, then packet loss probability is
increased. Proposed strategy uses combination of metrics distancevelocity
similarity-power, to deciding about giving the packet to
which neighbor. Simulation results show that the proposed strategy
has lower lost packets average than Greedy, so it has more reliability.
Abstract: With optimized bandwidth and latency discrepancy ratios, Node Gain Scores (NGSs) are determined and used as a basis for shaping the max-heap overlay. The NGSs - determined as the respective bandwidth-latency-products - govern the construction of max-heap-form overlays. Each NGS is earned as a synergy of discrepancy ratio of the bandwidth requested with respect to the estimated available bandwidth, and latency discrepancy ratio between the nodes and the source node. The tree leads to enhanceddelivery overlay multicasting – increasing packet delivery which could, otherwise, be hindered by induced packet loss occurring in other schemes not considering the synergy of these parameters on placing the nodes on the overlays. The NGS is a function of four main parameters – estimated available bandwidth, Ba; individual node's requested bandwidth, Br; proposed node latency to its prospective parent (Lp); and suggested best latency as advised by source node (Lb). Bandwidth discrepancy ratio (BDR) and latency discrepancy ratio (LDR) carry weights of α and (1,000 - α ) , respectively, with arbitrary chosen α ranging between 0 and 1,000 to ensure that the NGS values, used as node IDs, maintain a good possibility of uniqueness and balance between the most critical factor between the BDR and the LDR. A max-heap-form tree is constructed with assumption that all nodes possess NGS less than the source node. To maintain a sense of load balance, children of each level's siblings are evenly distributed such that a node can not accept a second child, and so on, until all its siblings able to do so, have already acquired the same number of children. That is so logically done from left to right in a conceptual overlay tree. The records of the pair-wise approximate available bandwidths as measured by a pathChirp scheme at individual nodes are maintained. Evaluation measures as compared to other schemes – Bandwidth Aware multicaSt architecturE (BASE), Tree Building Control Protocol (TBCP), and Host Multicast Tree Protocol (HMTP) - have been conducted. This new scheme generally performs better in terms of trade-off between packet delivery ratio; link stress; control overhead; and end-to-end delays.
Abstract: The objective of this research is to develop an advanced driver assistance system characterized with the functions of lane departure warning (LDW), forward collision warning (FCW) and adaptive front-lighting system (AFS). The system is mainly configured a CCD/CMOS camera to acquire the images of roadway ahead in association with the analysis made by an image-processing unit concerning the lane ahead and the preceding vehicles. The input image captured by a camera is used to recognize the lane and the preceding vehicle positions by image detection and DROI (Dynamic Range of Interesting) algorithms. Therefore, the system is able to issue real-time auditory and visual outputs of warning when a driver is departing the lane or driving too close to approach the preceding vehicle unwittingly so that the danger could be prevented from occurring. During the nighttime, in addition to the foregoing warning functions, the system is able to control the bending light of headlamp to provide an immediate light illumination when making a turn at a curved lane and adjust the level automatically to reduce the lighting interference against the oncoming vehicles driving in the opposite direction by the curvature of lane and the vanishing point estimations. The experimental results show that the integrated vehicle image system is robust to most environments such as the lane detection and preceding vehicle detection average accuracy performances are both above 90 %.
Abstract: In this paper we study the resource allocation problem
for an OFDMA based cooperative two-way relaying (TWR) network.
We focus on amplify and forward (AF) analog network coding
(ANC) protocol. An optimization problem for two basic resources
namely, sub-carrier and power is formulated for multi-user TWR
networks. A joint optimal optimization problem is investigated and
two-step low complexity sub-optimal resource allocation algorithm is
proposed for multi-user TWR networks with ANC protocol. The
proposed algorithm has been evaluated in term of total achievable
system sum-rate and achievable individual sum-rate for each userpair.
The good tradeoff between system sum-rate and fairness is
observed in the two-step proportional resource allocation scheme.
Abstract: Launch and recovery helicopter wind envelope for a
ship type was determined as the first step to the helicopter
qualification program. Flight deck velocities data were obtained by
means of a two components laser Doppler anemometer testing a
1/50th model in the wind tunnel stream. Full-scale flight deck
measurements were obtained on board the ship using a sonic
anemometer. Wind tunnel and full-scale measurements were
compared, showing good agreement and finally, a preliminary launch
and recovery helicopter wind envelope for this specific ship was
built.
Abstract: This paper presents a modified version of the
maximum urgency first scheduling algorithm. The maximum
urgency algorithm combines the advantages of fixed and dynamic
scheduling to provide the dynamically changing systems with
flexible scheduling. This algorithm, however, has a major
shortcoming due to its scheduling mechanism which may cause a
critical task to fail. The modified maximum urgency first scheduling
algorithm resolves the mentioned problem. In this paper, we propose
two possible implementations for this algorithm by using either
earliest deadline first or modified least laxity first algorithms for
calculating the dynamic priorities. These two approaches are
compared together by simulating the two algorithms. The earliest
deadline first algorithm as the preferred implementation is then
recommended. Afterwards, we make a comparison between our
proposed algorithm and maximum urgency first algorithm using
simulation and results are presented. It is shown that modified
maximum urgency first is superior to maximum urgency first, since it
usually has less task preemption and hence, less related overhead. It
also leads to less failed non-critical tasks in overloaded situations.