• Journal of applied mathematics & informatics
• /
• v.23 no.1_2
• /
• pp.489-496
• /
• 2007

Let g be a continuous function on an interval I which is not constant on any subinterval of I, and let ${\mu}$ be a Borel measure on I. In this paper we give a necessary and sufficient conditions guaranteeing, for the strongly measurable function f on I with values in a Banach space X, the existence of a continuous primitive function F on I with respect to g.

• Korean Journal of Computational Design and Engineering
• /
• v.13 no.3
• /
• pp.187-199
• /
• 2008

This paper describes a C++ class hierarchy of implicit objects for geometry modeling and processing. This class structure provides a software kernel for integrating many various models and methods found in current implicit modeling areas. The software kernel includes primitive objects playing a role of unit element in creating a complex shape, and operator objects used to construct more complex shape of implicit object formed with the primitive objects and other operators. In this paper, class descriptions of these objects are provided to better understand the details of the algorithm or implementation, and its instance examples to show the capabilities of the object classes for constructive shape geometry. In addition, solid modeling system shown as an application example demonstrates that the proposed implicit object classes allow us to carry out modern solid modeling techniques, which means they have the capabilities to extend to various applications.

• The Journal of Natural Sciences
• /
• v.8 no.2
• /
• pp.69-75
• /
• 1996

This paper presents a VLSI architecture for the efficient implementation of the real time multi-dimensional digital filter. The computational primitive for the filter is obtained from the state space representation of the multi-dimensional general order filter. The computational primitive is used for the data path of the processor.

• 한국전산유체공학회:학술대회논문집
• /
• 2008.08a
• /
• pp.36.4-36.4
• /
• 2008

• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.461-470
• /
• 2007

In CRYPTO 1995, Bellare, $Gu\'{e}rin$, and Rogaway proposed a very efficient message authentication scheme. This scheme is secure against adaptive chosen message attacks, under the assumption that its underlying primitive is a pseudorandom function. This article studies how to weaken that assumption. For an adaptive chosen message attack, we take into account two scenarios. On the one hand, the adversary intercepts the authenticated messages corresponding to messages chosen adaptively by herself, so the verifier does not receive them. On the other hand, the adversary can only eavesdrop the authenticated messages corresponding to messages chosen adaptively by herself, so the verifier receives them. We modify the original scheme. In the first scenario, our scheme is secure if the underlying primitive is a pseudorandom function. In the second scenario, our scheme is still secure under a weaker assumption that the underlying primitive is an indistinguishable-uniform function.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2003.10a
• /
• pp.437-443
• /
• 2003

The object of this paper is the treatment of how to make the vorticity boundary condition instead of pressure in the primitive variable case. An improved algorithm for solving the vorticity-stream function equation is presented. The linear finite element approximation for the solution of Wavier-Stokes and Stokes flows is constructed. Not only regular domain but also complicate domain can be analyze d, using this formulation.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.287-300
• /
• 2005

In this paper, we analyze Pseudo-Noise (PN) sequences generated by a maximum-length 90/150 Null Boundary Cellular Automata and we give the relationship among minimum offsets.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.217-227
• /
• 2005

Let G be a finite group and $\#$Cent(G) denote the number of centralizers of its elements. G is called n-centralizer if $\#$Cent(G) = n, and primitive n-centralizer if $\#$Cent(G) = $\#$Cent($\frac{G}{Z(G)}$) = n. In this paper we investigate the structure of finite groups with at most 21 element centralizers. We prove that such a group is solvable and if G is a finite group such that G/Z(G)$\simeq$$A_5$, then $\#$Cent(G) = 22 or 32. Moreover, we prove that As is the only finite simple group with 22 centralizers. Therefore we obtain a characterization of As in terms of the number of centralizers

• ETRI Journal
• /
• v.39 no.1
• /
• pp.116-123
• /
• 2017

Message-locked encryption (MLE) is a widespread cryptographic primitive that enables the deduplication of encrypted data stored within the cloud. Practical client-side contributions of MLE, however, are vulnerable to a poison attack, and server-side MLE schemes require large bandwidth consumption. In this paper, we propose a new client-side secure deduplication method that prevents a poison attack, reduces the amount of traffic to be transmitted over a network, and requires fewer cryptographic operations to execute the protocol. The proposed primitive was analyzed in terms of security, communication costs, and computational requirements. We also compared our proposal with existing MLE schemes.

• Journal of applied mathematics & informatics
• /
• v.8 no.3
• /
• pp.773-793
• /
• 2001

The explicit expressions for the 2n+1 primitive idempotents in R/sub pⁿ/ = F[x]/< x/sup pⁿ/ -1>, where F is the field of prime power order q and the multiplicative order of q modulo pⁿ is ø(pⁿ)/2(n≥1 and p is an odd prime), are obtained. An algorithm for computing the generating polynomials of the minimal QR cyclic codes of length pⁿ, generated by these primitive idempotents, is given and hence some bounds on the minimum distance of some QR codes of prime length over GF(q)(q=2, 3, ...) are obtained.