A PVT-Type Algorithm for Minimizing a Nonsmooth Convex Function

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

On Blocking Sets in Affine Hjelmslev Planes

ACM Computing Classification System (1998): G.2.1.

On Pareto Sets in Multi-Criteria Optimization

Здравко Д. Славов - В тази работа се разглеждат Паретовските решения в непрекъсната многокритериална оптимизация. Обсъжда се ролята на някои предположения, които влияят на характеристиките на Паретовските множества. Авторът се е опитал да премахне предположенията за вдлъбнатост на целевите функции и изпъкналост на допустимата област, които обикновено се използват в многокритериалната оптимизация. Резултатите са на базата на конструирането на ретракция от допустимата област върху Парето-оптималното множество.

Evolution of Sets Systems and Homotopy Groups of Spheres

Симеон Т. Стефанов, Велика И. Драгиева - В работата е изследвана еволюцията на системи от множества върху n-мерната евклидова сфера S^n. Установена е връзката на такива системи с хомотопичните групи на сферите. Получени са някои комбинаторни приложения за многостени.

On the Algebraic Properties of Convex Bodies

AMS subject classification: 52A01, 13C99.

Densities with Spherical Level Sets in the Gauss-exponential Domain

2000 Mathematics Subject Classification: 60F05, 60B10.

Does Atkinson-Wilcox Expansion Converges for any Convex Domain?

2000 Mathematics Subject Classification: 35C10, 35C20, 35P25, 47A40, 58D30, 81U40.

Approximation of Univariate Set-Valued Functions - an Overview

2000 Mathematics Subject Classification: 26E25, 41A35, 41A36, 47H04, 54C65.

Some Fixed Point Theorems for Kannan Mappings

2000 Mathematics Subject Classification: Primary: 47H10; Secondary: 54H25.

Why (and When) are Preferences Convex? Threshold Effects and Uncertain Quality

It is often assumed (for analytical convenience, but also in accordance with common intuition) that consumer preferences are convex. In this paper, we consider circumstances under which such preferences are (or are not) optimal. In particular, we investigate a setting in which goods possess some hidden quality with known distribution, and the consumer chooses a bundle of goods that maximizes the probability that he receives some threshold level of this quality. We show that if the threshold is small relative to consumption levels, preferences will tend to be convex; whereas the opposite holds if the threshold is large. Our theory helps explain a broad spectrum of economic behavior (including, in particular, certain common commercial advertising strategies), suggesting that sensitivity to information about thresholds is deeply rooted in human psychology.

The Filippov-Wazewski relaxation theorem revisited

The converse statement of the Filippov-Wazewski relaxation theorem is proven, more precisely, two differential inclusions have the same closure of their solution sets if and only if the right-hand sides have the same convex hull. The idea of the proof is examining the contingent derivatives to the attainable sets.

Convex and exact games with non-transferable utility

We generalize exactness to games with non-transferable utility (NTU). A game is exact if for each coalition there is a core allocation on the boundary of its payoff set. Convex games with transferable utility are well-known to be exact. We consider ve generalizations of convexity in the NTU setting. We show that each of ordinal, coalition merge, individual merge and marginal convexity can be uni¯ed under NTU exactness. We provide an example of a cardinally convex game which is not NTU exact. Finally, we relate the classes of Π-balanced, totally Π-balanced, NTU exact, totally NTU exact, ordinally convex, cardinally convex, coalition merge convex, individual merge convex and marginal convex games to one another.

A cardinally convex game with empty core

In this note we present a cardinally convex game (Sharkey, 1981) with empty core. Sharkey assumes that V (N) is convex, we do not do so, hence we do not contradict Sharkey's result.

The application of reduced-size short tandem repeat primer sets in the analysis of human DNA from degraded and compromised samples

The purpose of this research was to demonstrate the applicability of reduced-size STR (Miniplex) primer sets to challenging samples and to provide the forensic community with new information regarding the analysis of degraded and inhibited DNA. The Miniplex primer sets were validated in accordance with guidelines set forth by the Scientific Working Group on DNA Analysis Methods (SWGDAM) in order to demonstrate the scientific validity of the kits. The Miniplex sets were also used in the analysis of DNA extracted from human skeletal remains and telogen hair. In addition, a method for evaluating the mechanism of PCR inhibition was developed using qPCR. The Miniplexes were demonstrated to be a robust and sensitive tool for the analysis of DNA with as low as 100 pg of template DNA. They also proved to be better than commercial kits in the analysis of DNA from human skeletal remains, with 64% of samples tested producing full profiles, compared to 16% for a commercial kit. The Miniplexes also produced amplification of nuclear DNA from human telogen hairs, with partial profiles obtained from as low as 60 pg of template DNA. These data suggest smaller PCR amplicons may provide a useful alternative to mitochondrial DNA for forensic analysis of degraded DNA from human skeletal remains, telogen hairs, and other challenging samples. In the evaluation of inhibition by qPCR, the effect of amplicon length and primer melting temperature was evaluated in order to determine the binding mechanisms of different PCR inhibitors. Several mechanisms were indicated by the inhibitors tested, including binding of the polymerase, binding to the DNA, and effects on the processivity of the polymerase during primer extension. The data obtained from qPCR illustrated a method by which the type of inhibitor could be inferred in forensic samples, and some methods of reducing inhibition for specific inhibitors were demonstrated. An understanding of the mechanism of the inhibitors found in forensic samples will allow analysts to select the proper methods for inhibition removal or the type of analysis that can be performed, and will increase the information that can be obtained from inhibited samples.

Surprises and Insights from Long-Term Aquatic Data Sets and Experiments

long-term research on freshwater ecosystems provides insights that can be difficult to obtain from other approaches. Widespread monitoring of ecologically relevant water-quality parameters spanning decades can facilitate important tests of ecological principles. Unique long-term data sets and analytical tools are increasingly available, allowing for powerful and synthetic analyses across sites. long-term measurements or experiments in aquatic systems can catch rare events, changes in highly variable systems, time-lagged responses, cumulative effects of stressors, and biotic responses that encompass multiple generations. Data are available from formal networks, local to international agencies, private organizations, various institutions, and paleontological and historic records; brief literature surveys suggest much existing data are not synthesized. Ecological sciences will benefit from careful maintenance and analyses of existing long-term programs, and subsequent insights can aid in the design of effective future long-term experimental and observational efforts. long-term research on freshwaters is particularly important because of their value to humanity.