Готові списки джерел за темами / Architectured matrials

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій

Добірка наукової літератури з теми "Architectured matrials"

Автор: Grafiati

Опубліковано: 20 квітня 2024

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Architectured matrials".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Architectured matrials"

Cinar, Gokcin, Elena Garcia, and Dimitri N. Mavris. "A framework for electrified propulsion architecture and operation analysis." Aircraft Engineering and Aerospace Technology 92, no. 5 (August 19, 2019): 675–84. http://dx.doi.org/10.1108/aeat-06-2019-0118.

Повний текст джерела

Анотація:

Purpose The purpose of this paper was to create a generic and flexible framework for the exploration, evaluation and side-by-side comparison of novel propulsion architectures. The intent for these evaluations was to account for varying operation strategies and to support architectural design space decisions, at the conceptual design stages, rather than single-point design solutions. Design/methodology/approach To this end, main propulsion subsystems were categorized into energy, power and thrust sources. Two types of matrices, namely, the property and interdependency matrices, were created to describe the relationships and power flows among these sources. These matrices were used to define various electrified propulsion architectures, including, but not limited to, turboelectric, series-parallel and distributed electric propulsion configurations. Findings As a case study, the matrices were used to generate and operate the distributed electric propulsion architecture of NASA’s X-57 Mod IV aircraft concept. The mission performance results were acceptably close to the data obtained from the literature. Finally, the matrices were used to simulate the changes in the operation strategy under two motor failure scenarios to demonstrate the ease of use, rapidness and automation. Originality/value It was seen that this new framework enables rapid and analysis-based comparisons among unconventional propulsion architectures where solutions are driven by requirements.

Стилі APA, Harvard, Vancouver, ISO та ін.

D’Alessandro, Martina. "Oswald Mathias Ungers at Belvederestrasse: Self-portrait in the Studio." Athens Journal of Architecture 8, no. 4 (October 5, 2022): 405–38. http://dx.doi.org/10.30958/aja.8-4-5.

Повний текст джерела

Анотація:

Planning implies a double register of actions. On the one hand the architect establishes a dialogue with the reality, performing a maieutic action that allows him to arrive to an epiphany concerning the context’s deepest meanings. On the other hand, the obstetrical role of the architect is propaedeutic to the creative act of designing that, in the poietic impetus, pushes the architect towards the definition of a dynamic continuum of renewed principles. In the tension between maieutic and poietic, between autonomy and heteronomy of the architectural discipline, the nature of architecture is rooted. Working with the interdisciplinary dimension of architecture corresponds to the opportunity of drawing a cultural self-portrait, of which it is possible to decrypt the traits through the patient scanning of images, photographs, objects collected in the memorabilia. Individuals like Oswald Mathias Ungers (1926-2007) express, in an extraordinarily clear and fascinating way, the attitude of working within architecture through other disciplines. OMU arrives on the scene of architectural culture not only for his works and his theoretical contributions, but also for the importance of his art and rare books private collection. The collected artworks are matrixes at the basis of his architectures, they reflect his ideas through the free tools of art. Ungers’ studiolo, built in his house in Belvederestrasse in Cologne, assumes the value of a place of retreat in an ideal and inscrutable spot, in which Ungers can study his art collection and reflect on the cultural matrixes of his architecture. The thesis that this essay wants to explore is the relationship between OMU’s architecture and the system of references to the sister arts of architecture, considering the Kubus-Haus as a paradigm of this interdisciplinary interweaving based on suggestions, analogies, similarities, connections and overlaps, that have created a general and complicated system akin to a palimpsest.

Стилі APA, Harvard, Vancouver, ISO та ін.

Arai, Kohei. "Method for Training and White Boxing DL, BDT, Random Forest and Mind Maps Based on GNN." Applied Sciences 13, no. 8 (April 10, 2023): 4743. http://dx.doi.org/10.3390/app13084743.

Повний текст джерела

Анотація:

A method for training and white boxing of deep learning (DL) binary decision trees (BDT), random forest (RF) as well as mind maps (MM) based on graph neural networks (GNN) is proposed. By representing DL, BDT, RF, and MM as graphs, these can be trained by GNN. These learning architectures can be optimized through the proposed method. The proposed method allows representation of the architectures with matrices because the learning architecture can be expressed with graphs. These matrices and graphs are visible, which makes the learning processes visible, and therefore, more accountable. Some examples are shown here to highlight the usefulness of the proposed method, in particular, for learning processes and for ensuring the accountability of DL together with improvement in network architecture.

Стилі APA, Harvard, Vancouver, ISO та ін.

Mutiah, Nurul, and Ferdy Febriyanto. "Perancangan Arsitektur Enterprise FMIPA UNTAN Menggunakan Kerangka Kerja TOGAF Berbasis SOA." JURNAL SISTEM INFORMASI BISNIS 12, no. 2 (December 20, 2022): 116–23. http://dx.doi.org/10.21456/vol12iss2pp116-123.

Повний текст джерела

Анотація:

The research aims to develop an Enterprise Architecture from FMIPA UNTAN, this is based on the many individual information systems that have been developed by FMIPA UNTAN which are not integrated in data and technology. This situation results in overlapping data that can affect the effectiveness of decision making within the organization. The designed Enterprise Architecture implements the concept of service-oriented architecture in order to support the integration between the business layer and the organization's technology layer. To support the research, several concepts are used, such as TOGAF as a framework for developing Enterprise Architecture, Service Oriented Architecture as a supporter for integration of architectural layers, and Archimate and Business Process Modeling Notation as a modeling language used to create architectural artifacts. The stages of the research included problem identification, the Enterprise Architecture development process followed the stages of TOGAF ADM namely the preliminary phase, architectural vision, business architecture, information system architecture, technology architecture, and making an architecture implementation roadmap. The results of the development of Enterprise Architecture are architectural artifacts consisting of catalogs, matrices, and diagrams of business, information system, and technology architecture. Based on the design results, it is found that the Enterprise Service Bus concept in Service Oriented Architecture can be used to support application and data integration in organization, as well as the concept of service access can bridge the gap between the business layer and the technology layer.

Стилі APA, Harvard, Vancouver, ISO та ін.

Oh, Kun-Ku, Xin-Jun Liu, Deuk Soo Kang, and Jongwon Kim. "Optimal design of a micro parallel positioning platform. Part I: Kinematic analysis." Robotica 22, no. 6 (November 2004): 599–609. http://dx.doi.org/10.1017/s0263574704000396.

Повний текст джерела

Анотація:

Using a coarse-and-fine actuator combination (dual stage system), a new design of the three degree-of-freedom (DOF) micro parallel positioning platform with high mobility, high accuracy, and a large working space is proposed. To achieve these three DOFs and implement the dual stage system, there are six possible architectures for the coarse and fine actuators, respectively. This paper is organized in two parts. Part I treats the kinematic analysis of each architecture and the problem of selecting the correct coarse actuator architecture. Inverse kinematics and Jacobian matrices for six types of coarse actuator architectures are derived and one proper coarse actuator architecture is selected based on the mobility (rotational capability) analysis, condition number evaluation of the Jacobian matrix, and manufacturability consideration. Part II on real machine design will follow in the next issue of Robotica.

Стилі APA, Harvard, Vancouver, ISO та ін.

del Río-Calleja, Beatriz, Joaquín Grau Enguix, and Alfonso García-Santos. "Architectural Systemic Approach: The Serpentine Gallery 2005, a Reciprocal Frame Case Study." Buildings 12, no. 7 (July 20, 2022): 1051. http://dx.doi.org/10.3390/buildings12071051.

Повний текст джерела

Анотація:

The application of the systemic approach in architecture aims to promote an integral, holistic view of the architectural design process. The literature reviewed calls for models with systemic behavior, and for these models to be applied in concrete cases. This paper proposes an original approach, using the foundation matrix and the constructive logic matrix. Both matrices are part of a developing model that is being tested on a case study. The work presented here had two objectives: to check this part of the model and gain more knowledge about the model itself. The selected case study, the 2005 Serpentine Gallery Pavilion, is a contemporary ephemeral construction of significant architectural interest. It is a reciprocal frame structure, linked to the construction history. The methodology used was a systemic analysis. In the first phase of the analysis, the reciprocal structures documented historically in the West were reviewed. The other two phases corresponded to the application of the two model matrices. Conceptual diagramming was used in all phases of the process. The results show the importance of the study of historical building solutions. The use of matrices facilitates the identification and understanding of the operations carried out in the design process of the case study. Matrices favor the organization of concepts and relationships from through a systemic approach. Understanding generation operations in an integrated way leads to a type of knowledge (relational knowledge) that allows architecture to be thought about in a holistic way. This makes the systemic view of art and technology as a unit possible, attending to the whole complexity of architectural thinking.

Стилі APA, Harvard, Vancouver, ISO та ін.

Prabhu, Gayathri R., Bibin Johnson, and J. Sheeba Rani. "Scalable Fixed Point QRD Core Using Dynamic Partial Reconfiguration." International Journal of Reconfigurable Computing 2014 (2014): 1–9. http://dx.doi.org/10.1155/2014/243835.

Повний текст джерела

Анотація:

A Givens rotation based scalable QRD core which utilizes an efficient pipelined and unfolded 2D multiply and accumulate (MAC) based systolic array architecture with dynamic partial reconfiguration (DPR) capability is proposed. The square root and inverse square root operations in the Givens rotation algorithm are handled using a modified look-up table (LUT) based Newton-Raphson method, thereby reducing the area by 71% and latency by 50% while operating at a frequency 49% higher than the existing boundary cell architectures. The proposed architecture is implemented on Xilinx Virtex-6 FPGA for any real matrices of sizem×n, where4≤n≤8andm≥nby dynamically inserting or removing the partial modules. The evaluation results demonstrate a significant reduction in latency, area, and power as compared to other existing architectures. The functionality of the proposed core is evaluated for a variable length adaptive equalizer.

Стилі APA, Harvard, Vancouver, ISO та ін.

Giannoula, Christina, Ivan Fernandez, Juan Gómez-Luna, Nectarios Koziris, Georgios Goumas, and Onur Mutlu. "Towards Efficient Sparse Matrix Vector Multiplication on Real Processing-In-Memory Architectures." ACM SIGMETRICS Performance Evaluation Review 50, no. 1 (June 20, 2022): 33–34. http://dx.doi.org/10.1145/3547353.3522661.

Повний текст джерела

Анотація:

Several manufacturers have already started to commercialize near-bank Processing-In-Memory (PIM) architectures, after decades of research efforts. Near-bank PIM architectures place simple cores close to DRAM banks. Recent research demonstrates that they can yield significant performance and energy improvements in parallel applications by alleviating data access costs. Real PIM systems can provide high levels of parallelism, large aggregate memory bandwidth and low memory access latency, thereby being a good fit to accelerate the Sparse Matrix Vector Multiplication (SpMV) kernel. SpMV has been characterized as one of the most significant and thoroughly studied scientific computation kernels. It is primarily a memory-bound kernel with intensive memory accesses due its algorithmic nature, the compressed matrix format used, and the sparsity patterns of the input matrices given. This paper provides the first comprehensive analysis of SpMV on a real-world PIM architecture, and presents SparseP, the first SpMV library for real PIM architectures. We make two key contributions. First, we design efficient SpMV algorithms to accelerate the SpMV kernel in current and future PIM systems, while covering a wide variety of sparse matrices with diverse sparsity patterns. Second, we provide the first comprehensive analysis of SpMV on a real PIM architecture. Specifically, we conduct our rigorous experimental analysis of SpMV kernels in the UPMEM PIM system, the first publicly-available real-world PIM architecture. Our extensive evaluation provides new insights and recommendations for software designers and hardware architects to efficiently accelerate the SpMV kernel on real PIM systems. For more information about our thorough characterization on the SpMV PIM execution, results, insights and the open-source SparseP software package [21], we refer the reader to the full version of the paper [3, 4]. The SparseP software package is publicly and freely available at https://github.com/CMU-SAFARI/SparseP.

Стилі APA, Harvard, Vancouver, ISO та ін.

Berry, Michael W. "Large-Scale Sparse Singular Value Computations." International Journal of Supercomputing Applications 6, no. 1 (April 1992): 13–49. http://dx.doi.org/10.1177/109434209200600103.

Повний текст джерела

Анотація:

We present four numerical methods for computing the singular value decomposition (SVD) of large sparse matrices on a multiprocessor architecture. We emphasize Lanczos and subspace iteration-based methods for determining several of the largest singular triplets (singular values and corresponding left- and right-singular vectors) for sparse matrices arising from two practical applications: information retrieval and seismic reflection tomography. The target architectures for our implementations are the CRAY-2S/4–128 and Alliant FX/80. The sparse SVD problem is well motivated by recent information-retrieval techniques in which dominant singular values and their corresponding singular vectors of large sparse term-document matrices are desired, and by nonlinear inverse problems from seismic tomography applications which require approximate pseudo-inverses of large sparse Jacobian matrices. This research may help advance the development of future out-of-core sparse SVD methods, which can be used, for example, to handle extremely large sparse matrices 0 × (106) rows or columns associated with extremely large databases in query-based information-retrieval applications.

