Reliable circuit analysis and design using nanoscale devices

In this study, a Markov Random Field (MRF) approach is used to locate source boundary positions which are difficult to identify from Bouguer gravity and magnetic maps. As a generalized form of Markov Chains, the MRF approach is an unsupervised statistical model based algorithm and is applied to the analysis of images, particularly in the detection of visual patterns or textures. Here, we present a dynamic programming based on the MRF approach for boundary detection of noisy and super-positioned potential anomalies, which are produced by various geological structures. In the MRF method, gravity and magnetic maps are considered as two-dimensional (2-D) images with a matrix composed of N1 × N2 pixels. Each pixel value of the matrix is optimized in real time with no a priori processing by using two parameter sets; average steering vector (θ) and quantization level (M). They carry information about the correlation of neighboring pixels and the locality of their connections. We have chosen MRF as a processing approach for geophysical data since it is an unsupervised, efficient model for image enhancement, border detection and separation of 2-D potential anomalies. The main benefit of MRF is that an average steering vector and a quantization level are enough in evaluation of the potential anomaly maps. We have compared the MRF method to noise implemented synthetic potential field anomalies. After satisfactory results were found, the method has been applied to gravity and magnetic anomaly maps of Gelibolu Peninsula in Western Turkey. Here, we have observed Anafartalar thrust fault and another parallel fault northwest of Anafartalar thrust fault. We have modeled a geological structure including a lateral fault, which results in a higher susceptibility and anomaly amplitude increment. We have shown that the MRF method is effective to detect the broad-scale geological structures in the Gelibolu Peninsula, and thus to delineate the complex tectonic structure of Gelibolu Peninsula.

Business process modelling is an important part of system design. When designing or redesigning a business process, stakeholders specify, negotiate, and agree on business requirements to be satisfied, including non-functional requirements that concern the quality of the business process. This thesis addresses the question of how to specify and compute the quality of a business process, given the model that stakeholders use. The motivation for this thesis is the increasing importance of the quality of business processes. Knowing the quality of specific business processes enables stakeholders to judge if these processes need improvement. Knowing the quality of the constructs of those processes (viz., events, inputs, activities, and outputs) and the way they are structured enables a more detailed analysis of their shortcomings and provides a basis for the design of improvements. The research challenge of this thesis is grounded in the assumption that: “Organisations need an appropriate means to effectively compute achievement of their goals and objectives by their business processes.” Given this challenge, the main research question on which this thesis focuses is: “Can the quality of a business process be computed quantitatively at different levels of granularity?” The research objective is: “To develop frameworks, factors, and metrics for computing non-functional requirements (quality) of business processes quantitatively at different levels of granularity.” The outcomes of this thesis are: 1) BPIMM, a language-independent business process integrating meta-model, based on the concepts of seven mainstream business process modelling languages: BPMN, EPC, RAD, UML AD, SADT, IDEF0, and IDEF3. 2) BPC-QC (Business Process Concept - Quality Computation), an approach to quality computation at the lowest level of granularity of a business process. The approach consists of: i. BPC-QEF (Business Process Concept - Quality Evaluation Framework), a language-independent generic framework and algorithm to compute the quality of the constructs of a business process: event, input, activity, and output. ii. A set of business process quality dimensions and factors. The following quality dimensions are distinguished: performance, efficiency, reliability, recoverability, permissibility, and availability. Each dimension categorises different quality aspects in terms of factors. A non-exhaustive set of sixteen quantitative factors is provided. iii. Quality metrics for each of the quality factors, to facilitate a quantitative computation of the quality of a specific construct of a business process. 3) BP-QC (Business Process - Quality Computation), an approach to compute the quality at the highest level of granularity of a business process. The approach consists of: i. BP-CQCF (Business Process - Compositional Quality Computation Framework), a language-independent generic framework and algorithm to compute the quality of a business process as a whole, given the quality of its constructs. ii. A set of generic business process modelling patterns to decompose a business process into more succinct parts, namely: sequential, parallel with synchronisation, exclusive, inclusive, simple loop, and complex loop. iii. A set of over one hundred computational formulae. For each combination of modelling pattern and a quality factor, there is a formula to compute the quality. 4) AAV (Approach to Application and Validation), an evaluation plan to evaluate BPIMM, BPC-QC and BP-QC in practice, together with expert stakeholders. The plan consists of the units of measure, a measurement model, and a case study procedure. To evaluate the applicability of the contributions of this thesis to real world business needs, four case studies have been conducted in different environments: a Dutch educational institution, a global financial institution, an international financial service provider, and a Dutch research project on crisis management. Each of these case studies concerns a different, single business process. This thesis shows that: 1) A quality computation approach can be adopted independent of a business process modelling language. 2) Quantitative quality factors can be introduced specifically for the constructs of a business process. 3) Quantitative metrics and computational formulae can be developed for specific quality factors, allowing the computation of different aspects of the quality of a business process quantitatively at different levels of granularity. 4) An evaluation plan can be developed to evaluate the applicability of the contributions of this thesis (viz., BPIMM, BPC-QC, and BP-QC). The contributions of this thesis are designed to be beneficial to the areas of business and management, requirements engineering, software engineering, and business process modelling. In the areas of requirements engineering and software engineering, these contributions are intended to help practitioners to consider non-functional requirements at the earliest stage. In the area of business process modelling, information systems, service computing, and cloud computing, the contributions can be used for quality-driven modelling, design, and redesign. To conclude, knowing the quality value of a business process at different levels of granularity provides a basis for its improvement.

