Now showing items 10-29 of 1311

    • Abstract metaprolog engine 

      Cicekli, I. (Elsevier, 1998)
      A compiler-based meta-level system for MetaProlog language is presented. Since MetaProlog is a meta-level extension of Prolog, the Warren Abstract Machine (WAM) is extended to get an efficient implementation of meta-level ...
    • Accelerating read mapping with FastHASH 

      Xin, H.; Lee, D.; Hormozdiari, F.; Yedkar, S.; Mutlu, O.; Alkan C. (BioMed Central Ltd., 2013)
      With the introduction of next-generation sequencing (NGS) technologies, we are facing an exponential increase in the amount of genomic sequence data. The success of all medical and genetic applications of next-generation ...
    • Accelerating the HyperLogLog cardinality estimation algorithm 

      Bozkus, C.; Fraguela, B. B. (Hindawi Limited, 2017)
      In recent years, vast amounts of data of different kinds, from pictures and videos from our cameras to software logs from sensor networks and Internet routers operating day and night, are being generated. This has led to ...
    • Access pattern-based code compression for memory-constrained systems 

      Ozturk, O.; Kandemir, M.; Chen, G. (Association for Computing Machinery, 2008-09)
      As compared to a large spectrum of performance optimizations, relatively less effort has been dedicated to optimize other aspects of embedded applications such as memory space requirements, power, real-time predictability, ...
    • ACMICS: an agent communication model for interacting crowd simulation 

      Kullu, K.; Güdükbay U.; Manocha, D. (Springer, 2017)
      Behavioral plausibility is one of the major aims of crowd simulation research. We present a novel approach that simulates communication between the agents and assess its influence on overall crowd behavior. Our formulation ...
    • ACMICS: An agent communication model for interacting crowd simulation: JAAMAS track 

      Kullu, K.; Güdükbay U.; Manocha, D. (International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), 2018)
      We present and evaluate a novel approach to simulate communication between the agents. Our approach distinguishes low- And high-level communication tasks. This separation makes it easy to extend and use it in new scenarios. ...
    • Activating mutations of STAT5B and STAT3 in lymphomas derived from γδ-T or NK cells 

      Küçük, C.; Jiang, B.; Hu X.; Zhang W.; Chan J.K.C.; Xiao W.; Lack, N.; Alkan, C.; Williams J.C.; Avery, K.N.; Kavak P.; Scuto, A.; Sen, E.; Gaulard P.; Staudt L.; Iqbal J.; Zhang W.; Cornish, A.; Gong Q.; Yang Q.; Sun H.; D'Amore F.; Leppä, S.; Liu W.; Fu, K.; De Leval L.; McKeithan, T.; Chan W.C. (Nature Publishing Group, 2015)
      Lymphomas arising from NK or γδ-T cells are very aggressive diseases and little is known regarding their pathogenesis. Here we report frequent activating mutations of STAT3 and STAT5B in NK/T-cell lymphomas (n=51), γδ-T-cell ...
    • Active node determination for correlated data gathering in wireless sensor networks 

      Karasabun, E.; Korpeoglu, I.; Aykanat, C. (Elsevier BV, 2013-04-07)
      In wireless sensor network applications where data gathered by different sensor nodes is correlated, not all sensor nodes need to be active for the wireless sensor network to be functional. Given that the sensor nodes that ...
    • Active pixel merging on hypercube multicomputers 

      Kurç, Tahsin M.; Aykanat, Cevdet; Özgüç, Bülent (Springer, Berlin, Heidelberg, 1996)
      This paper presents algorithms developed for pixel merging phase of object-space parallel polygon rendering on hypercube-connected multicomputers. These algorithms reduce volume of communication in pixel merging phase by ...
    • Adapting iterative-improvement heuristics for scheduling file-sharing tasks on heterogeneous platforms 

      Kaya, K.; Uçar, B.; Aykanat, C. (2008)
      We consider the problem of scheduling an application on a computing system consisting of heterogeneous processors and one or more file repositories. The application consists of a large number of file-sharing, otherwise ...
    • Adapting iterative-improvement heuristics for scheduling file-sharing tasks on heterogeneous platforms 

      Kaya, Kamer; Uçar, B.; Aykanat, Cevdet (Springer, Berlin, Heidelberg, 2008)
      We consider the problem of scheduling an application on a computing system consisting of heterogeneous processors and one or more file repositories. The application consists of a large number of file-sharing, otherwise ...
    • Adaptive compute-phase prediction and thread prioritization to mitigate memory access latency 

      Akturk, I.; Ozturk, O. (Association for Computing Machinery, 2014)
      The full potential of chip multiprocessors remains unex- ploited due to the thread oblivious memory access sched- ulers used in off-chip main memory controllers. This is especially pronounced in embedded systems due to ...
    • Adaptive control of a spring-mass hopper 

      Uyanik I.; Saranli, U.; Morgül O. (2011)
      Practical realization of model-based dynamic legged behaviors is substantially more challenging than statically stable behaviors due to their heavy dependence on second-order system dynamics. This problem is further ...
    • Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids 

      Aykanat, C.; Cambazoglu, B. B.; Findik, F.; Kurc, T. (Academic Press, 2007-01)
      Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributed-memory architectures is investigated. The adaptive OS decomposition problem is modeled as a graph ...
    • Adaptive grids: an image-based approach to generate navigation meshes 

      Akaydın, A.; Güdükbay, U. (S P I E - International Society for Optical Engineering, 2013-02-01)
      We propose adaptive grids, an image-based approach for constructing navigation meshes, which are used for path planning. A cellular navigation mesh, called an adaptive grid, is constructed from a top-view range image of a ...
    • Adaptive prefetching for shared cache based chip multiprocessors 

      Kandemir, M.; Zhang, Y.; Ozturk O. (2009)
      Chip multiprocessors (CMPs) present a unique scenario for software data prefetching with subtle tradeoffs between memory bandwidth and performance. In a shared L2 based CMP, multiple cores compete for the shared on-chip ...
    • Adaptive routing framework for network on chip architectures 

      Mustafa, N. U.; Ozturk, O.; Niar, S. (Association for Computing Machinery, 2016)
      In this paper we suggest and demonstrate the idea of applying multiple routing algorithms during the execution of a real application mapped on a Network-on-Chip (NoC). Traffic pattern of a real application may change during ...
    • Adaptive routing on the new switch chip for IBM SP systems 

      Abali, B.; Stunkel, C. B.; Herring, J.; Banikazemi, M.; Panda, D. K.; Aykanat, C.; Aydogan, Y. (Academic Press, 2001)
      The IBM RS/6000 SP is one of the most successful commercially available multicomputers. SP owes its success partially to the scalable, high bandwidth, low latency network. This paper describes the architecture of Switch2 ...
    • Adaptive schemes for location update generation in execution location-dependent continuous queries 

      Lam, Kam-Yiu; Ulusoy, Ö. (Elsevier Inc., 2006-04)
      An important feature that is expected to be owned by today's mobile computing systems is the ability of processing location-dependent continuous queries on moving objects. The result of a location-dependent query depends ...
    • Adaptive source routing in multistage interconnection networks 

      Aydogan, Y.; Stunkel, C. B.; Aykanat, C.; Abali, B. (IEEE, Los Alamitos, CA, United States, 1996)
      We describe the adaptive source routing (ASR) method which is a first attempt to combine adaptive routing and source routing methods. In ASR, the adaptivity of each packet is determined at the source processor. Every packet ...