• Asia pacific journal of information systems
• /
• v.24 no.2
• /
• pp.191-210
• /
• 2014

As mobile devices that can be connected to the Internet have spread and networking has become possible whenever/wherever, the Internet has become central in the dissemination and consumption of news. Accordingly, the ways news is gathered, disseminated, and consumed have changed greatly. In the traditional news media such as magazines and newspapers, expert editors determined what events were worthy of deploying their staffs or freelancers to cover and what stories from newswires or other sources would be printed. Furthermore, they determined how these stories would be displayed in their publications in terms of page placement, space allocation, type sizes, photographs, and other graphic elements. In turn, readers-news consumers-judged the importance of news not only by its subject and content, but also through subsidiary information such as its location and how it was displayed. Their judgments reflected their acceptance of an assumption that these expert editors had the knowledge and ability not only to serve as gatekeepers in determining what news was valuable and important but also how to rank its value and importance. As such, news assembled, dispensed, and consumed in this manner can be said to be expert-based recommended news. However, in the era of Internet news, the role of expert editors as gatekeepers has been greatly diminished. Many Internet news sites offer a huge volume of news on diverse topics from many media companies, thereby eliminating in many cases the gatekeeper role of expert editors. One result has been to turn news users from passive receptacles into activists who search for news that reflects their interests or tastes. To solve the problem of an overload of information and enhance the efficiency of news users' searches, Internet news sites have introduced numerous recommendation techniques. Recommendations based on popularity constitute one of the most frequently used of these techniques. This popularity-based approach shows a list of those news items that have been read and shared by many people, based on users' behavior such as clicks, evaluations, and sharing. "most-viewed list," "most-replied list," and "real-time issue" found on news sites belong to this system. Given that collective intelligence serves as the premise of these popularity-based recommendations, popularity-based news recommendations would be considered highly important because stories that have been read and shared by many people are presumably more likely to be better than those preferred by only a few people. However, these recommendations may reflect a popularity bias because stories judged likely to be more popular have been placed where they will be most noticeable. As a result, such stories are more likely to be continuously exposed and included in popularity-based recommended news lists. Popular news stories cannot be said to be necessarily those that are most important to readers. Given that many people use popularity-based recommended news and that the popularity-based recommendation approach greatly affects patterns of news use, a review of whether popularity-based news recommendations actually reflect important news can be said to be an indispensable procedure. Therefore, in this study, popularity-based news recommendations of an Internet news portal was compared with top placements of news in printed newspapers, and news users' judgments of which stories were personally and socially important were analyzed. The study was conducted in two stages. In the first stage, content analyses were used to compare the content of the popularity-based news recommendations of an Internet news site with those of the expert-based news recommendations of printed newspapers. Five days of news stories were collected. "most-viewed list" of the Naver portal site were used as the popularity-based recommendations; the expert-based recommendations were represented by the top pieces of news from five major daily newspapers-the Chosun Ilbo, the JoongAng Ilbo, the Dong-A Daily News, the Hankyoreh Shinmun, and the Kyunghyang Shinmun. In the second stage, along with the news stories collected in the first stage, some Internet news stories and some news stories from printed newspapers that the Internet and the newspapers did not have in common were randomly extracted and used in online questionnaire surveys that asked the importance of these selected news stories. According to our analysis, only 10.81% of the popularity-based news recommendations were similar in content with the expert-based news judgments. Therefore, the content of popularity-based news recommendations appears to be quite different from the content of expert-based recommendations. The differences in importance between these two groups of news stories were analyzed, and the results indicated that whereas the two groups did not differ significantly in their recommendations of stories of personal importance, the expert-based recommendations ranked higher in social importance. This study has importance for theory in its examination of popularity-based news recommendations from the two theoretical viewpoints of collective intelligence and popularity bias and by its use of both qualitative (content analysis) and quantitative methods (questionnaires). It also sheds light on the differences in the role of media channels that fulfill an agenda-setting function and Internet news sites that treat news from the viewpoint of markets.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.37 no.12
• /
• pp.60-69
• /
• 2000

This paper describes a single-chip full-custom implementation of pipelined adaptive decision-feedback equalizer(PADFE) using a 0.25-${\mu}m$ CMOS technology for wide-band wireless digital communication systems. To enhance the throughput rate of ADFE, two pipeline stages are inserted into the critical path of the ADFE by using delayed least-mean-square(DLMS) algorithm. Redundant binary (RB) arithmetic is applied to all the data processing of the PADFE including filter taps and coefficient update blocks. When compared with conventional methods based on two's complement arithmetic, the proposed approach reduces arithmetic complexity, as well as results in a very simple complex-valued filter structure, thus suitable for VLSI implementation. The design parameters including pipeline stage, filter tap, coefficient and internal bit-width, and equalization performance such as bit error rate (BER) and convergence speed are analyzed by algorithm-level simulation using COSSAP. The single-chip PADFE contains about 205,000 transistors on an area of about $1.96\times1.35-mm^2$. Simulation results show that it can safely operate with 200-MHz clock frequency at 2.5-V supply, and its estimated power dissipation is about 890-mW. Test results show that the fabricated chip works functionally well.

