Making good use of Service Level Agreements (SLA) becomes crucial for an enterprise both to provide value added products and services to customers and to protect the interest of parties involved in the business activi...
详细信息
Making good use of Service Level Agreements (SLA) becomes crucial for an enterprise both to provide value added products and services to customers and to protect the interest of parties involved in the business activities. Well formed and effective structural representation and management of SLAs in conceptual modeling can greatly support the understanding and communication of service development and deployment as well as maintenance of quality of service. Existing specifications and structures for SLAs do not fully formalize and support for different automatic and dynamic behavioral aspects needed within business enterprises due to lack of study focusing on SLAs templates and their contents, which are mostly written on Natural Language (NL). We address the issues of how to use conceptual models to describe the structures of SLAs and the various relationships between SLAs and their items, and hence to better depict business domains. With focus on the contents, process, and dependencies among SLAs, we aim to use so generated concept model for service discovery, service delivery and scheduling.
Retinal arteriovenous nicking (AV nicking) is the phenomenon where the venule is compressed or decreases in its caliber at both sides of an arteriovenous crossing. Recent research suggests that retinal AVN is associat...
详细信息
ISBN:
(纸本)9781457702150
Retinal arteriovenous nicking (AV nicking) is the phenomenon where the venule is compressed or decreases in its caliber at both sides of an arteriovenous crossing. Recent research suggests that retinal AVN is associated with hypertension and cardiovascular diseases such as stroke. In this article, we propose a computer method for assessing the severity level of AV nicking of an artery-vein (AV) crossing in color retinal images. The vascular network is first extracted using a method based on multi-scale line detection. A trimming process is then performed to isolate the main vessels from unnecessary structures such as small branches or imaging artefact. Individual segments of each vessel are then identified and the vein is recognized through an artery-vein identification process. A vessel width measurement method is devised to measure the venular caliber along its two segments. The vessel width measurements of each venular segment is then analyzed and assessed separately and the final AVN index of a crossover is computed as the most severity of its two segments. The proposed technique was validated on 69 AV crossover points of varying AV nicking levels extracted from retinal images of the Singapore Malay Eye Study (SiMES). The results show that the computed AVN values are highly correlated with the manual grading with a Spearman correlation coefficient of 0.70. This has demonstrated the accuracy of the proposed method and the feasibility to develop a computer method for automatic AV nicking detection. The quantitative measurements provided by the system may help to establish a more reliable link between AV nicking and known systemic and eye diseases, which deserves further examination and exploration.
Discovering protein patterns for amino acids and their biochemical properties is important for revealing the underlying biophysical models. From this, pattern clustering was introduced in order to relate the discovere...
详细信息
ISBN:
(纸本)9781479913114
Discovering protein patterns for amino acids and their biochemical properties is important for revealing the underlying biophysical models. From this, pattern clustering was introduced in order to relate the discovered protein patterns to taxonomic classes in a localized region of a protein. This paper proposes an algorithm to synthesize and re-group pattern clusters, maximizing their separability in order to reveal class characteristics of the localized region of the protein based on our previous work. To evaluate the pattern clustering and regrouping pattern clusters results, we introduce three evaluation measures: F-measure, class entropy measure, and attribute entropy measure. To validate our proposed algorithm, experiments are run on synthetic data, protein family for amino acid attributes, and chemical property attributes. The experimental results show that: a) the result for regrouping pattern clusters is more accurate in class separation than only using pattern clustering;b) The clusters after regrouping are more distinctly separable with each other than only using pattern clustering;c) two types of pattern clusters are found, with one pertaining to distinct classes and the other associating with two or more related classes;and d) class characteristics are clearly revealed in the data subspace containing the patterns in the pattern clusters. The datasets with chemical properties show that unsupervised techniques can reveal common chemical attributes in the inherent classes as more of the common properties shared by different amino acids are taken into account
The iVAT algorithm reorders (symmetric) dissimilarity data so that an image of the data may reveal cluster substructure. This paper extends the method so that it can handle asymmetric dissimilarity data. The extension...
详细信息
The iVAT algorithm reorders (symmetric) dissimilarity data so that an image of the data may reveal cluster substructure. This paper extends the method so that it can handle asymmetric dissimilarity data. The extension is based on replacing the asymmetric input data with its unique least-squared error approximation by a symmetric matrix. Examples are given to illustrate the new method, called asymmetric iVAT (asiVAT).
A non linear relationship between an internal combustion engine and its engine parameters such as vibration signals/ exhaust gas is expected to be available. Under various fault conditions, vibration signals were coll...
详细信息
A non linear relationship between an internal combustion engine and its engine parameters such as vibration signals/ exhaust gas is expected to be available. Under various fault conditions, vibration signals were collected using a test-bed to prove this. Fourier transformed vibration signals were mapped to their corresponding faults using a back propagation neural network. The network consists with about 250 input nodes and 150 hidden nodes; resilient back-propagation was used to deal with the complexity created by the high number of nodes. The collected dataset was divided and used for training and testing; and selection combination was changed to check different types of conditions. Using a neural network, creating a relationship between simulated engine faults and their corresponding vibration signals was successful. Although an engine is a complex environment with a lot of unexpected conditions, this result can be used as a start to help predicting engine faults in an efficient and accurate manner. Additional engine characteristics such as exhaust gas/ com port data can also be used to future enhance this fault predicting system.
This paper deals with the finite-horizon estimation of randomly occurring faults for a class of linear discrete time-varying systems. All the system parameters are time-varying and the failures are assumed to occur in...
详细信息
ISBN:
(纸本)9781479912360
This paper deals with the finite-horizon estimation of randomly occurring faults for a class of linear discrete time-varying systems. All the system parameters are time-varying and the failures are assumed to occur in a random way, and two sets of Bernoulli distributed white sequences are introduced to govern the failures probability. By using the completing squares method and stochastic analysis techniques, necessary and sufficient conditions for the existence of the finite-horizon H_∞ fault estimator are derived, and then the time-varying fault estimator parameters are obtained by solving coupled backward recursive Riccati difference equations (RDEs). A simulation example is utilized to illustrate the usefulness of the proposed fault estimation method.
Neural network language models, or continuous-space language models (CSLMs), have been shown to improve the performance of statistical machine translation (SMT) when they are used for reranking n-best translations. Ho...
详细信息
With the increasingly growing amount of service requests from the world-wide customers, the cloud systems is capable of providing services while meeting the customers' satisfaction. Recently, to achieve the better...
详细信息
With the increasingly growing amount of service requests from the world-wide customers, the cloud systems is capable of providing services while meeting the customers' satisfaction. Recently, to achieve the better reliability and performance, the cloud systems has been largely depending on the geographically distributed data centers. Nevertheless, the dollar cost of service placement by service providers (SP) differ from the multiple regions. Accordingly, it is crucial to design a request dispatching and resource allocation algorithm to maximize net profit. The existing algorithms are either built upon energy-efficient schemes alone, or multi-type requests and customer satisfaction oblivious. They cannot be applied to multi-type requests and customer satisfaction-aware algorithm design with the objective of maximizing net profit. This paper proposes a customer satisfaction-aware algorithm based on the Ant-Colony Optimization (AMP) for geo-distributed data centers. By introducing the model of customer satisfaction, we formulate the utility (or net profit) maximization issue as an optimization problem under the constraints of customer satisfaction and data centers. AMP maximizes SP net profit by dispatching service requests to the proper data centers and generating the appropriate amount of Virtual Machines (VMs) to meet customer satisfaction. To evaluate the proposed algorithm, we have conducted the comprehensive simulation and compared with the other state-of-the-art algorithms. Conclusive results have demonstrated the effectiveness of AMP both in small and large scale problem.
There are increasing interests on mobile opportunistic networks which have promising applications. Constructing a mobile backbone can effectively improve the packet delivery performance of a mobile opportunistic netwo...
详细信息
ISBN:
(纸本)9781479913510
There are increasing interests on mobile opportunistic networks which have promising applications. Constructing a mobile backbone can effectively improve the packet delivery performance of a mobile opportunistic network by excluding poor relay nodes and reducing packet collisions. However, it is highly challenging to construct an effective mobile backbone because of the absence of the quantitative relationship between the network performance and the selection of backbone nodes, and expositive search space. As nodes exhibit clear sociality observed in previous studies, We explicitly take such node sociality into account when computing the backbone for mobile opportunistic networks and we incrementally propose three algorithms for computing the mobile backbone. Trace-driven simulations have been conducted and simulation results demonstrate that the sociality-aware algorithms can achieve low delivery delay and high delivery ratio.
Wireless sensor networks are usually deployed in scenarios that are too hostile for human personnel to perform maintenance tasks. Wireless sensor nodes usually exchange information in a multi-hop manner. Connectivity ...
详细信息
Wireless sensor networks are usually deployed in scenarios that are too hostile for human personnel to perform maintenance tasks. Wireless sensor nodes usually exchange information in a multi-hop manner. Connectivity is crucial to the performance of a wireless sensor network. In case a network is partitioned due to node failures, it is possible to re-connect the fragments by setting up bridges using mobile platforms. Given the landscape of a terrain, the mobile platforms should be able reach the target position using a desirable path. In this paper, an off-line robot path planner is proposed to find desirable paths between arbitrary points in a given terrain. The proposed path planner is based on ACO algorithms. Unlike ordinary ACO algorithms, the proposed path planner provides its artificial ants with extra flexibility in making routing decisions. Simulation results show that such enhancement can greatly improve the qualities of the paths obtained. Performances of the proposed path planner can be further optimized by fine-tuning its parameters.
暂无评论