PENERAPAN PRINSIP KEHATI-HATIAN BANK DALAM PENCAIRAN DANA NASABAH DIHUBUNGKAN DENGAN UNDANG-UNDANG TENTANG PERBANKAN

Banks, especially commercial banks, are not only financial intermediaries from those with surplus funds to those with deficit funds, but are also the financial foundation of every country engaged in business activities and the various services provided. Banks serve and launch payment system mechanisms for all sectors of the economy. As a financial institution, bank activities are based on the trust of customers who can be accounted for by the bank. The Bank as an Intermediary institution carries out its business activities based on banking principles and rules, one of which is the Prudential Principle which must be applied. Themethodology used in this research is a normative juridical approach, namely by collecting library data by examining library materials or secondary legal materials. In this case, by examining the legal issues contained in Court Decision Number 38/Pdt.G/2017/PN.Idm and Act Number 10, 1998. The precautionary principle as a form of legal protection forcustomers indirectly to anticipate losses to customers. Which should be implemented properly to maintain customer trust, but in its implementation the precautionary principle has not been applied optimally. This has been encountered in one of the cases where the bank was deemed not to have maximally implemented the prudential principles. Proof (validation) of the system, the Bank should apply the precautionary principle but in its implementation the Bank causes losses to customers and the loss of customer trust in the Bank.

cake_lpr: Verified Propagation Redundancy Checking in CakeML

Modern SAT solvers can emit independently checkable proof certificates to validate their results. The state-of-the-art proof system that allows for compact proof certificates is propagation redundancy (PR). However, the only existing method to validate proofs in this system with a formally verified tool requires a transformation to a weaker proof system, which can result in a significant blowup in the size of the proof and increased proof validation time. This paper describes the first approach to formally verify PR proofs on a succinct representation; we present (i) a new Linear PR (LPR) proof format, (ii) a tool to efficiently convert PR proofs into LPR format, and (iii) , a verified LPR proof checker developed in CakeML. The LPR format is backwards compatible with the existing LRAT format, but extends the latter with support for the addition of PR clauses. Moreover, is verified using CakeML ’s binary code extraction toolchain, which yields correctness guarantees for its machine code (binary) implementation. This further distinguishes our clausal proof checker from existing ones because unverified extraction and compilation tools are removed from its trusted computing base. We experimentally show that LPR provides efficiency gains over existing proof formats and that the strong correctness guarantees are obtained without significant sacrifice in the performance of the verified executable.

Identifikasi Tanda Tangan Berdasarkan Grid Entropy Menggunakan Multi Layer Perceptron

The signature is one frequently proof validation used on documents. Recognition of signature is required to verify document whether the signature is gived by concerned person or others. In this study the authors design a signature identification system based on the value of entropy that taken from the grid image of an image of a signature. Training and testing model using a multi layer perceptron and cross validation by three grid sizes (4x4, 8x8, and 16x16) and two types of image representation (binary image and the image of the outline). The best test results obtained on the grid size 8x8 using outline image that is the accuracy rate of 97.78%, the value of the correlation 0.981, and a kappa value of 0.977.

On Mathematicians' Proof Skimming: A Reply to Inglis and Alcock

In a recent article, Inglis and Alcock (2012) contended that their data challenge the claim that when mathematicians validate proofs, they initially skim a proof to grasp its main idea before reading individual parts of the proof more carefully. This result is based on the fact that when mathematicians read proofs in their study, on average their initial reading of a proof took half as long as their total time spent reading that proof. Authors Keith Weber and Juan Pablo Mejía-Ramos present an analysis of Inglis and Alcock's data that suggests that mathematicians frequently used an initial skimming strategy when engaging in proof validation tasks.

Expert and Novice Approaches to Reading Mathematical Proofs

This article presents a comparison of the proof validation behavior of beginning undergraduate students and research-active mathematicians. Participants' eye movements were recorded as they validated purported proofs. The main findings are that (a) contrary to previous suggestions, mathematicians sometimes appear to disagree about the validity of even short purported proofs; (b) compared with mathematicians, undergraduate students spend proportionately more time focusing on “surface features” of arguments, suggesting that they attend less to logical structure; and (c) compared with undergraduates, mathematicians are more inclined to shift their attention back and forth between consecutive lines of purported proofs, suggesting that they devote more effort to inferring implicit warrants. Pedagogical implications of these results are discussed, taking into account students' apparent difficulties with proof validation and the importance of this activity in both schooland university-level mathematics education.