• KIISE Transactions on Computing Practices
• /
• v.21 no.11
• /
• pp.681-688
• /
• 2015

The k nearest neighbor (k-NN) graph construction is an important operation with many web-related applications, including collaborative filtering, similarity search, and many others in data mining and machine learning. Despite its many elegant properties, the brute force k-NN graph construction method has a computational complexity of $O(n^2)$, which is prohibitive for large scale data sets. Thus, (Key, Value)-based distributed framework, MapReduce, is gaining increasingly widespread use in Locality Sensitive Hashing which is efficient for high-dimension and sparse data. Based on the two-stage strategy, we engage the locality sensitive hashing technique to divide users into small subsets, and then calculate similarity between pairs in the small subsets using a brute force method on MapReduce. Specifically, generating a candidate group stage is important since brute-force calculation is performed in the following step. However, existing methods do not prevent large candidate groups. In this paper, we proposed an efficient algorithm for approximate k-NN graph construction by regrouping candidate groups. Experimental results show that our approach is more effective than existing methods in terms of graph accuracy and scan rate.

• Journal of architectural history
• /
• v.18 no.6
• /
• pp.85-101
• /
• 2009

The Purpose of this paper is a study on the characteristics of Campidoglio hill plan by Michelangelo. 1. The plan of the Campidoglio hill is composed of the harmonized and united space, in spite of the existing conditions of a steep flight of land, a irregular site shape, a building of each other different dimension and form. And it is newly changed by site left through the modification of existing building elevation, utilization of existing building for new planning, connection with existing building and newly planned building from plaza composition of trapezoid form. 2. The concept of planning of the Campidoglio hill is planned by compromising for requirements of Baroque after Renaissance which urban planning characteristics of Baroque is as the relation with urban street through a inclined stairs and process such as street-approach stairs-plaza-symbol of inside plaza-building. 3. The section plan of the Campidoglio hill is planned by which can be easily approached to the plaza through the inclined stairs of gentle angle from street at the center east-west direction of main axis such as main axis, utilizing the existing site shape, and it is composed of the convex shape ascending gently at the center central part of the plaza. 4. The plan of the Campidoglio hill is composed of the elation with the axis of existing Senatorio palace, building planning of perfect balance, plaza composition of reversed trapezoid form bybuilding planning, central concentrated planning of buildings surrounding plaza. 5. The three palace of the plan of the Campidoglio hill is composed of the concept as theater which the stage background forms the front elevation of Senatorio palace higher two palace and the wings of either side of stage form the front elevation of Conservatori palace and Nuovo palace, surrounding three palace elevation around plaza of trapezoid form.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.4
• /
• pp.493-498
• /
• 2004

A novel approach for path planning of a polygonal robot is presented. Traditional path planners perform extensive geometric searching to find the optimal path or to prove that there is no solution. The computation required to prove that there is no solution is equivalent to exhaustive search of the motion space, which is typically very expensive. Humans seems to use a set of several different path planning strategies to analyse the situation of the obstacles in the environment, and quickly recognize whether the path-planning problem is easy to solve, hard to solve or has no solution. This human path-planning strategies have motivated the development of the presented algorithm that combines qualitative shape reasoning and exhaustive geometric searching to speed up the path planning process. It has three planning stages consisting of identification of no-solution cases based on an enclosure test, a qualitative reasoning stage, and finally a complete search algorithm in case the previous two stages cannot determine of the existence of a solution path.

• Investigative Magnetic Resonance Imaging
• /
• v.20 no.3
• /
• pp.152-157
• /
• 2016

Purpose: Operating room management is the serious and complex task for hospital managers and the common approach is to develop relevant standard operational procedures. From patient and staff safety perspective, operating room management should be well-studied and hospital should identify and address any potential risks. Simultaneous usage of different imaging and less-invasive treatment technologies demands strong management control. Materials and Methods: We have formed the multidisciplinary expert panel (surgeons, anesthesiologists, radiologists, healthcare managers etc.) for hybrid theater management standard operational procedure development. On the first stage the general concept of hybrid room design and patient routing was developed. The second stage included the technical details discussion. For patient safety improvement we modified the Surgical Safety Check-list in accordance with potential MRI-related safety challenges and concerns. Results: WHO Surgical Safety Checklist is a simple and easy-to use tool which includes three blocks of question (grouped by the surgery process). We have developed two additional blocks of questions for the intraoperative magnetic resonance investigation. It is very important to have a special detailed routing with a strong control of ferromagnetic devices and anesthesiology care. Conclusion: High-energy MRI (1.5-3.0T) is characterized by potential influence on patient and staff safety in case of hybrid surgery. It is obvious to have a strong managerial control of ferromagnetic devices and anesthesiology care. Surgical Safety Checklist is the validated tool for improving patient safety. Modification and customization of this check-list potentially provides the opportunity for surgery processes improving.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.11C
• /
• pp.1124-1131
• /
• 2002

