Abstract: This article proposes a novel Pareto-based multiobjective
meta-heuristic algorithm named non-dominated ranking
genetic algorithm (NRGA) to solve multi-facility location-allocation
problem. In NRGA, a fitness value representing rank is assigned to
each individual of the population. Moreover, two features ranked
based roulette wheel selection including select the fronts and choose
solutions from the fronts, are utilized. The proposed solving
methodology is validated using several examples taken from the
specialized literature. The performance of our approach shows that
NRGA algorithm is able to generate true and well distributed Pareto
optimal solutions.
Abstract: Distributed Computing Systems are usually considered the most suitable model for practical solutions of many parallel algorithms. In this paper an enhanced distributed system is presented to improve the time complexity of Binary Indexed Trees (BIT). The proposed system uses multi-uniform processors with identical architectures and a specially designed distributed memory system. The analysis of this system has shown that it has reduced the time complexity of the read query to O(Log(Log(N))), and the update query to constant complexity, while the naive solution has a time complexity of O(Log(N)) for both queries. The system was implemented and simulated using VHDL and Verilog Hardware Description Languages, with xilinx ISE 10.1, as the development environment and ModelSim 6.1c, similarly as the simulation tool. The simulation has shown that the overhead resulting by the wiring and communication between the system fragments could be fairly neglected, which makes it applicable to practically reach the maximum speed up offered by the proposed model.
Abstract: Residual dye contents in textile dyeing wastewater have complex aromatic structures that are resistant to degrade in biological wastewater treatment. The objectives of this study were to determine the effectiveness of nanoscale zerovalent iron (NZVI) to decolorize Reactive Black 5 (RB5) and Reactive Red 198 (RR198) in synthesized wastewater and to investigate the effects of the iron particle size, iron dosage and solution pHs on the destruction of RB5 and RR198. Synthesized NZVI was confirmed by transmission electron microscopy (TEM), X-ray diffraction (XRD), and X-ray photoelectron spectroscopy (XPS). The removal kinetic rates (kobs) of RB5 (0.0109 min-1) and RR198 (0.0111 min-1) by 0.5% NZVI were many times higher than those of microscale zerovalent iron (ZVI) (0.0007 min-1 and 0.0008 min-1, respectively). The iron dosage increment exponentially increased the removal efficiencies of both RB5 and RR198. Additionally, lowering pH from 9 to 5 increased the decolorization kinetic rates of both RB5 and RR198 by NZVI. The destruction of azo bond (N=N) in the chromophore of both reactive dyes led to decolorization of dye solutions.
Abstract: Character segmentation is an important preprocessing
step for text recognition. In degraded documents, existence of
touching characters decreases recognition rate drastically, for any
optical character recognition (OCR) system. In this paper we have
proposed a complete solution for segmenting touching characters in
all the three zones of printed Gurmukhi script. A study of touching
Gurmukhi characters is carried out and these characters have been
divided into various categories after a careful analysis. Structural
properties of the Gurmukhi characters are used for defining the
categories. New algorithms have been proposed to segment the
touching characters in middle zone, upper zone and lower zone.
These algorithms have shown a reasonable improvement in
segmenting the touching characters in degraded printed Gurmukhi
script. The algorithms proposed in this paper are applicable only to
machine printed text. We have also discussed a new and useful
technique to segment the horizontally overlapping lines.
Abstract: This paper is concerned with an epidemic model with delay. By using the comparison theorem of the differential equation and constructing a suitable Lyapunov functional, Some sufficient conditions which guarantee the permeance and existence of a unique globally attractive positive almost periodic solution of the model are obtain. Finally, an example is employed to illustrate our result.
Abstract: On a such wide-area environment as a Grid, data
placement is an important aspect of distributed database systems. In
this paper, we address the problem of initial placement of database
no-replicated fragments in Grid architecture. We propose a graph
based approach that considers resource restrictions. The goal is to
optimize the use of computing, storage and communication
resources. The proposed approach is developed in two phases: in the
first phase, we perform fragment grouping using knowledge about
fragments dependency and, in the second phase, we determine an
efficient placement of the fragment groups on the Grid. We also
show, via experimental analysis that our approach gives solutions
that are close to being optimal for different databases and Grid
configurations.
Abstract: A Negotiation Support is required on a value-based decision to enable each stakeholder to evaluate and rank the solution alternatives before engaging into negotiation with the other stakeholders. This study demonstrates a process of negotiation support model for selection of a building system from value-based design perspective. The perspective is based on comparison of function and cost of a building system. Multi criteria decision techniques were applied to determine the relative value of the alternative solutions for performing the function. A satisfying option game theory are applied to the criteria of value-based decision which are LCC (life cycle cost) and function based FAST. The results demonstrate a negotiation process to select priorities of a building system. The support model can be extended to an automated negotiation by combining value based decision method, group decision and negotiation support.
Abstract: As the air traffic increases at a hub airport, some
flights cannot land or depart at their preferred target time. This event
happens because the airport runways become occupied to near their
capacity. It results in extra costs for both passengers and airlines
because of the loss of connecting flights or more waiting, more fuel
consumption, rescheduling crew members, etc. Hence, devising an
appropriate scheduling method that determines a suitable runway and
time for each flight in order to efficiently use the hub capacity and
minimize the related costs is of great importance. In this paper, we
present a mixed-integer zero-one model for scheduling a set of mixed
landing and departing flights (despite of most previous studies
considered only landings). According to the fact that the flight cost is
strongly affected by the level of airline, we consider different airline
categories in our model. This model presents a single objective
minimizing the total sum of three terms, namely 1) the weighted
deviation from targets, 2) the scheduled time of the last flight (i.e.,
makespan), and 3) the unbalancing the workload on runways. We
solve 10 simulated instances of different sizes up to 30 flights and 4
runways. Optimal solutions are obtained in a reasonable time, which
are satisfactory in comparison with the traditional rule, namely First-
Come-First-Serve (FCFS) that is far apart from optimality in most
cases.
Abstract: The main objective of this study was to remove and recover Ni, Cu and Fe from a mixed metal system using sodium hypophosphite as a reducing agent and nickel powder as seeding material. The metal systems studied consisted of Ni-Cu, Ni-Fe and Ni-Cu-Fe solutions. A 5 L batch reactor was used to conduct experiments where 100 mg/l of each respective metal was used. It was found that the metals were reduced to their elemental form with removal efficiencies of over 80%. The removal efficiency decreased in the order Fe>Ni>Cu. The metal powder obtained contained between 97-99% Ni and was almost spherical and porous. Size enlargement by aggregation was the dominant particulate process.
Abstract: This paper presents a method to estimate load profile
in a multiple power flow solutions for every minutes in 24 hours per
day. A method to calculate multiple solutions of non linear profile is
introduced. The Power System Simulation/Engineering (PSS®E) and
python has been used to solve the load power flow. The result of this
power flow solutions has been used to estimate the load profiles for
each load at buses using Independent Component Analysis (ICA)
without any knowledge of parameter and network topology of the
systems. The proposed algorithm is tested with IEEE 69 test bus
system represents for distribution part and the method of ICA has
been programmed in MATLAB R2012b version. Simulation results
and errors of estimations are discussed in this paper.
Abstract: In this paper, numerical solution for the generalized Rosenau-Burgers equation is considered and Crank-Nicolson finite difference scheme is proposed. Existence of the solutions for the difference scheme has been shown. Stability, convergence and priori error estimate of the scheme are proved. Numerical results demonstrate that the scheme is efficient and reliable.
Abstract: A lot of Scientific and Engineering problems require the solution of large systems of linear equations of the form bAx in an effective manner. LU-Decomposition offers good choices for solving this problem. Our approach is to find the lower bound of processing elements needed for this purpose. Here is used the so called Omega calculus, as a computational method for solving problems via their corresponding Diophantine relation. From the corresponding algorithm is formed a system of linear diophantine equalities using the domain of computation which is given by the set of lattice points inside the polyhedron. Then is run the Mathematica program DiophantineGF.m. This program calculates the generating function from which is possible to find the number of solutions to the system of Diophantine equalities, which in fact gives the lower bound for the number of processors needed for the corresponding algorithm. There is given a mathematical explanation of the problem as well. Keywordsgenerating function, lattice points in polyhedron, lower bound of processor elements, system of Diophantine equationsand : calculus.
Abstract: This paper introduces a technique for simulating a
single-server exponential queuing system. The technique called the
Q-Simulator is a computer program which can simulate the effect of
traffic intensity on all system average quantities given the arrival
and/or service rates. The Q-Simulator has three phases namely: the
formula based method, the uncontrolled simulation, and the
controlled simulation. The Q-Simulator generates graphs (crystal
solutions) for all results of the simulation or calculation and can be
used to estimate desirable average quantities such as waiting times,
queue lengths, etc.
Abstract: Owing to the stringent environmental legislations,
CO2 capture and sequestration is one of the viable solutions to reduce
the CO2 emissions from various sources. In this context, Ionic liquids
(ILs) are being investigated as suitable absorption media for CO2
capture. Due to their non-evaporative, non-toxic, and non-corrosive
nature, these ILs have the potential to replace the existing solvents
like aqueous amine solutions for CO2 separation technologies. Thus,
the present work aims at studying the important aspects such as the
interactions of CO2 molecule with different anions (F-, Br-, Cl-, NO3
-,
BF4
-, PF6
-, Tf2N-, and CF3SO3
-) that are commonly used in ILs
through molecular modeling. In this, the minimum energy structures
have been obtained using Ab initio based calculations at MP2
(Moller-Plesset perturbation) level. Results revealed various degrees
of distortion of CO2 molecule (from its linearity) with the anions
studied, most likely due to the Lewis acid-base interactions between
CO2 and anion. Furthermore, binding energies for the anion-CO2
complexes were also calculated. The implication of anion-CO2
interactions to the solubility of CO2 in ionic liquids is also discussed.
Abstract: In this paper, using the Gaines and Mawhin,s continuation theorem of coincidence degree theory on time scales, the existence of periodic solutions for a two-prey one-predator system is studied. Some sufficient conditions for the existence of positive periodic solutions are obtained. The results provide unified existence theorems of periodic solution for the continuous differential equations and discrete difference equations.
Abstract: Many firms implemented various initiatives such as outsourced manufacturing which could make a supply chain (SC) more vulnerable to various types of disruptions. So managing risk has become a critical component of SC management. Different types of SC vulnerability management methodologies have been proposed for managing SC risk, most offer only point-based solutions that deal with a limited set of risks. This research aims to reinforce SC risk management by proposing an integrated approach. SC risks are identified and a risk index classification structure is created. Then we develop a SC risk assessment approach based on the analytic network process (ANP) and the VIKOR methods under the fuzzy environment where the vagueness and subjectivity are handled with linguistic terms parameterized by triangular fuzzy numbers. By using FANP, risks weights are calculated and then inserted to the FVIKOR to rank the SC members and find the most risky partner.
Abstract: Two-dimensional (2D) bar codes were designed to
carry significantly more data with higher information density and
robustness than its 1D counterpart. Thanks to the popular
combination of cameras and mobile phones, it will naturally bring
great commercial value to use the camera phone for 2D bar code
reading. This paper addresses the problem of specific 2D bar code
design for mobile phones and introduces a low-level encoding
method of matrix codes. At the same time, we propose an efficient
scheme for 2D bar codes decoding, of which the effort is put on
solutions of the difficulties introduced by low image quality that is
very common in bar code images taken by a phone camera.
Abstract: As communications systems and technology become more advanced and complex, it will be increasingly important to focus on users- individual needs. Personalization and effective user profile management will be necessary to ensure the uptake and success of new services and devices and it is therefore important to focus on the users- requirements in this area and define solutions that meet these requirements. The work on personalization and user profiles emerged from earlier ETSI work on a Universal Communications Identifier (UCI) which is a unique identifier of the user rather than a range of identifiers of the many of communication devices or services (e.g. numbers of fixed phone at home/work, mobile phones, fax and email addresses). This paper describes work on personalization including standardized information and preferences and an architectural framework providing a description of how personalization can be integrated in Next Generation Networks, together with the UCI concept.
Abstract: In this paper, collocation based cubic B-spline and
extended cubic uniform B-spline method are considered for
solving one-dimensional heat equation with a nonlocal initial
condition. Finite difference and θ-weighted scheme is used for
time and space discretization respectively. The stability of the
method is analyzed by the Von Neumann method. Accuracy of
the methods is illustrated with an example. The numerical results
are obtained and compared with the analytical solutions.
Abstract: Aspect Oriented Programming promises many
advantages at programming level by incorporating the cross cutting
concerns into separate units, called aspects. Join Points are
distinguishing features of Aspect Oriented Programming as they
define the points where core requirements and crosscutting concerns
are (inter)connected. Currently, there is a problem of multiple
aspects- composition at the same join point, which introduces the
issues like ordering and controlling of these superimposed aspects.
Dynamic strategies are required to handle these issues as early as
possible. State chart is an effective modeling tool to capture dynamic
behavior at high level design. This paper provides methodology to
formulate the strategies for multiple aspect composition at high level,
which helps to better implement these strategies at coding level. It
also highlights the need of designing shared join point at high level,
by providing the solutions of these issues using state chart diagrams
in UML 2.0. High level design representation of shared join points
also helps to implement the designed strategy in systematic way.