139 results
Search Results
Now showing 1 - 10 of 139
Conference Object Citation - Scopus: 2A Tool To Enhance Cooperation and Knowledge Transfer Among Software Developers(2009) Aydin,S.; Mishra,D.Software developers have been successfully tailoring software development methods according to the project situation and more so in small scale software development organizations. There is a need to share this knowledge with other developers who may be facing the same project situation so that they can benefit from other people experiences. In this paper, an approach to enhance cooperation among software developers, in terms of sharing the knowledge that was used successfully in past projects, is proposed. A web-based tool is developed that can assist in creation, storage and extraction of methods related with requirement elicitation phase. These methods are categorized according to certain criteria which helps in searching a method that will be most appropriate in a given project situation. This approach and tool can also be used for other software development activities. © 2009 Springer Berlin Heidelberg.Conference Object The Psychometric Properties of the Hogg Eco-Anxiety Scale in the Turkish Context(Hogrefe Ag-hogrefe Ag Suisse, 2023) Turkarslan, Kutlu Kagan; Kozak, Ekin Doga; Yildirim, Julide CerenConference Object Citation - WoS: 2A Multi-Paradigm Complexity Metric (mcm)(Springer-verlag Berlin, 2011) Misra, Sanjay; Akman, Ibrahim; Cafer, FeridHuge amount of researches and software metrics have been proposed for procedural and object-oriented languages. However, there are only few metrics available in the literature related with multi-paradigm programming languages. In this paper, we propose a metric to evaluate the code written in multi-paradigm language. Our proposed metric can be used for most of the programming paradigms, including both procedural and object-oriented languages.Conference Object Citation - WoS: 8Citation - Scopus: 7UTILIZATION OF REACTOR GRADE PLUTONIUM AS ENERGY MULTIPLIER IN THE LIFE ENGINE(Amer Nuclear Soc, 2012) Sahin, Sumer; Sahin, Haci Mehmet; Acir, AdemThe accumulated reactor grade (RG)-plutonium as nuclear waste of conventional reactors is estimated to exceed 1700 tonnes. Laser Inertial Confinement Fusion Fission Energy (LIFE) engine is considered to incinerate RG-plutonium in stockpiles. Calculations have been conducted for a constant fusion driver power of 500 MWth in S-8-P-3 approximation using 238-neutron groups. RG-plutonium out of the nuclear waste of LWRs is used in form of fissile carbide fuel in TRISO particles with volume fractions of 2, 3, 4, 5 and 6 %, homogenously dispersed in the Flibe coolant. Respective tritium breeding ratio (TBR) values per incident fits ion neutron are calculated as TBR = 1.35, 1.52, 1.73, 2.02 and 2.47 at start-up. With the burn up of fissionable RG-Pu isotopes in the coolant, TBR decreases gradually. Similarly, blanket energy multiplications are calculated as M-0 = 3.8, 5.5, 7.7, 10.8 and 15.4 at start-up, respectively. Calculations have indicated prospects of achievability of very high burn up values (> 400 000 MD.D/MT).Conference Object Scale Up Internet-Based Business Through Distributed Data Centers(Springer international Publishing Ag, 2015) Yu, Liguo; Mishra, Alok; Mishra, DeeptiDistributed data centers are becoming more and more important for internet-based companies. Without distributed data centers, it will be hard for internet companies to scale up their business. The traditional centralized data center suffers the drawback of bottle neck and single failure problem. Therefore, more and more internet companies are building distributed data centers, and more and more business are moved onto distributed Web services. This paper reviews the history of distributed Web services and studies their current status through examining the distributed data centers of several top Internet companies. Based on the study, we conclude that distributed services, including distributed data centers, are the key factors to scale up the business of a company, especially, an internet-based company.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: 9A New Classifier Design With Fuzzy Functions(Springer-verlag Berlin, 2007) Celikytlmaz, Ash; Tuerksen, I. Burhan; Aktas, Ramazan; Doganay, M. Mete; Ceylan, N. BasakThis paper presents a new fuzzy classifier design, which constructs one classifier for each fuzzy partition of a given system. The new approach, namely Fuzzy Classifier Functions (FCF), is an adaptation of our generic design on Fuzzy Functions to classification problems. This approach couples any fuzzy clustering algorithm with any classification method, in a unique way. The presented model derives fuzzy functions (rules) from data to classify patterns into number of classes. Fuzzy c-means clustering is used to capture hidden fuzzy patterns and a linear or a non-linear classifier function is used to build one classifier model for each pattern identified. The performance of each classifier is enhanced by using corresponding membership values of the data vectors as additional input variables. FCF is proposed as an alternate representation and reasoning schema to fuzzy rule base classifiers. The proposed method is evaluated by the comparison of experiments with the standard classifier methods using cross validation on test patterns.Conference Object Citation - WoS: 2Object-Oriented Inheritance Metrics: Cognitive Complexity Perspective(Springer-verlag Berlin, 2009) Mishra, Deepti; Mishra, AlokIdentifying high cognitive complexity modules can lead to a better quality software system and can help during maintenance also. It has been found that inheritance has an impact on cognitive complexity of a software system. In this paper, two inheritance metrics based on cognitive complexity, one at class level CCI (Class Complexity due to Inheritance) and another at program level ACI (Average Complexity of a program due to Inheritance), have been proposed for object-oriented software systems. These metrics are also compared with other well known object-oriented inheritance metrics.Conference Object Citation - Scopus: 16Target Tracking Using Artificial Potentials and Sliding Mode Control(2004) Gazi,V.; Ordóñez,R.In this article we develop an algorithm for capturing/intercepting a moving target based on the sliding mode control method. First, we consider a "kinematic" model (in a sense) for the capture/intercept problem and develop a method for that case. Then, we build on the developed method to include general fully actuated vehicle dynamics for the pursuer agent. The algorithm is robust with respect to the system uncertainties and additive disturbances. Finally, we also provide a numerical simulation in order to illustrate the procedure.Conference Object Citation - WoS: 3Software Architecture in Distributed Software Development: a Review(Springer-verlag Berlin, 2013) Mishra, Alok; Mishra, DeeptiThis paper presents a literature review of distributed software development (DSD) or global software development (GSD) and software architecture. The main focus is to highlight the current researches, observations, as well as practice directions in these areas. The results have been limited to peer-reviewed conference papers and journal articles, and analysis reports that major studies have been performed in software architecture and global software development, while the empirical studies of interfacing distributed/global software development and software architecture has only received very little attention among researchers up to now. This indicates the need for future research in these areas.
