Visceral Obesity and Its Shared Role in Cancer and Cardiovascular Disease: A Scoping Review of the Pathophysiology and Pharmacological Treatments

The association between obesity, cancer and cardiovascular disease (CVD) has been demonstrated in animal and epidemiological studies. However, the specific role of visceral obesity on cancer and CVD remains unclear. Visceral adipose tissue (VAT) is a complex and metabolically active tissue, that can produce different adipokines and hormones, responsible for endocrine-metabolic comorbidities. This review explores the potential mechanisms related to VAT that may also be involved in cancer and CVD. In addition, we discuss the shared pharmacological treatments which may reduce the risk of both diseases. This review highlights that chronic inflammation, molecular aspects, metabolic syndrome, secretion of hormones and adiponectin associated to VAT may have synergistic effects and should be further studied in relation to cancer and CVD. Reductions in abdominal and visceral adiposity improve insulin sensitivity, lipid profile and cytokines, which consequently reduce the risk of CVD and some cancers. Several medications have shown to reduce visceral and/or subcutaneous fat. Further research is needed to investigate the pathophysiological mechanisms by which visceral obesity may cause both cancer and CVD. The role of visceral fat in cancer and CVD is an important area to advance. Public health policies to increase public awareness about VAT’s role and ways to manage or prevent it are needed.     

Quantum Dots-Based Optical Fiber Temperature Sensors Fabricated by Layer-by-Layer

Two types of CdTe quantum dots of different sizes (4 and 5 nm) were successfully deposited on optical fibers using the layer-by-layer electrostatic self-assembly method. The sensors showed a linear and reversible variation of the emission wavelength for a temperature range from 30 degC to 100 degC, with a sensitivity of 0.2 nm/degC     

Truthful Approximation Mechanisms for Scheduling Selfish Related Machines

We consider the problem of scheduling jobs on related machines owned by selfish agents. We provide a 5-approximation deterministic truthful mechanism, the first deterministic truthful result for the problem. Previously, Archer and Tardos showed a 2-approximation randomized mechanism which is truthful in expectation only (a weaker notion of truthfulness). In case the number of machines is constant, we provide a deterministic Fully Polynomial-Time Approximation Scheme (FPTAS) and a suitable payment scheme that yields a truthful mechanism for the problem. This result, which is based on converting FPTAS to monotone FPTAS, improves a previous result of Auletta et al., who showed a (4 + ε)-approximation truthful mechanism.     

Are max-specified infant facial expressions during face-to-face interaction consistent with differential emotions theory?

Differential emotions theory (DET) proposes that infant facial expressions of emotions are differentiated. To test this hypothesis, the authors examined infant facial expressions longitudinally at 2, 4, and 6 mo of age during face-to-face play and a "still-face" interaction with their mothers. Infant expressions were coded using the Maximally Discriminative Facial Movement Coding System (Max). Consistent with DET, discrete positive expressions occurred more of the time and were of longer duration than blended expressions of positive affect. Contrary to DET, at no age did the proportions or durations of discrete and blended negative expressions differ, and they showed different patterns of developmental change. One is led to either reject or revise DET or else question the adequacy of the Max system. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Randomized range-maxima in nearly-constant parallel time

Given an array ofn input numbers, therange-maxima problem is that of preprocessing the data so that queries of the type what is the maximum value in subarray [i..j] can be answered quickly using one processor. We present a randomized preprocessing algorithm that runs inO(log^* n) time with high probability, using an optimal number of processors on a CRCW PRAM; each query can be processed in constant time by one processor. We also present a randomized algorithm for a parallel comparison model. Using an optimal number of processors, the preprocessing algorithm runs inO( (n)) time with high probability; each query can be processed inO ( (n)) time by one processor. (As is standard, (n) is the inverse of Ackermann function.) A constant time query can be achieved by some slowdown in the performance of the preprocessing stage.     

Capacity of the electric double layer in molten NaAlCl4

The capacity of the electric double layer at the interfaces Hg/molten NaAlCl₄ and Pt/molten NaAlCl₄ was determined and the influence of the surface-active substances tetramethylammonium chloride and urea was investigated. The dependence of the capacity on the electrode potential was found to agree with a model proposed by Parsons.     

Edge detection and characterization of digitized images

Pattern Analysis and Applications - We present a method for determining which of a large set of pixels are inside or on the boundary of a polygon. The method works much quicker than the standard...