نتایج جستجو برای: log majorisation

تعداد نتایج: 79648  

Journal: :Journal of Mathematical Analysis and Applications 2013

E. Ünlü S. Bilici, T. Çiçek

This study was carried out to determine some biological characteristics including age, growth and somatic condition of Carasobarbus luteus and Capoeta trutta in the Turkish part of the Tigris River. The examined samples of C. luteus were distributed between II-IX years of age. The length-weigth relations of females and males were calculated as Log W =-4.7314 +3.0113 Log FL and Log W = -4.7631 +...

Bilici, S., Çiçek, T., Ünlü, E.,

This study was carried out to determine some biological characteristics including age, growth and somatic condition of Carasobarbus luteus and Capoeta trutta in the Turkish part of the Tigris River. The examined samples of C. luteus were distributed between II-IX years of age. The length-weigth relations of females and males were calculated as Log W =-4.7314 +3.0113 Log FL and Log W = -4.7631 +...

2009
Adetokunbo Makanju A. Nur Zincir-Heywood Evangelos E. Milios

Message type or message cluster extraction is an important task in automatic application log analysis. When the message types that exist in a log file are defined, they form the basis for carrying out other automatic application log analysis tasks. In this paper we introduce a novel algorithm for carrying out this task. IPLoM, which stands for Iterative Partitioning Log Mining, works through a ...

Journal: :Int. J. Hum. Comput. Interaction 2014
Xi Niu Tao Zhang Hsin-liang Chen

The goal of this study was to investigate and compare user search activities of two discovery tools at an academic library. The implementation of a new discovery tool (Primo by Ex Libris) to replace an existing system (VuFind) provided a unique opportunity to collect transaction logs of both systems and examine user search behavior in an empirical test. Results from a transaction log analysis a...

1996
Dimitris Fotakis Paul G. Spirakis

The aim of this paper is to present a proof of the equivalence of the equalities N P = PCP(log log n; 1) and P = N P. The proof is based on producing long pseudo-random bit strings through random walks on expander graphs. This technique also implies that for any language in N P there exists a restricted veriier using log n + c, c is a constant, random bits. Furthermore, we prove that the equali...

Journal: :Discrete Mathematics 1991

Journal: :Tohoku Mathematical Journal 1996

Journal: :Advances in Mathematics 2015

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید