Minimizing unsatisfaction in colourful neighbourhoods

Colouring sparse graphs under various restrictions is a theoretical problem of significant practical relevance. Here we consider the problem of maximizing the number of different colours available at the nodes and their neighbourhoods, given a predetermined number of colours. In the analytical framework of a tree approximation, carried out at both zero and finite temperatures, solutions obtained by population dynamics give rise to estimates of the threshold connectivity for the incomplete to complete transition, which are consistent with those of existing algorithms. The nature of the transition as well as the validity of the tree approximation are investigated.

Minimizing nasty surprises with better informed decision-making in self-adaptive systems

Designers of self-adaptive systems often formulate adaptive design decisions, making unrealistic or myopic assumptions about the system's requirements and environment. The decisions taken during this formulation are crucial for satisfying requirements. In environments which are characterized by uncertainty and dynamism, deviation from these assumptions is the norm and may trigger 'surprises'. Our method allows designers to make explicit links between the possible emergence of surprises, risks and design trade-offs. The method can be used to explore the design decisions for self-adaptive systems and choose among decisions that better fulfil (or rather partially fulfil) non-functional requirements and address their trade-offs. The analysis can also provide designers with valuable input for refining the adaptation decisions to balance, for example, resilience (i.e. Satisfiability of non-functional requirements and their trade-offs) and stability (i.e. Minimizing the frequency of adaptation). The objective is to provide designers of self adaptive systems with a basis for multi-dimensional what-if analysis to revise and improve the understanding of the environment and its effect on non-functional requirements and thereafter decision-making. We have applied the method to a wireless sensor network for flood prediction. The application shows that the method gives rise to questions that were not explicitly asked before at design-time and assists designers in the process of risk-aware, what-if and trade-off analysis.

On Minimizing ||S−(AX−XB)||Pp

In this paper, we minimize the map Fp (X)= ||S−(AX−XB)||Pp , where the pair (A, B) has the property (F P )Cp , S ∈ Cp , X varies such that AX − XB ∈ Cp and Cp denotes the von Neumann-Schatten class.

Sequencing Jobs with Uncertain Processing Times and Minimizing the Weighted Total Flow Time

We consider an uncertain version of the scheduling problem to sequence set of jobs J on a single machine with minimizing the weighted total flow time, provided that processing time of a job can take on any real value from the given closed interval. It is assumed that job processing time is unknown random variable before the actual occurrence of this time, where probability distribution of such a variable between the given lower and upper bounds is unknown before scheduling. We develop the dominance relations on a set of jobs J. The necessary and sufficient conditions for a job domination may be tested in polynomial time of the number n = |J| of jobs. If there is no a domination within some subset of set J, heuristic procedure to minimize the weighted total flow time is used for sequencing the jobs from such a subset. The computational experiments for randomly generated single-machine scheduling problems with n ≤ 700 show that the developed dominance relations are quite helpful in minimizing the weighted total flow time of n jobs with uncertain processing times.

A PVT-Type Algorithm for Minimizing a Nonsmooth Convex Function

2000 Mathematics Subject Classification: 90C25, 68W10, 49M37.

Solvency risk minimizing guaranteed returns in life insurance

Return guarantee constitutes a key ingredient of classical life insurance premium calculation. In the current low interest rate environment insurers face increasingly strong financial incentives to reduce guaranteed returns embedded in life insurance contracts. However, return guarantee lowering efforts are restrained by associated demand effects, since a higher guaranteed return makes the net price of the insurance cover lower. This tradeoff between possibly higher future insurance obligations and the possibility of a larger demand for life insurance products can theoretically also be considered when determining optimal guaranteed returns. In this paper, optimality of return guarantee levels is analyzed from a solvency point of view. Availability and some other properties of optimal solutions for guaranteed returns are explored and compared in a simple model for two measures of solvency risk (company-level and contract-level VaR). The paper concludes that a solvency risk minimizing optimal guaranteed return may theoretically exist, although its practical availability can be impeded by economic and regulatory constraints.

Minimizing makespan for hybrid flowshops with batch, discrete processing machines and arbitrary job sizes

This research aims at a study of the hybrid flow shop problem which has parallel batch-processing machines in one stage and discrete-processing machines in other stages to process jobs of arbitrary sizes. The objective is to minimize the makespan for a set of jobs. The problem is denoted as: FF: batch1,sj:Cmax. The problem is formulated as a mixed-integer linear program. The commercial solver, AMPL/CPLEX, is used to solve problem instances to their optimality. Experimental results show that AMPL/CPLEX requires considerable time to find the optimal solution for even a small size problem, i.e., a 6-job instance requires 2 hours in average. A bottleneck-first-decomposition heuristic (BFD) is proposed in this study to overcome the computational (time) problem encountered while using the commercial solver. The proposed BFD heuristic is inspired by the shifting bottleneck heuristic. It decomposes the entire problem into three sub-problems, and schedules the sub-problems one by one. The proposed BFD heuristic consists of four major steps: formulating sub-problems, prioritizing sub-problems, solving sub-problems and re-scheduling. For solving the sub-problems, two heuristic algorithms are proposed; one for scheduling a hybrid flow shop with discrete processing machines, and the other for scheduling parallel batching machines (single stage). Both consider job arrival and delivery times. An experiment design is conducted to evaluate the effectiveness of the proposed BFD, which is further evaluated against a set of common heuristics including a randomized greedy heuristic and five dispatching rules. The results show that the proposed BFD heuristic outperforms all these algorithms. To evaluate the quality of the heuristic solution, a procedure is developed to calculate a lower bound of makespan for the problem under study. The lower bound obtained is tighter than other bounds developed for related problems in literature. A meta-search approach based on the Genetic Algorithm concept is developed to evaluate the significance of further improving the solution obtained from the proposed BFD heuristic. The experiment indicates that it reduces the makespan by 1.93 % in average within a negligible time when problem size is less than 50 jobs.

