نتایج جستجو برای: double exponential transformation

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

Journal: :Mathematical Structures in Computer Science 2001
Annegret Habel Jürgen Müller Detlef Plump

In this paper we investigate and compare four variants of the double-pushout approach to graph transformation. As well as the traditional approach with arbitrary matching and injective right-hand morphisms, we consider three variations by employing injective matching and/or arbitrary right-hand morphisms in rules. We show that injective matching provides additional expressiveness in two respect...

Journal: :AI Commun. 2006
Chan Le Duc Nhan Le Thanh Marie-Christine Rousset

This paper introduces a compact representation which helps to avoid the exponential blow-up of the Least Common Subsumer (lcs) of two ALE-concept descriptions. Based on the compact representation we define a space of specific graphs which represents all ALE-concept descriptions including the lcs. Next, we propose an algorithm exponential in time and polynomial in space for deciding subsumption ...

Journal: :bulletin of the iranian mathematical society 2015
y. huang

based on some stationary periodic solutions and stationary soliton solutions, one studies the general solution for the relative lax system, and a number of exact solutions to the korteweg-de vries (kdv) equation are first constructed by the known darboux transformation, these solutions include double and triple singular periodic solutions as well as singular soliton solutions whose amplitude de...

Journal: :مهندسی متالورژی و مواد 0
آسیه سادات موسوی محولاتی سید صادق قاسمی بنادکوکی مهدی کلانتر

in this investigation, continuous cooling transformations and microstructures have been studied in detail in a low carbon ti-nb bearing microalloyed steel by means of dilatometry, metallography and hardness measurements. the results indicate that when the cooling rate is greater than 1˚c/s, the dilatation curve is associated with a major dilatation at relatively low transformation temperatures,...

2003
Wenbin Luo Gregory L. Heileman

Hash functions are among the oldest and most widely used data structures in computer science. Different hash functions exist. So, it is very important to compare their performance. In this paper, we introduced our new hash function which was proposed recently in [1], and compared its performance with two different open addressing hashing algorithms: double hashing and exponential hashing. Doubl...

Journal: :Jusikom : Jurnal Sistem Informasi Ilmu Komputer 2023

Predicting the quantity of product sales in future aims to control amount existing stock, so that shortage or excess stock can be minimized. When predicted accurately, fulfillment consumer demand managed a timely manner and company's cooperation with consumers is maintained properly company avoid losing consumers. This study analyze accuracy predicting salt using Single Exponential Smoothing (S...

Journal: :JSIAM Letters 2022

Double-exponential formulas were proposed by Takahasi and Mori in 1974 as efficient numerical integration methods. They considered four typical cases: (i) integral on a finite interval, (ii) semi-infinite of algebraically decaying functions, (iii) exponentially (iv) infinite they double-exponential formula for each case. This paper proposes another case: (v) unilateral rapidly decreasing functi...

1997
Bradley J. Smith Gregory L. Heileman

In this paper an eecient open addressing hash function called exponential hashing is developed using concepts from dynamical systems theory and number theory. A comparison of exponential hashing versus a widely-used double hash function is performed using an analysis based on Lya-punov exponents and entropy. Proofs of optimal table parameter choices are provided for a number of hash functions. ...

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

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