• Title/Summary/Keyword: IS usage performance

Search Result 1,411, Processing Time 0.029 seconds

An Application of Fuzzy AHP and TOPSIS Methodology for Ranking the Factors Influencing FinTech Adoption Intention: A Comparative Study of China and Korea (FinTech 채택 의도에 영향을 미치는 요소의 순위 결정을 위한 Fuzzy AHP 및 TOPSIS 방법론의 적용 : 중국과 한국의 비교 연구)

  • Mu, Hong-Lei;Lee, Young-Chan
    • Journal of Service Research and Studies
    • /
    • v.7 no.4
    • /
    • pp.51-68
    • /
    • 2017
  • Financial technology (FinTech) is an emerging financial service sector include innovations in financial literacy and investment, retail banking, education, and crypto-currencies like bitcoin. One of the crucial branch of financial technology-third-party payment (TPP) is undergoing rapid growth, with online/mobile systems replacing offline financial systems. System quality and user attitudes are key perceptions driving third-party payment usage, the importance of these perceptions, however, may be different with countries as users' thinking varies from country to country. Thus, the purpose of this study is to elaborate how factors differ from China to Korea by drawing on the unified theory of acceptance and use of technology (UTAUT2). Additionally, this study also aims to propose a multi-attribute evaluation of the third-party online payment system based on analytic hierarchy process (AHP), fuzzy sets and technique for order performance by similarity to ideal solution (TOPSIS), to examine the relative importance of the perceptions influencing new technology adoption intention. The results showed that the price value has the most significant influence on Chinese perceptions, while the perceived credibility has the most significant effect on Korean perceptions. Sub-criteria also performs different results to Chinese and Korean third-party online payment system.

Analysis of IoT Open-Platform Cryptographic Technology and Security Requirements (IoT 오픈 플랫폼 암호기술 현황 및 보안 요구사항 분석)

  • Choi, Jung-In;Oh, Yoon-Seok;Kim, Do-won;Choi, Eun Young;Seo, Seung-Hyun
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.7 no.7
    • /
    • pp.183-194
    • /
    • 2018
  • With the rapid development of IoT(Internet of Things) technology, various convenient services such as smart home and smart city have been realized. However, IoT devices in unmanned environments are exposed to various security threats including eavesdropping and data forgery, information leakage due to unauthorized access. To build a secure IoT environment, it is necessary to use proper cryptographic technologies to IoT devices. But, it is impossible to apply the technologies applied in the existing IT environment, due to the limited resources of the IoT devices. In this paper, we survey the classification of IoT devices according to the performance and analyze the security requirements for IoT devices. Also we survey and analyze the use of cryptographic technologies in the current status of IoT open standard platform such as AllJoyn, oneM2M, IoTivity. Based on the research of cryptographic usage, we examine whether each platform satisfies security requirements. Each IoT open platform provides cryptographic technology for supporting security services such as confidentiality, integrity, authentication an authorization. However, resource constrained IoT devices such as blood pressure monitoring sensors are difficult to apply existing cryptographic techniques. Thus, it is necessary to study cryptographic technologies for power-limited and resource constrained IoT devices in unattended environments.

