Abstract: In this paper, cloud resource broker using goalbased
request in medical application is proposed. To handle recent
huge production of digital images and data in medical informatics
application, the cloud resource broker could be used by medical
practitioner for proper process in discovering and selecting correct
information and application. This paper summarizes several
reviewed articles to relate medical informatics application with
current broker technology and presents a research work in applying
goal-based request in cloud resource broker to optimize the use of
resources in cloud environment. The objective of proposing a new
kind of resource broker is to enhance the current resource
scheduling, discovery, and selection procedures. We believed that
it could help to maximize resources allocation in medical
informatics application.
Abstract: An innovative approach utilizing highly alkaline oil
shale waste ash and carbon dioxide gas (CO2), associated with power
production, as a resource for production of precipitated calcium
carbonate (PCC) is introduced in this paper. The specifics and
feasibility of the integrated ash valorization and CO2 sequestration
process by indirect aqueous carbonation of lime-consisting ash were
elaborated and the main parameters established. Detailed description
of the formed precipitates was included. Complimentary carbonation
experiments with commercial CaO fine powder were conducted for
comparative characterization of the final products obtained on the
basis of two different raw materials. Finally, the expected CO2
uptake was evaluated.
Abstract: Reducing the risk of information leaks is one of
the most important functions of identity management systems. To
achieve this purpose, Dey et al. have already proposed an account
management method for a federated login system using a blind
signature scheme. In order to ensure account anonymity for the
authentication provider, referred to as an IDP (identity provider),
a blind signature scheme is utilized to generate an authentication
token on an authentication service and the token is sent to an IDP.
However, there is a problem with the proposed system. Malicious
users can establish multiple accounts on an IDP by requesting such
accounts. As a measure to solve this problem, in this paper, the
authors propose an account checking method that is performed before
account generation.
Abstract: The hypercube Qn is one of the most well-known
and popular interconnection networks and the k-ary n-cube Qk
n is
an enlarged family from Qn that keeps many pleasing properties
from hypercubes. In this article, we study the panpositionable
hamiltonicity of Qk
n for k ≥ 3 and n ≥ 2. Let x, y of V (Qk
n)
be two arbitrary vertices and C be a hamiltonian cycle of Qk
n.
We use dC(x, y) to denote the distance between x and y on the
hamiltonian cycle C. Define l as an integer satisfying d(x, y) ≤ l ≤ 1
2 |V (Qk
n)|. We prove the followings:
• When k = 3 and n ≥ 2, there exists a hamiltonian cycle C
of Qk
n such that dC(x, y) = l.
• When k ≥ 5 is odd and n ≥ 2, we request that l /∈ S
where S is a set of specific integers. Then there exists a
hamiltonian cycle C of Qk
n such that dC(x, y) = l.
• When k ≥ 4 is even and n ≥ 2, we request l-d(x, y) to be
even. Then there exists a hamiltonian cycle C of Qk
n such
that dC(x, y) = l.
The result is optimal since the restrictions on l is due to the
structure of Qk
n by definition.
Abstract: The group mutual exclusion (GME) problem is a
variant of the mutual exclusion problem. In the present paper a
token-based group mutual exclusion algorithm, capable of handling
transient faults, is proposed. The algorithm uses the concept of
dynamic request sets. A time out mechanism is used to detect the
token loss; also, a distributed scheme is used to regenerate the token.
The worst case message complexity of the algorithm is n+1. The
maximum concurrency and forum switch complexity of the
algorithm are n and min (n, m) respectively, where n is the number of
processes and m is the number of groups. The algorithm also satisfies
another desirable property called smooth admission. The scheme can
also be adapted to handle the extended group mutual exclusion
problem.
Abstract: Optical network uses a tool for routing which is called
Latin router. These routers use particular algorithms for routing. In this paper, we present algorithm for configuration of optical network that is optimized regarding previous algorithm. We show that by decreasing the number of hops for source-destination in lightpath number of satisfied request is less. Also we had shown that more than
single-hop lightpath relating single-hop lightpath is better.
Abstract: This paper presents the feasibility study of CO2 sequestration from the sources to the sinks in the prospective of Italian Industries. CO2 produced at these sources captured, compressed to supercritical pressures, transported via pipelines and stored in underground geologic formations such as depleted oil and natural gas reservoirs, un-minable coal seams and deep saline aquifers. In this work, we present the optimized pipeline infrastructure for the CO2 with appropriate constraints to find lower cost system by the use of nonlinear optimization software LINGO 11.0. This study was conducted on CO2 transportation complex network of Italian Industries, to find minimum cost network for transporting the CO2 from sources to the sinks.
Abstract: Classification of video sequences based on their contents is a vital process for adaptation techniques. It helps decide which adaptation technique best fits the resource reduction requested by the client. In this paper we used the principal feature analysis algorithm to select a reduced subset of video features. The main idea is to select only one feature from each class based on the similarities between the features within that class. Our results showed that using this feature reduction technique the source video features can be completely omitted from future classification of video sequences.
Abstract: This paper outlines the development of a learning retrieval agent. Task of this agent is to extract knowledge of the Active Semantic Network in respect to user-requests. Based on a reinforcement learning approach, the agent learns to interpret the user-s intention. Especially, the learning algorithm focuses on the retrieval of complex long distant relations. Increasing its learnt knowledge with every request-result-evaluation sequence, the agent enhances his capability in finding the intended information.
Abstract: In this paper, we explore a new scheme for filtering spoofed packets (DDOS attack) which is a combination of path fingerprint and client puzzle concepts. In this each IP packet has a unique fingerprint is embedded that represents, the route a packet has traversed. The server maintains a mapping table which contains the client IP address and its corresponding fingerprint. In ingress router, client puzzle is placed. For each request, the puzzle issuer provides a puzzle which the source has to solve. Our design has the following advantages over prior approaches, 1) Reduce the network traffic, as we place a client puzzle at the ingress router. 2) Mapping table at the server is lightweight and moderate.
Abstract: Due to short product life cycles, increasing variety of
products and short cycles of leap innovations manufacturing
companies have to increase the flexibility of factory structures.
Flexibility of factory structures is based on defined factory planning
processes in which product, process and resource data of various
partial domains have to be considered. Thus factory planning
processes can be characterized as iterative, interdisciplinary and
participative processes [1]. To support interdisciplinary and
participative character of planning processes, a federative factory
data management (FFDM) as a holistic solution will be described.
FFDM is already implemented in form of a prototype. The interim
results of the development of FFDM will be shown in this paper. The
principles are the extracting of product, process and resource data
from documents of various partial domains providing as web services
on a server. The described data can be requested by the factory
planner by using a FFDM-browser.
Abstract: We propose a novel prioritized limited
processor-sharing (PS) rule and a simulation algorithm for the performance evaluation of this rule. The performance measures of practical interest are evaluated using this algorithm. Suppose that there
are two classes and that an arriving (class-1 or class-2) request encounters n1 class-1 and n2 class-2 requests (including the arriving
one) in a single-server system. According to the proposed rule, class-1
requests individually and simultaneously receive m / (m * n1+ n2) of the service-facility capacity, whereas class-2 requests receive 1 / (m *n1 + n2) of it, if m * n1 + n2 ≤ C. Otherwise (m * n1 + n2 > C), the arriving request will be queued in the corresponding class waiting
room or rejected. Here, m (1) denotes the priority ratio, and C ( ∞), the service-facility capacity. In this rule, when a request arrives at [or
departs from] the system, the extension [shortening] of the remaining
sojourn time of each request receiving service can be calculated using
the number of requests of each class and the priority ratio. Employing
a simulation program to execute these events and calculations enables
us to analyze the performance of the proposed prioritized limited PS
rule, which is realistic in a time-sharing system (TSS) with a
sufficiently small time slot. Moreover, this simulation algorithm is
expanded for the evaluation of the prioritized limited PS system with
N 3 priority classes.
Abstract: Electronic commerce is growing rapidly with on-line
sales already heading for hundreds of billion dollars per year. Due to
the huge amount of money transferred everyday, an increased
security level is required. In this work we present the architecture of
an intelligent speaker verification system, which is able to accurately
verify the registered users of an e-commerce service using only their
voices as an input. According to the proposed architecture, a
transaction-based e-commerce application should be complemented
by a biometric server where customer-s unique set of speech models
(voiceprint) is stored. The verification procedure requests from the
user to pronounce a personalized sequence of digits and after
capturing speech and extracting voice features at the client side are
sent back to the biometric server. The biometric server uses pattern
recognition to decide whether the received features match the stored
voiceprint of the customer who claims to be, and accordingly grants
verification. The proposed architecture can provide e-commerce
applications with a higher degree of certainty regarding the identity
of a customer, and prevent impostors to execute fraudulent
transactions.
Abstract: In this research, effort was made to identify and
evaluate barriers to the development of entrepreneurship among
Iranian entrepreneur women who were graduated from universities.
In this study, perspectives of thirty-seven available entrepreneur
women were examined. In order to prepare questionnaires and
receive knowledge about barriers among these women, seven cases of
entrepreneur women took part in in-depth interviews. Then, to
evaluate the importance of barriers, the researchers made a
questionnaire with closed questions in which the barriers were
classified into the following categories: personal-familial barriers;
socio-cultural barriers; economic-financial-commercial barriers; and
structural barriers. Entrepreneur women were requested to rate the
importance of each item. The results indicated that there were
different obstacles among entrepreneur women. The order of the
important barriers was as fallow: economic-financial-commercial,
structural, socio-cultural, and personal-familial.
Abstract: Wireless mobile communications have experienced
the phenomenal growth through last decades. The advances in
wireless mobile technologies have brought about a demand for high
quality multimedia applications and services. For such applications
and services to work, signaling protocol is required for establishing,
maintaining and tearing down multimedia sessions. The Session
Initiation Protocol (SIP) is an application layer signaling protocols,
based on request/response transaction model. This paper considers
SIP INVITE transaction over an unreliable medium, since it has been
recently modified in Request for Comments (RFC) 6026. In order to
help in assuring that the functional correctness of this modification is
achieved, the SIP INVITE transaction is modeled and analyzed using
Colored Petri Nets (CPNs). Based on the model analysis, it is
concluded that the SIP INVITE transaction is free of livelocks and
dead codes, and in the same time it has both desirable and
undesirable deadlocks. Therefore, SIP INVITE transaction should be
subjected for additional updates in order to eliminate undesirable
deadlocks. In order to reduce the cost of implementation and
maintenance of SIP, additional remodeling of the SIP INVITE
transaction is recommended.
Abstract: How to effectively allocate system resource to process
the Client request by Gateway servers is a challenging problem. In
this paper, we propose an improved scheme for autonomous
performance of Gateway servers under highly dynamic traffic loads.
We devise a methodology to calculate Queue Length and Waiting
Time utilizing Gateway Server information to reduce response time
variance in presence of bursty traffic. The most widespread
contemplation is performance, because Gateway Servers must offer
cost-effective and high-availability services in the elongated period,
thus they have to be scaled to meet the expected load. Performance
measurements can be the base for performance modeling and
prediction. With the help of performance models, the performance
metrics (like buffer estimation, waiting time) can be determined at
the development process. This paper describes the possible queue
models those can be applied in the estimation of queue length to
estimate the final value of the memory size. Both simulation and
experimental studies using synthesized workloads and analysis of
real-world Gateway Servers demonstrate the effectiveness of the
proposed system.
Abstract: Software developed for a specific customer under contract
typically undergoes a period of testing by the customer before
acceptance. This is known as user acceptance testing and the process
can reveal both defects in the system and requests for changes to
the product. This paper uses nonhomogeneous Poisson processes to
model a real user acceptance data set from a recently developed
system. In particular a split Poisson process is shown to provide an
excellent fit to the data. The paper explains how this model can be
used to aid the allocation of resources through the accurate prediction
of occurrences both during the acceptance testing phase and before
this activity begins.
Abstract: This paper proposes a new approach to offer a private
cloud service in HPC clusters. In particular, our approach relies on
automatically scheduling users- customized environment request as a
normal job in batch system. After finishing virtualization request jobs,
those guest operating systems will dismiss so that compute nodes will
be released again for computing. We present initial work on the
innovative integration of HPC batch system and virtualization tools
that aims at coexistence such that they suffice for meeting the
minimizing interference required by a traditional HPC cluster. Given
the design of initial infrastructure, the proposed effort has the potential
to positively impact on synergy model. The results from the
experiment concluded that goal for provisioning customized cluster
environment indeed can be fulfilled by using virtual machines, and
efficiency can be improved with proper setup and arrangements.
Abstract: In order to make surfing the internet faster, and to save redundant processing load with each request for the same web page, many caching techniques have been developed to reduce latency of retrieving data on World Wide Web. In this paper we will give a quick overview of existing web caching techniques used for dynamic web pages then we will introduce a design and implementation model that take advantage of “URL Rewriting" feature in some popular web servers, e.g. Apache, to provide an effective approach of caching dynamic web pages.
Abstract: For more than 120 years, gold mining formed the
backbone the South Africa-s economy. The consequence of mine
closure was observed in large-scale land degradation and widespread
pollution of surface water and groundwater. This paper investigates
the feasibility of using natural zeolite in removing heavy metals
contaminating the Wonderfonteinspruit Catchment Area (WCA), a
water stream with high levels of heavy metals and radionuclide
pollution. Batch experiments were conducted to study the adsorption
behavior of natural zeolite with respect to Fe2+, Mn2+, Ni2+, and Zn2+.
The data was analysed using the Langmuir and Freudlich isotherms.
Langmuir was found to correlate the adsorption of Fe2+, Mn2+, Ni2+,
and Zn2+ better, with the adsorption capacity of 11.9 mg/g, 1.2 mg/g,
1.3 mg/g, and 14.7 mg/g, respectively. Two kinetic models namely,
pseudo-first order and pseudo second order were also tested to fit the
data. Pseudo-second order equation was found to be the best fit for
the adsorption of heavy metals by natural zeolite. Zeolite
functionalization with humic acid increased its uptake ability.