نتایج جستجو برای: generating set

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

1997
Manolis Katevenis Panagiota Vatsolaki Dimitrios N. Serpanos Evangelos P. Markatos

Although ATM Asynchronous Transfer Mode is a widely accepted standard for WANs Wide Area Networks it has not yet been widely embraced by the NOW community because i most current ATM switches and interfaces have high latency and and ii they drop cells when even short term congestion happens In this paper we present ATLAS I a single chip ATM switch with Gbits sec aggregate I O throughput that was...

1994
Scott H. Murray Cheryl E. Praeger

A base and strong generating set provides an effective computer representation for a permutation group. This representation helps us to calculate the group order, list the group elements, generate random elements, test for group membership and store group elements efficiently. Knowledge of a base and strong generating set essentially reduces these tasks to the calculation of certain orbits. Giv...

2012
F. K. Röpke

Context. A promising model for normal Type Ia supernova (SN Ia) explosions are delayed detonations of Chandrasekhar-mass white dwarfs, in which the burning starts out as a subsonic deflagration and turns at a later phase of the explosion into a supersonic detonation. The mechanism of the underlying deflagration-to-detonation transition (DDT) is unknown in detail, but necessary conditions have b...

2000
A. Nakamichi

Large-scale astrophysical systems are non-extensive due to their long-range force of gravity. Here we show an approach toward the statistical mechanics of such self-gravitating systems (SGS). This is a generalization of the standard statistical mechanics based on the new definition of entropy; Tsallis statistical mechanics. Developing the composition of entropy and the generalized Euler relatio...

Journal: :JCP 2013
Xiangjie Ma Xiaozhong Li Xinglong Fan

In this paper, the service guaranteed scheduling model was proposed for the MPMS switching fabric. Firstly, the service distribution characteristic of each cell flow was analyzed in the MPMS switching fabric. Then, the service guaranteed distributed architecture was designed, and the scheduling model is proposed for demultiplexors, multiplexors, input switching units, middle switching units and...

Journal: :Informatica (Slovenia) 2013
Arup Ghosh Gi-Nam Wang Satchidananda Dehuri

With the advent of second-generation sequencing (SGS) technologies, deoxyribonucleic acid (DNA) sequencing machines have started to produce reads, named as “longer short reads”, which are much longer than previous generation reads, the so called “short reads”. Unfortunately, most of the existing read aligners do not scale well for those second-generation longer short reads. Moreover, many of th...

2008
Wenbin Wu Ryosuke Shibasaki Peng Yang Qingbo Zhou Huajun Tang

In this study, we used the NDVI time-series datasets to investigate variations in the starting dates of growing season (SGS) in China's cropland from 1983 to 2002. To do so, a smoothing algorithm based on an asymmetric Gaussian function was first performed on the NDVI dataset to minimize the effects of anomalous values caused by atmospheric haze and cloud contamination. The SGS of cropland was ...

2002
Nathan Clark Wilkin Tang Scott Mahlke

General-purpose processors that are utilized as cores are often incapable of achieving the challenging cost, performance, and power demands of high-performance audio, video, and networking applications. To meet these demands, most systems employ a number of hardware accelerators to off-load the computationally demanding portions of the application. As an alternative to this strategy, we examine...

2006
Guido Tack Christian Schulte Gert Smolka

Ideally, programming propagators as implementations of constraints should be an entirely declarative specification process for a large class of constraints: a high-level declarative specification is automatically translated into an efficient propagator. This paper introduces the use of existential monadic secondorder logic as declarative specification language for finite set propagators. The ap...

1996
Charles J. Colbourn

The generating set of Z n is determined completely for n 8, with the exception of the (46,6,1) design. Some general results are presented for larger values of n.

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

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