• Title/Summary/Keyword: Information Exchange Requirements

Search Result 152, Processing Time 0.028 seconds

A Comparative Legal Study on the Electronic Transactions Act in Thailand (태국의 전자거래법에 대한 비교법적 고찰 - 전문 및 일반규정을 중심으로 -)

  • Shim, Chong-Seok;Oh, Hyon-Sok
    • International Commerce and Information Review
    • /
    • v.12 no.4
    • /
    • pp.405-427
    • /
    • 2010
  • This legal study is to compare the Electronic Transactions Act in Thailand(hereinafter 'ETA') with mainly other countries electronic transactions acts, such as UNCITRAL MLEC, UECIC, VETA, UCITA and Korea' Electronic Transactions Act The ETA is consisted of 6 chapters which included preamble and definitions. Each chapter's main point as follows. Preamble is related to the name, time of legal effect, scope and definitions. Chapter 1 is not only general principles of electronic transactions, required restriction in addition to specify the limit of application, documentation, evidential weight in reference to the data message, but also the conditions of offer and acceptance through data message, time and place of dispatch and receipt of data message, certification between origination and addressee. According to media-neutrality and the effectiveness security requirement of data message under the information system, legal certification is related to the exchange's declaration of intention, define about origination-addressee of data message. Chapter 2 is composed to provide expressly about the effectiveness security in electronic signature. Those contents are to compare the MLEC, UECIC and Electronic Transactions Act in Korea. Chapter 3 is related to legal definitions that present legal requirement about service relating electronic transaction which contents accept domestic law, the adequate requirement as eligibility, satisfied matter, self-reliance ratio of finance and other detail standard Chapter 4 is deal with the transaction which are public sector and those application requirements. And also this chapter are composed regulations about direct-indirect purpose of Thailand domestic electronic government.

  • PDF

MSCT: AN EFFICIENT DATA COLLECTION HEURISTIC FOR WIRELESS SENSOR NETWORKS WITH LIMITED SENSOR MEMORY CAPACITY

  • Karakaya, Murat
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.9
    • /
    • pp.3396-3411
    • /
    • 2015
  • Sensors used in Wireless Sensor Networks (WSN) have mostly limited capacity which affects the performance of their applications. One of the data-gathering methods is to use mobile sinks to visit these sensors so that they can save their limited battery energies from forwarding data packages to static sinks. The main disadvantage of employing mobile sinks is the delay of data collection due to relative low speed of mobile sinks. Since sensors have very limited memory capacities, whenever a mobile sink is too late to visit a sensor, that sensor's memory would be full, which is called a 'memory overflow', and thus, needs to be purged, which causes loss of collected data. In this work, a method is proposed to generate mobile sink tours, such that the number of overflows and the amount of lost data are minimized. Moreover, the proposed method does not need either the sensor locations or sensor memory status in advance. Hence, the overhead stemmed from the information exchange of these requirements are avoided. The proposed method is compared with a previously published heuristic. The simulation experiment results show the success of the proposed method over the rival heuristic with respect to the considered metrics under various parameters.

Communication Delay Properties in Performance Model of PROFIBUS Token Passing Protocol (PROFIBUS 토큰 패싱 프로토콜의 성능모델에서의 전송지연 특성)

  • Kim, Hyun-Hee;Lee, Kyung-Chang;Lee, Seok
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2002.10a
    • /
    • pp.511-514
    • /
    • 2002
  • In may automated systems such as manufacturing systems and process plants, an industrial network or fieldbus is a very important component for the exchange of various and sometimes crucial information. Some of the information has a tendency to rapidly lose its value as time elapses after its creation. Such information or data is called real-time data that includes sensor values and control commands. In order to deliver these data in time, the fieldbus network should be tailored to have short delay with respect to the individual time limit of various data. Fine-tuning the network for a given traffic requires the knowledge on the relationship between the protocol parameters such as timer values and the performance measure such as network delay. This paper presents a mathematical performance model to calculate communication delays of the Profibus FMS network when the timer value TTR and the traffic characteristics are given. The results of this model is compared to those from experiments to assess the model's validity.

  • PDF