Стилі APA, Harvard, Vancouver, ISO та ін.

A.V., Chistyakov. "On improving the efficiency of mathematical modeling of the problem of stability of construction." Artificial Intelligence 25, no. 3 (October 10, 2020): 27–36. http://dx.doi.org/10.15407/jai2020.03.027.

Повний текст джерела

Анотація:

Algorithmic software for mathematical modeling of structural stability is considered, which is reduced to solving a partial generalized eigenvalues problem of sparse matrices, with automatic parallelization of calculations on modern parallel computers with graphics processors. Peculiarities of realization of parallel algorithms for different structures of sparse matrices are presented. The times of solving the problem of stability of composite materialsusing a three-dimensional model of "finite size fibers" on computers of different architectures are given. In mathematical modeling of physical and technical processes in many cases there is a need to solve problems of algebraic problem of eigenvalues (APVZ) with sparse matrices of large volumes. In particular, such problems arise in the analysis of the strength of structures in civil and industrial construction, aircraft construction, electric welding, etc. The solving to these problems is to determine the eigenvalues and eigenvectors of sparse matrices of different structure. The efficiency of solving these problems largely depends on the effectiveness of mathematical modeling of the problem as a whole. Continuous growth of task parameters, calculation of more complete models of objects and processes on computers require an increase in computer productivity. High-performance computing requirements are far ahead of traditional parallel computing, even with multicore processors. High-performance computing requirements are far ahead of traditional parallel computing, even with multicore processors. Today, this problem is solved by using powerful supercomputers of hybrid architecture, such as computers with multicore processors (CPUs) and graphics processors (GPUs), which combine MIMD and SIMD architectures. But the potential of high-performance computers can be used to the fullest only with algorithmic software that takes into account both the properties of the task and the features of the hybrid architecture. Complicating the architecture of modern high-performance supercomputers of hybrid architecture, which are actively used for mathematical modeling (increasing the number of computer processors and cores, different types of computer memory, different programming technologies, etc.) means a significant complication of efficient use of these resources in creating parallel algorithms and programs. here are problems with the creation of algorithmic software with automatic execution of stages of work, which are associated with the efficient use of computing resources, ways to store and process sparse matrices, analysis of the reliability of computer results. This makes it possible to significantly increase the efficiency of mathematical modeling of practical problems on modern high-performance computers, as well as free users from the problems of parallelization of complex problems. he developed algorithmic software automatically implements all stages of parallel computing and processing of sparse matrices on a hybrid computer. It was used at the Institute of Mechanics named after S.P. Tymoshenko NAS of Ukraine in modeling the strength problems of composite material. A significant improvement in the time characteristics of mathematical modeling was obtained. Problems of mathematical modeling of the properties of composite materials has an important role in designing the processes of deformation and destruction of products in various subject areas. Algorithmic software for mathematical modeling of structural stability is considered, which is reduced to solving a partial generalized problem of eigen values of sparse matrices of different structure of large orders, with automatic parallelization of calculations on modern parallel computers with graphics processors. The main methodological principles and features of implementation of parallel algorithms for different structures of sparse matrices are presented, which ensure effective implementation of multilevel parallelism of a hybrid system and reduce data exchange time during the computational process. As an example of these approaches, a hybrid algorithm of the iteration method in subspace for tape and block-diagonal matrices with a frame for computers of hybrid architecture is given. Peculiarities of data decomposition for matrices of profile structure at realization of parallel algorithms are considered. The proposed approach provides automatic determination of the required topology of the hybrid computer and the optimal amount of resources for the organization of an efficient computational process. The results of testing the developed algorithmic software for problems from the collection of the University of Florida, as well as the times of solving the problem of stability of composite materials using a three-dimensional model of "finite size fibers" on computers of different architectures. The results show a significant improvement in the time characteristics of solving problems.

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Architectured matrials"

Mou, Guangjin. "Design of exotic architectured materials in linear elasticity." Electronic Thesis or Diss., Sorbonne université, 2023. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2023SORUS519.pdf.

Повний текст джерела

Анотація:

Les classes de symétrie d'un comportement linéaire définissent les différents types d'anisotropie qui peuvent être modélisés par les tenseurs constitutifs associés. Cependant, les espaces des matériaux linéaires sont très riches et toute une gamme de possibilités intermédiaires peut exister au-delà des classes de symétrie. Les matériaux présentant des propriétés anisotropes non-standard associées à ces possibilités intermédiaires sont appelés matériaux exotiques. Par exemple, le matériau 2D R0-orthotrope est un cas bien connu de matériau exotique.L'objectif principal de cette recherche est de développer des outils géométriques pour caractériser les espaces linéaires des matériaux de manière très fine, ce qui permet de détecter ces possibilités intermédiaires. L'ensemble exotique obtenu est intrinsèquement caractérisé par une relation polynomiale entre les invariants du tenseur d'élasticité. En conséquence, nous prouvons que la R0-orthotropie est le seul type de matériau élastique exotique en 2D. Cependant, lorsque l'on généralise à l'élasticité linéaire 3D, ce nombre s'élève à 163.Le deuxième objectif de cette étude est d'obtenir une mésostructure présentant à grande échelle le comportement exotique décrit précédemment. Un algorithme d'optimisation basé sur la dérivée topologique est implémenté dans Python/FEniCS pour réaliser la design de mésostructure périodiques. Le matériau 2D R0-orthotrope et plusieurs cas de matériaux exotiques 3D sont étudiés. La fonction objective du problème d'optimisation est formulée en termes d'invariants du tenseur d'élasticité effectif cible
The symmetry classes of a linear constitutive law define the different types of anisotropy that can be modelled by the associated constitutive tensors. However, the spaces of linear materials are very rich and a whole range of intermediate possibilities can exist beyond symmetry classes. Materials with non-standard anisotropic properties associated with such intermediate possibilities are called exotic materials. For instance, 2D R0-orthotropic material is a well-known case of exotic material.The primary objective of this research is to develop geometrical tools to characterise the linear material spaces in a very fine way, which allow these intermediate possibilities to be detected. The exotic set obtained is intrinsically characterised by a polynomial relation between elasticity tensor invariants. As a result, we prove that R0-orthotropy is the only type of 2D exotic elastic material. However, when generalised to 3D linear elasticity, this number is up to 163.The second objective of this study is to obtain a mesostructure exhibiting at macroscale the exotic behaviour described previously. A topological derivative-based optimisation algorithm is implemented in Python/FEniCS to realise the design of periodic metamaterials. The 2D R0-orthotropic material and several cases of 3D exotic materials are studied. The objective function of the optimisation problem is formulated in terms of the invariants of the target effective elasticity tensor

