Now showing items 1-20 of 26

    • Analysis of concurrency control protocols for real-time database systems 

      Ulusoy, Ö. (Elsevier, 1998)
      This paper provides an approximate analytic solution method for evaluating the performance of concurrency control protocols developed for real-time database systems (RTDBSs). Transactions processed in a RTDBS are associated ...
    • An animation system for fracturing of rigid objects 

      Küçükyilmaz, A.; Özgüç, B. (Springer, 2005)
      This paper describes a system for the animation of fracturing brittle objects. The system combines rigid body simulation methods with a constraint-based model to animate fracturing of arbitrary polyhedral shaped objects ...
    • A compound graph layout algorithm for biological pathways 

      Dogrusoz, U.; Giral, E.; Cetintas, A.; Civril, A.; Demir, E. (Springer, 2004)
      We present a new compound graph layout algorithm based on traditional force-directed layout scheme with extensions for nesting and other application-specific constraints. The algorithm has been successfully implemented ...
    • A data-level parallel linear-quadratic penalty algorithm for multicommodity network flows 

      Pinar, M. C.; Zenios, S. A. (Association for Computing Machinery, 1994)
      We describe the development of a data-level, massively parallel software system for the solution of multicommodity network flow problems. Using a smooth linear-quadratic penalty (LQP) algorithm we transform the multicommodity ...
    • A derivation of Lovász' theta via augmented lagrange duality 

      Pınar, M. Ç. (E D P Sciences, 2003)
      A recently introduced dualization technique for binary linear programs with equality constraints, essentially due to Poljak et al. [13], and further developed in Lemar´echal and Oustry [9], leads to simple alternative ...
    • Design of translucent optical networks: Partitioning and restoration 

      Karasan, E.; Arisoylu, M. (Kluwer, 2004)
      We discuss the problem of designing translucent optical networks composed of restorable, transparent subnetworks interconnected via transponders. We develop an integer linear programming (ILP) formulation for partitioning ...
    • A distance-limited continuous location-allocation problem for spatial planning of decentralized systems 

      Gokbayrak, K.; Kocaman, A. S. (Elsevier, 2017)
      We introduce a new continuous location-allocation problem where the facilities have both a fixed opening cost and a coverage distance limitation. The problem has wide applications especially in the spatial planning of water ...
    • Dynamic financial planning: certainty equivalents, stochastic constraints and functional conjugate duality 

      Jefferson, T. R.; Scott, C. H. (Taylor & Francis, 2005)
      This paper studies portfolios under risk and stochastic constraints. Certainty equivalents combine risk aversion and exponential utility to form the objective. Budget and stochastic constraints on the account balance are ...
    • A graph based approach for naming faces in news photos 

      Ozkan, D.; Duygulu, P. (I E E E Computer Society, 2006)
      We propose a method to associate names and faces for querying people in large news photo collections. On the assumption that a person's face is likely to appear when his/her name is mentioned in the caption, first all the ...
    • Guessing with lies 

      Arikan, E.; Boztaş, S. (2002)
      A practical algorithm was obtained for directly generating an optimal guessing sequence for guessing under lies. An optimal guessing strategy was defined as one which minimizes the number of average number of guesses in ...
    • Information-based approach to punctuation 

      Say, B. (AAAI, Menlo Park, CA, United States, 1997)
      This thesis analyzes, in an information-based framework, the semantic and discourse aspects of punctuation, drawing computational implications for Natural Language Processing (NLP) systems. The Discourse Representation ...
    • Marginal allocation algorithm for nonseparable functions 

      Yüceer, Ü. (Taylor & Francis, 1999)
      Marginal allocation algorithm is implemented to discrete allocation problems with nonseparable objective functions subject to a single linear constraint. A Lagrangian analysis shows that the algorithm generates a sequence ...
    • Multirelational k-anonymity 

      Nergiz, M. E.; Clifton, C.; Nergiz, A. E. (2007)
      k-Anonymity protects privacy by ensuring that data cannot be linked to a single individual. In a k-anonymous dataset, any identifying information occurs in at least k tuples. Much research has been done to modify a single ...
    • On algebraic properties of general proper decentralized systems 

      Yu, R.; Sezer, M. E.; Gao, W. (Elsevier, 1993)
      The new concepts of the decentralized output feedback variable polynomial, the decentralized output feedback cycle index of general proper systems, and the geometric multiplicities of decentralized fixed modes are introduced. ...
    • Perception of 3-D Surfaces from 2-D Contours 

      Ulupinar F.; Nevatia, R. (1993)
      Inference of 3-D shape from 2-D contours in a single image is an important problem in machine vision. We survey classes of techniques proposed in the past and provide a critical analysis. We propose that two kinds of ...
    • Processing real-time transactions in a replicated database system 

      Ulusoy, Ö. (Springer/Kluwer Academic Publishers, 1994)
      A database system supporting a real-time application has to provide real-time information to the executing transactions. Each real-time transaction is associated with a timing constraint, typically in the form of a deadline. ...
    • Regenerator placement and traffic engineering with restoration in GMPLS networks 

      Yetginer, E.; Karasan, E. (Springer, 2003)
      In this paper, we study regenerator placement and traffic engineering of restorable paths in generalized multiprotocol label switching (GMPLS) networks. Regenerators are necessary in optical networks in order to cope with ...
    • Simulation optimization: a comprehensive review on theory and applications 

      Tekin, E.; Sabuncuoglu, I. (Taylor & Francis, 2004)
      For several decades, simulation has been used as a descriptive tool by the operations research community in the modeling and analysis of a wide variety of complex real systems. With recent developments in simulation ...
    • Solving school bus routing problems through integer programming 

      Bektaş, T.; Elmastaş, S. (Palgrave Macmillan Ltd., 2007)
      In this paper, an exact solution approach is described for solving a real-life school bus routing problem (SBRP) for transporting the students of an elementary school throughout central Ankara, Turkey. The problem is ...
    • Theoretical investigation on exact blind channel and input sequence estimation 

      Özdemir, A. K.; Arıkan, O. (IEEE, Piscataway, NJ, United States, 1999)
      Recent work on fractionally spaced blind equalizers have shown that it is possible to exactly identify the channel and its input sequence from the noise-free channel outputs. However, the obtained results are based on a ...