Minimum Code Research Articles

Application of difference color models to RGB image fragments before progressive hierarchical lossless compression

The method and corresponding algorithm for hierarchical bypass of minimum code units (MCU - blocks of 8 x 8 pixels) in the process of preprocessing of lossless image compression is proposed. The algorithm for selecting for each MCU an effective difference color model with integer coefficients from the list of basic alternative models, which predictable minimizes the image compression ratio based on entropy analysis is given. An algorithm for compact hierarchical storage of numbers of selected difference color models for each MCU, which takes into account the high probability of repetition of these numbers for adjacent MCUs is described and implemented. It is shown that both color models for individual MCUs and a single color model for the entire image can be effective for difference images. To evaluate the effectiveness of preprocessing algorithms during hierarchical compression, the feasibility of using the weighted average entropy by passes instead of the total entropy, which is calculated only by pixels processed by a context-independent algorithm is proposed. It is noted that the entropy by 4 passes is always less than the total entropy, because it takes into account the different unevenness of the probability distribution of elements on different passes, that is why it is advisable to store the data of different passes in different compressed blocks. On the well-known Archive Comparison Test suite, it has been demonstrated that applying integer difference color models to MCU image fragments with the option of switching to a single difference color model for the entire image can reduce compression ratios by an average of 0.02 bpb but at the same time slows down the encoding by a factor of 2.88 and decoding by 3.39%, so such preprocessing is not recommended to be used in graphic formats. It is emphasized that difference color models should be applied to individual MCUs in archivers in order to ensure maximum lossless image compression.

Cohort Builder: Simplifying Cohort Creation