Soft errors in scientific computing applications are becoming inevitable with the ever-increasing system scale and execution time, and new technologies that feature increased transistor density and lower voltage. Soft errors can be mainly classified into two categories: bit-flipping error (e.g. 1 becomes −1) in random access memory; and computation error (e.g. 1+1 = 3) in floating point units. Traditionally, bit-flipping error is handled by the Error Correcting Code (ECC) technique, and computation error is dealt with the Triple Modular Redundancy (TMR) method. Note that, ECC cannot handle computation error, while TMR cannot deal with bit-flipping error and is not efficient on handling computation error. To uniformly and efficiently handle both computation and bit-flipping errors in matrix operations, the Algorithm-Based Fault Tolerance (ABFT) method is developed. This paper focuses on the detection of soft errors in the LU Decomposition with Partial Pivoting (LUPP) algorithm, which is widely used in scientific computing applications. First, this paper notes that existing ABFT methods are not adequate to detect soft errors in LUPP in terms of time or space. Then we propose a new ABFT algorithm which can detect soft errors in LUPP both flexible in time and comprehensive in space. Flexible in time means that soft errors can be detected flexibly during the execution instead of only at the end of LUPP, while comprehensive in space indicates that all of the elements in data matrices ( L and U) will be covered for detecting soft errors. To show the feasibility and efficiency of the proposed algorithm, this paper has incorporated it into the implementation of LUPP in the widely used benchmark High Performance Linpack (HPL). Experiment results verify the feasibility of this algorithm: for soft errors injected at various timings and to different elements in LUPP, this algorithm has detected most of the injected errors, which have covered all of the errors that cannot pass the residual check of HPL. Both theoretical overhead analysis and experiments demonstrate that this ABFT algorithm is also very efficient at detecting soft errors in LUPP.

Triple modular redundancy (TMR) is one of the most common techniques in fault-tolerant systems, in which the output is determined by a majority voter. However, the design diversity of replicated modules and/or soft errors that are more likely to happen in the nanoscale era may affect the majority voting scheme. Besides, the significant overheads of the TMR scheme may limit its usage in energy consumption and area-constrained critical systems. However, for most inherently error-resilient applications such as image processing and vision deployed in critical systems (such as autonomous vehicles and robotics), achieving a given level of reliability has more priority than precise results. Therefore, these applications can benefit from the approximate computing paradigm to achieve higher energy efficiency and a lower area. This article proposes an energy-efficient approximate reliability (X-Rel) framework to overcome the aforementioned challenges of the TMR systems and get the full potential of approximate computing without sacrificing the desired reliability constraint and output quality. The X-Rel framework relies on relaxing the precision of the voter based on a systematical error bounding method that leverages user-defined quality and reliability constraints. Afterward, the size of the achieved voter is used to approximate the TMR modules such that the overall area and energy consumption are minimized. The effectiveness of employing the proposed X-Rel technique in a TMR structure, for different quality constraints as well as with various reliability bounds, is evaluated in a 15-nm FinFET technology. The results of the X-Rel voter show delay, area, and energy consumption reductions of up to 86%, 87%, and 98%, respectively, when compared to those of the state-of-the-art approximate TMR voters. Also, the effectiveness of the proposed X-Rel-based TMR structure is assessed in four benchmark applications from different domains. For these benchmarks, the results show <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$1.59\times $ </tex-math></inline-formula> , <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$2.35\times $ </tex-math></inline-formula> , and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$3.39\times $ </tex-math></inline-formula> energy-delay-area-product (EDAP) reduction for less than 1%, 5%, and 10% output quality degradations, respectively. Finally, an image processing application is benchmarked to evaluate the X-Rel framework efficacy in the presence of errors, where the results show up to a <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$4.78\times $ </tex-math></inline-formula> higher output image quality in comparison with the typical TMR voters.