Стилі APA, Harvard, Vancouver, ISO та ін.

Romero, Mier y. Teran Andrés. "Real-time multi-target tracking : a study on color-texture covariance matrices and descriptor/operator switching." Phd thesis, Université Paris Sud - Paris XI, 2013. http://tel.archives-ouvertes.fr/tel-01002065.

Повний текст джерела

Анотація:

Visual recognition is the problem of learning visual categories from a limited set of samples and identifying new instances of those categories, the problem is often separated into two types: the specific case and the generic category case. In the specific case the objective is to identify instances of a particular object, place or person. Whereas in the generic category case we seek to recognize different instances that belong to the same conceptual class: cars, pedestrians, road signs and mugs. Specific object recognition works by matching and geometric verification. In contrast, generic object categorization often includes a statistical model of their appearance and/or shape.This thesis proposes a computer vision system for detecting and tracking multiple targets in videos. A preliminary work of this thesis consists on the adaptation of color according to lighting variations and relevance of the color. Then, literature shows a wide variety of tracking methods, which have both advantages and limitations, depending on the object to track and the context. Here, a deterministic method is developed to automatically adapt the tracking method to the context through the cooperation of two complementary techniques. A first proposition combines covariance matching for modeling characteristics texture-color information with optical flow (KLT) of a set of points uniformly distributed on the object . A second technique associates covariance and Mean-Shift. In both cases, the cooperation allows a good robustness of the tracking whatever the nature of the target, while reducing the global execution times .The second contribution is the definition of descriptors both discriminative and compact to be included in the target representation. To improve the ability of visual recognition of descriptors two approaches are proposed. The first is an adaptation operators (LBP to Local Binary Patterns ) for inclusion in the covariance matrices . This method is called ELBCM for Enhanced Local Binary Covariance Matrices . The second approach is based on the analysis of different spaces and color invariants to obtain a descriptor which is discriminating and robust to illumination changes.The third contribution addresses the problem of multi-target tracking, the difficulties of which are the matching ambiguities, the occlusions, the merging and division of trajectories.Finally to speed algorithms and provide a usable quick solution in embedded applications this thesis proposes a series of optimizations to accelerate the matching using covariance matrices. Data layout transformations, vectorizing the calculations (using SIMD instructions) and some loop transformations had made possible the real-time execution of the algorithm not only on Intel classic but also on embedded platforms (ARM Cortex A9 and Intel U9300).

Стилі APA, Harvard, Vancouver, ISO та ін.

Lemaitre, Florian. "Tracking haute fréquence pour architectures SIMD : optimisation de la reconstruction LHCb." Electronic Thesis or Diss., Sorbonne université, 2019. http://www.theses.fr/2019SORUS221.

Повний текст джерела

Анотація:

Tout au long de cette thèse, nous avons étudié des problèmes d'algèbre linéaire de petite dimension (typiquement de 2x2 à 5x5) utilisés au sein de l'expérience LHCb (mais aussi dans d'autres domaines tels que la vision par ordinateur). Les bibliothèques d’algèbre linéaire telles que Eigen, Magma ou la MKL ne sont pas optimisées pour de petites matrices. Nous avons utilisé et combiné plusieurs transformations connues facilitant le SIMD ainsi que des transformations moins usuelles comme la racine carré inverse rapide. Pour faciliter l’écriture de ces transformations, mais également dans le but d’avoir un code portable, nous avons écrit un générateur de code. Nous avons testé ces transformations et analysé leur impact sur la vitesse de traitement d’algorithmes simples. Le traitement par lot (batch) en SoA est crucial pour maximiser la vitesse de traitements de ces problèmes à faible dimension. Une analyse de la précision des résultats en fonction de la précision de calcul a également été faite sur ces exemples. Nous avons alors implémenté ces transformations dans le but d’accélérer la factorisation de Cholesky de petites matrices (jusqu'à 12x12). La vitesse de traitement plafonne sans l’utilisation du calcul rapide de la racine carrée inverse. Nous avons obtenu une accélération entre x10 et x33 en F32. Notre code est ainsi de x3 à x10 plus rapide que la MKL. Enfin, nous avons étudié et accéléré le filtre de Kalman généraliste. Nous avons ainsi obtenu une accélération de x90 sur l'implémentation 4x4 F32. Le filtre de Kalman utilisé au sein de LHCb a été accéléré d'un facteur x2,2 par rapport à la version actuelle SIMD et supérieur à x2,3 par rapport aux filtres d'autres expériences de physique des particules
During this thesis, we studied linear algebra systems with small matrices (typically from 2x2 to 5x5) used within the LHCb experiment (and also in other domains like computer vision). Linear algebra libraries like Eigen, Magma or the MKL are not optimized for such small matrices. We used and combined many well-known transforms helping SIMD and some unusual transforms like the fast reciprocal square root computation. We wrote a code generator in order to simplify the use of such transforms and to have a portable code. We tested these optimizations and analyzed their impact on the speed of simple algorithm. Batch processing in SoA is crucial to process fast these small matrices. We also analyzed how the accuracy of the results depends on the precision of the data. We implemented these transforms in order to speed-up the Cholesky factorization of small matrices (up to 12x12). The processing speed is capped if the fast reciprocal square root computation is not used. We got a speed up between x10 and x33 using F32. Our version is then from x3 to x10 faster than MKL. Finally, we studied and sped up the Kalman filter in its general form. Our 4x4 F32 implementation is x90 faster. The Kalman filter used within LHCb has been sped up by x2.2 compared to the current SIMD version and by at least x2.3 compared to filters used other high energy physics experiments

Стилі APA, Harvard, Vancouver, ISO та ін.

Brown, Lucas A. "Matrices as a tool for space and time integration : a methodology for reducing human impact and increasing quality of life." Virtual Press, 2002. http://liblink.bsu.edu/uhtbin/catkey/1231343.

Повний текст джерела

Анотація:

