Abstract: This paper has introduced a slope photogrammetric mapping using unmanned aerial vehicle. There are two units of UAV has been used in this study; namely; fixed wing and multi-rotor. Both UAVs were used to capture images at the study area. A consumer digital camera was mounted vertically at the bottom of UAV and captured the images at an altitude. The objectives of this study are to obtain three dimensional coordinates of slope area and to determine the accuracy of photogrammetric product produced from both UAVs. Several control points and checkpoints were established Real Time Kinematic Global Positioning System (RTK-GPS) in the study area. All acquired images from both UAVs went through all photogrammetric processes such as interior orientation, exterior orientation, aerial triangulation and bundle adjustment using photogrammetric software. Two primary results were produced in this study; namely; digital elevation model and digital orthophoto. Based on results, UAV system can be used to mapping slope area especially for limited budget and time constraints project.
Abstract: In this paper, a Dynamic Economic Dispatch (DED) model is developed for the system consisting of both thermal generators and wind turbines. The inclusion of a significant amount of wind energy into power systems has resulted in additional constraints on DED to accommodate the intermittent nature of the output. The probability of stochastic wind power based on the Weibull probability density function is included in the model as a constraint; A Here-and-Now Approach. The Environmental Protection Agency-s hourly emission target, which gives the maximum emission during the day, is used as a constraint to reduce the atmospheric pollution. A 69-bus test system with non-smooth cost function is used to illustrate the effectiveness of the proposed model compared with static economic dispatch model with including the wind power.
Abstract: This paper describes WiPoD (Wireless Position
Detector) which is a pure software based location determination and
tracking (positioning) system. It uses empirical signal strength measurements from different wireless access points for mobile user
positioning. It is designed to determine the location of users having
802.11 enabled mobile devices in an 802.11 WLAN infrastructure
and track them in real time. WiPoD is the first main module in our
LBS (Location Based Services) framework. We tested K-Nearest
Neighbor and Triangulation algorithms to estimate the position of a
mobile user. We also give the analysis results of these algorithms for
real time operations. In this paper, we propose a supportable, i.e.
understandable, maintainable, scalable and portable wireless
positioning system architecture for an LBS framework. The WiPoD
software has a multithreaded structure and was designed and implemented with paying attention to supportability features and real-time constraints and using object oriented design principles. We also describe the real-time software design issues of a wireless positioning system which will be part of an LBS framework.
Abstract: This paper presents a new and efficient approach for capacitor placement in radial distribution systems that determine the optimal locations and size of capacitor with an objective of improving the voltage profile and reduction of power loss. The solution methodology has two parts: in part one the loss sensitivity factors are used to select the candidate locations for the capacitor placement and in part two a new algorithm that employs Plant growth Simulation Algorithm (PGSA) is used to estimate the optimal size of capacitors at the optimal buses determined in part one. The main advantage of the proposed method is that it does not require any external control parameters. The other advantage is that it handles the objective function and the constraints separately, avoiding the trouble to determine the barrier factors. The proposed method is applied to 9, 34, and 85-bus radial distribution systems. The solutions obtained by the proposed method are compared with other methods. The proposed method has outperformed the other methods in terms of the quality of solution.
Abstract: In many applications, it is a priori known that the
target function should satisfy certain constraints imposed by, for
example, economic theory or a human-decision maker. Here we
consider partially monotone problems, where the target variable
depends monotonically on some of the predictor variables but not all.
We propose an approach to build partially monotone models based
on the convolution of monotone neural networks and kernel
functions. The results from simulations and a real case study on
house pricing show that our approach has significantly better
performance than partially monotone linear models. Furthermore, the
incorporation of partial monotonicity constraints not only leads to
models that are in accordance with the decision maker's expertise,
but also reduces considerably the model variance in comparison to
standard neural networks with weight decay.
Abstract: This paper presents a Reliability-Based Topology
Optimization (RBTO) based on Evolutionary Structural Optimization
(ESO). An actual design involves uncertain conditions such as
material property, operational load and dimensional variation.
Deterministic Topology Optimization (DTO) is obtained without
considering of the uncertainties related to the uncertainty parameters.
However, RBTO involves evaluation of probabilistic constraints,
which can be done in two different ways, the reliability index
approach (RIA) and the performance measure approach (PMA). Limit
state function is approximated using Monte Carlo Simulation and
Central Composite Design for reliability analysis. ESO, one of the
topology optimization techniques, is adopted for topology
optimization. Numerical examples are presented to compare the DTO
with RBTO.
Abstract: In this paper, a simulated annealing algorithm has been developed to optimize machining parameters in turning operation on cylindrical workpieces. The turning operation usually includes several passes of rough machining and a final pass of finishing. Seven different constraints are considered in a non-linear model where the goal is to achieve minimum total cost. The weighted total cost consists of machining cost, tool cost and tool replacement cost. The computational results clearly show that the proposed optimization procedure has considerably improved total operation cost by optimally determining machining parameters.
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: In this paper; we are interested principally in dynamic modelling of quadrotor while taking into account the high-order nonholonomic constraints in order to develop a new control scheme as well as the various physical phenomena, which can influence the dynamics of a flying structure. These permit us to introduce a new state-space representation. After, the use of Backstepping approach for the synthesis of tracking errors and Lyapunov functions, a sliding mode controller is developed in order to ensure Lyapunov stability, the handling of all system nonlinearities and desired tracking trajectories. Finally simulation results are also provided in order to illustrate the performances of the proposed controller.
Abstract: An important step in three-dimensional reconstruction
and computer vision is camera calibration, whose objective is to
estimate the intrinsic and extrinsic parameters of each camera. In this
paper, two linear methods based on the different planes are given. In
both methods, the general plane is used to replace the calibration
object with very good precision. In the first method, after controlling
the camera to undergo five times- translation movements and taking
pictures of the orthogonal planes, a set of linear constraints of the
camera intrinsic parameters is then derived by means of homography
matrix. The second method is to get all camera parameters by taking
only one picture of a given radius circle. experiments on simulated
data and real images,indicate that our method is reasonable and is a
good supplement to camera calibration.
Abstract: A Matlab based software for logistic regression is developed to enhance the process of teaching quantitative topics and assist researchers with analyzing wide area of applications where categorical data is involved. The software offers an option of performing stepwise logistic regression to select the most significant predictors. The software includes a feature to detect influential observations in data, and investigates the effect of dropping or misclassifying an observation on a predictor variable. The input data may consist either as a set of individual responses (yes/no) with the predictor variables or as grouped records summarizing various categories for each unique set of predictor variables' values. Graphical displays are used to output various statistical results and to assess the goodness of fit of the logistic regression model. The software recognizes possible convergence constraints when present in data, and the user is notified accordingly.
Abstract: This paper addresses the problem of forbidden states in
non safe Petri Nets. In the system, for preventing it from entering the
forbidden states, some linear constraints can be assigned to them.
Then these constraints can be enforced on the system using control
places. But when the number of constraints in the system is large, a
large number of control places must be added to the model of system.
This concept complicates the model of system. There are some
methods for reducing the number of constraints in safe Petri Nets.
But there is no a systematic method for non safe Petri Nets. In this
paper we propose a method for reducing the number of constraints in
non safe Petri Nets which is based on solving an integer linear
programming problem.
Abstract: The most common type of controller being used in
the industry is PI(D) controller which has been used since 1945 and
is still being widely used due to its efficiency and simplicity. In
most cases, the PI(D) controller was tuned without taking into
consideration of the effect of actuator saturation. In real processes,
the most common actuator which is valve will act as constraint and
restrict the controller output. Since the controller is not designed to
encounter saturation, the process may windup and consequently
resulted in large oscillation or may become unstable. Usually, an
antiwindup compensator is added to the feedback control loop to
reduce the deterioration effect of integral windup. This research
aims to specifically control processes with constraints. The
proposed method was applied to two different types of food
processes, which are blending and spray drying. Simulations were
done using MATLAB and the performances of the proposed
method were compared with other conventional methods. The
proposed technique was able to control the processes and avoid
saturation such that no anti windup compensator is needed.
Abstract: Restructured electricity markets may provide
opportunities for producers to exercise market power maintaining
prices in excess of competitive levels. In this paper an oligopolistic
market is presented that all Generation Companies (GenCos) bid in a
Cournot model. Genetic algorithm (GA) is applied to obtain
generation scheduling of each GenCo as well as hourly market
clearing prices (MCP). In order to consider network constraints a
multiperiod framework is presented to simulate market clearing
mechanism in which the behaviors of market participants are
modelled through piecewise block curves. A mixed integer linear
programming (MILP) is employed to solve the problem. Impacts of
market clearing process on participants- characteristic and final
market prices are presented. Consequently, a novel multi-objective
model is addressed for security constrained optimal bidding strategy
of GenCos. The capability of price-maker GenCos to alter MCP is
evaluated through introducing an effective-supply curve. In addition,
the impact of exercising market power on the variation of market
characteristics as well as GenCos scheduling is studied.
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: This paper studies the effect of different compression
constraints and schemes presented in a new and flexible paradigm to
achieve high compression ratios and acceptable signal to noise ratios
of Arabic speech signals. Compression parameters are computed for
variable frame sizes of a level 5 to 7 Discrete Wavelet Transform
(DWT) representation of the signals for different analyzing mother
wavelet functions. Results are obtained and compared for Global
threshold and level dependent threshold techniques. The results
obtained also include comparisons with Signal to Noise Ratios, Peak
Signal to Noise Ratios and Normalized Root Mean Square Error.
Abstract: Master plan is a tool to guide and manage the growth of cities in a planned manner. The soul of a master plan lies in its implementation framework. If not implemented, people are trapped in a mess of urban problems and laissez-faire development having serious long term repercussions. Unfortunately, Master Plans prepared for several major cities of Pakistan could not be fully implemented due to host of reasons and Lahore is no exception. Being the second largest city of Pakistan with a population of over 7 million people, Lahore holds the distinction that the first ever Master Plan in the country was prepared for this city in 1966. Recently in 2004, a new plan titled `Integrated Master Plan for Lahore-2021- has been approved for implementation. This paper provides a comprehensive account of the weaknesses and constraints in the plan preparation process and implementation strategies of Master Plans prepared for Lahore. It also critically reviews the new Master Plan particularly with respect to the proposed implementation framework. The paper discusses the prospects and pre-conditions for successful implementation of the new Plan in the light of historic analysis, interviews with stakeholders and the new institutional context under the devolution plan.
Abstract: Graph rewriting-based visual model processing is a
widely used technique for model transformation. Visual model
transformations often need to follow an algorithm that requires a
strict control over the execution sequence of the transformation steps.
Therefore, in Visual Model Processors (VMPs) the execution order
of the transformation steps is crucial. This paper presents the visual
control flow support of Visual Modeling and Transformation System
(VMTS), which facilitates composing complex model
transformations of simple transformation steps and executing them.
The VMTS Visual Control Flow Language (VCFL) uses stereotyped
activity diagrams to specify control flow structures and OCL
constraints to choose between different control flow branches. This
paper introduces VCFL, discusses its termination properties and
provides an algorithm to support the termination analysis of VCFL
transformations.
Abstract: Generalized Center String (GCS) problem are
generalized from Common Approximate Substring problem
and Common substring problems. GCS are known to be
NP-hard allowing the problems lies in the explosion of
potential candidates. Finding longest center string without
concerning the sequence that may not contain any motifs is
not known in advance in any particular biological gene
process. GCS solved by frequent pattern-mining techniques
and known to be fixed parameter tractable based on the
fixed input sequence length and symbol set size. Efficient
method known as Bpriori algorithms can solve GCS with
reasonable time/space complexities. Bpriori 2 and Bpriori
3-2 algorithm are been proposed of any length and any
positions of all their instances in input sequences. In this
paper, we reduced the time/space complexity of Bpriori
algorithm by Constrained Based Frequent Pattern mining
(CBFP) technique which integrates the idea of Constraint
Based Mining and FP-tree mining. CBFP mining technique
solves the GCS problem works for all center string of any
length, but also for the positions of all their mutated copies
of input sequence. CBFP mining technique construct TRIE
like with FP tree to represent the mutated copies of center
string of any length, along with constraints to restraint
growth of the consensus tree. The complexity analysis for
Constrained Based FP mining technique and Bpriori
algorithm is done based on the worst case and average case
approach. Algorithm's correctness compared with the
Bpriori algorithm using artificial data is shown.
Abstract: This paper presents an efficient algorithm for
optimization of radial distribution systems by a network
reconfiguration to balance feeder loads and eliminate overload
conditions. The system load-balancing index is used to determine the
loading conditions of the system and maximum system loading
capacity. The index value has to be minimum in the optimal network
reconfiguration of load balancing. A method based on Tabu search
algorithm, The Tabu search algorithm is employed to search for the
optimal network reconfiguration. The basic idea behind the search is
a move from a current solution to its neighborhood by effectively
utilizing a memory to provide an efficient search for optimality. It
presents low computational effort and is able to find good quality
configurations. Simulation results for a radial 69-bus system with
distributed generations and capacitors placement. The study results
show that the optimal on/off patterns of the switches can be identified
to give the best network reconfiguration involving balancing of
feeder loads while respecting all the constraints.