Prosedur dan Jenis Permintaan Visum et Repertum di Rumah Sakit: Literature Review

Visum et repertum (VeR) is a medical certificate used for judicial needs in the form of a written report made by a doctor containing the results of the examination. VeR is one of the five legal pieces of evidence in court. Making a VeR that is not following hospital procedures can lead to the submission of evidence in court proceedings. This study aims to determine the standard procedure for implementing medical information for VeR and the types of cases for which a VeR is requested. This type of research is a literature review using Google Scholar and Garuda databases with a boolean system strategy. The flow of the implementation of patient medical information for VeR begins with the police submitting a letter of request for VeR to the hospital administration by bringing the requirements of an official request letter from the director of the hospital. The visa request letter and the report are placed in the Medical Record Installation for further processing by the Medical Record. The types of cases requested for VeR are divided into two, namely for living victims and dead victims. Living victims are divided into injuries, sexual crimes, and psychiatric.Keywords: literature review, visum et repertum (VeR), fixed procedure, type of request. AbstrakVisum et repertum (VeR) merupakan surat keterangan medis yang sifatnya dipergunakan untuk kebutuhan peradilan berupa laporan tertulis yang dibuat oleh dokter yang memuat hasil pemeriksaan. Visum et Repertum merupakan salah satu dari lima alat bukti yang sah di pengadilan. Pembuatan visum et repertum yang tidak sesuai dengan prosedur tetap rumah sakit dapat menghambat penyampaian bukti dalam proses pengadilan. Penelitian bertujuan untuk mengetahui prosedur tetap pelaksanaan pelepasan informasi medis untuk keperluan visum et repertum serta jenis permintaan visum et repertum. Jenis penelitian adalah literature review menggunakan database Google Scholar dan Garuda dengan strategi boolean system. Alur pelaksanaan pelepasan informasi medis pasien untuk keperluan visum et repertum dimulai dengan pihak kepolisian menyerahkan surat permintaan visum et repertum ke bagian tata usaha Rumah Sakit dengan membawa persyaratan surat permohonan resmi dari kepolisian kepada direktur Rumah Sakit. Surat permintaan visum et repertum tersebut didisposisikan ke Instalasi Rekam Medis untuk selanjutnya diproses. Jenis kasus yang dimintakan visum et repertum dibagi menjadi dua, yaitu untuk korban hidup dan korban mati. Korban hidup terbagi menjadi perlukaan, kejahatan seksual, dan psikiatrik.Kata Kunci: literature review, visum et repertum, prosedur tetap, jenis permintaan

Complex Stochastic Boolean Systems: Comparing Bitstrings with the Same Hamming Weight

A complex stochastic Boolean system (CSBS) is a complex system depending on an arbitrarily large number n of random Boolean variables. CSBSs arise in many different areas of science and engineering. A proper mathematical model for the analysis of such systems is based on the intrinsic order: a partial order relation defined on the set 0,1n of all binary n-tuples of 0s and 1s. The intrinsic order enables one to compare the occurrence probabilities of two given binary n-tuples with no need to compute them, simply looking at the relative positions of their 0s and 1s. Regarding the analysis of CSBSs, the intrinsic order reduces the complexity of the problem from exponential (2n binary n-tuples) to linear (n Boolean variables). In this paper, using the intrinsic ordering, we compare the occurrence probabilities of any two binary n-tuples having the same number of 1-bits (i.e., the same Hamming weight). Our results can be applied to any CSBS with mutually independent Boolean variables.

How Frequently is a System of $2$-Linear Boolean Equations Solvable?

