The buckling of aboveground circular steel tanks with conical roof is considered in this paper. The specific source of loads investigated is wind action during hurricane storms in the Caribbean islands. The structure is modeled using a finite element discretization with the computer package ALGOR. Bifurcation buckling of the shell is computed for a given static wind pressure distribution. Then ...

Most constructive induction researchers focus only on new boolean attributes This paper reports a new constructive induction algor i thm, called XofN, that constructs new nominal attributes in the form of X-of-N representations An X-of-N is a Bet containing one or more attribute-value pairs For a given instance, its value corresponds to the number of its at tribute-value pairs that are true The...

W e presen t several bounded distance decoding algor i t h m s f o r a f a m i l y of block codes T h e s e algorithms can be e f i c zen t l y employed f o r decoding lattice codes A thorough anvestzgatzon of t he performance and deczs ion regrons of t he proposed algorzthms are performed T h e s e suggest t h a t there are three dzstznct types of nearest nezghbors classzjied accordzng to thez...

A bstract. We study cellular automata. with addi tive rules on finite undi rected graphs. The addition is carried out in some finite abelian mono id. We investigate the prob lem of deciding wheth er a given configuration has a predecessor . Depending on th e underlying monoid this prob lem is solvable in polynomial time or NP-complete. Furt hermo re, we st udy the global reversibility of cellul...

A star forest is a forest all of whose components are stars. The star arboricity, st(G) of a graph G is the minimum number of star forests whose union covers all the edges of G. The arboricity, A(G), of a graph G is the minimum number of forests whose union covers all the edges of G. Clearly st(G) > A(G). In fact, Algor and Alon have given examples which show that in some cases st(G) can be as ...

This paper represents a beginning development of a parallel t ruth maintenance system to interact with a parallel inference engine. We present a solution which performs status assignments in parallel to belief nodes in the Reason Maintenance System (RMS) presented by [Doyle, 1979], [Doyle, 1983]. We examine a previously described algorithm by [Petrie, 1986] which fails to correctly detect termi...

As a fundamental aspect in many ar tificial neural networ ks cour ses, the development of pr ogr amming skills is a fundamental goal. This paper has two objectives: the first objective of th is pa per is in t r oducing the R langua ge for stat ist ica l compu ting a s a power ful tool for exemplify algor ithms, for executing numer ical computations, and fo...

In 1977 Wu Wen-tsi in discovered an efficient method for mechanical theorem proving. This method has been applied to prove and discover theorems in various kinds of geometries. Based on an extension of one of Wu's algor i thmic procedures, the author implemented a prover CPS for proving so-called constructive geometric theorems, as well as a general theorem prover PS. Using this prover we prove...

Despite the fact that iterative solution techniques are recently gaining recognition among practitioners and finding their way into commercial software arena, the current state of the art in iterative methods remains unsatisfactory in many respects. Users of large production codes such as ANSYS, NASTRAN, ALGOR, SDRC, EMRC and ANSYS often observe many “bad” cases resulting from poorly conditione...