MINIMAL CLOSED SETS AND MAXIMAL CLOSED SETS

Μέγεθος: px
Εμφάνιση ξεκινά από τη σελίδα:

Download "MINIMAL CLOSED SETS AND MAXIMAL CLOSED SETS"

Transcript

1 MINIMAL CLOSED SETS AND MAXIMAL CLOSED SETS FUMIE NAKAOKA AND NOBUYUKI ODA Received 20 December 2005; Revised 28 May 2006; Accepted 6 August 2006 Some properties of minimal closed sets and maximal closed sets are obtained, which are dual concepts of maximal open sets and minimal open sets, respectively. Common properties of minimal closed sets and minimal open sets are clarified; similarly, common properties of maximal closed sets and maximal open sets are obtained. Moreover, interrelations of these four concepts are studied. Copyright 2006 Hindawi Publishing Corporation. All rights reserved. 1. Introduction Some properties of minimal open sets and maximal open sets are studied in [1, 2]. In this paper, we define dual concepts of them, namely, maximal closed set and minimal closed set. These four types of subsets appear in finite spaces, for example. More generally, minimal open sets and maximal closed sets appear in locally finite spaces such as the digital line. Minimal closed sets and maximal open sets appear in cofinite topology, for example. We have to study these four concepts to understand the relations among their properties. Some of the results in [1, 2] can be dualized using standard techniques of general topology. But we have to study the dual results carefully to understand the duality which we propose in this paper and in [2]. For example, considering the interrelation of these four concepts,we see that some results in [1, 2] can be generalized further. In [1] we called a nonempty open set U of X a minimal open set if any open set which is contained in U is or U. But to consider duality, we have to consider only proper nonempty open set U of X, as in the following definitions: a proper nonempty open subset U of X is said to be a minimal open set if any open set which is contained in U is or U. A proper nonempty open subset U of X is said to be a maximal open set if any open set which contains U is X or U. In this paper, we will use the following definitions. A proper nonempty closed subset F of X is said to be a minimal closed set if any closed set which is contained in F is or F. A proper nonempty closed subset F of X is said to be a maximal closed set if any closed set which contains F is X or F. Hindawi Publishing Corporation International Journal of Mathematics and Mathematical Sciences Volume 2006, Article ID 18647, Pages 1 8 DOI /IJMMS/2006/18647

2 2 Minimal closed sets and maximal closed sets Let F be a subset of a topological space X. Then the following duality principle holds: 1 F is a minimal closed set if and only if F is a maximal open set; 2 F is a maximal closed set if and only if F is a minimal open set. In Sections 2 and 3, we will show some results on minimal closed sets and maximal closed sets. In Section 4, we will obtain some further results on minimal open sets and maximal open sets. The symbol Λ \ Γ means difference of index sets, namely, Λ \ Γ = Λ Γ, and the cardinalityofasetλ is denoted by Λ in the following arguments. A subset M ofatopological space X is called a pre-open set if M IntClM and a subset M is called a pre-closed set if M is a pre-open set. 2. Minimal closed sets In this section, we prove some results on minimal closed sets. The following result shows that a fundamental result of [1, Lemma 2.2] also holds for closed sets; it is the dual result of [2, Lemma 2.2]. Lemma Let F be a minimal closed set and N a closed set. Then F N = or F N. 2 Let F and S be minimal closed sets. Then F S = or F = S. The proof of Lemma 2.1 is omitted, since it is obtained by an argument similar to the proofof[1, Lemma 2.2]. Now, we generalize the dual result of [2, Theorem 2.4]. Theorem 2.2. Let F and be minimal closed sets for any element λ of Λ. 1 If F, then there exists an element λ of Λ such that F =. 2 If F for any element λ of Λ, then F =. Proof. 1 Since F,wegetF = F = F. If F for any element λ of Λ,thenF = for any element λ of Λ by Lemma 2.12, hence we have = F = F. This contradicts our assumption that F is a minimal closed set. Thusthereexistsanelementλof Λ such that F =. 2 If F, then there exists an element λ of Λ such that F.By Lemma 2.12, we have = F, which is a contradiction. Corollary 2.3. Let be a minimal closed set for any element λ of Λ and F μ for any elements λ and μ of Λ with λ μ.ifγ is a proper nonempty subset of Λ, then \Γ γ Γ F γ =. The following result is a generalization of the dual result of [2, Theorem 2.5]. Theorem 2.4. Let and F γ be minimal closed sets for any element λ of Λ and γ of Γ.Ifthere exists an element γ of Γ such that F γ for any element λ of Λ, then γ Γ F γ. Proof. Suppose that an element γ of Γ satisfies F γ for any element λ of Λ.If γ Γ F γ,thenwegetf γ.bytheorem 2.21, there exists an element λ of Λ such that F γ =, which is a contradiction. The dual result of [2, Theorem 4.6] is stated as follows.

3 F. Nakaoka and N. Oda 3 Theorem 2.5. Let be a minimal closed set for any element λ of Λ and F μ for any elements λ and μ of Λ with λ μ. IfΓ is a proper nonempty subset of Λ, then γ Γ F γ. Proof. Let κ be any element of Λ \ Γ. ThenF κ γ Γ F γ = γ ΓF κ F γ = and F κ = F κ = F κ.if γ Γ F γ =,thenwehave =F κ. This contradicts our assumption that F κ is a minimal closed set. The following theorem is the dual result of [2, Theorem 4.2] and is the key to the proof of Theorem2.7, which is closelyconnectedwith [2, Theorem 4.7]. Theorem 2.6. Assume that Λ 2 and let be a minimal closed set for any element λ of Λ and F μ for any elements λ and μ of Λ with λ μ. Then F μ and hence X for any element μ of Λ. Proof. By Corollary 2.3,we have the result. Theorem 2.7 recognition principle for minimal closed sets. Assume that Λ 2 and let be a minimal closed set for any element λ of Λ and F μ for any elements λ and μ of Λ with λ μ.thenforanyelementμ of Λ, F μ = Proof. Let μ be an element of Λ.ByTheorem 2.6,wehave = F μ = = F μ = F μ. F μ As an application of Theorem 2.7, we prove the following result which is the dual result of [2, Theorem 4.8]. Theorem 2.8. Let be a minimal closed set for any element λ of a finite set Λ and F μ for any elements λ and μ of Λ with λ μ.if is an open set, then is an open set for any element λ of Λ. Proof. Let μ be an element of Λ. ByTheorem 2.7, wehavef μ = =. By our assumption, it is seen that isanopenset.hencef μ is an open set.

4 4 Minimal closed sets and maximal closed sets As an immediate consequence of Theorem 2.6, we have the following result which is the dual of [2, Theorem 4.9]. Theorem 2.9. Assume that Λ 2 and let be a minimal closed set for any element λ of Λ and F μ for any elements λ and μ of Λ with λ μ.if = X, then { λ Λ} is the set of all minimal closed sets of X. Let ={ λ Λ} be a set of minimal closed sets. We call = the coradical of. The following result about coradical is obtained by [2, Theorem 4.13]. Theorem Let be a minimal closed set for any element λ of Λ and F μ for any elements λ and μ of Λ with λ μ. If is an open set, then is an open set for any element μ of Λ. Theorem Let F be a minimal closed set. Then, IntF = F or IntF =. Proof. If we put U = F in [2, Theorem 3.5], then we have the result. If S is a proper subset of a minimal closed set, then IntS = and hence S is a preclosed set cf. [2, Corollary 3.7]. Theorem Let be a minimal closed set for any element λ of a finite set Λ. If Int, then there exists an element λ of Λ such that Int =. Proof. Since Int, there exists an element x of Int. Then there exists an open set U such that x U and hence there exists an element μ of Λ such that x F μ.bytheorems2.6 and 2.7, x U = F μ.sinceu X isanopenset,weseethatx is an element of IntF μ and hence IntF μ. Therefore there exists an element μ of Λ such that IntF μ = F μ by Theorem Remark If Λ is an infinite set, then Theorem 2.12 does not hold. For example, see [2, Example 5.3]. Theorem 2.14 the law of interior of coradical. Let be a minimal closed set for any element λ of a finite set Λ and F μ for any elements λ and μ of Λ with λ μ. LetΓ be a subset of Λ such that Int = Fλ for any λ Γ, Int = for any λ Λ \ Γ. 2.3 Then Int = λ Γ = if Γ =. Proof. By [2, Theorem 5.4], we have the result. 3. Maximal closed sets The following lemma is the dual of Lemma 2.1. Lemma Let F be a maximal closed set and N a closed set. Then F N = X or N F. 2 Let F and S be maximal closed sets. Then F S = X or F = S.