The Efficiency Analysis of using NFC Cadastral Control Point and a Cadastral Information Application (NFC 지적기준점과 지적정보어플리케이션 적용에 대한 효용성 분석)

  • Kim, Sung Jun;Lee, Jong Dal;Kim, Sung Hun;Bae, Jae Yeol
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.22 no.1
    • /
    • pp.31-39
    • /
    • 2014
  • The trend of information service and its utilization has been gradually evolving due to the technological breakthrough in IT industries and the spread of smart phones. Especially regarding smart phones, a vast array of applications are being developed and employed for the purpose of providing real time information. Recently, numerous studies have been made and applied in regards to the efficient management and the supply of cadastral control point information. This research has developed and applied the NFC Cadastral Control Point, an advanced version of QR code Cadastral Control Point, which is installed and utilized in Dong-gu Ulsan, Korea, and an application that can utilize both the QR code and the NFC. In addition, this research continues on to analyzing the utility of the two methods that the survey use of a General Cadastral Control Point and the NFC Cadastral Control Point. Having implemented both methods, NFC Cadastral Control Point outweighed its counterpart in terms of the damage it gets from the outside influence and availability. Moreover, through developing Cadastral Control Point that could apply both the QR code Cadastral Control Point and NFC Cadastral Control Point, the research saw tremendous improvements compared to the survey method using the previously existing reference point performance. The results conveyed the fact that cadastral information application was time saving, convenient, and efficient in terms of finding information. Henceforth, with government's administration over Cadastral Control Point and with the development of more application for providing information, a nation-wide monitoring of Cadastral Control Point is considered possible and an efficient usage of information service is expected as well.

H*-tree/H*-cubing-cubing: Improved Data Cube Structure and Cubing Method for OLAP on Data Stream (H*-tree/H*-cubing: 데이터 스트림의 OLAP를 위한 향상된 데이터 큐브 구조 및 큐빙 기법)

  • Chen, Xiangrui;Li, Yan;Lee, Dong-Wook;Kim, Gyoung-Bae;Bae, Hae-Young
    • The KIPS Transactions:PartD
    • /
    • v.16D no.4
    • /
    • pp.475-486
    • /
    • 2009
  • Data cube plays an important role in multi-dimensional, multi-level data analysis. Meeting on-line analysis requirements of data stream, several cube structures have been proposed for OLAP on data stream, such as stream cube, flowcube, S-cube. Since it is costly to construct data cube and execute ad-hoc OLAP queries, more research works should be done considering efficient data structure, query method and algorithms. Stream cube uses H-cubing to compute selected cuboids and store the computed cells in an H-tree, which form the cuboids along popular-path. However, the H-tree layoutis disorderly and H-cubing method relies too much on popular path.In this paper, first, we propose $H^*$-tree, an improved data structure, which makes the retrieval operation in tree structure more efficient. Second, we propose an improved cubing method, $H^*$-cubing, with respect to computing the cuboids that cannot be retrieved along popular-path when an ad-hoc OLAP query is executed. $H^*$-tree construction and $H^*$-cubing algorithms are given. Performance study turns out that during the construction step, $H^*$-tree outperforms H-tree with a more desirable trade-off between time and memory usage, and $H^*$-cubing is better adapted to ad-hoc OLAP querieswith respect to the factors such as time and memory space.

