نتایج جستجو برای: cut size

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

2007
Michael Zaiser Nikos Nikitas

Plastic deformation of crystals proceeds through a sequence of intermittent slip avalanches with scale-free (power-law) size distribution. On macroscopic scales, however, plastic flow is known to be smooth and homogeneous. In the present letter we use a recently proposed continuum model of slip avalanches to systematically investigate the nature of the cut-off which truncates scale-free behavio...

Journal: :CoRR 2009
Lenka Zdeborová Stefan Boettcher

Asymptotic properties of random regular graphs are object of extensive study in mathematics. In this note we argue, based on theory of spin glasses, that in random regular graphs the maximum cut size asymptotically equals the number of edges in the graph minus the minimum bisection size. Maximum cut and minimal bisection are two famous NP-complete problems with no known general relation between...

The effect of central opening on the buckling and nonlinear post-buckling response of carbon nanotubes (CNTs) reinforced micro composite plate embedded in elastic medium is considered in this paper. It is assumed that the system is surrounded by elastic medium, therefore; the influence of Pasternak foundation on buckling and post-buckling behavior are analyzed. In order to derive the basic form...

Journal: :Lecture Notes in Computer Science 2021

For a positive integer d, the d-CUT is problem of deciding if an undirected graph $$G=(V,E)$$ has nontrivial bipartition (A, B) V such that every vertex in A (resp. at most d neighbors B A). When $$d=1$$ , this MATCHING CUT problem. Gomes and Sau [9] gave first fixed-parameter tractable algorithm for parameterized by maximum number crossing edges cut (i.e., size edge cut). However, their paper ...

2008
Hari M. Gupta José R. Campanha

Many natural and economical phenomena are described through power law or log-normal distributions. In these cases, probability decreases very slowly with step size compared to normal distribution. Thus it is essential to cut-off these distributions for larger step size. Recently we introduce the gradually truncated power law distribution to successfully describe variation of financial, educatio...

2009
H. Mohammadi M. Alizadeh M. R. Bari A. Khosrowshahi

A model capable of predicting the minimum content of Aflatoxin M1 (AFM1) in Iranian while brine cheese has been developed using a chemometric approach to determine the optimum processing conditions. Renneting temperature, cut size, stirring time, press time, curd size and saturated brine pH were all regarded as process variables. Threedimensional response surface and contour plots were drawn. T...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه صنعتی اصفهان - دانشکده ریاضی 1390

the main objective in sampling is to select a sample from a population in order to estimate some unknown population parameter, usually a total or a mean of some interesting variable. a simple way to take a sample of size n is to let all the possible samples have the same probability of being selected. this is called simple random sampling and then all units have the same probability of being ch...

Journal: :Journal of Visualization and Computer Animation 2007
Yan Li Jinhui Yu Kwan-Liu Ma Jiaoying Shi

Paper-cut is one of the most characteristic Chinese folk arts, often used during festivals and celebrations. Chinese artists have used paper-cut to make animations. Typical paper-cut artwork is made with 2D illustrations on paper, and making many frames necessary for an entire animation can be tedious and expensive. We present a system that allows a designer to directly annotate a 3D model with...

Journal: :Discrete Mathematics 2001
Vincent Barré Jean-Luc Fouquet

Let G be a minimal imperfect P 5-free graph (i.e. a minimal imperfect graph not containing a path on 5 vertices as induced subgraph) and let S be a minimal cutset of G. In this paper we study several properties of such cutsets, in particular we prove that the subgraph induced by S is connected, contains a P 4 , cannot induce a bipartite subgraph of G .... As a by-product we also give a structur...

1999
Petr Krysl Zdeněk Bittnar

Parallelization of explicit finite element dynamics based on domain decomposition and message passing may utilize one of two partitioning cuts, namely cut led through the nodes and element edges or faces (node cut), or cut led across elements, avoiding nodes (element cut). The cost of serial explicit finite element dynamics (without considerations of mechanical contact) is almost wholly associa...

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

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