نتایج جستجو برای: entropy parameter m

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

2016
Song He Li-Fang Li Xiao-Xiong Zeng Stephan Stieberger

The Van der Waals-like phase transition is observed in temperature–thermal entropy plane in spherically symmetric charged Gauss–Bonnet–AdS black hole background. In terms of AdS/CFT, the non-local observables such as holographic entanglement entropy, Wilson loop, and two point correlation function of very heavy operators in the field theory dual to spherically symmetric charged Gauss–Bonnet–AdS...

2015
Vikas Kumar Shalini Jain Kalpna Sharma Pooja Sharma

Abstra t. In the present paper, a theoreti al analysis of entropy generation due to fully developed ow and heat transfer through a parallel plate hannel partially lled with a porous medium under the e e t of transverse magneti eld and radiation is presented. Both horizontal plates of the hannel are kept at onstant and equal temperature. An exa t solution of governing equation for both porous an...

2015
Guojun Gan Kun Chen GUOJUN GAN KUN CHEN

Entropy weighting used in some soft subspace clustering algorithms is sensitive to the scaling parameter. In this paper, we propose a novel soft subspace clustering algorithm by using log-transformed distances in the objective function. The proposed algorithm allows users to choose a value of the scaling parameter easily because the entropy weighting in the proposed algorithm is less sensitive ...

Journal: :مدیریت فناوری اطلاعات 0
الهام ضیائی پور دانش¬آموخته کارشناسی¬ارشد مهندسی فناوری اطلاعات، دانشگاه خواجه نصیرالدین طوسی،ایران ایوب محمدیان دانشجوی دکترای مدیریت سیستم، دانشگاه تهران، ایران فرید خوش الحان استادیار دانشکده صنایع، دانشگاه خواجه نصیرطوسی، ایران علیرضا تقی زاده دانشجوی دکترا، دانشگاه usm مالزی

in this paper, with studying existing e-readiness evaluation models and their well-known drawbacks and advantages, we propose a new comprehensive classification for e-readiness evaluation parameters. with this aim in mind; at the beginning we identify and study all popular e-readiness evaluation parameters in international, national, industrial, organizational and individual levels, then we cat...

2017
Tomasz Luczak Abram Magner Wojciech Szpankowski

Symmetries of graphs intervene in diverse applications, ranging from enumeration to graph structure compression, to the discovery of graph dynamics (e.g., inference of the arrival order of nodes in a growing network). It has been known for some time that ErdősRényi graphs are asymmetric with high probability, but it is also known that real world graphs (web, biological networks) have a signific...

Journal: :Entropy 2013
Akira Takeuchi Kenji Amiya Takeshi Wada Kunio Yubuta Wei Zhang Akihiro Makino

High-entropy (H-E) alloys, bulk metallic glasses (BMGs) and high-entropy BMGs (HE-BMGs) were statistically analyzed with the help of a database of ternary amorphous alloys. Thermodynamic quantities corresponding to heat of mixing and atomic size differences were calculated as a function of composition of the multicomponent alloys. Actual calculations were performed for configurational entropy (...

Journal: :Entropy 2017
Julio Cesar Ramírez Pacheco Joel Antonio Trejo-Sánchez Joaquín Cortez González Ramon R. Palacio

This article proposes a methodology for the classification of fractal signals as stationary or nonstationary. The methodology is based on the theoretical behavior of two-parameter wavelet entropy of fractal signals. The wavelet (q, q′)-entropy is a wavelet-based extension of the (q, q′)-entropy of Borges and is based on the entropy planes for various q and q′; it is theoretically shown that it ...

2015
Paul Beame Vincent Liew Mihai Patrascu

We prove that any oblivious algorithm using space S to find the median of a list of n integers from {1, . . . , 2n} requires time Ω(n log logS n). This bound also applies to the problem of determining whether the median is odd or even. It is nearly optimal since Chan, following Munro and Raman, has shown that there is a (randomized) selection algorithm using only s registers, each of which can ...

Journal: :IEEE Trans. Information Theory 1973
Lee D. Davisson

A&ruct-Universal coding is any asymptotically opt imum method of block-to-block memoryless source coding for sources with unknown parameters. This paper considers noiseless coding for such sources, primarily in terms of variable-length coding, with performance measured as a function of the coding redundancy relative to the per-letter conditional source entropy given the unknown parameter. It is...

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

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