• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.540-543
• /
• 2013

This paper describes an implementation of a unified ALU on multi-core GPGPU based on SIMT architecture. Our unified ALU can operate conditional branch instructions, data movement instructions, integer arithmetic instructions and floating-point arithmetic instructions. Since multi-core GPGPU contains a lot of ALU for parallel processing of various types, the main point of this paper is to design the minimum size ALU by unifying similar processing of each operations on circit level. All instrunctions were tested by making a test program. And we compare this results with results of CPU operations to verify our ALU. Our unified ALU's gate size is approximately 20,000 and the maximum operation frequency is 430MHz.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11B
• /
• pp.663-672
• /
• 2007

This paper proposes an algorithm for design of a multiple ring network that can be applied to an arbitrary topology in the WDM optical transport networks. Especially, we suggest an integer linear program(ILP) formulation with the objective of minimizing the total cost of nodes based on the reconfigurable OADM(ROADM) architecture and propose a heuristic algorithm to reduce computational complexity of the exact problem formulation. To evaluate the performance and validity of this scheme, we applied it to an NSFnet topology assuming the dynamic or static traffic condition and compared it with a mesh methodology about capacity of connection requests and the total cost of the nodes.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1681-1693
• /
• 1997

In a distributed system, the simple file allocation problem determines the placement of copies of a file, so as to minimize the operating costs. The simple file allocation problem assumes the cost parameters to be fixed. In practice, these parameters change over time. In this research, dynamic file allocation problem for both single and multiple files are considered, which account for these changing parameters. A model for dynamic file allocation problem is formulated as a mixed integer program for which Lagrangian relaxation based branch-and-bound algorithm is developed. This algorithms is implemented and its efficiency is tested on medium to large test problems.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.655-664
• /
• 2002

The focus of quality-of-service routing has been on the routing of a single path satisfying specified QoS constraints. However upon failure of a node or link on the path, a new path (backup path) satisfying the constraints has to be established. This paper proposed the fault recovery QoS Rerouting algorithms to recovery the service of applications under fault environment of network. For this, we describes the generation method of PFC (Protection Fundamental Cycle) protecting all of network nodes and suggests path selection algorithms using minimization rerouting cost problem and analyzes the performances of these.

• Honam Mathematical Journal
• /
• v.41 no.3
• /
• pp.569-579
• /
• 2019

Cusp (parabolic) points in the extended modular group ${\bar{\Gamma}}$ are basically the images of infinity under the group elements. This implies that the cusp points of ${\bar{\Gamma}}$ are just rational numbers and the set of cusp points is $Q_{\infty}=Q{\cup}\{{\infty}\}$.The Farey graph F is the graph whose set of vertices is $Q_{\infty}$ and whose edges join each pair of Farey neighbours. Each rational number x has an integer continued fraction expansion (ICF) $x=[b_1,{\cdots},b_n]$. We get a path from ${\infty}$ to x in F as $<{\infty},C_1,{\cdots},C_n>$ for each ICF. In this study, we investigate relationships between Fibonacci numbers, Farey graph, extended modular group and ICF. Also, we give a computer program that computes the geodesics, block forms and matrix represantations.

• Journal of Multimedia Information System
• /
• v.9 no.3
• /
• pp.233-244
• /
• 2022

A MATLAB program was developed to calculate the half-wavelength of a sine-curve baseband signal with white noise by using an autocorrelation function, a SG filter, and zero-crossing detection. The frequency of the input signal can be estimated from 1) the first zero-crossing (corresponding to ¼λ) and 2) the R value (the Y axis of the correlogram) at the center of the segment. Thereby, the frequency information of the preceding segment can be obtained. If the segment size were optimized, and a portion with a large zero-crossing dynamic range were obtained, the frequency discrimination ability would improve. Furthermore, if the values of the correlogram for each frequency prepared on the CPU side were prepared in a table, the volume of calculations can be reduced by 98%. As background, period detection by autocorrelation coefficients requires an integer multiple of 1/2λ (when using a sine wave as the object of the autocorrelation function), otherwise the correlogram drawn by R value will not exhibit orthogonality. Therefore, it has not been used in bio-telemetry where the frequencies move around.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.11
• /
• pp.3204-3217
• /
• 2023