Performance Analysis of Timer Assignment and Utilization of the IEEE 802.4 Token Bus for Real Time Processing (실시간 처리를 위한 IEEE 802.4 토큰버스 네트워크의 타이어 할당과 유용도 처리 성능 해석)

  • Kim, Jeong-Ho;Lee, Min-Nam;Lee, Sang-Beom
    • The Transactions of the Korea Information Processing Society
    • /
    • v.1 no.3
    • /
    • pp.357-366
    • /
    • 1994
  • The IEEE 802.4 token bus has been widely accepted as the standard for factory local area networks. The priority option of the 802.4 standard supports multiple classes of traffic by using a set of timers to control information exchange. The performance of the 802.4 priority mechanism in industrial real time control is examined. A timer assignment technique is presented for such applications. The timers are set to satisfy the worst case access delay requirements of real time control applications. Other applications that are not time constrainted can be supported simultaneously. In fact under certain conditions, such applications can also be guaranteed a minimum bandwidth allocation. Simulation results are used to evaluate the timer assignment and utililization.

  • PDF

A Study on the Application of Engineering Design Problem using Web Service (웹 서비스를 이용한 공학설계 적용에 관한 연구)

  • Park, Chang-Kyu
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.47 no.6
    • /
    • pp.831-835
    • /
    • 2010
  • Currently, engineering design is carried out in a distributed manner geographically or physically. This imposes new requirements on the computational environments, such as efficient integration and collaboration in the Internet and network environments. Meanwhile, Web-based distributed design has led new paradigms in design and manufacturing fields. For example, Web-based technologies have reduced the product development time and to ensure a competitive product in order to exchange and interact of real-time design information that integrates the distributed design environment between departments as well as companies via Internet and Web. Hence, efficient data communication for design information sharing is the basis for collaborative systems in the distributed environments. Design data communication techniques such as CORBA, DCOM, and JAVA RMI have been considered in the existing research, but these techniques have some disadvantages such as limitations of interoperability and firewall problems. This paper presents the application of engineering design problems in which distributed design information resources are integrated and exchanged using Web Service for supporting XML and HTTP without interoperability and firewall problems.

Middleware for Context-Aware Ubiquitous Computing

  • Hung Q.;Sungyoung
    • Korea Information Processing Society Review
    • /
    • v.11 no.6
    • /
    • pp.56-75
    • /
    • 2004
  • In this article we address some system characteristics and challenging issues in developing Context-aware Middleware for Ubiquitous Computing. The functionalities of a Context-aware Middleware includes gathering context data from hardware/software sensors, reasoning and inferring high-level context data, and disseminating/delivering appropriate context data to interested applications/services. The Middleware should facilitate the query, aggregation, and discovery for the contexts, as well as facilities to specify their privacy policy. Following a formal context model using ontology would enable syntactic and semantic interoperability, and knowledge sharing between different domains. Moddleware should also provide different kinds of context classification mechanical as pluggable modules, including rules written in different types of logic (first order logic, description logic, temporal/spatial logic, fuzzy logic, etc.) as well as machine-learning mechanical (supervised and unsupervised classifiers). Different mechanisms have different power, expressiveness and decidability properties, and system developers can choose the appropriate mechanism that best meets the reasoning requirements of each context. And finally, to promote the context-trigger actions in application level, it is important to provide a uniform and platform-independent interface for applications to express their need for different context data without knowing how that data is acquired. The action could involve adapting to the new environment, notifying the user, communicating with another device to exchange information, or performing any other task.

  • PDF

