• Journal of applied mathematics & informatics
• /
• v.41 no.2
• /
• pp.321-330
• /
• 2023

Let G = (V, E) be a graph. Consider the group S₃. Let g : V (G) → S₃ be a function. For each edge xy assign the label 1 if ${\lceil}{\frac{o(g(x))+o(g(y))}{2}}{\rceil}$ is odd or 0 otherwise. g is a group S₃ mean cordial labeling if |v_g(i) - v_g(j)| ≤ 1 and |e_g(0) - e_g(1)| ≤ 1, where vg(i) and e_g(y)denote the number of vertices labeled with an element i and number of edges labeled with y (y = 0, 1). The graph G with group S₃ mean cordial labeling is called group S₃ mean cordial graph. In this paper, we discuss group S3 mean cordial labeling for star related graphs.

• Journal of applied mathematics & informatics
• /
• v.5 no.3
• /
• pp.571-584
• /
• 1998

We look for methods and conditions to make use of cyclicity in come matrix problems not only for parallel computa-tion but also to reduce the problem size and accelerate convergence. It has been shown that some form of reducibility not necessarily cyclicity is enough for such purposes.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.5
• /
• pp.564-568
• /
• 2011

Microblogs became popular information delivery ways due to the spread of smart phones. They have the characteristic of reflecting the interests of users more quickly than other medium. Particularly, in case of the subject which attracts many users, microblogs can supply rich information originated from various information sources. Nevertheless, it has been considered as a hard problem to obtain useful information from microblogs because too much noises are in them. So far, various methods are proposed to extract and track some subjects from particular documents, yet these methods do not work effectively in case of microblogs which consist of short phrases. In this paper, we propose a graph-based topic extraction and partitioning method to understand interests of users about a certain keyword. The proposed method contains the process of generating a keyword graph using the co-occurrences of terms in the microblogs, and the process of splitting the graph by using a network partitioning method. When we applied the proposed method on some keywords. our method shows good performance for finding a topic about the keyword and partitioning the topic into sub-topics.

• Journal of KIISE:Information Networking
• /
• v.28 no.3
• /
• pp.447-453
• /
• 2001

In this paper, we consider the scheduling of SE(switching element)-disjoint multicasting in photonic Banyan-type switching networks constructed with directional couplers. This ensures that at most, one connection holds each SE in a given time thus, neither crosstalk nor blocking will arise in the network. Such multicasting usually takes several routing rounds hence, it is desirable to keep the number of rounds(i.e., scheduling length) to a minimum. We first present the necessary and sufficient condition for connections to pass through a common SE(i.e., make crosstalk) in the photonic Banyan-type networks capable of supporting one-to-many connections. With definition of uniquely splitting a multicast connection into distinct subconnections, the crosstalk relationship of a set of connections is represented by a graph model. In order to analyze the worst case crosstalk we characterize the upper bound on the degree of the graph. The successor paper(Part II)[14] is devoted to the scheduling algorithm and the upper bound on the scheduling length. Comparison with related results is made in detail.

• Journal of Communications and Networks
• /
• v.13 no.6
• /
• pp.664-677
• /
• 2011

In order to control interference and improve spectrum efficiency in the femtocell and macrocell overlaid system (FMOS), we propose a joint frequency bandwidth dynamic division, clustering and power control algorithm (JFCPA) for orthogonal-frequency-division-multiple access-based downlink FMOS. The overall system bandwidth is divided into three bands, and the macro-cellular coverage is divided into two areas according to the intensity of the interference from the macro base station to the femtocells, which are dynamically determined by using the JFCPA. A cluster is taken as the unit for frequency reuse among femtocells. We map the problem of clustering to the MAX k-CUT problem with the aim of eliminating the inter-femtocell collision interference, which is solved by a graph-based heuristic algorithm. Frequency bandwidth sharing or splitting between the femtocell tier and the macrocell tier is determined by a step-migration-algorithm-based power control. Simulations conducted to demonstrate the effectiveness of our proposed algorithm showed the frequency-reuse probability of the FMOS reuse band above 97.6% and at least 70% of the frequency bandwidth available for the macrocell tier, which means that the co-tier and the cross-tier interference were effectively controlled. Thus, high spectrum efficiency was achieved. The simulation results also clarified that the planning of frequency resource allocation in FMOS should take into account both the spatial density of femtocells and the interference suffered by them. Statistical results from our simulations also provide guidelines for actual FMOS planning.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.12
• /
• pp.209-218
• /
• 2012

