Abstract: The problem of mapping tasks onto a computational grid with the aim to minimize the power consumption and the makespan subject to the constraints of deadlines and architectural requirements is considered in this paper. To solve this problem, we propose a solution from cooperative game theory based on the concept of Nash Bargaining Solution. The proposed game theoretical technique is compared against several traditional techniques. The experimental results show that when the deadline constraints are tight, the proposed technique achieves superior performance and reports competitive performance relative to the optimal solution.
Abstract: In this paper, all variables are supposed to be integer
and positive. In this modern method, objective function is assumed to
be maximized or minimized but constraints are always explained like
less or equal to. In this method, choosing a dual combination of ideal
nonequivalent and omitting one of variables. With continuing this
act, finally, having one nonequivalent with (n-m+1) unknown
quantities in which final nonequivalent, m is counter for constraints,
n is counter for variables of decision.
Abstract: Aiming at the problems existing in low-carbon technology of Chinese manufacturing industries, such as irrational energy structure, lack of technological innovation, financial constraints, this paper puts forward the suggestion that the leading role of the government is combined with the roles of enterprises and market. That is, through increasing the governmental funding the adjustment of the industrial structures and enhancement of the legal supervision are supported. Technological innovation is accelerated by the enterprises, and the carbon trading will be promoted so as to trigger the low-carbon revolution in Chinese manufacturing field.
Abstract: This paper presents a constrained valley detection
algorithm. The intent is to find valleys in the map for the path planning
that enables a robot or a vehicle to move safely. The constraint to the
valley is a desired width and a desired depth to ensure the space for
movement when a vehicle passes through the valley. We propose an
algorithm to find valleys satisfying these 2 dimensional constraints.
The merit of our algorithm is that the pre-processing and the
post-processing are not necessary to eliminate undesired small valleys.
The algorithm is validated through simulation using digitized
elevation data.
Abstract: This paper proposes a scheduling scheme using feedback
control to reduce the response time of aperiodic tasks with soft
real-time constraints. We design an algorithm based on the proposed
scheduling scheme and Total Bandwidth Server (TBS) that is a
conventional server technique for scheduling aperiodic tasks. We then
describe the feedback controller of the algorithm and give the control
parameter tuning methods. The simulation study demonstrates that the
algorithm can reduce the mean response time up to 26% compared
to TBS in exchange for slight deadline misses.
Abstract: We consider a two-way relay network where two sources exchange information. A relay helps the two sources exchange information using the decode-and-XOR-forward protocol. We investigate the power minimization problem with minimum rate constraints. The system needs two time slots and in each time slot the required rate pair should be achievable. The power consumption is minimized in each time slot and we obtained the closed form solution. The simulation results confirm that the proposed power allocation scheme consumes lower total power than the conventional schemes.
Abstract: In this paper motion analysis on a winding
stair-climbing is investigated using our proposed rotational arm type
of robotic wheelchair. For now, the robotic wheelchair is operated in
an open mode to climb winding stairs by a dynamic turning, therefore,
the dynamics model is required to ensure a passenger-s safety.
Equations of motion based on the skid-steering analysis are developed
for the trajectory planning and motion analysis on climbing winding
stairs. Since the robotic wheelchair must climb a winding staircase
stably, the winding trajectory becomes a constraint equation to be
followed, and the Baumgarte-s method is used to solve for the
constrained dynamics equations. Experimental results validate the
behavior of the prototype as it climbs a winding stair.
Abstract: Model Predictive Control (MPC) is an established control
technique in a wide range of process industries. The reason for
this success is its ability to handle multivariable systems and systems
having input, output or state constraints. Neverthless comparing to
PID controller, the implementation of the MPC in miniaturized
devices like Field Programmable Gate Arrays (FPGA) and microcontrollers
has historically been very small scale due to its complexity in
implementation and its computation time requirement. At the same
time, such embedded technologies have become an enabler for future
manufacturing enterprisers as well as a transformer of organizations
and markets. In this work, we take advantage of these recent advances
in this area in the deployment of one of the most studied and applied
control technique in the industrial engineering. In this paper, we
propose an efficient firmware for the implementation of constrained
MPC in the performed STM32 microcontroller using interior point
method. Indeed, performances study shows good execution speed
and low computational burden. These results encourage to develop
predictive control algorithms to be programmed in industrial standard
processes. The PID anti windup controller was also implemented in
the STM32 in order to make a performance comparison with the
MPC. The main features of the proposed constrained MPC framework
are illustrated through two examples.
Abstract: Embedded systems need to respect stringent real
time constraints. Various hardware components included in such
systems such as cache memories exhibit variability and therefore
affect execution time. Indeed, a cache memory access from an
embedded microprocessor might result in a cache hit where the
data is available or a cache miss and the data need to be fetched
with an additional delay from an external memory. It is therefore
highly desirable to predict future memory accesses during
execution in order to appropriately prefetch data without incurring
delays. In this paper, we evaluate the potential of several artificial
neural networks for the prediction of instruction memory
addresses. Neural network have the potential to tackle the nonlinear
behavior observed in memory accesses during program
execution and their demonstrated numerous hardware
implementation emphasize this choice over traditional forecasting
techniques for their inclusion in embedded systems. However,
embedded applications execute millions of instructions and
therefore millions of addresses to be predicted. This very
challenging problem of neural network based prediction of large
time series is approached in this paper by evaluating various neural
network architectures based on the recurrent neural network
paradigm with pre-processing based on the Self Organizing Map
(SOM) classification technique.
Abstract: An Optimal Power Flow based on Improved Particle
Swarm Optimization (OPF-IPSO) with Generator Capability Curve
Constraint is used by NN-OPF as a reference to get pattern of
generator scheduling. There are three stages in Designing NN-OPF.
The first stage is design of OPF-IPSO with generator capability curve
constraint. The second stage is clustering load to specific range and
calculating its index. The third stage is training NN-OPF using
constructive back propagation method. In training process total load
and load index used as input, and pattern of generator scheduling
used as output. Data used in this paper is power system of Java-Bali.
Software used in this simulation is MATLAB.
Abstract: Skin color based tracking techniques often assume a
static skin color model obtained either from an offline set of library
images or the first few frames of a video stream. These models
can show a weak performance in presence of changing lighting or
imaging conditions. We propose an adaptive skin color model based
on the Gaussian mixture model to handle the changing conditions.
Initial estimation of the number and weights of skin color clusters
are obtained using a modified form of the general Expectation
maximization algorithm, The model adapts to changes in imaging
conditions and refines the model parameters dynamically using spatial
and temporal constraints. Experimental results show that the method
can be used in effectively tracking of hand and face regions.
Abstract: The deviation between the target state variable and the
practical state variable should be used to form the state tending factor
of complex systems, which can reflect the process for the complex
system to tend rationalization. Relating to the system of basic
equations of complete factor synergetics consisting of twenty
nonlinear stochastic differential equations, the two new models are
considered to set, which should be called respectively the
rationalizing tendency model and the non- rationalizing tendency
model. Therefore we can extend the theory of programming with the
objective function & constraint condition suitable only for the realm
of man-s activities into the new analysis with the tendency function &
constraint condition suitable for all the field of complex system.
Abstract: Unified Modeling Language (UML) extensions for real time embedded systems (RTES) co-design, are taking a growing interest by a great number of industrial and research communities. The extension mechanism is provided by UML profiles for RTES. It aims at improving an easily-understood method of system design for non-experts. On the other hand, one of the key items of the co- design methods is the Hardware/Software partitioning and scheduling tasks. Indeed, it is mandatory to define where and when tasks are implemented and run. Unfortunately the main goals of co-design are not included in the usual practice of UML profiles. So, there exists a need for mapping used models to an execution platform for both schedulability test and HW/SW partitioning. In the present work, test schedulability and design space exploration are performed at an early stage. The proposed approach adopts Model Driven Engineering MDE. It starts from UML specification annotated with the recent profile for the Modeling and Analysis of Real Time Embedded systems MARTE. Following refinement strategy, transformation rules allow to find a feasible schedule that satisfies timing constraints and to define where tasks will be implemented. The overall approach is experimented for the design of a football player robot application.
Abstract: In this paper, we first give the representation of the general solution of the following least-squares problem (LSP): Given matrices X ∈ Rn×p, B ∈ Rp×p and A0 ∈ Rr×r, find a matrix A ∈ Rn×n such that XT AX − B = min, s. t. A([1, r]) = A0, where A([1, r]) is the r×r leading principal submatrix of the matrix A. We then consider a best approximation problem: given an n × n matrix A˜ with A˜([1, r]) = A0, find Aˆ ∈ SE such that A˜ − Aˆ = minA∈SE A˜ − A, where SE is the solution set of LSP. We show that the best approximation solution Aˆ is unique and derive an explicit formula for it. Keyw
Abstract: An enhanced particle swarm optimization algorithm
(PSO) is presented in this work to solve the non-convex OPF
problem that has both discrete and continuous optimization variables.
The objective functions considered are the conventional quadratic
function and the augmented quadratic function. The latter model
presents non-differentiable and non-convex regions that challenge
most gradient-based optimization algorithms. The optimization
variables to be optimized are the generator real power outputs and
voltage magnitudes, discrete transformer tap settings, and discrete
reactive power injections due to capacitor banks. The set of equality
constraints taken into account are the power flow equations while the
inequality ones are the limits of the real and reactive power of the
generators, voltage magnitude at each bus, transformer tap settings,
and capacitor banks reactive power injections. The proposed
algorithm combines PSO with Newton-Raphson algorithm to
minimize the fuel cost function. The IEEE 30-bus system with six
generating units is used to test the proposed algorithm. Several cases
were investigated to test and validate the consistency of detecting
optimal or near optimal solution for each objective. Results are
compared to solutions obtained using sequential quadratic
programming and Genetic Algorithms.
Abstract: Since the actuator capacity is limited, in the real
application of active control systems under sever earthquakes it is
conceivable that the actuators saturate, hence the actuator saturation
should be considered as a constraint in design of optimal controllers.
In this paper optimal design of active controllers for nonlinear
structures by considering actuator saturation, has been studied. The
proposed method for designing optimal controllers is based on
defining an optimization problem which the objective has been to
minimize the maximum displacement of structure when a limited
capacity for actuator has been used. To this end a single degree of
freedom (SDF) structure with a bilinear hysteretic behavior has been
simulated under a white noise ground acceleration of different
amplitudes. Active tendon control mechanism, comprised of prestressed
tendons and an actuator, and extended nonlinear Newmark
method based instantaneous optimal control algorithm have been
used. To achieve the best results, the weights corresponding to
displacement, velocity, acceleration and control force in the
performance index have been optimized by the Distributed Genetic
Algorithm (DGA). Results show the effectiveness of the proposed
method in considering actuator saturation. Also based on the
numerical simulations it can be concluded that the actuator capacity
and the average value of required control force are two important
factors in designing nonlinear controllers which consider the actuator
saturation.
Abstract: The main goal of the present work is to decrease the
computational burden for optimum design of steel frames with
frequency constraints using a new type of neural networks called
Wavelet Neural Network. It is contested to train a suitable neural
network for frequency approximation work as the analysis program.
The combination of wavelet theory and Neural Networks (NN)
has lead to the development of wavelet neural networks.
Wavelet neural networks are feed-forward networks using
wavelet as activation function. Wavelets are mathematical
functions within suitable inner parameters, which help them to
approximate arbitrary functions. WNN was used to predict the
frequency of the structures. In WNN a RAtional function with
Second order Poles (RASP) wavelet was used as a transfer
function. It is shown that the convergence speed was faster
than other neural networks. Also comparisons of WNN with
the embedded Artificial Neural Network (ANN) and with
approximate techniques and also with analytical solutions are
available in the literature.
Abstract: The study of human hand morphology reveals that developing an artificial hand with the capabilities of human hand is an extremely challenging task. This paper presents the development of a robotic prosthetic hand focusing on the improvement of a tendon driven mechanism towards a biomimetic prosthetic hand. The design of this prosthesis hand is geared towards achieving high level of dexterity and anthropomorphism by means of a new hybrid mechanism that integrates a miniature motor driven actuation mechanism, a Shape Memory Alloy actuated mechanism and a passive mechanical linkage. The synergy of these actuators enables the flexion-extension movement at each of the finger joints within a limited size, shape and weight constraints. Tactile sensors are integrated on the finger tips and the finger phalanges area. This prosthesis hand is developed with an exact size ratio that mimics a biological hand. Its behavior resembles the human counterpart in terms of working envelope, speed and torque, and thus resembles both the key physical features and the grasping functionality of an adult hand.
Abstract: Optimization of filter banks based on the knowledge of input statistics has been of interest for a long time. Finite impulse response (FIR) Compaction filters are used in the design of optimal signal adapted orthonormal FIR filter banks. In this paper we discuss three different approaches for the design of interpolated finite impulse response (IFIR) compaction filters. In the first method, the magnitude squared response satisfies Nyquist constraint approximately. In the second and third methods Nyquist constraint is exactly satisfied. These methods yield FIR compaction filters whose response is comparable with that of the existing methods. At the same time, IFIR filters enjoy significant saving in the number of multipliers and can be implemented efficiently. Since eigenfilter approach is used here, the method is less complex. Design of IFIR filters in the least square sense is presented.
Abstract: Seaweed farming is emerging as a viable alternative
activity in the Indonesian fisheries sector. This paper aims to
investigate people-s perceptions of seaweed farming, to analyze its
social and economic impacts and to identify the problems and
obstacles hindering its continued development. Structured and
semi-structured questionnaires were prepared to obtain qualitative
data, and interviews were conducted with fishermen who also plant
seaweed. The findings showed that fishermen in the Laikang Bay were
enthusiastic about cultivating seaweeds and that seaweed plays a major
role in supporting the household economy of fishermen. However,
current seaweed drying technologies cannot support increased
seaweed production on a farm or plot, especially in the rainy season.
Additionally, variable monsoon seasons and long marketing channels
are still major constraints on the development of the industry. Finally,
capture fisheries, the primary economic livelihood of fishermen of
older generations, is being slowly replaced by seaweed farming.