scholarly journals Transparent memory tests with even repeating addresses for storage devices

Informatics ◽  
2021 ◽  
Vol 18 (3) ◽  
pp. 18-35
Author(s):  
V. N. Yarmolik ◽  
I. M. Mrozek ◽  
V. A. Levantsevich ◽  
D. V. Demenkovets
Keyword(s):  
High Efficiency ◽  
Basic Element ◽  
Distance Metrics ◽  
Optimal Test ◽  
Computing Systems ◽  
Storage Devices ◽  
Pattern Sensitive Faults ◽  
The Difference ◽  
March Tests ◽  
Reference Signature

The urgency of the problem of memory testing of modern computing systems is shown. Mathematical models describing the faulty states of storage devices and the methods used for their detection are investigated. The concept of address sequences (pA) with an even repetition of addresses is introduced, which are the basis of the basic element included in the structure of the new transparent march tests March _pA_1 and March _pA_2. Algorithms for the formation of such sequences and examples of their implementations are given. The maximum diagnostic ability of new tests is shown for the case of the simplest faults, such as constant (SAF) and transition faults (TF), as well as for complex pattern sensitive faults (PNPSFk). There is a significantly lower time complexity of the March_pA_1 and March_pA_2 tests compared to classical transparent tests, which is achieved at the expense of less time spent on obtaining a reference signature. New distance metrics are introduced to quantitatively compare the effectiveness of the applied pA address sequences in a single implementation of the March_pA_1 and March_pA_2 tests. The basis of new metrics is the distance D(A(j), pA) determined by the difference between the indices of repeated addresses A(j) in the sequence pA. The properties of new characteristics of the pA sequences are investigated and their applicability is evaluated for choosing the optimal test pA sequences that ensure the high efficiency of new transparent tests. Examples of calculating distance metrics are given and the dependence of the effectiveness of new tests on the numerical values of the distance metrics is shown. As well as in the case of classical transparent tests, multiple applications of new March_pA_1 and March_pA_2 tests are considered. The characteristic V(pA) is introduced, which is numerically equal to the number of different values of the distance D(A(j), pA) of addresses A(j) of the sequence pA. The validity of analytical estimates is experimentally shown and high efficiency of fault detection by the tests March_pA_1 and March_pA_2 is confirmed by the example of coupling faults for p = 2.

scholarly journals Construction and application of march tests for pattern sensitive memory faults detection

Informatics ◽  
2021 ◽  
Vol 18 (1) ◽  
pp. 25-42
Author(s):  
V. N. Yarmolik ◽  
V. A. Levantsevich ◽  
D. V. Demenkovets ◽  
I. Mrozek
Keyword(s):  
Fault Detection ◽  
Multiple Testing ◽  
High Efficiency ◽  
Fault Coverage ◽  
Memory Cells ◽  
March Test ◽  
Storage Devices ◽  
Coupon Collector ◽  
March Tests ◽  
Analytical Expressions

The urgency of the problem of testing storage devices of modern computer systems is shown. The mathematical models of their faults and the methods used for testing the most complex cases by classical march tests are investigated. Passive pattern sensitive faults (PNPSFk) are allocated, in which arbitrary k from N memory cells participate, where k << N, and N is the memory capacity in bits. For these faults, analytical expressions are given for the minimum and maximum fault coverage that is achievable within the march tests. The concept of a primitive is defined, which describes in terms of march test elements the conditions for activation and fault detection of PNPSFk of storage devices. Examples of march tests with maximum fault coverage, as well as march tests with a minimum time complexity equal to 18N are given. The efficiency of a single application of tests such as MATS ++, March C− and March PS is investigated for different number of k ≤ 9 memory cells involved in PNPSFk fault. The applicability of multiple testing with variable address sequences is substantiated, when the use of random sequences of addresses is proposed. Analytical expressions are given for the fault coverage of complex PNPSFk faults depending on the multiplicity of the test. In addition, the estimates of the mean value of the multiplicity of the MATS++, March C− and March PS tests, obtained on the basis of a mathematical model describing the problem of the coupon collector, and ensuring the detection of all k2k PNPSFk faults are given. The validity of analytical estimates is experimentally shown and the high efficiency of PNPSFk fault detection is confirmed by tests of the March PS type.

