Abstract: Gas flaring is one of the most GHG emitting sources in the oil and gas industries. It is also a major way for wasting such an energy that could be better utilized and even generates revenue. Minimize flaring is an effective approach for reducing GHG emissions and also conserving energy in flaring systems. Integrating waste and flared gases into the fuel gas networks (FGN) of refineries is an efficient tool. A fuel gas network collects fuel gases from various source streams and mixes them in an optimal manner, and supplies them to different fuel sinks such as furnaces, boilers, turbines, etc. In this article we use fuel gas network model proposed by Hasan et al. as a base model and modify some of its features and add constraints on emission pollution by gas flaring to reduce GHG emissions as possible. Results for a refinery case study showed that integration of flare gas stream with waste and natural gas streams to construct an optimal FGN can significantly reduce total annualized cost and flaring emissions.
Abstract: The Reverse Monte Carlo (RMC) simulation is applied in the study of an aqueous electrolyte LiCl6H2O. On the basis of the available experimental neutron scattering data, RMC computes pair radial distribution functions in order to explore the structural features of the system. The obtained results include some unrealistic features. To overcome this problem, we use the Hybrid Reverse Monte Carlo (HRMC), incorporating an energy constraint in addition to the commonly used constraints derived from experimental data. Our results show a good agreement between experimental and computed partial distribution functions (PDFs) as well as a significant improvement in pair partial distribution curves. This kind of study can be considered as a useful test for a defined interaction model for conventional simulation techniques.
Abstract: This paper presents an analytical model to estimate
the cost of an optimized design of reinforced concrete isolated
footing base on structural safety. Flexural and optimized formulas for
square and rectangular footingare derived base on ACI building code
of design, material cost and optimization. The optimization
constraints consist of upper and lower limits of depth and area of
steel. Footing depth and area of reinforcing steel are to be minimized
to yield the optimal footing dimensions. Optimized footing materials
cost of concrete, reinforcing steel and formwork of the designed
sections are computed. Total cost factor TCF and other cost factors
are developed to generalize and simplify the calculations of footing
material cost. Numerical examples are presented to illustrate the
model capability of estimating the material cost of the footing for a
desired axial load.
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
and 34 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: Low power consumption is a major constraint for battery-powered system like computer notebook or PDA. In the past, specialists usually designed both specific optimized equipments and codes to relief this concern. Doing like this could work for quite a long time, however, in this era, there is another significant restraint, the time to market. To be able to serve along the power constraint while can launch products in shorter production period, objectoriented programming (OOP) has stepped in to this field. Though everyone knows that OOP has quite much more overhead than assembly and procedural languages, development trend still heads to this new world, which contradicts with the target of low power consumption. Most of the prior power related software researches reported that OOP consumed much resource, however, as industry had to accept it due to business reasons, up to now, no papers yet had mentioned about how to choose the best OOP practice in this power limited boundary. This article is the pioneer that tries to specify and propose the optimized strategy in writing OOP software under energy concerned environment, based on quantitative real results. The language chosen for studying is C# based on .NET Framework 2.0 which is one of the trendy OOP development environments. The recommendation gotten from this research would be a good roadmap that can help developers in coding that well balances between time to market and time of battery.
Abstract: This paper presents Qmulus- a Cloud Based GPS
Model. Qmulus is designed to compute the best possible route which
would lead the driver to the specified destination in the shortest time
while taking into account real-time constraints. Intelligence
incorporated to Qmulus-s design makes it capable of generating and
assigning priorities to a list of optimal routes through customizable
dynamic updates. The goal of this design is to minimize travel and
cost overheads, maintain reliability and consistency, and implement
scalability and flexibility. The model proposed focuses on
reducing the bridge between a Client Application and a Cloud
service so as to render seamless operations. Qmulus-s system
model is closely integrated and its concept has the potential to be
extended into several other integrated applications making it capable
of adapting to different media and resources.
Abstract: Nowadays there is a growing environmental concern
and the business communities have slowly started recognising
environmental protection and sustainable utilization of natural
resources into their marketing strategies. This paper discusses the
various Ecolabeling and Certification Systems developed world
over to regulate and introduce Fair Trade in Ornamental Fish
Industry. Ecolabeling and green certification are considered as part
of these strategies implemented partly out of compulsion from the
National and International Regulatory Bodies and Environmental
Movements. All the major markets of ornamental fishes like
European Union, USA and Japan have started putting restrictions on
the trade to impose ecolabeling as a non tariff barrier like the one
imposed on seafood and aqua cultured products. A review was done
on the available Ecolabeling and Green Certification Schemes
available at local, national and international levels for fisheries
including aquaculture and ornamental fish trade and to examine the
success and constraints faced by these schemes during its
implementation. The primary downside of certification is the
multiplicity of ecolabels and cost incurred by applicants for
certification, costs which may in turn be passed on to consumers.
The studies reveal serious inadequacies in a number of ecolabels
and cast doubt on their overall contribution to effective fisheries
management and sustainability. The paper also discusses the
inititive taken in India to develop guidelines for Green Certification
of Fresh water ornamental fishes.
Abstract: The growing interest on national heritage
preservation has led to intensive efforts on digital documentation of
cultural heritage knowledge. Encapsulated within this effort is the
focus on ontology development that will help facilitate the
organization and retrieval of the knowledge. Ontologies surrounding
cultural heritage domain are related to archives, museum and library
information such as archaeology, artifacts, paintings, etc. The growth
in number and size of ontologies indicates the well acceptance of its
semantic enrichment in many emerging applications. Nowadays,
there are many heritage information systems available for access.
Among others is community-based e-museum designed to support the
digital cultural heritage preservation. This work extends previous
effort of developing the Traditional Malay Textile (TMT) Knowledge
Model where the model is designed with the intention of auxiliary
mapping with CIDOC CRM. Due to its internal constraints, the
model needs to be transformed in advance. This paper addresses the
issue by reviewing the previous harmonization works with CIDOC
CRM as exemplars in refining the facets in the model particularly
involving TMT-Artifact class. The result is an extensible model
which could lead to a common view for automated mapping with
CIDOC CRM. Hence, it promotes integration and exchange of
textile information especially batik-related between communities in
e-museum applications.
Abstract: This paper has two main ideas. Firstly, it describes Evans and Wurster-s concepts “the trade-off between reach and richness", and relates them to the impact of technology on the virtual markets. Authors Evans and Wurster see the transfer of information as a 'trade'off between richness and reach-. Reach refers to the number of people who share particular information, with Richness ['Rich'] being a more complex concept combining: bandwidth, customization, interactivity, reliability, security and currency. Traditional shopping limits the number of shops the shopper is able to visit due to time and other cost constraints; the time spent traveling consequently leaves the shopper with less time to evaluate the product. The paper concludes that although the Web provides Reach, offering Richness and the sense of community required for creating and sustaining relationships with potential clients could be difficult.
Abstract: Over the past several years, there has been a
considerable amount of research within the field of Quality of
Service (QoS) support for distributed multimedia systems. One of the
key issues in providing end-to-end QoS guarantees in packet
networks is determining a feasible path that satisfies a number of
QoS constraints. The problem of finding a feasible path is NPComplete
if number of constraints is more than two and cannot be
exactly solved in polynomial time. We proposed Feasible Path
Selection Algorithm (FPSA) that addresses issues with pertain to
finding a feasible path subject to delay and cost constraints and it
offers higher success rate in finding feasible paths.
Abstract: Avionics software is safe-critical embedded software
and its architecture is evolving from traditional federated architectures
to Integrated Modular Avionics (IMA) to improve resource usability.
ARINC 653 (Avionics Application Standard Software Interface) is a
software specification for space and time partitioning in Safety-critical
avionics Real-time operating systems. Arinc653 uses two-level
scheduling strategies, but current modeling tools only apply to simple
problems of Arinc653 two-level scheduling, which only contain time
property. In avionics industry, we are always manually allocating
tasks and calculating the timing table of a real-time system to ensure
it-s running as we design. In this paper we represent an automatically
generating strategy which applies to the two scheduling problems with
dependent constraints in Arinc653 partition run-time environment. It
provides the functionality of automatic generation from the task and partition models to scheduling policy through allocating the tasks to the partitions while following the constraints, and then we design a simulating mechanism to check whether our policy is schedulable or
not
Abstract: For evaluating the severity of Chronic Obstructive Pulmonary Disease (COPD), one is interested in inspecting the airway wall thickening due to inflammation. Although airway segmentations have being well developed to reconstruct in high order, airway wall segmentation remains a challenge task. While tackling such problem as a multi-surface segmentation, the interrelation within surfaces needs to be considered. We propose a new method for three-dimensional airway wall segmentation using spring structural active contour model. The method incorporates the gravitational field of the image and repelling force field of the inner lumen as the soft constraint and the geometric spring structure of active contour as the hard constraint to approximate a three-dimensional coupled surface readily for thickness measurements. The results show the preservation of topology constraints of coupled surfaces. In conclusion, our springy, soft-tissue-like structure ensures the globally optimal solution and waives the shortness following by the inevitable improper inner surface constraint.
Abstract: Semantic query optimization consists in restricting the
search space in order to reduce the set of objects of interest for a
query. This paper presents an indexing method based on UB-trees
and a static analysis of the constraints associated to the views of the
database and to any constraint expressed on attributes. The result of
the static analysis is a partitioning of the object space into disjoint
blocks. Through Space Filling Curve (SFC) techniques, each
fragment (block) of the partition is assigned a unique identifier,
enabling the efficient indexing of fragments by UB-trees. The search
space corresponding to a range query is restricted to a subset of the
blocks of the partition. This approach has been developed in the
context of a KB-DBMS but it can be applied to any relational
system.
Abstract: Virtualization-based server consolidation has been
proven to be an ideal technique to solve the server sprawl problem by
consolidating multiple virtualized servers onto a few physical servers
leading to improved resource utilization and return on investment. In
this paper, we solve this problem by using existing servers, which are
heterogeneous and diversely preferred by IT managers. Five practical
consolidation rules are introduced, and a decision model is proposed to
optimally allocate source services to physical target servers while
maximizing the average resource utilization and preference value. Our
model can be regarded as a multi-objective multi-dimension
bin-packing (MOMDBP) problem with constraints, which is strongly
NP-hard. An improved grouping generic algorithm (GGA) is
introduced for the problem. Extensive simulations were performed and
the results are given.
Abstract: Software-as-a-Service (SaaS) is a form of cloud
computing that relieves the user of the burden of hardware and
software installation and management. SaaS can be used at the course
level to enhance curricula and student experience. When cloud
computing and SaaS are included in educational literature, the focus
is typically on implementing administrative functions. Yet, SaaS can
make more immediate and substantial contributions to the technical
course content in educational offerings. This paper explores cloud
computing and SaaS, provides examples, reports on experiences
using SaaS to offer specialized software in courses, and analyzes the
advantages and disadvantages of using SaaS at the course level. The
paper contributes to the literature in higher education by analyzing
the major technical concepts, potential, and constraints for using
SaaS to deliver specialized software at the course level. Further it
may enable more educators and students to benefit from this
emerging technology.
Abstract: In this research, we have developed a new efficient
heuristic algorithm for the dynamic facility layout problem with
budget constraint (DFLPB). This heuristic algorithm combines two
mathematical programming methods such as discrete event
simulation and linear integer programming (IP) to obtain a near
optimum solution. In the proposed algorithm, the non-linear model
of the DFLP has been changed to a pure integer programming (PIP)
model. Then, the optimal solution of the PIP model has been used in
a simulation model that has been designed in a similar manner as the
DFLP for determining the probability of assigning a facility to a
location. After a sufficient number of runs, the simulation model
obtains near optimum solutions. Finally, to verify the performance of
the algorithm, several test problems have been solved. The results
show that the proposed algorithm is more efficient in terms of speed
and accuracy than other heuristic algorithms presented in previous
works found in the literature.
Abstract: The network of delivering commodities has been an important design problem in our daily lives and many transportation applications. The delivery performance is evaluated based on the system reliability of delivering commodities from a source node to a sink node in the network. The system reliability is thus maximized to find the optimal routing. However, the design problem is not simple because (1) each path segment has randomly distributed attributes; (2) there are multiple commodities that consume various path capacities; (3) the optimal routing must successfully complete the delivery process within the allowable time constraints. In this paper, we want to focus on the design optimization of the Multi-State Flow Network (MSFN) for multiple commodities. We propose an efficient approach to evaluate the system reliability in the MSFN with respect to randomly distributed path attributes and find the optimal routing subject to the allowable time constraints. The delivery rates, also known as delivery currents, of the path segments are evaluated and the minimal-current arcs are eliminated to reduce the complexity of the MSFN. Accordingly, the correct optimal routing is found and the worst-case reliability is evaluated. It has been shown that the reliability of the optimal routing is at least higher than worst-case measure. Two benchmark examples are utilized to demonstrate the proposed method. The comparisons between the original and the reduced networks show that the proposed method is very efficient.
Abstract: In this paper, the problem of finding the optimal
topological configuration of a deregulated distribution network is
considered. The new features of this paper are proposing a multiobjective
function and its application on deregulated distribution
networks for finding the optimal configuration. The multi-objective
function will be defined for minimizing total Energy Supply Costs
(ESC) and energy losses subject to load flow constraints. The
optimal configuration will be obtained by using Binary Genetic
Algorithm (BGA).The proposed method has been tested to analyze a
sample and a practical distribution networks.
Abstract: The noticeable advance in the area of computer technology has paved the way for the invention of powerful mobile devices. However, limited storage, short battery life, and relatively low computational power define the major problems of such devices. Due to the ever increasing computational requirements, such devices may fail to process needed tasks under certain constraints. One of the proposed solutions to this drawback is the introduction of Collaborative Computing, a new concept dealing with the distribution of computational tasks amongst several handhelds. This paper introduces the basics of Collaborative Computing, and proposes a new protocol that aims at managing and optimizing computing tasks in Ad-Hoc Collaborative Computing Environments.
Abstract: In this paper the multi-mode resource-constrained project scheduling problem with discounted cash flows is considered. Minimizing the makespan and maximization the net present value (NPV) are the two common objectives that have been investigated in the literature. We apply one evolutionary algorithm named multiobjective particle swarm optimization (MOPSO) to find Pareto front solutions. We used standard sets of instances from the project scheduling problem library (PSPLIB). The results are computationally compared respect to different metrics taken from the literature on evolutionary multi-objective optimization.