Abstract: In this paper we show that adjusting ART in accordance with static network scenario can substantially improve the performance of AODV by reducing control overheads. We explain the relationship of control overheads with network size and request patterns of the users. Through simulation we show that making ART proportionate to network static time reduces the amount of control overheads independent of network size and user request patterns.
Abstract: The success of an electronic system in a System-on- Chip is highly dependent on the efficiency of its interconnection network, which is constructed from routers and channels (the routers move data across the channels between nodes). Since neither classical bus based nor point to point architectures can provide scalable solutions and satisfy the tight power and performance requirements of future applications, the Network-on-Chip (NoC) approach has recently been proposed as a promising solution. Indeed, in contrast to the traditional solutions, the NoC approach can provide large bandwidth with moderate area overhead. The selected topology of the components interconnects plays prime rule in the performance of NoC architecture as well as routing and switching techniques that can be used. In this paper, we present two generic NoC architectures that can be customized to the specific communication needs of an application in order to reduce the area with minimal degradation of the latency of the system. An experimental study is performed to compare these structures with basic NoC topologies represented by 2D mesh, Butterfly-Fat Tree (BFT) and SPIN. It is shown that Cluster mesh (CMesh) and MinRoot schemes achieves significant improvements in network latency and energy consumption with only negligible area overhead and complexity over existing architectures. In fact, in the case of basic NoC topologies, CMesh and MinRoot schemes provides substantial savings in area as well, because they requires fewer routers. The simulation results show that CMesh and MinRoot networks outperforms MESH, BFT and SPIN in main performance metrics.
Abstract: In this paper a new method is suggested for risk
management by the numerical patterns in data-mining. These patterns
are designed using probability rules in decision trees and are cared to
be valid, novel, useful and understandable. Considering a set of
functions, the system reaches to a good pattern or better objectives.
The patterns are analyzed through the produced matrices and some
results are pointed out. By using the suggested method the direction
of the functionality route in the systems can be controlled and best
planning for special objectives be done.
Abstract: We investigate properties of convective solutions of the
Boussinesq thermal convection in a moderately rotating spherical
shell allowing the inner and outer sphere rotation due to the viscous
torque of the fluid. The ratio of the inner and outer radii of the
spheres, the Prandtl number and the Taylor number are fixed to 0.4,
1 and 5002, respectively. The inertial moments of the inner and outer
spheres are fixed to about 0.22 and 100, respectively. The Rayleigh
number is varied from 2.6 × 104 to 3.4 × 104. In this parameter
range, convective solutions transit from equatorially symmetric quasiperiodic
ones to equatorially asymmetric chaotic ones as the Rayleigh
number is increased. The transition route in the system allowing
rotation of both the spheres is different from that in the co-rotating
system, which means the inner and outer spheres rotate with the
same constant angular velocity: the convective solutions transit as
equatorially symmetric quasi-periodic solution → equatorially symmetric
chaotic solution → equatorially asymmetric chaotic solution
in the system allowing both the spheres rotation, while equatorially
symmetric quasi-periodic solution → equatorially asymmetric quasiperiodic
solution → equatorially asymmetric chaotic solution in the
co-rotating system.
Abstract: Building maintenance plays an important role among other activities in building operation. Building defect and damages are part of the building maintenance 'bread and butter' as their input indicated in the building inspection is very much justified, particularly as to determine the building performance. There will be no escape route or short cut from building maintenance work. This study attempts to identify a competitive performance that translates the Critical Success Factor achievements and satisfactorily meet the university-s expectation. The quality and efficiency of maintenance management operation of building depends, to some extent, on the building condition information, the expectation from the university sector and the works carried out for each maintenance activity. This paper reviews the critical success factor in building maintenance management practice for university sectors from four (4) perspectives which include (1) customer (2) internal processes (3) financial and (4) learning and growth perspective. The enhancement of these perspectives is capable to reach the maintenance management goal for a better living environment in university campus.
Abstract: With the prevalence of computer and development of information technology, Geographic Information Systems (GIS) have long used for a variety of applications in electrical engineering. GIS are designed to support the analysis, management, manipulation and mapping of spatial data. This paper presents several usages of GIS in power utilities such as automated route selection for the construction of new power lines which uses a dynamic programming model for route optimization, load forecasting and optimizing planning of substation-s location and capacity with comprehensive algorithm which involves an accurate small-area electric load forecasting procedure and simulates the different cost functions of substations.
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: Massive use of places with strong tourist attraction
with the consequent possibility of losing place-identity produces
harmful effects on cities and their users. In order to mitigate this risk,
areas close to such places can be identified so as to widen the
visitor-s range of action and offer alternative activities integrated
with the main site. The cultural places and appropriate activities can
be identified using a method of analysis and design able to trace the
identity of the places, their characteristics and potential, and to
provide a sustainable improvement. The aim of this work is to
propose PlaceMaker as a method of urban analysis and design which
both detects elements that do not feature in traditional mapping and
which constitute the contemporary identity of the places, and
identifies appropriate project interventions. Two final complex maps
– the first of analysis and the second of design – respectively
represent the identity of places and project interventions. In order to
illustrate the method-s potential; the results of the experimentation
carried out in the Trevi-Pantheon route in Rome and the appropriate
interventions to decongest the area are illustrated.
Abstract: Route bus system is the fundamental public transportation
system and has an important role in every province. To improve
the usability of it greatly, we develop an AR application for "Bus-
Net". The Bus-Net system is the shortest path planning system.
Bus-Net supports bus users to make a plan to change buses by
providing them with information about the direction. However, with
Bus-Net, these information are provided in text-base. It is difficult
to understand them for the person who does not know the place. We
developed the AR application for Bus-Net. It supports the action of
a bus user in an innovative way by putting information on a camera
picture and leading the way to a bus stop. The application also inform
the user the correct bus to get, the direction the bus takes and the
fare, which ease many anxieties and worries people tend to feel when
they take buses.
Abstract: IPsec protocol[1] is a set of security extensions
developed by the IETF and it provides privacy and authentication
services at the IP layer by using modern cryptography. In this paper,
we describe both of H/W and S/W architectures of our router system,
SRS-10. The system is designed to support high performance routing
and IPsec VPN. Especially, we used Cavium-s CN2560 processor to
implement IPsec processing in inline-mode.
Abstract: The present disposal routes of sewage sludge represent a critical environmental issue in Egypt. Recently, there has been an increasing concern about sewage sludge management due to the environmental risks, which resulted from the fast expansion of wastewater treatment plants without equal attention in dealing with the produced sludge. This paper discusses the current situation of sewage sludge management in Egypt presenting a brief overview of the existing wastewater treatment plants, sludge production and characteristics as well as options of beneficial use and potential demand of sewage sludge under Egyptian conditions. The characteristics of sewage sludge are discussed considering the results of own sampling and analysis as well as previous studies. Furthermore, alternative treatment scenarios for sewage sludge, which have been recently developed in Egypt, are discussed and perspectives for a sustainable agricultural use are outlined.
Abstract: This paper presents a comparison of metaheuristic
algorithms, Genetic Algorithm (GA) and Ant Colony Optimization
(ACO), in producing freeman chain code (FCC). The main problem
in representing characters using FCC is the length of the FCC
depends on the starting points. Isolated characters, especially the
upper-case characters, usually have branches that make the traversing
process difficult. The study in FCC construction using one
continuous route has not been widely explored. This is our
motivation to use the population-based metaheuristics. The
experimental result shows that the route length using GA is better
than ACO, however, ACO is better in computation time than GA.
Abstract: An on-demand routing protocol for wireless ad hoc
networks is one that searches for and attempts to discover a route to
some destination node only when a sending node originates a data
packet addressed to that node. In order to avoid the need for such a
route discovery to be performed before each data packet is sent, such
routing protocols must cache routes previously discovered. This
paper presents an analysis of the effect of intelligent caching in a non
clustered network, using on-demand routing protocols in wireless ad
hoc networks. The analysis carried out is based on the Dynamic
Source Routing protocol (DSR), which operates entirely on-demand.
DSR uses the cache in every node to save the paths that are learnt
during route discovery procedure. In this implementation, caching
these paths only at intermediate nodes and using the paths from these
caches when required is tried. This technique helps in storing more
number of routes that are learnt without erasing the entries in the
cache, to store a new route that is learnt.
The simulation results on DSR have shown that this technique
drastically increases the available memory for caching the routes
discovered without affecting the performance of the DSR routing
protocol in any way, except for a small increase in end to end delay.
Abstract: This paper deals with condition monitoring of electric switch machine for railway points. Point machine, as a complex electro-mechanical device, switch the track between two alternative routes. There has been an increasing interest in railway safety and the optimal management of railway equipments maintenance, e.g. point machine, in order to enhance railway service quality and reduce system failure. This paper explores the development of Kolmogorov- Smirnov (K-S) test to detect some point failures (external to the machine, slide chairs, fixing, stretchers, etc), while the point machine (inside the machine) is in its proper condition. Time-domain stator Current signatures of normal (healthy) and faulty points are taken by 3 Hall Effect sensors and are analyzed by K-S test. The test is simulated by creating three types of such failures, namely putting a hard stone and a soft stone between stock rail and switch blades as obstacles and also slide chairs- friction. The test has been applied for those three faults which the results show that K-S test can effectively be developed for the aim of other point failures detection, which their current signatures deviate parametrically from the healthy current signature. K-S test as an analysis technique, assuming that any defect has a specific probability distribution. Empirical cumulative distribution functions (ECDF) are used to differentiate these probability distributions. This test works based on the null hypothesis that ECDF of target distribution is statistically similar to ECDF of reference distribution. Therefore by comparing a given current signature (as target signal) from unknown switch state to a number of template signatures (as reference signal) from known switch states, it is possible to identify which is the most likely state of the point machine under analysis.
Abstract: Public bus service plays a significant role in our
society as people movers and to facilitate travels within towns and districts. The quality of service of public bus is always being
regarded as poor, or rather, underestimated as second class means of transportation. Reliability of service, or the ability to deliver service as planned, is one key element in perceiving the quality of bus service and the punctuality index is one of the performance parameters in determining the service reliability. This study
concentrates on evaluating the reliability performance of bus operation using punctuality index assessment. A week data for each
of six city bus routes is recorded using the on-board methodology to calculate the punctuality index for city bus service in Kota Bharu. The results revealed that the punctuality index for the whole city bus network is 94.25% (LOS B).
Abstract: Today, node-disjoint routing becomes inessential
technique in communication of packets among various nodes in
networks. Meanwhile AODV (Ad Hoc On-demand Multipath
Distance Vector) creates single-path route between a pair of source
and destination nodes. Some researches has done so far to make
multipath node-disjoint routing based on AODV protocol. But
however their overhead and end-to-end delay are relatively high,
while the detail of their code is not available too. This paper proposes
a new approach of multipath node-disjoint routing based on AODV
protocol. Then the algorithm of analytical model is presented. The
extensive results of this algorithm will be presented in the next paper.
Abstract: Security management has changed from the
management of security equipments and useful interface to manager.
It analyzes the whole security conditions of network and preserves the
network services from attacks. Secure router technology has security
functions, such as intrusion detection, IPsec(IP Security) and access
control, are applied to legacy router for secure networking. It controls
an unauthorized router access and detects an illegal network intrusion.
This paper relates to a security engine management of router based on
a security policy, which is the definition of security function against a
network intrusion. This paper explains the security policy and designs
the structure of security engine management framework.
Abstract: This paper presents Qmulus- a Cloud Based GPS
Model. Qmulus is designed to compute the best possible route which
would lead the driver to the specified destination in the shortest time
while taking into account real-time constraints. Intelligence
incorporated to Qmulus-s design makes it capable of generating and
assigning priorities to a list of optimal routes through customizable
dynamic updates. The goal of this design is to minimize travel and
cost overheads, maintain reliability and consistency, and implement
scalability and flexibility. The model proposed focuses on
reducing the bridge between a Client Application and a Cloud
service so as to render seamless operations. Qmulus-s system
model is closely integrated and its concept has the potential to be
extended into several other integrated applications making it capable
of adapting to different media and resources.
Abstract: In this paper we present a full performance analysis of an energy conserving routing protocol in mobile ad hoc network, named ER-AODV (Energy Reverse Ad-hoc On-demand Distance Vector routing). ER-AODV is a reactive routing protocol based on a policy which combines two mechanisms used in the basic AODV protocol. AODV and most of the on demand ad hoc routing protocols use single route reply along reverse path. Rapid change of topology causes that the route reply could not arrive to the source node, i.e. after a source node sends several route request messages, the node obtains a reply message, and this increases in power consumption. To avoid these problems, we propose a mechanism which tries multiple route replies. The second mechanism proposes a new adaptive approach which seeks to incorporate the metric "residual energy " in the process route selection, Indeed the residual energy of mobile nodes were considered when making routing decisions. The results of simulation show that protocol ER-AODV answers a better energy conservation.
Abstract: Topological changes in mobile ad hoc networks
frequently render routing paths unusable. Such recurrent path failures
have detrimental effects on quality of service. A suitable technique
for eliminating this problem is to use multiple backup paths between
the source and the destination in the network. This paper proposes an
effective and efficient protocol for backup and disjoint path set in ad
hoc wireless network. This protocol converges to a highly reliable
path set very fast with no message exchange overhead. The paths
selection according to this algorithm is beneficial for mobile ad hoc
networks, since it produce a set of backup paths with more high
reliability. Simulation experiments are conducted to evaluate the
performance of our algorithm in terms of route numbers in the path
set and its reliability. In order to acquire link reliability estimates, we
use link expiration time (LET) between two nodes.