@article {1417, title = {Analysis of an individual-based influenza epidemic model using random forest metamodels and adaptive sequential sampling}, journal = {Systems Research and Behavioral Science}, volume = {37}, year = {2020}, pages = {936-958}, abstract = {

Abstract This study proposes a three-step procedure for the analysis of input{\textendash}response relationships of dynamic models, which enables the analyst to develop a better understanding about the dynamics of the system. The main building block of the procedure is a random forest metamodel capturing the input{\textendash}output relationships. We utilize an active learning approach as the second step to improve the accuracy of the metamodel. In the last step, we develop a novel way to present the information captured by the metamodel as a set of intelligible IF{\textendash}THEN rules. For illustration, we use the FluTE model, which is an individual-based influenza epidemic model. We observe that the number of daily applicable vaccines determines the success of an intervention strategy the most. Another critical observation is that when the daily available vaccines are constrained, nonpharmaceutical strategies should be incorporated to reduce the extent of the outbreak.

}, keywords = {adaptive sequential sampling, FluTE, individual-based modelling, Metamodeling, Rule Extraction}, doi = {https://doi.org/10.1002/sres.2763}, url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/sres.2763}, author = {Edali, Mert and G{\"o}nen{\c c} Y{\"u}cel} } @article {1439, title = {Assignment problem with conflicts}, journal = {Computers \& Operations Research}, volume = {111}, year = {2019}, pages = {214-229}, abstract = {

We focus on an extension of the assignment problem with additional conflict (pair) constraints in conjunction with the assignment constraints and binary restrictions. Given a bipartite graph with a cost associated with each edge and a conflict set of edge pairs, the assignment problem with conflict constraints corresponds to finding a minimum weight perfect matching without any conflicting edge pair. For example, some chemicals cannot be processed on close processors, food and toxic products cannot be stored neighboring locations at the same storage area, and machines cannot be sent to process jobs without satisfying some spatial constraints. Unlike the well-known assignment problem, this problem is NP-hard. We first introduce a realistic special class and demonstrate its polynomial solvability. Then, we propose a Branch-and-Bound algorithm and a Russian Doll Search algorithm using the assignment problem relaxations for lower bound computations, and introduce combinatorial branching rules based on the conflicting edges in an optimal solution of the relaxations. According to the extensive computational experiments we can say that the proposed algorithms are very efficient.

}, keywords = {Assignment problem, Branch-and-bound, Conflicts, integer programming}, issn = {0305-0548}, doi = {https://doi.org/10.1016/j.cor.2019.07.001}, url = {https://www.sciencedirect.com/science/article/pii/S0305054819301777}, author = {Temel {\"O}ncan and Zeynep {\c S}uvak and M. Hakan Aky{\"u}z and I. Kuban Altinel} } @article {1503, title = {On Almost Well-Covered Graphs of Girth at Least 6}, journal = {Discrete Mathematics \& Theoretical Computer Science}, volume = {20}, year = {2018}, author = {Milani{\v c}, Martin and Hujdurovi{\'c}, Ademir and G{\"o}z{\"u}pek, Didem and Ekim, Tinaz} } @article {1414, title = {Automated Analysis of Regularities Between Model Parameters and Output Using Support Vector Regression in Conjunction with Decision Trees}, journal = {Journal of Artificial Societies and Social Simulation}, volume = {21}, year = {2018}, pages = {1}, abstract = {

Opening the black-box of nonlinear relationships between model inputs and outputs, significantly contributes to the understanding of the dynamic problem being studied. Considering the weaknesses and disadvantages of human-guided and systematic techniques offered in the literature, this paper presents a model analysis and exploration tool for agent-based models. The tool first approximates input-output relationships by developing a metamodel, a simplified representation of the original agent-based model. For this purpose, it utilizes support vector regression, which is capable of approximating highly nonlinear systems accurately. Following metamodel fitting, the tool incorporates a tree-based method to extract knowledge embedded in the metamodel. The resulting tree is then expressed as a set of IF-THEN rules that have high comprehensibility compared to complex metamodel function. We utilized the tool for the exploration of Traffic Basic model and the results show the relationship between model input and output. Furthermore, rules extracted from the metamodel point out certain counter-intuitive results of the model which are not easily inferred from the raw input-output data. We also discuss potential uses of our tool and provide the R script which makes the analysis repeatable for other agent-based models.

}, keywords = {decision tree, MetaModel, R, Rule Extraction, Support Vector Regression, Traffic}, issn = {1460-7425}, doi = {10.18564/jasss.3786}, url = {http://jasss.soc.surrey.ac.uk/21/4/1.html}, author = {Edali, Mert and G{\"o}nen{\c c} Y{\"u}cel} } @article {1157, title = {Autoregressive forests for multivariate time series modeling}, journal = {Pattern Recognition}, volume = {73}, year = {2018}, pages = {202 - 215}, keywords = {Classification, Ensemble learning, Multivariate time series, Time series representation, Vector autoregression}, issn = {0031-3203}, doi = {https://doi.org/10.1016/j.patcog.2017.08.016}, url = {http://www.sciencedirect.com/science/article/pii/S0031320317303291}, author = {Kerem Sinan Tuncel and Mustafa Gokce Baydogan} } @article {1160, title = {Accelerating Transition Dynamics in City Regions: A Qualitative Modeling Perspective}, journal = {Sustainability}, volume = {9}, year = {2017}, pages = {1254}, author = {Valkering, Pieter and G{\"o}nen{\c c} Y{\"u}cel and Gebetsroither-Geringer, Ernst and Markvica, Karin and Meynaerts, Erika and Frantzeskaki, Niki} } @inbook {1187, title = {Affect measurement: A roadmap through approaches, technologies, and data analysis}, booktitle = {Emotions and Affect in Human Factors and Human-Computer Interaction}, year = {2017}, pages = {255{\textendash}288}, publisher = {Elsevier}, organization = {Elsevier}, author = {Gonzalez-Sanchez, Javier and Mustafa Gokce Baydogan and Chavez-Echeagaray, Maria Elena and Atkinson, Robert K and Burleson, Winslow} } @proceedings {1192, title = {The Analysis of Characteristic Dynamics of Stock Management Structure with a First Order Supply Line Delay}, journal = {34th International Conference of the System Dynamics Society}, year = {2016}, address = {Delft, the Netherlands}, author = {Mehmet S and Hakan Ya{\c s}arcan} } @article {1512, title = {Advances on defective parameters in graphs}, journal = {Discrete Optimization}, volume = {16}, year = {2015}, pages = {62-69}, abstract = {

We consider the generalization of Ramsey numbers to the defective framework using k-dense and k-sparse sets. We construct the first tableaux for defective Ramsey numbers with exact values whenever it is known, and lower and upper bounds otherwise. In light of defective Ramsey numbers, we consider the defective cocoloring problem which consists of partitioning the vertex set of a given graph into k-sparse and k-dense sets. By the help of efficient graph generation methods, we show that c0(4)=12,c1(3)=12 and c2(2)=10 where ck(m) is the maximum order n such that all n-graphs can be k-defectively cocolored using at most m colors. We also give the numbers of k-defective m-cocritical graphs of order n (until n=10) for different levels of defectiveness and m=2,3 and 4.

}, keywords = {Cocritical graphs, Defective cocoloring, Defective Ramsey numbers, Efficient graph generation}, issn = {1572-5286}, doi = {https://doi.org/10.1016/j.disopt.2015.01.002}, url = {https://www.sciencedirect.com/science/article/pii/S1572528615000031}, author = {Ahu Akdemir and Ekim, Tinaz} } @article {1468, title = {An Adaptive CONWIP Mechanism for Hybrid Production Systems}, journal = {International Journal of Advanced Manufacturing Technology}, volume = {74}, year = {2014}, pages = {715{\textendash}727}, author = {Aybek Korugan and Gupta, Surendra M} } @inbook {Yucel2013a, title = {The actor-option framework: a general framework for modelling socio-technical systems in transitions}, booktitle = {Infranomics: Sustainability, Engineering Design and Governance}, series = {Topics in Safety, Risk, Reliability and Quality}, volume = {24}, year = {2013}, pages = {407{\textendash}418}, publisher = {Springer International Publishing}, organization = {Springer International Publishing}, address = {Cham}, keywords = {modelling, simulation, socio-technical transitions}, isbn = {978-3-319-02492-9}, doi = {10.1007/978-3-319-02493-6}, url = {http://link.springer.com/10.1007/978-3-319-02493-6}, author = {G{\"o}nen{\c c} Y{\"u}cel}, editor = {Gheorghe, Adrian V. and Masera, Marcelo and Katina, Polinpapilinho F.} } @conference {39, title = {Affect Recognition in Learning Scenarios: Matching Facial-and BCI-Based Values}, booktitle = {13th IEEE International Conference on Advanced Learning Technologies (ICALT{\textquoteright}13)}, year = {2013}, publisher = {IEEE}, organization = {IEEE}, author = {Javier Gonzalez-Sanchez and Maria Elena Chavez-Echeagaray and Lijia Lin and Mustafa Gokce Baydogan and Robert Christopherson and David Gibson and Robert Atkinson and Winslow Burleson} } @article {Yucel2011, title = {Automated parameter specification in dynamic feedback models based on behavior pattern features}, journal = {System Dynamics Review}, volume = {27}, number = {2}, year = {2011}, pages = {195{\textendash}215}, publisher = {Wiley Online Library}, keywords = {Calibration}, doi = {10.1002/sdr}, url = {http://onlinelibrary.wiley.com/doi/10.1002/sdr.457/full}, author = {G{\"o}nen{\c c} Y{\"u}cel and Yaman Barlas} } @article {ccanakouglu2007analysis, title = {Analysis of a two-stage telecommunication supply chain with technology dependent demand}, journal = {European Journal of Operational Research}, volume = {177}, number = {2}, year = {2007}, pages = {995{\textendash}1012}, publisher = {North-Holland}, author = {Canako{\u g}lu, Ethem and Taner Bilgi{\c c}} } @conference {ekcsiouglu2007automobile, title = {Automobile drivers{\textquoteright} steering force characteristics}, booktitle = {Proceedings of 37th International Conference on Computers and Industrial Engineering}, number = {590-594}, year = {2007}, author = {Mahmut Ek{\c s}io{\u g}lu and K{\i}z{\i}laslan, Kemaal} } @article {demange2006approximation, title = {On the approximation of Min Split-coloring and Min Cocoloring.}, journal = {J. Graph Algorithms Appl.}, volume = {10}, number = {2}, year = {2006}, pages = {297{\textendash}315}, author = {Demange, Marc and Ekim, Tinaz and de Werra, Dominique and others} } @article {Derflinger;Hoermann:2005a, title = {Asymptotically Optimal Design Points for Rejection Algorithms}, journal = {Communications in Statistics: Simulation and Computation}, volume = {34}, number = {4}, year = {2005}, pages = {879-893}, author = {Derflinger, Gerhard and Wolfgang H{\"o}rmann} } @article {ekim2004approximation, title = {Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximationa}, journal = {International Journal of Computer Mathematics}, volume = {81}, number = {5}, year = {2004}, pages = {569{\textendash}582}, publisher = {Taylor \& Francis Group}, author = {Ekim, Tinaz and Paschos, Vangelis Th} } @book {724, title = {Automatic Nonuniform Random Variate Generation}, year = {2004}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {Berlin Heidelberg}, author = {Wolfgang H{\"o}rmann and Leydold, Josef and Derflinger, Gerhard} } @article {Leydold;etal:2003a, title = {An Automatic Code Generator for Nonuniform Random Variate Generation}, journal = {Mathematics and Computers in Simulation}, volume = {62}, number = {3{\textendash}6}, year = {2003}, pages = {405{\textendash}412}, author = {Leydold, Josef and Derflinger, Gerhard and Tirler, G{\"u}nter and Wolfgang H{\"o}rmann} } @article {Hoermann:2000a, title = {Algorithm 802: An Automatic Generator for Bivariate Log-Concave Distributions}, journal = {ACMTOMS}, volume = {26}, number = {1}, year = {2000}, pages = {201{\textendash}219}, abstract = {

Different automatic (also called universal or black-box) methods have been suggested to sample from univariate log-concave distributions. Our new automatic algorithm for bivariate log-concave distributions is based on the method of transformed density rejection. In order to construct a hat function for a rejection algorithm the bivariate density is transformed by the logarithm into a concave function. Then it is possible to construct a dominating function by taking the minimum of several tangent planes, which are by exponentiation transformed back into the original scale. The choice of the points of contact is automated using adaptive rejection sampling. This means that points that are rejected by the rejection algorithm can be used as additional points of contact. The paper describes the details how this main idea can be used to construct Algorithm ALC2D that can generate random pairs from all bivariate log-concave distributions with known domain, computable density and computable partial derivatives.

}, url = {http://www.acm.org/pubs/citations/journals/toms/2000-26-1/p201-hormann/}, author = {Wolfgang H{\"o}rmann} } @conference {Hoermann;Leydold:2000a, title = {Automatic Random Variate Generation for Simulation Input}, booktitle = {Proceedings of the 2000 Winter Simulation Conference}, year = {2000}, pages = {675{\textendash}682}, author = {Wolfgang H{\"o}rmann and Leydold, Josef} } @article {bilge1997agv, title = {AGV systems with multi-load carriers: basic issues and potential benefits}, journal = {Journal of manufacturing systems}, volume = {16}, number = {3}, year = {1997}, pages = {159{\textendash}174}, publisher = {Elsevier}, author = {{\"U}mit Bilge and Tanchoco, JMA} } @conference {oommen1997arbitrary, title = {Arbitrary distance function estimation using discrete vector quantization}, booktitle = {Neural Networks, 1997., International Conference on}, volume = {2}, year = {1997}, pages = {1272{\textendash}1277}, publisher = {IEEE}, organization = {IEEE}, author = {Oommen, John and I. Kuban Altinel and Necati Aras} } @conference {Leydold;Hoermann:1997a, title = {The automatic generation of one- and multi-dimensional distributions with transformed density rejection}, booktitle = {Proceedings of the 15th IMACS World-Congress, Berlin, Vol 2}, year = {1997}, pages = {757{\textendash}760}, author = {Leydold, Josef and Wolfgang H{\"o}rmann} } @conference {Hoermann;Derflinger:1997a, title = {An automatic generator for a large class of unimodal discrete distributions}, booktitle = {ESM 97}, year = {1997}, pages = {139{\textendash}144}, author = {Wolfgang H{\"o}rmann and Derflinger, Gerhard} } @conference {eksioglu1996artificial, title = {Artificial neural network-based prediction models for determiing maximum acceptable frequency of a drilling task}, booktitle = {Advances in Applied Ergonomics (1st International Conference on Applied Ergonomics)}, year = {1996}, pages = {646{\textendash}649}, publisher = {USA Publishing}, organization = {USA Publishing}, author = {Mahmut Ek{\c s}io{\u g}lu and Fernandez, Jeffrey E.} } @conference {50018430, title = {{Arbitrary distance function estimation using vector quantization}}, booktitle = {International Symposium on Neural Networks}, year = {1995}, doi = {10.1109/ICNN.1995.487272}, author = {John Oommen and I. Kuban Altinel and Necati Aras} } @conference {ekcsiouglu1995artificial, title = {An artificial neural network (ANN)}, booktitle = {Advances in Industrial Ergonomics and Safety VII (Proceedings of the Tenth Annual International Industrial Ergonomics and Safety Conference)}, year = {1995}, pages = {577{\textendash}584}, publisher = {Taylor \& Francis}, organization = {Taylor \& Francis}, author = {Mahmut Ek{\c s}io{\u g}lu and Fernandez, Jeffrey E and Twomey, Janet M} } @article {Hoermann;Derflinger:1990a, title = {The ACR method for generating normal random variables}, journal = {OR Spektrum}, volume = {12}, number = {3}, year = {1990}, pages = {181{\textendash}185}, keywords = {acceptance-complement method, ACR method, decomposition method, normal random number generator, ratio of uniform method}, author = {Wolfgang H{\"o}rmann and Derflinger, Gerhard} }