• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.6
• /
• pp.55-60
• /
• 2023

When performing the multiplication m×r=p of two binary numbers m and r on a computer, there is a shift-and-add(SA) method in which no time-consuming multiplication is performed, but only addition and shift-right(SR). SA is a very simple method in which when the value of the multiplier r_i is 0, the result p is only SR with m×0=0, and when r_i is 1, the result p=p+m is performed with m×1=m, and p is SR. In SA, the number of SRs can no longer be shortened, and the improvement part is whether the number of additions is shortened. This paper proposes an SA method to minimize addition based on the fact that setting a smaller number to r when converted to a binary number to be processed by a computer can significantly reduce the number of additions compared to the case of setting a smaller number to r based on the decimals that humans perform. The number of additions to the proposed algorithm was compared for four cases with signs (-,-), (-,+), (+,-), and (+,+) for some numbers in the range [-127,128]. The conclusion obtained from the experiment showed that when determining m and r, it should be determined as a binary number rather than a decimal number.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.5
• /
• pp.151-158
• /
• 2023

The researchers entirely focused on meta-heuristic method for generalized assignment problem(GAP) that is known as NP-hard problem because of the optimal solution within polynomial time algorithm is unknown yet. On the other hand, this paper proposes a heuristic greedy algorithm with rules for finding solutions. Firstly, this paper reduces the weight matrix of original data to w_ij ≤ b_i/l in order to n jobs(items) pack m machines(bins) with l = n/m. The maximum profit of each job was assigned to the machine for the reduced data. Secondly, the allocation was adjusted so that the sum of the weights assigned to each machine did not exceed the machine capacity. Finally, the k-opt swap optimization was performed to maximize the profit. The proposed algorithm is applied to 50 benchmarking data, and the best known solution for about 1/3 data is to solve the problem. The remaining 2/3 data showed comparable results to metaheuristic techniques. Therefore, the proposed algorithm shows the possibility that rules for finding solutions in polynomial time exist for GAP. Experiments demonstrate that it can be a P-problem from an NP-hard.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.2
• /
• pp.99-104
• /
• 2024

In the deficiency of an exact solution yielding algorithm, approximate algorithms remain as a solely viable option to the Minimum Linear Arrangement(MinLA) problem of Binary tree. Despite repeated attempts by a number of algorithm on k = 10, only two of them have been successful in yielding the optimal solution of 3,696. This paper therefore proposes an algorithm of O(n) complexity that delivers the exact solution to the binary tree. The proposed algorithm firstly employs an In-order search method by which n = 2^k - 1 number of nodes are assigned with a distinct number. Then it reassigns the number of all nodes that occur on level 2 ≤ 𝑙 ≤ k-2, (k = 5) and 2 ≤ 𝑙 ≤ k-3, (k = 6), including that of child of leaf node. When applied to k=5,6,7, the proposed algorithm has proven Chung[14]'s S^(k)_min=2^k-1+4+S^(k-1)_min+2S^(k-2)_min conjecture and obtained a superior result. Moreover, on the contrary to existing algorithms, the proposed algorithm illustrates a detailed assignment method. Capable of expeditiously obtaining the optimal solution for the binary tree of k > 10, the proposed algorithm could replace the existing approximate algorithms.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.2
• /
• pp.105-111
• /
• 2024

This paper deals with the minimum linear arrangement(MinLA) of a lattice graph, to which an approximate algorithm of linear complexity O(n) remains as a viable solution, deriving the optimal MinLA of 31,680 for 33×33 lattice. This paper proposes a partitioning arrangement algorithm of complexity O(1) that delivers exact solution to the minimum linear arrangement. The proposed partitioning arrangement algorithm could be seen as loading boxes into a container. It firstly partitions m rows into r₁,r₂,r₃ and n columns into c₁,c₂,c₃, only to obtain 7 containers. Containers are partitioning with a rule. It finally assigns numbers to vertices in each of the partitioned boxes location-wise so as to obtain the MinLA. Given m,n≥11, the size of boxes C₂,C₄,C₆ is increased by 2 until an increase in the MinLA is detected. This process repeats itself 4 times at maximum given m,n≤100. When tested to lattice in the range of 2≤n≤100, the proposed algorithm has proved its universal applicability to lattices of both m=n and m≠n. It has also obtained optimal results for 33×33 and 100×100 lattices superior to those obtained by existing algorithms. The minimum linear arrangement algorithm proposed in this paper, with its simplicity and outstanding performance, could therefore be also applied to the field of Very Large Scale Integration circuit where m,n are infinitely large.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.1
• /
• pp.37-42
• /
• 2024

This paper suggests polynomial time algorithm for cutwidth minimization problem that classified as NP-complete because the polynomial time algorithm to find the optimal solution has been unknown yet. To find the minimum cutwidth CW_f(G)=max_𝜈∈_VCW_f(𝜈)for given graph G=(V,E),m=｜V｜, n=｜E｜, the proposed algorithm divides neighborhood N_G[𝜈_i] of the maximum degree vertex 𝜈_i in graph G into left and right and decides the vertical cut plane with minimum number of edges pass through the vertex 𝜈_i firstly. Then, we split the left and right N_G[𝜈_i] into horizontal sections with minimum pass through edges. Secondly, the inner-section vertices are connected into line graph and the inter-section lines are connected by one line layout. Finally, we perform the optimization process in order to obtain the minimum cutwidth using vertex moving method. Though the proposed algorithm requires O(n²) time complexity, that can be obtains the optimal solutions for all of various experimental data

• The Journal of the Acoustical Society of Korea
• /
• v.27 no.5
• /
• pp.229-238
• /
• 2008

Audio tuning improves not only the sound quality of the car audio but also the quality of the completed car itself. However without the subjective assessment on the users' preferences, it is hard to tune the car audio satisfying them. Even though there are lots of factors to be considered to assess the preferences, only a restricted number of factors should be included in the experiment because the total number of experiments increases rapidly as the number of factors in the experiment increases. A large number of factors make it hard to explore the relationship between the sound quality and the sound characteristics and also makes the panels exhausted. In this paper, 8 sound characteristics, each with 2 levels, are considered for the experiment. An orthogonal design of experiment is suggested to reduce the number of experiments from 256 to 16. The analysis of variance is applied to show that Treble is the most significant characteristic of the reproduced sound of the given pop music. Also Deep Bass, SAD, and the interaction between Treble and SAD are found to be significant. For the given classic music, SAD is the only characteristic which turns out to be significant.

• Journal of Korean Dental Hygiene Science
• /
• v.6 no.2
• /
• pp.25-35
• /
• 2023