In traditional formal concept analysis, the attributes in the formal context are considered fixed. However, in the real world data set, attributes always have different levels of granularity, correspondingly, the derived concept lattice may reveal different information and patterns. Therefore, the capability to change the level of granularity of an attribute in formal concept analysis to capture relevant patterns in data is a natural requirement. In this paper, a theoretical study has been undertaken in multi-scale formal contexts, where attributes with different levels of granularity possess different attribute values. Two types of formal concepts, i.e., object-oriented and property-oriented multi-scale concepts, are introduced and studied in detail. The collection of object-oriented concept lattices and property-oriented concept lattices can be obtained at different granularity levels of attributes. It has been shown that the set of extents in the derived concept lattices increases when we choose to use a finer level of granularity. Moreover, a corresponding bidirectional approach to concept construction(i.e., from coarser to finer and from finer to coarser, respectively) is exhibited, and some characterization theorems have been obtained.

As silicon manufacturing technology reaches the nanoscale, architectural designs need to accommodate the uncertainty inherent at such scales. These uncertainties are germane in the miniscule dimension of the device, quantum physical effects, reduced noise margins, system energy levels reaching computing thermal limits, manufacturing defects, aging and many other factors. Defect tolerant architectures and their reliability measures gain importance for logic and micro-architecture designs based on nano-scale substrates. Recently, a Markov random field (MRF) has been proposed as a model of computation for nanoscale logic gates. In this paper, we take this approach further by automating this computational scheme and a belief propagation algorithm. We have developed MATLAB based libraries and toolset for fundamental logic gates that can compute output probability distributions and entropies for specified input distributions. Our tool eases evaluation of reliability measures of combinational logic blocks. The effectiveness of this automation is illustrated in this paper by automatically deriving various reliability results for defect-tolerant architectures, such as triple modular redundancy (TMR), cascaded triple modular redundancy (CTMR) and multi-stage iterations of these. These results are used to analyze trade-offs between reliability and redundancy for these architectural configurations.

In this paper we present a system for automatic Arabic text diacritization using three levels of analysis granularity in a layered back off manner. We build and exploit diacritized language models (LM) for each of three different levels of granularity: surface form, morphologically segmented into prefix/stem/suffix, and character level. For each of the passes, we use Viterbi search to pick the most probable diacritization per word in the input. We start with the surface form LM, followed by the morphological level, then finally we leverage the character level LM. Our system outperforms all of the published systems evaluated against the same training and test data. It achieves a 10.87% WER for complete full diacritization including lexical and syntactic diacritization, and 3.0% WER for lexical diacritization, ignoring syntactic diacritization.

Data warehousing is widely used in industry for reporting and analysis of huge volumes of data at different levels of detail. In general, data warehouses use standard dimensional schema designs to organize their data. However, current data warehousing schema designs fall short in their ability to model the multi-granular data found in various real-world application domains. For example, modern farm equipment in a field produces massive amounts of data at different levels of granularity that has to be stored and queried. A study of the commonly used data warehousing schemas exposes the limitation that the schema designs are intended to simply store data at the same single level of granularity. This paper on the other hand, presents several extended dimensional data warehousing schema design alternatives to store both detail and aggregated data at different levels of granularity. The paper presents three solutions to design the time dimension tables and four solutions to design the fact tables. Moreover, each of these solutions is evaluated in different combinations of the time dimension and the fact tables based on a real world farming case study.KeywordsMulti-granular datadata warehousingdata warehousing schema design

Geo‐SOMis a useful geovisualization technique for revealing patterns in spatial data, but is ineffective in supporting interactive exploration of patterns hidden in differentGeo‐SOMsizes. Based on the divide and group principle in geovisualization, the article proposes a new methodology that combinesGeo‐SOMand hierarchical clustering to tackle this problem.Geo‐SOMwas used to “divide” the dataset into several homogeneous subsets; hierarchical clustering was then used to “group” neighboring homogeneous subsets for pattern exploration in different levels of granularity, thus permitting exploration of patterns at multiple scales. An artificial dataset was used for validating the method's effectiveness. As a case study, the rush hour motorcycle flow data inTaipeiCity,Taiwan were analyzed. Compared with the best result generated solely byGeo‐SOM, the proposed method performed better in capturing the homogeneous zones in the artificial dataset. For the case study, the proposed method discovered six clusters with unique data and spatial patterns at different levels of granularity, while the originalGeo‐SOMonly identified two. Among the four hierarchical clustering methods,Ward's clustering performed the best in pattern discovery. The results demonstrated the effectiveness of the approach in visually and interactively exploring data and spatial patterns in geospatial data.

