Bilangan Terhubung Titik Pelangi pada Graf Hasil Operasi Korona Graf Prisma (P_(m,2)) dan Graf Lintasan (P_3)

Rainbow vertex-connection number is the minimum k-coloring on the vertex graph G and is denoted by rvc(G). Besides, the rainbow-vertex connection number can be applied to some special graphs, such as prism graph and path graph. Graph operation is a method used to create a new graph by combining two graphs. Therefore, this research uses corona product operation to form rainbow-vertex connection number at the graph resulting from corona product operation of prism graph and path graph (Pm,2 P3) (P3 Pm,2). The results of this study obtain that the theorem of rainbow vertex-connection number at the graph resulting from corona product operation of prism graph and path graph (Pm,2 P3) (P3 Pm,2) for 3 = m = 7 are rvc (G) = 2m rvc (G) = 2.

CRBA: A Competitive Rate-Based Algorithm Based on Competitive Spiking Neural Networks

In this paper we present a Competitive Rate-Based Algorithm (CRBA) that approximates operation of a Competitive Spiking Neural Network (CSNN). CRBA is based on modeling of the competition between neurons during a sample presentation, which can be reduced to ranking of the neurons based on a dot product operation and the use of a discrete Expectation Maximization algorithm; the latter is equivalent to the spike time-dependent plasticity rule. CRBA's performance is compared with that of CSNN on the MNIST and Fashion-MNIST datasets. The results show that CRBA performs on par with CSNN, while using three orders of magnitude less computational time. Importantly, we show that the weights and firing thresholds learned by CRBA can be used to initialize CSNN's parameters that results in its much more efficient operation.

Acceleration of Inner-Pairing Product Operation for Secure Biometric Verification

With the recent advances in mobile technologies, biometric verification is being adopted in many smart devices as a means for authenticating their owners. As biometric data leakage may cause stringent privacy issues, many proposals have been offered to guarantee the security of stored biometric data, i.e., biometric template. One of the most promising solutions is the use of a remote server that stores the template in an encrypted form and performs a biometric comparison on the ciphertext domain, using recently proposed functional encryption (FE) techniques. However, the drawback of this approach is that considerable computation is required for the inner-pairing product operation used for the decryption procedure of the underlying FE, which is performed in the authentication phase. In this paper, we propose an enhanced method to accelerate the inner-pairing product computation and apply it to expedite the decryption operation of FE and for faster remote biometric verification. The following two important observations are the basis for our improvement—one of the two arguments for the decryption operation does not frequently change over authentication sessions, and we only need to evaluate the product of multiple pairings, rather than individual pairings. From the results of our experiments, the proposed method reduces the time required to compute an inner-pairing product by 30.7%, compared to the previous best method. With this improvement, the time required for biometric verification is expected to decrease by up to 10.0%, compared to a naive method.

IMPLEMENTASI MCCALL’S FRAMEWORK DALAM PENGUJIAN KUALITAS PERANGKAT LUNAK (STUDI KASUS PORTAL KULIAH KERJA NYATA UNIVERSITAS RIAU)

Quality test is a crucial phase in the system development process to ensure that system work as its requirement. Therefore, the Portal Kukerta (Kuliah Kerja Nyata) Universitas Riau, an information system to manage data and activities of Kukerta, needs to assess. In this research, Portal Kukerta has been assessed using the McCalls software quality framework. The aspect that is focused on this research is product operation. Product operation consists of correctness, usability, integrity, reliability, and efficiency. The data collected by distributing questionnaires to 67 participants. The results show that users give a positive response to two aspects, namely efficiency 99.90% and usability 64%. However, for the reliability factor 43%, correctness 48%, integrity 56% get a neutral value that there are aspects that are considered less by the user. Based on these results, it can be concluded that the Kukerta portal is very efficient in managing the data of Kukerta University of Riau and can be easily used by users. However, in terms of reliability, correction, and integrity need to be improved. The implication of the research are (1) providing a reference in assessing quality of a software and (2) specifically providing a recommendation for Portal Kukerta Universitas Riau for their system improvements.

A class of continuous non-associative algebras arising from algebraic groups including

We give a construction that takes a simple linear algebraic group G over a field and produces a commutative, unital, and simple non-associative algebra A over that field. Two attractions of this construction are that (1) when G has type $E_8$ , the algebra A is obtained by adjoining a unit to the 3875-dimensional representation; and (2) it is effective, in that the product operation on A can be implemented on a computer. A description of the algebra in the $E_8$ case has been requested for some time, and interest has been increased by the recent proof that $E_8$ is the full automorphism group of that algebra. The algebras obtained by our construction have an unusual Peirce spectrum.