We consider a random system of equations $x_i+x_j=b_{(i,j)} ({\rm mod }2)$, $(x_u\in \{0,1\},\, b_{(u,v)}=b_{(v,u)}\in\{0,1\})$, with the pairs $(i,j)$ from $E$, a symmetric subset of $[n]\times [n]$. $E$ is chosen uniformly at random among all such subsets of a given cardinality $m$; alternatively $(i,j)\in E$ with a given probability $p$, independently of all other pairs. Also, given $E$, ${\rm Pr}\{b_{e}=0\}={\rm Pr}\{b_e=1\}$ for each $e\in E$, independently of all other $b_{e\prime}$. It is well known that, as $m$ passes through $n/2$ ($p$ passes through $1/n$, resp.), the underlying random graph $G(n,\#{\rm edges}=m)$, ($G(n,{\rm Pr}({\rm edge})=p)$, resp.) undergoes a rapid transition, from essentially a forest of many small trees to a graph with one large, multicyclic, component in a sea of small tree components. We should expect then that the solvability probability decreases precipitously in the vicinity of $m\sim n/2$ ($p\sim 1/n$), and indeed this probability is of order $(1-2m/n)^{1/4}$, for $m < n/2$ ($(1-pn)^{1/4}$, for $p < 1/n$, resp.). We show that in a near-critical phase $m=(n/2)(1+\lambda n^{-1/3})$ ($p=(1+\lambda n^{-1/3})/n$, resp.), $\lambda=o(n^{1/12})$, the system is solvable with probability asymptotic to $c(\lambda)n^{-1/12}$, for some explicit function $c(\lambda)>0$. Mike Molloy noticed that the Boolean system with $b_e\equiv 1$ is solvable iff the underlying graph is $2$-colorable, and asked whether this connection might be used to determine an order of probability of $2$-colorability in the near-critical case. We answer Molloy's question affirmatively and show that, for $\lambda=o(n^{1/12})$, the probability of $2$-colorability is ${}\lesssim 2^{-1/4}e^{1/8}c(\lambda)n^{-1/12}$, and asymptotic to $2^{-1/4}e^{1/8}c(\lambda)n^{-1/12}$ at a critical phase $\lambda=O(1)$, and for $\lambda\to -\infty$.

ALGORITHM COMPARING BINARY STRING PROBABILITIES IN COMPLEX STOCHASTIC BOOLEAN SYSTEMS USING INTRINSIC ORDER GRAPH

This paper deals with a special kind of complex systems which depend on an arbitrary (and usually large) number n of random Boolean variables. The so-called complex stochastic Boolean systems often appear in many different scientific, technical or social areas. Clearly, there are 2n binary states associated to such a complex system. Each one of them is given by a binary string u = (u1,…,un) ∈ {0, 1}n of n bits, which has a certain occurrence probability Pr {u}. The behavior of a complex stochastic Boolean system is determined by the current values of its 2n binary n-tuple probabilities Pr {u} and by the ordering between pairs of them. Hence, the intrinsic order graph provides a useful representation of these systems by displaying (scaling) the 2n binary n-tuples which are ordered in decreasing probability of occurrence. The intrinsic order reduces the complexity of the problem from exponential (2n binary n-tuples) to linear (n Boolean variables). For any fixed binary n-tuple u, this paper presents a new, simple algorithm enabling rapid, elegant determination of all the binary n-tuples v with occurrence probabilities less than or equal to (greater than or equal to) Pr {u}. This algorithm is closely related to the lexicographic (truth-table) order in {0, 1}n, and this is illustrated through the connections (paths) in the intrinsic order graph.

LEARNING OF FUZZY AUTOMATA

In this study, we revisit the well-known notion of fuzzy state machines and discuss their development through learning. The systematic development of fuzzy state machines has not been pursued as intensively as it could have been expected from the breadth of the possible usage of them as various modelling platforms. We concentrate on the generalization of the well known architectures exploited in Boolean system synthesis, namely Moore and Mealy machines and show how these can be implemented in terms of generic functional modules such as fuzzy JK flip-flops and fuzzy logic neurons (AND and OR neurons) organized in the form of logic processors. It is shown that the design of the fuzzy state machines can be accomplished through their learning. The detailed learning algorithm is presented and illustrated with a series of numeric examples. The study reveals an interesting option of constructing digital systems through learning: the original problem is solved in the setting of fuzzy state machines and afterwards "binarised" into the two-valued format realized via the standard digital hardware.