17 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 10 / 17
Yayın A designing practice and two coding practices for extreme programming (XP)(Springer Verlag, 2003) Yıldız, Mustafa; Kuru, SelahattinThis paper introduces three new XP practices and reports the experience of applying them to web based software development. These are issue- based programming, comment-first coding and just in time code ownership. The example project is development of an on-line student information and registration software for a university.Yayın Driver recognition using gaussian mixture models and decision fusion techniques(Springer-Verlag Berlin, 2008) Benli, Kristin Surpuhi; Düzağaç, Remzi; Eskil, Mustafa TanerIn this paper we present our research in driver recognition. The goal of this study is to investigate the performance of different classifier fusion techniques in a driver recognition scenario. We are using solely driving behavior signals such as break and accelerator pedal pressure, engine RPM, vehicle speed; steering wheel angle for identifying the driver identities. We modeled each driver using Gaussian Mixture Models, obtained posterior probabilities of identities and combined these scores using different fixed mid trainable (adaptive) fusion methods. We observed error rates is low as 0.35% in recognition of 100 drivers using trainable combiners. We conclude that the fusion of multi-modal classifier results is very successful in biometric recognition of a person in a car setting.Yayın Construction of a Turkish proposition bank(Tubitak Scientific & Technical Research Council Turkey, 2018) Ak, Koray; Toprak, Cansu; Esgel, Volkan; Yıldız, Olcay TanerThis paper describes our approach to developing the Turkish PropBank by adopting the semantic role-labeling guidelines of the original PropBank and using the translation of the English Penn-TreeBank as a resource. We discuss the semantic annotation process of the PropBank and language-specific cases for Turkish, the tools we have developed for annotation, and quality control for multiuser annotation. In the current phase of the project, more than 9500 sentences are semantically analyzed and predicate-argument information is extracted for 1330 verbs and 1914 verb senses. Our plan is to annotate 17,000 sentences by the end of 2017.Yayın ICamp - The educational web for higher education(Springer Verlag, 2006) Kieslinger, Barbara; Wild, Fridolin; Arsun, Onur İhsaniCamp is an EC-funded research project in the area of Technology Enhanced Learning (TEL) that aims to support collaboration and social networking across systems, countries and disciplines in higher education. The concept of an iCamp Space will build on existing interfaces and integrate shared community features. Interoperability amongst different open source learning systems and tools is the key to successful sustainability of iCamp. The content for this collaboration within social communities is provided via distributed networked repositories including, for example, content brokerage platforms, online libraries, and learning object databases. The innovative pedagogical model of iCamp is based on social constructivist learning theories. iCamp creates an environment for a new way of social networking in higher education that puts more emphasis on self-organised, self-directed learning, social networking and cross-cultural collaboration.Yayın Multivariate statistical tests for comparing classification algorithms(Springer, Berlin, Heidelberg, 2011) Yıldız, Olcay Taner; Aslan, Özlem; Alpaydın, Ahmet İbrahim EthemThe misclassification error which is usually used in tests to compare classification algorithms, does not make a distinction between the sources of error, namely, false positives and false negatives. Instead of summing these in a single number, we propose to collect multivariate statistics and use multivariate tests on them. Information retrieval uses the measures of precision and recall, and signal detection uses true positive rate (tpr) and false positive rate (fpr) and a multivariate test can also use such two values instead of combining them in a single value, such as error or average precision. For example, we can have bivariate tests for (precision, recall) or (tpr, fpr). We propose to use the pairwise test based on Hotelling's multivariate T test to compare two algorithms or multivariate analysis of variance (MANOVA) to compare L > 2 algorithms. In our experiments, we show that the multivariate tests have higher power than the univariate error test, that is, they can detect differences that the error test cannot, and we also discuss how the decisions made by different multivariate tests differ, to be able to point out where to use which. We also show how multivariate or univariate pairwise tests can be used as post-hoc tests after MANOVA to find cliques of algorithms, or order them along separate dimensions.Yayın Modeling and simulation support to the defense planning process(Sage Publications Inc, 2017-04-01) Çayırcı, Erdal; Özçakır, LütfüDefense planning is a crucial part of the defense process. It identifies the capabilities required for the future defense environment, analyzes the capability shortfalls, prioritizes them, and provides the fundamental inputs for their development. Modeling and simulation may significantly contribute to the success of defense planning. However, neither the theory nor the tools are mature enough to fulfill the defense planning requirements. Various types of simulation tools, such as static, dynamic, deterministic, stochastic, closed, discrete, continuous, and symbiotic, in multiple levels of resolution and fidelity are needed to support the different stages and phases. The verification and validation of the models and the analysis of the input and output data are critical. Yet another challenge is that the uncertainties related to the contemporary defense scenarios are mostly not in aleatory but in the epistemic domain. In this paper, we briefly present a new computer-assisted defense planning process. Then, we introduce the service-oriented cloud approach for the modeling and simulation support to the process.Yayın Battle Royale Optimizer for solving binary optimization problems(Elsevier B.V., 2022-05) Akan, Taymaz; Agahian, Saeid; Dehkharghani, RahimBattle Royale Optimizer (BRO) is a recently proposed metaheuristic optimization algorithm used only in continuous problem spaces. The BinBRO is a binary version of BRO. The BinBRO algorithm employs a differential expression, which utilizes a dissimilarity measure between binary vectors instead of a vector subtraction operator, used in the original BRO algorithm to find the nearest neighbor. To evaluate BinBRO, we applied it to two popular benchmark datasets: the uncapacitated facility location problem (UFLP) and the maximum-cut (Max-Cut) graph problems from OR-Library. An open-source MATLAB implementation of BinBRO is available on CodeOcean and GitHub websites.Yayın Colored simultaneous geometric embeddings(Springer-Verlag Berlin, 2007) Brandes, Ulrik; Erten, Cesim; Fowler, J. Joseph; Frati, Fabrizio; Geyer, Markus; Gutwenger, Carsten; Hong, Seok-Hee; Kaufmann, Michael; Kobourov, Stephen G.; Liotta, Giuseppe; Mutzel, Petra; Symvonis, AntoniosWe introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a universal pointset of size n for paths colored with two or three colors. We use these results to show that colored simultaneous geometric embeddings exist for: (1) a 2-colored tree together with any number of 2-colored paths and (2) a 2-colored outerplanar graph together with any number of 2-colored paths. We also show that there does not exist a universal pointset of size n for paths colored with five colors. We finally show that the following simultaneous embeddings are not possible: (1) three 6-colored cycles, (2) four 6-colored paths, and (3) three 9-colored paths.Yayın Chunking in Turkish with conditional random fields(Springer-Verlag, 2015-04-14) Yıldız, Olcay Taner; Solak, Ercan; Ehsani, Razieh; Görgün, OnurIn this paper, we report our work on chunking in Turkish. We used the data that we generated by manually translating a subset of the Penn Treebank. We exploited the already available tags in the trees to automatically identify and label chunks in their Turkish translations. We used conditional random fields (CRF) to train a model over the annotated data. We report our results on different levels of chunk resolution.Yayın A tree-based approach for English-to-Turkish translation(Tubitak Scientific & Technical Research Council Turkey, 2019) Bakay, Özge; Avar, Begüm; Yıldız, Olcay TanerIn this paper, we present our English-to-Turkish translation methodology, which adopts a tree-based approach. Our approach relies on tree analysis and the application of structural modification rules to get the target side (Turkish) trees from source side (English) ones. We also use morphological analysis to get candidate root words and apply tree-based rules to obtain the agglutinated target words. Compared to earlier work on English-to-Turkish translation using phrase-based models, we have been able to obtain higher BLEU scores in our current study. Our syntactic subtree permutation strategy, combined with a word replacement algorithm, provides a 67% relative improvement from a baseline 12.8 to 21.4 BLEU, all averaged over 10-fold cross-validation. As future work, improvements in choosing the correct senses and structural rules are needed.
