Arastirmanin amaci ortaokul ogrencilerinin “etkin yurttas” ve “hukuk kurallari” kavramlarina iliskin algilarini metaforlar araciligiyla ortaya cikarmaktir. Arastirmanin calisma grubunu, 2016--2017 egitim ogretim yilinda Istanbul’daki bir ortaokulun 7. Sinifinda egitim goren 129 ogrenci olusturmaktadir. Arastirmada nitel arastirma yontemleri kullanilmistir. Arastirma verileri, “Etkin Yurttas …… gibidir, cunku ……” ve “Hukuk kurallari …… gibidir, cunku ….” cumlelerini iceren bir form araciligiyla toplanmistir. Verilerin analizi ve yorumlanmasinda icerik analizi teknigi kullanilmistir. Arastirmanin sonuclarina gore; ogrenciler “etkin yurttaslik” kavramina yonelik 60 farkli metafor gelistirmis olup, bunlar “degerli ve yasam kaynagi, koruyucu ve mucadeleci, uretim ve calismanin kaynagi, yirtici ve guclu, rehber ve yol gosteren seklinde bes farkli kategoride adlandirilmistir. Ayni sekilde “hukuk kurallari” kavramina yonelik de 62 farkli metafor cikmis olup, bunlar da “koruyucu, yol gosteren, olaganustu guc kaynagi ve kahraman, hayat veren, adalet ve dengenin kaynagi” seklinde farkli bes kategoriye ayrilmistir. Etkin yurttaslik kavramina yonelik ogrencilerden en cok sirasiyla “Karinca, ari, inek, aslan, tavuk ve kartal” metaforlari gelistirilirken; hukuk kurallari kavramina yonelik ise, “baba, anne, Kur’an-i Kerim, agac, ogretmen, terazi, yara bandi” seklinde metaforlar on plana cikmistir. Etkin yurttaslik kavramina iliskin metaforlarin “uretim ve calismanin kaynagi” kategorisinde, hukuk kurallari kavraminin ise, “koruyucu” kategorisinde daha fazla yer aldigi gorulmustur. Dolayisiyla ortaokul ogrencileri etkin yurttasi ulkesi icin ureten calisan faydali olan bir birey olarak gorurken, hukuk kurallarini ise, insanlarin huzurlu ve saglikli bir ortamda yasamlarini surdurmeleri icin koruyucu bir rolde gordukleri seklinde bir sonuca ulasilmistir.
In this paper, we study rotational surfaces of elliptic, hyperbolic andparabolic type with pointwise 1-type Gauss map which have spacelike profilecurve in four dimensional pseudo Euclidean space E4-2 and obtain somecharacterizations for these rotational surfaces to have pointwise 1-type Gaussmap.
Imaging methods used in modern neuroscience experiments are quickly producinglarge amounts of data capable of providing increasing amounts of knowledgeabout neuroanatomy and function. A great deal of information in these datasetsis relatively unexplored and untapped. One of the bottlenecks in knowledgeextraction is that often there is no feedback loop between the knowledgeproduced (e.g., graph, density estimate, or other statistic) and the earlierstages of the pipeline (e.g., acquisition). We thus advocate for thedevelopment of sample-to-knowledge discovery pipelines that one can use tooptimize acquisition and processing steps with a particular end goal (i.e.,piece of knowledge) in mind. We therefore propose that optimization takes placenot just within each processing stage but also between adjacent (andnon-adjacent) steps of the pipeline. Furthermore, we explore the existingcategories of knowledge representation and models to motivate the types ofexperiments and analysis needed to achieve the ultimate goal. To illustratethis approach, we provide an experimental paradigm to answer questions aboutlarge-scale synaptic distributions through a multimodal approach combiningX-ray microtomography and electron microscopy.
In this paper we study the structure of specific linear codes called DNAcodes. The first attempts on studying such codes have been proposed over fourelement rings which are naturally matched with DNA four letters. Later, double(pair) DNA strings or in general $k$-DNA strings called $k$-mers have beenmatched with some special rings and codes over such rings with specificproperties are studied. However, these matchings in general are notstraightforward and because of the fact that the reverse of the codewords($k$-mers) need to exist in the code, the matching problem is difficult and itis referred to as the reversibility problem. Here, 8-mers (DNA 8-bases) arematched with the ring elements of $R_{16}=F_{16}+uF_{16}+vF_{16}+uvF_{16}.$Furthermore, cyclic codes over the ring $R_{16}$ where the multiplication istaken to be noncommutative with respect to the automorphism $\theta$ arestudied. The preference on the skewness is shown to be very useful andpractical especially since this serves as a direct solution to thereversibility problem.
This paper is a comment on the paper "Quantum Mechanics and AlgorithmicRandomness" was written by Ulvi Yurtsever \cite{Yurtsever} and the brieflyexplanation of the algorithmic randomness of quantum measurements results. There are differences between the computability of probability sources, (which means there is an algorithm that can define the way that random processor probability source generates the numbers ) and the algorithmic randomness ofthe sequences or strings which are produced by a source. We may have the sourcewithout a computable algorithm for that but it can produce compressible orincompressible strings. For example, so far there is no computable algorithmthat can define the abstract meaning of randomness even the easiest one,Bernoulli probability distribution. Historically and philosophically there manyscientist believe the existence of the algorithm for a random process is acontradiction because in their opinion, in the definition of a random variable,implicitly assumed that there is no reason for the happening of an event and wejust know the probabilities. There is however no need to enter into this matterhere. As in the paper mentioned, all the algorithms for simulating a randomprocess try to pass the statistical tests and be close to the abstract meaningof it.
This paper presents a definition of a construction for long polar codes.Recently, we know that partial order is a universal property of theconstruction with a sublinear complexity for polar codes. In order to describethe partial order, addition and left-swap operators are only defined asuniversal up to now. In this study, we first propose $1+\log_2 \log_2 N$universal operators to describe multiple partial order for the block length$N=2^n$. By using these operators, some known antichains can be universallyordered. Furthermore, by using a simple geometric property of Gaussian approximation,we define an attractor that is a pre-defined subset of synthetic channels. Theyare universally less reliable than the natural channel $W$. Then, we show thatthe cardinality of this attractor is $(n+2)$-th Fibonacci number which is asignificantly large number of channels for long codes. The main contribution isthat there are significant number of synthetic channels explicitly defined asalmost useless by the help of attractor and multiple partial order. As aresult, proposed attractor with multiple partial order can be seen as anefficient tool to investigate and design extremely long codes.