5 F. Nakaoka and N. Oda 5 Let be a maximal closed set for any element λ of Λ. Let ={ λ Λ}. Wecall = the radical of. Corollary 3.2. Let F and be maximal closed sets for any element λ of Λ. IfF for any element λ of Λ, then F = X. Proof. By Lemma 3.12, we have the result. Theorem 3.3. Let F and be maximal closed sets for any element λ of Λ.If F, then there exists an element λ of Λ such that F =. Proof. Since F, wegetf = F = F. If F = X for any element λ of Λ,thenwehaveX = F = F. This contradicts our assumption that F is a maximal closed set. Then there exists an element λ of Λ such that F X. By Lemma 3.12, we have the result. Corollary 3.4. Let and F γ be maximal closed sets for any elements λ Λ and γ Γ. If γ Γ F γ, then for any element λ of Λ, there exists an element γ Γ such that = F γ. Corollary 3.5. Let F α, F β,andf γ be maximal closed sets which are different from each other. Then F α F β F α F γ. 3.1 Theorem 3.6. Let be a maximal closed set for any element λ of Λ and F μ for any elements λ and μ of Λ with λ μ. IfΓ is a proper nonempty subset of Λ, then \Γ γ Γ F γ \Γ. Proof. Let γ be any element of Γ. If \Γ F γ,thenweget = F γ for some λ Λ \ Γ by Theorem 3.3. This contradicts our assumption. Therefore we have \Γ γ Γ F γ. On the other hand, since γ Γ F γ = γ Λ\Λ\Γ F γ \Γ,wehave γ Γ F γ \Γ. Theorem 3.7. Let be a maximal closed set for any element λ of Λ and F μ for any elements λ and μ of Λ with λ μ. IfΓ is a proper nonempty subset of Λ, then γ Γ F γ. Proof. Let κ be any element of Λ \ Γ.ThenF κ γ Γ F γ = γ ΓF κ F γ = X and F κ = F κ = F κ.if γ Γ F γ =,thenwehavex = F κ. This contradicts our assumption that F κ is a maximal closed set. Theorem 3.8. Assume that Λ 2 and let be a maximal closed set for any element λ of Λ and F μ for any elements λ and μ of Λ with λ μ. Then F μ and hence for any element μ of Λ. Proof. Let μ be any element of Λ.ByLemma 3.12, we have F μ for any element λ of Λ with λ μ.then F μ. Therefore we have F μ. If =,wehavex = F μ. This contradicts our assumption that F μ is a maximal closed set. Therefore we have.

6 6 Minimal closed sets and maximal closed sets Theorem 3.9 decomposition theorem for maximal closed sets. Assume that Λ 2 and let be a maximal closed set for any element λ of Λ and F μ for any elements λ and μ of Λ with λ μ. Then for any element μ of Λ, F μ =. 3.2 Proof. Let μ be an element of Λ.ByTheorem 3.8,wehave = F μ = = F μ = F μ. F μ 3.3 Theorem Let be a maximal closed set for any element λ of Λ and F μ for any elements λ and μ of Λ with λ μ. If is an open set, then is an open set for any element λ of Λ. Proof. By Theorem 3.9, we have F μ = =. Then isanopenset.hencef μ is an open set by our assumption. Theorem Assume that Λ 2 and let be a maximal closed set for any element λ of Λ and F μ for any elements λ and μ of Λ with λ μ.if =, then { λ Λ} is the set of all maximal closed sets of X. Proof. If there exists another maximal closed set F ν of X which is not equal to for any element λ of Λ, then = = {ν}\{ν}.bytheorem 3.8, weget {ν}\{ν}. This contradicts our assumption. Theorem Assume that Λ 2 and let be a maximal closed set for any element λ of Λ and F μ for any elements λ and μ of Λ with λ μ. IfInt =, then { λ Λ} is the set of all maximal closed sets of X. Proof. If there exists another maximal closed set F of X which is not equal to for any element λ of Λ, then F by Theorem 3.8. It follows that Int Int F = F. This contradicts our assumption. The proof of the following lemma is immediate and is omitted. Lemma Let A and B be subsets of X.IfA B = X, anda B is an open set and A is a closed set, then B is an open set.

7 F. Nakaoka and N. Oda 7 Proposition Let be a closed set for any element λ of Λ and F μ = X for any elements λ and μ of Λ with λ μ. If is an open set, then is an open set for any element μ of Λ. Proof. Let μ be any element of Λ. Since F μ = X for any element λ of Λ with λ μ, we have F μ = F μ = X. SinceF μ = is an open set by our assumption, is an open set by Lemma Theorem Let be a maximal closed set for any element λ of Λ and F μ for any elements λ and μ of Λ with λ μ. If is an open set, then is an open set for any element μ of Λ. Proof. By Lemma 3.12, we have F μ = X for any elements λ and μ of Λ with λ μ. By Proposition 3.14,wehave is an open set. 4. Minimal open sets and maximal open sets In this section, we record some results on minimal open sets and maximal open sets, which are not proved in [1, 2]. The proofs are omitted since they are obtained by dual arguments. Let ={U λ λ Λ} be a set of minimal open sets. We call = U λ the coradical of. By an argument similar to Theorem 2.2, we have the following result. Theorem 4.1. Let U and U λ be minimal open sets for any element λ of Λ. 1 If U U λ, then there exists an element λ of Λ such that U = U λ. 2 If U U λ for any element λ of Λ, then U λ U =. Corollary 4.2. Let U λ be a minimal open set for any element λ of Λ and U λ U μ for any elements λ and μ of Λ with λ μ.ifγ is a proper nonempty subset of Λ, then \Γ U λ γ Γ U γ =. The following results are shown by the arguments similar to the proofs of Theorems 2.4, 2.5, and2.6, respectively. Theorem 4.3. Let U λ and U γ be minimal open sets for any elements λ Λ and γ Γ. If there exists an element γ of Γ such that U λ U γ for any element λ of Λ, then γ Γ U γ U λ. Theorem 4.4. Let U λ be a minimal open set for any element λ of Λ and U λ U μ for any elements λ and μ of Λ with λ μ. IfΓ is a proper nonempty subset of Λ, then γ Γ U γ U λ. Theorem 4.5. Assume that Λ 2 and let U λ be a minimal open set for any element λ of Λ and U λ U μ for any elements λ and μ of Λ with λ μ. Then U μ U λ and hence U λ X for any element μ of Λ. Weobtainthefollowingresultforminimalopensets cf. Theorems2.7 and3.9. Theorem 4.6 recognition principle for minimal open sets. Assume that Λ 2 and let U λ be a minimal open set for any element λ of Λ and U λ U μ for any elements λ and μ of Λ

8 8 Minimal closed sets and maximal closed sets with λ μ. Then for any element μ of Λ, U μ = U λ U λ. 4.1 Theorem 4.7. Let U λ be a minimal open set for any element λ of any set Λ and U λ U μ for any elements λ and μ of Λ with λ μ. If U λ is a closed set, then U λ is a closed set for any element λ of Λ cf. Theorems 2.8 and Theorem 4.8. Assume that Λ 2 and let U λ be a minimal open set for any element λ of Λ and U λ U μ for any elements λ and μ of Λ with λ μ. If U λ = X, then {U λ λ Λ} is the set of all minimal open sets of X cf. Theorems 2.9 and Theorem 4.9. Assume that Λ 2 and let U λ be a minimal open set for any element λ of Λ and U λ U μ for any elements λ and μ of Λ with λ μ. IfCl U λ = X, then {U λ λ Λ} is the set of all minimal open sets of X cf. Theorem Example 4.10 the digital line. The digital line is the set Z of the intergers equipped with the topology τ having a family of subsets S ={{2k 1,2k,2k +1} k Z} as a subbase. We consider a set of minimal open sets {U k ={2k +1} k Z}. ThenCl k Z U k = Cl{2k +1 k Z} = Z and hence {U k ={2k +1} k Z} is the set of all minimal open sets in Z,τ. Finally we consider maximal open sets. The following results are the duals of Theorems 2.21 and 2.4. Theorem Let U and U λ be maximal open sets for any element λ of Λ.IfU U λ, then there exists an element λ of Λ such that U = U λ. Theorem Let U λ and U γ be maximal open sets for any elements λ of Λ and γ of Γ. If there exists an element γ of Γ such that U λ U γ for any element λ of Λ, then γ Γ U γ U λ. References [1] F. Nakaoka and N. Oda, Some applications of minimal open sets, International Journal of Mathematics and Mathematical Sciences , no. 8, [2], Some properties of maximal open sets, International Journal of Mathematics and Mathematical Sciences , no. 21, Fumie Nakaoka: Department of Applied Mathematics, Fukuoka University, Nanakuma Jonan-ku, Fukuoka , Japan address: Nobuyuki Oda: Department of Applied Mathematics, Fukuoka University, Nanakuma Jonan-ku, Fukuoka , Japan address:

