9 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 9 / 9
Yayın Comment on "Modified Baptista type chaotic cryptosystem via matrix secret key" [Phys. Lett. A 372 (2008) 5427](Elsevier Science BV, 2009-09-07) Rhouma, Rhouma; Solak, Ercan; Arroyo, David; Li, Shujun; Alvarez, Gonzalo; Belghith, Safya MdimeghIn this comment, we analyze a recently proposed Baptista-like cryptosystem and show that it is not invertible. Others weaknesses are also reported. A modified version of this cryptosystem is proposed to show how to overcome the non-invertibility.Yayın k-Means clustering by using the calculated Z-scores from QEEG data of children with dyslexia(Taylor & Francis, 2023) Eroğlu, Günet; Arman, FehimLearning the subtype of dyslexia may help shorten the rehabilitation process and focus more on the relevant special education or diet for children with dyslexia. For this purpose, the resting-state eyes-open 2-min QEEG measurement data were collected from 112 children with dyslexia (84 male, 28 female) between 7 and 11 years old for 96 sessions per subject on average. The z-scores are calculated for each band power and each channel, and outliers are eliminated afterward. Using the k-Means clustering method, three different clusters are identified. Cluster 1 (19% of the cases) has positive z-scores for theta, alpha, beta-1, beta-2, and gamma-band powers in all channels. Cluster 2 (76% of the cases) has negative z-scores for theta, alpha, beta-1, beta-2, and gamma-band powers in all channels. Cluster 3 (5% of the cases) has positive z-scores for theta, alpha, beta-1, beta-2, and gamma-band powers at AF3, F3, FC5, and T7 channels and mostly negative z-scores for other channels. In Cluster 3, there is temporal disruption which is a typical description of dyslexia. In Cluster 1, there is a general brain inflammation as both slow and fast waves are detected in the same channels. In Cluster 2, there is a brain maturation delay and a mild inflammation. After Auto Train Brain training, most of the cases resemble more of Cluster 2, which may mean that inflammation is reduced and brain maturation delay comes up to the surface which might be the result of inflammation. Moreover, Cluster 2 center values at the posterior parts of the brain shift toward the mean values at these channels after 60 sessions. It means, Auto Train Brain training improves the posterior parts of the brain for children with dyslexia, which were the most relevant regions to be strengthened for dyslexia.Yayın Implicit theories and self-efficacy in an introductory programming course(Institute of Electrical and Electronics Engineers Inc, 2018-08) Tek, Faik Boray; Benli, Kristin Surpuhi; Deveci, EzgiContribution: This paper examined student effort and performance in an introductory programming course with respect to student-held implicit theories and self-efficacy. Background: Implicit theories and self-efficacy help in understanding academic success, which must be considered when developing effective learning strategies for programming.Research Questions: Are implicit theories of intelligence and programming, and programming-efficacy, related to each other and to student success in programming? Is it possible to predict student performance in a course using these constructs? Methodology: Two consecutive surveys ({N}=100 and {N}=81) were administered to non-CS engineering students in Işik University, Turkey. Findings: Implicit theories of programming-aptitude and programming-efficacy are interrelated and positively correlated with effort, performance, and previous failures in the course. Although it was not possible to predict student course grade the data confirms that students who believe in improvable programming aptitude have significantly higher programming efficacy, report more effort, and get higher course grades. In addition, failed students tend to associate the failure with fixed programming aptitude; repeating students favor fixed programming aptitude theory and have lower programming-efficacy, which increases the possibility of further failure.Yayın Cryptanalysis of a cryptosystem based on discretized two-dimensional chaotic maps(Elsevier Science BV, 2008-11-17) Solak, Ercan; Çokal, CahitRecently, an encryption algorithm based on two-dimensional discretized chaotic maps was proposed [Xiang et al., Phys. Lett. A 364 (2007) 252]. In this Letter, we analyze the security weaknesses of the proposal. Using the algebraic dependencies among system parameters. we show that its effective key space can be shrunk. We demonstrate a chosen-ciphertext attack that reveals a portion of the key.Yayın Cryptanalysis of a chaos-based image encryption algorithm(Elsevier Science BV, 2009-03-30) Çokal, Cahit; Solak, ErcanA chaos-based image encryption algorithm was proposed in [Z.-H. Guan, F. Huang, W. Guan, Phys. Lett. A 346 (2005) 153]. In this Letter, we analyze the security weaknesses of the proposal. By applying chosen-plaintext and known-plaintext attacks, we show that all the secret parameters can be revealed.Yayın The routine design-modular distributed modeling platform for distributed routine design and simulation-based testing of distributed assemblies(Cambridge University Press, 2008-12-12) Eskil, Mustafa Taner; Sticklen, Jon; Radcliffe, ClarkIn this paper we describe a conceptual framework and implementation of a tool that supports task-directed, distributed routine design (RD) augmented with simulation-based design testing. In our research, we leverage the modular distributed modeling (MDM) methodology to simulate the interaction of design components in an assembly. The major improvement we have made in the RD methodology is to extend it with the capabilities of incorporating remotely represented off-the-shelf components in design and simulation-based testing of a distributed assembly. The deliverable of our research is the RD-MDM platform, which is capable of automatically selecting intellectually protected off the shelf design components over the Internet, integrating these components in an assembly, running simulations for design testing, and publishing the approved design without disclosing the proprietary information.Yayın Algebraic break of a cryptosystem based on discretized two-dimensional chaotic maps(Elsevier Science BV, 2009-03-30) Solak, Ercan; Çokal, CahitRecently, a cryptosystem based on two-dimensional discretized chaotic maps was proposed [T. Xiang, et al., Phys. Lett. A 364 (2007) 252]. In this Letter, we cryptanalyze the proposal using algebraic methods. We give three different attacks that yield all the secret parameters of the cryptosystem.Yayın A mobile app that uses neurofeedback and multi-sensory learning methods improves reading abilities in dyslexia: a pilot study(Routledge, 2022-07-03) Eroğlu, Günet; Teber, Serap Tıraş; Ertürk, Kardelen; Kırmızı, Meltem; Ekici, Barış; Arman, Fehim; Balcısoy, Selim Saffet; Özcan, Yusuf Ziya; Çetin, MüjdatReading comprehension is difficult to improve for children with dyslexia because of the continuing demands of orthographic decoding in combination with limited working memory capacity. Children with dyslexia get special education that improves spelling, phonemic and vocabulary awareness, however the latest research indicated that special education does not improve reading comprehension. With the aim of improving reading comprehension, reading speed and all other reading abilities of children with dyslexia, Auto Train Brain that is a novel mobile app using neurofeedback and multi-sensory learning methods was developed. With a clinical study, we wanted to demonstrate the effectiveness of Auto Train Brain on reading abilities. We compared the cognitive improvements obtained with Auto Train Brain with the improvements obtained with special dyslexia training. Auto Train Brain was applied to 16 children with dyslexia 60 times for 30 minutes. The control group consisted of 14 children with dyslexia who did not have remedial training with Auto Train Brain, but who did continue special education. The TILLS test was applied to both the experimental and the control group at the beginning of the experiment and after a 6-month duration from the first TILLS test. Comparison of the pre- and post- TILLS test results indicated that applying neurofeedback and multi-sensory learning method improved reading comprehension of the experimental group more than that of the control group statistically significantly. Both Auto Train Brain and special education improved phonemic awareness and nonword spelling.Yayın Colored simultaneous geometric embeddings and universal pointsets(Springer, 2011-07) Brandes, Ulrik; Erten, Cesim; Estrella-Balderrama, Alejandro; Fowler, J. Joseph; Frati, Fabrizio; Geyer, Markus; Gutwenger, Carsten; Hong, Seok-Hee; Kaufmann, Michael; Kobourov, Stephen G.; Liotta, Giuseppe; Mutzel, Petra; Symvonis, AntoniosUniversal pointsets can be used for visualizing multiple relationships on the same set of objects or for visualizing dynamic graph processes. In simultaneous geometric embeddings, the same point in the plane is used to represent the same object as a way to preserve the viewer's mental map. In colored simultaneous embeddings this restriction is relaxed, by allowing a given object to map to a subset of points in the plane. Specifically, consider a set of graphs on the same set of n vertices partitioned into k colors. Finding a corresponding set of k-colored points in the plane such that each vertex is mapped to a point of the same color so as to allow a straight-line plane drawing of each graph is the problem of colored simultaneous geometric embedding. For n-vertex paths, we show that there exist universal pointsets of size n, colored with two or three colors. We use this result to construct colored simultaneous geometric embeddings for a 2-colored tree together with any number of 2-colored paths, and more generally, a 2-colored outerplanar graph together with any number of 2-colored paths. For n-vertex trees, we construct small near-universal pointsets for 3-colored caterpillars of size n, 3-colored radius-2 stars of size n+3, and 2-colored spiders of size n. For n-vertex outerplanar graphs, we show that these same universal pointsets also suffice for 3-colored K (3)-caterpillars, 3-colored K (3)-stars, and 2-colored fans, respectively. We also present several negative results, showing that there exist a 2-colored planar graph and pseudo-forest, three 3-colored outerplanar graphs, four 4-colored pseudo-forests, three 5-colored pseudo-forests, five 5-colored paths, two 6-colored biconnected outerplanar graphs, three 6-colored cycles, four 6-colored paths, and three 9-colored paths that cannot be simultaneously embedded.