Recently, the Field Programmable Stateful Logic Array (FPSLA) was proposed as one of the most promising system integration technologies which will extend the life of the Moore's law. This work is the first proposal of the FPSLA design automation flow, and the approaches to logic synthesis, synchronization, physical mapping, and automatic placement of the FPSLA designs. The synchronization at each gate for pipelining determines the x-coordinates of cells, and reduces the placement to 1-dimensional problems. The objective function and its gradients for the non-linear optimization of the net length and placement density have been remodeled for the reduced global placement problem. Also, a recursive algorithm has been proposed to legalize the placement by relaxing the density overflow of bipartite bin groups in a top-down hierarchical fashion. The proposed model and algorithm are implemented, and validated by applying them to the ACM/SIGDA benchmark designs. The output state of a gate in an FPSLA needs to be duplicated so that each fanout gate can be connected to a dedicated copy. This property has been taken into account by merging the duplicated nets into a hyperedge, and then, splitting the hyperedge into edges as the optimization progresses. This yields additional 18.4% of the cell count reduction in the most dense logic stage. The practicality of the FPSLA can be further enhanced primarily by incorporating into the logic synthesis the constraint to avoid the concentrated fains of gates on some logic stages. In addition, an efficient algorithm needs to be devised for the routing problem which is based on a complicated graph. The graph models the nanowire crossbar which is trimmed to be embedded into the FPSLA fabric, and therefore, asymmetric. These CAD tools can be used to evaluate the fabric efficiency during the architecture enhancement as well as automate the design.

• Korean Journal of Mineralogy and Petrology
• /
• v.33 no.3
• /
• pp.273-291
• /
• 2020

The strength characteristics of the three orthogonal splitting planes, known as rift, grain and hardway planes in granite quarries, were examined. R, G and H specimens were obtained from the block samples of Jurassic granites in Geochang and Hapcheon areas. The directions of the long axes of these three specimens are perpendicular to each of the three planes. First, The chart, showing the scaling characteristics of three graphs related to the uniaxial compressive strengths of R, G and H specimens, were made. The graphs for the three specimens, along with the increase of strength, are arranged in the order of H < G < R. The angles of inclination of the graphs for the three specimens, suggesting the degree of uniformity of the texture within the specimen, were compared. The above angles for H specimens(θ^H, 24.0°~37.3°) are the lowest among the three specimens. Second, the scaling characteristics related to the three graphs of RG, GH and RH specimens, representing a combination of the mean compressive strengths of the two specimens, were derived. These three graphs, taking the various N-shaped forms, are arranged in the order of GH < RH < RG. Third, the correlation chart between the strength difference(Δσ_t) and the angle of inclination(θ) was made. The above two parameters show the correlation of the exponential function with an exponent(λ) of -0.003. In both granites, the angle of inclination(θ^RH) of the RH-graph is the lowest. Fourth, the six types of charts, showing the correlations among the three kinds of compressive strengths for the three specimens and the five parameters for the two sets of microcracks aligned parallel to the compressive load applied to each specimen, were made. From these charts for Geochang and Hapcheon granites, the mean value(0.877) of the correlation coefficients(R²) for total density(Lt), along with the frequency(N, 0.872) and density(ρ, 0.874), is the highest. In addition, the mean values(0.829) of correlation coefficients associated with the mean compressive strengths are more higher than the minimum(0.768) and maximum(0.804) compression strengths of three specimens. Fifth, the distributional characteristics of the Brazilian tensile strengths measured in directions parallel to the above two sets of microcracks in the three specimens from Geochang granite were derived. From the related chart, the three graphs for these tensile strengths corresponding to the R, G and H specimens show an order of H(R1+G1) < G(R2+H1) < R(R1+G1). The order of arrangement of the three graphs for the tensile strengths and that for the compressive strengths are mutually consistent. Therefore, the compressive strengths of the three specimens are proportional to the three types of tensile strengths. Sixth, the values of correlation coefficients, among the three tensile strengths corresponding to each cumulative number(N=1~10) from the above three graphs and the five parameters corresponding to each graph, were derived. The mean values of correlation coefficients for each parameter from the 10 correlation charts increase in the order of density(0.763) < total length(0.817) < frequency(0.839) < mean length(Lm, 0.901) ≤ median length(Lmed, 0.903). Seventh, the correlation charts among the compressive strengths and tensile strengths for the three specimens were made. The above correlation charts were divided into nine types based on the three kinds of compressive strengths and the five groups(A~E) of tensile strengths. From the related charts, as the tensile strength increases with the mean and maximum compressive strengths excluding the minimum compressive strength, the value of correlation coefficient increases rapidly.