This study provides a framework using matrices that address three main issues. First of all, the matrices are used to integrated physical needs that compose human systems in an attempt to reduce the human impact. Secondly, the matrices are used to develop a higher integration of time allowing the user to apply time to a wide variety of needs that contribute to a high quality of life. Lastly the matrices are used to integrate the aspects of space with the aspects of time. This shows that the whole, time and space, is greater than the sum of the parts. I pursued this study in an attempt to further define sustainable design. The application of the matrices was practiced in a design competition for urban sustainability.
Department of Architecture

Стилі APA, Harvard, Vancouver, ISO та ін.

Westerberg, Per. "Enterprise Architecture Analysis : - Astudy of the IT landscape atAstraZeneca." Thesis, KTH, Industriella informations- och styrsystem, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-169227.

Повний текст джерела

Анотація:

A case study at a global pharmaceutical company has been conducted toanalyse how the Hidden Structure method using the Enterprise Architecture Analyses(EAAT) tool, developed at KTH, can be used to visualize the IT architecture and tocreate a better understanding on which applications could increase a risk of therobustness of the architecture if changes was done to them. Also the measure of ITsupport metrics as incidents and changes per system has been analysed to understandif they can be used to understand the robustness of the incident. The tool was used tocreate a model of the enterprise architecture of the company and the analysis showedthat the robustness of the IT architecture was good; the core applications that couldcreate most damage were identified. The analysis of the IT support metrics showedthat it was difficult to use the change records as indicators since the number ofchanges per systems were very few. The incident analysis showed that the systemswith the highest number of incidents were classified as belonging core or peripheralcategory.

Стилі APA, Harvard, Vancouver, ISO та ін.

EDJLALI, GUY. "Contribution a la parallelisation de methodes iteratives hybrides pour matrices creuses sur architectures heterogenes." Paris 6, 1994. http://www.theses.fr/1994PA066360.

Повний текст джерела

Анотація:

Cette these traite de programmation parallele heterogene, des structures de donnees irregulieres et de methode iterative hybride. La methode iterative choisie est la methode d'arnoldi de calcul de valeurs propres et de vecteurs propres de matrices creuses. Dans une premiere partie, une implementation data-parallele de cette methode a ete realisee. Cela a permis de mettre en evidence le comportement du programme et les lacunes existantes au niveau des outils de manipulation de matrices creuses. Dans une deuxieme partie, nous avons developpe des outils de manipulation de matrices creuses et propose un format de stockage data parallele de matrices creuses generales. Ce format est utilise pour implementer le noyau d'une bibliotheque data parallele de manipulation de matrices creuses. Dans une troisieme partie, nous avons etudie les structures de donnees irregulieres pour les machines mimd a memoire distribuee. Cette etude a mis en evidence l'interet de la compilation a l'execution. Nous avons etendu la compilation a l'execution aux environnements adaptatifs, c'est-a-dire aux environnements dont le nombre de processeurs varie a l'execution. Enfin, a travers le calcul de valeurs propres et de vecteurs propres, nous avons aborde les environnements d'execution heterogenes. Nous avons propose une methode d'arnoldi hybride s'executant sur un ensemble de machines paralleles distribuees. Nous avons mis en evidence la necessite de nouveaux algorithmes pour exploiter ces ensembles de machines

Стилі APA, Harvard, Vancouver, ISO та ін.

Dolz, Zaragozá Manuel Francisco. "Energy-aware matrix computacion on multirhreaded architectures." Doctoral thesis, Universitat Jaume I, 2014. http://hdl.handle.net/10803/669082.

Повний текст джерела

Анотація:

Desde hace décadas, la computación de altas prestaciones ha concentrado sus esfuerzos en la optimización de algoritmos aplicados a la resolución de problemas complejos que aparecen en un amplio abanico de aplicaciones de casi todas las áreas científicas y tecnológicas. En este sentido el uso de herramientas y técnicas, tales como la computación paralela y distribuida, han impulsado la mejora de las prestaciones en este tipo de algoritmos y aplicaciones. Hoy en día, el término optimización hace referencia a la reducción del tiempo de ejecución, aunque también a la energía necesaria para su cómputo. La búsqueda de soluciones verdes o fuentes de energía alternativas que permitan reducir las emisiones de CO2 a la atmósfera demuestran la creciente preocupación por el medio ambiente. En el ámbito de las tecnologías de la información y, más concretamente, en la computación de altas prestaciones, la comunidad científico-técnica muestra especial interés en el desarrollo de componentes, herramientas y técnicas que permitan minimizar el consumo energético. En este sentido, se pretende que las aplicaciones sean conscientes de la energía disipada, tanto en el sistema operativo como en las bibliotecas de cómputo, comunicación y aplicaciones paralelas. Los objetivos de la presente tesis están orientados al estudio, análisis y aprovechamiento de las técnicas de ahorro disponibles en las arquitecturas de computadores multinúcleo e híbridas (CPU-GPU) actuales actuales con el fin de mejorar el rendimiento energético en aplicaciones que requieren la resolución de problemas de álgebra lineal densa y dispersa. Los resultados experimentales obtenidos que validan las ganancias conseguidas mediante medidores de energía, consiguiendo destacables ahorros energéticos y manteniendo un constante compromiso entre prestaciones y ahorros generados.

Стилі APA, Harvard, Vancouver, ISO та ін.

Baala, Hichem. "Vague récursive distribuée : application aux arbres de jeux et aux matrices." Paris 8, 1999. http://www.theses.fr/1999PA081594.

Повний текст джерела

Анотація:

Jusqu'a une epoque recente, la conception d'un algorithme distribue passait neces♭ sairement par une phase de specification des echanges de messages entre les differents processus participant au traitement distribue. L'appel de procedure distante [bn83] fut l'un des premiers outils a rendre transparente la gestion des echanges de messages entre processus distribues. Le concept de la vague recursive distribuee du a g. Florin et i. Lavallee [fl91] et developpe dans sa these pour les applications <> par r. Gomez [gom95], utilise l'apd, la recursivite et le calcul diffusant et offre un nouveau mode de programmation distribuee. Sortant des seules applications systemes, nous etendrons le concept de la vrd aux arbres de jeux et aux calculs matriciels [baa98, baa99]. Une generalisation de la vrd aux systemes distribues conduit au concept de la multi-vrd qui integres des aspects a la fois d'auto-adaptation et auto-restauration d'une structure de controle, et une optimisation de la charge du reseau en messages de controle. L'etude des vagues recursives et leur application a un probleme de calcul numerique - la multiplication matricielle - nous a amene a reconsiderer la methode due a stra@en [str69] et a en donner, pour la premiere fois, une version iterative - que nous avons implante - qui permet d'obtenir l'expression d'un element quelconque de la matrice resultat d'un produit matriciel obtenu par la methode de stra@en, quelque soit l'ordre de la matrice [bl98]. Ce resultat permet de faire sortir la methode de stra@en du champ purement theorique ou son caractere hautement recursif la tenait confinee et permet d'entrevoir une utilisation reelle de cette methode.

