423,683 research outputs found

    3D simulation of laminated shell structures using the Proper Generalized Decomposition

    No full text
    Numerical simulations of composite structures are generally performed using multi-layered shell elements in the context of the finite elements method. This strategy has numerous advantages like a low computation time and the capability to reproduce the comportment of composites in most of cases. The main restriction of this approach is that they require an approximation of the comportment in the thickness. This approximation is generally no more valid near the boundary and loading conditions and when non linear phenomena like delamination occurs in the thickness. This paper explores an alternative to shell computation using the framework of the Proper Generalized Decomposition that is based on a separated representation of the solution. The idea is to solve the full 3D solid problem separating the in-plane and the out-of-plane spaces. Practically, a classical shell mesh is used to describe the in-plane geometry and a simple 1D mesh is used to deal with the out-of-plane space. This allows to represents complex fields in the thickness without the complexity and the computation cost of a solid mesh which is particularly interesting when dealing with composite laminates

    Proper Consistency

    No full text
    Proper consistency is defined by the properties that each player takes all opponent strategies into account (is cautious) and deems one opponent strategy to be infinitely more likely than another if the opponent prefers the one to the other (respects preferences). When there is common certain belief of proper consistency, a most preferred strategy is properly rationalizable. Any strategy used with positive probability in a proper equilibrium is properly rationalizable. Only strategies that lead to the backward induction outcome is properly rationalizable in the strategic form of a generic perfect information game. Proper rationalizability can be used to test the robustness of inductive procedures.

    Practice-Driven Research on Enterprise Transformation

    No full text
    Item does not contain fulltextPractice-Driven Research on Enterprise Transformation : 4th Working Conference, PRET 2012 Gdansk, Poland, June 27, 201

    Enterprise Coherence Assessment

    No full text
    Contains fulltext : 91772.pdf (Publisher’s version ) (Closed access

    A Practice-Based Framework for Enterprise Coherence

    No full text
    Contains fulltext : 103233.pdf (Publisher’s version ) (Closed access

    Going Beyond Counting First Authors in Author Co-citation Analysis

    No full text
    The present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed

    Intelligent Decisional Assistant that Facilitate the Choice of a Proper Computer System Applied in Busines

    No full text
    The choice of a proper computer system is not an easy task for a decider. One reason could be the present market development of computer systems applied in business. The big number of the Romanian market players determines a big number of computerized products, with a multitude of various properties. Our proposal tries to optimize and facilitate this decisional process within an e-shop where are sold IT packets applied in business, building an online decisional assistant, a special component conceived to facilitate the decision making needed for the selection of the pertinent IT package that fits the requirements of one certain business, described by the decider. The user interacts with the system as an online buyer that visit an e-shop where are sold IT package applied in economy.database, knowledge-base, decision tree, DSS, data mining, agents, reasoning, collaborative

    Approximate Personal Name-Matching Through Finite-State Graphs

    No full text
    This article shows how finite-state methods can be employed in a new and different task: the conflation of personal name variants in standard forms. In bibliographic databases and citation index systems, variant forms create problems of inaccuracy that affect information retrieval, the quality of information from databases, and the citation statistics used for the evaluation of scientists' work. A number of approximate string matching techniques have been developed to validate variant forms, based on similarity and equivalence relations. We classify the personal name variants as nonvalid and valid forms. In establishing an equivalence relation between valid variants and the standard form of its equivalence class, we defend the application of finite-state transducers. The process of variant identification requires the elaboration of: (a) binary matrices and (b) finite-state graphs. This procedure was tested on samples of author names from bibliographic records, selected from the Library and Information Science Abstracts (LISA) and Science Citation Index Expanded (SCI-E) databases. The evaluation involved calculating the measures of precision and recall, based on completeness and accuracy. The results demonstrate the usefulness of this approach, although it should be complemented with methods based on similarity relations for the recognition of spelling variants and misspellings

    A 1500 deg2 near infrared proper motion catalogue from the UKIDSS Large Area Survey

    No full text
    The United Kingdom Infrared Deep Sky Survey (UKIDSS) Large Area Survey (LAS) began in 2005, with the start of the UKIDSS programme as a 7 year effort to survey roughly 4000 deg2 at high Galactic latitudes in Y, J, H and K bands. The survey also included a significant quantity of two epoch J band observations, with an epoch baseline greater than 2 years to calculate proper motions. We present a near-infrared proper motion catalogue for the 1500 deg2 of the two epoch LAS data, which includes 135 625 stellar sources and a further 88 324 with ambiguous morphological classifications, all with motions detected above the 5σ level. We developed a custom proper motion pipeline which we describe here. Our catalogue agrees well with the proper motion data supplied for a 300 deg2 subset in the current Wide Field Camera Science Archive (WSA) 10th data release (DR10) catalogue, and in various optical catalogues, but it benefits from a larger matching radius and hence a larger upper proper motion detection limit. We provide absolute proper motions, using LAS galaxies for the relative to absolute correction. By using local second-order polynomial transformations, as opposed to linear transformations in the WSA, we correct better for any local distortions in the focal plane, not including the radial distortion that is removed by the UKIDSS pipeline. We present the results of proper motion searches for new brown dwarfs and white dwarfs. We discuss 41 sources in the WSA DR10 overlap with our catalogue with proper motions >300 mas yr−1, several of which are new detections. We present 15 new candidate ultracool dwarf binary systems

    Proper generalized decomposition of time-multiscale models

    No full text
    Models encountered in computational mechanics could involve many time scales. When these time scales cannot be separated, one must solve the evolution model in the entire time interval by using the finest time step that the model implies. In some cases, the solution procedure becomes cumbersome because of the extremely large number of time steps needed for integrating the evolution model in the whole time interval. In this paper, we considered an alternative approach that lies in separating the time axis (one-dimensional in nature) in a multidimensional time space. Then, for circumventing the resulting curse of dimensionality, the proper generalized decomposition was applied allowing a fast solution with significant computing time savings with respect to a standard incremental integration.Spanish Ministry of Education and Science grant number (CICYT-DPI2008-00918
    corecore