ObjectiveThe Cohort Builder package aims to streamline the cohort building process using R, with simplicity and efficiency as the primary focus. Researchers can generate cohorts from TRE (Trusted Research Environment) datasets by specifying simple cohort definitions as YAML (YAML Ain't a Markup Language) parameters using this package, eliminating the need to write complex queries. ApproachCohort Builder offers researchers a user-friendly interface for defining cohort criteria by abstracting away the complexities of database queries using YAML configuration files. The package enables researchers to focus on defining the desired cohort characteristics rather than navigating the database and tables. Users can easily specify inclusion and exclusion criteria, demographic constraints, temporal constraints, and other dataset parameters to create cohorts tailored to their research goals and reproduce the results using the same configuration file. ResultUsing the Cohort Builder, users may quickly create cohorts from TRE datasets with minimum code. The package facilitates reproducibility, transparency, and increased productivity. Researchers gain from having to rely less on specialised database expertise and having more flexibility when defining and exploring cohorts. ConclusionCohort Builder offers a straightforward yet effective method for defining cohorts. The package frees researchers from having to worry about intricate technological details in favour of their analytical objectives. ImplicationsMoving forward, Cohort Builder will support creative research projects across a range of disciplines and promote collaboration among researchers by allowing them to share configuration files for their cohorts.

On Three Domination-based Identification Problems in Block Graphs

The problems of determining the minimum-sized identifying, locating-dominating and open locating-dominating codes of an input graph are special search problems that are challenging from both theoretical and computational viewpoints. In these problems, one selects a dominating set C of a graph G such that the vertices of a chosen subset of V(G) (i.e. either V(G) \ C or V(G) itself) are uniquely determined by their neighborhoods in C. A typical line of attack for these problems is to determine tight bounds for the minimum codes in various graph classes. In this work, we present tight lower and upper bounds for all three types of codes for block graphs (i.e. diamond-free chordal graphs). Our bounds are in terms of the number of maximal cliques (or blocks) of a block graph and the order of the graph. Two of our upper bounds verify conjectures from the literature with one of them being now proven for block graphs in this article. As for the lower bounds, we prove them to be linear in terms of both the number of blocks and the order of the block graph. We provide examples of families of block graphs whose minimum codes attain these bounds, thus showing each bound to be tight.

Exploring the Connection between the TDD Practice and Test Smells—A Systematic Literature Review

Test-driven development (TDD) is an agile practice of writing test code before production code, following three stages: red, green, and refactor. In the red stage, the test code is written; in the green stage, the minimum code necessary to make the test pass is implemented, and in the refactor stage, improvements are made to the code. This practice is widespread across the industry, and various studies have been conducted to understand its benefits and impacts on the software development process. Despite its popularity, TDD studies often focus on the technical aspects of the practice, such as the external/internal quality of the code, productivity, test smells, and code comprehension, rather than the context in which it is practiced. In this paper, we present a systematic literature review using Scopus, Web of Science, and Google Scholar that focuses on the TDD practice and the influences that lead to the introduction of test smells/anti-patterns in the test code. The findings suggest that organizational structure influences the testing strategy. Additionally, there is a tendency to use test smells and TDD anti-patterns interchangeably, and test smells negatively impact code comprehension. Furthermore, TDD styles and the relationship between TDD practice and the generation of test smells are frequently overlooked in the literature.

Numerical Analysis of Rubberized Steel Fiber Reinforced Concrete Beams Subjected to Static and Blast Loadings

In recent years, the alarming number of terrorist attacks has highlighted the critical need for extensive research aimed at fortifying structures against explosion-induced loads. However, the insufficient energy absorption and brittleness of conventional concrete make it ineffective in withstanding blast loading, encouraging researchers to explore innovative strategies for augmenting the energy dissipation capabilities of construction materials. This study specifically delves into the incorporation of recycled rubber, a sustainable and environmentally friendly solution to the pressing issue of scrap tire disposal. The primary focus of this research revolves around the integration of rubber recycling and steel fibers into concrete, with the ultimate goal of enhancing the dynamic response of reinforced concrete (RC) beams. This novel approach not only contributes to the structural resilience required for resisting blast impacts, but also aligns with eco-friendly practices by reusing recycled rubber. A meticulous numerical investigation was undertaken to comprehensively assess the static and blast response of these augmented beams. The numerical study involved developing finite element (FE) models using ABAQUS version 6.14 for static implicit analysis and LS-DYNA R11 for blast explicit simulations. The ABAQUS model was validated against previous experimental testing for load–displacement and failure patterns. Similarly, the LS-DYNA model was validated for blast pressure in accordance with UFC-3-340 standards and for material response under blast loading, utilizing existing experimental data. The numerical models were designed to accommodate varying weight percentages of rubber, ranging from 5% to 20%, and a consistent 1.0% incorporation of steel fibers. This comprehensive analysis aims to provide valuable insights into the efficacy of these materials in improving the structural integrity and blast resistance of RC beams, thereby contributing to the development of more secure and sustainable construction practices. By reducing the reinforcement ratio in order to meet the minimum code requirements, it became evident that the failures of the rubberized RC beams tended to exhibit ductility on the tension side under static loading. In addition, the increase in the reinforcement ratio correlated with a higher failure load and decreased deflection. Furthermore, the findings indicated an optimal concrete mixture characterized by improved ductility, energy absorption, and blast load capacity, achieved by combining 5–10% rubber with steel fibers.

Some issues in the practical application of risk‐targeted ground motions

AbstractRisk‐targeted spectra for seismic design have been proposed in earthquake engineering literature to harmonize seismic reliability for different structures designed at different sites. Such a proposal has been motivated by the fact that designing for uniform seismic hazard across building sites has been shown to generally lead to non‐uniform seismic risk. This note uses a case study implementation of the risk‐targeted design actions philosophy for seven Italian sites, to showcase two noteworthy practical issues with this otherwise appealing approach. First, at lower‐to‐moderate‐hazard sites, which may be the majority in a country, design against gravity loads and detailing according to minimum code requirements, can result in higher‐than‐anticipated overstrength, not commensurate with the adopted level of seismic design loads, thus deviating from the target reliability. This leaves only higher‐hazard sites with real margins for homogenization of reliability, which raises the bar. Second, risk‐targeted spectrum approaches typically require some a‐priori assumptions for structural fragility at low‐performance objectives, corresponding to alleged high damage. These assumptions, among others, carry an implicit adoption of shaking intensity measures with which to express fragility, whose lack of sufficiency and efficiency may in turn reduce the level of homogenization of risk that can be achieved.

Jurisdictional decision-making about building codes for resiliency and sustainability post-fire

The increasing frequency and size of wildfires across the U.S. motivates the growing need to identify how affected communities can rebuild sustainably and resiliently. This study examines the jurisdictional decision-making process surrounding one important class of sustainability and resiliency decisions, focusing on energy and wildfire building codes for housing reconstruction. Through 22 interviews with staff and elected officials in three jurisdictions impacted by Colorado’s Marshall Fire, we identify factors influencing decisions. Code decisions varied across jurisdictions and, in some cases, building codes were relaxed, while in other cases, increased resiliency and sustainability standards were adopted after the fire. Jurisdictions with more experience had more certainty regarding code costs and effectiveness, leading to more stringent code adoption. Thus, findings encourage jurisdictions to create rebuilding plans pre-disaster to reduce the impact of uncertainty in post-disaster decision-making. The data also indicate that while local jurisdictions are well-suited to work cooperatively with homeowners impacted by disasters to return to the community, the state can play a role by informing or mandating disaster plans or establishing minimum code requirements.

Распределение мощности кодов с наименьшей избыточностью алфавитов в зависимости от количества бит и кодового расстояния

Purpose: To investigate the dependence of the maximum power of codes on the number of digits and the minimum code distance; to find an approach to determine the optimal rules for constructing the check vector of a separable code from the point of view of ensuring minimal redundancy with a given reliability of message transmission. Methods: Computer simulation has been used to conduct experimental studies. For theoretical studies, the method of analytical review, graph theory, and coding theory have been applied. Results: Theoretical and experimental studies have obtained certain specific cases of power distribution for code alphabets with a given Hamming distance for various constant lengths, generated using the previously described algorithm. A method for doubling the power of arbitrary binary codes is proposed and described, as well as a method for obtaining codes with the least redundancy of powers M=2f, where f is a natural number for a predetermined minimum code distance by recursively using the method proposed in the article. Practical significance: An algorithm has been developed for doubling the power of the code alphabet while maintaining the required reliability of data transmission. A technique for analyzing the resulting matrices of code vectors is obtained in order to determine the rules for calculating check bits without using cyclic algorithms.

Life cycle cost‐based optimization framework for seismic design and target safety quantification of dual steel buildings with buckling‐restrained braces

AbstractThis study proposes an efficient risk‐targeted framework for integrated optimal seismic design and quantifying target safety of Special Moment‐Resisting Frames (SMRFs) with Buckling‐Restrained Braces (BRBs) in the typical dual steel buildings. This framework provides an automated design procedure formulated as a constrained single‐objective optimization problem to achieve the minimum Life Cycle Cost (LCC) within the Particle Swarm Optimization (PSO) algorithm and can be the basis of current seismic codes for target safety calibration. LCC includes initial construction cost and lifetime seismic losses such as repair cost, repair time, and casualties. FEMA P‐58 methodology is employed for the LCC analysis of the building under possible earthquakes during its lifetime, which is able to take into account potential uncertainties in the hazard‐response‐damage‐loss relationship. An appropriate cost model is developed to estimate the initial and repair cost of the studied BRBs. Minimum requirements of ASCE and AISC codes are considered as design constraints. Nonlinear response history analysis through the Endurance Time (ET) method is utilized to estimate the structural responses versus seismic intensity. Three 4‐, 8‐, and 12‐story steel buildings with dual seismic force‐resisting system consisting of SMRF and BRB (called steel SMRF‐BRB) are selected as the case study. Each building is optimally designed with two approaches: (1) LCC‐based design within the proposed framework and (2) code‐based design to minimize initial construction cost. Comparison of optimized buildings with the two design approaches in terms of structural responses and seismic consequences demonstrates that fulfilling the minimum code requirements at a given seismic hazard level is not sufficient to minimize lifetime seismic losses of steel SMRF‐BRBs. This is because the optimal designs obtained from the code‐based approach are associated with damage concentration, irreparability, and high collapse probability, especially in seismic events more severe than the design level. The proposed LCC‐based approach provides useful information for improving the lifetime seismic performance of steel SMRF‐BRBs.

A detailed implementation of multithreading and out-of-core computation to the conventional boundary element algorithm with minimum code changes

A detailed implementation of multithreading and out-of-core computation to the conventional boundary element algorithm with minimum code changes

Эффективный выбор основания кода при первичном кодировании

Modern advances in microelectronics and the widespread use of computer technology for the purpose of software implementation of various telecommunication and information devices are a reliable justification for the representation of messages from various sources in digital form, that is, in the form of appropriate code combinations, which are essentially numbers in a certain number system. Considering the effective primary coding of messages from the source, they strive to achieve, first of all, the coding rate as close as possible to the entropy of the source, which was proved in the well-known theorems of Claude Shannon, which substantiated this position regarding the minimum value of the average length of the code combination. Since different messages from the source appear, as a rule, with different probabilities, it is possible to achieve the minimum coding rate using non-uniform coding methods, for example, according to the algorithm proposed by David Huffman. In an effort to achieve the minimum encoding rate, one should also take into account the complexity of the implementation of the primary encoding device, take into account the number of elements that will be required for its practical implementation, and so on. Based on this, the effectiveness of one or another method of primary coding is determined not by one, but by a number of factors that often contradict each other. One of these factors is the choice of the code base, which makes it possible to optimize the costs of the practical implementation of the primary coding method, which was the subject of consideration in this paper

On optimal triple friction pendulum base-isolation design for steel moment-frame buildings employing value-based seismic design methodology

This paper uses the value-based seismic design methodology to optimize the mechanical and geometrical properties of triple friction pendulum bearings (TFPBs). An optimization procedure is proposed within this methodology. Initial construction cost and lifetime seismic losses are picked as the value components. Extreme failure conditions of the TFPB, less considered in the current literature, such as the uplift and exit failure modes of the curved surface sliders at the end edges, have been carefully considered in the seismic behavior of the structure. Besides, the minimum code provisions and practical limitations (e.g., the critical overturning diameter of sliders) for friction pendulum isolated buildings are regarded as design constraints. Moreover, a new cost function for TFPBs is developed from real projects of isolated buildings. The FEMA P-58 procedure is exploited to evaluate the lifetime seismic repercussions, comprising the reparation cost, reparation time, injuries, and fatalities. The endurance time method is incorporated in the FEMA P-58 procedure to estimate the structural seismic responses. A set of three buildings are chosen for evaluation, representing low-to mid-rise isolated moment-resisting frames (MRFs) with TFPBs. Each building is optimally designed with two approaches: the value-based design (VBD) via maximizing the total building value and the code-based design (CBD) via minimizing the construction cost. It is found that the total value of each isolated MRF building optimized using the CBD approach is moderately acceptable. Nevertheless, it can be notably increased using the VBD approach since it sufficiently diminishes the probability of the uplift and exit failure modes at the end edges of TFPBs.

On optimal lead rubber base-isolation design for steel moment frames using value-based seismic design approach

This paper employs the framework of value-based seismic design to optimize the geometrical and mechanical properties of lead rubber bearings (LRBs). An optimization problem is proposed within this framework. Construction cost and seismic consequences are chosen as the value components. Most failure modes of the LRB, such as strength deterioration, axial buckling, and rubber rupture, have been carefully considered in the seismic response. Besides, a new cost function for LRBs is developed from actual isolated building projects. Moreover, the minimum code requirements for lead rubber isolated buildings are formulated as the design constraints. FEMA P-58 methodology is exploited to predict the seismic consequences, including the repair cost, repair time, injury, and fatality. Endurance time method is used to evaluate the structural seismic responses. A set of three lead rubber isolated buildings are selected for investigation, representing low-to mid-rise moment-resisting frames (MRFs). Each building is optimally designed by two scenarios: the code-based design (CBD) by minimizing the initial construction cost and the value-based design (VBD) by maximizing the total building value. It is observed that the total building values of the isolated MRFs optimized with the CBD approach are somewhat acceptable. However, they can be significantly increased with the VBD approach because it adequately reduces the probability of axial buckling and rupture of LRBs.

Index Coding with Multiple Interpretations.

The index coding problem consists of a system with a server and multiple receivers with different side information and demand sets, connected by a noiseless broadcast channel. The server knows the side information available to the receivers. The objective is to design an encoding scheme that enables all receivers to decode their demanded messages with a minimum number of transmissions, referred to as an index code length. The problem of finding the minimum length index code that enables all receivers to correct a specific number of errors has also been studied. This work establishes a connection between index coding and error-correcting codes with multiple interpretations from the tree construction of nested cyclic codes. The notion of multiple interpretations using nested codes is as follows: different data packets are independently encoded, and then combined by addition and transmitted as a single codeword, minimizing the number of channel uses and offering error protection. The resulting packet can be decoded and interpreted in different ways, increasing the error correction capability, depending on the amount of side information available at each receiver. Motivating applications are network downlink transmissions, information retrieval from datacenters, cache management, and sensor networks.

Polar Code Parameter Recognition Algorithm Based on Dual Space

To improve the performance of polar code parameter recognition in the fields of intelligent communication, communication detection, and network countermeasures, we propose a new recognition scheme for the additive white Gaussian noise (AWGN) channel. The scheme turns parameter recognition problems into hypothetical tests and is effective due to the check relationship between the received codeword and the dual space determined by the correct parameters. First, a sub-matrix is obtained by removing the frozen-bit-index rows of the polar code generator matrix, and then its dual matrix is calculated. To check the relationship of the dual matrix and codewords, the average likelihood ratio of codewords is introduced as a test statistic, and then the corresponding decision threshold is deduced. Next, the degree of conformity of polar code recognition is defined, and the minimum code length and code rate corresponding to the highest degree of conformity are chosen to calculate the index of information-bit positions by a Gaussian approximation (GA) construction algorithm. Finally, the chosen code length, code rate, and corresponding index are provided as the recognition results. Simulation results show that the algorithm can achieve effective parameter recognition in both high-signal-to-noise (SNR) and low-SNR environments, and that the algorithm’s recognition performance increases with decreasing code rate and code length. The parameter recognition rate with a code length of 128 and code rate of 1/5 is close to 100% when the SNR is 4 dB, and the algorithm complexity increases almost linearly with the decreasing code rate and the increasing length of the intercepted data.

On Rack-Aware Cooperative Regenerating Codes and Epsilon-MSCR Codes

In distributed storage systems, cooperative regenerating codes tradeoff storage for repair bandwidth in the case of multiple node failures. In rack-aware distributed storage systems, there is no cost associated with transferring symbols within a rack. Hence, the repair bandwidth will only take into account cross-rack transfer. Rack-aware regenerating codes for the case of single node failures have been studied and their repair bandwidth tradeoff characterized. In this paper, we consider the framework of rack-aware cooperative regenerating codes for the case of multiple node failures where the node failures are uniformly distributed among a certain number of racks. We characterize the storage repair-bandwidth tradeoff as well as derive the minimum storage and minimum repair bandwidth points of the tradeoff. We also provide explicit constructions of minimum bandwidth rack-aware cooperative regenerating codes and minimum storage rack-aware cooperative regenerating codes for a large range of parameters. We also consider another extension of minimum storage cooperative regenerating codes, in which we design slightly sub-optimal cooperative regenerating codes with much lower sub-packetization. <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\epsilon $ </tex-math></inline-formula> -MSR codes are a class of codes introduced to tradeoff sub-packetization level for a slight increase in the repair bandwidth for the case of single node failures. We introduce the framework of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\epsilon $ </tex-math></inline-formula> -MSCR codes which allow for a similar tradeoff for the case of multiple node failures. We present a construction of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\epsilon $ </tex-math></inline-formula> -MSCR codes, which can recover from two node failures, by concatenating a class of MSCR codes and scalar linear codes. We give a repair procedure to repair the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\epsilon $ </tex-math></inline-formula> -MSCR codes in the event of two node failures and calculate the repair bandwidth for the same. We characterize the increase in repair bandwidth incurred by the method in comparison with the optimal repair bandwidth. Finally, we show the subpacketization level of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\epsilon $ </tex-math></inline-formula> -MSCR codes scales logarithmically in the number of nodes.

Half diagonal matrix codes for reliable embedded memories

Reliability of embedded memories is dependent on at-speed rated correction capability of error detection and correction codes. Many critical applications like medical databases, rocket launch details stored in memories require accurate data and which cause major human losses or economy losses even if a 1% of data is compromised. This paper focuses on developing improved reliable error detection and correction codes with minimum redundant bits and maximum code rate. The decoder uses the concept of Encoder Reuse Technique along with the Modulo-2 addition to calculate syndrome, error location and correction of data bits when data is read from memory. The codes are represented in verilog hardware description language and simulated in the Tool Xilinx ISE 14.5 for XC7Z020-1CLG484 FPGA. The codes are evaluated for their performance in terms of technology parameters like area, delay, power, power – delay product, etc. Also for other parameters like bit overhead, code rate, code efficiency, correction coverage, correction efficiency, etc and correction coverage per cost for combined evaluation. The implemented half diagonal code is more effective as compared to existing matrix codes, it reduces bit overhead at least by 5.5% to 46.96% and coding rate increased at least by 16.74% to 23.85%.

The DMT of Real and Quaternionic Lattice Codes and DMT Classification of Division Algebra Codes

In this paper we consider the diversity-multiplexing gain tradeoff (DMT) of so-called minimum delay asymmetric space-time codes. Such codes are less than full dimensional lattices in their natural ambient space. Apart from the multiple input single output (MISO) channel there exist very few methods to analyze the DMT of such codes. Further, apart from the MISO case, no DMT optimal asymmetric codes are known. We first discuss previous criteria used to analyze the DMT of space-time codes and comment on why these methods fail when applied to asymmetric codes. We then consider two special classes of asymmetric codes where the code-words are restricted to either real or quaternion matrices. We prove two separate diversity-multiplexing gain trade-off (DMT) upper bounds for such codes and provide a criterion for a lattice code to achieve these upper bounds. We also show that lattice codes based on Q-central division algebras satisfy this optimality criterion. As a corollary this result provides a DMT classification for all Q-central division algebra codes that are based on standard embeddings. While the Q-central division algebra based codes achieve the largest possible DMT of a code restricted to either real or quaternion space, they still fall short of the optimal DMT apart from the MISO case.

A Study of Body Modification Artists' Knowledge, Attitudes, and Practices Toward Infection Control: A Questionnaire-Based Cross-Sectional Study.

BackgroundTattoos and piercings, which were once considered taboo, are now widespread like an epidemic, among people of all ages and gender. The rising demand for such body alterations has given rise to a large number of infective complications. This study was, therefore, designed to assess the infection control knowledge, attitudes, and practices of body modification artists in Ethiopia, 2021.MethodsAn anonymous observational cross-sectional study was conducted in Addis Ababa, Ethiopia, from May 25 to June 22, 2021. The data collection instrument was a structured questionnaire that covered the participants’ socio-demographic characteristics, knowledge, attitudes, and practices related to infection control. On the whole, 172 tattoo and body piercing artists participated in the study. SPSS v.20 software was used for data entry and analysis. Pearson’s correlation test, t-test, Tukey’s test, and multiple linear regression analysis were conducted during the data analysis.ResultsMale participants constituted well over three-fourths (96.5%, n = 166) of the sample considered in the study. According to the result, the participants’ knowledge of infection control received the lowest score (7.1 ± 1.22). Participants’ scores of knowledge of infection control increased with an increase in their experience in the multiple linear regression. Experience and training time were also associated with knowledge. Infection control practice was positively associated with the respondents’ attitudes. After controlling other variables, it was found that a one-unit increase in respondents’ attitude scores increased their practice level by 86%.ConclusionThis is the first study in Ethiopia to examine tattooists’ and body piercers’ infection control knowledge, attitude, and practice. Minimum standards for infection control in inking and piercing establishments are necessary. It is therefore important that local authorities and public health professionals work towards laying down the minimum code of practice for infection control in inking and piercing establishments.

Seismic analysis of a modern 14‐story reinforced concrete core wall building system using the BTM‐shell methodology

AbstractThis paper uses computational simulation to investigate the lateral load‐displacement behavior and failure modes of a modern 14‐story reinforced concrete (RC) core wall building. The design complies with the minimum code requirements of the current California Building Code, which is based on ASCE 7–16 and ACI 318–14. The computational representation of the building, which accounts for the material nonlinearities of all structural components, employs the beam‐truss model (BTM) for the walls and floor slabs. Analyses of the building model are conducted for static monotonic and cyclic lateral loads using the program FE‐MultiPhys, which provides a user‐friendly implementation of the BTM as an assemblage of rectangular shell macroelements. Two different load patterns, that is, lateral load distributions along the building height, are considered. The analyses provide insights into the evolution of damage and lateral strength degradation and their dependence on the load pattern, while also elucidating the complex interaction between the webs and flanges of the core wall and the system effects associated with coupling between the walls, beams, slabs, and columns. The presentation of the analytical results is accompanied by a discussion on the advantages of the BTM over seismic analysis methods used in current code‐minimum and performance‐based seismic design (PBSD) practice.