Abstract: In the hardening energy context, the transport sector
which constitutes a large worldwide energy demand has to be
improving for decrease energy demand and global warming impacts.
In a controversial situation where subsists an increasing demand for
long-distance and high-speed travels, high-speed trains offer many
advantages, as consuming significantly less energy than road or air
transports.
At the project phase of new rail infrastructures, it is nowadays
important to characterize accurately the energy that will be induced
by its operation phase, in addition to other more classical criteria as
construction costs and travel time.
Current literature consumption models used to estimate railways
operation phase are obsolete or not enough accurate for taking into
account the newest train or railways technologies.
In this paper, an updated model of consumption for high-speed is
proposed, based on experimental data obtained from full-scale tests
performed on a new high-speed line. The assessment of the model
is achieved by identifying train parameters and measured power
consumptions for more than one hundred train routes. Perspectives
are then discussed to use this updated model for accurately assess
the energy impact of future railway infrastructures.
Abstract: Discovery schools in Jordan are connected in one flat
ATM bridge network. All Schools connected to the network will hear
broadcast traffic. High percentage of unwanted traffic such as
broadcast, consumes the bandwidth between schools and QRC.
Routers in QRC have high CPU utilization. The number of
connections on the router is very high, and may exceed recommend
manufacturing specifications. One way to minimize number of
connections to the routers in QRC, and minimize broadcast traffic is
to use PPPoE. In this study, a PPPoE solution has been presented
which shows high performance for the clients when accessing the
school server resources. Despite the large number of the discovery
schools at MoE, the experimental results show that the PPPoE
solution is able to yield a satisfactory performance for each client at
the school and noticeably reduce the traffic broadcast to the QRC.
Abstract: Tuberculosis (TB) is a bacterial infectious disease caused by the obligate human pathogen, Mycobacterium tuberculosis. Multidrug-resistant tuberculosis (MDR-TB) is a global reality that threatens tuberculosis control. Resistance to antibiotic Rifampicin, occurs in 95% of cases through nucleotide substitutions in an 81-bp core region of the rpoB i.e; beta subunit of DNA dependant RNA polymerase. In this paper, we studied the Rifampicin-rpoB receptor interactions In silico. First, homology modeling was performed to obtain the three dimensional structure of Mycobacterium rpoB. Sixty analogs of Rifampicin were prepared using Marvin sketch software. Both original Rifampicin and the analogs were docked with rpoB and energy values were obtained. Out of sixty analogs, 43 analogs had lesser energy values than conventional Rifampicin and hence are predicted to have greater binding affinity to rpoB. Thus, this study offers a route for the development of Rifampicin analogs against multi drug resistant Mycobacterium rpoB.
Abstract: A synchronous network-on-chip using wormhole packet switching
and supporting guaranteed-completion best-effort with low-priority (LP)
and high-priority (HP) wormhole packet delivery service is presented in
this paper. Both our proposed LP and HP message services deliver a good
quality of service in term of lossless packet completion and in-order message
data delivery. However, the LP message service does not guarantee minimal
completion bound. The HP packets will absolutely use 100% bandwidth of
their reserved links if the HP packets are injected from the source node with
maximum injection. Hence, the service are suitable for small size messages
(less than hundred bytes). Otherwise the other HP and LP messages, which
require also the links, will experience relatively high latency depending on the
size of the HP message. The LP packets are routed using a minimal adaptive
routing, while the HP packets are routed using a non-minimal adaptive routing
algorithm. Therefore, an additional 3-bit field, identifying the packet type,
is introduced in their packet headers to classify and to determine the type
of service committed to the packet. Our NoC prototypes have been also
synthesized using a 180-nm CMOS standard-cell technology to evaluate the
cost of implementing the combination of both services.
Abstract: A simple approach is demonstrated for growing large
scale, nearly vertically aligned ZnO nanowire arrays by thermal
oxidation method. To reveal effect of temperature on growth and
physical properties of the ZnO nanowires, gold coated zinc substrates
were annealed at 300 °C and 400 °C for 4 hours duration in air. Xray
diffraction patterns of annealed samples indicated a set of well
defined diffraction peaks, indexed to the wurtzite hexagonal phase of
ZnO. The scanning electron microscopy studies show formation of
ZnO nanowires having length of several microns and average of
diameter less than 500 nm. It is found that the areal density of wires
is relatively higher, when the annealing is carried out at higher
temperature i.e. at 400°C. From the field emission studies, the values
of the turn-on and threshold field, required to draw emission current
density of 10 μA/cm2 and 100 μA/cm2 are observed to be 1.2 V/μm
and 1.7 V/μm for the samples annealed at 300 °C and 2.9 V/μm and
3.7 V/μm for that annealed at 400 °C, respectively. The field
emission current stability, investigated over duration of more than 2
hours at the preset value of 1 μA, is found to be fairly good in both
cases. The simplicity of the synthesis route coupled with the
promising field emission properties offer unprecedented advantage
for the use of ZnO field emitters for high current density
applications.
Abstract: For collecting data from all sensor nodes, some
changes in Dynamic Source Routing (DSR) protocol is proposed. At
each hop level, route-ranking technique is used for distributing
packets to different selected routes dynamically. For calculating rank
of a route, different parameters like: delay, residual energy and
probability of packet loss are used. A hybrid topology of
DMPR(Disjoint Multi Path Routing) and MMPR(Meshed Multi Path
Routing) is formed, where braided topology is used in different
faulty zones of network. For reducing energy consumption, variant
transmission ranges is used instead of fixed transmission range. For
reducing number of packet drop, a fuzzy logic inference scheme is
used to insert different types of delays dynamically. A rule based
system infers membership function strength which is used to
calculate the final delay amount to be inserted into each of the node
at different clusters.
In braided path, a proposed 'Dual Line ACK Link'scheme is
proposed for sending ACK signal from a damaged node or link to a
parent node to ensure that any error in link or any node-failure
message may not be lost anyway. This paper tries to design the
theoretical aspects of a model which may be applied for collecting
data from any large hanging iron structure with the help of wireless
sensor network. But analyzing these data is the subject of material
science and civil structural construction technology, that part is out
of scope of this paper.
Abstract: Platinum oxide nanoparticles were prepared by a
simple hydrothermal route and chemical reduction using
carbohydrates (Fructose and sucrose) as the reducing and
stabilizing agents. The crystallite size of these nanoparticles was
evaluated from X-ray diffraction (XRD), atomic force microscopy
(AFM) and transmission electron microscopy (TEM) and was
found to be 10 nm as shown in figure 1, which is the
demonstration of EM bright field and transmission electron
microscopy. The effect of carbohydrates on the morphology of the
nanoparticles was studied using TEM (Figure 1). The
nanoparticles (100 μg/ml) were administered to the Pseudomonas
Stutzeri and Lactobacillus cultures and the incubation was done at
35 oC for 24 hours. The nanocomposites exhibited interesting
inhibitory as well as bactericidal activity against P. Stutzeri and
and Lactobacillus species. Incorporation of nanoparticles also
increased the thermal stability of the carbohydrates.
Abstract: In this paper a special kind of buffer management policy is studied where the packet are preempted even when sufficient space is available in the buffer for incoming packets. This is done to congestion for future incoming packets to improve QoS for certain type of packets. This type of study has been done in past for ATM type of scenario. We extend the same for heterogeneous traffic where data rate and size of the packets are very versatile in nature. Typical example of this scenario is the buffer management in Differentiated Service Router. There are two aspects that are of interest. First is the packet size: whether all packets have same or different sizes. Second aspect is the value or space priority of the packets, do all packets have the same space priority or different packets have different space priorities. We present two types of policies to achieve QoS goals for packets with different priorities: the push out scheme and the expelling scheme. For this work the scenario of packets of variable length is considered with two space priorities and main goal is to minimize the total weighted packet loss. Simulation and analytical studies show that, expelling policies can outperform the push out policies when it comes to offering variable QoS for packets of two different priorities and expelling policies also help improve the amount of admissible load. Some other comparisons of push out and expelling policies are also presented using simulations.
Abstract: Recently, Denial of Service(DoS) attacks and Distributed DoS(DDoS) attacks which are stronger form of DoS attacks from plural hosts have become security threats on the Internet. It is important to identify the attack source and to block attack traffic as one of the measures against these attacks. In general, it is difficult to identify them because information about the attack source is falsified. Therefore a method of identifying the attack source by tracing the route of the attack traffic is necessary. A traceback method which uses traffic patterns, using changes in the number of packets over time as criteria for the attack traceback has been proposed. The traceback method using the traffic patterns can trace the attack by matching the shapes of input traffic patterns and the shape of output traffic pattern observed at a network branch point such as a router. The traffic pattern is a shapes of traffic and unfalsifiable information. The proposed trace methods proposed till date cannot obtain enough tracing accuracy, because they directly use traffic patterns which are influenced by non-attack traffics. In this paper, a new traffic pattern matching method using Independent Component Analysis(ICA) is proposed.
Abstract: A pilot project was carried out in 2007 by the senior
students of Cyprus International University, aiming to minimize the
total cost of waste collection in Northern Cyprus. Many developed
and developing countries have cut their transportation costs – which
lies between 30-40% – down at a rate of 40% percent, by
implementing network models for their route assignments.
Accordingly, a network model was implemented at Göçmenköy
district, to optimize and standardize waste collection works. The
work environment of the employees were also redesigned to provide
maximum ergonomy and to increase productivity, efficiency and
safety. Following the collection of the required data including waste
densities, lengths of roads and population, a model was constructed
to allocate the optimal route assignment for the waste collection
trucks at Göçmenköy district.
Abstract: With the demand of mobility by users, wireless
technologies have become the hotspot developing arena. Internet
Engineering Task Force (IETF) working group has developed Mobile
IP to support node mobility. The concept of node mobility indicates
that in spite of the movement of the node, it is still connected to the
internet and all the data transactions are preserved. It provides
location-independent access to Internet. After the incorporation of
host mobility, network mobility has undergone intense research.
There are several intricacies faced in the real world implementation
of network mobility significantly the problem of nested networks and
their consequences. This article is concerned regarding a problem of
nested network called pinball route problem and proposes a solution
to eliminate the above problem. The proposed mechanism is
implemented using NS2 simulation tool and it is found that the
proposed mechanism efficiently reduces the overload caused by the
pinball route problem.
Abstract: Medical services are usually provided in hospitals; however, in developing country, some rural residences have fewer opportunities to access in healthcare services due to the limitation of transportation communication. Therefore, in Thailand, there are charitable organizations operating to provide medical treatments to these people by shifting the medical services to operation sites; this is commonly known as mobile medical service. Operation routing is important for the organization to reduce its transportation cost in order to focus more on other important activities; for instance, the development of medical apparatus. VRP is applied to solve the problem of high transportation cost of the studied organization with the searching techniques of saving algorithm to find the minimum total distance of operation route and satisfy available time constraints of voluntary medical staffs.
Abstract: Selecting the routes and the assignment of link flow in a computer communication networks are extremely complex combinatorial optimization problems. Metaheuristics, such as genetic or simulated annealing algorithms, are widely applicable heuristic optimization strategies that have shown encouraging results for a large number of difficult combinatorial optimization problems. This paper considers the route selection and hence the flow assignment problem. A genetic algorithm and simulated annealing algorithm are used to solve this problem. A new hybrid algorithm combining the genetic with the simulated annealing algorithm is introduced. A modification of the genetic algorithm is also introduced. Computational experiments with sample networks are reported. The results show that the proposed modified genetic algorithm is efficient in finding good solutions of the flow assignment problem compared with other techniques.
Abstract: The main emphasis of metallurgists has been to process the materials to obtain the balanced mechanical properties for the given application. One of the processing routes to alter the properties is heat treatment. Nearly 90% of the structural applications are related to the medium carbon an alloyed steels and hence are regarded as structural steels. The major requirement in the conventional steel is to improve workability, toughness, hardness and grain refinement. In this view, it is proposed to study the mechanical and tribological properties of unalloyed structural (AISI 1140) steel with different thermal (heat) treatments like annealing, normalizing, tempering and hardening and compared with as brought (cold worked) specimen. All heat treatments are carried out in atmospheric condition. Hardening treatment improves hardness of the material, a marginal decrease in hardness value with improved ductility is observed in tempering. Annealing and normalizing improve ductility of the specimen. Normalized specimen shows ultimate ductility. Hardened specimen shows highest wear resistance in the initial period of slide wear where as above 25KM of sliding distance, as brought steel dominates the hardened specimen. Both mild and severe wear regions are observed. Microstructural analysis shows the existence of pearlitic structure in normalized specimen, lath martensitic structure in hardened, pearlitic, ferritic structure in annealed specimen.
Abstract: In this paper we propose a new traffic simulation
package, TDMSim, which supports both macroscopic and
microscopic simulation on free-flowing and regulated traffic systems.
Both simulators are based on travel demands, which specify the
numbers of vehicles departing from origins to arrive at different
destinations. The microscopic simulator implements the carfollowing
model given the pre-defined routes of the vehicles but also
supports the rerouting of vehicles. We also propose a macroscopic
simulator which is built in integration with the microscopic simulator
to allow the simulation to be scaled for larger networks without
sacrificing the precision achievable through the microscopic
simulator. The macroscopic simulator also enables the reuse of
previous simulation results when simulating traffic on the same
networks at later time. Validations have been conducted to show the
correctness of both simulators.
Abstract: For several high speed networks, providing resilience against failures is an essential requirement. The main feature for designing next generation optical networks is protecting and restoring high capacity WDM networks from the failures. Quick detection, identification and restoration make networks more strong and consistent even though the failures cannot be avoided. Hence, it is necessary to develop fast, efficient and dependable fault localization or detection mechanisms. In this paper we propose a new fault localization algorithm for WDM networks which can identify the location of a failure on a failed lightpath. Our algorithm detects the failed connection and then attempts to reroute data stream through an alternate path. In addition to this, we develop an algorithm to analyze the information of the alarms generated by the components of an optical network, in the presence of a fault. It uses the alarm correlation in order to reduce the list of suspected components shown to the network operators. By our simulation results, we show that our proposed algorithms achieve less blocking probability and delay while getting higher throughput.
Abstract: We present a non standard Euclidean vehicle
routing problem adding a level of clustering, and we revisit the use
of self-organizing maps as a tool which naturally handles such
problems. We present how they can be used as a main operator
into an evolutionary algorithm to address two conflicting
objectives of route length and distance from customers to bus stops
minimization and to deal with capacity constraints. We apply the
approach to a real-life case of combined clustering and vehicle
routing for the transportation of the 780 employees of an
enterprise. Basing upon a geographic information system we
discuss the influence of road infrastructures on the solutions
generated.
Abstract: An Ad hoc wireless network comprises of mobile
terminals linked and communicating with each other sans the aid of
traditional infrastructure. Optimized Link State Protocol (OLSR) is a
proactive routing protocol, in which routes are discovered/updated
continuously so that they are available when needed. Hello messages
generated by a node seeks information about its neighbor and if the
latter fails to respond to a specified number of hello messages
regulated by neighborhood hold time, the node is forced to assume
that the neighbor is not in range. This paper proposes to evaluate
OLSR routing protocol in a random mobility network having various
neighborhood hold time intervals. The throughput and delivery ratio
are also evaluated to learn about its efficiency for multimedia loads.
Abstract: This paper objects to extend Jon Kleinberg-s research. He introduced the structure of small-world in a grid and shows with a greedy algorithm using only local information able to find route between source and target in delivery time O(log2n). His fundamental model for distributed system uses a two-dimensional grid with longrange random links added between any two node u and v with a probability proportional to distance d(u,v)-2. We propose with an additional information of the long link nearby, we can find the shorter path. We apply the ant colony system as a messenger distributed their pheromone, the long-link details, in surrounding area. The subsequence forwarding decision has more option to move to, select among local neighbors or send to node has long link closer to its target. Our experiment results sustain our approach, the average routing time by Color Pheromone faster than greedy method.
Abstract: Routing in mobile ad hoc networks is a challenging task because nodes are free to move randomly. In DSR like all On- Demand routing algorithms, route discovery mechanism is associated with great delay. More Clearly in DSR routing protocol to send route reply packet, when current route breaks, destination seeks a new route. In this paper we try to change route selection mechanism proactively. We also define a link stability parameter in which a stability value is assigned to each link. Given this feature, destination node can estimate stability of routes and can select the best and more stable route. Therefore we can reduce the delay and jitter of sending data packets.