Стилі APA, Harvard, Vancouver, ISO та ін.

Rocha, Lindomar José. "Determinação de autovalores e autovetores de matrizes tridiagonais simétricas usando CUDA." reponame:Repositório Institucional da UnB, 2015. http://repositorio.unb.br/handle/10482/19625.

Повний текст джерела

Анотація:

Dissertação (mestrado)–Universidade de Brasília, Universidade UnB de Planaltina, Programa de Pós-Graduação em Ciência de Materiais, 2015.
Submitted by Fernanda Percia França (fernandafranca@bce.unb.br) on 2015-12-15T17:59:17Z No. of bitstreams: 1 2015_LindomarJoséRocha.pdf: 1300687 bytes, checksum: f028dc5aba5d9f92f1b2ee949e3e3a3d (MD5)
Approved for entry into archive by Raquel Viana(raquelviana@bce.unb.br) on 2016-02-29T22:14:44Z (GMT) No. of bitstreams: 1 2015_LindomarJoséRocha.pdf: 1300687 bytes, checksum: f028dc5aba5d9f92f1b2ee949e3e3a3d (MD5)
Made available in DSpace on 2016-02-29T22:14:44Z (GMT). No. of bitstreams: 1 2015_LindomarJoséRocha.pdf: 1300687 bytes, checksum: f028dc5aba5d9f92f1b2ee949e3e3a3d (MD5)
Diversos ramos do conhecimento humano fazem uso de autovalores e autovetores, dentre eles têm-se Física, Engenharia, Economia, etc. A determinação desses autovalores e autovetores pode ser feita utilizando diversas rotinas computacionais, porém umas mais rápidas que outras nesse senário de ganho de velocidade aparece a opção de se usar a computação paralela de forma mais especifica a CUDA da Nvidia é uma opção que oferece um ganho de velocidade significativo, nesse modelo as rotinas são executadas na GPU onde se tem diversos núcleos de processamento. Dada a tamanha importância dos autovalores e autovetores o objetivo desse trabalho é determinar rotinas que possam efetuar o cálculos dos mesmos com matrizes tridiagonais simétricas reais de maneira mais rápida e segura, através de computação paralela com uso da CUDA. Objetivo esse alcançado através da combinação de alguns métodos numéricos para a obtenção dos autovalores e um alteração no método da iteração inversa utilizado na determinação dos autovetores. Temos feito uso de rotinas LAPACK para comparar com as nossas rotinas desenvolvidas em CUDA. De acordo com os resultados, a rotina desenvolvida em CUDA tem a vantagem clara de velocidade quer na precisão simples ou dupla, quando comparado com o estado da arte das rotinas de CPU a partir da biblioteca LAPACK. ______________________________________________________________________________________________ ABSTRACT
Severa branches of human knowledge make use of eigenvalues and eigenvectors, among them we have physics, engineering, economics, etc. The determination of these eigenvalues and eigenvectors can be using various computational routines, som faster than others in this speed increase scenario appears the option to use the parallel computing more specifically the Nvidia’s CUDA is an option that provides a gain of significant speed, this model the routines are performed on the GPU which has several processing cores. Given the great importance of the eigenvalues and eigenvectors the objective of this study is to determine routines that can perform the same calculations with real symmetric tridiagonal matrices more quickly and safely, through parallel computing with use of CUDA. Objective that achieved by some combination of numerical methods to obtain the eigenvalues and a change in the method of inverse iteration used to determine of the eigenvectors, which was used LAPACK routines to compare with routine developed in CUDA. According to the results of the routine developed in CUDA has marked superiority with single or double precision, in the question speed regarding the routines of LAPACK.

Стилі APA, Harvard, Vancouver, ISO та ін.

El-Ghajiji, Otman Abubaker. "Investigations into the suitability of parallel computing architectures for the solution of large sparse matrices using the preconditioned conjugate gradient method." Thesis, University of Bath, 1995. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.299647.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Книги з теми "Architectured matrials"

L, Patrick Merrell, and Langley Research Center, eds. Factoring symmetric indefinite matrices on high-performance architectures. Hampton, Va: National Aeronautics and Space Administration, Langley Research Center, 1990.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Massachusetts Institute of Technology. Space Systems Laboratory. and United States. National Aeronautics and Space Administration., eds. H2 fixed architecture control design for large scale systems. Cambridge, MA: Space Systems Laboratory, Dept. of Aeronautics and Astronautics, Massachusetts Institute of Technology, 1990.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

