The article is written in a popular science convention. It concerns issues related to generally understood issues that are involved in explaining the principles of the impact of the measure-ment beam in spectrophotometric research. To explain this, we need to answer basic ques-tions about what a photon is? What is wave-particle dualism? What do chemical bonds look like? What conditions must be met for a photon to be adsorbed by a chemical moiety? There are many inaccuracies in the current theories that do not explain the observed phenomena. The phenomenological models of the photon and chemical bonds that I have created are in-tended to explain photoelectric and optical phenomena that are not explained by either the wave or particle nature of photons. There is also no clear model of chemical bonds that would explain the phenomena observed in spectrophotometry. Phenomenological considerations are accompanied by several physical considerations and calculations in order to illustrate certain phenomena and proportions prevailing on the atomic scale. The above considerations are of a debatable nature and are an attempt to break away from stereotypical concepts operating in the world of science. Spectrophotometry is an analytical method that combines theories about photons, the structure of matter and phenomena that concern their mutual interactions. The phenomena visible in it can be interpreted more easily using my phenomenological image of matter.
The aim of this study is to establish the sufficient higher-order KKT (Karush Kuhn Tucker) criteria of optimality for a set-valued fractional-type optimization problem (SFP) (FP). Under the presumptions of higher-order contingent epi-derivative and higher-order κ-arcwisely connectedness, these requirements are derived. We also look into the effects of these constraints on the higherorder duality of Mond-Weir (MWD), Wolfe (WD), and mixed (MD) kinds.
In this paper, we consider the class of nondifferentiable multiobjective fractional variational control problems involving the nondifferentiable terms in the numerators and in the denominators. Under univexity and generalized univexity hypotheses, we prove optimality conditions and various duality results for such nondifferentiable multiobjective fractional variational control problems. The results established in the paper generalize many similar results established earlier in the literature for such nondifferentiable multiobjective fractional variational control problems.
This paper describes modified robust algorithms for a line clipping by a convex polygon in, E2 and a convex polyhedron in E3. The proposed algorithm is based on the Cyrus-Beck algorithm and uses homogeneous coordinates to increase the robustness of computation. The algorithm enables computation fully in the projective space using the homogeneous coordinates and the line can be given in the projective space, in general. If the result can remain in projective space, no division operation is needed. It supports the use of vector-vector operations, SSE/AVX instructions, and GPU.
5
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
In this article, we investigate a class of analytic functions defined on the unit open disc U = {z : ∣z∣ < 1}, such that for every f ∈ Pα(β , γ), α > 0, 0 ≤ β ≤ 1, 0 < γ ≤ 1, and ∣z∣ < 1, the inequality Re (…) > 0 holds. We find conditions on the numbers α, β, and γ such that Pα (β, γ) ⊆ SP (λ), for λ ∈ (…), where SP (λ) denotes the set of all λ-spirallike functions. We also make use of Ruscheweyh’s duality theory to derive conditions on the numbers α, β, γ and the real-valued function φ so that the integral operator Vφ(f) maps the set Pα(β, γ) into the set SP (λ), provided φ is non-negative normalized function (…) and (…).
In this paper, we introduce new classes of nonsmooth second-order cone-convex functions and respective generalizations in terms of first and second-order directional derivative. These classes encapsulate several already existing classes of cone-convex functions and their weaker variants. Second-order KKT type sufficient optimality conditions and duality results for a nonsmooth vector optimization problem are proved using these functions. The results have been supported by examples.
Abstract controlled evolution inclusions are revisited in the Banach spaces setting. The existence of solution is established for each selected control. Then, the input–output (or, control-states) multimap is examined and the Lipschitz continuous well posedness is derived. The optimal control of such inclusions handled in terms of a Bolza problem is investigated by means of the so-called PF format of optimization. A strong duality is provided, the existence of an optimal pair is given and the system of optimalty is derived. A Fenchel duality is built and applied to optimal control of convex process of evolution. Finally, it will be shown how the general theory we provided can be applied to a wide class of controled integrodifferental inclusions.
The importance of quasi efficiency lies in its versatile nature as it permits a definite tolerable error that depend on the decision variables. This has been a motivating factor for us to introduce the notion of quasi efficient solution for the non-smooth multiobjective continuous time programming problem. Necessary optimality conditions are derived for this problem. To derive sufficient optimality conditions, the concept of approximate convexity has been extended to continuous case in this paper. A mixed dual is proposed for which weak and strong duality results are proved.
There are several classes of decision-making problems that explicitly or implicitly prompt fractional programming problems. Portfolio selection problems, agricultural planning, information transfer, numerical analysis of stochastic processes, and resource allocation problems are just a few examples. The huge number of applications of minimax fractional programming problems inspired us to work on this topic. This paper is concerned with a nondifferentiable minimax fractional programming problem. We study a parametric dual model, corresponding to the primal problem, and derive the sufficient optimality condition for an optimal solution to the considered problem. Further, we obtain the various duality results under (p, r)-ρ-(η, θ)-invexity assumptions. Also, we identify a function lying exclusively in the class of (−1, 1)-ρ-(η, θ)- invex functions but not in the class of (1,−1)-invex functions and convex function already existing in the literature. We have given a non-trivial model of nondifferentiable minimax problem and obtained its optimal solution using optimality results derived in this paper.
In this paper, we consider a set-valued minimax fractional programming problem (MFP), where the objective as well as constraint maps are set-valued. We introduce the notion of ρ- cone arcwise connectedness of set-valued maps as a generalization of cone arcwise connected set-valued maps. We establish the sufficient Karush-Kuhn-Tucker (KKT) conditions for the existence of minimizers of the problem (MFP) under ρ-cone arcwise connectedness assumption. Further, we study the Mond-Weir (MWD), Wolfe (WD), and mixed (MD) types of duality models and prove the corresponding weak, strong, and converse duality theorems between the primal (MFP) and the corresponding dual problems under ρ-cone arcwise connectedness assumption.
This study aims to examine the relationship of the three characteristics of the board of directors (board size, board independence, and CEO duality) as part of good corporate governance mechanism and its effects on the level of sustainability report disclosure with moderating effect of audit committee. This study underpins Signalling Theory to analyze and explain the role of corporate governance and their association with the management level of disclosure of sustainability report. In this study, 106 samples were taken from 35 companies listed at Indonesia Stock Exchange which disclose sustainability report using GRI G4 during 2013-2017 periods. Board size and board independence was found to have significant negative relationship with the level of sustainability report disclosure. Furthermore, the findings show that the audit committee strengthen the moderating effect of the relationship between board size, CEO duality, and the level of sustainability report disclosure, but weaken the moderating effect of the relationship between board independence and the level of sustainability report disclosure.
PL
Niniejsze badanie ma na celu zbadanie związku trzech cech rady dyrektorów (wielkość zarządu, niezależność zarządu i dualność dyrektora generalnego) w ramach mechanizmu dobrego ładu korporacyjnego i jego wpływ na poziom ujawnienia raportu zrównoważonego rozwoju z moderującym efektem komitet audytu. Niniejsze badanie stanowi podstawę teorii sygnalizacji do analizy i wyjaśnienia roli ładu korporacyjnego i ich związku z poziomem zarządzania ujawnianiem raportu zrównoważonego rozwoju. W tym badaniu pobrano 106 próbek od 35 spółek notowanych na giełdzie w Indonezji, które ujawniają raport zrównoważonego rozwoju za pomocą GRI G4 w okresach 2013-2017. Stwierdzono, że wielkość i niezależność zarządu mają znaczący negatywny związek z poziomem ujawnienia raportu na temat zrównoważonego rozwoju. Ponadto ustalenia wskazują, że komitet audytu wzmacnia efekt moderujący związku między wielkością zarządu, dualnością dyrektora generalnego i poziomem ujawnienia raportu zrównoważonego rozwoju, ale osłabia efekt moderujący związku między niezależnością zarządu a poziomem ujawnienia raportu zrównoważonego rozwoju.
Domination in graphs is well known and has been an extensively researched branch of graph theory. Since the variation over time is one of the important properties of real-world networks, we study the influence of time on the domination problem. In this paper, we introduce the domination over time problem, including time delay on arcs. Then, an optimal solution to its discretisation is obtained, which is the solution of the original problem.
13
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
For a long time, intersection types have been admired for their surprising ability to complete the simply typed lambda calculus. Intersection types are an example of an implicit typing feature which can describe program behavior without manifesting itself within the syntax of a program. Dual to intersections, union types are another implicit typing feature which extends the completeness property of intersection types in the lambda calculus to full-fledged programming languages. However, the formalization of union types can easily break other desirable meta-theoretical properties of the type system. But why should unions be troublesome when their dual, intersections, are not? We look at the issues surrounding the design of type systems for both intersection and union types through the lens of duality by formalizing them within the symmetric language of the classical sequent calculus. In order to formulate type systems which have all of our properties of interest—soundness, completeness, and type safety—we also look at the impact of evaluation strategy on typing. As a result, we present two dual type systems—one for call-by-value and one for call-by-name evaluation—which have all three properties. We also consider the possibility of classical non-deterministic evaluation, for which there is a choice between two different systems depending on which properties are desired: a full type system which is complete, and a simplified type system which is sound and type safe.
For determining ways of company development, ensuring the growth of profit in manufacture and sales of certain products, it has been proposed to use an algorithm of constructing a problem being inverse to primal-dual one, for minimization of the project costs. The primal and the inverse problems contribute to improving the efficiency of calculation when determining approaches for minimization of costs. This pair of problems is mutually conjugate. The proposed rigorous approach to obtaining the algorithm of constructing a dual problem is based on the following statement: a problem being inverse to a dual one is a primal (original) problem. The authors have proposed and rigorously proven the algorithm of a general approach to the construction of conjugate problem pairs. Formalization of the algorithm developed allows obtaining easily correct pairs of known dual problems. This permitted proposing and proving the truth of the algorithm of constructing a dual problem for the arbitrary form of a primal problem representation.
In this paper, sufficient optimality conditions are established for the multiobjective control problem using efficiency of higher order as a criterion for optimality. The ρ-type 1 invex functionals (taken in pair) of higher order are proposed for the continuous case. Existence of such functionals is confirmed by a numer of examples. It is shown with the help of an example that this class is more general than the existing class of functionals.Weak and strong duality theorems are also derived for a mixed dual in order to relate efficient solutions of higher order for primal and dual problems.
In this paper, we are concerned with optimality conditions and duality results of generalized fractional minimax programming problems. Sufficient optimality conditions are established for a class of nondifferentiable generalized fractional minimax programming problems, in which the involved functions are locally Lipschitz (b,Ψ,Φ,ρ)-univex. Subsequently, these optimality conditions are utilized as a basis for constructing various parametric and nonparametric duality models for this type of fractional programming problems and proving appropriate duality theorems.
Multiobjective fractional variational problem is considered and sufficient optimality conditions, characterizing efficiency of higher order, are obtained under the assumptions of (F,ρ)−invexity of higher order on the functionals involved. Parametric higher order dual of the above stated problem is proposed. Duality theorems are proved to relate efficient solutions of higher order for primal and its dual problem using generalized class of functionals.
We discuss several extensions of binary Boolean functions acting on the domain [0, 1]. Formally, there are 16 disjoint classes of such functions, covering a majority of binary functions considered in fuzzy set theory. We introduce and discuss dualities in this framework, stressing the links between different subclasses of considered functions, e.g., the link between conjunctive and implication functions. Special classes of considered functions are characterized, among others, by particular kinds of monotonicity. Relaxing these constraints by considering monotonicity in one direction only, we generalize standard classes of aggregation functions, implications, semicopulas, etc., into larger classes called pre-aggregations, pre-implications, pre-semicopulas, etc. Note that the dualities discussed for the standard classes also relate the new extended classes of pre-functions.
19
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
The primary goal of the paper is to establish a duality for quasilattices. The main ingredients are duality for semilattices and their representations, the structural analysis of quasilattices as Płonka sums of lattices, and the duality for lattices developed by Hartonas and Dunn. Lattice duality treats the identity function on a lattice as a Galois connection between its meet and join semilattice reducts, and then invokes a duality between Galois connections and polarities. A second goal of the paper is a further examination of this latter duality, using the concept of a pairing to provide an algebraic equivalent to the relational structure of a polarity.
In this paper, multiobjective variational programming problem is considered. Mond-Weir type higher order duality results are established by using the efficiency of higher order as the optimization tool. In order to prove these results, we propose the notion of generalized higher order (F,ρ,θ,m,h)−invexity.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.