Digitalization of Financial Reporting through XBRL and Corporate Tax Avoidance: Evidence from Indonesia

  • Sameh KOBBI-FAKHFAKH;Souleimane ATHIE
    • Asia pacific journal of information systems
    • /
    • v.33 no.4
    • /
    • pp.1016-1035
    • /
    • 2023
  • Corporate tax avoidance has been the subject of international debate since the Enron scandal and has raised awareness of the need for greater transparency in financial markets. Efforts have been made to strengthen financial reporting requirements and meet the needs of investors and other stakeholders, including digitalization of financial reporting through Extensible Business Reporting Language (XBRL). This study examines the impact of the mandatory adoption of XBRL on corporate tax avoidance. We tested our predictions using a panel dataset of Indonesian firms listed on the IDX stock exchange. Based on available information in the DATASTREAM database covering the 2013-2017 period, we used two proxies for tax avoidance i.e., GAAP effective tax rate and current effective tax rate. We estimated multiple regression model including industry and year fixed effects. The results show that XBRL implementation has reduced corporate tax avoidance. These findings suggest that improving corporate transparency through XBRL could play a deterrent tool to corporate tax avoidance. The results of this study should be useful to tax authorities and accounting standard setters supporting the benefits of digitalizing financial reporting and continuing to complete XBRL taxonomies around the world.

An Efficient RFID Distance-Bounding Protocol to Prevent Relay Attacks (중계 공격을 예방하는 효율적인 RFID Distance-Bounding 프로토콜)

  • Boo, Chang-Hee;Jun, Moon-Seog
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.4B
    • /
    • pp.610-619
    • /
    • 2010
  • RFID (radio frequency identification) systems, recently being used in a wide range of areas, are vulnerable to relay attack from malicious attackers. For that reason, Brands, et al. proposed a certification protocol between a certifier and a verifier based on the concept of distance-bounding, and in addition Hancke et al. introduced the concept of RFID. However, the delivery of tag IDs, one of the main RFID features, is not still available, and there are two important demerits: anonymity in the delivery of tag IDs suggested by Kim et al. and inefficiency in finding a tag ID with regard to how to check errors which may occur in the process of data exchange between readers and tags. Therefore, this study proposes a protocol that meets the requirements of tag anonymity and location untraceability, has resistance to errors which may take place in the phase of tag data exchange, and is very efficient in finding tag IDs.

Provably Secure Tree-Based Centralized Group Key Distribution: Security Model and Modular Approach (증명 가능한 트리기반 중앙 분배 방식의 그룹키 기법: 안전성 모델 및 변환모듈)

  • Kim Hyun-Jeong;Lee Su-Mi;Lee Dong Hoon
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.14 no.6
    • /
    • pp.69-78
    • /
    • 2004
  • During the last decade, security models have been defined for two- and three-parity key exchange protocols. Currently there is a growing research interest in security models for group key management schemes. While various security models and provably secure protocols have been proposed for distributed group key exchange schemes, no results are hewn for centralized group key distribution schemes in spite of their theoretical and practical importance. We describe security requirements and a formal security model for centralized group key distribution scheme: we define the model on the channel controlled by adversaries with the ability of strong user corruption. In the security model, we propose a conversion module which can transform centralized tree-based group key distribution schemes in the literature to provably secure centralized tree-based group key distribution schemes.

Game Theory based Dynamic Spectrum Allocation for Secondary Users in the Cell Edge of Cognitive Radio Networks

  • Jang, Sungjin;Kim, Jongbae;Byun, Jungwon;Shin, Yongtae
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.7
    • /
    • pp.2231-2245
    • /
    • 2014
  • Cognitive Radio (CR) has very promising potential to improve spectrum utilization by allowing unlicensed Secondary Users (SUs) to access the spectrum dynamically without disturbing licensed Primary Users (PUs). Mitigating interference is a fundamental problem in CR scenarios. This is particularly problematic for deploying CR in cellular networks, when users are located at the cell edge, as the inter-cell interference mitigation and frequency reuse are critical requirements for both PUs and SUs. Further cellular networks require higher cell edge performance, then SUs will meet more challenges than PUs. To solve the performance decrease for SUs at the cell edge, a novel Dynamic Spectrum Allocation (DSA) scheme based on Game Theory is proposed in this paper. Full frequency reuse can be realized as well as inter-cell interference mitigated according to SUs' sensing, measurement and interaction in this scheme. A joint power/channel allocation algorithm is proposed to improve both cell-edge user experience and network performance through distributed pricing calculation and exchange based on game theory. Analytical proof is presented and simulation results show that the proposed scheme achieves high efficiency of spectrum usage and improvement of cell edge SUs' performance.