نتایج جستجو برای: convex func tions
تعداد نتایج: 60921 فیلتر نتایج به سال:
abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...
The effects of varying doses of three polycyclic aromatic hydrocarbons, 3-methylcholanthrene (MCA), benzo(a)pyrene (BaP), and benzo(e)pyrene (BeP), on cell-mediated immune func tions of in vivo mitogen-activated splenic lymphocytes were measured. Inbred mice (C57, C3H, and DBA) were given injec tions i.p. with phytohemagglutinin to activate splenic lympho cytes and were subsequently treated, vi...
A general trend in the development of distributed 1 convex optimization procedures is to robustify existing algo2 rithms so that they can tolerate the characteristics and condi3 tions of communications among real devices. This manuscript 4 follows this tendency by robustifying a promising distributed 5 convex optimization procedure known as Newton-Raphson 6 consensus. More specifically, we modi...
AB STRACT: The pur pose of this study was to eval u ate, in vi tro, the prop er ties (wear and rough ness) of glass ionomer ce ments that could in flu ence their in di ca tion as pit and fis sure seal ants. The uti lized ma te ri als were Fuji Plus, Ketac-Mo lar and Vitremer (in two dif fer ent pro por tions: 1:1 and 1⁄4:1). The resin-based seal ant Delton was used as con trol. By means of an e...
The research re ected in this dissertation is a study of computational pseudo randomness More speci cally the main objective of this research is the e cient and simple construction of pseudo random functions and permutations where e ciency refers both to the sequential and parallel time complexity of the computation Pseudo random functions and permutations are fundamental cryptographic primitiv...
BD-Func (BiDirectional FUNCtional enrichment) is an algorithm that calculates functional enrichment by comparing lists of pre-defined genes that are known to be activated versus inhibited in a pathway or by a regulatory molecule. This paper shows that BD-Func can correctly predict cell line alternations and patient characteristics with accuracy comparable to popular algorithms, with a significa...
This paper analyzes irrelevance and independence re lations in graphical models associated with convex sets of probability distributions (called Quasi-Bayesian networks) . The basic question in Quasi-Bayesian networks is, How can irrelevance/independence rela tions in Quasi-Bayesian networks be detected, enforced and exploited? This paper addresses these questions through Walley's definitions...
In an incomplete Brownian-motion market setting, we propose a convex monotonic pricing functional for nonattainable bounded contingent claims which is compatible with prices for attainable claims. The pricing functional is defined as the convex conjugate of a generalized entropy penalty functional and an interpretation in terms of tracking with instantaneously vanishing risk can be given. 1. In...
In this paper, we consider several types of in formation and methods of combination asso ciated with incomplete probabilistic systems. \Ve discriminate between 'a priori' and evi dential information. The former one is a de scription of the whole population, the latest is a restriction based on observations for a particular case. Then, we proposse different combination methods for each one o...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید