• The Bulletin of The Korean Astronomical Society
• /
• v.46 no.1
• /
• pp.52.3-53
• /
• 2021

It is yet to be understood what controls the star formation activity in high-redshift galaxy clusters. One recently proposed mechanism is that the star formation activity in galaxy clusters are fed by gas and galaxies in large-scale structures surrounding them, which we call as "web feeding model". Using galaxies in the COSMOS2015 catalog, with mass completeness at log(M/M_⦿)≥9.54 and reliable photometric redshift data (σ_Δz/(1+z) ≲ 0.01), we study the star formation activities of galaxy clusters and their surrounding environment to test the web feeding model. We first identify the overdense regions with number density exceeding the 4σ-level from photometric redshift data as galaxy clusters, and we find that they are well matched with clusters identified in the X-ray extended source catalog. Furthermore, we identify galaxy large scale structures, and will present the correlation or anti-correlation between quiescent galaxy fraction, an indicator of star-forming activity, and the prevalence of galaxy large scale structures.

• Journal of Digital Contents Society
• /
• v.12 no.2
• /
• pp.241-252
• /
• 2011

During the last decades, other parts of operating systems, storage devices, and media are changed steadily, whereas filesystem is changed little. As data is grown bigger, the number of files to be managed also increases in geometrically. Researches about new filesystem schemes are being done widely to support these files efficiently. In web document search area, there are many researches about finding meaningful documents using semantic search. Many researches tried to apply these schemes, which is been proven in web document search previously, to filesystems. But they've focused only on higher layer of filesystem, that is not related seriously to storage media. Therefore they're not well tuned to physical characteristics of new flash memory based SSD which has different features against traditional HDD. We enhance log structured filesystem, that is already well known to work better in SSD, by putting semantic search scheme to and with multi logging point.

• Journal of the Korean Society for information Management
• /
• v.35 no.1
• /
• pp.183-203
• /
• 2018

As the users' information use environment changes to the Web, the archives are providing more services on the Web than before. This study analyzes the users' recent inflow route and the highly ranked 100 search terms of each month for 10 and half years in the Web site of National Archives of Korea, and suggests suitable information services. As a result of the analysis, it was found out that the inflow route could be divided into access from portal site, by country, from related institutions, and via mobile platform. As a result of analyzing the search terms of users for the last 10 and half years, the most frequently searched term turned out to be 'Land Survey Register', which was also the search term that was searched for with steady interests for 10 and half years. Also, other government documents or official gazettes were of great interests to users. As results of identifying the most frequently searched and steadily searched terms, we were able to categorize the search terms largely in terms of land, Japanese colonial period, the Korean war and relationship of North Korea and South Korea, and records management and use. Based on the results of the analysis, we suggested strengthening connection of the National Archives Web site with portal sites and mobile, and upgrading and improving search services of the National Archives. This study confirmed that the analysis of Web log and user search terms would yield meaningful results that could enhance the user services in archives.

• The KIPS Transactions:PartA
• /
• v.10A no.3
• /
• pp.261-268
• /
• 2003

In this paper, we propose a new caching strategy for web servers. The proposed strategy collects only the statistics of the requested file, for example the popularity, when a request arrives. At a point of time, only files with higher forecasted popularity are cached all together. Forecasted popularity based lazy caching (FPLC) strategy uses exponential smoothing method for forecast popularity of web files. And, FPLC strategy shows that the cache hit ratio and the cache transfer ratio are better than those produced by other caching strategy. Furthermore, the experiment that is performed with real log files built from web servers shows our study on forecast method for popularity of web files improves cache efficiency.

• Journal of Internet Computing and Services
• /
• v.10 no.5
• /
• pp.95-105
• /
• 2009

There are various studies to provide useful information for users on huge data of web-sites. Web usage mining among them is a method to extract meaningful patterns based on web users' log data. Most of existing patterns of web usage mining, however, had not considered users' diverse inclination but created general models. Web users' keywords can have various meaning upon their tendency and background knowledge. This study is for generating Multi Concept Keyword Model (MCK-Model) by analyzing web usage information on users' keywords of interest. MCK-Model can supply web page network for various inclination based on users' keywords of interest. Also, MCK-Model can be used to recommend the most proper web pages and it has been confirmed that the suggested method is useful enough.

• Journal of KIISE:Information Networking
• /
• v.32 no.6
• /
• pp.705-715
• /
• 2005

A peer-to-peer web caching has been studied recently as it can reduce the traffic converged on the server side and can support the traditional web caching model. Although the peer-to-peer web caching has the merit of having additional cache space from the local caches of peers without additional infrastructure, several constraints such as dynamic participation and local caching strategy caused by the autonomy of peers in peer-to-peer networks nay limit the performance of the peer-to-peer web caching. To overcome these limitations, we propose an efficient directory-based peer-to-peer web caching system under dynamic participation of peers. In the proposed caching system, we present new peer selection and replica management schemes by introducing the concept of the object lifetime in P2P networks. We evaluate the effectiveness of the proposed system through trace-driven simulations with a web log dataset. Simulation results show that the proposed system has higher accuracy and fewer redirection failures than the conventional directory-based P2P web caching system in feasible peer-to-peer networks.

• The Journal of Society for e-Business Studies
• /
• v.16 no.3
• /
• pp.249-261
• /
• 2011

The rapid growth of e-business market makes new online companies to start and existing offline companies to join in this area. As the number of players of this market grows rapidly, the competition among them is very intense. Many companies invest huge resources to online marketing including search advertisement, email advertisement and banner advertisement. Because these traditional online marketing activities mainly focus on how to invite visitors to their web sites, ROI of these marketing activities are getting lower. Many companies are looking for a new marketing method to escape this situation. In this paper, we propose ROMS (Realtime Online Marketing System) which supports tools to improve conversion ratio of e-commerce sites, ROMS gathers behavioral data of visitors and analyzes it in realtime. ROMS supports live chats, visitor profiling, context analysis, event detection, and live marketing. With ROMS, personalized offers based on visitors' realtime context can be made for each visitor.

• Journal of the Korean Society for information Management
• /
• v.23 no.2
• /
• pp.61-79
• /
• 2006

To come up with the recommendations to improve the patent & trademark retrieval efficiency, 100,016 patent & trademark search requests by 17,559 unique users over a period of 193 days were analyzed. By analyzing 2,202 multi-query sessions, where one user issuing two or more queries consecutively, we discovered a number of retrieval efficiency improvements clues. The session analysis result also led to suggestions for new system features to help users reformulating queries. The patent & trademark retrieval users were found to be similar to the typical web users in certain aspects especially in issuing short queries. However, we also found that the patent & trademark retrieval users used Boolean operators more than the typical web search users. By analyzing the multi-query sessions, we found that the users had five intentions in reformulating queries such as paraphrasing, specialization, generalization, alternation, and interruption, which were also used by the web search engine users.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.34 no.2
• /
• pp.263-279
• /
• 2024

With the increasing trend of Cloud migration, security threats in the Cloud computing environment have also experienced a significant increase. Consequently, the importance of efficient incident investigation through log data analysis is being emphasized. In Cloud environments, the diversity of services and ease of resource creation generate a large volume of log data. Difficulties remain in determining which events to investigate when an incident occurs, and examining all the extensive log data requires considerable time and effort. Therefore, a systematic approach for efficient data investigation is necessary. CloudTrail, the Amazon Web Services(AWS) logging service, collects logs of all API call events occurring in an account. However, CloudTrail lacks insights into which logs to analyze in the event of an incident. This paper proposes an automated analysis framework that integrates Cloud Matrix and event information for efficient incident investigation. The framework enables simultaneous examination of user behavior log events, event frequency, and attack information. We believe the proposed framework contributes to Cloud incident investigations by efficiently identifying critical events based on the ATT&CK Framework.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.4
• /
• pp.433-438
• /
• 2003

Recently, some studies of a web-based information recommendation technique which provides users with the most necessary information through websites like a web-based shopping mall have been conducted vigorously. In most cases of web information recommendation techniques which rely on a user profile and a specific feedback from users, they require accurate and diverse profile information of users. However, in reality, it is quite difficult to acquire this related information. This paper is aimed to suggest an information prediction technique for a web information service without depending on the users'specific feedback and profile. To achieve this goal, this study is to design and implement a Dynamic Web Information Prediction System which can recommend the most useful and necessary information to users from a large volume of web data by designing and embodying Ensemble Support Vector Machine and hybrid SOM algorithm and eliminating the scarcity problem of web log data.