scholarly journals An Integrated Credit-Based Incentive Protocol for Symbol-Level Network-Coded Cooperative Content Distribution among Vehicular Nodes

2018 ◽  
Vol 8 (11) ◽  
pp. 2035 ◽  
Author(s):  
Ing-Chau Chang ◽  
Chin-En Yen ◽  
Jacky Lo
Keyword(s):  
Ad Hoc ◽  
High Efficiency ◽  
Performance Metrics ◽  
Content Distribution ◽  
Long Latency ◽  
Distribution Process ◽  
Distribution Operations ◽  
The Difference ◽  
Different Content ◽  
Content Information

In traditional symbol-level network coding (SLNC)-based cooperative content distribution approaches, they ignore nodes in the vehicular ad hoc network (VANET) having various network-coded content pieces and distinct levels of interests and selfishness for different kinds of content data, which further prevents these vehicular nodes from forwarding their content information to other nodes. With these approaches, these nodes suffer from the low ratio and the long latency to receive all content information. In this paper, based on distinct levels of node interests and selfishness on different content information, we first categorize vehicular nodes into four classes, that is, the destination, intermediate, irrelevant and overhearing ones and then designate their associated credit-based incentive approaches. Second, we modify the flow of traditional SLNC-based cooperative content distribution operations and propose the content bitmap to realize the difference of network-coded content pieces among vehicular nodes. Further, we rigidly combine the proposed credit-based incentive approach with the modified SLNC-based cooperative content distribution operations in SocialCode to encourage all classes of vehicular nodes to rise their incentives for sharing content data in the cooperative content distribution process. Finally, we perform NS-2 simulations on a street map of downtown Taipei, Taiwan to exhibit the high efficiency of SocialCode over related credit-based incentive approaches by analyzing the following performance metrics, that is, average decoding percentage, file downloading delay and credits, with respect to different file sizes and total numbers of vehicular nodes. As the best knowledge we have, SocialCode is one of the first few researches that works on the integration between the credit-based incentive protocol and the SLNC-based cooperative content distribution.

Some characteristics of sorting computing systems using random access storage devices

1963 ◽  
Vol 6 (5) ◽  
pp. 248-255 ◽  
Author(s):  
George U. Hubbard
Keyword(s):  
Random Access ◽  
Computing Systems ◽  
Storage Devices

scholarly journals Measurement of Ozone Production Sensor

2010 ◽  
Vol 3 (3) ◽  
pp. 545-555 ◽  
Author(s):  
M. Cazorla ◽  
W. H. Brune
Keyword(s):  
Production Rate ◽  
High Efficiency ◽  
Ambient Air ◽  
Ozone Production ◽  
State University ◽  
Photostationary State ◽  
Sample Chamber ◽  
Efficiency Conversion ◽  
The Difference ◽  
Teflon Film

Abstract. A new ambient air monitor, the Measurement of Ozone Production Sensor (MOPS), measures directly the rate of ozone production in the atmosphere. The sensor consists of two 11.3 L environmental chambers made of UV-transmitting Teflon film, a unit to convert NO2 to O3, and a modified ozone monitor. In the sample chamber, flowing ambient air is exposed to the sunlight so that ozone is produced just as it is in the atmosphere. In the second chamber, called the reference chamber, a UV-blocking film over the Teflon film prevents ozone formation but allows other processes to occur as they do in the sample chamber. The air flows that exit the two chambers are sampled by an ozone monitor operating in differential mode so that the difference between the two ozone signals, divided by the exposure time in the chambers, gives the ozone production rate. High-efficiency conversion of NO2 to O3 prior to detection in the ozone monitor accounts for differences in the NOx photostationary state that can occur in the two chambers. The MOPS measures the ozone production rate, but with the addition of NO to the sampled air flow, the MOPS can be used to study the sensitivity of ozone production to NO. Preliminary studies with the MOPS on the campus of the Pennsylvania State University show the potential of this new technique.

