This paper examines the problematization of cultural issues related tothe dual spacization of life. The emergence of the second space of lifeover the first place of life combining local and translocal, national andtransnational capacities and challenges. We discuss the capacities andopportunities occurring through the instant communication industrywhich made the spontaneous connection between a...

positivism is an empirical approach for understanding of human communication and phenomena, which raised firstly french famous thinker “august comte”. human and social sciences were under domination of positive thought for a long time. in criminal law inter alia italian famous thinkers sought to analyses the crime problem with a positive approach. however, some of their point of view such as bo...

The aim of this study was to test whether both phonetic and phonological representations of intonation can be rapidly modified when imitating utterances belonging to a different regional variety of the same language. Our main hypothesis was that tonal alignment, just as other phonetic features of speech, would be rapidly modified by Italian speakers when imitating pitch accents of a different (...

Control of three phase inverters has been an important issue in recent years. This paper proposes active disturbance rejection control (ADRC) scheme for controlling three phase inverters. The main advantage of ADRC that motivated us for using this controller for inverter is that it is model independent.  This controller is used in a double loop structure including an inner current loop and oute...

Let G = (V,E) be a connected undirected graph. For any vertex v ∈ V , the closed neighborhood of v is N [v] = {v} ∪ {u ∈ V | uv ∈ E }. For S ⊆ V , the closed neighborhood of S is N [S] = ⋃ v∈S N [v]. The subgraph weakly induced by S is 〈S〉w = (N [S], E ∩ (S × N [S])). A set S is a weakly-connected dominating set of G if S is dominating and 〈S〉w is connected. The weakly-connected domination numb...

In this paper we consider the (d, n)-domination number, γd,n(Qn), the distance-d domination number γd(Qn) and the connected distance-d domination number γc,d(Qn) of ndimensional hypercube graphs Qn. We show that for 2 ≤ d ≤ bn/2c, and n ≥ 4, γd,n(Qn) ≤ 2n−2d+2, improving the bound of Xie and Xu [19]. We also show that γd(Qn) ≤ 2n−2d+2−r, for 2 − 1 ≤ n − 2d + 1 < 2 − 1, and γc,d(Qn) ≤ 2n−d, for ...

A set S of vertices in a graph G is a double total dominating set, abbreviated DTDS, of G if every vertex of G is adjacent to least two vertices in S. The minimum cardinality of a DTDS of G is the double total domination number of G. In this paper, we study the DTDS of the generalized Petersen graphs. Mathematics Subject Classification: 05C35

An efficient dominating set (or perfect code) in a graph is a set of vertices the closed neighborhoods of which partition the vertex set of the graph. The minimum weight efficient domination problem is the problem of finding an efficient dominating set of minimum weight in a given vertex-weighted graph; the maximum weight efficient domination problem is defined similarly. We develop a framework...