Due to the rapid development of social media networks, as well as the recent advances on smartphone technologies, users stopped being only consumers and became data producers. It enabled a new form of sensing, engaging a variety of studies using Location-Based Social Networks (LBSN) data. For instance, in device-to-device(D2D) communication systems, the user location is required to make mobile data offloading possible. However, getting the right location is a challenging task, and the analyses of LBSN datasets provide large-scale studies at a low-cost. On the other hand, depending the the level of granularity used on the analyses, it may result in the success or failure of the prediction. Therefore, in this paper, we show the importance of combining the different levels of granularities for studying user behavior in order to obtain a robuster analysis.

We evaluated soft-error tolerance by heavy ions on several types of flip flops (FFs) called transmission-gate FF (TGFF), Dual Interlocked Storage Cell FF (DICEFF), Bistable Cross-coupled Dual Modular Redundancy FF (BCDMRFF) and BCDMRFF with Set and Reset (BCDMRFFSR) in a 65 nm bulk process. Radiation-hardened FFs are stronger against soft errors than a standard TGFF by two or three order of magnitude. DICEFF has higher soft-error tolerance than BCDMRFF by low-LET heavy ions less than 40 MeV-cm2/mg, while BCDMRFF is stronger against soft error than DICEFF by high-LET ions over 40 MeV-cm2/mg. DICEFF becomes weaker by lowering supply voltage, while BCDMRFF has higher soft-error tolerance than DICEFF when supply voltages is less than 1.0 V.

This paper introduces the concept of granularity into routine dynamics studies. To establish levels of granularity we develop a phenomenological perspective on action, the central category of routine dynamics studies. By conducting an extensive literature review we show that routine dynamics scholars have at least unconsciously applied diverging levels of granularity in their empirical studies. We argue that side-stepping questions of explicitly addressing granularity significantly impedes the comparability of studies since different levels of granularity bring different aspects of performing and patterning processes into focus. Following this, we develop a methodological framework that allows scholars to establish and report on the level of granularity in their study. Finally, we sketch out some implications of taking granularity seriously for writing up research on routine dynamics.

The accurate discrimination of distinct thematic classes using classification techniques developed for medium/low resolution images is not effective when apply to very high spatial resolution (HR) data (e.g. Quickbird, IKONOS) due to the spatial heterogeneity issue. In this paper, Markov random field (MRF) models, which are useful tools for integrating contextual (considering spatial dependence within and between pixels) information into classification process is used to model spatial heterogeneity for improving the classification accuracy. Two novel MRF approaches are evaluated using a Quickbird HR image covers Xixi National Wetland Park, Hangzhou, China. The experimental results show this method is effective to exact segmentation of land boundaries and suppress classification noises. In addition, the improved MRF models outperform than conventional method in terms of classification accuracy and time-efficiency.

Conformance checking provides a set of techniques for comparing observed behavior (event logs) with process models. Health care providers apply it for verifying compliance between activities realized by the patients and clinical protocols. However, health care processes are characterized by high complexity and variability, and clinical protocols can have a level of granularity different from the one in the recorded events. We proposed a new method for configuring the cost function for the alignment-based conformance checking, handling the different levels of granularity to address this problem. The costs are configured based on grouping activities and the specification of undesirable events. We applied this method using the ProM Framework in a real-world dataset containing events from patients who realized a bariatric surgery in 2016. The technique can also be applied in other conformance checking scenarios, where the granularity of the events differs from the process model. The case study result allowed us to automatically identify critical violations of the clinical protocol by analyzing the fitness metric. The proposed method could help auditors to identify crucial cases.

Full adder being the basic building block that performs many operations like addition, division, multiplication and other similar arithmetic process in VLSI systems. Dayadi 1-bit CMOS FA implemented by using CMOS circuits and transmission gate circuits is presented. Design of Dayadi 1-bit CMOS full adder Based on Power Reduction Techniques. The sum and carry generation circuits are designed by novel logic style. The circuit was implemented using micro wind tools in cmos-90 nm technology. Factors such as no of transistors, propagation delay, PDP, and chip area were compared with the existing designs such full adder, TGL and so on. The ultimate aim of designing Dayadi 1-bit CMOS full adder is to reduce power dissipation and to decreased the delay compared to existing work performance.