Multi-Run March Tests for Pattern Sensitive Faults in RAM

2018 ◽  
Author(s):  
Eugenia Buslowska ◽  
Vyacheslav Yarmolik
Keyword(s):  
Pattern Sensitive Faults ◽  
March Tests

scholarly journals Modern problems of fixed capital management of the industrial enterprise

2021 ◽  
pp. 23-27
Author(s):  
Olena STANISLAVYK ◽  
Oleksandr KOVALENKO
Keyword(s):  
High Efficiency ◽  
Industrial Sector ◽  
Basic Element ◽  
Fixed Capital ◽  
Industrial Enterprise ◽  
Capital Management ◽  
Goods And Services ◽  
Industrial Enterprises ◽  
Long Run ◽  
Fixed Assets

Introduction. Production activity is impossible without the presence of fixed capital and its basic element – fixed assets, in the operation of which the depreciation fund is formed and the targeted use of depreciation deductions and quality reproduction of fixed assets of the enterprise are positioned to the fore. The importance of this issue increases due to need to enter markets with competitive goods and services, which leads to innovative and active activities of industrial enterprises, which require, above all, significant investments into the fixed assets. The purpose of the paper is to highlight the essence and modern problems of fixed capital management of industrial enterprise. Results. The paper explores the essence of fixed capital management of industrial enterprise and identifies modern key issues in this area facing managers of domestic industrial enterprises. The role of strategic and tactical planning of the process of reproduction of fixed assets in the management of fixed capital of the industrial enterprise and the reasons for its renewal are highlighted. The requirements for the formation of strategy and management system of fixed capital of the industrial enterprise are presented. The stages of formation of the effective strategy of fixed capital management under conditions of the modern market and the basic directions of activity of the industrial enterprise in this sphere are offered. The necessity of implementing the rational depreciation policy and correct revaluation of fixed assets is shown. The importance of using leasing as effective tool for investment and renewal of fixed assets of domestic enterprises of the industrial sector of economy is considered. Conclusion. For the effective management of fixed capital, it is important for industrial enterprises to perform a number of tasks, which involve the development of long-term strategy and tactics for the formation and effective use of fixed assets; determination of fixed capital renewal needs; adequate assessment of the conditions of fixed assets, maintaining the proper conditions of machinery and equipment; implementation of rational depreciation policy; finding acceptable sources of funding for the restoration of fixed capital, as well as finding more efficient ways of using the investment resources. It should allow the industrial enterprise to produce products, which are in demand, and ensure stable competitive positions and high efficiency in the long run.

scholarly journals Fuzzy Knowledge Distance with Three-Layer Perspectives in Neighborhood System

2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Jie Yang ◽  
Tian Luo ◽  
Fan Zhao ◽  
Shuai Li ◽  
Wei Zhou
Keyword(s):  
Rough Sets ◽  
Structural Information ◽  
Boundary Region ◽  
Basic Element ◽  
Target Concept ◽  
Information Granule ◽  
Density Peaks ◽  
Neighborhood System ◽  
Neighborhood Rough Sets ◽  
The Difference

Information granule is the basic element in granular computing (GrC), and it can be obtained according to the granulation criterion. In neighborhood rough sets, current uncertainty measures focus on computing the knowledge granulation of single granular space and have two main limitations: (i) neglecting the structural information of boundary regions and (ii) the inability to reflect the difference between neighborhood granular spaces with the same uncertainty for approximating a target concept. Firstly, a fuzziness-based uncertainty measure for neighborhood rough sets is introduced to characterize the structural information of boundary regions. Moreover, from the perspective of distance, based on the idea of density peaks, we present a fuzzy-neighborhood-granule-distance- (FNGD-) based method to discover the relationship between granules in a granular space. Then, to characterize the difference between granular spaces for approximating a target concept, we present the fuzzy neighborhood granular space distance (FNGSD) and fuzzy neighborhood boundary region distance (FNBRD). FNGD, FNGSD, and FNBRD are hierarchically organized from fineness to coarseness according to the semantics of granularity, which provide three-layer perspectives in the neighborhood system.

scholarly journals Distance Metrics of D Numbers

