14 results
Search Results
Now showing 1 - 10 of 14
Conference Object Citation - WoS: 6Jmathnorm: a Database Normalization Tool Using Mathematica(Springer-verlag Berlin, 2007) Yazici, Ali; Karakaya, ZiyaThis paper is about designing a complete interactive tool, named JMathNorm, for relational database (RDB) normalization using Mathematica. It is an extension of the prototype developed by the same authors [1] with the inclusion of Second Normal Form (2NF), and Boyce-Codd Normal Form (BCNF) in addition to the existing Third normal Form (3NF) module. The tool developed in this study is complete and can be used for real-time database design as well as an aid in teaching fundamental concepts of DB normalization to students with limited mathematical background. JMathNorm also supports interactive use of modules for experimenting the fundamental set operations such as closure, and full closure together with modules to obtain the minimal cover of the functional dependency set and testing an attribute for a candidate key. JMathNorm's GUI interface is written in Java and utilizes Mathematica's Mink facility to drive the Mathematica kernel.Conference Object Citation - WoS: 13Search-Based Parallel Refactoring Using Population-Based Direct Approaches(Springer-verlag Berlin, 2011) Kilic, Hurevren; Koc, Ekin; Cereci, IbrahimAutomated software refactoring is known to be one of the "hard" combinatorial optimization problems of the search-based software engineering field. The difficulty is mainly due to candidate solution representation, objective function description and necessity of functional behavior preservation of software. The problem is formulated as a combinatorial optimization problem whose objective function is characterized by an aggregate of object-oriented metrics or pareto-front solution description. In our recent empirical study, we have reported the results of a comparison among alternative search algorithms applied for the same problem: pure random, steepest descent, multiple first descent, simulated annealing, multiple steepest descent and artificial bee colony searches. The main goal of the study was to investigate potential of alternative multiple and population-based search techniques. The results showed that multiple steepest descent and artificial bee colony algorithms were most suitable two approaches for an efficient solution of the problem. An important observation was either with depth-oriented multiple steepest descent or breadth-oriented population-based artficial bee colony searches, better results could be obtained through higher number of executions supported by a lightweight solution representation. On the other hand different from multiple steepest descent search, population-based, scalable and being suitable for parallel execution characteristics of artificial bee colony search made the population-based choices to be the topic of this empirical study. I In this study, we report the search-based parallel refactoring results of an empirical comparative study among three population-based search techniques namely, artificial bee colony search, local beam search and stochastic beam search and a non-populated technique multiple steepest descent as the baseline. For our purpose, we used parallel features of our prototype automated refactoring tool A-CMA written in Java language. A-CMA accepts bytecode compiled Java codes as its input. It supports 20 different refactoring actions that realize searches on design landscape defined by an adhoc quality model being an aggregation of 24 object-oriented software metrics. We experimented 6 input programs written in Java where 5 of them being open source codes and one student project code. The empirical results showed that for almost all of the considered input programs with different run parameter settings, local beam search is the most suitable population-based search technique for the efficient solution of the search-based parallel refactoring problem in terms of mean and maximum normalized quality gain. However, we observed that the computational time requirement for local beam search becomes rather high when the beam size exceeds 60. On the other hand, even though it is not able to identify high quality designs for less populated search setups, time-efficiency and scalability properties of artificial bee colony search makes it a good choice for population sizes >= 200.Conference Object Citation - WoS: 21Remarks on Suzuki (c)-condition(Springer-verlag Berlin, 2012) Karapinar, ErdalIn this manuscript, first we introduce some new conditions, inspirit of Suzuki's (C)-condition, on a self-mapping T on a subset K of a Banach space E. Secondly, we obtain some new fixed point theorems under these conditions.Conference Object ISDE 2011 PC Co-chairs' Message(Springer-verlag Berlin, 2011) Mishra, Alok; Muench, Juergen; Colomo-Palacios, Ricardo; Mishra, Deepti[No Abstract Available]Conference Object Romberg Integration(Springer-verlag Berlin, 2003) Yazici, A; Ergenç, T; Altas, IHigher order approximations of an integral can be obtained from lower order ones in a systematic way. For 1-D integrals Romberg Integration is an example which is based upon the composite trapezoidal rule and the well-known Euler-Maclaurin expansion of the error. In this work, Mathematica is utilized to illustrate the method and the underlying theory in a symbolic fashion. This approach seems plausible for discussing integration in a numerical computing laboratory environment.Conference Object Time Evolution of the Spectral Data Associated With the Finite Complex Toda Lattice(Springer-verlag Berlin, 2012) Huseynov, Aydin; Guseinov, Gusein Sh.Spectral data for complex Jacobi matrices are introduced and the time evolution of the spectral data for the Jacobi matrix associated with the solution of the finite complex Toda lattice is computed.Conference Object Citation - WoS: 2Symbolic Polynomial Interpolation Using Mathematica(Springer-verlag Berlin, 2004) Yazici, A; Altas, I; Ergenc, TThis paper discusses teaching polynomial interpolation with the help of Mathematica. The symbolic power of Mathematica is utilized to prove a theorem for the error term in Lagrange interpolating formula. Derivation of the Lagrange formula is provided symbolically and numerically. Runge phenomenon is also illustrated. A simple and efficient symbolic derivation of cubic splines is also provided.Conference Object Some Intrinsic Properties of Interacting Deterministic Finite Automata(Springer-verlag Berlin, 2003) Kiliç, HThe agent controllability of the environment is investigated using simple deterministic interacting automata pair model. For this purpose, a general extended design approach for such couple is developed. In the experiments, we focused on simple binary state case and generated stability/cycle behavior characteristics map for the couple. Examinations on the map showed that the behavior of the couple shows some initial value sensitivity. Also, we observed some non-controllable agent/environment couple definition which may imply an inherent communication border between agent and the environment.Conference Object Citation - WoS: 4Citation - Scopus: 3Systematic Mapping Study on Performance Scalability in Big Data on Cloud Using Vm and Container(Springer-verlag Berlin, 2016) Gokhan, Cansu; Karakaya, Ziya; Yazici, AliIn recent years, big data and cloud computing have gained importance in IT and business. These two technologies are becoming complementing in a way that the former requires large amount of storage and computation power, which are the key enabler technologies of Big Data; the latter, cloud computing, brings the opportunity to scale on-demand computation power and provides massive quantities of storage space. Until recently, the only technique used in computation resource utilization was based on the hypervisor, which is used to create the virtual machine. Nowadays, another technique, which claims better resource utilization, called "container" is becoming popular. This technique is otherwise known as "lightweight virtualization" since it creates completely isolated virtual environments on top of underlying operating systems. The main objective of this study is to clarify the research area concerned with performance issues using VM and container in big data on cloud, and to give a direction for future research.Book Part Multi-disciplinary, Global Student Collaboration(Springer-verlag Berlin, 2014) Milewski, A. E.; Swigger, K.; Serce, F. C.The goal of this study is to understand the dynamics of collaboration within globally-distributed teams working in a realistic Human-System Interaction (further called HSI) environment and Software Engineering context. Quantitative data on communications were collected by capturing virtually all of the communications between the team members. Qualitative data were collected through the interviews conducted by the involved instructors. The results reveal some of the challenges associated with working in interdisciplinary and global settings and suggest areas of caution for such HSI educational experiences in the future.
