Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Architectured matrials.
Статті в журналах з теми "Architectured matrials"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Architectured matrials".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
1
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.
2
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.
3
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.
4
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.
5
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.
6
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.
7
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.
8
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.
9
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.
10
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.
11
Stephen, Okeke, and Mangal Sain. "Using Deep Learning with Bayesian–Gaussian Inspired Convolutional Neural Architectural Search for Cancer Recognition and Classification from Histopathological Image Frames." Journal of Healthcare Engineering 2023 (February 9, 2023): 1–9. http://dx.doi.org/10.1155/2023/4597445.
Повний текст джерелаАнотація:
We propose a neural architectural search model which examines histopathological images to detect the presence of cancer in both lung and colon tissues. In recent times, deep artificial neural networks have made tremendous impacts in healthcare. However, obtaining an optimal artificial neural network model that could yield excellent performance during training, evaluation, and inferencing has been a bottleneck for researchers. Our method uses a Bayesian convolutional neural architectural search algorithm in collaboration with Gaussian processes to provide an efficient neural network architecture for efficient colon and lung cancer classification and recognition. The proposed model learns by using the Gaussian process to estimate the required optimal architectural values by choosing a set of model parameters through the exploitation of the expected improvement (EI) values, thereby minimizing the number of sampled trials and suggesting the best model architecture. Several experiments were conducted, and a landmark performance was obtained in both validation and test data through the evaluation of the proposed model on a dataset consisting of 25,000 images of five different classes with convergence and F1-score matrices.
12
Nestorović, Miodrag, and Vladimir Mišković. "Advanced development of space structures in domains of 3D transformation." SAJ - Serbian Architectural Journal 3, no. 3 (2011): 116–39. http://dx.doi.org/10.5937/saj1102116n.
Повний текст джерелаАнотація:
The emergence of the new architectural solutions and structural forms of Mengeringhausen, Tsuboi, Safdie, Foster, Calatrava and other creators of magnificent structures, may be taken as an initiation and explosion of inventiveness which has continued up to till present. Consequently, the topic of this paper is to show a part of broad range of structural systems which have not been sufficiently disclosed in Serbia and surroundings, in spite of their attractiveness in contemporary architecture, in terms of space transformations, materialization and technology. The basic properties of all analyzed space structures lies in their geometric shape (Archimedean and Platonic polyhedra, polyhedron structures, and bionic of structures as well), which applies regularity, symmetry, speed of mounting, as well as modularity of the original matrices. Solutions and analyses shown deal with multifunctional space matrices, which make its potential very important both in architectural design and in structural theory. The topic of this paper is to consider the development of matrix structure in context of architectural forms in future, emphasizing the importance of structural geometry and its possible applications.
13
Keyes, D. E., H. Ltaief, and G. Turkiyyah. "Hierarchical algorithms on hierarchical architectures." Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 378, no. 2166 (January 20, 2020): 20190055. http://dx.doi.org/10.1098/rsta.2019.0055.
Повний текст джерелаАнотація:
A traditional goal of algorithmic optimality, squeezing out flops, has been superseded by evolution in architecture. Flops no longer serve as a reasonable proxy for all aspects of complexity. Instead, algorithms must now squeeze memory, data transfers, and synchronizations, while extra flops on locally cached data represent only small costs in time and energy. Hierarchically low-rank matrices realize a rarely achieved combination of optimal storage complexity and high-computational intensity for a wide class of formally dense linear operators that arise in applications for which exascale computers are being constructed. They may be regarded as algebraic generalizations of the fast multipole method. Methods based on these hierarchical data structures and their simpler cousins, tile low-rank matrices, are well proportioned for early exascale computer architectures, which are provisioned for high processing power relative to memory capacity and memory bandwidth. They are ushering in a renaissance of computational linear algebra. A challenge is that emerging hardware architecture possesses hierarchies of its own that do not generally align with those of the algorithm. We describe modules of a software toolkit, hierarchical computations on manycore architectures, that illustrate these features and are intended as building blocks of applications, such as matrix-free higher-order methods in optimization and large-scale spatial statistics. Some modules of this open-source project have been adopted in the software libraries of major vendors. This article is part of a discussion meeting issue ‘Numerical algorithms for high-performance computational science’.
14
Yang, Kewei, Bingfeng Ge, Qingsong Zhao, and Jiang Jiang. "An Architectural Approach for Capability Mapping and Gap Analysis." Journal of Systems Science and Information 1, no. 1 (February 25, 2013): 86–96. http://dx.doi.org/10.1515/jssi-2013-0086.
Повний текст джерелаАнотація:
AbstractTo cope with the increasing complexity and constantly changing capability requirements of system-of-systems, an architectural approach for capability mapping and gap analysis is proposed. Firstly, a more specific architecture framework is presented. Secondly, on the basis of the analysis of the semantic relationships between constituent architecture data elements, a capability mapping approach is proposed to manage the relations between capabilities and systems based on the mapping matrixes representing associations of core entities. Then, a four-step capability mapping process for the mapping from capabilities to systems is suggested. Moreover, the capability gap analysis on how to identify and fill the capability gaps is also studied. Finally, an example of specific Net-Centric Warfare mission of Precision Engagement is used to illustrate the feasibility of the approach.
15
Xie, TianJiao, Bo Li, Mao Yang, and Zhongjiang Yan. "LDPC Decoder of High Speed Multi-Rate DVB-S2 Based on FPGA." Xibei Gongye Daxue Xuebao/Journal of Northwestern Polytechnical University 37, no. 2 (April 2019): 299–307. http://dx.doi.org/10.1051/jnwpu/20193720299.
Повний текст джерелаАнотація:
A multi-rate LDPC decoder architecture for DVB-S2 codes based on FPGA is proposed. Through elementary transformation on the parity check matrices of DVB-S2 LDPC codes, a new matrix whose left is a QC sub-matrix and right is Transformation of Staircase lower triangular (TST) sub-matrix is obtained. The QC and TST are designed separately, therefore the successful experience of the most popular Quasi-Cyclic (QC) LDPC decoder architecture can be drawn on. While for TST sub-matrix, the variable nodes updating only need to be considered and the check nodes updating is realized compatibility with QC sub-matrix. Based on the proposed architectures, a multi-rate LDPC decoder implemented on Xilinx XC7VX485T FPGA can achieve the maximum decoding throughput of 2.5 Gbit/s at the 20 iterations when the operating frequency is 250 MHz, which demonstrates the highest throughput compared with the state-of-the-art works.
16
Скиданенко, А. В., Л. А. Авакян, Е. А. Козинкина та Л. А. Бугаев. "Влияние внутреннего строения биметаллических наночастиц на оптические свойства материала AuAg/стекло". Физика твердого тела 61, № 1 (2019): 115. http://dx.doi.org/10.21883/ftt.2019.01.46902.125.
Повний текст джерелаАнотація:
AbstractOptical extinction spectra calculated via multisphere T -matrices for nanoparticles with different concentrations of metals and different architectures (core–shell, inverse core–shell, or alloy) are considered. A method is proposed for determination of architecture of nanoparticles (core–shell or alloy) from only data on the position of plasmon resonance and composition of components. The use of an optical spectrum fitting technique to the spectra of monodisperse noninteracting bimetallic nanoparticles with a predetermined structure appeared to be effective for the determination of the internal structure of nanoparticles, except large nanoparticles with a radius of more than 60 nm containing less than ∼25% silver atoms.
17
Aulia, Irfan Nur, Indra Kharisma Raharjana, and Purbandini Purbandini. "Perencanaan Arsitektur Perusahaan pada Bagian Instalasi Rawat Jalan dengan Kerangka Kerja TOGAF ADM Studi Kasus Rumah Sakit Jiwa Menur Surabaya." Journal of Information Systems Engineering and Business Intelligence 3, no. 1 (April 28, 2017): 52. http://dx.doi.org/10.20473/jisebi.3.1.52-60.
Повний текст джерелаАнотація:
Abstrak— Penelitian ini menghasilkan rencana arsitektur perusahaan yang dapat digunakan oleh Instalasi Rawat Jalan RSJ Menur Surabaya dengan kerangka kerja TOGAF ADM. Ada beberapa tahapan yang akan dilakukan yaitu pengumpulan data, penyusunan arsitektur visi, penyusunan arsitektur bisnis, penyusunan arsitektur data, penyusunan arsitektur aplikasi, penyusunan arsitektur teknologi, dan evaluasi arsitektur perusahaan. Dalam penyusunan arsitektur data, hal yang dilakukan adalah penyusunan arsitektur data berdasarkan dokumen laporan, membuat relasi antar entias data, membuat matriks fungsi bisnis dan entitas data, dan membuat analisis gap arsitektur data. Pada penyusunan arsitektur aplikasi, hal yang dilakukan adalah merencanakan kandidat aplikasi, membuat matriks fungsi bisnis, merancang kandidat aplikasi, serta membuat analisis gap arsitektur aplikasi. Sedangkan dalam tahap penyusunan arsitektur teknologi, hal yang dilakukan adalah merencanakan kandidat teknologi, membuat topologi jaringan dan membuat analisis gap arsitektur teknologi. evaluasi arsitektur perusahaan dilakukan dengan cara wawancara kepada stakeholder tentang hasil arsitektur. Hasil evaluasi menyatakan bahwa arsitektur perusahaan yang telah dibuat dapat diterima dan dipertimbangkan untuk diimplementasikan.Kata Kunci— Perencenaan Arsitektur Perusahaan, TOGAF ADM, Instalasi Rawat Jalan, BlueprintAbstract— This research resulted blueprint of the enterprise architecture which can be used by Outpatient Departement of RSJ Menur Surabaya with TOGAF ADM framework. . There were several stages that will be done that the first stage was data collection, the second stage was architecture vision, the third stage was business architecture, the fourth stage was information systems architectures, which includes the data architecture was the identification of data entities obtained based on documents and reports, created the relationship between data entities, created the matrix of business functions and the candidates of application and create the gap analysis of the application architecture. The fifth stage was technology architecture which planned the technology candidates, made the network topology and made the gap analysis of the technology architecture. Phase sixth was the evaluation of enterprise architecture, the stage which conducted interview was related to the architecture that has been planned, then explain the positive and negative impacts related to the architecture that has been planned. The results of this research was enterprise architecture planning. Based on the evaluation results, the enterprise architecture can be accepted and considered to all stakeholders to be implemented in the future. Beside that it was a need for Hospital Management Information System Installation that has roles and responsibilities related to the application and information technology. Keywords— Enterprise Architecture Planning, TOGAF ADM, Outpatient Department, Blueprint
18
Manataki, Merope, Nikos Papadopoulos, Nikolaos Schetakis, and Alessio Di Iorio. "Exploring Deep Learning Models on GPR Data: A Comparative Study of AlexNet and VGG on a Dataset from Archaeological Sites." Remote Sensing 15, no. 12 (June 20, 2023): 3193. http://dx.doi.org/10.3390/rs15123193.
Повний текст джерелаАнотація:
This comparative study evaluates the performance of three popular deep learning architectures, AlexNet, VGG-16, and VGG-19, on a custom-made dataset of GPR C-scans collected from several archaeological sites. The introduced dataset has 15,000 training images and 3750 test images assigned to three classes: Anomaly, Noise, and Structure. The aim is to assess the performance of the selected architectures applied to the custom dataset and examine the potential gains of using deeper and more complex architectures. Further, this study aims to improve the training dataset using augmentation techniques. For the comparisons, learning curves, confusion matrices, precision, recall, and f1-score metrics are employed. The Grad-CAM technique is also used to gain insights into the models’ learning. The results suggest that using more convolutional layers improves overall performance. Further, augmentation techniques can also be used to increase the dataset volume without causing overfitting. In more detail, the best-obtained model was trained using VGG-19 architecture and the modified dataset, where the training samples were raised to 60,000 images through augmentation techniques. This model reached a classification accuracy of 94.12% on an evaluation set with 170 unseen data.
19
Grigoryeva, Elena. "theories and practice." проект байкал, no. 78 (December 17, 2023): 1. http://dx.doi.org/10.51461/issn.2309-3072/78.2217.
Повний текст джерелаАнотація:
Does a theory of architecture exist? If so, what does it involve? Researching and analysing what has already been implemented? Refining methods and matrices based on practice? In other words, is the theory secondary?
The debate about this has been going on for many years and even centuries. But today, in the age of robots and computers, the question of architectural theory takes on a new meaning. As the development of technology accelerates all practical processes – from design approval to the construction of objects in material, when million cities appear on an empty place in five years, and single buildings – in a fortnight, the practice of architecture more closely resembles a cross-country race. One can assume that the practitioner behind the wheel is increasingly in need of a theorist, a navigator who follows the road on a map and charts the course of the journey. Or do the theories in this race follow the findings and insights of the practitioners?
In this issue of the journal, we have collected several contemporary views on architectural theory. These views are heterogeneous and often do not agree with each other. The map on which the route of architectural development is travelled is pieced together from scraps, sketches and fragments of accurate but outdated plans and outlines. But we have no other map, and we will have to improve the theory and its connection with the practice right on the move.
It is noteworthy that the news section also touches upon the theme of the issue: it opens with the jubilee exhibitions of Maria Nashchokina, a well-known theoretician and historian of architecture, and Andrey Bokov, a prominent practitioner and theorist.
20
Gan, Hongping, Song Xiao, and Feng Liu. "Chaotic Binary Sensing Matrices." International Journal of Bifurcation and Chaos 29, no. 09 (August 2019): 1950121. http://dx.doi.org/10.1142/s0218127419501219.
Повний текст джерелаАнотація:
As an emerging field for sampling paradigms, compressive sensing (CS) can sample and represent signals at a sub-Shannon–Nyquist rate. To realize CS from theory to practice, the random sensing matrices must be substituted by faster measurement operators that correspond to feasible hardware architectures. In recent years, binary matrices have attracted much research interest because of their multiplier-less and faster data acquisition. In this work, we aim to pinpoint the potential of chaotic binary sequences for constructing high-efficiency sensing implementations. In particular, the proposed chaotic binary sensing matrices are verified to meet near-optimal theoretical guarantees in terms of both the restricted isometry condition and coherence analysis. Simulation results illustrate that the proposed chaotic constructions have considerable sampling efficiency comparable to that of the random counterparts. Our framework encompasses many families of binary sensing architectures, including those formed from Logistic, Chebyshev, and Bernoulli binary chaotic sequences. With many chaotic binary sensing architectures, we can then more easily apply CS paradigm to various fields.
21
Andreoli, Louis, Xavier Porte, Stéphane Chrétien, Maxime Jacquot, Laurent Larger, and Daniel Brunner. "Boolean learning under noise-perturbations in hardware neural networks." Nanophotonics 9, no. 13 (June 24, 2020): 4139–47. http://dx.doi.org/10.1515/nanoph-2020-0171.
Повний текст джерелаАнотація:
AbstractA high efficiency hardware integration of neural networks benefits from realizing nonlinearity, network connectivity and learning fully in a physical substrate. Multiple systems have recently implemented some or all of these operations, yet the focus was placed on addressing technological challenges. Fundamental questions regarding learning in hardware neural networks remain largely unexplored. Noise in particular is unavoidable in such architectures, and here we experimentally and theoretically investigate its interaction with a learning algorithm using an opto-electronic recurrent neural network. We find that noise strongly modifies the system’s path during convergence, and surprisingly fully decorrelates the final readout weight matrices. This highlights the importance of understanding architecture, noise and learning algorithm as interacting players, and therefore identifies the need for mathematical tools for noisy, analogue system optimization.
22
Morris, V. J., A. Gromer, and A. R. Kirby. "Architecture of intracellular networks in plant matrices." Structural Chemistry 20, no. 2 (January 23, 2009): 255–61. http://dx.doi.org/10.1007/s11224-009-9410-7.
Повний текст джерела
23
Fabregas, Aldo D., Paul Crawford, Rodrigo Mesa, and Agustina Calatayud. "Parametric Evaluation of Internet of Things Applications to Freight Transportation Using Model-Based Systems Engineering." Transportation Research Record: Journal of the Transportation Research Board 2676, no. 3 (October 19, 2021): 38–48. http://dx.doi.org/10.1177/03611981211049134.
Повний текст джерелаАнотація:
The intended purpose of an intelligent transportation systems (ITS) project is to automate operations through device-to-device connectivity. These devices generally represent stakeholder’s endpoints and expose interfaces to automated operations. Current trends in communication allow more applications and devices to perform functions traditionally allocated to the transportation ITS infrastructure. This connected environment of industrial internet of things presents design challenges because of the diversity of stakeholders, interfaces, and the messages among them. This may require new ways in which ITS planning can handle the scale and complexity of these highly connected systems. This work focuses on the modeling of the architecture of a freight-focused ITS application, including maritime ports. The proposed model integrates stakeholders, behaviors, and messages using the Systems Modeling Language (SysML). The key contribution of this work is to demonstrate the creation of an executable SysML model for an ITS application without sacrificing the typical Systems Engineering Management Plan artifacts (e.g., requirements traceability matrices and interface control documents). At the same time, the proposed model provides a re-usable pattern to support parametric analysis of candidate architectures with respect to any measure of effectiveness. This allows establishing a single source of architecture definition and having multiple architecture specializations depending on the measure of effectiveness being evaluated. Recommendations for implementation and integration with existing ITS tools are provided.
24
Wang, Dan, Yu-xuan Feng, Ming Li, Shengdi Guo, and Yuan Jiang. "Seeded Mineralization in Silk Fibroin Hydrogel Matrices Leads to Continuous Rhombohedral CaCO3 Films." Crystals 10, no. 3 (March 3, 2020): 166. http://dx.doi.org/10.3390/cryst10030166.
Повний текст джерелаАнотація:
As many biominerals are formed in gel-like media, hydrogel-mediated mineralization is deemed as paradigms of biomineralization and ideal approaches to synthetic minerals with hierarchical architectures and related functions. Nevertheless, the long diffusion distance in hydrogels makes mineralization a diffusion-limited process, leading to isolated crystals instead of uniform hierarchical architectures. In the current study, seeded mineralization in silk fibroin hydrogel matrices is successful in delivering continuous rhombohedral CaCO3 films. Though the coverage of hydrogel matrices makes mineralization a diffusion-limited process, the presence of seed layers promotes the growth of uniform overlayers in proper conditions. The regulation of the solid content of hydrogels provides a rational route to rhombohedral architectures with tunable morphologies and thickness. In the course of mineralization, the hydrogel matrices are partially occluded in rhombohedral films as inter- and intra-crystalline constituents, as confirmed by scanning and transmission electron microscopy. Our study confirms the availability of synthesizing continuous mineralized films with hierarchical architectures and the structural gradient in hydrogel matrices via self-organized mineralization. These films with the occlusion of hydrogel constituents may exhibit significant strength and resilience, and their formation can deepen our mechanistic understanding of biomineralization proceeding in gel-like media.
25
Jones, Mark T., and Merrell L. Patrick. "Factoring Symmetric Indefinite Matrices on High-Performance Architectures." SIAM Journal on Matrix Analysis and Applications 15, no. 1 (January 1994): 273–83. http://dx.doi.org/10.1137/s089547989018008x.
Повний текст джерела
26
Wu, Ping, Zhiwei Fang, Anping Zhang, Xiao Zhang, Yawen Tang, Yiming Zhou, and Guihua Yu. "Chemically Binding Scaffolded Anodes with 3D Graphene Architectures Realizing Fast and Stable Lithium Storage." Research 2019 (August 19, 2019): 1–9. http://dx.doi.org/10.34133/2019/8393085.
Повний текст джерелаАнотація:
Three-dimensional (3D) graphene has emerged as an ideal platform to hybridize with electrochemically active materials for improved performances. However, for lithium storage, current anodic guests often exist in the form of nanoparticles, physically attached to graphene hosts, and therefore tend to detach from graphene matrices and aggregate into large congeries, causing considerable capacity fading upon repeated cycling. Herein, we develop a facile double-network hydrogel-enabled methodology for chemically binding anodic scaffolds with 3D graphene architectures. Taking tin-based alloy anodes as an example, the double-network hydrogel, containing interpenetrated cyano-bridged coordination polymer hydrogel and graphene oxide hydrogel, is directly converted to a physical-intertwined and chemical-bonded Sn−Ni alloy scaffold and graphene architecture (Sn−Ni/G) dual framework. The unique dual framework structure, with remarkable structural stability and charge-transport capability, enables the Sn−Ni/G anode to exhibit long-term cyclic life (701 mA h g−1 after 200 cycles at 0.1 A g−1) and high rate performance (497 and 390 mA h g−1 at 1 and 2 A g−1, respectively). This work provides a new perspective towards chemically binding scaffolded low-cost electrode and electrocatalyst materials with 3D graphene architectures for boosting energy storage and conversion.
27
Siewertsen, E., J. Piwonski, and T. Slawig. "Porting marine ecosystem model spin-up using transport matrices to GPUs." Geoscientific Model Development 6, no. 1 (January 8, 2013): 17–28. http://dx.doi.org/10.5194/gmd-6-17-2013.
Повний текст джерелаАнотація:
Abstract. We have ported an implementation of the spin-up for marine ecosystem models based on transport matrices to graphics processing units (GPUs). The original implementation was designed for distributed-memory architectures and uses the Portable, Extensible Toolkit for Scientific Computation (PETSc) library that is based on the Message Passing Interface (MPI) standard. The spin-up computes a steady seasonal cycle of ecosystem tracers with climatological ocean circulation data as forcing. Since the transport is linear with respect to the tracers, the resulting operator is represented by matrices. Each iteration of the spin-up involves two matrix-vector multiplications and the evaluation of the used biogeochemical model. The original code was written in C and Fortran. On the GPU, we use the Compute Unified Device Architecture (CUDA) standard, a customized version of PETSc and a commercial CUDA Fortran compiler. We describe the extensions to PETSc and the modifications of the original C and Fortran codes that had to be done. Here we make use of freely available libraries for the GPU. We analyze the computational effort of the main parts of the spin-up for two exemplar ecosystem models and compare the overall computational time to those necessary on different CPUs. The results show that a consumer GPU can compete with a significant number of cluster CPUs without further code optimization.
28
Gopsill, James A., Chris Snider, Chris McMahon, and Ben Hicks. "Automatic generation of design structure matrices through the evolution of product models." Artificial Intelligence for Engineering Design, Analysis and Manufacturing 30, no. 4 (October 4, 2016): 424–45. http://dx.doi.org/10.1017/s0890060416000391.
Повний текст джерелаАнотація:
AbstractDealing with component interactions and dependencies remains a core and fundamental aspect of engineering, where conflicts and constraints are solved on an almost daily basis. Failure to consider these interactions and dependencies can lead to costly overruns, failure to meet requirements, and lengthy redesigns. Thus, the management and monitoring of these dependencies remains a crucial activity in engineering projects and is becoming ever more challenging with the increase in the number of components, component interactions, and component dependencies, in both a structural and a functional sense. For these reasons, tools and methods to support the identification and monitoring of component interactions and dependencies continues to be an active area of research. In particular, design structure matrices (DSMs) have been extensively applied to identify and visualize product and organizational architectures across a number of engineering disciplines. However, the process of generating these DSMs has primarily used surveys, structured interviews, and/or meetings with engineers. As a consequence, there is a high cost associated with engineers' time alongside the requirement to continually update the DSM structure as a product develops. It follows that the proposition of this paper is to investigate whether an automated and continuously evolving DSM can be generated by monitoring the changes in the digital models that represent the product. This includes models that are generated from computer-aided design, finite element analysis, and computational fluid dynamics systems. The paper shows that a DSM generated from the changes in the product models corroborates with the product architecture as defined by the engineers and results from previous DSM studies. In addition, further levels of product architecture dependency were also identified. A particular affordance of automatically generating DSMs is the ability to continually generate DSMs throughout the project. This paper demonstrates the opportunity for project managers to monitor emerging product dependencies alongside changes in modes of working between the engineers. The application of this technique could be used to support existing product life cycle change management solutions, cross-company product development, and small to medium enterprises who do not have a product life cycle management solution.
29
Siebrecht, J., G. Jacobs, C. Konrad, C. Wyrwich, and W. Schäfer. "CUSTOMER SPECIFIC COMPATIBILITY MATRICES FOR FUNCTIONAL INTEGRAL PRODUCT ARCHITECTURES." Proceedings of the Design Society: DESIGN Conference 1 (May 2020): 1105–14. http://dx.doi.org/10.1017/dsd.2020.303.
Повний текст джерелаАнотація:
AbstractSupplier of system components face the challenge of customer requirements influencing the property level functional integral product architectures. For this, solution approaches focusing on the re-use of pre-engineered part variants are not applicable. However, to generate a valid product structure, customer-specific properties have to fit modelled product knowledge. Therefore, the approach models a reference class structure and analysis compatibilities on the property level for customer specific inputs concerning explicit product knowledge and constraints.
30
Liu, Y., C. S. Bouganis, and P. Y. K. Cheung. "Hardware architectures for eigenvalue computation of real symmetric matrices." IET Computers & Digital Techniques 3, no. 1 (2009): 72. http://dx.doi.org/10.1049/iet-cdt:20080008.
Повний текст джерела
31
Zhang, Ruiyun, and Peter X. Ma. "Synthetic nano-fibrillar extracellular matrices with predesigned macroporous architectures." Journal of Biomedical Materials Research 52, no. 2 (2000): 430–38. http://dx.doi.org/10.1002/1097-4636(200011)52:2<430::aid-jbm25>3.0.co;2-l.
Повний текст джерела
32
Dano, Eric B. "Using Design Structure Matrices (DSMs) to Derive System Architectures." INCOSE International Symposium 32, no. 1 (July 2022): 210–23. http://dx.doi.org/10.1002/iis2.12926.
Повний текст джерела
33
CHEN, R. M., FALCON F. M. LIU, and JEFFREY J. P. TSAI. "A SOFTWARE ARCHITECTURE FOR FINDING MOTIFS USING GENETIC ALGORITHM." International Journal of Software Engineering and Knowledge Engineering 15, no. 03 (June 2005): 571–85. http://dx.doi.org/10.1142/s0218194005002440.
Повний текст джерелаАнотація:
In the era of post-genomics, almost all the genes have been sequenced and enormous amount of data have been generated. Hence, to mine useful information from these data is a very important topic. In this paper, we present a software architecture for finding motifs using genetic algorithm (GA). The new approach can find potential motifs in the regions located from the -2000 bp upstream to +1000 bp downstream of transcription start site (TSS). The mutation in the genetic algorithm is performed using position weight matrices to reserve the completely conserved positions. The crossover in the GA is implemented with specially-designed gap penalties to produce an optimal child pattern. We also present a rearrangement method based on position weight matrices to avoid the presence of a very stable local minimum that may be difficult for operators to generate the optimal pattern. The predicted results obtained from our approach are more accurate than that of Gibbs sampler and we spend less computation time than MEME.
34
Vázquez-Castillo, Javier, Alejandro Castillo-Atoche, Roberto Carrasco-Alvarez, Omar Longoria-Gandara, and Jaime Ortegón-Aguilar. "FPGA-Based Hardware Matrix Inversion Architecture Using Hybrid Piecewise Polynomial Approximation Systolic Cells." Electronics 9, no. 1 (January 18, 2020): 182. http://dx.doi.org/10.3390/electronics9010182.
Повний текст джерелаАнотація:
The hardware of the matrix inversion architecture using QR decomposition with Givens Rotations (GR) and a back substitution (BS) block is required for many signal processing algorithms. However, the hardware of the GR algorithm requires the implementation of complex operations, such as the reciprocal square root (RSR), which is typically implemented using LookUp Table (LUT) and COordinate Rotation DIgital Computer (CORDICs), among others, conveying to either high-area consumption or low throughput. This paper introduces an Field-Programmable Gate Array (FPGA)-based full matrix inversion architecture using hybrid piecewise polynomial approximation systolic cells. In the design, a hybrid segmentation technique was incorporated for the implementation of piecewise polynomial systolic cells. This hybrid approach is composed by an external and internal segmentation, where the first is nonuniform and the second is uniform, fitting the curve shape of the complex functions achieving a better signal-quantization-to noise-ratio; furthermore, it improves the time performance and area resources. Experimental results reveal a well-balanced improvement in the design achieving high throughput and, hence, less resource utilization in comparison to state-of-the-art FPGA-based architectures. In our study, the proposed design achieves 7.51 Mega-Matrices per second for performing 4 × 4 matrix operations with a latency of 12 clock cycles; meanwhile, the hardware design requires only 1474 slice registers, 1458 LUTs in an FPGA Virtex-5 XC5VLX220T, and 1474 slice registers and 1378 LUTs when a FPGA Virtex-6 XC6VLX240T is used.
35
Zaytseva, Ksenia Alexeyevna, Valeria Valentinovna Puzikova, and Andrey Dmitrievich Sokolov. "On Problems in OpenBLAS Library Usage in Productized Code on RISC-V." Proceedings of the Institute for System Programming of the RAS 35, no. 5 (2023): 91–106. http://dx.doi.org/10.15514/ispras-2022-35(5)-7.
Повний текст джерелаАнотація:
The boundary element method usage for the numerical simulation in continuum mechanics problems leads to the need to solve a system of linear algebraic equations with a dense matrix. The de facto standards for the interface of functions over dense matrices and vectors software implementations are BLAS/LAPACK. Among the optimized open-source BLAS/LAPACK implementations, only the OpenBLAS library includes optimizations for the widest range of hardware platforms. This library is optimized for Intel, AMD, ARM and RISC-V architectures. The open RISC-V architecture ecosystem is currently actively developing. European supercomputing centers have opened RISC-V competence centers as part of the government's EuroHPC grant support, since solutions based on the ARM architecture are not recognized as part of the European initiative to develop its own technological independence. Currently, companies included in the international RISC-V consortium are developing not only high-performance RISC-V processors, but also AI accelerators, as well as video cards based on RISC-V architecture. OpenBLAS is actively supported and optimized for emerging RISC-V hardware and extensions. However, libraries used in product code are traditionally subject to strict requirements for stability and reliability in order to minimize possible errors and failures in the product. As it turned out, from this point of view, OpenBLAS has a number of problems that we had to solve in order to productize this library. In this article the OpenBLAS test system is described, the problems of testing the LAPACK functionality of the library and ways to solve them are discussed. In addition, the test coverage of the BLAS functionality is analyzed and the results achieved in increasing it are presented. It is planned to contribute the described changes to the OpenBLAS project.
36
Zheng, Yong, Haigang Yang, Yiping Jia, and Zhihong Huang. "PermLSTM: A High Energy-Efficiency LSTM Accelerator Architecture." Electronics 10, no. 8 (April 8, 2021): 882. http://dx.doi.org/10.3390/electronics10080882.
Повний текст джерелаАнотація:
Pruning and quantization are two commonly used approaches to accelerate the LSTM (Long Short-Term Memory) model. However, the traditional linear quantization usually suffers from the problem of gradient vanishing, and the existing pruning methods all have the problem of producing undesired irregular sparsity or large indexing overhead. To alleviate the problem of vanishing gradient, this work proposed a normalized linear quantization approach, which first normalize operands regionally and then quantize them in a local mix-max range. To overcome the problem of irregular sparsity and large indexing overhead, this work adopts the permuted block diagonal mask matrices to generate the sparse model. Due to the sparse model being highly regular, the position of non-zero weights can be obtained by a simple calculation, thus avoiding the large indexing overhead. Based on the sparse LSTM model generated from the permuted block diagonal mask matrices, this paper also proposed a high energy-efficiency accelerator, PermLSTM that comprehensively exploits the sparsity of weights, activations, and products regarding the matrix–vector multiplications, resulting in a 55.1% reduction in power consumption. The accelerator has been realized on Arria-10 FPGAs running at 150 MHz and achieved 2.19×∼24.4× energy efficiency compared with the other FPGA-based LSTM accelerators previously reported.
37
Indriani, Renantia, Murahartawaty Murahartawaty, and Ridha Hanafi. "ANALISIS DAN PERANCANGAN TECHNOLOGY ARCHITECTURE MENGGUNAKAN THE OPEN GROUP ARCHITECTURE FRAMEWORK ARCHITECTURE DEVELOPMENT METHOD (TOGAF ADM) PADA PT SHAFCO MULTI TRADING." Jurnal Rekayasa Sistem & Industri (JRSI) 3, no. 01 (April 19, 2016): 1. http://dx.doi.org/10.25124/jrsi.v3i01.34.
Повний текст джерелаАнотація:
Perkembangan bisnis disertai dengan implementasi teknologi informasi merupakan hal yang penting bagi bisnis perusahaan. PT Shafco Multi Trading merupakan salah satu brand market leader fashion hijab di Indonesia yang menerapkan teknologi informasi untuk menjalankan bisnisnya. Berdasarkan kebutuhan bisnis yang semakin berkembang di masa mendatang dan perusahaan yang belum memiliki enterprise architecture untuk mengelola teknologi informasi dalam menjalankan bisnis, PT Shafco Multi Trading memerlukan perancangan technology architecture untuk meningkatkan keselarasan antara penggunaan teknologi dan bisnis perusahaan. Analisis dan perancangan technology architecture pada PT Shafco Multi Trading menggunakan framework TOGAF ADM. TOGAF ADM digunakan sebagai framework dalam penelitian ini karena telah sesuai dengan pengembangan arsitektur pada level enterprise. Dalam melakukan perancangan technology architecture, digunakan MEGA Suite untuk menghasilkan deliverable berupa katalog, matriks, dan diagram. Penelitian ini menghasilkan dokumen blueprint technology architecture. Blueprint tersebut dapat digunakan sebagai acuan atau dasar dalam pengembangan teknologi di PT Shafco Multi Trading sesuai dengan kebutuhan bisnis.
38
Giannoula, Christina, Ivan Fernandez, Juan Gómez Luna, Nectarios Koziris, Georgios Goumas, and Onur Mutlu. "SparseP." Proceedings of the ACM on Measurement and Analysis of Computing Systems 6, no. 1 (February 24, 2022): 1–49. http://dx.doi.org/10.1145/3508041.
Повний текст джерелаАнотація:
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 three key contributions. First, we implement a wide variety of software strategies on SpMV for a multithreaded PIM core, including (1) various compressed matrix formats, (2) load balancing schemes across parallel threads and (3) synchronization approaches, and characterize the computational limits of a single multithreaded PIM core. Second, we design various load balancing schemes across multiple PIM cores, and two types of data partitioning techniques to execute SpMV on thousands of PIM cores: (1) 1D-partitioned kernels to perform the complete SpMV computation only using PIM cores, and (2) 2D-partitioned kernels to strive a balance between computation and data transfer costs to PIM-enabled memory. Third, we compare SpMV execution on a real-world PIM system with 2528 PIM cores to an Intel Xeon CPU and an NVIDIA Tesla V100 GPU to study the performance and energy efficiency of various devices, i.e., both memory-centric PIM systems and conventional processor-centric CPU/GPU systems, for the SpMV kernel. SparseP software package provides 25 SpMV kernels for real PIM systems supporting the four most widely used compressed matrix formats, i.e., CSR, COO, BCSR and BCOO, and a wide range of data types. SparseP is publicly and freely available at https://github.com/CMU-SAFARI/SparseP. Our extensive evaluation using 26 matrices with various sparsity patterns provides new insights and recommendations for software designers and hardware architects to efficiently accelerate the SpMV kernel on real PIM systems.
39
Iakovidis, D. K., D. E. Maroulis, and D. G. Bariamis. "FPGA architecture for fast parallel computation of co-occurrence matrices." Microprocessors and Microsystems 31, no. 2 (March 2007): 160–65. http://dx.doi.org/10.1016/j.micpro.2006.02.013.
Повний текст джерела
40
Makino, Hirofumi, Shigeaki Nishimura, Toshinori Haramoto, Yasushi Yamasaki, Shuji Ikeda, and Zensuke Ota. "Three-dimensional architecture of glomerular extracellular matrices in diabetic glomerulosclerosis." Journal of Diabetic Complications 5, no. 2-3 (April 1991): 124–25. http://dx.doi.org/10.1016/0891-6632(91)90041-m.
Повний текст джерела
41
Dyer, Michael G. "Will the neural blackboard architecture scale up to semantics?" Behavioral and Brain Sciences 29, no. 1 (February 2006): 77–78. http://dx.doi.org/10.1017/s0140525x06299023.
Повний текст джерелаАнотація:
The neural blackboard architecture is a localist structured connectionist model that employs a novel connection matrix to implement dynamic bindings without requiring propagation of temporal synchrony. Here I note the apparent need for many distinct matrices and the effect this might have for scale-up to semantic processing. I also comment on the authors' initial foray into the symbol grounding problem.
42
Liang, Yunyi, Zhiyong Cui, Yu Tian, Huimiao Chen, and Yinhai Wang. "A Deep Generative Adversarial Architecture for Network-Wide Spatial-Temporal Traffic-State Estimation." Transportation Research Record: Journal of the Transportation Research Board 2672, no. 45 (October 8, 2018): 87–105. http://dx.doi.org/10.1177/0361198118798737.
Повний текст джерелаАнотація:
This study proposes a deep generative adversarial architecture (GAA) for network-wide spatial-temporal traffic-state estimation. The GAA is able to combine traffic-flow theory with neural networks and thus improve the accuracy of traffic-state estimation. It consists of two Long Short-Term Memory Neural Networks (LSTM NNs) which capture correlation in time and space among traffic flow and traffic density. One of the LSTM NNs, called a discriminative network, aims to maximize the probability of assigning correct labels to both true traffic-state matrices (i.e., traffic flow and traffic density within a given spatial-temporal area) and the traffic-state matrices generated from the other neural network. The other LSTM NN, called a generative network, aims to generate traffic-state matrices which maximize the probability that the discriminative network assigns true labels to them. The two LSTM NNs are trained simultaneously such that the trained generative network can generate traffic matrices similar to those in the training data set. Given a traffic-state matrix with missing values, we use back-propagation on three defined loss functions to map the corrupted matrix to a latent space. The mapping vector is then passed through the pre-trained generative network to estimate the missing values of the corrupted matrix. The proposed GAA is compared with the existing Bayesian network approach on loop detector data collected from Seattle, Washington and that collected from San Diego, California. Experimental results indicate that the GAA can achieve higher accuracy in traffic-state estimation than the Bayesian network approach.
43
Ahmed, Ashfaq, Muhammad Usman Shahid, and Ata ur Rehman. "Point DCT VLSI Architecture for Emerging HEVC Standard." VLSI Design 2012 (August 8, 2012): 1–13. http://dx.doi.org/10.1155/2012/752024.
Повний текст джерелаАнотація:
This work presents a flexible VLSI architecture to compute the -point DCT. Since HEVC supports different block sizes for the computation of the DCT, that is, up to , the design of a flexible architecture to support them helps reducing the area overhead of hardware implementations. The hardware proposed in this work is partially folded to save area and to get speed for large video sequences sizes. The proposed architecture relies on the decomposition of the DCT matrices into sparse submatrices in order to reduce the multiplications. Finally, multiplications are completely eliminated using the lifting scheme. The proposed architecture sustains real-time processing of 1080P HD video codec running at 150 MHz.
44
Rahma, Ahmad Abu, Aliaa Burqan, and Özen Özer. "New Results for Arithmetic –Geometric Mean Inequalities and Singular Values in Matrices." WSEAS TRANSACTIONS ON MATHEMATICS 20 (November 30, 2021): 625–29. http://dx.doi.org/10.37394/23206.2021.20.66.
Повний текст джерелаАнотація:
Matrix theory is very popular in different kind of sciences such as engineering, architecture, physics, chemistry, computer science, IT, so on as well as mathematics many theoretical results dealing with the structure of the matrices even this topic seems easy to work. That is why many scientists still consider some open problem in matrix theory. In this paper, generalizations of the arithmetic-geometric mean inequality is presented for singular values related to block matrices. Singular values are also given for sums, products and direct sums of the matrices.
45
Abbaszadeh, Asgar, Taras Iakymchuk, Manuel Bataller-Mompeán, Jose Francés-Villora, and Alfredo Rosado-Muñoz. "AnScalable Matrix Computing Unit Architecture for FPGA,and SCUMO User Design Interface." Electronics 8, no. 1 (January 15, 2019): 94. http://dx.doi.org/10.3390/electronics8010094.
Повний текст джерелаАнотація:
High dimensional matrix algebra is essential in numerous signal processing and machine learning algorithms. This work describes a scalable square matrix-computing unit designed on the basis of circulant matrices. It optimizes data flow for the computation of any sequence of matrix operations removing the need for data movement for intermediate results, together with the individual matrix operations’ performance in direct or transposed form (the transpose matrix operation only requires a data addressing modification). The allowed matrix operations are: matrix-by-matrix addition, subtraction, dot product and multiplication, matrix-by-vector multiplication, and matrix by scalar multiplication. The proposed architecture is fully scalable with the maximum matrix dimension limited by the available resources. In addition, a design environment is also developed, permitting assistance, through a friendly interface, from the customization of the hardware computing unit to the generation of the final synthesizable IP core. For N × N matrices, the architecture requires N ALU-RAM blocks and performs O ( N 2 ) , requiring N 2 + 7 and N + 7 clock cycles for matrix-matrix and matrix-vector operations, respectively. For the tested Virtex7 FPGA device, the computation for 500 × 500 matrices allows a maximum clock frequency of 346 MHz, achieving an overall performance of 173 GOPS. This architecture shows higher performance than other state-of-the-art matrix computing units.
46
Kollar, Leslie M., Scott Kiel, Ashley J. James, Cody T. Carnley, Danielle N. Scola, Taylor N. Clark, Tikahari Khanal, et al. "The genetic architecture of sexual dimorphism in the mossCeratodon purpureus." Proceedings of the Royal Society B: Biological Sciences 288, no. 1946 (March 10, 2021): 20202908. http://dx.doi.org/10.1098/rspb.2020.2908.
Повний текст джерелаАнотація:
A central problem in evolutionary biology is to identify the forces that maintain genetic variation for fitness in natural populations. Sexual antagonism, in which selection favours different variants in males and females, can slow the transit of a polymorphism through a population or can actively maintain fitness variation. The amount of sexually antagonistic variation to be expected depends in part on the genetic architecture of sexual dimorphism, about which we know relatively little. Here, we used a multivariate quantitative genetic approach to examine the genetic architecture of sexual dimorphism in a scent-based fertilization syndrome of the mossCeratodon purpureus.We found sexual dimorphism in numerous traits, consistent with a history of sexually antagonistic selection. The cross-sex genetic correlations (rmf) were generally heterogeneous with many values indistinguishable from zero, which typically suggests that genetic constraints do not limit the response to sexually antagonistic selection. However, we detected no differentiation between the female- and male-specific trait (co)variance matrices (GfandGm, respectively), meaning the evolution of sexual dimorphism may be constrained. The cross-sex cross-trait covariance matrixBcontained both symmetric and asymmetric elements, indicating that the response to sexually antagonistic or sexually concordant selection, and the constraint to sexual dimorphism, are highly dependent on the traits experiencing selection. The patterns of genetic variances and covariances among these fitness components is consistent with partly sex-specific genetic architectures having evolved in order to partially resolve multivariate genetic constraints (i.e. sexual conflict), enabling the sexes to evolve towards their sex-specific multivariate trait optima.
47
Toso, Giovanni, and Piero Angeletti. "An Optimal Procedure for the Design of Discrete Constrained Lens Antennas with Minimized Optical Aberrations. Part II: Three-Dimensional Multifocal Architectures." Electronics 11, no. 3 (February 8, 2022): 503. http://dx.doi.org/10.3390/electronics11030503.
Повний текст джерелаАнотація:
Novel three-dimensional discrete lens antennas characterized by a number of focal points ranging from one to five and defined explicitly via analytical equations are presented in the paper. A procedure to derive rotationally symmetric afocal lenses starting from multifocal lenses that are not rotationally symmetric is proposed as well. In addition, an innovative method to identify the focal surface minimizing the optical aberrations is derived. The lenses are compared in terms of optical aberrations and accommodation constraints. The most suitable lens architectures depend mainly on the required angular field of view and magnification factor. It is shown that a reduction by a factor close to 3 in the optical aberrations can be obtained when selecting the most appropriate lens architecture and keeping comparable accommodation constraints. The results, derived exploiting a geometrical optics (GO) formulation, provide useful indications for the preliminary design of constrained lens antennas before adopting full wave rigorous techniques. Three-dimensional discrete lens antennas can offer significant advantages as compared to conventional analog beamforming networks (as those based on Butler matrixes) in terms of frequency bandwidth, number of beams and number of radiating elements.
48
Deshmukh, Sameer, Rio Yokota, and George Bosilca. "Cache Optimization and Performance Modeling of Batched, Small, and Rectangular Matrix Multiplication on Intel, AMD, and Fujitsu Processors." ACM Transactions on Mathematical Software 49, no. 3 (September 19, 2023): 1–29. http://dx.doi.org/10.1145/3595178.
Повний текст джерелаАнотація:
Factorization and multiplication of dense matrices and tensors are critical, yet extremely expensive pieces of the scientific toolbox. Careful use of low rank approximation can drastically reduce the computation and memory requirements of these operations. In addition to a lower arithmetic complexity, such methods can, by their structure, be designed to efficiently exploit modern hardware architectures. The majority of existing work relies on batched BLAS libraries to handle the computation of many small dense matrices. We show that through careful analysis of the cache utilization, register accumulation using SIMD registers and a redesign of the implementation, one can achieve significantly higher throughput for these types of batched low-rank matrices across a large range of block and batch sizes. We test our algorithm on three CPUs using diverse ISAs – the Fujitsu A64FX using ARM SVE, the Intel Xeon 6148 using AVX-512, and AMD EPYC 7502 using AVX-2, and show that our new batching methodology is able to obtain more than twice the throughput of vendor optimized libraries for all CPU architectures and problem sizes.
49
Silva Leite, João, Sérgio Fernandes, and Carlos Dias Coelho. "The Sacred Building and the City: Decoding the Formal Interface between Public Space and Community." Religions 15, no. 2 (February 18, 2024): 246. http://dx.doi.org/10.3390/rel15020246.
Повний текст джерелаАнотація:
The reflection on sacred places continues to assume significant relevance today in urban space production. The public value of sacred buildings has consolidated over time an aggregating sense of community, representing spaces for meeting and sharing. Their historical relevance as spaces for meditation represents for mankind places of personal reflection, while they have always played an important role in the city and in its symbolic and spatial structure. Thus, starting from the hypothesis that the sacred space is affirmed as an interface, because it welcomes the individual and serves the community, we examine the architectural features that enhance this ambivalence, exposing transition systems between private and collective spaces, seeking to systematize essential composition matrices for new urban spaces for public use. Assuming Lisbon as a framework, this article proposes a comparative reading between two paradigmatic buildings—Sagrado Coração de Jesus Church and the New Mosque of Lisbon—with similar goals according to the relationship between architecture, place sacrality, and the urban public space. Methodologically, drawing is used as an interpretative tool and, through formal decomposition, this article tries to demonstrate that these buildings are the result of a reflection deeply determined by the value of the place’s identity in the city’s public space system. According to these case studies, sacred buildings are conceived based on formal and spatial links that are rooted in Lisbon’s urban layout. It is sacred buildings that are at the origin of urban places for public use. Each one of these buildings share an idea of architecture with an urban and public role which integrates the objects with the shape of the city and contradicts the tendency for the dissociation between urban elements. In a way, they can be considered paradigmatic examples of architecture with an urban vocation.
50
Tan, Wei, and Tejal A. Desai. "Microfluidic Patterning of Cellular Biopolymer Matrices." JALA: Journal of the Association for Laboratory Automation 8, no. 3 (June 2003): 40–43. http://dx.doi.org/10.1016/s1535-5535-04-00269-2.
Повний текст джерелаАнотація:
Due to the complex structures of living systems, the use of microtechnology to recreate in vivo architecture has exciting potential applications. Living tissues maintain a well-organized three-dimensional (3-D) architecture, with “micro” and “nano” scale features. Microtechnologies offer the new possibility of designing and building sensors and devices in dimensional scales close to that of living tissues.1–2 However, most available microscale systems are two-dimensional, and few 3-D systems are being explored. Therefore, we have developed a versatile technique to create a 3-D microscale hierarchical system for cells and biopolymers. By taking advantage of the contraction of hydrogel matrix biopolymers, one can achieve multiple layers of cells within biopolymers using microchannels, and eventually form a hierarchical layered microstructure of cells and biopolymer. Pressure-driven microfluidics using a syringe pump (Harvard Apparatus, Model 11‘) was applied to transport cells within matrix biopolymers through the channels with controlled flow rates. Flow imaging was used to estimate the shear stress and examine the useful range of flow rates for biopolymer fluids to form the layered structure. The 3-aminopropyltriethoxysilane (APTES) — glutaraldehyde activated glass chips were found to effectively immobilize cell-matrix assemblies. Collagen or collagen-chitosan matrix biopolymers were used as constructs throughout the layers. The final structure was characterized using scanning electron microscopy (SEM). Using this approach, the “neotissue” is formed with cellular and biopolymer components engineered to model the in vivo system.