• Journal of the Korean Mathematical Society
• /
• v.47 no.3
• /
• pp.601-631
• /
• 2010

In [6] and [7], we introduced graph von Neumann algebras which are the (groupoid) crossed product algebras of von Neumann algebras and graph groupoids via groupoid actions. We showed that such crossed product algebras have the graph-depending amalgamated reduced free probabilistic properties. In this paper, we will consider a scalar-valued $W^*$-probability on a given graph von Neumann algebra. We show that a diagonal graph $W^*$-probability space (as a scalar-valued $W^*$-probability space) and a graph W¤-probability space (as an amalgamated $W^*$-probability space) are compatible. By this compatibility, we can find the relation between amalgamated free distributions and scalar-valued free distributions on a graph von Neumann algebra. Under this compatibility, we observe the scalar-valued freeness on a graph von Neumann algebra.

• Journal of the Korean Statistical Society
• /
• v.23 no.2
• /
• pp.513-522
• /
• 1994

A multi-dimensional design is most easily constructed via the amalgamation of one-dimensional component block designs. However, not all sets of component designs are compatible to be amalgamated. The conditions for compatibility are related to the concept of a complete matching in a graph. In this paper, we give sufficient conditions for unequal-replicate designs. Two types of conditions are proposed; one is based on the number of verices adjacent to at least one vertex and the other is ona a degree of vertex, in a bipartite graph. The former is an extension of the sufficient conditions of equal-replicate designs given by Dean an Lewis (1988).

• Honam Mathematical Journal
• /
• v.41 no.3
• /
• pp.595-607
• /
• 2019

We consider quasigroups $Q({\Gamma})$ obtained as certain double covers of the symmetric group $S_3$ of degree 3, for directed graphs ${\Gamma}$ on the vertex set $S_3$. We completely characterize the strong compatibility of elements of $Q({\Gamma})$ for any quasigroup nonuniform homogeneous space of degree 4. For such homogeneous spaces, we classify all the strong and weak compatibility graphs of $Q({\Gamma})$.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.4
• /
• pp.17-29
• /
• 1999

This paper presents a high level synthesis method targeting low power consumption for data-dominated CMOS circuits (e.g., DSP). The high level synthesis is divided into three basic tasks: scheduling, resource and register allocation. For lower power scheduling, we increase the possibility of reusing an input operand of functional units. For a scheduled data flow graph, a compatibility graph for register and resource allocation is formed, and then a special weighted network is then constructed from the compatibility graph and the minimum cost flow algorithm is performed on the network to obtain the minimum power consumption data path assignment. The formulated problem is then solved optimally in polynomial time. This method reduces both the switching activity and the capacitance in synthesized data path. Experimental results show 15% power reduction in benchmark circuits.

• Journal of Korea Multimedia Society
• /
• v.13 no.5
• /
• pp.792-801
• /
• 2010

In this paper, we introduce a novel scene graph library for mobile platforms, called the 'Mobile OpenSceneGraph (Mobile OSG)', as a mobile graphics middleware. Our mobile scene graph library supports several nice properties, including platform-independence, extensibility, touch-based UI supports, and compatibility, by carefully adapting the OpenSceneGraph library, one of the most widely used graphics middlewares for desktop platforms, to mobile platforms. We validate the usefulness of the proposed library for mobiles with the several experimental results including real-time rendering, camera manipulations with a touch-based UI, and animations with switching geometric nodes.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.4
• /
• pp.44-48
• /
• 1998

In this paper proposed Component Synthesis Algorithm(CSA) for mapping described HDL to RT component of given library. CSA transform I/O variables of HDL and relation of operators to control/data flow graph(CDFG) that consists of graph, reduce the size of graph, compute the cost, the bound, and the method that use compatibility graph(CG), and then mapping to component. Component synthesis used branch-and-bound algorithm. The result that synthesis using CSA algorithm was proved that this result and the cost of the manual were indentified.

• Journal of applied mathematics & informatics
• /
• v.33 no.5_6
• /
• pp.545-557
• /
• 2015

