While small-scale fluid details are crucial elements for the creation of visually pleasing fluid animations, their synthesis often requires heavy computation with traditional grid-based fluid simulation methods. This ...
详细信息
The high voltage circuit breaker is an important power system equipment. The reliability of its running relationship with the safe operation of the entire power system. High voltage circuit breaker on-line monitoring ...
详细信息
Lasso simultaneously conducts variable selection and supervised regression. In this paper, we extend Lasso to multiple output prediction, which belongs to the categories of structured learning. Though structured learn...
详细信息
ISBN:
(纸本)9781479943012
Lasso simultaneously conducts variable selection and supervised regression. In this paper, we extend Lasso to multiple output prediction, which belongs to the categories of structured learning. Though structured learning makes use of both input and output simultaneously, the joint feature mapping in current framework of structured learning is usually application-specific. As a result, ad hoc heuristics have to be employed to design different joint feature mapping functions for different applications, which results in the lackness of generalization ability for multiple output prediction. To address this limitation, in this paper, we propose to augment Lasso with output by decoupling the joint feature mapping function of traditional structured learning. The contribution of this paper is three-fold: 1) The augmented Lasso conducts regression and variable selection on both the input and output features, and thus the learned model could fit an output with both the selected input variables and the other correlated outputs. 2) To be more general, we set up nonlinear dependencies among output variables by generalized Lasso. 3) Moreover, the Augmented Lagrangian Method (ALM) with Alternating Direction Minimizing (ADM) strategy is used to find the optimal model parameters. The extensive experimental results demonstrate the effectiveness of the proposed method.
As a new Internet architecture, Named Data Networking (NDN) decouples location from the data itself to achieve security, scalability, and mobility. Although router-side data caching used in NDN reduces data acquisitio...
详细信息
As a new Internet architecture, Named Data Networking (NDN) decouples location from the data itself to achieve security, scalability, and mobility. Although router-side data caching used in NDN reduces data acquisition delay, it introduces a new copyright protection challenge: how to prevent unauthorized users to retrieve data cached in routers that are out of the control of its publisher? Current approaches that rely on a common encryption key among authorized users cannot protect copyright well since if one authorized user secretly leaks the key, we cannot tell who has leaked the key out. In this paper, we present a split-based scheme to solve this copyright protection problem for large-sized data. The data is split into a large part that could be cached in routers for all users to retrieve, and a small part that is unique for each authorized user. This scheme exploits the fact that in the bit-wise OR operation, both bit 0 and bit 1 can OR with 1 to generate the same result of bit 1. The analysis of our scheme shows that it has a good performance in terms of copyright protection, data retrieval efficiency, and overhead.
Textile image segmentation is widely used in textile industry design, since users often need to reconstruct and redesign the patterns of the textile image. Different from traditional image segmentation methods, this p...
详细信息
Textile image segmentation is widely used in textile industry design, since users often need to reconstruct and redesign the patterns of the textile image. Different from traditional image segmentation methods, this paper focused on handling textile images, which received little attention until now. Taking into account the characteristics of textile, this paper proposed a novel graph theory and region merging strategy based textile image segmentation method. Our method first generated the over-segmented image by applying the graph-based image segmentation on the original image. Then we extracted the predominant color to mark the background segments. The region action graph was proposed to improve the conventional region adjacency graph before building the region relation graph for the following region merging. It can greatly improve the segmentation quality since textile image usually includes the regions with complex distribution of different colors. In the phase of region merging, we formulated it as designing merging criterions for the relate regions with geometry properties, such as globalist, locality, and spatial continuity. Extensive experiments were performed and the results showed that our method can reliably segment the textile images into sections with perceptual meaning. Additionally, our method is simple and efficient, with great potential in practical applications.
Servers and network contribute about 60% to the total cost of data center in cloud computing. How to efficiently place virtual machines so that the cost can be saved as much as possible, while guaranteeing the quality...
详细信息
ISBN:
(纸本)9781479975761
Servers and network contribute about 60% to the total cost of data center in cloud computing. How to efficiently place virtual machines so that the cost can be saved as much as possible, while guaranteeing the quality of service plays a critical role in enhancing the competitiveness of service cloud provider. Considering the heterogeneous servers and the random property of multiple resources requirements of virtual machines, the problem is formulated as a multi-objective nonlinear programming in this paper. Virtual machine cluster with higher traffic is made staying together. This reduces the communication delay while saving the inter-server bandwidth consumption, especially the relatively scarce higher level bandwidth, by exploiting the topology information of data center. At the same time, statistic multiplex and newly defined “similarity” techniques are leveraged to consolidate virtual machines. The violation of resource capacity is kept at any designated minimal probability. Thus the quality of service will not be deteriorated while saving servers and network cost. An offline and an online algorithms are proposed to address this problem. Experiments compared with several baseline algorithms show the validity of the new algorithms: more cost is cut down at less computation effort.
Proving an information inequality is a crucial step in establishing the converse results in coding theorems. However, an information inequality involving many random variables is difficult to be proved manually. In [1...
详细信息
Proving an information inequality is a crucial step in establishing the converse results in coding theorems. However, an information inequality involving many random variables is difficult to be proved manually. In [1], Yeung developed a framework that uses linear programming for verifying linear information inequalities. Under this framework, this paper considers a few other problems that can be solved by using Lagrange duality and convex approximation. We will demonstrate how linear programming can be used to find an analytic proof of an information inequality. The way to find a shortest proof is explored. When a given information inequality cannot be proved, the sufficient conditions for a counterexample to disprove the information inequality are found by linear programming.
Statistics of colour value of each pixel in the image are output in traditional colour histograms. Therefore, though the two same images photographed in different illuminations are consistent in colour content, they h...
详细信息
Statistics of colour value of each pixel in the image are output in traditional colour histograms. Therefore, though the two same images photographed in different illuminations are consistent in colour content, they have different colour distributions in the histograms. To solve the problem, this paper introduces an illumination invariance colour index algorithm based on colour ratio. According to the colour constancy theory, although colour values of its pixels will be changed once the image is subject to illumination, colour ratios remain unchanged. Colour ratio refers to the ratio between two contiguous pixels. As per colour ratios, colour ratio image may be obtained, which depicts obvious boundaries or margins of the image content so that we statistics of colour ratio histogram can be obtained as an index mechanism to remove illumination effect. Verified by lots of tests, this method can extract useful colour characteristics and remove illumination effect, so that it can be practically used in effective computer recognition of objects in traffic videos.
If potential contributors leading to system failure can be identified when a scientific workflow is modelled, a lot of system vulnerabilities may thus be revealed and improved. In this paper, we first use data depende...
详细信息
暂无评论