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: This paper addresses a current problem that occurs among Thai internet service providers with regard to bandwidth network quality management. The IPSTAR department of Telecom Organization of Thailand public company (TOT); the largest internet service provider in Thailand, is the case study to analyze the problem that exists. The Internet bandwidth network quality management (iBWQM) framework is mainly applied to the problem that has been found. Bandwidth management policy (BMP) and quality of service (QoS) are two antecedents of iBWQM. This paper investigates internet user behavior, marketing demand and network operation views in order to determine bandwidth management policy (e.g. quota management, scheduling and malicious management). The congestion of bandwidth is also analyzed to enhance quality of service (QoS). Moreover, the iBWQM framework is able to improve the quality of service and increase bandwidth utilization, minimize complaint rate concerns to slow speed, and provide network planning guidelines through Thai Internet services providers.
Abstract: The copper flotation tailings from Konkola Copper
mine in Nchanga, Zambia were used in the study. The purpose of this
study was to determine the leaching characteristics of the tailings
material prior and after the physical beneficiation process is
employed. The Knelson gravity concentrator (KC-MD3) was used for
the beneficiation process. The copper leaching efficiencies and
impurity co-extraction percentages in both the upgraded and the raw
feed material were determined at different pH levels and temperature.
It was observed that the copper extraction increased with an increase
in temperature and a decrease in pH levels. In comparison to the raw
feed sample, the upgraded sample reported a maximum copper
extraction of 69% which was 9%, higher than raw feed % extractions.
The impurity carry over was reduced from 18% to 4 % on the
upgraded sample. The reduction in impurity co-extraction was as a
result of the removal of the reactive gangue elements during the
upgrading process, this minimized the number of side reaction
occurring during leaching.
Abstract: The purpose of this study is to derive optimal shapes of
a body located in viscous flows by the finite element method using the
acoustic velocity and the four-step explicit scheme. The formulation
is based on an optimal control theory in which a performance function
of the fluid force is introduced. The performance function should be
minimized satisfying the state equation. This problem can be transformed
into the minimization problem without constraint conditions
by using the adjoint equation with adjoint variables corresponding to
the state equation. The performance function is defined by the drag
and lift forces acting on the body. The weighted gradient method
is applied as a minimization technique, the Galerkin finite element
method is used as a spatial discretization and the four-step explicit
scheme is used as a temporal discretization to solve the state equation
and the adjoint equation. As the interpolation, the orthogonal basis
bubble function for velocity and the linear function for pressure
are employed. In case that the orthogonal basis bubble function is
used, the mass matrix can be diagonalized without any artificial
centralization. The shape optimization is performed by the presented
method.
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: MANEMO is the integration of Network Mobility
(NEMO) and Mobile Ad Hoc Network (MANET). A MANEMO
node has an interface to both a MANET and NEMO network, and
therefore should choose the optimal interface for packet delivery,
however such a handover between interfaces will introduce packet
loss. We define the steps necessary for a MANEMO handover,
using Mobile IP and NEMO to signal the new binding to the
relevant Home Agent(s). The handover steps aim to minimize the
packet loss by avoiding waiting for Duplicate Address Detection
and Neighbour Unreachability Detection. We present expressions for
handover delay and packet loss, and then use numerical examples to
evaluate a MANEMO handover. The analysis shows how the packet
loss depends on level of nesting within NEMO, the delay between
Home Agents and the load on the MANET, and hence can be used
to developing optimal MANEMO handover algorithms.
Abstract: The important issue considered in the widespread deployment of Wireless Sensor Networks (WSNs) is an efficiency of the energy consumption. In this paper, we present a study of the optimal relay station planning problems using Binary Integer Linear Programming (BILP) model to minimize the energy consumption in WSNs. Our key contribution is that the proposed model not only ensures the required network lifetime but also guarantees the radio connectivity at high level of communication quality. Specially, we take into account effects of noise, signal quality limitation and bit error rate characteristics. Numerical experiments were conducted in various network scenarios. We analyzed the effects of different sensor node densities and distribution on the energy consumption.
Abstract: The State of Rio de Janeiro, Brazil, will hold two important events in the nearby future. In 2014 it will have the final game of the Football World Cup, and in 2016 it will be holding the Olympic Games. Therefore, the public transportation system (mainly buses) is of a major concern to the Rio de Janeiro State authorities-. The main objective of this work is to compare the quality of service of the bus companies operating in the cities of ItaperunaandCampos, both cities situated in the state of Rio de Janeiro, Brazil. The outcome of thiscomparison, based on the opinion of the bus users, has shownthemdispleased with the quality of the service provided by the bus companies operating in both cities. It is urgent the need to find possible practical alternatives to minimize the consequences of the main problems detected in this work. With these practical alternatives available, we will be able to offer to the Rio de Janeiro State authorities- suggestions about possible solutions to the main problems identified in this survey, as well as the time of implantation and costs of these solutions.
Abstract: The research is to minimize environmental damage
pertinent to maritime activities about the operation of lighter boat
anchorage and its tugboat. The guidance on upgrading current
harbor service and infrastructure has been provided to Kho Sichang
Municpality. This will involve a study of the maritime logistics of
the water area under jurisdiction of the Sichang island Municipality
and possible recommendations may involve charging taxes,
regulations and fees. With implementing these recommendations will
help in protection of the marine environment and in increasing
operator functionality. Additionally, our recommendation is to
generate a consistent revenue stream to the municipality. The action
items contained in this research are feasible and effective, the success
of these initiatives are heavily dependent upon successful promotion
and enforcement. Promoting new rules and regulations effectively
and peacefully can be done through theories and techniques used in
the psychology of persuasion. In order to assure compliance with the
regulations, the municipality must maintain stringent patrols and
fines for violators. In order to become success, the Municipality
must preserve a consistent, transparent and significant enforcement
system. Considering potential opportunities outside of the current
state of the municipality, the authors recommend that Koh Sichang be
given additional jurisdiction to capture value from the master vessels,
as well as to confront the more significant environmental challenges
these vessels pose. Finally, the authors recommend that the Port of
Koh Sichang Island obtain a free port status in order to increase
economic viability and overall sustainability.
Abstract: This paper analysis the integrated use of safety monitoring with the domestic and international latest research on rail safety protection system, and focus on the implementation of an organic whole system, with the monitoring and early warning, risk assessment, predictive control and emergency rescue system. The system framework, contents and system structure of Security system is proposed completely. It-s pointed out that the Security system is a negative feedback system composed of by safety monitoring and warning system, risk assessment and emergency rescue system. Safety monitoring and warning system focus on the monitoring target monitoring, early warning, tracking, integration of decision-making, for objective and subjective risks factors. Risk assessment system analysis the occurrence of a major Security risk mechanism, determines the standard of the future short, medium and long term safety conditions, and give prop for development of safety indicators, accident analysis and safety standards. Emergency rescue system is with the goal of rapid and effective rescue work for accident, to minimize casualties and property losses.
Abstract: Structural representation and technology mapping of
a Boolean function is an important problem in the design of nonregenerative
digital logic circuits (also called combinational logic
circuits). Library aware function manipulation offers a solution to
this problem. Compact multi-level representation of binary networks,
based on simple circuit structures, such as AND-Inverter Graphs
(AIG) [1] [5], NAND Graphs, OR-Inverter Graphs (OIG), AND-OR
Graphs (AOG), AND-OR-Inverter Graphs (AOIG), AND-XORInverter
Graphs, Reduced Boolean Circuits [8] does exist in
literature. In this work, we discuss a novel and efficient graph
realization for combinational logic circuits, represented using a
NAND-NOR-Inverter Graph (NNIG), which is composed of only
two-input NAND (NAND2), NOR (NOR2) and inverter (INV) cells.
The networks are constructed on the basis of irredundant disjunctive
and conjunctive normal forms, after factoring, comprising terms with
minimum support. Construction of a NNIG for a non-regenerative
function in normal form would be straightforward, whereas for the
complementary phase, it would be developed by considering a virtual
instance of the function. However, the choice of best NNIG for a
given function would be based upon literal count, cell count and
DAG node count of the implementation at the technology
independent stage. In case of a tie, the final decision would be made
after extracting the physical design parameters.
We have considered AIG representation for reduced disjunctive
normal form and the best of OIG/AOG/AOIG for the minimized
conjunctive normal forms. This is necessitated due to the nature of
certain functions, such as Achilles- heel functions. NNIGs are found
to exhibit 3.97% lesser node count compared to AIGs and
OIG/AOG/AOIGs; consume 23.74% and 10.79% lesser library cells
than AIGs and OIG/AOG/AOIGs for the various samples considered.
We compare the power efficiency and delay improvement achieved
by optimal NNIGs over minimal AIGs and OIG/AOG/AOIGs for
various case studies. In comparison with functionally equivalent,
irredundant and compact AIGs, NNIGs report mean savings in power
and delay of 43.71% and 25.85% respectively, after technology
mapping with a 0.35 micron TSMC CMOS process. For a
comparison with OIG/AOG/AOIGs, NNIGs demonstrate average
savings in power and delay by 47.51% and 24.83%. With respect to
device count needed for implementation with static CMOS logic
style, NNIGs utilize 37.85% and 33.95% lesser transistors than their
AIG and OIG/AOG/AOIG counterparts.
Abstract: Given a parallel program to be executed on a heterogeneous
computing system, the overall execution time of the program
is determined by a schedule. In this paper, we analyze the worst-case
performance of the list scheduling algorithm for scheduling tasks
of a parallel program in a mixed-machine heterogeneous computing
system such that the total execution time of the program is minimized.
We prove tight lower and upper bounds for the worst-case
performance ratio of the list scheduling algorithm. We also examine
the average-case performance of the list scheduling algorithm. Our
experimental data reveal that the average-case performance of the list
scheduling algorithm is much better than the worst-case performance
and is very close to optimal, except for large systems with large
heterogeneity. Thus, the list scheduling algorithm is very useful in
real applications.
Abstract: Shape optimization of the airfoil with high aspect ratio
of long endurance unmanned aerial vehicle (UAV) is performed by the
multi-objective optimization technology coupled with computational
fluid dynamics (CFD). For predicting the aerodynamic characteristics
around the airfoil the high-fidelity Navier-Stokes solver is employed
and SMOGA (Simple Multi-Objective Genetic Algorithm), which is
developed by authors, is used for solving the multi-objective
optimization problem. To obtain the optimal solutions of the design
variable (i.e., sectional airfoil profile, wing taper ratio and sweep) for
high performance of UAVs, both the lift and lift-to-drag ratio are
maximized whereas the pitching moment should be minimized,
simultaneously. It is found that the lift force and lift-to-drag ratio are
linearly dependent and a unique and dominant solution are existed.
However, a trade-off phenomenon is observed between the lift-to-drag
ratio and pitching moment. As the result of optimization, sixty-five
(65) non-dominated Pareto individuals at the cutting edge of design
spaces that is decided by airfoil shapes can be obtained.
Abstract: This paper is focused on issues of nonlinear dynamic process modeling and model-based predictive control of a fed-batch sugar crystallization process applying the concept of artificial neural networks as computational tools. The control objective is to force the operation into following optimal supersaturation trajectory. It is achieved by manipulating the feed flow rate of sugar liquor/syrup, considered as the control input. A feed forward neural network (FFNN) model of the process is first built as part of the controller structure to predict the process response over a specified (prediction) horizon. The predictions are supplied to an optimization procedure to determine the values of the control action over a specified (control) horizon that minimizes a predefined performance index. The control task is rather challenging due to the strong nonlinearity of the process dynamics and variations in the crystallization kinetics. However, the simulation results demonstrated smooth behavior of the control actions and satisfactory reference tracking.
Abstract: An important task in solving second order linear ordinary differential equations by the finite difference is to choose a suitable stepsize h. In this paper, by using the stochastic arithmetic, the CESTAC method and the CADNA library we present a procedure to estimate the optimal stepsize hopt, the stepsize which minimizes the global error consisting of truncation and round-off error.
Abstract: In this paper, multi-processors job shop scheduling problems are solved by a heuristic algorithm based on the hybrid of priority dispatching rules according to an ant colony optimization algorithm. The objective function is to minimize the makespan, i.e. total completion time, in which a simultanous presence of various kinds of ferons is allowed. By using the suitable hybrid of priority dispatching rules, the process of finding the best solution will be improved. Ant colony optimization algorithm, not only promote the ability of this proposed algorithm, but also decreases the total working time because of decreasing in setup times and modifying the working production line. Thus, the similar work has the same production lines. Other advantage of this algorithm is that the similar machines (not the same) can be considered. So, these machines are able to process a job with different processing and setup times. According to this capability and from this algorithm evaluation point of view, a number of test problems are solved and the associated results are analyzed. The results show a significant decrease in throughput time. It also shows that, this algorithm is able to recognize the bottleneck machine and to schedule jobs in an efficient way.
Abstract: Economic Load Dispatch (ELD) is a method of determining
the most efficient, low-cost and reliable operation of a power
system by dispatching available electricity generation resources to
supply load on the system. The primary objective of economic
dispatch is to minimize total cost of generation while honoring
operational constraints of available generation resources. In this paper
an intelligent water drop (IWD) algorithm has been proposed to
solve ELD problem with an objective of minimizing the total cost of
generation. Intelligent water drop algorithm is a swarm-based natureinspired
optimization algorithm, which has been inspired from natural
rivers. A natural river often finds good paths among lots of possible
paths in its ways from source to destination and finally find almost
optimal path to their destination. These ideas are embedded into
the proposed algorithm for solving economic load dispatch problem.
The main advantage of the proposed technique is easy is implement
and capable of finding feasible near global optimal solution with
less computational effort. In order to illustrate the effectiveness of
the proposed method, it has been tested on 6-unit and 20-unit test
systems with incremental fuel cost functions taking into account the
valve point-point loading effects. Numerical results shows that the
proposed method has good convergence property and better in quality
of solution than other algorithms reported in recent literature.
Abstract: Graph partitioning is a NP-hard problem with multiple
conflicting objectives. The graph partitioning should minimize the
inter-partition relationship while maximizing the intra-partition
relationship. Furthermore, the partition load should be evenly
distributed over the respective partitions. Therefore this is a multiobjective
optimization problem (MOO). One of the approaches to
MOO is Pareto optimization which has been used in this paper. The
proposed methods of this paper used to improve the performance are
injecting best solutions of previous runs into the first generation of
next runs and also storing the non-dominated set of previous
generations to combine with later generation's non-dominated set.
These improvements prevent the GA from getting stuck in the local
optima and increase the probability of finding more optimal
solutions. Finally, a simulation research is carried out to investigate
the effectiveness of the proposed algorithm. The simulation results
confirm the effectiveness of the proposed method.
Abstract: The impact force of a rockfall is mainly determined by
its moving behavior and velocity, which are contingent on the rock
shape, slope gradient, height, and surface roughness of the moving
path. It is essential to precisely calculate the moving path of the
rockfall in order to effectively minimize and prevent damages caused
by the rockfall. By applying the Colorado Rockfall Simulation
Program (CRSP) program as the analysis tool, this research studies the
influence of three shapes of rock (spherical, cylindrical and discoidal)
and surface roughness on the moving path of a single rockfall. As
revealed in the analysis, in addition to the slope gradient, the geometry
of the falling rock and joint roughness coefficient ( JRC ) of the slope
are the main factors affecting the moving behavior of a rockfall. On a
single flat slope, both the rock-s bounce height and moving velocity
increase as the surface gradient increases, with a critical gradient value
of 1:m = 1 . Bouncing behavior and faster moving velocity occur more
easily when the rock geometry is more oval. A flat piece tends to cause
sliding behavior and is easily influenced by the change of surface
undulation. When JRC
Abstract: An inverse geometry problem is solved to predict an
unknown irregular boundary profile. The aim is to minimize the
objective function, which is the difference between real and
computed temperatures, using three different versions of Conjugate
Gradient Method. The gradient of the objective function, considered
necessary in this method, obtained as a result of solving the adjoint
equation. The abilities of three versions of Conjugate Gradient
Method in predicting the boundary profile are compared using a
numerical algorithm based on the method. The predicted shapes show
that due to its convergence rate and accuracy of predicted values, the
Powell-Beale version of the method is more effective than the
Fletcher-Reeves and Polak –Ribiere versions.