• Title/Summary/Keyword: Internet Uses

Search Result 1,491, Processing Time 0.02 seconds

Effects of The Enterprise Characteristics, CI Interest Level, and Informatization Level on CI Activities (기업 특성, 경쟁정보 관심도, 정보화 수준이 경쟁정보 활동에 미치는 영향)

  • 이헌성;강민철
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.27 no.4
    • /
    • pp.167-184
    • /
    • 2002
  • The importance of competitive intelligence (CI), which collects/uses information about competitors, industries, etc., has been increased due to the rapidly changing business environment of today. However, there exist few domestic researches on CI. With this background, a study of domestic companies was performed that examines how the enterprise characteristics, the interest on CI, and the informatization level affect the way/level and outcome of CI. Results showed that bigger enterprises have the higher interest on CI than smaller ones and enterprises having high interest perform CI activities systematically and variously including using the internet. Further, the results uncovered the enterprises performing CI actively use the information acquired from the activity effectively in their business. The results also revealed that there are no difference between the IT companies and the others and that the jnformatization level is irrelevant to the internet CI activity level.

Finding Impossible Differentials for Rijndael-like and 3D-like Structures

  • Cui, Ting;Jin, Chen-Hui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.3
    • /
    • pp.509-521
    • /
    • 2013
  • Impossible Differential Cryptanalysis (IDC) uses impossible differentials to discard wrong subkeys for the first or the last several rounds of block ciphers. Thus, the security of a block cipher against IDC can be evaluated by impossible differentials. This paper studies impossible differentials for Rijndael-like and 3D-like ciphers, we introduce methods to find 4-round impossible differentials of Rijndael-like ciphers and 6-round impossible differentials of 3D-like ciphers. Using our methods, various new impossible differentials of Rijndael and 3D could be searched out.

A Parsing Algorithm for Constructing Incremental Threaded Tree (점진적 스레드 트리를 구성하기 위한 파싱 알고리즘)

  • Lee Dae-Sik
    • Journal of Internet Computing and Services
    • /
    • v.7 no.4
    • /
    • pp.91-99
    • /
    • 2006
  • The incremental parsing technique plays an important role in language-based environment which allows the incremental construction of a program. It improves the performance of a system by reanalyzing only the changed part of a program. The conventional incremental parsing uses the stack data structure in order to store the parsing information. In this paper, we suggest a threaded tree construction algorithm which parse by adding the threaded node address instead of using a stack data structure. We also suggest an incremental threaded tree construction which has incremental parsing process of five steps using the constructed threaded tree.

  • PDF

Brain-Operated Typewriter using the Language Prediction Model

  • Lee, Sae-Byeok;Lim, Heui-Seok
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.10
    • /
    • pp.1770-1782
    • /
    • 2011
  • A brain-computer interface (BCI) is a communication system that translates brain activity into commands for computers or other devices. In other words, BCIs create a new communication channel between the brain and an output device by bypassing conventional motor output pathways consisting of nerves and muscles. This is particularly useful for facilitating communication for people suffering from paralysis. Due to the low bit rate, it takes much more time to translate brain activity into commands. Especially it takes much time to input characters by using BCI-based typewriters. In this paper, we propose a brain-operated typewriter which is accelerated by a language prediction model. The proposed system uses three kinds of strategies to improve the entry speed: word completion, next-syllable prediction, and next word prediction. We found that the entry speed of BCI-based typewriter improved about twice as much through our demonstration which utilized the language prediction model.

A Contingent Analyses on the Relationship Between the Characteristics of Internet Shopping Mall and User Acceptance (인터넷 쇼핑몰의 특성과 사용자 수용간의 상황적 관계분석)

  • Suh, Kun-Soo
    • Asia pacific journal of information systems
    • /
    • v.11 no.2
    • /
    • pp.23-55
    • /
    • 2001
  • It is generally agreed that realizing the full potential of the internet shopping mall(ISM) requires careful identification of customer needs and expectations. However, a quantitative framework to explain and predict users' behavior toward ISM has not been well established because the research on the user acceptance of ISM is still in its infancy. This study proposes a model which uses factor analysis to identify factors of ISM characteristics and individual characteristics affecting user acceptance of ISM. Predictive models based on the multiple regression analyses select the factors and their interactions with individual characteristics that significantly influence user acceptance. Results show that five factors including economy, convenience, credibility, reliability, information risks, and performance risks affects user acceptance. In addition, individual differences in terms of innovativeness, playfulness, and recreational shopping traits have both direct and interaction effects on user acceptance. The implication of this study is that, although user attitudes towards ISM characteristics in general are important to their acceptance behavior, the level of importance depends upon different user groups.

  • PDF

Web-based Simulation System for Multibody Systems

  • Han, Hyung-Suk
    • International Journal of Precision Engineering and Manufacturing
    • /
    • v.4 no.6
    • /
    • pp.50-60
    • /
    • 2003
  • A web-based dynamic simulation system, called O-DYN, for multibody systems is developed. All the interfaces of the system are accessible via web browsers, such as Netscape or Explorer. The system uses a block-diagram type O-DYN/Modeler developed in JAVA Applet as a preprocessor. The O-DYN postprocessor composed of O-DYN/Plotter and O-DYN/Animator is developed in JAVA Applet. The O-DYN/Solver for predicting the dynamic behavior is run on the web server. Anyone who wants to simulate the dynamics of multibody systems or share results data can access the analysis system over the internet regardless of their OS, platform, or location.

Adaptive Power Control Using Large Scale Antenna of the Massive MIMO System in the Mobile Communication

  • Ha, Chang-Bin;Jang, Byung-Jun;Song, Hyoung-Kyu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.8
    • /
    • pp.3068-3078
    • /
    • 2015
  • Although the massive MIMO system supports a high throughput, it requires a lot of channel information for channel compensation. For the reduction of overhead, the massive MIMO system generally uses TDD as duplexing scheme. Therefore, the massive MIMO system is sensitive to rapidly changing fast fading in according to time. For the improvement of reduced SINR by fast fading, the adaptive power control is proposed. Unlike the conventional scheme, the proposed scheme considers mobility of device for adaptive power control. The simulation of the proposed scheme is performed with consideration for mobility of device. The result of the simulation shows that the proposed scheme improves SINR. Since SINR is decreased in according to the number of device in the network by unit of cell, each base station can accommodate more devices by the proposed scheme. Also, because the massive MIMO system with high SINR can use high order modulation scheme, it can support higher throughput.

A Lossless Data Hiding Scheme for VQ Indexes Based on Joint Neighboring Coding

  • Rudder, Andrew;Kieu, The Duc
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.8
    • /
    • pp.2984-3004
    • /
    • 2015
  • Designing a new reversible data hiding technique with a high embedding rate and a low compression rate for vector quantization (VQ) compressed images is encouraged. This paper proposes a novel lossless data hiding scheme for VQ-compressed images based on the joint neighboring coding technique. The proposed method uses the difference values between a current VQ index and its left and upper neighboring VQ indexes to embed n secret bits into one VQ index, where n = 1, 2, 3, or 4. The experimental results show that the proposed scheme achieves the embedding rates of 1, 2, 3, and 4 bits per index (bpi) with the corresponding average compression rates of 0.420, 0.483, 0.545, and 0.608 bit per pixel (bpp) for a 256 sized codebook. These results confirm that our scheme performs better than other selected reversible data hiding schemes.

Indicator Elimination for Locally Adaptive Scheme Using Data Hiding Technique

  • Chang, Hon-Hang;Chou, Yung-Chen;Shih, Timothy K.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.12
    • /
    • pp.4624-4642
    • /
    • 2014
  • Image compression is a popular research issue that focuses on the problems of reducing the size of multimedia files. Vector Quantization (VQ) is a well-known lossy compression method which can significantly reduce the size of a digital image while maintaining acceptable visual quality. A locally adaptive scheme (LAS) was proposed to improve the compression rate of VQ in 1997. However, a LAS needs extra indicators to indicate the sources, consequently the compression rate of LAS will be affected. In this paper, we propose a novel method to eliminate the LAS indicators and so improve the compression rate. The proposed method uses the concept of data hiding to conceal the indicators, thus further improving the compression rate of LAS. From experimental results, it is clearly demonstrated that the proposed method can actually eliminate the extra indicators while successfully improving the compression rate of the LAS.

A Closeness Centrality Analysis Algorithm for Workflow-supported Social Networks (워크플로우 소셜 네트워크 근접중심성 분석 알고리즘)

  • Park, Sungjoo;Kim, Kwanghoon Pio
    • Journal of Internet Computing and Services
    • /
    • v.14 no.5
    • /
    • pp.77-85
    • /
    • 2013
  • This paper proposes a closeness centrality analysis algorithm for workflow-supported social networks that represent the collaborative relationships among the performers who are involved in a specific workflow model. The proposed algorithm uses the social network analysis techniques, particularly closeness centrality equations, to analyze the closeness centrality of the workflow-supported social network. Additionally, through an example we try to verify the accuracy and appropriateness of the proposed algorithm.