2020 ◽  
Author(s):  
Liguo Fei ◽  
Yuqiang Feng
Keyword(s):  
Number Theory ◽  
Incomplete Information ◽  
Distance Function ◽  
Distance Measure ◽  
Complete Information ◽  
Belief Function ◽  
Distance Metrics ◽  
Modeling Methods ◽  
The Difference ◽  
D Numbers

Belief function has always played an indispensable role in modeling cognitive uncertainty. As an inherited version, the theory of D numbers has been proposed and developed in a more efficient and robust way. Within the framework of D number theory, two more generalized properties are extended: (1) the elements in the frame of discernment (FOD) of D numbers do not required to be mutually exclusive strictly; (2) the completeness constraint is released. The investigation shows that the distance function is very significant in measuring the difference between two D numbers, especially in information fusion and decision. Modeling methods of uncertainty that incorporate D numbers have become increasingly popular, however, very few approaches have tackled the challenges of distance metrics. In this study, the distance measure of two D numbers is presented in cases, including complete information, incomplete information, and non-exclusive elements

Signature-Encryption Scheme: A Novel Solution to Mobile Computation

2012 ◽  
Vol 546-547 ◽  
pp. 1415-1420
Author(s):  
Hai Yong Bao ◽  
Man De Xie ◽  
Zhen Fu Cao ◽  
Shan Shan Hong
Keyword(s):  
Mobile Communication ◽  
High Efficiency ◽  
Discrete Logarithm ◽  
Communication Technologies ◽  
Random Oracle ◽  
Security Requirements ◽  
Encryption Scheme ◽  
Daily Lives ◽  
Storage Devices ◽  
Diffie Hellman

Mobile communication technologies have been widely utilized in daily lives, many low-computing-power and weakly-structured-storage devices have emerged, such as PDA, cell phones and smart cards, etc. How to solve the security problems in such devices has become a key problem in secure mobile communication. In this paper, we would like to propose an efficient signature-encryption scheme. The security of the signature part is not loosely related to Discrete Logarithm Problem (DLP) assumption as most of the traditional schemes but tightly related to the Decisional Diffie-Hellman Problem (DDHP) assumption in the Random Oracle Models. Different from the existing solutions, our scheme introduces a trusted agent of the receiver who can filter the “rubbish” messages beforehand. Thus, with high efficiency in computation and storage, it is particularly suitable for the above mobile devices with severely constrained resources and can satisfy the security requirements of mobile computations.

scholarly journals Policy Performance of Green Lighting Industry in China: A DID Analysis from the Perspective of Energy Conservation and Emission Reduction

Energies ◽  
2020 ◽  
Vol 13 (22) ◽  
pp. 5855
Author(s):  
Kan Wang ◽  
Li Lei ◽  
Shuai Qiu ◽  
Sen Guo
Keyword(s):  
Energy Conservation ◽  
Emission Reduction ◽  
High Efficiency ◽  
Evaluation Model ◽  
Policy Support ◽  
Policy Framework ◽  
Current Status ◽  
Policy Performance ◽  
Lighting Industry ◽  
The Difference

As a component of China’s strategic emerging industries, green lighting is an important industry supporting the high-quality and high-efficiency development of China’s economy, and is also an important way to achieve energy conservation and emission reduction. At present, China has basically established a policy framework to promote the development of green lighting industry, but there is no empirical evidence on the performance of existing policies on energy conservation and emission reduction. Based on the development status of China’s green lighting industry, this paper sorts out the milestones of China’s green lighting industry policy and the current status of the framework of the existing green lighting industry development policies, constructs a policy performance evaluation model for China’s green lighting industry based on the difference-in-difference (DID) model, and evaluates the implementation effects of green lighting industry policies in China from the perspective of energy conservation and emission reduction. The empirical results of China’s 85 cities show that the implementation of green lighting industry policies has significantly promoted regional energy conservation and emission reduction. Finally, this paper puts forward targeted policy recommendations to provide policy support for the transformation of China’s green lighting industry from “large” to “strong”.

Sign in / Sign up

Export Citation Format

Share Document