E, Schutz Bob, and United States. National Aeronautics and Space Administration., eds. Geopotential error analysis from satellite gradiometer and global positioning system observables on parallel architecture. [Washington, DC: National Aeronautics and Space Administration, 1997.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Munerman, Viktor, Vadim Borisov, and Aleksandra Kononova. Mass data processing. Algebraic models and methods. ru: INFRA-M Academic Publishing LLC., 2023. http://dx.doi.org/10.12737/1906037.

Повний текст джерела

Анотація:

The monograph is devoted to mathematical and algorithmic support of mass data processing based on algebraic models. One of the most common classes of mass processing is considered - processing of highly active structured data. The construction of algebraic models of data and calculations and methods of proving their correspondence are analyzed. Three algebraic systems are studied, which can be used both as data models and as models of calculations. The algebraic and axiomatic methods of proving the correspondence of these models are investigated. A proof of their correspondence is given: homomorphism and isomorphism. The problem of optimizing the processes of mass processing of data presented in the form of algebraic expressions in the proposed algebra models is raised. The algorithms of synthesis and optimization of calculation of these expressions, the method of symmetric horizontal data distribution providing parallel implementation of calculation of algebraic expressions and generalization of the block algorithm of parallel matrix multiplication for the case of multiplication of multidimensional matrices are described in detail. Architectures of software and hardware complexes for effective parallel implementation of operations in the considered algebra models are proposed. A number of real-world examples illustrating the application of the proposed methods are given. For students, postgraduates and teachers of technical and physical-mathematical universities and faculties.

Стилі APA, Harvard, Vancouver, ISO та ін.

M, Neville Adam, ed. Structural analysis: A unified classical and matrix approach. 4th ed. London: E & FN Spon, 1997.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ghali, A. Structural analysis: A unified classical and matrix approach. 3rd ed. London: Spon, 1995.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

W, Hou Gene, and United States. National Aeronautics and Space Administration., eds. Methodology for sensitivity analysis, approximate analysis, and design optimization in CFD for multidisciplinary applications: Progress report for the period April 15, 1992 to January 31, 1993. Norfolk, Va: Old Dominion University Research Foundation, 1993.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

W, Hou Gene, and United States. National Aeronautics and Space Administration., eds. Methodology for sensitivity analysis, approximate analysis, and design optimization in CFD for multidisciplinary applications. Norfolk, Va: Old Dominion University Research Foundation, 1992.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

W, Hou Gene, and United States. National Aeronautics and Space Administration., eds. Methodology for sensitivity analysis, approximate analysis, and design optimization in CFD for multidisciplinary applications. Norfolk, Va: Old Dominion University Research Foundation, 1994.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

W, Hou Gene, and United States. National Aeronautics and Space Administration., eds. Methodology for sensitivity analysis, approximate analysis, and design optimization in CFD for multidisciplinary applications: Final report for the period ended December 31, 1995. Norfolk, Va: Dept. of Mechanical Engineering, College of Engineering & Technology, Old Dominion University, 1996.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Частини книг з теми "Architectured matrials"

Testa, Francesco, Alberto Bianchi, and Marco Romagnoli. "Silicon Photonics Switch Matrices: Technologies and Architectures." In Optical Switching in Next Generation Data Centers, 221–59. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-61052-8_12.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ricci, Saverio, Piergiulio Mannocci, Matteo Farronato, Alessandro Milozzi, and Daniele Ielmini. "Development of Crosspoint Memory Arrays for Neuromorphic Computing." In Special Topics in Information Technology, 65–74. Cham: Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-51500-2_6.

Повний текст джерела

Анотація:

AbstractMemristor-based hardware accelerators play a crucial role in achieving energy-efficient big data processing and artificial intelligence, overcoming the limitations of traditional von Neumann architectures. Resistive-switching memories (RRAMs) combine a simple two-terminal structure with the possibility of tuning the device conductance. This Chapter revolves around the topic of emerging memristor-related technologies, starting from their fabrication, through the characterization of single devices up to the development of proof-of-concept experiments in the field of in-memory computing, hardware accelerators, and brain-inspired architecture. Non-volatile devices are optimized for large-size crossbars where the devices’ conductance encodes mathematical coefficients of matrices. By exploiting Kirchhoff’s and Ohm’s law the matrix–vector-multiplication between the conductance matrix and a voltage vector is computed in one step. Eigenvalues/eigenvectors are experimentally calculated according to the power-iteration algorithm, with a fast convergence within about 10 iterations to the correct solution and Principal Component Analysis of the Wine and Iris datasets, showing up to 98% accuracy comparable to a floating-point implementation. Volatile memories instead present a spontaneous change of device conductance with a unique similarity to biological neuron behavior. This characteristic is exploited to demonstrate a simple fully-memristive architecture of five volatile RRAMs able to learn, store, and distinguish up to 10 different items with a memory capability of a few seconds. The architecture is thus tested in terms of robustness under many experimental conditions and it is compared with the real brain, disclosing interesting mechanisms which resemble the biological brain.

Стилі APA, Harvard, Vancouver, ISO та ін.

Tian, Ning, Longjiang Guo, Chunyu Ai, Meirui Ren, and Jinbao Li. "GPU Acceleration of Finding Maximum Eigenvalue of Positive Matrices." In Algorithms and Architectures for Parallel Processing, 231–44. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11194-0_18.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Lisper, Björn, and Sanjay Rajopadhye. "Affine Permutations of Matrices on Mesh-Connected Arrays." In Parallel Algorithms and Architectures for DSP Applications, 129–58. Boston, MA: Springer US, 1991. http://dx.doi.org/10.1007/978-1-4615-3996-4_6.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Frommer, Andreas, and Valeria Simoncini. "Error Bounds for Lanczos Approximations of Rational Functions of Matrices." In Numerical Validation in Current Hardware Architectures, 203–16. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-01591-5_13.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Testa, Francesco, Alberto Bianchi, and Marco Romagnoli. "Correction to: Silicon Photonics Switch Matrices: Technologies and Architectures." In Optical Switching in Next Generation Data Centers, C1. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-319-61052-8_16.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Noor, Fazal, and Syed Misbahuddin. "Using MPI on PC Cluster to Compute Eigenvalues of Hermitian Toeplitz Matrices." In Algorithms and Architectures for Parallel Processing, 313–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13119-6_28.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Sankar, G., R. Raja, J. M. Thomas, and D. Gleeson. "Advances in the Determination of the Architecture of Active Sites in Solid Catalysts." In Catalysis by Unique Metal Ion Structures in Solid Matrices, 95–114. Dordrecht: Springer Netherlands, 2001. http://dx.doi.org/10.1007/978-94-010-0782-5_7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Roch, J. L., and G. Villard. "Parallel computations with algebraic numbers a case study: Jordan normal form of matrices." In PARLE'94 Parallel Architectures and Languages Europe, 701–12. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-58184-7_142.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Matsumoto, Wataru, Manabu Hagiwara, Petros T. Boufounos, Kunihiko Fukushima, Toshisada Mariyama, and Zhao Xiongxin. "A Deep Neural Network Architecture Using Dimensionality Reduction with Sparse Matrices." In Neural Information Processing, 397–404. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-46681-1_48.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Architectured matrials"

Landuré, Jérôme, and Clément Gosselin. "Optimization of the Singularity Locus of a Novel Kinematically Redundant Spherical Parallel Manipulator." In ASME 2017 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2017. http://dx.doi.org/10.1115/detc2017-67840.

Повний текст джерела

Анотація:

This article introduces a new architecture of spherical parallel robot which significantly extends the workspace when compared to existing architectures. To this end, the singularity locus is studied and the design parameters are chosen so as to confine the singularities to areas already limited by other constraints such as mechanical interferences. First, the architecture of the spherical redundant robot is presented and the Jacobian matrices are derived. Afterwards, the analysis of the singularities is addressed from a geometric point of view, which yields a description of the singularity locus expressed as a function of the architectural parameters. Then, the results are applied to an example set of architectural parameters chosen in order to illustrate the advantages of the redundant architecture over current designs in terms of workspace.

Стилі APA, Harvard, Vancouver, ISO та ін.

Athale, Ravindra A., and Charles W. Stirk. "Compact architectures for adaptive neural nets." In OSA Annual Meeting. Washington, D.C.: Optica Publishing Group, 1988. http://dx.doi.org/10.1364/oam.1988.thz6.

Повний текст джерела

Анотація:

A compact optical architecture capable of implementing a number of adaptive neural net models is described. Compact architectures do not involve traditional optical imaging systems and are potentially rugged, easily constructed, and scalable. The critical devices of the generic architecture include 1-D electrooptic modulators and detectors to implement the neural processing elements along with the Pockels readout optical modulator to encode the analog weights. The architectural advances include an input-output compatible method of handling both positive and negative values for the elements of the neuron activation vectors and the synaptic weight matrices during learning and recall. These hybrid architectures are capable of implementing linear and nonlinear associators with adaptive learning algorithms.

Стилі APA, Harvard, Vancouver, ISO та ін.

Landuré, Jérôme, and Clément Gosselin. "Kinematic and Workspace Modelling of a 6-PUS Parallel Mechanism." In ASME 2018 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/detc2018-86122.

Повний текст джерела

Анотація:

This article presents the kinematic analysis of a six-degree-of-freedom six-legged parallel mechanism of the 6-PUS architecture. The inverse kinematic problem is recalled and the Jacobian matrices are derived. Then, an algorithm for the geometric determination of the workspace is presented, which yields a very fast and accurate description of the workspace of the mechanism. Singular boundaries and a transmission ratio index are then introduced and studied for a set of architectural parameters. The proposed analysis yields conceptual architectures whose properties can be adjusted to fit given applications.

Стилі APA, Harvard, Vancouver, ISO та ін.

Tate, Derrick, Timothy T. Maxwell, Bharatendra S. Sharma, and Kunal Patil. "Selection of Vehicle Architecture for EcoCAR Competition Using Axiomatic Design Principles." In ASME 2010 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2010. http://dx.doi.org/10.1115/detc2010-29103.

Повний текст джерела

Анотація:

Axiomatic design (AD) techniques have not previously been applied in designing the overall architecture of an automobile. The present work investigates use of axiomatic design concepts for vehicle design in the Texas Tech University Eco-CAR program. The three different architectures considered are fuel cell, two-mode hybrid, and belt alternator/starter system (BAS+). The objective in using axiomatic design methods is to choose an architecture for the EcoCAR competition vehicle that follows the principles of axiomatic design, and in turn, should prove to be the best choice of vehicle architecture among the three considered. Function means trees (FMT) and design matrices (DM) are constructed for each of the architectures and are used in deciding whether the architecture is a coupled, uncoupled, or decoupled design per the independence axiom. The choice is supported by means of simulation results obtained for each architecture. Finally, a two-mode hybrid architecture is selected based on the use of axiomatic design and the simulation results.

Стилі APA, Harvard, Vancouver, ISO та ін.

Sanaei, Roozbeh, Kevin N. Otto, Katja Hölttä-Otto, and Kristin L. Wood. "Incorporating Constraints in System Modularization by Interactive Clustering of Design Structure Matrices." In ASME 2016 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/detc2016-60510.

Повний текст джерела

Анотація:

Modularity is an approach to manage the design of complex systems by partitioning and assigning elements of a concept to simpler subsystems according to a planned architecture. Functional-flow heuristics suggest possible modules that have been demonstrated in past products, but using them still leaves it to the designer to choose which heuristics make sense in a certain architecture. This constitutes an opportunity for a designer to take other constraints and objectives into account. With large complex systems, the number of alternative groupings of elements into modular chunks becomes exponentially large and some form of automation would be beneficial to accomplish this task. Clustering algorithms using the design structure matrix (DSM) representation search the space of alternative relative positioning of elements and present one ideal outcome ordering which “optimizes” a modularity metric. Beyond the problems of lack of interactive exploration around the optimized result, such approaches also partition the elements in an unconstrained manner. Yet, typical complex products are subject to constraints which invalidate the unconstrained optimization. Such architectural partitioning constraints include those associated with external force fields including electric, magnetic, or pressure fields that constrain some functions to perform or not perform in different regions of the field. There are also supplier constraints where some components cannot be easily provided with others. Overall, it is difficult to simply embed all objectives of modular thinking into one metric to optimize. We develop a new type of interactive clustering algorithm approach considering multiple objectives and partitioning constraints. Partitioning options are offered to a designer interactively as a sequence of clustering choices between elements in the architecture. A designer can incorporate constraints that determine the compatibility or incompatibility of elements by choosing among alternative groupings progressively. Our aim is to combine computational capability of clustering algorithms with the flexibility of manual approaches. Through applying these algorithms to a MRI machine injector, we demonstrate the benefits of interactive cooperation between a designer and modularity algorithms, where constraints can be naturally considered.

Стилі APA, Harvard, Vancouver, ISO та ін.

Mashaly, Maggie, Ahmed El Saied, Wassim Alexan, and Abeer S. Khalifa. "A Multiple Layer Security Scheme Utilizing Information Matrices." In 2019 Signal Processing: Algorithms, Architectures, Arrangements, and Applications (SPA). IEEE, 2019. http://dx.doi.org/10.23919/spa.2019.8936800.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Wang, Cong, and Tilman Wolf. "Virtual Network Mapping with Traffic Matrices." In 2011 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS). IEEE, 2011. http://dx.doi.org/10.1109/ancs.2011.44.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Lemaitre, Florian, and Lionel Lacassagne. "Batched Cholesky factorization for tiny matrices." In 2016 Conference on Design and Architectures for Signal and Image Processing (DASIP). IEEE, 2016. http://dx.doi.org/10.1109/dasip.2016.7853809.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Sarukhanian, Hakob, Sos S. Agaian, Jaakko T. Astola, and Karen O. Egiazarian. "Binary matrices, decomposition and multiply-add architectures." In Electronic Imaging 2003, edited by Edward R. Dougherty, Jaakko T. Astola, and Karen O. Egiazarian. SPIE, 2003. http://dx.doi.org/10.1117/12.473134.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ballard, Grey, Aydin Buluc, James Demmel, Laura Grigori, Benjamin Lipshitz, Oded Schwartz, and Sivan Toledo. "Communication optimal parallel multiplication of sparse random matrices." In SPAA '13: 25th ACM Symposium on Parallelism in Algorithms and Architectures. New York, NY, USA: ACM, 2013. http://dx.doi.org/10.1145/2486159.2486196.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!