A vague graph is a generalized structure of a fuzzy graph that gives more precision, flexibility and compatibility to a system when compared with systems that are designed using fuzzy graphs. In this paper, we define two new operation on vague graphs namely normal product and tensor product and study about the degree of a vertex in vague graphs which are obtained from two given vague graphs G₁ and G₂ using the operations cartesian product, composition, tensor product and normal product. These operations are highly utilized by computer science, geometry, algebra, number theory and operation research. In addition to the existing operations these properties will also be helpful to study large vague graph as a combination of small, vague graphs and to derive its properties from those of the smaller ones.

• Journal of Korean Society of Water and Wastewater
• /
• v.28 no.6
• /
• pp.647-655
• /
• 2014

To perform long-term sewer monitoring, It is important to understand the nature of the wastewater flow that occurs at the point on early stage of the monitor and to prevent in advance a problem which may caused. We can infer the flow properties and external factors by analyzing the scatter graph obtained from the measured data flow rate monitoring data since an field external factor affecting the sewage flow is reflected in the flow rate monitoring data. In this study, Selecting the three points having various external factors, and we Inferred the sewer flow characteristics from depth-velocity scatter graph and determined the analysis equation for the dry-weather flow rate data. At the'point 1' expected non-pressure flow, we were able to see the drawdown effect caused by the free fall in the manhole section. At the'point 2', existed weir and sediments, there was backwater effect caused by them, and each of size calculated from the scatter graph analysis were 400 mm and 130 mm. At the'Point 3', there is specific flow pattern that is coming from flood wave propagation generated by the pump station at upstream. In common, adequate equations to explain the dry weather flow data are flume equation and modified manning equation(SS method), and the equations had compatibility for explaining the data because all of $R^2$ values are over 0.95.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.6
• /
• pp.20-29
• /
• 1998

This paper proposes the algorithms that design the highly parallel multiple-valued logic curcuit and assign the code to each node of DCG(Directed Cyclic Graph) of length 1. The conventional Nakajima's algorithm have some problems, so this paper introduce the matrix equation from DCG of length 1 and proposes circuit design algorithms according to the DCG of length 1. Using the proposed circuit design algorithms in this paper, it become realized that was not able to design from Nakajima's algorithm. Also, making a comparision between the circuit design using Nakajima's algorithm and this paper's, we testify that proposed paper's algorithm is able to realize more optimized circuit design. According to proposed curcuit design algorithm in this paper, it is possible to design curcuit that DCG have natural number, so it have the following advantages; reduction of the curcuit input/output digits, simplification of curcuit composition, reduction of computation time and cost. And we show compatibility and verification about this paper's algorithm.

• Advances in Computational Design
• /
• v.1 no.4
• /
• pp.297-313
• /
• 2016

The flexural strength of circular concrete-filled tubes (CCFT) can be estimated by several codes such as ACI, AISC, and Eurocode 4. In AISC and Eurocode, two methods are recommended, which are the strain compatibility method (SCM) and the plastic stress distribution method (PSDM). The SCM of AISC is almost the same as the SCM of the ACI method, while the SCM of Eurocode is similar to the ACI method. Only the assumption of the compressive stress of concrete is different. The PSDM of Eurocode approach is also similar to the PSDM of AISC, but they have different definitions of material strength. The PSDM of AISC is relatively easier to use, because AISC provides closed-form equations for calculating the flexural strength. However, due to the complexity of calculation of circular shapes, it is quite difficult to determine the flexural strength of CCFT following other methods. Furthermore, all these methods give different estimations. In this study, an effort is made to review and compare the codes to identify their differences. The study also develops a computing program for the flexural strength of circular concrete filled tubes under pure bending that is in accordance with the codes. Finally, the developed computing algorithm, which is programmed in MATLAB, is used to generate design aid graphs for various steel grades and a variety of strengths of steel and concrete. These design aid graphs for CCFT beams can be used as a preliminary design tool.