Mapping Categories of Heterogeneous Sources Using Text Analytics (텍스트 분석을 통한 이종 매체 카테고리 다중 매핑 방법론)

  • Kim, Dasom;Kim, Namgyu
    • Journal of Intelligence and Information Systems
    • /
    • v.22 no.4
    • /
    • pp.193-215
    • /
    • 2016
  • In recent years, the proliferation of diverse social networking services has led users to use many mediums simultaneously depending on their individual purpose and taste. Besides, while collecting information about particular themes, they usually employ various mediums such as social networking services, Internet news, and blogs. However, in terms of management, each document circulated through diverse mediums is placed in different categories on the basis of each source's policy and standards, hindering any attempt to conduct research on a specific category across different kinds of sources. For example, documents containing content on "Application for a foreign travel" can be classified into "Information Technology," "Travel," or "Life and Culture" according to the peculiar standard of each source. Likewise, with different viewpoints of definition and levels of specification for each source, similar categories can be named and structured differently in accordance with each source. To overcome these limitations, this study proposes a plan for conducting category mapping between different sources with various mediums while maintaining the existing category system of the medium as it is. Specifically, by re-classifying individual documents from the viewpoint of diverse sources and storing the result of such a classification as extra attributes, this study proposes a logical layer by which users can search for a specific document from multiple heterogeneous sources with different category names as if they belong to the same source. Besides, by collecting 6,000 articles of news from two Internet news portals, experiments were conducted to compare accuracy among sources, supervised learning and semi-supervised learning, and homogeneous and heterogeneous learning data. It is particularly interesting that in some categories, classifying accuracy of semi-supervised learning using heterogeneous learning data proved to be higher than that of supervised learning and semi-supervised learning, which used homogeneous learning data. This study has the following significances. First, it proposes a logical plan for establishing a system to integrate and manage all the heterogeneous mediums in different classifying systems while maintaining the existing physical classifying system as it is. This study's results particularly exhibit very different classifying accuracies in accordance with the heterogeneity of learning data; this is expected to spur further studies for enhancing the performance of the proposed methodology through the analysis of characteristics by category. In addition, with an increasing demand for search, collection, and analysis of documents from diverse mediums, the scope of the Internet search is not restricted to one medium. However, since each medium has a different categorical structure and name, it is actually very difficult to search for a specific category insofar as encompassing heterogeneous mediums. The proposed methodology is also significant for presenting a plan that enquires into all the documents regarding the standards of the relevant sites' categorical classification when the users select the desired site, while maintaining the existing site's characteristics and structure as it is. This study's proposed methodology needs to be further complemented in the following aspects. First, though only an indirect comparison and evaluation was made on the performance of this proposed methodology, future studies would need to conduct more direct tests on its accuracy. That is, after re-classifying documents of the object source on the basis of the categorical system of the existing source, the extent to which the classification was accurate needs to be verified through evaluation by actual users. In addition, the accuracy in classification needs to be increased by making the methodology more sophisticated. Furthermore, an understanding is required that the characteristics of some categories that showed a rather higher classifying accuracy of heterogeneous semi-supervised learning than that of supervised learning might assist in obtaining heterogeneous documents from diverse mediums and seeking plans that enhance the accuracy of document classification through its usage.

