Abstract: To help the client to select a competent agent
construction enterprise (ACE), this study aims to investigate the
selection standards by using the Fuzzy Analytic Hierarchy Process
(FAHP) and build an evaluation mathematical model with Grey
Relational Analysis (GRA). According to the outputs of literature
review, four orderly levels are established within the model, taking the
consideration of various agent construction models in practice. Then,
the process of applying FAHP and GRA is discussed in detailed.
Finally, through a case study, this paper illustrates how to apply these
methods in getting the weights of each standard and the final
assessment result.
Abstract: This paper deals with efficient quadrature formulas involving functions that are observed only at fixed sampling points. The approach that we develop is derived from efficient continuous quadrature formulas, such as Gauss-Legendre or Clenshaw-Curtis quadrature. We select nodes at sampling positions that are as close as possible to those of the associated classical quadrature and we update quadrature weights accordingly. We supply the theoretical quadrature error formula for this new approach. We show on examples the potential gain of this approach.
Abstract: In this study, optimization is carried out to find the optimized design of a foam-filled column for the best Specific Energy Absorption (SEA) and Crush Force Efficiency (CFE). In order to maximize SEA, the optimization gives the value of 2.3 for column thickness and 151.7 for foam length. On the other hand to maximize CFE, the optimization gives the value of 1.1 for column thickness and 200 for foam length. Finite Element simulation is run by using this value and the SEA and CFE obtained 1237.76 J/kg and 0.92.
Abstract: A decomposition of a graph G is a collection ψ of
graphs H1,H2, . . . , Hr of G such that every edge of G belongs
to exactly one Hi. If each Hi is either an induced path in G,
then ψ is called an induced acyclic path decomposition of G and
if each Hi is a (induced) cycle in G then ψ is called a (induced)
cycle decomposition of G. The minimum cardinality of an induced
acyclic path decomposition of G is called the induced acyclic path
decomposition number of G and is denoted by ¤Çia(G). Similarly
the cyclic decomposition number ¤Çc(G) is defined. In this paper we
begin an investigation of these parameters.
Abstract: An original DEA model is to evaluate each DMU
optimistically, but the interval DEA Model proposed in this paper
has been formulated to obtain an efficiency interval consisting of
Evaluations from both the optimistic and the pessimistic view points.
DMUs are improved so that their lower bounds become so large as to
attain the maximum Value one. The points obtained by this method
are called ideal points. Ideal PPS is calculated by ideal of efficiency
DMUs. The purpose of this paper is to rank DMUs by this ideal PPS.
Finally we extend the efficiency interval of a DMU under variable
RTS technology.
Abstract: In this paper we propose a novel approach for
searching eCommerce products using a mobile phone, illustrated by a
prototype eCoMobile. This approach aims to globalize the mobile
search by integrating the concept of user multilinguism into it. To
show that, we particularly deal with English and Arabic languages.
Indeed the mobile user can formulate his query on a commercial
product in either language (English/Arabic). The description of his
information need on commercial products relies on the ontology that
represents the conceptualization of the product catalogue knowledge
domain defined in both English and Arabic languages. A query
expressed on a mobile device client defines the concept that
corresponds to the name of the product followed by a set of pairs
(property, value) specifying the characteristics of the product. Once a
query is submitted it is then communicated to the server side which
analyses it and in its turn performs an http request to an eCommerce
application server (like Amazon). This latter responds by returning
an XML file representing a set of elements where each element
defines an item of the searched product with its specific
characteristics. The XML file is analyzed on the server side and then
items are displayed on the mobile device client along with its
relevant characteristics in the chosen language.
Abstract: Fast delay estimation methods, as opposed to
simulation techniques, are needed for incremental performance
driven layout synthesis. On-chip inductive effects are becoming
predominant in deep submicron interconnects due to increasing clock
speed and circuit complexity. Inductance causes noise in signal
waveforms, which can adversely affect the performance of the circuit
and signal integrity. Several approaches have been put forward which
consider the inductance for on-chip interconnect modelling. But for
even much higher frequency, of the order of few GHz, the shunt
dielectric lossy component has become comparable to that of other
electrical parameters for high speed VLSI design. In order to cope up
with this effect, on-chip interconnect has to be modelled as
distributed RLCG line. Elmore delay based methods, although
efficient, cannot accurately estimate the delay for RLCG interconnect
line. In this paper, an accurate analytical delay model has been
derived, based on first and second moments of RLCG
interconnection lines. The proposed model considers both the effect
of inductance and conductance matrices. We have performed the
simulation in 0.18μm technology node and an error of as low as less
as 5% has been achieved with the proposed model when compared to
SPICE. The importance of the conductance matrices in interconnect
modelling has also been discussed and it is shown that if G is
neglected for interconnect line modelling, then it will result an delay
error of as high as 6% when compared to SPICE.
Abstract: Fair share objective has been included into the goaloriented
parallel computer job scheduling policy recently. However,
the previous work only presented the overall scheduling performance.
Thus, the per-user performance of the policy is still lacking. In this
work, the details of per-user fair share performance under the
Tradeoff-fs(Tx:avgX) policy will be further evaluated. A basic fair
share priority backfill policy namely RelShare(1d) is also studied.
The performance of all policies is collected using an event-driven
simulator with three real job traces as input. The experimental results
show that the high demand users are usually benefited under most
policies because their jobs are large or they have a lot of jobs. In the
large job case, one job executed may result in over-share during that
period. In the other case, the jobs may be backfilled for
performances. However, the users with a mixture of jobs may suffer
because if the smaller jobs are executing the priority of the remaining
jobs from the same user will be lower. Further analysis does not show
any significant impact of users with a lot of jobs or users with a large
runtime approximation error.
Abstract: This paper proposes an innovative approach for the Connection Admission Control (CAC) problem. Starting from an abstract network modelling, the CAC problem is formulated in a technology independent fashion allowing the proposed concepts to be applied to any wireless and wired domain. The proposed CAC is decoupled from the other Resource Management procedures, but cooperates with them in order to guarantee the desired QoS requirements. Moreover, it is based on suitable performance measurements which, by using proper predictors, allow to forecast the domain dynamics in the next future. Finally, the proposed CAC control scheme is based on a feedback loop aiming at maximizing a suitable performance index accounting for the domain throughput, whilst respecting a set of constraints accounting for the QoS requirements.