MINIMAL CLOSED SETS AND MAXIMAL CLOSED SETS

MINIMAL CLOSED SETS AND MAXIMAL CLOSED SETS MINIMAL CLOSED SETS AND MAXIMAL CLOSED SETS FUMIE NAKAOKA AND NOBUYUKI ODA Received 20 December 2005; Revised 28 May 2006; Accepted 6 August 2006 Some properties of minimal closed sets and maximal closed

Διαβάστε περισσότερα

1. Introduction and Preliminaries.

1. Introduction and Preliminaries. Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.yu/filomat Filomat 22:1 (2008), 97 106 ON δ SETS IN γ SPACES V. Renuka Devi and D. Sivaraj Abstract We

Διαβάστε περισσότερα

2 Composition. Invertible Mappings

2 Composition. Invertible Mappings Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan Composition. Invertible Mappings In this section we discuss two procedures for creating new mappings from old ones, namely,

Διαβάστε περισσότερα

Ordinal Arithmetic: Addition, Multiplication, Exponentiation and Limit

Ordinal Arithmetic: Addition, Multiplication, Exponentiation and Limit Ordinal Arithmetic: Addition, Multiplication, Exponentiation and Limit Ting Zhang Stanford May 11, 2001 Stanford, 5/11/2001 1 Outline Ordinal Classification Ordinal Addition Ordinal Multiplication Ordinal

Διαβάστε περισσότερα

A Note on Intuitionistic Fuzzy. Equivalence Relation

A Note on Intuitionistic Fuzzy. Equivalence Relation International Mathematical Forum, 5, 2010, no. 67, 3301-3307 A Note on Intuitionistic Fuzzy Equivalence Relation D. K. Basnet Dept. of Mathematics, Assam University Silchar-788011, Assam, India dkbasnet@rediffmail.com

Διαβάστε περισσότερα

C.S. 430 Assignment 6, Sample Solutions

C.S. 430 Assignment 6, Sample Solutions C.S. 430 Assignment 6, Sample Solutions Paul Liu November 15, 2007 Note that these are sample solutions only; in many cases there were many acceptable answers. 1 Reynolds Problem 10.1 1.1 Normal-order

Διαβάστε περισσότερα

Finite Field Problems: Solutions

Finite Field Problems: Solutions Finite Field Problems: Solutions 1. Let f = x 2 +1 Z 11 [x] and let F = Z 11 [x]/(f), a field. Let Solution: F =11 2 = 121, so F = 121 1 = 120. The possible orders are the divisors of 120. Solution: The

Διαβάστε περισσότερα

EE512: Error Control Coding

EE512: Error Control Coding EE512: Error Control Coding Solution for Assignment on Finite Fields February 16, 2007 1. (a) Addition and Multiplication tables for GF (5) and GF (7) are shown in Tables 1 and 2. + 0 1 2 3 4 0 0 1 2 3

Διαβάστε περισσότερα

ORDINAL ARITHMETIC JULIAN J. SCHLÖDER

ORDINAL ARITHMETIC JULIAN J. SCHLÖDER ORDINAL ARITHMETIC JULIAN J. SCHLÖDER Abstract. We define ordinal arithmetic and show laws of Left- Monotonicity, Associativity, Distributivity, some minor related properties and the Cantor Normal Form.

Διαβάστε περισσότερα

Homomorphism and Cartesian Product on Fuzzy Translation and Fuzzy Multiplication of PS-algebras

Homomorphism and Cartesian Product on Fuzzy Translation and Fuzzy Multiplication of PS-algebras Annals of Pure and Applied athematics Vol. 8, No. 1, 2014, 93-104 ISSN: 2279-087X (P), 2279-0888(online) Published on 11 November 2014 www.researchmathsci.org Annals of Homomorphism and Cartesian Product

Διαβάστε περισσότερα

4.6 Autoregressive Moving Average Model ARMA(1,1)

4.6 Autoregressive Moving Average Model ARMA(1,1) 84 CHAPTER 4. STATIONARY TS MODELS 4.6 Autoregressive Moving Average Model ARMA(,) This section is an introduction to a wide class of models ARMA(p,q) which we will consider in more detail later in this

Διαβάστε περισσότερα

On a four-dimensional hyperbolic manifold with finite volume

On a four-dimensional hyperbolic manifold with finite volume BULETINUL ACADEMIEI DE ŞTIINŢE A REPUBLICII MOLDOVA. MATEMATICA Numbers 2(72) 3(73), 2013, Pages 80 89 ISSN 1024 7696 On a four-dimensional hyperbolic manifold with finite volume I.S.Gutsul Abstract. In

Διαβάστε περισσότερα

2. Let H 1 and H 2 be Hilbert spaces and let T : H 1 H 2 be a bounded linear operator. Prove that [T (H 1 )] = N (T ). (6p)

2. Let H 1 and H 2 be Hilbert spaces and let T : H 1 H 2 be a bounded linear operator. Prove that [T (H 1 )] = N (T ). (6p) Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: F3B, F4Sy, NVP 2005-03-08 Skrivtid: 9 14 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok

Διαβάστε περισσότερα

Tridiagonal matrices. Gérard MEURANT. October, 2008

Tridiagonal matrices. Gérard MEURANT. October, 2008 Tridiagonal matrices Gérard MEURANT October, 2008 1 Similarity 2 Cholesy factorizations 3 Eigenvalues 4 Inverse Similarity Let α 1 ω 1 β 1 α 2 ω 2 T =......... β 2 α 1 ω 1 β 1 α and β i ω i, i = 1,...,

Διαβάστε περισσότερα

CRASH COURSE IN PRECALCULUS

CRASH COURSE IN PRECALCULUS CRASH COURSE IN PRECALCULUS Shiah-Sen Wang The graphs are prepared by Chien-Lun Lai Based on : Precalculus: Mathematics for Calculus by J. Stuwart, L. Redin & S. Watson, 6th edition, 01, Brooks/Cole Chapter

Διαβάστε περισσότερα

Coefficient Inequalities for a New Subclass of K-uniformly Convex Functions

Coefficient Inequalities for a New Subclass of K-uniformly Convex Functions International Journal of Computational Science and Mathematics. ISSN 0974-89 Volume, Number (00), pp. 67--75 International Research Publication House http://www.irphouse.com Coefficient Inequalities for

Διαβάστε περισσότερα

Lecture 2. Soundness and completeness of propositional logic

Lecture 2. Soundness and completeness of propositional logic Lecture 2 Soundness and completeness of propositional logic February 9, 2004 1 Overview Review of natural deduction. Soundness and completeness. Semantics of propositional formulas. Soundness proof. Completeness

Διαβάστε περισσότερα

Homework 3 Solutions

Homework 3 Solutions Homework 3 Solutions Igor Yanovsky (Math 151A TA) Problem 1: Compute the absolute error and relative error in approximations of p by p. (Use calculator!) a) p π, p 22/7; b) p π, p 3.141. Solution: For

Διαβάστε περισσότερα

Inverse trigonometric functions & General Solution of Trigonometric Equations. ------------------ ----------------------------- -----------------

Inverse trigonometric functions & General Solution of Trigonometric Equations. ------------------ ----------------------------- ----------------- Inverse trigonometric functions & General Solution of Trigonometric Equations. 1. Sin ( ) = a) b) c) d) Ans b. Solution : Method 1. Ans a: 17 > 1 a) is rejected. w.k.t Sin ( sin ) = d is rejected. If sin

Διαβάστε περισσότερα

A General Note on δ-quasi Monotone and Increasing Sequence

A General Note on δ-quasi Monotone and Increasing Sequence International Mathematical Forum, 4, 2009, no. 3, 143-149 A General Note on δ-quasi Monotone and Increasing Sequence Santosh Kr. Saxena H. N. 419, Jawaharpuri, Badaun, U.P., India Presently working in

Διαβάστε περισσότερα

6.3 Forecasting ARMA processes

6.3 Forecasting ARMA processes 122 CHAPTER 6. ARMA MODELS 6.3 Forecasting ARMA processes The purpose of forecasting is to predict future values of a TS based on the data collected to the present. In this section we will discuss a linear

Διαβάστε περισσότερα

