31 research outputs found

    A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE

    No full text
    An inverse optimization problem is defined as follows. Let S denote the set of feasible solutions of an optimization problem P, let c be a specified cost (capacity) vector, and x0 ∈ S. We want to perturb the cost (capacity) vector c to d so that x0 is an optimal solution of P with respect to the cost (capacity) vector d, and to minimize some objective function. In this paper, we consider the weighted inverse minimum cut problem under the bottleneck type Hamming distance. For the general case, we present a combinatorial algorithm that runs in strongly polynomial time.Minimum cut, inverse problem, hamming distance, strongly polynomial algorithm

    Weighted inverse maximum perfect matching problems under the Hamming distance

    No full text
    National Natural Science Foundation of China [11001232]; Fundamental Research Funds for the Central Universities [2010121004]Given an undirected network G(V, E, c) and a perfect matching M (0), the inverse maximum perfect matching problem is to modify the cost vector as little as possible such that the given perfect matching M (0) can form a maximum perfect matching. The modification can be measured by different norms. In this paper, we consider the weighted inverse maximum perfect matching problems under the Hamming distance, where we use the weighted Hamming distance to measure the modification of the edges. We consider both of the sum-type and the bottleneck-type problems. For the general case of the sum-type case, we show it is NP-hard. For the bottleneck-type, we present a strongly polynomial algorithm which can be done in O(m center dot n (3))

    Minimizing the maximum bump cost in linear extensions of a poset

    No full text
    National Nature Science Foundation of China [10971191, 11001232]; Fundamental Research Funds for the Central Universities [2010121004]; Department of Education of Zhejiang Province of China [Y200909535]A linear extension of a poset P=(X,a parts per thousand(0)) is a permutation x (1),x (2),aEuro broken vertical bar,x (|X|) of X such that i < j whenever x (i) a parts per thousand(0)x (j) . For a given poset P=(X,a parts per thousand(0)) and a cost function c(x,y) defined on XxX, we want to find a linear extension of P such that maximum cost is as small as possible. For the general case, it is NP-complete. In this paper we consider the linear extension problem with the assumption that c(x,y)=0 whenever x and y are incomparable. First, we prove the discussed problem is polynomially solvable for a special poset. And then, we present a polynomial algorithm to obtain an approximate solution

    Delta Radiomics Model Predicts Lesion-Level Responses to Tyrosine Kinase Inhibitors in Patients with Advanced Renal Cell Carcinoma: A Preliminary Result

    No full text
    Background: This study aimed to develop and internally validate computed tomography (CT)-based radiomic models to predict the lesion-level short-term response to tyrosine kinase inhibitors (TKIs) in patients with advanced renal cell carcinoma (RCC). Methods: This retrospective study included consecutive patients with RCC that were treated using TKIs as the first-line treatment. Radiomic features were extracted from noncontrast (NC) and arterial-phase (AP) CT images. The model performance was assessed using the area under the receiver operating characteristic curve (AUC), calibration curve, and decision curve analysis (DCA). Results: A total of 36 patients with 131 measurable lesions were enrolled (training: validation = 91: 40). The model with five delta features achieved the best discrimination capability with AUC values of 0.940 (95% CI, 0.890‒0.990) in the training cohort and 0.916 (95% CI, 0.828‒1.000) in the validation cohort. Only the delta model was well calibrated. The DCA showed that the net benefit of the delta model was greater than that of the other radiomic models, as well as that of the treat-all and treat-none criteria. Conclusions: Models based on CT delta radiomic features may help predict the short-term response to TKIs in patients with advanced RCC and aid in lesion stratification for potential treatments

    Delta Radiomics Model Predicts Lesion-Level Responses to Tyrosine Kinase Inhibitors in Patients with Advanced Renal Cell Carcinoma: A Preliminary Result

    No full text
    Background: This study aimed to develop and internally validate computed tomography (CT)-based radiomic models to predict the lesion-level short-term response to tyrosine kinase inhibitors (TKIs) in patients with advanced renal cell carcinoma (RCC). Methods: This retrospective study included consecutive patients with RCC that were treated using TKIs as the first-line treatment. Radiomic features were extracted from noncontrast (NC) and arterial-phase (AP) CT images. The model performance was assessed using the area under the receiver operating characteristic curve (AUC), calibration curve, and decision curve analysis (DCA). Results: A total of 36 patients with 131 measurable lesions were enrolled (training: validation = 91: 40). The model with five delta features achieved the best discrimination capability with AUC values of 0.940 (95% CI, 0.890&#8210;0.990) in the training cohort and 0.916 (95% CI, 0.828&#8210;1.000) in the validation cohort. Only the delta model was well calibrated. The DCA showed that the net benefit of the delta model was greater than that of the other radiomic models, as well as that of the treat-all and treat-none criteria. Conclusions: Models based on CT delta radiomic features may help predict the short-term response to TKIs in patients with advanced RCC and aid in lesion stratification for potential treatments

    Weighted inverse minimum cut problem under the sum-type hamming distance

    No full text
    Conference Name:6th International Frontiers of Algorithmics Workshop, FAW 2012 and 8th International Conference on Algorithmic Aspects of Information and Management, AAIM 2012. Conference Address: Beijing, China. Time:May 14, 2012 - May 16, 2012.An inverse optimization problem is defined as follows: Let S denote the set of feasible solutions of an optimization problem P, let c be a specified cost (capacity) vector, and x0 鈭?S. We want to perturb the cost (capacity) vector c to d such that x 0 becomes an optimal solution of P with respect to the cost (capacity) vector d, and to minimize some objective functions. In this paper, we consider the weighted inverse minimum cut problem under the sum-type Hamming distance. First, we show the general case is NP-hard. Second we present a combinatorial algorithm that run in strongly polynomial time to solve a special case. 漏 2012 Springer-Verlag

    A Study on a Novel Phase Change Material Panel Based on Tetradecanol/Lauric Acid/Expanded Perlite/Aluminium Powder for Building Heat Storage

    No full text
    Phase change material (PCM) used in buildings can reduce the building energy consumption and indoor temperature fluctuation. A composite PCM has been fabricated by the binary eutectic mixture of tetradecanol (TD) and lauric acid (LA) absorbed into the expanded perlite (EP) using vacuum impregnation method, and its thermal conductivity was promoted by aluminium powder (AP) additive. Besides, the styrene-acrylic emulsion has been mixed with the composite PCM particles to form the protective film, so as to solve the problem of leakage. Thus, a novel PCM panel (PCMP) has been prepared using compression moulding forming method. The thermal property, microstructure characteristic, mechanical property, thermal conductivity, thermal reliability and leakage of the composite PCM have been investigated and analysed. Meanwhile, the thermal performance of the prepared PCMP was tested through PCMPs installed on the inside wall of a cell under outdoor climatic conditions. The composite PCM has a melting temperature of 24.9 °C, a freezing temperature of 25.2 °C, a melting latent heat of 78.2 J/g and a freezing latent heat of 81.3 J/g. The thermal conductivity test exposed that the thermal conductivity has been enhanced with the addition of AP and the latent heat has been decreased, but it still remains in a high level. The leakage test result has proven that liquid PCM leaking has been avoided by the surface film method. The thermal performance experiment has shown the significant function of PCMP about adjusting the indoor temperature and reducing the heats transferring between the wall inside and outside. In view of the thermal performance, mechanical property and thermal reliability results, it can be concluded that the prepared PCMP has a promising building application potential
    corecore