Background: In order to emphasize the importance of clinical dental hygienists-led dental hygiene management processes for those with systemic diseases, we tried to identify systemic diseases affecting dental implants based on clinical data. Methods: In order to identify systemic diseases affecting dental implants, literature review was conducted from March 1 to May 31, 2023, and the search period was for research papers published in domestic and foreign academic journals from January 2000 to December 2020. Domestic databases used for search use RISS, Nuri Media(DBpia), and Korea Academic Information (http://www.papersearch.net ; KISS), while overseas databases searched Pubmed for dental implant failures, implants, systemic diseases, and Dental implant and system disease. Results: The cumulative survival rate of implants averaged 94.3 percent and the failure rate was 5.7 percent. Clinical analysis of systemic diseases related to implants accounted for the highest frequency with 13 (100.0%), followed by 8 (61.5%) studies on high blood pressure and smoking, 7 (53.8%) cardiovascular diseases, and 5 (38.5%). In addition, liver disease, thyroid abnormalities, blood abnormalities, organ transplants and infectious diseases were confirmed. Conclusion: Since unregulated systemic diseases are a risk factor for implant failure, clinical dental hygienists should continue to maintain healthy oral conditions by sharing information with patients during periodic preventive dental hygiene management processes such as dental hygiene assessment.

• Journal of Broadcast Engineering
• /
• v.10 no.1 s.26
• /
• pp.43-56
• /
• 2005

In the existing broadcasting environment, it is not easy to serve the bi-directional service between a broadcasting server and a TV audience. In the uni-directional broadcasting environments, almost TV programs are scheduled depending on the viewers' popular watching time, and the advertisement contents in these TV programs are mainly arranged by the popularity and the ages of the audience. The audiences make an effort to sort and select their favorite programs. However, the advertisement programs which support the TV program the audience want are not served to the appropriate audiences efficiently. This randomly provided advertisement contents can occur to the audiences' indifference and avoidance. In this paper, we propose the target advertisement service for the appropriate distribution of the advertisement contents. The proposed target advertisement service estimates the audience's profile without any issuing the private information and provides the target-advertised contents by using his/her estimated profile. For the experimental results, we used the real audiences' TV usage history such as the ages, fonder and time of the programs from AC Neilson Korea. And we show the accuracy of the proposed target advertisement service algorithm. NDS (Normalized Distance Sum) and the Vector correlation method, and implementation of our target advertisement service system.

• Journal of Intelligence and Information Systems
• /
• v.25 no.1
• /
• pp.139-161
• /
• 2019

The utilization of the e-commerce market has become a common life style in today. It has become important part to know where and how to make reasonable purchases of good quality products for customers. This change in purchase psychology tends to make it difficult for customers to make purchasing decisions in vast amounts of information. In this case, the recommendation system has the effect of reducing the cost of information retrieval and improving the satisfaction by analyzing the purchasing behavior of the customer. Amazon and Netflix are considered to be the well-known examples of sales marketing using the recommendation system. In the case of Amazon, 60% of the recommendation is made by purchasing goods, and 35% of the sales increase was achieved. Netflix, on the other hand, found that 75% of movie recommendations were made using services. This personalization technique is considered to be one of the key strategies for one-to-one marketing that can be useful in online markets where salespeople do not exist. Recommendation techniques that are mainly used in recommendation systems today include collaborative filtering and content-based filtering. Furthermore, hybrid techniques and association rules that use these techniques in combination are also being used in various fields. Of these, collaborative filtering recommendation techniques are the most popular today. Collaborative filtering is a method of recommending products preferred by neighbors who have similar preferences or purchasing behavior, based on the assumption that users who have exhibited similar tendencies in purchasing or evaluating products in the past will have a similar tendency to other products. However, most of the existed systems are recommended only within the same category of products such as books and movies. This is because the recommendation system estimates the purchase satisfaction about new item which have never been bought yet using customer's purchase rating points of a similar commodity based on the transaction data. In addition, there is a problem about the reliability of purchase ratings used in the recommendation system. Reliability of customer purchase ratings is causing serious problems. In particular, 'Compensatory Review' refers to the intentional manipulation of a customer purchase rating by a company intervention. In fact, Amazon has been hard-pressed for these "compassionate reviews" since 2016 and has worked hard to reduce false information and increase credibility. The survey showed that the average rating for products with 'Compensated Review' was higher than those without 'Compensation Review'. And it turns out that 'Compensatory Review' is about 12 times less likely to give the lowest rating, and about 4 times less likely to leave a critical opinion. As such, customer purchase ratings are full of various noises. This problem is directly related to the performance of recommendation systems aimed at maximizing profits by attracting highly satisfied customers in most e-commerce transactions. In this study, we propose the possibility of using new indicators that can objectively substitute existing customer 's purchase ratings by using RFM multi-dimensional analysis technique to solve a series of problems. RFM multi-dimensional analysis technique is the most widely used analytical method in customer relationship management marketing(CRM), and is a data analysis method for selecting customers who are likely to purchase goods. As a result of verifying the actual purchase history data using the relevant index, the accuracy was as high as about 55%. This is a result of recommending a total of 4,386 different types of products that have never been bought before, thus the verification result means relatively high accuracy and utilization value. And this study suggests the possibility of general recommendation system that can be applied to various offline product data. If additional data is acquired in the future, the accuracy of the proposed recommendation system can be improved.

• Korea Science and Art Forum
• /
• v.37 no.5
• /
• pp.119-133
• /
• 2019

This study is as skyscrapers are becoming increasingly taller, more constructors have decided the height alone cannot be a sufficient differentiator. As a result, atypical architecture is emerging as a new competitive factor. Also, it can be used for symbolizing the economic competitiveness of a country, city, or business through its form. Before the introduction of digital media, there was a discrepancy between the structure and form of a building and correcting this discrepancy required a separate structural medium. Since the late 1980s, however, digitally-based atypical form development began to be used experimentally, and, until the 2000s, it was used mostly for super-tall skyscrapers for offices or for industrial chimneys and communication towers. Since the 2000s, many global brand hotels and commercial and residential buildings have been built as super-tall skyscrapers, which shows the recent trend in architecture that is moving beyond the traditional limits. Complex atypical structure is formed and the formative characteristics of diagonal lines and curved surfaces, which are characteristics of atypical architecture, are created digitally. Therefore, it's goal is necessary to identify a new relationship between the structure and forms. According to the data of Council on Tall Buildings and Urban Habitat (CTBUH), 100-story and taller buildings were classified into typical, diagonal, curved, and segment types in order to define formative shapes of super-tall skyscrapers and provide a ground of the design process related to the initial formation of the concept. The purpose of this study was to identify the correlation between different forms for building atypical architectural shapes that are complex and diverse. The study results are presented as follows: Firstly, complex function follows convergence form characteristics. Secondly, fold has inside of architecture with repeat. Thirdly, as curve style which has pure twist, helix twist, and spiral twist. The findings in this study can be used as basic data for classifying and predicting trends of the future super-tall skyscrapers.