Lecture 13 - Root Space Decomposition II

Lecture 13 - Root Space Decomposition II Lecture 13 - Root Space Decomposition II October 18, 2012 1 Review First let us recall the situation. Let g be a simple algebra, with maximal toral subalgebra h (which we are calling a CSA, or Cartan Subalgebra).

Διαβάστε περισσότερα

Generalized Double Star Closed Sets in Interior Minimal Spaces

Generalized Double Star Closed Sets in Interior Minimal Spaces IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 11, Issue 4 Ver. II (Jul - Aug. 2015), PP 56-61 www.iosrjournals.org Generalized Double Star Closed Sets in Interior Minimal

Διαβάστε περισσότερα

Abstract Storage Devices

Abstract Storage Devices Abstract Storage Devices Robert König Ueli Maurer Stefano Tessaro SOFSEM 2009 January 27, 2009 Outline 1. Motivation: Storage Devices 2. Abstract Storage Devices (ASD s) 3. Reducibility 4. Factoring ASD

Διαβάστε περισσότερα

Εγχειρίδια Μαθηµατικών και Χταποδάκι στα Κάρβουνα

Εγχειρίδια Μαθηµατικών και Χταποδάκι στα Κάρβουνα [ 1 ] Πανεπιστήµιο Κύπρου Εγχειρίδια Μαθηµατικών και Χταποδάκι στα Κάρβουνα Νίκος Στυλιανόπουλος, Πανεπιστήµιο Κύπρου Λευκωσία, εκέµβριος 2009 [ 2 ] Πανεπιστήµιο Κύπρου Πόσο σηµαντική είναι η απόδειξη

Διαβάστε περισσότερα

Econ 2110: Fall 2008 Suggested Solutions to Problem Set 8 questions or comments to Dan Fetter 1

Econ 2110: Fall 2008 Suggested Solutions to Problem Set 8  questions or comments to Dan Fetter 1 Eon : Fall 8 Suggested Solutions to Problem Set 8 Email questions or omments to Dan Fetter Problem. Let X be a salar with density f(x, θ) (θx + θ) [ x ] with θ. (a) Find the most powerful level α test

Διαβάστε περισσότερα

Bounding Nonsplitting Enumeration Degrees

Bounding Nonsplitting Enumeration Degrees Bounding Nonsplitting Enumeration Degrees Thomas F. Kent Andrea Sorbi Università degli Studi di Siena Italia July 18, 2007 Goal: Introduce a form of Σ 0 2-permitting for the enumeration degrees. Till now,

Διαβάστε περισσότερα

ω ω ω ω ω ω+2 ω ω+2 + ω ω ω ω+2 + ω ω+1 ω ω+2 2 ω ω ω ω ω ω ω ω+1 ω ω2 ω ω2 + ω ω ω2 + ω ω ω ω2 + ω ω+1 ω ω2 + ω ω+1 + ω ω ω ω2 + ω

ω ω ω ω ω ω+2 ω ω+2 + ω ω ω ω+2 + ω ω+1 ω ω+2 2 ω ω ω ω ω ω ω ω+1 ω ω2 ω ω2 + ω ω ω2 + ω ω ω ω2 + ω ω+1 ω ω2 + ω ω+1 + ω ω ω ω2 + ω 0 1 2 3 4 5 6 ω ω + 1 ω + 2 ω + 3 ω + 4 ω2 ω2 + 1 ω2 + 2 ω2 + 3 ω3 ω3 + 1 ω3 + 2 ω4 ω4 + 1 ω5 ω 2 ω 2 + 1 ω 2 + 2 ω 2 + ω ω 2 + ω + 1 ω 2 + ω2 ω 2 2 ω 2 2 + 1 ω 2 2 + ω ω 2 3 ω 3 ω 3 + 1 ω 3 + ω ω 3 +

Διαβάστε περισσότερα

Απόκριση σε Μοναδιαία Ωστική Δύναμη (Unit Impulse) Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο. Απόστολος Σ.

Απόκριση σε Μοναδιαία Ωστική Δύναμη (Unit Impulse) Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο. Απόστολος Σ. Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο The time integral of a force is referred to as impulse, is determined by and is obtained from: Newton s 2 nd Law of motion states that the action

Διαβάστε περισσότερα

ΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 6/5/2006

ΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 6/5/2006 Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Ολοι οι αριθμοί που αναφέρονται σε όλα τα ερωτήματα είναι μικρότεροι το 1000 εκτός αν ορίζεται διαφορετικά στη διατύπωση του προβλήματος. Διάρκεια: 3,5 ώρες Καλή

Διαβάστε περισσότερα

Approximation of distance between locations on earth given by latitude and longitude

Approximation of distance between locations on earth given by latitude and longitude Approximation of distance between locations on earth given by latitude and longitude Jan Behrens 2012-12-31 In this paper we shall provide a method to approximate distances between two points on earth

Διαβάστε περισσότερα

DIRECT PRODUCT AND WREATH PRODUCT OF TRANSFORMATION SEMIGROUPS

DIRECT PRODUCT AND WREATH PRODUCT OF TRANSFORMATION SEMIGROUPS GANIT J. Bangladesh Math. oc. IN 606-694) 0) -7 DIRECT PRODUCT AND WREATH PRODUCT OF TRANFORMATION EMIGROUP ubrata Majumdar, * Kalyan Kumar Dey and Mohd. Altab Hossain Department of Mathematics University

Διαβάστε περισσότερα

ΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 19/5/2007

ΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 19/5/2007 Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Αν κάπου κάνετε κάποιες υποθέσεις να αναφερθούν στη σχετική ερώτηση. Όλα τα αρχεία που αναφέρονται στα προβλήματα βρίσκονται στον ίδιο φάκελο με το εκτελέσιμο

Διαβάστε περισσότερα

Strukturalna poprawność argumentu.

Strukturalna poprawność argumentu. Strukturalna poprawność argumentu. Marcin Selinger Uniwersytet Wrocławski Katedra Logiki i Metodologii Nauk marcisel@uni.wroc.pl Table of contents: 1. Definition of argument and further notions. 2. Operations

Διαβάστε περισσότερα

Roman Witu la 1. Let ξ = exp(i2π/5). Then, the following formulas hold true [6]:

Roman Witu la 1. Let ξ = exp(i2π/5). Then, the following formulas hold true [6]: Novi Sad J. Math. Vol. 43 No. 1 013 9- δ-fibonacci NUMBERS PART II Roman Witu la 1 Abstract. This is a continuation of paper [6]. We study fundamental properties applications of the so called δ-fibonacci

Διαβάστε περισσότερα

Section 8.3 Trigonometric Equations

Section 8.3 Trigonometric Equations 99 Section 8. Trigonometric Equations Objective 1: Solve Equations Involving One Trigonometric Function. In this section and the next, we will exple how to solving equations involving trigonometric functions.

Διαβάστε περισσότερα

A Note on Characterization of Intuitionistic Fuzzy Ideals in Γ- Near-Rings

A Note on Characterization of Intuitionistic Fuzzy Ideals in Γ- Near-Rings International Journal of Computational Science and Mathematics. ISSN 0974-3189 Volume 3, Number 1 (2011), pp. 61-71 International Research Publication House http://www.irphouse.com A Note on Characterization

Διαβάστε περισσότερα

Μηχανική Μάθηση Hypothesis Testing

Μηχανική Μάθηση Hypothesis Testing ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ Μηχανική Μάθηση Hypothesis Testing Γιώργος Μπορμπουδάκης Τμήμα Επιστήμης Υπολογιστών Procedure 1. Form the null (H 0 ) and alternative (H 1 ) hypothesis 2. Consider

Διαβάστε περισσότερα

Second Order Partial Differential Equations

Second Order Partial Differential Equations Chapter 7 Second Order Partial Differential Equations 7.1 Introduction A second order linear PDE in two independent variables (x, y Ω can be written as A(x, y u x + B(x, y u xy + C(x, y u u u + D(x, y

Διαβάστε περισσότερα

On Annihilator of Fuzzy Subsets of Modules

On Annihilator of Fuzzy Subsets of Modules International Journal of Algebra, Vol. 3, 2009, no. 10, 483-488 On Annihilator of Fuzzy Subsets of Modules Helen K. Saikia 1 and Mrinal C. Kalita 2 1 Department of Mathematics, Gauhati university, Guwahati-781014,

Διαβάστε περισσότερα

Problem Set 3: Solutions

Problem Set 3: Solutions CMPSCI 69GG Applied Information Theory Fall 006 Problem Set 3: Solutions. [Cover and Thomas 7.] a Define the following notation, C I p xx; Y max X; Y C I p xx; Ỹ max I X; Ỹ We would like to show that C

Διαβάστε περισσότερα

GAUGES OF BAIRE CLASS ONE FUNCTIONS

GAUGES OF BAIRE CLASS ONE FUNCTIONS GAUGES OF BAIRE CLASS ONE FUNCTIONS ZULIJANTO ATOK, WEE-KEE TANG, AND DONGSHENG ZHAO Abstract. Let K be a compact metric space and f : K R be a bounded Baire class one function. We proved that for any

Διαβάστε περισσότερα

Semigroups of Linear Transformations with Invariant Subspaces

Semigroups of Linear Transformations with Invariant Subspaces International Journal of Algebra, Vol 6, 2012, no 8, 375-386 Semigroups of Linear Transformations with Invariant Subspaces Preeyanuch Honyam Department of Mathematics, Faculty of Science Chiang Mai University,

Διαβάστε περισσότερα

CHAPTER 25 SOLVING EQUATIONS BY ITERATIVE METHODS

CHAPTER 25 SOLVING EQUATIONS BY ITERATIVE METHODS CHAPTER 5 SOLVING EQUATIONS BY ITERATIVE METHODS EXERCISE 104 Page 8 1. Find the positive root of the equation x + 3x 5 = 0, correct to 3 significant figures, using the method of bisection. Let f(x) =

Διαβάστε περισσότερα

Lecture Notes Introduction to Cluster Algebra

Lecture Notes Introduction to Cluster Algebra Lecture Notes Introduction to Cluster Algebra Ivan C.H. Ip Update: May 29, 2017 7.2 Properties of Exchangeable roots The notion of exchangeable is explained as follows Proposition 7.20. If C and C = C

Διαβάστε περισσότερα

Solution Series 9. i=1 x i and i=1 x i.

Solution Series 9. i=1 x i and i=1 x i. Lecturer: Prof. Dr. Mete SONER Coordinator: Yilin WANG Solution Series 9 Q1. Let α, β >, the p.d.f. of a beta distribution with parameters α and β is { Γ(α+β) Γ(α)Γ(β) f(x α, β) xα 1 (1 x) β 1 for < x

Διαβάστε περισσότερα

The Probabilistic Method - Probabilistic Techniques. Lecture 7: The Janson Inequality

The Probabilistic Method - Probabilistic Techniques. Lecture 7: The Janson Inequality The Probabilistic Method - Probabilistic Techniques Lecture 7: The Janson Inequality Sotiris Nikoletseas Associate Professor Computer Engineering and Informatics Department 2014-2015 Sotiris Nikoletseas,

Διαβάστε περισσότερα

ΠΤΥΧΙΑΚΗ ΕΡΓΑΣΙΑ ΒΑΛΕΝΤΙΝΑ ΠΑΠΑΔΟΠΟΥΛΟΥ Α.Μ.: 09/061. Υπεύθυνος Καθηγητής: Σάββας Μακρίδης

ΠΤΥΧΙΑΚΗ ΕΡΓΑΣΙΑ ΒΑΛΕΝΤΙΝΑ ΠΑΠΑΔΟΠΟΥΛΟΥ Α.Μ.: 09/061. Υπεύθυνος Καθηγητής: Σάββας Μακρίδης Α.Τ.Ε.Ι. ΙΟΝΙΩΝ ΝΗΣΩΝ ΠΑΡΑΡΤΗΜΑ ΑΡΓΟΣΤΟΛΙΟΥ ΤΜΗΜΑ ΔΗΜΟΣΙΩΝ ΣΧΕΣΕΩΝ ΚΑΙ ΕΠΙΚΟΙΝΩΝΙΑΣ ΠΤΥΧΙΑΚΗ ΕΡΓΑΣΙΑ «Η διαμόρφωση επικοινωνιακής στρατηγικής (και των τακτικών ενεργειών) για την ενδυνάμωση της εταιρικής

Διαβάστε περισσότερα

Main source: "Discrete-time systems and computer control" by Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 4 ΔΙΑΦΑΝΕΙΑ 1

Main source: Discrete-time systems and computer control by Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 4 ΔΙΑΦΑΝΕΙΑ 1 Main source: "Discrete-time systems and computer control" by Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 4 ΔΙΑΦΑΝΕΙΑ 1 A Brief History of Sampling Research 1915 - Edmund Taylor Whittaker (1873-1956) devised a

Διαβάστε περισσότερα

Chapter 2. Ordinals, well-founded relations.

Chapter 2. Ordinals, well-founded relations. Chapter 2. Ordinals, well-founded relations. 2.1. Well-founded Relations. We start with some definitions and rapidly reach the notion of a well-ordered set. Definition. For any X and any binary relation

Διαβάστε περισσότερα

Areas and Lengths in Polar Coordinates

Areas and Lengths in Polar Coordinates Kiryl Tsishchanka Areas and Lengths in Polar Coordinates In this section we develop the formula for the area of a region whose boundary is given by a polar equation. We need to use the formula for the

Διαβάστε περισσότερα

Strain gauge and rosettes

Strain gauge and rosettes Strain gauge and rosettes Introduction A strain gauge is a device which is used to measure strain (deformation) on an object subjected to forces. Strain can be measured using various types of devices classified

Διαβάστε περισσότερα

Green s Relations and Partial Orders on Semigroups of Partial Linear Transformations with Restricted Range

Green s Relations and Partial Orders on Semigroups of Partial Linear Transformations with Restricted Range Thai Journal of Mathematics Volume 12 2014 Number 1 : 81 93 http://thaijmathincmuacth ISSN 1686-0209 Green s Relations and Partial Orders on Semigroups of Partial Linear Transformations with Restricted

Διαβάστε περισσότερα

arxiv: v1 [math.ra] 19 Dec 2017

arxiv: v1 [math.ra] 19 Dec 2017 TWO-DIMENSIONAL LEFT RIGHT UNITAL ALGEBRAS OVER ALGEBRAICALLY CLOSED FIELDS AND R HAHMED UBEKBAEV IRAKHIMOV 3 arxiv:7673v [mathra] 9 Dec 7 Department of Math Faculty of Science UPM Selangor Malaysia &

Διαβάστε περισσότερα

UNIT - I LINEAR ALGEBRA. , such that αν V satisfying following condition

UNIT - I LINEAR ALGEBRA. , such that αν V satisfying following condition UNIT - I LINEAR ALGEBRA Definition Vector Space : A non-empty set V is said to be vector space over the field F. If V is an abelian group under addition and if for every α, β F, ν, ν 2 V, such that αν

Διαβάστε περισσότερα

Démographie spatiale/spatial Demography

Démographie spatiale/spatial Demography ΠΑΝΕΠΙΣΤΗΜΙΟ ΘΕΣΣΑΛΙΑΣ Démographie spatiale/spatial Demography Session 1: Introduction to spatial demography Basic concepts Michail Agorastakis Department of Planning & Regional Development Άδειες Χρήσης

Διαβάστε περισσότερα

ΤΕΧΝΟΛΟΓΙΚΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ ΤΜΗΜΑ ΝΟΣΗΛΕΥΤΙΚΗΣ

ΤΕΧΝΟΛΟΓΙΚΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ ΤΜΗΜΑ ΝΟΣΗΛΕΥΤΙΚΗΣ ΤΕΧΝΟΛΟΓΙΚΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ ΤΜΗΜΑ ΝΟΣΗΛΕΥΤΙΚΗΣ ΠΤΥΧΙΑΚΗ ΕΡΓΑΣΙΑ ΨΥΧΟΛΟΓΙΚΕΣ ΕΠΙΠΤΩΣΕΙΣ ΣΕ ΓΥΝΑΙΚΕΣ ΜΕΤΑ ΑΠΟ ΜΑΣΤΕΚΤΟΜΗ ΓΕΩΡΓΙΑ ΤΡΙΣΟΚΚΑ Λευκωσία 2012 ΤΕΧΝΟΛΟΓΙΚΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ ΣΧΟΛΗ ΕΠΙΣΤΗΜΩΝ

Διαβάστε περισσότερα

A Two-Sided Laplace Inversion Algorithm with Computable Error Bounds and Its Applications in Financial Engineering

A Two-Sided Laplace Inversion Algorithm with Computable Error Bounds and Its Applications in Financial Engineering Electronic Companion A Two-Sie Laplace Inversion Algorithm with Computable Error Bouns an Its Applications in Financial Engineering Ning Cai, S. G. Kou, Zongjian Liu HKUST an Columbia University Appenix

Διαβάστε περισσότερα

Chapter 6: Systems of Linear Differential. be continuous functions on the interval

Chapter 6: Systems of Linear Differential. be continuous functions on the interval Chapter 6: Systems of Linear Differential Equations Let a (t), a 2 (t),..., a nn (t), b (t), b 2 (t),..., b n (t) be continuous functions on the interval I. The system of n first-order differential equations

Διαβάστε περισσότερα

Section 8.2 Graphs of Polar Equations

Section 8.2 Graphs of Polar Equations Section 8. Graphs of Polar Equations Graphing Polar Equations The graph of a polar equation r = f(θ), or more generally F(r,θ) = 0, consists of all points P that have at least one polar representation

Διαβάστε περισσότερα

Section 9.2 Polar Equations and Graphs

Section 9.2 Polar Equations and Graphs 180 Section 9. Polar Equations and Graphs In this section, we will be graphing polar equations on a polar grid. In the first few examples, we will write the polar equation in rectangular form to help identify

Διαβάστε περισσότερα

Instruction Execution Times

Instruction Execution Times 1 C Execution Times InThisAppendix... Introduction DL330 Execution Times DL330P Execution Times DL340 Execution Times C-2 Execution Times Introduction Data Registers This appendix contains several tables

Διαβάστε περισσότερα

ON INTUITIONISTIC FUZZY SUBSPACES

ON INTUITIONISTIC FUZZY SUBSPACES Commun. Korean Math. Soc. 24 (2009), No. 3, pp. 433 450 DOI 10.4134/CKMS.2009.24.3.433 ON INTUITIONISTIC FUZZY SUBSPACES Ahmed Abd El-Kader Ramadan and Ahmed Aref Abd El-Latif Abstract. We introduce a

Διαβάστε περισσότερα

Cardinals. Y = n Y n. Define h: X Y by f(x) if x X n X n+1 and n is even h(x) = g

Cardinals. Y = n Y n. Define h: X Y by f(x) if x X n X n+1 and n is even h(x) = g Cardinals 1. Introduction to Cardinals We work in the base theory ZF. The definitions and many (but not all) of the basic theorems do not require AC; we will indicate explicitly when we are using choice.

Διαβάστε περισσότερα

Homework 8 Model Solution Section

Homework 8 Model Solution Section MATH 004 Homework Solution Homework 8 Model Solution Section 14.5 14.6. 14.5. Use the Chain Rule to find dz where z cosx + 4y), x 5t 4, y 1 t. dz dx + dy y sinx + 4y)0t + 4) sinx + 4y) 1t ) 0t + 4t ) sinx

Διαβάστε περισσότερα

A Lambda Model Characterizing Computational Behaviours of Terms

A Lambda Model Characterizing Computational Behaviours of Terms A Lambda Model Characterizing Computational Behaviours of Terms joint paper with Silvia Ghilezan RPC 01, Sendai, October 26, 2001 1 Plan of the talk normalization properties inverse limit model Stone dualities

Διαβάστε περισσότερα

Exercises to Statistics of Material Fatigue No. 5

Exercises to Statistics of Material Fatigue No. 5 Prof. Dr. Christine Müller Dipl.-Math. Christoph Kustosz Eercises to Statistics of Material Fatigue No. 5 E. 9 (5 a Show, that a Fisher information matri for a two dimensional parameter θ (θ,θ 2 R 2, can

Διαβάστε περισσότερα

If we restrict the domain of y = sin x to [ π, π ], the restrict function. y = sin x, π 2 x π 2

If we restrict the domain of y = sin x to [ π, π ], the restrict function. y = sin x, π 2 x π 2 Chapter 3. Analytic Trigonometry 3.1 The inverse sine, cosine, and tangent functions 1. Review: Inverse function (1) f 1 (f(x)) = x for every x in the domain of f and f(f 1 (x)) = x for every x in the

Διαβάστε περισσότερα

Αλγόριθμοι και πολυπλοκότητα NP-Completeness (2)

Αλγόριθμοι και πολυπλοκότητα NP-Completeness (2) ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ Αλγόριθμοι και πολυπλοκότητα NP-Completeness (2) Ιωάννης Τόλλης Τμήμα Επιστήμης Υπολογιστών NP-Completeness (2) x 1 x 1 x 2 x 2 x 3 x 3 x 4 x 4 12 22 32 11 13 21

Διαβάστε περισσότερα

ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ ΤΜΗΜΑ ΠΛΗΡΟΦΟΡΙΚΗΣ. ΕΠΛ342: Βάσεις Δεδομένων. Χειμερινό Εξάμηνο Φροντιστήριο 10 ΛΥΣΕΙΣ. Επερωτήσεις SQL

ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ ΤΜΗΜΑ ΠΛΗΡΟΦΟΡΙΚΗΣ. ΕΠΛ342: Βάσεις Δεδομένων. Χειμερινό Εξάμηνο Φροντιστήριο 10 ΛΥΣΕΙΣ. Επερωτήσεις SQL ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ ΤΜΗΜΑ ΠΛΗΡΟΦΟΡΙΚΗΣ ΕΠΛ342: Βάσεις Δεδομένων Χειμερινό Εξάμηνο 2013 Φροντιστήριο 10 ΛΥΣΕΙΣ Επερωτήσεις SQL Άσκηση 1 Για το ακόλουθο σχήμα Suppliers(sid, sname, address) Parts(pid, pname,

Διαβάστε περισσότερα

If we restrict the domain of y = sin x to [ π 2, π 2

If we restrict the domain of y = sin x to [ π 2, π 2 Chapter 3. Analytic Trigonometry 3.1 The inverse sine, cosine, and tangent functions 1. Review: Inverse function (1) f 1 (f(x)) = x for every x in the domain of f and f(f 1 (x)) = x for every x in the

Διαβάστε περισσότερα

Στα επόμενα θεωρούμε ότι όλα συμβαίνουν σε ένα χώρο πιθανότητας ( Ω,,P) Modes of convergence: Οι τρόποι σύγκλισης μιας ακολουθίας τ.μ.

Στα επόμενα θεωρούμε ότι όλα συμβαίνουν σε ένα χώρο πιθανότητας ( Ω,,P) Modes of convergence: Οι τρόποι σύγκλισης μιας ακολουθίας τ.μ. Στα πόμνα θωρούμ ότι όλα συμβαίνουν σ ένα χώρο πιθανότητας ( Ω,,). Modes of covergece: Οι τρόποι σύγκλισης μιας ακολουθίας τ.μ. { } ίναι οι ξής: σ μια τ.μ.. Ισχυρή σύγκλιση strog covergece { } lim = =.

Διαβάστε περισσότερα

Συστήματα Διαχείρισης Βάσεων Δεδομένων

Συστήματα Διαχείρισης Βάσεων Δεδομένων ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ Συστήματα Διαχείρισης Βάσεων Δεδομένων Φροντιστήριο 9: Transactions - part 1 Δημήτρης Πλεξουσάκης Τμήμα Επιστήμης Υπολογιστών Tutorial on Undo, Redo and Undo/Redo

Διαβάστε περισσότερα

Advanced Subsidiary Unit 1: Understanding and Written Response

Advanced Subsidiary Unit 1: Understanding and Written Response Write your name here Surname Other names Edexcel GE entre Number andidate Number Greek dvanced Subsidiary Unit 1: Understanding and Written Response Thursday 16 May 2013 Morning Time: 2 hours 45 minutes

Διαβάστε περισσότερα

9.09. # 1. Area inside the oval limaçon r = cos θ. To graph, start with θ = 0 so r = 6. Compute dr

9.09. # 1. Area inside the oval limaçon r = cos θ. To graph, start with θ = 0 so r = 6. Compute dr 9.9 #. Area inside the oval limaçon r = + cos. To graph, start with = so r =. Compute d = sin. Interesting points are where d vanishes, or at =,,, etc. For these values of we compute r:,,, and the values

Διαβάστε περισσότερα

Bifurcating Continued Fractions II

Bifurcating Continued Fractions II Bifurcating Continued Fractions II Ashok Kumar Mittal Department of Physics Allahabad University, Allahabad 211 002, India (Email address: mittal_a@vsnl.com) Ashok Kumar Gupta Department of Electronics

Διαβάστε περισσότερα

A Bonus-Malus System as a Markov Set-Chain. Małgorzata Niemiec Warsaw School of Economics Institute of Econometrics

A Bonus-Malus System as a Markov Set-Chain. Małgorzata Niemiec Warsaw School of Economics Institute of Econometrics A Bonus-Malus System as a Markov Set-Chain Małgorzata Niemiec Warsaw School of Economics Institute of Econometrics Contents 1. Markov set-chain 2. Model of bonus-malus system 3. Example 4. Conclusions

Διαβάστε περισσότερα

Non-extendability of holomorphic functions with bounded or continuously extendable derivatives

Non-extendability of holomorphic functions with bounded or continuously extendable derivatives Non-extendability of holomorphic functions with bounded or continuously extendable derivatives (Μη επεκτασιμότητα ολομόρφων συναρτήσεων με φραγμένες ή συνεχώς επεκτάσιμες παραγώγους) Διπλωματική Εργασία

Διαβάστε περισσότερα

Jordan Form of a Square Matrix

Jordan Form of a Square Matrix Jordan Form of a Square Matrix Josh Engwer Texas Tech University josh.engwer@ttu.edu June 3 KEY CONCEPTS & DEFINITIONS: R Set of all real numbers C Set of all complex numbers = {a + bi : a b R and i =

Διαβάστε περισσότερα

ΕΠΙΧΕΙΡΗΣΙΑΚΗ ΑΛΛΗΛΟΓΡΑΦΙΑ ΚΑΙ ΕΠΙΚΟΙΝΩΝΙΑ ΣΤΗΝ ΑΓΓΛΙΚΗ ΓΛΩΣΣΑ

ΕΠΙΧΕΙΡΗΣΙΑΚΗ ΑΛΛΗΛΟΓΡΑΦΙΑ ΚΑΙ ΕΠΙΚΟΙΝΩΝΙΑ ΣΤΗΝ ΑΓΓΛΙΚΗ ΓΛΩΣΣΑ Ανοικτά Ακαδημαϊκά Μαθήματα στο ΤΕΙ Ιονίων Νήσων ΕΠΙΧΕΙΡΗΣΙΑΚΗ ΑΛΛΗΛΟΓΡΑΦΙΑ ΚΑΙ ΕΠΙΚΟΙΝΩΝΙΑ ΣΤΗΝ ΑΓΓΛΙΚΗ ΓΛΩΣΣΑ Ενότητα 1: Elements of Syntactic Structure Το περιεχόμενο του μαθήματος διατίθεται με άδεια

Διαβάστε περισσότερα

w o = R 1 p. (1) R = p =. = 1

w o = R 1 p. (1) R = p =. = 1 Πανεπιστήµιο Κρήτης - Τµήµα Επιστήµης Υπολογιστών ΗΥ-570: Στατιστική Επεξεργασία Σήµατος 205 ιδάσκων : Α. Μουχτάρης Τριτη Σειρά Ασκήσεων Λύσεις Ασκηση 3. 5.2 (a) From the Wiener-Hopf equation we have:

Διαβάστε περισσότερα

Exercises 10. Find a fundamental matrix of the given system of equations. Also find the fundamental matrix Φ(t) satisfying Φ(0) = I. 1.

Exercises 10. Find a fundamental matrix of the given system of equations. Also find the fundamental matrix Φ(t) satisfying Φ(0) = I. 1. Exercises 0 More exercises are available in Elementary Differential Equations. If you have a problem to solve any of them, feel free to come to office hour. Problem Find a fundamental matrix of the given

Διαβάστε περισσότερα

Trigonometric Formula Sheet

Trigonometric Formula Sheet Trigonometric Formula Sheet Definition of the Trig Functions Right Triangle Definition Assume that: 0 < θ < or 0 < θ < 90 Unit Circle Definition Assume θ can be any angle. y x, y hypotenuse opposite θ

Διαβάστε περισσότερα

Capacitors - Capacitance, Charge and Potential Difference

Capacitors - Capacitance, Charge and Potential Difference Capacitors - Capacitance, Charge and Potential Difference Capacitors store electric charge. This ability to store electric charge is known as capacitance. A simple capacitor consists of 2 parallel metal

Διαβάστε περισσότερα

ON NEGATIVE MOMENTS OF CERTAIN DISCRETE DISTRIBUTIONS

ON NEGATIVE MOMENTS OF CERTAIN DISCRETE DISTRIBUTIONS Pa J Statist 2009 Vol 25(2), 135-140 ON NEGTIVE MOMENTS OF CERTIN DISCRETE DISTRIBUTIONS Masood nwar 1 and Munir hmad 2 1 Department of Maematics, COMSTS Institute of Information Technology, Islamabad,

Διαβάστε περισσότερα

ΔΙΕΡΕΥΝΗΣΗ ΤΗΣ ΣΕΞΟΥΑΛΙΚΗΣ ΔΡΑΣΤΗΡΙΟΤΗΤΑΣ ΤΩΝ ΓΥΝΑΙΚΩΝ ΚΑΤΑ ΤΗ ΔΙΑΡΚΕΙΑ ΤΗΣ ΕΓΚΥΜΟΣΥΝΗΣ ΤΕΧΝΟΛΟΓΙΚΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ ΣΧΟΛΗ ΕΠΙΣΤΗΜΩΝ ΥΓΕΙΑΣ

ΔΙΕΡΕΥΝΗΣΗ ΤΗΣ ΣΕΞΟΥΑΛΙΚΗΣ ΔΡΑΣΤΗΡΙΟΤΗΤΑΣ ΤΩΝ ΓΥΝΑΙΚΩΝ ΚΑΤΑ ΤΗ ΔΙΑΡΚΕΙΑ ΤΗΣ ΕΓΚΥΜΟΣΥΝΗΣ ΤΕΧΝΟΛΟΓΙΚΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ ΣΧΟΛΗ ΕΠΙΣΤΗΜΩΝ ΥΓΕΙΑΣ ΤΕΧΝΟΛΟΓΙΚΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ ΣΧΟΛΗ ΕΠΙΣΤΗΜΩΝ ΥΓΕΙΑΣ Πτυχιακή Εργασία ΔΙΕΡΕΥΝΗΣΗ ΤΗΣ ΣΕΞΟΥΑΛΙΚΗΣ ΔΡΑΣΤΗΡΙΟΤΗΤΑΣ ΤΩΝ ΓΥΝΑΙΚΩΝ ΚΑΤΑ ΤΗ ΔΙΑΡΚΕΙΑ ΤΗΣ ΕΓΚΥΜΟΣΥΝΗΣ ΑΝΔΡΕΟΥ ΣΤΕΦΑΝΙΑ Λεμεσός 2012 i ii ΤΕΧΝΟΛΟΓΙΚΟ

Διαβάστε περισσότερα

( ) 2 and compare to M.

( ) 2 and compare to M. Problems and Solutions for Section 4.2 4.9 through 4.33) 4.9 Calculate the square root of the matrix 3!0 M!0 8 Hint: Let M / 2 a!b ; calculate M / 2!b c ) 2 and compare to M. Solution: Given: 3!0 M!0 8

Διαβάστε περισσότερα

ΤΕΧΝΟΛΟΓΙΚΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ ΣΧΟΛΗ ΓΕΩΤΕΧΝΙΚΩΝ ΕΠΙΣΤΗΜΩΝ ΚΑΙ ΔΙΑΧΕΙΡΙΣΗΣ ΠΕΡΙΒΑΛΛΟΝΤΟΣ. Πτυχιακή εργασία

ΤΕΧΝΟΛΟΓΙΚΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ ΣΧΟΛΗ ΓΕΩΤΕΧΝΙΚΩΝ ΕΠΙΣΤΗΜΩΝ ΚΑΙ ΔΙΑΧΕΙΡΙΣΗΣ ΠΕΡΙΒΑΛΛΟΝΤΟΣ. Πτυχιακή εργασία ΤΕΧΝΟΛΟΓΙΚΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ ΣΧΟΛΗ ΓΕΩΤΕΧΝΙΚΩΝ ΕΠΙΣΤΗΜΩΝ ΚΑΙ ΔΙΑΧΕΙΡΙΣΗΣ ΠΕΡΙΒΑΛΛΟΝΤΟΣ Πτυχιακή εργασία ΠΡΟΣΔΙΟΡΙΣΜΟΣ ΔΕΙΚΤΩΝ ΚΑΤΑΝΑΛΩΣΗΣ ΕΝΕΡΓΕΙΑΣ ΣΤΑ ΑΝΤΛΙΟΣΤΑΣΙΑ ΤΟΥ ΤΜΗΜΑΤΟΣ ΑΝΑΠΤΥΞΕΩΣ ΥΔΑΤΩΝ Γεωργίου

Διαβάστε περισσότερα

Example of the Baum-Welch Algorithm

Example of the Baum-Welch Algorithm Example of the Baum-Welch Algorithm Larry Moss Q520, Spring 2008 1 Our corpus c We start with a very simple corpus. We take the set Y of unanalyzed words to be {ABBA, BAB}, and c to be given by c(abba)

Διαβάστε περισσότερα

ON JACQUET MODULES OF REPRESENTATIONS OF SEGMENT TYPE

ON JACQUET MODULES OF REPRESENTATIONS OF SEGMENT TYPE ON JACQUET MODULES OF REPRESENTATIONS OF SEGMENT TYPE IVAN MATIĆ AND MARKO TADIĆ Abstract. Let G n denote either the group Sp(n, F ) or SO(2n + 1, F ) over a local nonarchimedean field F. We study representations

Διαβάστε περισσότερα

Mock Exam 7. 1 Hong Kong Educational Publishing Company. Section A 1. Reference: HKDSE Math M Q2 (a) (1 + kx) n 1M + 1A = (1) =

Mock Exam 7. 1 Hong Kong Educational Publishing Company. Section A 1. Reference: HKDSE Math M Q2 (a) (1 + kx) n 1M + 1A = (1) = Mock Eam 7 Mock Eam 7 Section A. Reference: HKDSE Math M 0 Q (a) ( + k) n nn ( )( k) + nk ( ) + + nn ( ) k + nk + + + A nk... () nn ( ) k... () From (), k...() n Substituting () into (), nn ( ) n 76n 76n

Διαβάστε περισσότερα

Solutions to Selected Homework Problems 1.26 Claim: α : S S which is 1-1 but not onto β : S S which is onto but not 1-1. y z = z y y, z S.

Solutions to Selected Homework Problems 1.26 Claim: α : S S which is 1-1 but not onto β : S S which is onto but not 1-1. y z = z y y, z S. Solutions to Selected Homework Problems 1.26 Claim: α : S S which is 1-1 but not onto β : S S which is onto but not 1-1. Proof. ( ) Since α is 1-1, β : S S such that β α = id S. Since β α = id S is onto,

Διαβάστε περισσότερα

Meromorphically Starlike Functions at Infinity

Meromorphically Starlike Functions at Infinity Punjab University Journal of Mathematics (ISSN 1016-2526) Vol. 48(2)(2016) pp. 11-18 Meromorphically Starlike Functions at Infinity Imran Faisal Department of Mathematics, University of Education, Lahore,

Διαβάστε περισσότερα

Εργαστήριο Ανάπτυξης Εφαρμογών Βάσεων Δεδομένων. Εξάμηνο 7 ο

Εργαστήριο Ανάπτυξης Εφαρμογών Βάσεων Δεδομένων. Εξάμηνο 7 ο Εργαστήριο Ανάπτυξης Εφαρμογών Βάσεων Δεδομένων Εξάμηνο 7 ο Procedures and Functions Stored procedures and functions are named blocks of code that enable you to group and organize a series of SQL and PL/SQL

Διαβάστε περισσότερα

ΚΒΑΝΤΙΚΟΙ ΥΠΟΛΟΓΙΣΤΕΣ

ΚΒΑΝΤΙΚΟΙ ΥΠΟΛΟΓΙΣΤΕΣ Ανώτατο Εκπαιδευτικό Ίδρυμα Πειραιά Τεχνολογικού Τομέα Τμήμα Ηλεκτρονικών Μηχανικών Τ.Ε. ΚΒΑΝΤΙΚΟΙ ΥΠΟΛΟΓΙΣΤΕΣ Πτυχιακή Εργασία Φοιτητής: ΜIΧΑΗΛ ΖΑΓΟΡΙΑΝΑΚΟΣ ΑΜ: 38133 Επιβλέπων Καθηγητής Καθηγητής Ε.

Διαβάστε περισσότερα

Math 6 SL Probability Distributions Practice Test Mark Scheme

Math 6 SL Probability Distributions Practice Test Mark Scheme Math 6 SL Probability Distributions Practice Test Mark Scheme. (a) Note: Award A for vertical line to right of mean, A for shading to right of their vertical line. AA N (b) evidence of recognizing symmetry

Διαβάστε περισσότερα

ΕΘΝΙΚΟ ΜΕΤΣΟΒΙΟ ΠΟΛΥΤΕΧΝΕΙΟ

ΕΘΝΙΚΟ ΜΕΤΣΟΒΙΟ ΠΟΛΥΤΕΧΝΕΙΟ ΕΘΝΙΚΟ ΜΕΤΣΟΒΙΟ ΠΟΛΥΤΕΧΝΕΙΟ ΣΧΟΛΗ ΗΛΕΚΤΡΟΛΟΓΩΝ ΜΗΧΑΝΙΚΩΝ ΚΑΙ ΜΗΧΑΝΙΚΩΝ ΥΠΟΛΟΓΙΣΤΩΝ ΤΟΜΕΑΣ ΤΕΧΝΟΛΟΓΙΑΣ ΠΛΗΡΟΦΟΡΙΚΗΣ ΚΑΙ ΥΠΟΛΟΓΙΣΤΩΝ Σημασιολογική Συσταδοποίηση Αντικειμένων Με Χρήση Οντολογικών Περιγραφών.

Διαβάστε περισσότερα

On a Subclass of k-uniformly Convex Functions with Negative Coefficients

On a Subclass of k-uniformly Convex Functions with Negative Coefficients International Mathematical Forum, 1, 2006, no. 34, 1677-1689 On a Subclass of k-uniformly Convex Functions with Negative Coefficients T. N. SHANMUGAM Department of Mathematics Anna University, Chennai-600

Διαβάστε περισσότερα

ΑΝΩΤΑΤΗ ΣΧΟΛΗ ΠΑΙ ΑΓΩΓΙΚΗΣ ΚΑΙ ΤΕΧΝΟΛΟΓΙΚΗΣ ΕΚΠΑΙ ΕΥΣΗΣ ΠΑΡΑΔΟΤΕΟ ΕΠΙΣΤΗΜΟΝΙΚΗ ΕΡΓΑΣΙΑ ΣΕ ΔΙΕΘΝΕΣ ΕΠΙΣΤΗΜΟΝΙΚΟ ΠΕΡΙΟΔΙΚΟ

ΑΝΩΤΑΤΗ ΣΧΟΛΗ ΠΑΙ ΑΓΩΓΙΚΗΣ ΚΑΙ ΤΕΧΝΟΛΟΓΙΚΗΣ ΕΚΠΑΙ ΕΥΣΗΣ ΠΑΡΑΔΟΤΕΟ ΕΠΙΣΤΗΜΟΝΙΚΗ ΕΡΓΑΣΙΑ ΣΕ ΔΙΕΘΝΕΣ ΕΠΙΣΤΗΜΟΝΙΚΟ ΠΕΡΙΟΔΙΚΟ ΑΝΩΤΑΤΗ ΣΧΟΛΗ ΠΑΙ ΑΓΩΓΙΚΗΣ ΚΑΙ ΤΕΧΝΟΛΟΓΙΚΗΣ ΕΚΠΑΙ ΕΥΣΗΣ (Α.Σ.ΠΑΙ.Τ.Ε.) «Αρχιμήδης ΙΙΙ Ενίσχυση Ερευνητικών ομάδων στην Α.Σ.ΠΑΙ.Τ.Ε.» Υποέργο: 8 Τίτλος: «Εκκεντρότητες αντισεισμικού σχεδιασμού ασύμμετρων

Διαβάστε περισσότερα

Η θέση ύπνου του βρέφους και η σχέση της με το Σύνδρομο του αιφνίδιου βρεφικού θανάτου. ΤΕΧΝΟΛΟΓΙΚΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ ΣΧΟΛΗ ΕΠΙΣΤΗΜΩΝ ΥΓΕΙΑΣ

Η θέση ύπνου του βρέφους και η σχέση της με το Σύνδρομο του αιφνίδιου βρεφικού θανάτου. ΤΕΧΝΟΛΟΓΙΚΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ ΣΧΟΛΗ ΕΠΙΣΤΗΜΩΝ ΥΓΕΙΑΣ ΤΕΧΝΟΛΟΓΙΚΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ ΣΧΟΛΗ ΕΠΙΣΤΗΜΩΝ ΥΓΕΙΑΣ ΠΤΥΧΙΑΚΗ ΕΡΓΑΣΙΑ Η θέση ύπνου του βρέφους και η σχέση της με το Σύνδρομο του αιφνίδιου βρεφικού θανάτου. Χρυσάνθη Στυλιανού Λεμεσός 2014 ΤΕΧΝΟΛΟΓΙΚΟ

Διαβάστε περισσότερα