A bidding strategy for minimizing the imbalances costs for renewable generators in Spanish power markets

The aim of this paper is to suggest a simple methodology to be used by renewable power generators to bid in Spanish markets in order to minimize the cost of their imbalances. As it is known, the optimal bid depends on the probability distribution function of the energy to produce, of the probability distribution function of the future system imbalance and of its expected cost. We assume simple methods for estimating any of these parameters and, using actual data of 2014, we test the potential economic benefit for a wind generator from using our optimal bid instead of just the expected power generation. We find evidence that Spanish wind generators savings would be from 7% to 26%.

Daunorubicin and gambogic acid co-loaded cysteamine-CdTe quantum dots minimizing the multidrug resistance of lymphoma in vitro and in vivo

To minimize the side effects and the multidrug resistance (MDR) arising from daunorubicin (DNR) treatment of malignant lymphoma, a chemotherapy formulation of cysteamine-modified cadmium tellurium (Cys-CdTe) quantum dots coloaded with DNR and gambogic acid (GA) nanoparticles (DNR-GA-Cys-CdTe NPs) was developed. The physical property, drug-loading efficiency and drug release behavior of these DNR-GA-Cys-CdTe NPs were evaluated, and their cytotoxicity was explored by 3-[4,5-dimethylthiazol-2-y1]-2,5-diphenyltetrazolium bromide assay. These DNR-GA-Cys-CdTe NPs possessed a pH-responsive behavior, and displayed a dose-dependent antiproliferative activity on multidrug-resistant lymphoma Raji/DNR cells. The accumulation of DNR inside the cells, revealed by flow cytometry assay, and the down-regulated expression of P-glycoprotein inside the Raji/DNR cells measured by Western blotting assay indicated that these DNR-GA-Cys-CdTe NPs could minimize the MDR of Raji/DNR cells. This multidrug delivery system would be a promising strategy for minimizing MDR against the lymphoma.

Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment

Abstract not available

Diallel analysis in cowpea aiming at selection for extra-earliness.

In Brazil, the production of cowpea is concentrated in the Northeast and North; however, in recent years, its cultivation has expanded to the Cerrado biome of the Brazilian Midwest region, where it is incorporated into production arrangements in the form of off-season

Preservation Of The External Jugular Vein In Bilateral Radical Neck Dissections: Technique In Two Cases And Review Of The Literature.

Context. The possibility of cephalic venous hypertension with the resultant facial edema and elevated cerebrospinal fluid pressure continues to challenge head and neck surgeons who perform bilateral radical neck dissections during simultaneous or staged procedures. Case Report. The staged procedure in patients who require bilateral neck dissections allows collateral venous drainage to develop, mainly through the internal and external vertebral plexuses, thereby minimizing the risks of deleterious consequences. Nevertheless, this procedure has disadvantages, such as a delay in definitive therapy, the need for a second hospitalization and anesthesia, and the risk of cutting lymphatic vessels and spreading viable cancer cells. In this paper, we discuss the rationale and feasibility of preserving the external jugular vein. Considering the limited number of similar reports in the literature, two cases in which this procedure was accomplished are described. The relevant anatomy and technique are reviewed and the patients' outcomes are discussed. Conclusion. Preservation of the EJV during bilateral neck dissections is technically feasible, fast, and safe, with clinically and radiologically demonstrated patency.

Comparing Near-infrared Conventional Diffuse Reflectance Spectroscopy And Hyperspectral Imaging For Determination Of The Bulk Properties Of Solid Samples By Multivariate Regression: Determination Of Mooney Viscosity And Plasticity Indices Of Natural Rubber.

Conventional reflectance spectroscopy (NIRS) and hyperspectral imaging (HI) in the near-infrared region (1000-2500 nm) are evaluated and compared, using, as the case study, the determination of relevant properties related to the quality of natural rubber. Mooney viscosity (MV) and plasticity indices (PI) (PI0 - original plasticity, PI30 - plasticity after accelerated aging, and PRI - the plasticity retention index after accelerated aging) of rubber were determined using multivariate regression models. Two hundred and eighty six samples of rubber were measured using conventional and hyperspectral near-infrared imaging reflectance instruments in the range of 1000-2500 nm. The sample set was split into regression (n = 191) and external validation (n = 95) sub-sets. Three instruments were employed for data acquisition: a line scanning hyperspectral camera and two conventional FT-NIR spectrometers. Sample heterogeneity was evaluated using hyperspectral images obtained with a resolution of 150 × 150 μm and principal component analysis. The probed sample area (5 cm(2); 24,000 pixels) to achieve representativeness was found to be equivalent to the average of 6 spectra for a 1 cm diameter probing circular window of one FT-NIR instrument. The other spectrophotometer can probe the whole sample in only one measurement. The results show that the rubber properties can be determined with very similar accuracy and precision by Partial Least Square (PLS) regression models regardless of whether HI-NIR or conventional FT-NIR produce the spectral datasets. The best Root Mean Square Errors of Prediction (RMSEPs) of external validation for MV, PI0, PI30, and PRI were 4.3, 1.8, 3.4, and 5.3%, respectively. Though the quantitative results provided by the three instruments can be considered equivalent, the hyperspectral imaging instrument presents a number of advantages, being about 6 times faster than conventional bulk spectrometers, producing robust spectral data by ensuring sample representativeness, and minimizing the effect of the presence of contaminants.