The X 3 Language Specification
|
|
- Σαμουήλ Βιτάλης
- 5 χρόνια πριν
- Προβολές:
Transcript
1 The X 3 Language Specification Ross Tate October 11, Lexing and Parsing 1.1 Core and Full Languages ν v ::= variable/function/method names ν c ::= class/interface names ν p ::= type-parameter names ν vc ::= ν v ν c kind context Θ ::= ν p,..., ν p type context Γ ::= ν v :,..., ν v : type ::= ν p ν c,..., type scheme σ ::= Θ (Γ) : expression e ::= ν v ν vc,..., (e,..., e) e.ν v,..., (e,..., e) [e,..., e] e ++ e true false n "string" statement s ::= {s... s} ν v := e; if (e) s else s while (e) s for (ν v in e) s return e; interface i ::= interface ν c Θ extends {fun ν v σ;... fun ν v σ; fun ν v σ s... fun ν v σ s} class c ::= class ν c Θ (Γ) extends {s... s super(e,..., e); fun ν v σ s... fun ν v σ s} program p ::= s s... s p fun ν v σ s... fun ν v σ s p i p c p function context ::=, ν vc σ class context Ψ ::= Ψ, interface ν c Θ extends { ; ν v,..., ν v } Ψ, class ν c Θ extends { } Figure 1: Cubex Core Language Grammar, which gives the grammar for the Cubex core language, along with definitions for the formal constructs and Ψ, which are not part of the language per se but are useful in our formalization of the type system. Note that p stands for program and defines a syntactically-valid program in the Cubex core language. Note also that lists, represented with an elipsis, may consist of zero, one, or more elements. So a,..., a may be the empty string, a, or some list of as separated by commas. We distinguish between the Cubex core language, which is specified by the grammar in Figure 1.1, and the full language. The full language differs from the core language in a number of ways: It includes the following unary and binary operators, listed in order of precedence, which are (except for ++) short for method calls on arbitrary classes (their signatures are those that are given for the built-in classes at the end of this document). All operators are left-associative. 1. Unary prefixes - and! short for negative and negate respectively. 2. Multiplicative operators *, /, and % short for times, divide, and modulo respectively. 3. Additive + and - short for plus and minus respectively. 4. Range operators.., <.,.<, <<,..., and <.., with the last two being unary suffixes; the binary operators are shorthand for through using additional Boolean parameters to indicate whether to include the lower and/or upper bounds; the unary suffixes are shorthand for onwards using an additional Boolean parameter to indicate inclusiveness. 5. The binary operator ++, (actually part of the core language), which implements appending of iterables, denoted in the grammar by Inequality operators <, <=, >=, and > short for lessthan with an additional Boolean parameter indicating strictness, and with order reversed for >= and >. 7. Equational operators == and!=, short for equals and equals followed by negate. 8. Boolean operators & short for and followed by short for or. Characters in the core language which have no obvious ASCII equivalent are represented in the full language in ASCII as follows: 1
2 Thing for and Nothing for. & for and for. & for. < for and > for. Expressions (denoted e in the grammar) may be surrounded by parentheses. If there are no type parameters (i.e. when,..., is the empty list), a class/interface/function specification can drop the. When calling a function/method/constructor with no type parameters, the may be dropped. If the else case is {}, it can be dropped. In the full language, unimplemented and implemented methods of interfaces may mixed together, unlike in the core language where all of the latter must follow all of the former. If a class or interface just extends, the extends clause can be omitted. If the call to super has no arguments, it can be omitted. If a function implementation is simply return of some expression, the return can be abbreviated to =. For example, fun foo(y : Integer) : Integer return y * 2; may be abbreviated to fun foo(y : Integer) : Integer = y * 2; Finally, there is no name hiding. If a judgement requires binding a name twice, that judgement is ill formed and does not hold. However, all the different kinds of context are different namespaces. So a name can be bound both in and Γ. To clarify, Γ and use the same namespace, so a variable must not be bound in both. 1.2 Name, Keywords, Literals, etc. The grammar uses ν with subscripts to denote both various kinds of names. We enforce a distinction between these kinds. Variables and function/method names (ν v ) are a lower-case letter followed by letters, numbers, and/or underscores. Class/interface names (ν c ) are an upper-case letter followed by one or more letters, numbers, and/or underscores. Type parameters (ν p ) are an upper-case letter alone. In the formalism we refer to all of these collectively as just ν. Key words (i.e. any words receiving special treatment in the core language) cannot be used as names or variables. String literals (denoted in the grammar by "string") have no escaping and cannot contain white space besides the space character. Integer literals (denoted in the grammar by n) are in decimal only. Finally, note that the grammar contains various other syntactic artifacts (semicolons, brackets, etc.) whose only legal uses in the language (outside of comments and string literals) are fully specified by their role in the grammar. 1.3 Whitespace and Comments Unless it occurs inside a string literal, white space is disregarded except for its role of separating names and other tokens (e.g. : = is not the same as := and only the latter can be used in a variable assignment). Unless it occurs inside a string literal, # starts a comment that extends to the end of the line. Unless it occurs inside a string literal, starts a comment that extends to the matching, where these comments can be nested inside each other. Comments are disregarded except for their role of separating names and other tokens. 2
3 2 Validating The following formalizes when a program is valid, incorporating type validity, type checking, and class/interface validation. Judgements take the form (context) (property). Ψ indicates the classes and interfaces in scope, what they directly inherit, and what their methods are. Θ indicates the type parameters in scope. indicates the function names in scope and what their type scheme is. Γ typically indicates the immutable variable names in scope and what their type is. typically indicates the mutable variable names in scope and what their type is. The following is a summary of the judgements used in this formalism and where their definitions can be found. Judgement Meaning Figure Ψ Θ <: is a subtype of 2 Ψ ν Θ extends generic class/interface ν Θ directly inherits 2 Ψ Θ Γ <: Γ Γ is a subcontext of Γ 2 Ψ Θ σ σ σ and σ are equivalent type schemes Ψ Θ.ν : σ method ν of type has type scheme σ 3 Ψ ˆν Θ.ν : σ generic class/interface ˆν Θ has method ν with type scheme σ 3 Ψ Θ is a valid type 4 Ψ Θ ˆ is an inheritable type with constructable component ˆ 4 Ψ Θ Γ Γ is a valid type context 4 Ψ Θ σ σ is a valid type scheme 4 Ψ Θ Γ e : expression e has type 5 Ψ Θ Γ s : mutable variables are available after valid statement s 6 Ψ Θ Γ b s : like above and all returns have type with b = true guaranteeing a return 7 Ψ Θ : are all the methods of 8 Ψ ˆν Θ : are the direct methods of generic class/interface ˆν Θ 8 Ψ Θ : ν provides an implementation of method ν 9 Ψ Γ i : Ψ i is a valid interface with signature Ψ 10 Ψ Γ c : Ψ c is a valid class with signature Ψ and constructor 10 Ψ Γ p p is a valid program 11 p p is a valid program in the initial environment 11 Ψ Θ <: Ψ ν Θ extends Ψ Θ Γ <: Γ Ψ Θ σ σ Ψ Θ ν <: ν Ψ Θ <: Ψ Θ <: Ψ Θ i <: Ψ Θ 1 2 <: Ψ Θ i <: i and Ψ Θ i <: i Ψ Θ ν 1,..., n <: ν 1,..., n Ψ ν ν 1,..., ν n extends Ψ Θ [ν 1 1,..., ν n n ] <: Ψ Θ ν 1,... n <: Ψ Θ <: Ψ Θ <: 1 Ψ Θ <: 2 Ψ Θ <: 1 2 interface ν Θ extends {... } in Ψ Ψ ν Θ extends Ψ Θ <: Ψ Θ Iterable <: Iterable class ν Θ extends {... } in Ψ Ψ ν Θ extends Ψ Θ <: Ψ Θ Γ <: Γ Ψ Θ ν :, Γ <: ν :, Γ Ψ Θ Γ <: Γ Ψ Θ ν :, Γ <: Γ Ψ Θ, ˆΘ Γ <: Γ Ψ Θ, ˆΘ Γ <: Γ Ψ Θ, ˆΘ <: Ψ Θ, ˆΘ <: Ψ Θ ˆΘ (Γ) : ˆΘ (Γ ) : Figure 2: Subtyping 3
4 Ψ Θ.ν : σ Ψ ν Θ.ν : σ Ψ Θ.ν : σ Ψ ˆν ν 1,..., ν n.ν : σ Ψ Θ ˆν 1,..., n.ν : σ[ν 1 1,..., ν n n ] interface ˆν Θ extends {..., νσ,... ;... } in Ψ Ψ ˆν Θ.ν : σ class ˆν Θ extends {..., νσ,... } in Ψ Ψ ˆν Θ.ν : σ Figure 3: Method Lookup Ψ Θ Ψ Θ Ψ Θ Γ Ψ Θ σ Ψ Θ ˆ Ψ Θ Ψ Θ Ψ Θ ν in Θ Ψ Θ ν interface ν ν 1,..., ν n extends {... } in Ψ Ψ Θ i Ψ Θ ν 1,..., n class ν ν 1,..., ν n extends {... } in Ψ Ψ Θ i Ψ Θ ν 1,..., n ν 1,..., n Ψ Θ ˆ Ψ Θ for all, Ψ Θ <: and Ψ Θ <: implies Ψ Θ <: Ψ Θ : Ψ Θ ˆ Ψ Θ i Ψ Θ, ˆΘ Γ Ψ Θ, ˆΘ Ψ Θ ν 1 : 1,..., ν n : n Ψ Θ ˆΘ (Γ) : Figure 4: Type Validity Ψ Θ Γ e : Ψ Θ Γ e : Ψ Θ <: Ψ Θ Γ e : ν : in Γ Ψ Θ Γ ν : Ψ Θ i ν ν 1,..., ν m (ˆν 1 : ˆ 1,..., ˆν n : ˆ n ) : in Ψ Θ Γ e i : ˆ i [ν 1 1,..., ν m m ] Ψ Θ Γ ν 1,..., m (e 1,..., e n ) : [ν 1 1,..., ν m m ] Ψ Θ i Ψ Θ Γ e : ˆ Ψ Θ ˆ.ν : ν 1,..., ν m (ˆν 1 : ˆ 1,..., ˆν n : ˆ n ) : Ψ Θ Γ e i : ˆ i [ν 1 1,..., ν m m ] Ψ Θ Γ e.ν 1,..., m (e 1,..., e n ) : [ν 1 1,..., ν m m ] Ψ Θ Γ e i : Ψ Θ Γ [e 1,..., e n ] : Iterable Ψ Θ Γ e i : Iterable Ψ Θ Γ e 1 ++ e 2 : Iterable Ψ Θ Γ true : Boolean Ψ Θ Γ n : Integer Ψ Θ Γ false : Boolean Ψ Θ Γ "string" : String Figure 5: Type Checking Expressions 4
5 Ψ Θ Γ Γ s : Γ Ψ Θ Γ s : Ψ Θ <: Ψ Ψ Θ Γ s : Θ Γ s :, ν :, ν :, Ψ Θ Γ s :, ν :, ν :, Ψ Θ Γ i 1 s i : i Ψ Θ Γ 0 {s 1... s n } : n Ψ Θ Γ, e : Ψ Θ Γ ν := e; :, ν : Ψ Θ Γ,, ν :, e : Ψ Θ Γ, ν :, ν := e; :, ν :, Ψ Θ Γ, e : Boolean Ψ Θ Γ s 1 : Ψ Θ Γ s 2 : Ψ Θ Γ if (e) s 1 else s 2 : Ψ Θ Γ, e : Boolean Ψ Θ Γ s : Ψ Θ Γ while (e) s : Ψ Θ Γ, e : Iterable Ψ Θ Γ, ν : s : Ψ Θ Γ for (ν in e) s : Figure 6: Type Checking Statements Ψ Θ Γ Γ b s : Γ Ψ Θ Γ b s : Ψ Θ <: Ψ Ψ Θ Γ b s : Ψ Θ Γ, e : ˆ Ψ Θ Γ false Ψ Θ Γ true s : Ψ Θ Γ false s : Ψ Θ Γ i 1 bi s i : i b = true implies there exists i with b i = true ν := e; :, ν : ˆ Ψ Θ Γ 0 b {s 1... s n } : n Θ Γ b s :, ν : ˆ, ν : ˆ, Ψ Θ Γ b s :, ν : ˆ, ν : ˆ, Ψ Θ Γ,, ν : ˆ, e : ˆ Ψ Θ Γ, ν : ˆ, false ν := e; :, ν : ˆ, Ψ Θ Γ, e : Boolean Ψ Θ Γ b s 1 : Ψ Θ Γ b s 2 : Ψ Θ Γ b if (e) s 1 else s 2 : Ψ Θ Γ, e : Boolean Ψ Θ Γ false Ψ Θ Γ, e : Iterable ˆ Ψ Θ Γ false Ψ Θ Γ, e : Ψ Θ Γ true Ψ Θ Γ b s : while (e) s : Ψ Θ Γ, ν : ˆ b s : for (ν in e) s : return e; : Figure 7: Type Checking Returns 5
6 Ψ Θ : Ψ ν Θ : Ψ Θ : Ψ Θ : Ψ Θ :, Ψ ˆν ν 1,..., ν n : Ψ ˆν ν 1,..., ν n extends Ψ ν 1,..., ν n : for all νσ in, for all ν σ in, ν = ν implies Ψ ν 1,..., ν n σ σ Ψ Θ ˆν 1,..., n : ( )[ν 1 1,..., ν n n ] interface ˆν Θ extends { ;... } in Ψ Ψ ˆν Θ : class ˆν Θ extends { } in Ψ Ψ ˆν Θ : Figure 8: Method-Context Lookup Ψ Θ : ν Ψ Θ i : ν Ψ Θ 1 2 : ν interface ˆν ν 1,..., ν n extends {... ;..., ν,... } in Ψ Ψ ˆν 1,..., n : ν Ψ ˆν ν 1,..., ν n extends Ψ ν 1,..., ν n : ν Ψ Θ ˆν 1,..., n : ν Figure 9: Method-Implemented Check class ˆν ν 1,..., ν n extends {..., νσ,... } in Ψ Ψ ˆν 1,..., n : ν Ψ Γ i : Ψ Ψ Γ c : Ψ Ψ Θ Ψ = interface ν Θ extends {ν 1 σ 1,..., ν n σ n, ˆν 1ˆσ 1,..., ˆνˆnˆσˆn ; ˆν 1,..., ˆνˆn } Ψ, Ψ Θ σ i Ψ, Ψ Θ ˆσ i Ψ, Ψ Θ ν Θ : for all ν Θ ( Γ) : in, for all ν in Θ, ν not in Θ ˆσ i = Θ i (Γ i ) : i Ψ, Ψ Θ, Θ i, Γ Γ i true i ŝ i : Γ i Ψ Γ interface ν Θ extends {fun ν 1 σ 1 ;... ; fun ν n σ n ; fun ˆν 1ˆσ 1 = ŝ 1... fun ˆνˆn σˆn = ŝˆn } : Ψ Ψ Θ ˆ Ψ = class ν Θ extends {ν 1 σ 1 ;... ; ν n σ n ; } = ν Θ () : ν Θ Ψ, Ψ Θ σ i Ψ, Ψ Θ 0 = Ψ, Ψ Θ, Γ i 1 s i : i ˆ(e 1,..., e k ) = () or Ψ, Ψ Θ, Γ, m ˆ(e 1,..., e k ) : ˆ Ψ, Ψ Θ ν Θ : for all ν Θ ( Γ) : in, for all ν in Θ, ν not in Θ σ i = Θ i (Γ i ) : i Ψ, Ψ Θ, Θ i,, Γ, m Γ i true i ŝ i : Γ i for all ˆνσ in, Ψ, Ψ Θ ν Θ : ˆν Ψ Γ class ν Θ () extends {s 1... s m super(e 1,..., e k ); fun ν 1 σ 1 ŝ 1... fun ν n σ n ŝ n } : Ψ Figure 10: Class and Interface Checking 6
7 Ψ Γ p p Ψ Γ true Iterable String s : Ψ Γ s 0 = Ψ Γ i 1 bi Iterable String s i : i Ψ Γ s 1... s n p Ψ Γ, n p =, ν 1 Θ 1 (Γ 1 ) : 1,..., ν n Θ n (Γ n ) : n Ψ Θ i Γ i Ψ Θ i i Ψ Θ i Γ Γ i true i s i : i Ψ Γ p Ψ Γ fun ν 1 Θ 1 (Γ 1 ) : 1 s 1... fun ν n Θ n (Γ n ) : n s n p Ψ Γ i : Ψ Ψ, Ψ Γ p Ψ Γ i p Ψ Γ c : Ψ Ψ, Ψ, Γ p Ψ Γ c p Ψ 0 = class Iterable E extends { }, class Boolean extends { negate () : Boolean ; and (that : Boolean ) : Boolean ; or (that : Boolean ) : Boolean ; through (upper : Boolean, includelower : Boolean, includeupper : Boolean ) : Iterable Boolean ; onwards (inclusive : Boolean ) : Iterable Boolean ; lessthan (that : Boolean, strict : Boolean ) : Boolean ; equals (that : Boolean ) : Boolean ; }, class Integer extends { negative () : Integer ; times (factor : Integer ) : Integer ; divide (divisor : Integer ) : Iterable Integer ; modulo (modulus : Integer ) : Iterable Integer ; plus (summand : Integer ) : Integer ; minus (subtrahend : Integer ) : Integer ; through (upper : Integer, includelower : Boolean, includeupper : Boolean ) : Iterable Integer ; onwards (inclusive : Boolean ) : Iterable Integer ; lessthan (that : Integer, strict : Boolean ) : Boolean ; equals (that : Integer ) : Boolean ; }, class Character extends { unicode () : Integer ; equals (that : Character ) : Boolean ; }, class String extends Iterable Character { equals (that : String ) : Boolean ; } 0 = character (unicode : Integer ) : Character, string (characters : Iterable Character ) : String Γ 0 = input : Iterable String Ψ 0 0 Γ 0 p p Figure 11: Program Checking 7
ΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 6/5/2006
Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Ολοι οι αριθμοί που αναφέρονται σε όλα τα ερωτήματα είναι μικρότεροι το 1000 εκτός αν ορίζεται διαφορετικά στη διατύπωση του προβλήματος. Διάρκεια: 3,5 ώρες Καλή
Διαβάστε περισσότεραThe Simply Typed Lambda Calculus
Type Inference Instead of writing type annotations, can we use an algorithm to infer what the type annotations should be? That depends on the type system. For simple type systems the answer is yes, and
Διαβάστε περισσότεραΠρόβλημα 1: Αναζήτηση Ελάχιστης/Μέγιστης Τιμής
Πρόβλημα 1: Αναζήτηση Ελάχιστης/Μέγιστης Τιμής Να γραφεί πρόγραμμα το οποίο δέχεται ως είσοδο μια ακολουθία S από n (n 40) ακέραιους αριθμούς και επιστρέφει ως έξοδο δύο ακολουθίες από θετικούς ακέραιους
Διαβάστε περισσότερα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,
Διαβάστε περισσότεραΕργαστήριο Ανάπτυξης Εφαρμογών Βάσεων Δεδομένων. Εξάμηνο 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
Διαβάστε περισσότερα6.1. Dirac Equation. Hamiltonian. Dirac Eq.
6.1. Dirac Equation Ref: M.Kaku, Quantum Field Theory, Oxford Univ Press (1993) η μν = η μν = diag(1, -1, -1, -1) p 0 = p 0 p = p i = -p i p μ p μ = p 0 p 0 + p i p i = E c 2 - p 2 = (m c) 2 H = c p 2
Διαβάστε περισσότεραEPL 603 TOPICS IN SOFTWARE ENGINEERING. Lab 5: Component Adaptation Environment (COPE)
EPL 603 TOPICS IN SOFTWARE ENGINEERING Lab 5: Component Adaptation Environment (COPE) Performing Static Analysis 1 Class Name: The fully qualified name of the specific class Type: The type of the class
Διαβάστε περισσότεραANSWERSHEET (TOPIC = DIFFERENTIAL CALCULUS) COLLECTION #2. h 0 h h 0 h h 0 ( ) g k = g 0 + g 1 + g g 2009 =?
Teko Classes IITJEE/AIEEE Maths by SUHAAG SIR, Bhopal, Ph (0755) 3 00 000 www.tekoclasses.com ANSWERSHEET (TOPIC DIFFERENTIAL CALCULUS) COLLECTION # Question Type A.Single Correct Type Q. (A) Sol least
Διαβάστε περισσότερα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
Διαβάστε περισσότεραΣυντακτικές λειτουργίες
2 Συντακτικές λειτουργίες (Syntactic functions) A. Πτώσεις και συντακτικές λειτουργίες (Cases and syntactic functions) The subject can be identified by asking ποιος (who) or τι (what) the sentence is about.
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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) =
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραGalatia SIL Keyboard Information
Galatia SIL Keyboard Information Keyboard ssignments The main purpose of the keyboards is to provide a wide range of keying options, so many characters can be entered in multiple ways. If you are typing
Διαβάστε περισσότεραPhys460.nb Solution for the t-dependent Schrodinger s equation How did we find the solution? (not required)
Phys460.nb 81 ψ n (t) is still the (same) eigenstate of H But for tdependent H. The answer is NO. 5.5.5. Solution for the tdependent Schrodinger s equation If we assume that at time t 0, the electron starts
Διαβάστε περισσότεραLecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3
Lecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3 1 State vector space and the dual space Space of wavefunctions The space of wavefunctions is the set of all
Διαβάστε περισσότεραEvery set of first-order formulas is equivalent to an independent set
Every set of first-order formulas is equivalent to an independent set May 6, 2008 Abstract A set of first-order formulas, whatever the cardinality of the set of symbols, is equivalent to an independent
Διαβάστε περισσότεραΚΥΠΡΙΑΚΟΣ ΣΥΝΔΕΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY 21 ος ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ Δεύτερος Γύρος - 30 Μαρτίου 2011
Διάρκεια Διαγωνισμού: 3 ώρες Απαντήστε όλες τις ερωτήσεις Μέγιστο Βάρος (20 Μονάδες) Δίνεται ένα σύνολο από N σφαιρίδια τα οποία δεν έχουν όλα το ίδιο βάρος μεταξύ τους και ένα κουτί που αντέχει μέχρι
Διαβάστε περισσότεραderivation of the Laplacian from rectangular to spherical coordinates
derivation of the Laplacian from rectangular to spherical coordinates swapnizzle 03-03- :5:43 We begin by recognizing the familiar conversion from rectangular to spherical coordinates (note that φ is used
Διαβάστε περισσότεραThe challenges of non-stable predicates
The challenges of non-stable predicates Consider a non-stable predicate Φ encoding, say, a safety property. We want to determine whether Φ holds for our program. The challenges of non-stable predicates
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 19/5/2007
Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Αν κάπου κάνετε κάποιες υποθέσεις να αναφερθούν στη σχετική ερώτηση. Όλα τα αρχεία που αναφέρονται στα προβλήματα βρίσκονται στον ίδιο φάκελο με το εκτελέσιμο
Διαβάστε περισσότεραHOMEWORK 4 = G. In order to plot the stress versus the stretch we define a normalized stretch:
HOMEWORK 4 Problem a For the fast loading case, we want to derive the relationship between P zz and λ z. We know that the nominal stress is expressed as: P zz = ψ λ z where λ z = λ λ z. Therefore, applying
Διαβάστε περισσότερα(C) 2010 Pearson Education, Inc. All rights reserved.
Connectionless transmission with datagrams. Connection-oriented transmission is like the telephone system You dial and are given a connection to the telephone of fthe person with whom you wish to communicate.
Διαβάστε περισσότεραΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 24/3/2007
Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Όλοι οι αριθμοί που αναφέρονται σε όλα τα ερωτήματα μικρότεροι του 10000 εκτός αν ορίζεται διαφορετικά στη διατύπωση του προβλήματος. Αν κάπου κάνετε κάποιες υποθέσεις
Διαβάστε περισσότεραΓΡΑΜΜΙΚΟΣ & ΔΙΚΤΥΑΚΟΣ ΠΡΟΓΡΑΜΜΑΤΙΣΜΟΣ
ΓΡΑΜΜΙΚΟΣ & ΔΙΚΤΥΑΚΟΣ ΠΡΟΓΡΑΜΜΑΤΙΣΜΟΣ Ενότητα 12: Συνοπτική Παρουσίαση Ανάπτυξης Κώδικα με το Matlab Σαμαράς Νικόλαος Άδειες Χρήσης Το παρόν εκπαιδευτικό υλικό υπόκειται σε άδειες χρήσης Creative Commons.
Διαβάστε περισσότεραDynamic types, Lambda calculus machines Section and Practice Problems Apr 21 22, 2016
Harvard School of Engineering and Applied Sciences CS 152: Programming Languages Dynamic types, Lambda calculus machines Apr 21 22, 2016 1 Dynamic types and contracts (a) To make sure you understand the
Διαβάστε περισσότεραAssalamu `alaikum wr. wb.
LUMP SUM Assalamu `alaikum wr. wb. LUMP SUM Wassalamu alaikum wr. wb. Assalamu `alaikum wr. wb. LUMP SUM Wassalamu alaikum wr. wb. LUMP SUM Lump sum lump sum lump sum. lump sum fixed price lump sum lump
Διαβάστε περισσότεραNowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in
Nowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in : tail in X, head in A nowhere-zero Γ-flow is a Γ-circulation such that
Διαβάστε περισσότεραExample Sheet 3 Solutions
Example Sheet 3 Solutions. i Regular Sturm-Liouville. ii Singular Sturm-Liouville mixed boundary conditions. iii Not Sturm-Liouville ODE is not in Sturm-Liouville form. iv Regular Sturm-Liouville note
Διαβάστε περισσότεραPartial Trace and Partial Transpose
Partial Trace and Partial Transpose by José Luis Gómez-Muñoz http://homepage.cem.itesm.mx/lgomez/quantum/ jose.luis.gomez@itesm.mx This document is based on suggestions by Anirban Das Introduction This
Διαβάστε περισσότεραΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ - ΤΜΗΜΑ ΠΛΗΡΟΦΟΡΙΚΗΣ ΕΠΛ 133: ΑΝΤΙΚΕΙΜΕΝΟΣΤΡΕΦΗΣ ΠΡΟΓΡΑΜΜΑΤΙΣΜΟΣ ΕΡΓΑΣΤΗΡΙΟ 3 Javadoc Tutorial
ΕΡΓΑΣΤΗΡΙΟ 3 Javadoc Tutorial Introduction Το Javadoc είναι ένα εργαλείο που παράγει αρχεία html (παρόμοιο με τις σελίδες στη διεύθυνση http://docs.oracle.com/javase/8/docs/api/index.html) από τα σχόλια
Διαβάστε περισσότερα3.4 SUM AND DIFFERENCE FORMULAS. NOTE: cos(α+β) cos α + cos β cos(α-β) cos α -cos β
3.4 SUM AND DIFFERENCE FORMULAS Page Theorem cos(αβ cos α cos β -sin α cos(α-β cos α cos β sin α NOTE: cos(αβ cos α cos β cos(α-β cos α -cos β Proof of cos(α-β cos α cos β sin α Let s use a unit circle
Διαβάστε περισσότεραAbout these lecture notes. Simply Typed λ-calculus. Types
About these lecture notes Simply Typed λ-calculus Akim Demaille akim@lrde.epita.fr EPITA École Pour l Informatique et les Techniques Avancées Many of these slides are largely inspired from Andrew D. Ker
Διαβάστε περισσότεραMath221: HW# 1 solutions
Math: HW# solutions Andy Royston October, 5 7.5.7, 3 rd Ed. We have a n = b n = a = fxdx = xdx =, x cos nxdx = x sin nx n sin nxdx n = cos nx n = n n, x sin nxdx = x cos nx n + cos nxdx n cos n = + sin
Διαβάστε περισσότεραOther Test Constructions: Likelihood Ratio & Bayes Tests
Other Test Constructions: Likelihood Ratio & Bayes Tests Side-Note: So far we have seen a few approaches for creating tests such as Neyman-Pearson Lemma ( most powerful tests of H 0 : θ = θ 0 vs H 1 :
Διαβάστε περισσότεραFractional Colorings and Zykov Products of graphs
Fractional Colorings and Zykov Products of graphs Who? Nichole Schimanski When? July 27, 2011 Graphs A graph, G, consists of a vertex set, V (G), and an edge set, E(G). V (G) is any finite set E(G) is
Διαβάστε περισσότερα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
Διαβάστε περισσότεραω ω ω ω ω ω+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 +
Διαβάστε περισσότεραST5224: Advanced Statistical Theory II
ST5224: Advanced Statistical Theory II 2014/2015: Semester II Tutorial 7 1. Let X be a sample from a population P and consider testing hypotheses H 0 : P = P 0 versus H 1 : P = P 1, where P j is a known
Διαβάστε περισσότερα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
Διαβάστε περισσότεραΕΠΙΧΕΙΡΗΣΙΑΚΗ ΑΛΛΗΛΟΓΡΑΦΙΑ ΚΑΙ ΕΠΙΚΟΙΝΩΝΙΑ ΣΤΗΝ ΑΓΓΛΙΚΗ ΓΛΩΣΣΑ
Ανοικτά Ακαδημαϊκά Μαθήματα στο ΤΕΙ Ιονίων Νήσων ΕΠΙΧΕΙΡΗΣΙΑΚΗ ΑΛΛΗΛΟΓΡΑΦΙΑ ΚΑΙ ΕΠΙΚΟΙΝΩΝΙΑ ΣΤΗΝ ΑΓΓΛΙΚΗ ΓΛΩΣΣΑ Ενότητα 1: Elements of Syntactic Structure Το περιεχόμενο του μαθήματος διατίθεται με άδεια
Διαβάστε περισσότεραDESIGN OF MACHINERY SOLUTION MANUAL h in h 4 0.
DESIGN OF MACHINERY SOLUTION MANUAL -7-1! PROBLEM -7 Statement: Design a double-dwell cam to move a follower from to 25 6, dwell for 12, fall 25 and dwell for the remader The total cycle must take 4 sec
Διαβάστε περισσότερα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.
Διαβάστε περισσότερα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
Διαβάστε περισσότεραΜορφοποίηση υπό όρους : Μορφή > Μορφοποίηση υπό όρους/γραμμές δεδομένων/μορφοποίηση μόο των κελιών που περιέχουν/
Μορφοποίηση υπό όρους : Μορφή > Μορφοποίηση υπό όρους/γραμμές δεδομένων/μορφοποίηση μόο των κελιών που περιέχουν/ Συνάρτηση round() Περιγραφή Η συνάρτηση ROUND στρογγυλοποιεί έναν αριθμό στον δεδομένο
Διαβάστε περισσότεραConcrete Mathematics Exercises from 30 September 2016
Concrete Mathematics Exercises from 30 September 2016 Silvio Capobianco Exercise 1.7 Let H(n) = J(n + 1) J(n). Equation (1.8) tells us that H(2n) = 2, and H(2n+1) = J(2n+2) J(2n+1) = (2J(n+1) 1) (2J(n)+1)
Διαβάστε περισσότεραSOAP API. https://bulksmsn.gr. Table of Contents
SOAP API https://bulksmsn.gr Table of Contents Send SMS...2 Query SMS...3 Multiple Query SMS...4 Credits...5 Save Contact...5 Delete Contact...7 Delete Message...8 Email: sales@bulksmsn.gr, Τηλ: 211 850
Διαβάστε περισσότερα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
Διαβάστε περισσότεραΑπόκριση σε Μοναδιαία Ωστική Δύναμη (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
Διαβάστε περισσότεραCongruence Classes of Invertible Matrices of Order 3 over F 2
International Journal of Algebra, Vol. 8, 24, no. 5, 239-246 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/.2988/ija.24.422 Congruence Classes of Invertible Matrices of Order 3 over F 2 Ligong An and
Διαβάστε περισσότεραΜηχανική Μάθηση Hypothesis Testing
ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ Μηχανική Μάθηση Hypothesis Testing Γιώργος Μπορμπουδάκης Τμήμα Επιστήμης Υπολογιστών Procedure 1. Form the null (H 0 ) and alternative (H 1 ) hypothesis 2. Consider
Διαβάστε περισσότεραStatistical Inference I Locally most powerful tests
Statistical Inference I Locally most powerful tests Shirsendu Mukherjee Department of Statistics, Asutosh College, Kolkata, India. shirsendu st@yahoo.co.in So far we have treated the testing of one-sided
Διαβάστε περισσότεραOverview. Transition Semantics. Configurations and the transition relation. Executions and computation
Overview Transition Semantics Configurations and the transition relation Executions and computation Inference rules for small-step structural operational semantics for the simple imperative language Transition
Διαβάστε περισσότεραPARTIAL NOTES for 6.1 Trigonometric Identities
PARTIAL NOTES for 6.1 Trigonometric Identities tanθ = sinθ cosθ cotθ = cosθ sinθ BASIC IDENTITIES cscθ = 1 sinθ secθ = 1 cosθ cotθ = 1 tanθ PYTHAGOREAN IDENTITIES sin θ + cos θ =1 tan θ +1= sec θ 1 + cot
Διαβάστε περισσότεραdepartment listing department name αχχουντσ ϕανε βαλικτ δδσϕηασδδη σδηφγ ασκϕηλκ τεχηνιχαλ αλαν ϕουν διξ τεχηνιχαλ ϕοην µαριανι
She selects the option. Jenny starts with the al listing. This has employees listed within She drills down through the employee. The inferred ER sttricture relates this to the redcords in the databasee
Διαβάστε περισσότερα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
Διαβάστε περισσότεραCode Breaker. TEACHER s NOTES
TEACHER s NOTES Time: 50 minutes Learning Outcomes: To relate the genetic code to the assembly of proteins To summarize factors that lead to different types of mutations To distinguish among positive,
Διαβάστε περισσότεραΑλγόριθμοι και πολυπλοκότητα 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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραSection 7.6 Double and Half Angle Formulas
09 Section 7. Double and Half Angle Fmulas To derive the double-angles fmulas, we will use the sum of two angles fmulas that we developed in the last section. We will let α θ and β θ: cos(θ) cos(θ + θ)
Διαβάστε περισσότερα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
Διαβάστε περισσότεραMatrices and Determinants
Matrices and Determinants SUBJECTIVE PROBLEMS: Q 1. For what value of k do the following system of equations possess a non-trivial (i.e., not all zero) solution over the set of rationals Q? x + ky + 3z
Διαβάστε περισσότεραPartial Differential Equations in Biology The boundary element method. March 26, 2013
The boundary element method March 26, 203 Introduction and notation The problem: u = f in D R d u = ϕ in Γ D u n = g on Γ N, where D = Γ D Γ N, Γ D Γ N = (possibly, Γ D = [Neumann problem] or Γ N = [Dirichlet
Διαβάστε περισσότεραSolutions to Exercise Sheet 5
Solutions to Eercise Sheet 5 jacques@ucsd.edu. Let X and Y be random variables with joint pdf f(, y) = 3y( + y) where and y. Determine each of the following probabilities. Solutions. a. P (X ). b. P (X
Διαβάστε περισσότεραΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 11/3/2006
ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 11/3/26 Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Ολοι οι αριθμοί που αναφέρονται σε όλα τα ερωτήματα μικρότεροι το 1 εκτός αν ορίζεται διαφορετικά στη διατύπωση
Διαβάστε περισσότερα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
Διαβάστε περισσότεραLecture 15 - Root System Axiomatics
Lecture 15 - Root System Axiomatics Nov 1, 01 In this lecture we examine root systems from an axiomatic point of view. 1 Reflections If v R n, then it determines a hyperplane, denoted P v, through the
Διαβάστε περισσότεραk A = [k, k]( )[a 1, a 2 ] = [ka 1,ka 2 ] 4For the division of two intervals of confidence in R +
Chapter 3. Fuzzy Arithmetic 3- Fuzzy arithmetic: ~Addition(+) and subtraction (-): Let A = [a and B = [b, b in R If x [a and y [b, b than x+y [a +b +b Symbolically,we write A(+)B = [a (+)[b, b = [a +b
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραReminders: linear functions
Reminders: linear functions Let U and V be vector spaces over the same field F. Definition A function f : U V is linear if for every u 1, u 2 U, f (u 1 + u 2 ) = f (u 1 ) + f (u 2 ), and for every u U
Διαβάστε περισσότεραTMA4115 Matematikk 3
TMA4115 Matematikk 3 Andrew Stacey Norges Teknisk-Naturvitenskapelige Universitet Trondheim Spring 2010 Lecture 12: Mathematics Marvellous Matrices Andrew Stacey Norges Teknisk-Naturvitenskapelige Universitet
Διαβάστε περισσότεραNotes on the Open Economy
Notes on the Open Econom Ben J. Heijdra Universit of Groningen April 24 Introduction In this note we stud the two-countr model of Table.4 in more detail. restated here for convenience. The model is Table.4.
Διαβάστε περισσότεραPhysical DB Design. B-Trees Index files can become quite large for large main files Indices on index files are possible.
B-Trees Index files can become quite large for large main files Indices on index files are possible 3 rd -level index 2 nd -level index 1 st -level index Main file 1 The 1 st -level index consists of pairs
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραΠΑΝΕΠΙΣΤΗΜΙΟ ΠΕΙΡΑΙΩΣ ΤΜΗΜΑ ΠΛΗΡΟΦΟΡΙΚΗΣ. Βάσεις Δεδομένων (4 ο εξάμηνο) Εργαστήριο MySQL #2
ΠΑΝΕΠΙΣΤΗΜΙΟ ΠΕΙΡΑΙΩΣ ΤΜΗΜΑ ΠΛΗΡΟΦΟΡΙΚΗΣ Βάσεις Δεδομένων (4 ο εξάμηνο) Εργαστήριο MySQL #2 Διδάσκων: Γιάννης Θεοδωρίδης Συντάκτης Κειμένου: Βαγγέλης Κατσικάρος Φεβρουάριος 2008 Περιεχόμενα SQL Language
Διαβάστε περισσότεραBlock Ciphers Modes. Ramki Thurimella
Block Ciphers Modes Ramki Thurimella Only Encryption I.e. messages could be modified Should not assume that nonsensical messages do no harm Always must be combined with authentication 2 Padding Must be
Διαβάστε περισσότεραSecond Order RLC Filters
ECEN 60 Circuits/Electronics Spring 007-0-07 P. Mathys Second Order RLC Filters RLC Lowpass Filter A passive RLC lowpass filter (LPF) circuit is shown in the following schematic. R L C v O (t) Using phasor
Διαβάστε περισσότερα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
Διαβάστε περισσότεραΕργαστήριο Ανάπτυξης Εφαρμογών Βάσεων Δεδομένων. Εξάμηνο 7 ο
Εργαστήριο Ανάπτυξης Εφαρμογών Βάσεων Δεδομένων Εξάμηνο 7 ο JDBC JDBC is a set of classes and interfaces written in Java that allows Java programs to send SQL statements to a database like Oracle JDBC
Διαβάστε περισσότεραΤΕΧΝΟΛΟΓΙΚΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ ΤΜΗΜΑ ΝΟΣΗΛΕΥΤΙΚΗΣ
ΤΕΧΝΟΛΟΓΙΚΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ ΤΜΗΜΑ ΝΟΣΗΛΕΥΤΙΚΗΣ ΠΤΥΧΙΑΚΗ ΕΡΓΑΣΙΑ ΨΥΧΟΛΟΓΙΚΕΣ ΕΠΙΠΤΩΣΕΙΣ ΣΕ ΓΥΝΑΙΚΕΣ ΜΕΤΑ ΑΠΟ ΜΑΣΤΕΚΤΟΜΗ ΓΕΩΡΓΙΑ ΤΡΙΣΟΚΚΑ Λευκωσία 2012 ΤΕΧΝΟΛΟΓΙΚΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ ΣΧΟΛΗ ΕΠΙΣΤΗΜΩΝ
Διαβάστε περισσότεραMean bond enthalpy Standard enthalpy of formation Bond N H N N N N H O O O
Q1. (a) Explain the meaning of the terms mean bond enthalpy and standard enthalpy of formation. Mean bond enthalpy... Standard enthalpy of formation... (5) (b) Some mean bond enthalpies are given below.
Διαβάστε περισσότεραΠΤΥΧΙΑΚΗ ΕΡΓΑΣΙΑ ΒΑΛΕΝΤΙΝΑ ΠΑΠΑΔΟΠΟΥΛΟΥ Α.Μ.: 09/061. Υπεύθυνος Καθηγητής: Σάββας Μακρίδης
Α.Τ.Ε.Ι. ΙΟΝΙΩΝ ΝΗΣΩΝ ΠΑΡΑΡΤΗΜΑ ΑΡΓΟΣΤΟΛΙΟΥ ΤΜΗΜΑ ΔΗΜΟΣΙΩΝ ΣΧΕΣΕΩΝ ΚΑΙ ΕΠΙΚΟΙΝΩΝΙΑΣ ΠΤΥΧΙΑΚΗ ΕΡΓΑΣΙΑ «Η διαμόρφωση επικοινωνιακής στρατηγικής (και των τακτικών ενεργειών) για την ενδυνάμωση της εταιρικής
Διαβάστε περισσότερα5.4 The Poisson Distribution.
The worst thing you can do about a situation is nothing. Sr. O Shea Jackson 5.4 The Poisson Distribution. Description of the Poisson Distribution Discrete probability distribution. The random variable
Διαβάστε περισσότερα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
Διαβάστε περισσότεραΗ ΠΡΟΣΩΠΙΚΗ ΟΡΙΟΘΕΤΗΣΗ ΤΟΥ ΧΩΡΟΥ Η ΠΕΡΙΠΤΩΣΗ ΤΩΝ CHAT ROOMS
ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΤΕΧΝΟΛΟΓΙΚΟ ΕΚΠΑΙΔΕΥΤΙΚΟ ΙΔΡΥΜΑ Ι Ο Ν Ι Ω Ν Ν Η Σ Ω Ν ΤΜΗΜΑ ΔΗΜΟΣΙΩΝ ΣΧΕΣΕΩΝ & ΕΠΙΚΟΙΝΩΝΙΑΣ Ταχ. Δ/νση : ΑΤΕΙ Ιονίων Νήσων- Λεωφόρος Αντώνη Τρίτση Αργοστόλι Κεφαλληνίας, Ελλάδα 28100,+30
Διαβάστε περισσότεραΕπιβλέπουσα Καθηγήτρια: ΣΟΦΙΑ ΑΡΑΒΟΥ ΠΑΠΑΔΑΤΟΥ
EΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΕΚΠΑΙΔΕΥΤΙΚΟ ΤΕΧΝΟΛΟΓΙΚΟ ΙΔΡΥΜΑ ΤΕΙ ΙΟΝΙΩΝ ΝΗΣΩΝ ΤΜΗΜΑ ΔΗΜΟΣΙΩΝ ΣΧΕΣΕΩΝ & ΕΠΙΚΟΙΝΩΝΙΑΣ Ταχ. Δ/νση : Λεωφ. Αντ.Τρίτση, Αργοστόλι Κεφαλληνίας Τ.Κ. 28 100 τηλ. : 26710-27311 fax : 26710-27312
Διαβάστε περισσότερα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,...,
Διαβάστε περισσότεραGeneral 2 2 PT -Symmetric Matrices and Jordan Blocks 1
General 2 2 PT -Symmetric Matrices and Jordan Blocks 1 Qing-hai Wang National University of Singapore Quantum Physics with Non-Hermitian Operators Max-Planck-Institut für Physik komplexer Systeme Dresden,
Διαβάστε περισσότεραUniform Convergence of Fourier Series Michael Taylor
Uniform Convergence of Fourier Series Michael Taylor Given f L 1 T 1 ), we consider the partial sums of the Fourier series of f: N 1) S N fθ) = ˆfk)e ikθ. k= N A calculation gives the Dirichlet formula
Διαβάστε περισσότεραb. Use the parametrization from (a) to compute the area of S a as S a ds. Be sure to substitute for ds!
MTH U341 urface Integrals, tokes theorem, the divergence theorem To be turned in Wed., Dec. 1. 1. Let be the sphere of radius a, x 2 + y 2 + z 2 a 2. a. Use spherical coordinates (with ρ a) to parametrize.
Διαβάστε περισσότεραPotential Dividers. 46 minutes. 46 marks. Page 1 of 11
Potential Dividers 46 minutes 46 marks Page 1 of 11 Q1. In the circuit shown in the figure below, the battery, of negligible internal resistance, has an emf of 30 V. The pd across the lamp is 6.0 V and
Διαβάστε περισσότεραRight Rear Door. Let's now finish the door hinge saga with the right rear door
Right Rear Door Let's now finish the door hinge saga with the right rear door You may have been already guessed my steps, so there is not much to describe in detail. Old upper one file:///c /Documents
Διαβάστε περισσότεραMATH423 String Theory Solutions 4. = 0 τ = f(s). (1) dτ ds = dxµ dτ f (s) (2) dτ 2 [f (s)] 2 + dxµ. dτ f (s) (3)
1. MATH43 String Theory Solutions 4 x = 0 τ = fs). 1) = = f s) ) x = x [f s)] + f s) 3) equation of motion is x = 0 if an only if f s) = 0 i.e. fs) = As + B with A, B constants. i.e. allowe reparametrisations
Διαβάστε περισσότεραΜΕΤΑΠΤΥΧΙΑΚΗ ΔΙΠΛΩΜΑΤΙΚΗ ΕΡΓΑΣΙΑ «ΘΕΜΑ»
ΠΑΝΕΠΙΣΤΗΜΙΟ ΑΙΓΑΙΟΥ ΣΧΟΛΗ ΑΝΘΡΩΠΙΣΤΙΚΩΝ ΕΠΙΣΤΗΜΩΝ ΤΜΗΜΑ ΕΠΙΣΤΗΜΩΝ ΤΗΣ ΠΡΟΣΧΟΛΙΚΗΣ ΑΓΩΓΗΣ ΚΑΙ ΤΟΥ ΕΚΠΑΙΔΕΥΤΙΚΟΥ ΣΧΕΔΙΑΣΜΟΥ Π.Μ.Σ. «ΠΕΡΙΒΑΛΛΟΝΤΙΚΗ ΕΚΠΑΙΔΕΥΣΗ» ΜΕΤΑΠΤΥΧΙΑΚΗ ΔΙΠΛΩΜΑΤΙΚΗ ΕΡΓΑΣΙΑ «ΘΕΜΑ» «Εφαρμογή
Διαβάστε περισσότερα