نتایج جستجو برای: service decomposition
تعداد نتایج: 425753 فیلتر نتایج به سال:
service failure can put companies out of business if attention is not paid to this problem. the purposes of this study were to investigate the explanatory relationships between hotel guests’ perceptions of (a) service failure; (b) service recovery strategies in each service failure situation and behavioral intentions. this study explained the components of service recovery strategies used when ...
incorporation of plant residue in soils is considered as an important agricultural practice for maintaining soil fertility in sustainable agricultural system. co2 levels, nitrogen fertilization and plant residues are factors which highly affect decomposition of added organic matter to soil. in this research controlled chambers were used to investigate the effects of elevated atmospheric co2 con...
in this research, cuo spherical-like nanoparticles were synthesized using the planetary ball mill method. the structure, particle size and morphology of the resulting cuo nanoparticles were characterized by xrd (x-ray diffraction), sem (scanning electron microscopy) and saxs (small-angle x-ray scattering) methods. the results of this investigation showed that the smallest particles which were o...
Terrestrial ecosystems currently sequester about one third of anthropogenic CO2 emissions each year, an important ecosystem service that dampens climate change. The future fate of this net uptake of CO2 by land based ecosystems is highly uncertain.Most ecosystemmodels used to predict the future terrestrial carbon cycle share a common architecture, whereby carbon that enters the system as net pr...
Let G=(V,E) be a simple connected graph of order p and size q. A decomposition of a graph G is a collection π of edge-disjoint subgraphs G_1,G_2,…,G_n of G such that every edge of G belongs to exactly one G_i,(1≤i ≤n). The decomposition 〖π={G〗_1,G_2,…,G_n} of a connected graph G is said to be a distinct edge geodetic decomposition if g_1 (G_i )≠g_1 (G_j ),(1≤i≠j≤n). The maximum cardinality of π...
Searching for a Web service that meets the user requirements can be a complex task especially when the system starts to scale up by increasing the number of Web services, w, in the UDDI registry and by enlarging the number of QoS features (f) by which each Web service is described. This can be perceived as the commonly known nearest neighbor search problem, which typically imposes a time or sto...
A tree containing exactly two non-pendant vertices is called a double-star. Let $k_1$ and $k_2$ be two positive integers. The double-star with degree sequence $(k_1+1, k_2+1, 1, ldots, 1)$ is denoted by $S_{k_1, k_2}$. It is known that a cubic graph has an $S_{1,1}$-decomposition if and only if it contains a perfect matching. In this paper, we study the $S_{1,2}$-decomposit...
Web service composition is gaining a considerable momentum as an approach to the effective integration of distributed, heterogeneous, and autonomous application. Current composed service processes are mostly generated in the syntactic level and in a manual way. The limitation of the approach is that it does not allow business to dynamic change partners and services. In order to avoid this disad...
We study the sojourn time of customers in an M/M/1 queue with processor sharing service discipline and service interruptions. The lengths of the service interruptions have a general distribution, whereas the periods of service availability are assumed to have an exponential distribution. A branching process approach is shown to lead to a decomposition of the sojourn time into independent contri...
In this paper, we consider a cross-layer design aimed to enhance performance for uplink transmission in an orthogonal frequency division multiple-access (OFDMA)-based cellular network with fixed relay stations. Because mobile stations (MSs) spend most of the power on the uplink transmission, power efficiency resource allocation becomes very important to MSs. We develop a cross-layer optimisatio...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید