• Journal of Internet Computing and Services
• /
• v.17 no.3
• /
• pp.107-113
• /
• 2016

Following the recent advancement in the use of social networks, a vast amount of different online reviews is created. These variable online reviews which provide feedback data of contents' are being used as sources of valuable information to both contents' users and providers. With the increasing importance of online reviews, studies on opinion mining which analyzes online reviews to extract opinions or evaluations, attitudes and emotions of the writer have been on the increase. However, previous sentiment analysis techniques of opinion-mining focus only on the classification of reviews into positive or negative classes but does not include detailed information analysis of the user's satisfaction or sentiment grounds. Also, previous designs of the sentiment analysis technique only applied to one content domain that is, either product or movie, and could not be applied to other contents from a different domain. This paper suggests a sentiment analysis technique that can analyze detailed satisfaction of online reviews and extract detailed information of the satisfaction level. The proposed technique can analyze not only one domain of contents but also a variety of contents that are not from the same domain. In addition, we design a system based on Hadoop to process vast amounts of data quickly and efficiently. Through our proposed system, both users and contents' providers will be able to receive feedback information more clearly and in detail. Consequently, potential users who will use the content can make effective decisions and contents' providers can quickly apply the users' responses when developing marketing strategy as opposed to the old methods of using surveys. Moreover, the system is expected to be used practically in various fields that require user comments.

• Journal of Internet Computing and Services
• /
• v.19 no.1
• /
• pp.67-76
• /
• 2018

This paper addresses the problem of efficient processing of region monitoring queries. The centralized methods used for existing region monitoring query processing assumes that the mobile object periodically sends location-updates to the server and the server continues to update the query results. However, a large amount of location updates seriously degrade the system performance. Recently, some distributed methods have been proposed for region monitoring query processing. In the distributed methods, the server allocates to all objects i) a resident domain that is a subspace of the workspace, and ii) a number of nearby query regions. All moving objects send location updates to the server only when they leave the resident domain or cross the boundary of the query region. In order to allocate the resident domain to the moving object along with the nearby query region, we use a query index structure that is constructed by splitting the workspace recursively into equal halves. However, However, the above index structure causes unnecessary division, resulting in deterioration of system performance. In this paper, we propose an adaptive split method to reduce unnecessary splitting. The workspace splitting is dynamically allocated i) considering the spatial relationship between the query region and the resultant subspace, and ii) the distribution of the query region. We proposed an enhanced QR-tree with a new splitting method. Through a set of simulations, we verify the efficiency of the proposed split methods.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.2
• /
• pp.134-145
• /
• 2004

With rapid growth in the amount of data transferred on the Internet, traditional storage systems have reached the limits of their capacity and performance. SAN (Storage Area Network), which connects hosts to disk with the Fibre Channel switches, provides one of the powerful solutions to scale the data storage and servers. In this environment, the maintenance of data consistency among hosts is an important issue because multiple hosts share the files on disks attached to the SAN. To preserve data consistency, each host can execute the disk I/O whenever disk read and write operations are requested. However, frequent disk I/O requests cause the deterioration of the overall performance of a SAN cluster. In this paper, we introduce a SANtopia global buffer manager to improve the performance of a SAN cluster reducing the number of disk I/Os. We describe the design and algorithms of the SANtopia global buffer manager, which provides a buffer cache sharing mechanism among the hosts in the SAN cluster. Micro-benchmark results to measure the performance of block I/O operations show that the global buffer manager achieves speed-up by the factor of 1.8-12.8 compared with the existing method using disk I/O operations. Also, File system micro-benchmark results show that SANtopia file system with the global buffer manager improves performance by the factor of 1.06 in case of directories and 1.14 in case of files compared with the file system without a global buffer manager.

• Journal of KIISE:Information Networking
• /
• v.32 no.3
• /
• pp.415-426
• /
• 2005

Wireless internet, which becomes a hot social issue, has limitations due to the following characteristics, as different from wired internet. It has low bandwidth, frequent disconnection, low computing power, and small screen in user terminal. Also, it has technical issues to Improve in terms of user mobility, network protocol, security, and etc. Wireless internet server should be scalable to handle a large scale traffic due to rapidly growing users. In this paper, wireless internet proxy server clusters are used for the wireless Internet because their caching, distillation, and clustering functions are helpful to overcome the above limitations and needs. TranSend was proposed as a clustering based wireless internet proxy server but it has disadvantages; 1) its scalability is difficult to achieve because there is no systematic way to do it and 2) its structure is complex because of the inefficient communication structure among modules. In our former research, we proposed the All-in-one structure which can be scalable in a systematic way but it also has disadvantages; 1) data sharing among cache servers is not allowed and 2) its communication structure among modules is complex. In this paper, we proposed its improved scheme which has an efficient communication structure among modules and allows data to be shared among cache servers. We performed experiments using 16 PCs and experimental results show 54.86$\%$ and 4.70$\%$ performance improvement of the proposed system compared to TranSend and All-in-one system respectively Due to data sharing amount cache servers, the proposed scheme has an advantage of keeping a fixed size of the total cache memory regardless of cache server numbers. On the contrary, in All-in-one, the total cache memory size increases proportional to the number of cache servers since each cache server should keep all cache data, respectively.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.1 s.39
• /
• pp.71-85
• /
• 2006

The environment of computational grid is composed of the LAN/WAN each of which has different efficiency and heterogeneous network conditions, and where various programs are running. In this environment, the role of the resource selection broker is very important because the work of each node is performed by considering heterogeneous network environment and the computing power of each node according to the characteristics of a program. In this paper, a new resource selection broker is presented that decides the number of work processes to be allocated at each node by considering network state information and the performance of each node according to the characteristics of a program in the environment of computational grid. The proposed resource selection broker has three steps as follows. First, the performance ratio of each node is computed using latency-bandwidth-cpu mixture information reflecting the characteristics of a program, and the number of work processes that will be performed at each node are decided by this ratio. Second, RSL file is automatically made based on the number of work processes decided at the previous step. Finally, each node creates work processes by using that RSL file and performs the work which has been allocated to itself. As experimental results, the proposed method reflecting characteristics of a program, compared with the existing (uniformity) and latency-bandwidth method is improved $278%\sim316%,\;524%\sim595%,\;924%\sim954%$ in the point of work amount, work process number, and node number respectively.

• Journal of the Korean GEO-environmental Society
• /
• v.15 no.5
• /
• pp.31-37
• /
• 2014

In situ investigations and laboratory tests using elastic wave have become popular in geotechnical and geoenvironmental engineering. Propagation velocity of elastic wave is the key index to evaluate the ground characteristics. To evaluate this, various methods were used in both time domain and frequency domain. In time domain, the travel time can be found from the two points that have the same phase such as peaks or first rises. Cross-correlation can also be used in time domain by evaluating the time shift amount that makes the product of signals of input and received waveforms maximum. In frequency domain, wave propagation velocity can be evaluated by computing the phase differences between the source and received waves. In this study, wave propagation velocity evaluated by the methods listed above were compared. Bender element tests were conducted on the specimens cut from the undisturbed hand-cut block samples obtained from Block 37 excavation site in Chicago, IL, US. The evaluation methods in time domain provides relatively wide range of wave propagation velocities due to the noise in signals and the sampling frequency of data logger. Frequency domain approach provides relatively accurate wave propagation velocities and is irrelevant to the sampling frequency of data logger.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.775-778
• /
• 2015

HTML5-based Web platform is established as a next-generation national standards, Web services provider, has been competitively develop support technology HTML5-based app in smart media devices and smart TV. In accordance with the W3C is an international Web standards development organization, Microsoft, Apple, Mozilla, Google, such as Opera, various Web browser vendors are participating in standardization. Gradually emphasized the importance of HTML5, HTML5 -based Web pages, it is necessary to fast load times when contained a large amount of information. Therefore, in this paper, the initial studies in order to reduce the loading time of a web page, configure each browser-specific same Web page, and measure the initial loading time. Also, one by one remove the HTML5 tags, and CSS property, to analyze the tags and attributes of the account for a large proportion to the initial load time. Through the results, it is desired to provide a process which can reduce the Web page.

• The KIPS Transactions:PartC
• /
• v.13C no.3 s.106
• /
• pp.339-344
• /
• 2006

Secure delivery of multicast data can be achieved with the use of a group key for data encryption in mobile ad hoc network (MANET) applications based on the group communication. However, for the support of dynamic group membership, the group key has to be updated for each member joining/leaving and, consequently, a mechanism distributing an updated group key to members is required. The two major categories of the group key distribution mechanisms proposed for wired networks are the naive and the tree-based approaches. The naive approach is based on unicast, so it is not appropriate for large group communication environment. On the other hand, the tree-based approach is scalable in terms of the group size, but requires the reliable multicast mechanism for the group key distribution. In the sense that the reliable multicast mechanism requires a large amount of computing resources from mobile nodes, the tree-based approach is not desirable for the small-sized MANET environment. Therefore, in this paper, we propose a new key distribution protocol, called the proxy-based key management protocol (PROMPT), which is based on the naive approach in the small-sized MANET environment. PROMPT reduces the message overhead of the naive through the first-hop grouping from a source node and the last-hop grouping from proxy nodes using the characteristics of a wireless channel.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.3
• /
• pp.880-894
• /
• 1997

In this paper,we propose a new algorithm to perform DCT(Discrete Cosine Transform) withn the area reduced by prdeicting position of quantization coefficients to be zero.This proposed algorithm not only decreases the enoding time and the decoding time by reducing computation amount of FDCT(Forward DCT)and IDCT(Inverse DCT) but also increases comprossion ratio by performing each diffirent horizontal- vereical zig-zag scan assording to the calssified block size for each block on the huffiman coeing.Traditional image coding method performs the samd DCT computation and zig-zag scan over all blocks,however this proposed algorthm reduces FDCT computation time by setting to zero insted of computing DCT for quantization codfficients outside classfified block size on the encoding.Also,the algorithm reduces IDCT computation the by performing IDCT for only dequantization coefficients within calssified block size on the decoding.In addition, the algorithm reduces Run-Length by carrying out horizontal-vertical zig-zag scan approriate to the slassified block chraateristics,thus providing the improverment of the compression ratio,On the on ther hand,this proposed algorithm can be applied to 16*16 block processing in which the compression ratio and the image resolution are optimal but the encoding time and the decoding time take long.Also,the algorithm can be extended to motion image coding requirng real time processing.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.3
• /
• pp.95-99
• /
• 2015

The IRR(internal rate of return) is often used by investors for the evaluation of engineering projects. Unfortunately, it has serial flaws: (1) multiple real-valued IRRs may arise; (2) complex-valued IRRs may arise; (3) the IRR is, in special cases, incompatible with the net present value (NPV) in accept/reject decisions. The efforts of management scientists and economists in providing a reliable project rate of return have generated over the decades an immense amount of contributions aiming to solve these shortcomings. Especially, multiple internal rate of returns (IRRs) have a fatal flaw when we decide to accep it or not. To solve it, some researchers came up with external rate of returns (ERRs) such as ARR (Average Rate of Return) or MIRR (MIRR, Modified Internal Rate of Return). ARR or MIRR. will also always yield the same decision for a engineering project consistent with the NPV criterion. The ERRs are to modify the procedure for computing the rate of return by making explicit and consistent assumptions about the interest rate at which intermediate receipts from projects may be invested. This reinvestment could be either in other projects or in the outside market. However, when we use traditional ERRs, a volume of capital investment is still unclear. Alternatively, the productive rate of return (PRR) can settle these problems. Generally, a rate of return is a profit on an investment over a period of time, expressed as a proportion of the original investment. The time period is typically the life of a project. The PRR is based on the full life of the engineering project. but has been annualised to project one year. And the PRR uses the effective investment instead of the original investment. This method requires that the cash flow of an engineering project must be separated into 'investment' and 'loss' to calculate the PRR value. In this paper, we proposed a tabulated form for easy calculation of the PRR by modifing the profit and loss statement, and the cash flow statement.