The banyan network is a popular and basic structure of the multi-stage ATM switches. This paper presents a novel approach to resolve the internal blocking of the banyan network by using a Non-Blocking Permutation Generator (NBPG). The NBPG performs two functions, i.e., the first is to extract the conflict cells from the incoming cells and Ole second is to re-assign new input port addresses to the conflict cells. As a result, NBPG generates non-blocking I/O permutations. To estimate the performance of the NBPG, we provide the results of several simulations.

• Archives of Plastic Surgery
• /
• v.41 no.5
• /
• pp.535-541
• /
• 2014

Background Patients having unilateral breast reconstruction often require a second stage procedure on the contralateral breast to improve symmetry. In order to provide immediate symmetry and minimize the frequency and extent of secondary procedures, we began performing simultaneous contralateral balancing operations at the time of initial reconstruction. This study examines the indications, safety, and efficacy of this approach. Methods One-hundred and two consecutive breast reconstructions with simultaneous contralateral balancing procedures were identified. Data included patient age, body mass index (BMI), type of reconstruction and balancing procedure, specimen weight, transfusion requirement, complications and additional surgery under anesthesia. Unpaired t-tests were used to compare BMI, specimen weight and need for non-autologous transfusion. Results Average patient age was 48 years. The majority had autologous tissue-only reconstructions (94%) and the rest prosthesis-based reconstructions (6%). Balancing procedures included reduction mammoplasty (50%), mastopexy (49%), and augmentation mammoplasty (1%). Average BMI was 27 and average reduction specimen was 340 grams. Non-autologous blood transfusion rate was 9%. There was no relationship between BMI or reduction specimen weight and need for transfusion. We performed secondary surgery in 24% of the autologous group and 100% of the prosthesis group. Revision rate for symmetry was 13% in the autologous group and 17% in the prosthesis group. Conclusions Performing balancing at the time of breast reconstruction is safe and most effective in autologous reconstructions, where 87% did not require a second operation for symmetry.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.203-211
• /
• 2005

In this paper, we propose a new automatic fingerprint identification system that identifies individuals in large databases. The algorithm consists of three steps; preprocessing, classification, and matching, in the classification. we present a new classification technique based on the statistical approach for directional image distribution. In matching, we also describe improved minutiae candidate pair extraction algorithm that is faster and more accurate than existing algorithm. In matching stage, we extract fingerprint minutiaes from its thinned image for accuracy, and introduce matching process using minutiae linking information. Introduction of linking information into the minutiae matching process is a simple but accurate way, which solves the problem of reference minutiae pair selection in comparison stage of two fingerprints quickly. This algorithm is invariant to translation and rotation of fingerprint. The proposed system was tested on 1000 fingerprint images from the semiconductor chip style scanner. Experimental results reveal false acceptance rate is decreased and genuine acceptance rate is increased than existing method.

• Journal of Radiation Protection and Research
• /
• v.28 no.2
• /
• pp.145-154
• /
• 2003

By optimizing the radiation protection the collective dose and individual dose could be reduced during YGN #4 $5^{th}$ outage in 2001. The collective doses for the two high radiation jobs decreased to 85% and 65% of expected doses. The proportion of workers with low dose (below 1mSv) exposure increased 4% while the proportion of workers with over 3mSv and 5mSv exposure are decreased to 2%, 1% respectively. But none is exposed over 8mSv for the annual dose. To aid decision of utilizing the robot, cost- benefit analysis was performed and reasonable point was proposed to use the robot. For the first time job, repeated ALARA meeting and mock up training were implemented to set up working procedure by identifying the trouble. To easily set up standard procedure, mockup process was videotaped and reviewed during ALARA meeting. Monitoring is a good approach to chase radiological working condition such as working time, dose rate. behavior of workers, especially for high radiation work. Those data were estimated and adjusted from the stage of work planning to mock up. At the stage of actual work the monitoring data were compared to the estimation and recorded to database. This database will not only be used as a powerful tool for dose optimization at the following outage but also as a guideline to dose constraint set up for optimization for each specific situation.