Structured finite

Xem 1-20 trên 117 kết quả Structured finite
  • A mixed prefix-postfix notation for representations of the constituent structures of the expressions of natural languages is proposed, which are of limited degree of center embedding if the original expressions are noncenter-embedding. The method of constructing these representations is applicable to expressions with center embedding, and results in representations which seem to reflect the ways in which people actually parse those expressions. Both the representations and their interpretations can be computed from the expressions from left to right by finite-state devices. ...

    pdf4p bungio_1 03-05-2013 13 1   Download

  • Autodesk Robot™ Structural Analysis Professional software is a collaborative, versatile, and faster software application that can help you compete and win in the global economy. Purpose-built for BIM, Autodesk Robot Structural Analysis Professional calculates even your more complex models with powerful finite element auto-meshing, nonlinear algorithms, and a comprehensive collection of design codes to help you achieve results in minutes, not hours.

    pdf6p nguyennam129 23-03-2013 117 30   Download

  • This book is written for marine structural engineers and naval architects, as well as mechanical engineers and civil engineers who work on struch~ral design. The preparation of the book is motivated by extensive use of the finite element analysis and dynamidfatigue analysis, fast paced advances in computer and information technology, and application of risk and reliability methods.

    pdf634p nhatkyvodanh 11-08-2012 60 19   Download

  • In the past few decades, the Finite Element Analysis (FEA) has been developed into a key indispensable technology in the modeling and simulation of various engineering systems.

    pdf0p cucdai_1 19-10-2012 46 17   Download

  • (BQ) Part 1 book "The finite element method - A practical course abaqus" has contents: Computational modelling, introduction to mechanics for solids and structures, fundamentals for finite element method, fem for trusses, fem for beams.

    pdf145p bautroibinhyen18 23-02-2017 8 4   Download

  • Stack ADTDEFINITION: A Stackof elements of type T is a finite sequence of elements of T, in which all insertions and deletions are restricted to one end, called the top. Stackis a Last In -First Out (LIFO) data structure.Basic operations: •Construct a stack, leaving it empty. •Pushan element. •Popan element. •Top an element.

    pdf31p trinh02 28-01-2013 27 3   Download

  • (BQ) Written by the pre-eminent professors in their fields, this new edition of the Finite Element Method maintains the comprehensive style of the earlier editions and authoritatively incorporates the latest developments of this dynamic field. Volume Two: Solid and Structural Mechanics is intended for readers studying structural mechanics at a higher level.

    pdf217p bautroibinhyen19 02-03-2017 3 3   Download

  • (BQ) Part 1 book "The finite element method" has contents: Computational modelling, introduction to mechanics for solids and structures, fundamentals for finite element method, FEM for trusses, FEM for beams, FEM for frames, FEM for Two-Dimensional solids.

    pdf185p bautroibinhyen20 06-03-2017 7 3   Download

  • We consider a new subproblem of unsupervised parsing from raw text, unsupervised partial parsing—the unsupervised version of text chunking. We show that addressing this task directly, using probabilistic finite-state methods, produces better results than relying on the local predictions of a current best unsupervised parser, Seginer’s (2007) CCL. These finite-state models are combined in a cascade to produce more general (full-sentence) constituent structures; doing so outperforms CCL by a wide margin in unlabeled PARSEVAL scores for English, German and Chinese. ...

    pdf10p hongdo_1 12-04-2013 32 2   Download

  • In wide-coverage lexicalized grammars many of the elementary structures have substructures in common. This means that in conventional parsing algorithms some of the computation associated with different structures is duplicated. In this paper we describe a precompilation technique for such grammars which allows some of this computation to be shared. In our approach the elementary structures of the grammar are transformed into finite state automata which can be merged and minimised using standard algorithms, and then parsed using an automatonbased parser. ...

    pdf7p bunrieu_1 18-04-2013 19 2   Download

  • This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explicitly calculated sample complexity learning times under different input distribution assumptions (including CHILDES database language input) and learning regimes. We also briefly describe a new way to formally model (rapid) diachronic syntax change.

    pdf10p bunmoc_1 20-04-2013 19 2   Download

  • Unification-based grammar formalisms use structures containing sets of features to describe linguistic objects. Although computational algorithms for unification of feature structures have been worked out in experimental research, these algcwithms become quite complicated, and a more precise description of feature structures is desirable. We have developed a model in which descriptions of feature structures can be regarded as logical formulas, and interpreted by sets of directed graphs which satisfy them.

    pdf10p bungio_1 03-05-2013 17 2   Download

  • This report describes the development of a parsing system for written Swedish and is focused on a grammar, the main component of the system, semiautomatically extracted from corpora. A cascaded, finite-state algorithm is applied to the grammar in which the input contains coarse-grained semantic class information, and the output produced reflects not only the syntactic structure of the input, but grammatical functions as well. The grammar has been tested on a variety of random samples of different text genres, achieving precision and recall of 94.62% and 91.

    pdf4p bunthai_1 06-05-2013 13 2   Download

  • The Finite element approach is actually a numerical method for solving differential equations generated by theories of mechanics such as elasticity theory and strength of materials, depends heavily on the processing power of computers and is more applicable to structures of arbitrary size and complexity.

    ppt6p hoccom001 27-01-2016 12 2   Download

  • (BQ) Part 2 book "A first course in the finite element method" has contents: Axisymmetric elements, isoparametric formulation, three dimensional stress analysis, plate bending element, heat transfer and mass transport, fluid flow, thermal stress, structural dynamics and time-dependent heat transfer.

    pdf407p bautroibinhyen18 23-02-2017 3 2   Download

  • Expanded to include a broader range of problems than the bestselling first edition, Finite Element Method Using MATLAB: Second Edition presents finite element approximation concepts, formulation, and programming in a format that effectively streamlines the learning process. It is written from a general engineering and mathematical perspective rather than that of a solid/structural mechanics basis.

    pdf244p bautroibinhyen19 02-03-2017 2 2   Download

  • Presents detailed, step-by-step procedures for understanding and programming of the finite element technique incorporates numerous examples of computer programs for boundary value, initial value, eigenvalue problems, and structural controls, including plate/shell analysis, contains a new chapter of special topics for finite element applications.

    pdf346p bautroibinhyen19 02-03-2017 4 2   Download

  • (BQ) Part 2 book "A first course in the finite element method" has contents: Practical considerations in modeling; interpreting results; and examples of plane stress–strain analysis; three dimensional stress analysis, plate bending element, heat transfer and mass transport, thermal stress, structural dynamics and time dependent heat transfer,... and other contents.

    pdf595p bautroibinhyen19 02-03-2017 3 2   Download

  • Phrase-structure grammars are an effective representation for important syntactic and semantic aspects of natural languages, but are computationally too demanding for use as language models in real-time speech recognition. An algorithm is described that computes finite-state approximations for context-free grammars and equivalent augmented phrase-structure grammar formalisms. The approximation is exact for certain contextfree grammars generating regular languages, including all left-linear and right-linear context-free grammars. ...

    pdf10p bunmoc_1 20-04-2013 10 1   Download

  • We present a new grammatical formalism called Constraint Dependency G r a m m a r (CDG) in which every grammatical rule is given as a constraint on wordto-word modifications. CDG parsing is formalized as a constraint satisfaction problem over a finite domain so that efficient constraint-propagation algorithms can be employed to reduce structural ambiguity without generating individual parse trees. The weak generative capacity and the computational complexity of CDG parsing are also discussed.

    pdf8p bungio_1 03-05-2013 17 1   Download


Đồng bộ tài khoản