In this paper, the downlink of the multicast based spatial modulation systems is investigated. Specifically, physical layer multicasting is introduced to increase the number of access users and to improve the communication rate of the spatial modulation system in which only single radio frequency chain is activated in each transmission. To minimize the bit error rate (BER) of the multicast based spatial modulation system, a joint optimizing algorithm of antenna selection and multicast precoding is proposed. Firstly, the joint optimization is transformed into a mixed-integer non-linear program based on single-stage reformulation. Then, a novel iterative algorithm based on the idea of branch and bound is proposed to obtain the quasioptimal solution. Furthermore, in order to balance the performance and time complexity, a low-complexity deflation algorithm based on the successive convex approximation is proposed which can obtain a sub-optimal solution. Finally, numerical results are showed that the convergence of our proposed iterative algorithm is between 10 and 15 iterations and the signal-to-noise-ratio (SNR) of the iterative algorithm is 1-2dB lower than the exhaustive search based algorithm under the same BER accuracy conditions.

• Clinical and Experimental Pediatrics
• /
• v.60 no.11
• /
• pp.353-358
• /
• 2017

Purpose: To develop and evaluate a simple screening tool to assess hearing loss in newborns. A derived score was compared with the standard clinical practice tool. Methods: This cohort study was designed to screen the hearing of newborns using transiently evoked otoacoustic emission and auditory brain stem response, and to determine the risk factors associated with hearing loss of newborns in 3 tertiary hospitals in Northern Thailand. Data were prospectively collected from November 1, 2010 to May 31, 2012. To develop the risk score, clinical-risk indicators were measured by Poisson risk regression. The regression coefficients were transformed into item scores dividing each regression-coefficient with the smallest coefficient in the model, rounding the number to its nearest integer, and adding up to a total score. Results: Five clinical risk factors (Craniofacial anomaly, Ototoxicity, Birth weight, family history [Relative] of congenital sensorineural hearing loss, and Apgar score) were included in our COBRA score. The screening tool detected, by area under the receiver operating characteristic curve, more than 80% of existing hearing loss. The positive-likelihood ratio of hearing loss in patients with scores of 4, 6, and 8 were 25.21 (95% confidence interval [CI], 14.69-43.26), 58.52 (95% CI, 36.26-94.44), and 51.56 (95% CI, 33.74-78.82), respectively. This result was similar to the standard tool (The Joint Committee on Infant Hearing) of 26.72 (95% CI, 20.59-34.66). Conclusion: A simple screening tool of five predictors provides good prediction indices for newborn hearing loss, which may motivate parents to bring children for further appropriate testing and investigations.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.1
• /
• pp.148-154
• /
• 2020

This study examines room assignments to improve accessibility in a university dormitory depending on the student grade, taking into account frequency of using a certain common space. An integer programming model is presented to minimize the total moving distance from the common space to the students' rooms for accessibility. The model also constrains the maximum capacity of a room, and disallows different grade students to be assigned to the same room. This model is similar to a facility location problem used widely in the supply chain management field. Applying our optimization model to a small group at the dormitory of Unversity A as the case study, our results indicate that lower grade students are assigned rooms closer to the common space due to their higher frequency of using that space to guarantee high accessibility. Moreover, if higher grade students are prioritized to select their rooms, we suggest an objective function that imposes a penalty in cases when lower grade students select rooms with priority. Based on the results obtained, we propose assigning rooms to students in a dormitory by considering their complex requirements and convenience to use the common space.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.9A
• /
• pp.1452-1460
• /
• 2000

A series of papers in recent literature on logical topology design for wavelength routed optical networks have proposed mathematical models and solution methods unifying logical topology design wavelength assignment and traffic routing. The most recent one is by Krishnaswamy and Sivarajan which is more unifying and complete than the previous models. Especially the mathematical formulation is an integer linear program and hence regarded in readiness for an efficient solution method compared to the previous nonlinear programming models. The solution method in [7] is however elementary one relying on the rounding of linear program relaxation. When the rounding happens to be successful it tends to produce near-optimal solutions. In general there is no such guarantee so that the obtained solution may not satisfy the essential constraints such as logical -path hop-count and even wavelength number constraints. Also the computational efforts for linear program relaxation seems to be too excessive. In this paper we propose an improved and unifying solution method based on the same to be too excessive. In this paper we propose an improved and unifying solution method based on the same model. First its computation is considerably smaller. Second it guarantees the solution satisfies all the constraints. Finally applied the same instances the quality of solution is fairly competitive to the previous near optimal solution.