Memory Organization for a Fuzzy Controller.

  • Jee, K.D.S.;Poluzzi, R.;Russo, B.
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1993.06a
    • /
    • pp.1041-1043
    • /
    • 1993
  • Fuzzy logic based Control Theory has gained much interest in the industrial world, thanks to its ability to formalize and solve in a very natural way many problems that are very difficult to quantify at an analytical level. This paper shows a solution for treating membership function inside hardware circuits. The proposed hardware structure optimizes the memoried size by using particular form of the vectorial representation. The process of memorizing fuzzy sets, i.e. their membership function, has always been one of the more problematic issues for the hardware implementation, due to the quite large memory space that is needed. To simplify such an implementation, it is commonly [1,2,8,9,10,11] used to limit the membership functions either to those having triangular or trapezoidal shape, or pre-definite shape. These kinds of functions are able to cover a large spectrum of applications with a limited usage of memory, since they can be memorized by specifying very few parameters ( ight, base, critical points, etc.). This however results in a loss of computational power due to computation on the medium points. A solution to this problem is obtained by discretizing the universe of discourse U, i.e. by fixing a finite number of points and memorizing the value of the membership functions on such points [3,10,14,15]. Such a solution provides a satisfying computational speed, a very high precision of definitions and gives the users the opportunity to choose membership functions of any shape. However, a significant memory waste can as well be registered. It is indeed possible that for each of the given fuzzy sets many elements of the universe of discourse have a membership value equal to zero. It has also been noticed that almost in all cases common points among fuzzy sets, i.e. points with non null membership values are very few. More specifically, in many applications, for each element u of U, there exists at most three fuzzy sets for which the membership value is ot null [3,5,6,7,12,13]. Our proposal is based on such hypotheses. Moreover, we use a technique that even though it does not restrict the shapes of membership functions, it reduces strongly the computational time for the membership values and optimizes the function memorization. In figure 1 it is represented a term set whose characteristics are common for fuzzy controllers and to which we will refer in the following. The above term set has a universe of discourse with 128 elements (so to have a good resolution), 8 fuzzy sets that describe the term set, 32 levels of discretization for the membership values. Clearly, the number of bits necessary for the given specifications are 5 for 32 truth levels, 3 for 8 membership functions and 7 for 128 levels of resolution. The memory depth is given by the dimension of the universe of the discourse (128 in our case) and it will be represented by the memory rows. The length of a world of memory is defined by: Length = nem (dm(m)+dm(fm) Where: fm is the maximum number of non null values in every element of the universe of the discourse, dm(m) is the dimension of the values of the membership function m, dm(fm) is the dimension of the word to represent the index of the highest membership function. In our case then Length=24. The memory dimension is therefore 128*24 bits. If we had chosen to memorize all values of the membership functions we would have needed to memorize on each memory row the membership value of each element. Fuzzy sets word dimension is 8*5 bits. Therefore, the dimension of the memory would have been 128*40 bits. Coherently with our hypothesis, in fig. 1 each element of universe of the discourse has a non null membership value on at most three fuzzy sets. Focusing on the elements 32,64,96 of the universe of discourse, they will be memorized as follows: The computation of the rule weights is done by comparing those bits that represent the index of the membership function, with the word of the program memor . The output bus of the Program Memory (μCOD), is given as input a comparator (Combinatory Net). If the index is equal to the bus value then one of the non null weight derives from the rule and it is produced as output, otherwise the output is zero (fig. 2). It is clear, that the memory dimension of the antecedent is in this way reduced since only non null values are memorized. Moreover, the time performance of the system is equivalent to the performance of a system using vectorial memorization of all weights. The dimensioning of the word is influenced by some parameters of the input variable. The most important parameter is the maximum number membership functions (nfm) having a non null value in each element of the universe of discourse. From our study in the field of fuzzy system, we see that typically nfm 3 and there are at most 16 membership function. At any rate, such a value can be increased up to the physical dimensional limit of the antecedent memory. A less important role n the optimization process of the word dimension is played by the number of membership functions defined for each linguistic term. The table below shows the request word dimension as a function of such parameters and compares our proposed method with the method of vectorial memorization[10]. Summing up, the characteristics of our method are: Users are not restricted to membership functions with specific shapes. The number of the fuzzy sets and the resolution of the vertical axis have a very small influence in increasing memory space. Weight computations are done by combinatorial network and therefore the time performance of the system is equivalent to the one of the vectorial method. The number of non null membership values on any element of the universe of discourse is limited. Such a constraint is usually non very restrictive since many controllers obtain a good precision with only three non null weights. The method here briefly described has been adopted by our group in the design of an optimized version of the coprocessor described in [10].

  • PDF

Weekday Internet Game Times and Domestic Factors of Middle & High School Students (중고등학생의 평일 인터넷 게임시간과 가정환경 요인)

  • Kim, Eun Yeob;Lee, Jee Young
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.13 no.11
    • /
    • pp.5326-5336
    • /
    • 2012
  • Most middle and high school students in Korea use internet for gaming and recreation. This study aimed to classify middle and high school students according to amount of time they spend playing games and analyze relationship domestic factors. Weekday game times and environmental factors of the adolescents in Korea. The group with average game time of 30 min, 0:30-1:30 hours, 1:30-3:00 hours, over 4:00 hours. Subjects in this study were 6,487 middle and high school students. For the category "thoughts about game characters", the group with average game time of 1:30~3:00 hours replied "not at all" but the group with average game time of over 4:00 hours replied "sometimes", which was significantly different from the previous group. Similarly, for the category "lack of time for homework", the group with average game time of 1:30~3:00 hours replied "not at all", which significantly differed from the "sometimes" response from the group with average game time. For satisfaction with interest, "average" was the most frequent response from all the groups. Analyzing correlation of factors influencing game addiction in subjects with game time showed that factors related to game addiction diagnosis and academic performance were especially different in the group with average game time of over 4:00 hours compared to other groups. Nowadays internet has taken a large and significant part of our life such that a life without internet is hard to imagine, and our dependency on internet has risen at the same time. Accordingly, education on appropriate utilization and correct usage of internet to youths who lack self-control and judgment is very needed.

Finite Element Model Updating Based on Data Fusion of Acceleration and Angular Velocity (가속도 및 각속도 데이터 융합 기반 유한요소모델 개선)

  • Kim, Hyun-Jun;Cho, Soo-Jin;Sim, Sung-Han
    • Journal of the Korea institute for structural maintenance and inspection
    • /
    • v.19 no.2
    • /
    • pp.60-67
    • /
    • 2015
  • The finite element (FE) model updating is a commonly used approach in civil engineering, enabling damage detection, design verification, and load capacity identification. In the FE model updating, acceleration responses are generally employed to determine modal properties of a structure, which are subsequently used to update the initial FE model. While the acceleration-based model updating has been successful in finding better approximations of the physical systems including material and sectional properties, the boundary conditions have been considered yet to be difficult to accurately estimate as the acceleration responses only correspond to translational degree-of-freedoms (DOF). Recent advancement in the sensor technology has enabled low-cost, high-precision gyroscopes that can be adopted in the FE model updating to provide angular information of a structure. This study proposes a FE model updating strategy based on data fusion of acceleration and angular velocity. The usage of both acceleration and angular velocity gives richer information than the sole use of acceleration, allowing the enhanced performance particularly in determining the boundary conditions. A numerical simulation on a simply supported beam is presented to demonstrate the proposed FE model updating approach.

Study on a Neural UPC by a Multiplexer Information in ATM (ATM 망에서 다중화기 정보에 의한 Neural UPC에 관한 연구)

  • Kim, Young-Chul;Pyun, Jae-Young;Seo, Hyun-Seung
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.36C no.7
    • /
    • pp.36-45
    • /
    • 1999
  • In order to control the flow of traffics in ATM networks and optimize the usage of network resources, an efficient control mechanism is necessary to cope with congestion and prevent the degradation of network performance caused by congestion. In this paper, Buffered Leaky Bucket which applies the same control scheme to a variety of traffics requiring the different QoS(Quality of Service) and Neural Networks lead to the effective buffer utilization and QoS enhancement in aspects of cell loss rate and mean transfer delay. And the cell scheduling algorithms such as DWRR and DWEDF for multiplexing the incoming traffics are enhanced to get the better fair delay. The network congestion information from cell scheduler is used to control the predicted traffic loss rate of Neural Leaky Bucket, and token generation rate and buffer threshold are changed by the predicted values. The prediction of traffic loss rate by neural networks can enhance efficiency in controlling the cell loss rate and cell transfer delay of next incoming cells and also be applied for other traffic controlling schemes. Computer simulation results performed for random cell generation and traffic prediction show that QoSs of the various kinds of traffcis are increased.

  • PDF

Effect of Hardening Accelerators on the Adiabatic Temperature property Properties of Precast Concrete and FEM analysis for Evaluating the Crack Performance (경화촉진제를 사용한 프리캐스트 콘크리트의 단열온도특성 및 FEM해석에 의한 균열성능 평가에 관한 연구)

  • Min, Tae-Beom;Cho, In-Sung;Mun, Young-Bum;Lee, Han-Seung
    • Journal of the Korea Institute of Building Construction
    • /
    • v.15 no.1
    • /
    • pp.25-33
    • /
    • 2015
  • In this study, initial crack index was evaluated by FEM analysis to find the crack propagation from hydration heat in precast concrete. As results, as the usage of hardening accelerator increased, initial compressive strength increased and setting time was shortened. Additionally, as amounts of hardening accelerators increased, the central temperature of concrete increased and the time to reach the highest temperature was shortened. It was demonstrated that the hardening accelerators accelerated the hydration reaction of cement, and caused the increase of hydration heat within the short period of time. Furthermore, the crack index for evaluating the heat level was performed by FEM. As results, there was no problem about the cracks, despite of the growth of initial high hydration heat. This is because of the increased tensile strength that is large enough to sustain the thermally induced-stress.