• Title/Summary/Keyword: a-open set

Search Result 1,009, Processing Time 0.026 seconds

A Study on Electronic Commerce Transaction Modeling based on SET (SET을 기반으로 한 전자상거래 트랜잭션 모델링에 대한 연구)

  • 고영철;송병열;조현규;함호상
    • The Journal of Society for e-Business Studies
    • /
    • v.2 no.1
    • /
    • pp.79-94
    • /
    • 1997
  • Commerce activities which are free form space and time constraint using a communication network are called Electronic Commerce(EC). Because of sending a commercial information using open network such as Internet in EC, they need the security of commerce information (payment information and purchase information), checking the integrity of transferring data and certifying all parts participated in commerce for a secure commerce. Recently Visa and MasterCard Co. released the Secure Electronic Transaction (SET) Protocol for secure payment card transaction on Internet. This paper proposes a Secure Electronic Commerce Transaction Model(SECTM) using SET in order to support the secure commerce on Internet. The proposed transaction model prevents merchant from abusing the cardholder's payment information (credit-card number etc.) and enables cardholder to shop securely in Electronic Shopping Mall.

  • PDF

Partial Pole Assignment via Constant Gain Feedback in Two Classes of Frequency-domain Models

  • Wang, Guo-Sheng;Yang, Guo-Zhen;Duan, Guang-Ren
    • International Journal of Control, Automation, and Systems
    • /
    • v.5 no.2
    • /
    • pp.111-116
    • /
    • 2007
  • The design problem of partial pole assignment (PPA) in two classes of frequency-domain MIMO models by constant gain feedback is investigated in this paper. Its aim is to design a constant gain feedback which changes only a subset of the open-loop eigenvalues, while the rest of them are kept unchanged in the closed-loop system. A near general parametric expression for the feedback gain matrix in term of a set of design parameter vectors and the set of the closed-loop poles, and a simple parametric approach for solving the proposed problem are presented. The set of poles do not need to be previously prescribed, and can be set undetermined and treated together with the set of parametric vectors as degrees of design freedom provided by the approach. An illustrative example shows that the proposed parametric method is simple and effective.

Dynamics of the Macpherson Strut Motor-Vehicle Suspension System in Point and Joint Coordinates

  • Attia, Hazem-Ali
    • Journal of Mechanical Science and Technology
    • /
    • v.17 no.9
    • /
    • pp.1287-1296
    • /
    • 2003
  • In this paper the dynamic analysis of the Macpherson strut motor-vehicle suspension system is presented. The equations of motion are formulated using a two-step transformation. Initially, the equations of motion are derived for a dynamically equivalent constrained system of particles that replaces the rigid bodies by applying Newton's second law The equations of motion are then transformed to a reduced set in terms of the relative joint variables. Use of both Cartesian and joint variables produces an efficient set of equations without loss of generality For open chains, this process automatically eliminates all of the non-working constraint forces and leads to an efficient solution and integration of the equations of motion. For closed loops, suitable joints should be cut and few cut-joints constraint equations should be included for each closed chain. The chosen suspension includes open and closed loops with quarter-car model. The results of the simulation indicate the simplicity and generality of the dynamic formulation.

A Test Generation Algorithm for CMOS Complex Gates (CMOS Complex Gates의 테스트 생성 알고리즘)

  • 조상복;임인칠
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.21 no.5
    • /
    • pp.55-60
    • /
    • 1984
  • With the advancement of CMOS technology, it has become attractive to employ complex gate structures in realizing digital circuits. A new test generation algorithm for CMOS complex gates to detect all stuck-open and stuck-on faults considering internal gate response and unknown state is proposed. Minimal and complete set can be derived by this algorithm. Also, it is verified that such a test set is generated applying this algorithm to arbitrary CMOS complex gates by computer.

  • PDF

Fuzzy Pairwise $-continuous Mapping

  • 박거덕;임영빈
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.6 no.2
    • /
    • pp.106-110
    • /
    • 1996
  • In this paper, we define a (${\tau}_i, {\tauj}$)-fuzzy $\beta-open$ set and a fuzzy pairwise fuzzy $-continuous mapping on fuzzy bitopological spaces ans study some of their properites.

  • PDF

Performance Verification Process for Introduction of Open Source Software -centered on introduction of Linux into the NEIS-

  • Kim Doo-Yeon;Kim Jong-Bae;Rhew Sung-Yul
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.11 no.3
    • /
    • pp.59-68
    • /
    • 2006
  • Recently, introduction of Open Source Software into informatization of the government and public sector has been actively examined, however, Open Source Software is being rarely adopted due to the lack of verified and reliable data with regard to the criteria, process, performance and stability for introduction of Open Source Software. In this paper, the process, method and plan for performance verification for introduction of Open Source Software into mission critical systems of the government and public sector are suggested in order to solve the aforesaid problem Specially, a test system to judge whether or not to adopt Open Source Software in school affairs system of the NEIS(National Education Information System) of the Korean government was set up, and the method and process of performance verification by stage in addition to feasibility study were applied to the test system for verification. Based on the result of performance evaluation in the test system, the application of Linux to school affairs system of the NEIS is being successfully practiced. It is expected that this study will be a guideline to technical review process and performance verification method as necessary to introduce Open Source Software into the mission critical systems of government and public agencies.

  • PDF

The Development of Reusable SoC Platform based on OpenCores Soft Processor for HW/SW Codesign

  • Bin, Young-Hoon;Ryoo, Kwang-Ki
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.4
    • /
    • pp.376-382
    • /
    • 2008
  • Developing highly cost-efficient and reliable embedded systems demands hardware/software co-design and co-simulation due to fast TTM and verification issues. So, it is essential that Platform-Based SoC design methodology be used for enhanced reusability. This paper addresses a reusable SoC platform based on OpenCores soft processor with reconfigurable architectures for hardware/software codesign methodology. The platform includes a OpenRISC microprocessor, some basic peripherals and WISHBONE bus and it uses the set of development environment including compiler, assembler, and debugger. The platform is very flexible due to easy configuration through a system configuration file and is reliable because all designed SoC and IPs are verified in the various test environments. Also the platform is prototyped using the Xilinx Spartan3 FPGA development board and is implemented to a single chip using the Magnachip cell library based on $0.18{\mu}m$ 1-poly 6-metal technology.

A Detection Tool of First Races in OpenMP Programs with Directives (OpenMP 디렉티브 프로그램의 최초경합 탐지를 위한 도구)

  • Kang, Mun-Hye;Ha, Ok-Kyoon;Jun, Yong-Kee
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.37 no.1
    • /
    • pp.1-7
    • /
    • 2010
  • Detecting data races is important for debugging programs with OpenMP directives, because races result in unintended non-deterministic executions of the program. It is especially important to detect the first data races to occur for effective debugging, because the removal of such races may make other affected races disappear or appear. The previous tools for race detecting can not guarantee that detected races are the first races to occur. This paper suggests a tool what detects the first races to occur on the program with nested parallelism using the two-pass on-the-fly technique. To show functionality of this tool, we empirically compare with the previous tools using a set of the synthetic programs with OpenMP directives.

APPLICATION OF $\tilde{G}{\alpha}$-CLOSED SETS

  • Kim, Young Key;Devi, R.;Selvakumar, A.
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.24 no.1
    • /
    • pp.1-9
    • /
    • 2011
  • The notion of ${\tilde{g}}{\alpha}$-closed sets in a topological space introduced by R. Devi and A. selvakumar [2]. In this paper, we introduce the concept of ${\tilde{g}}{\alpha}$-US spaces by utilizing ${\tilde{g}}{\alpha}$-open sets and study the basic properties of this space.

Implementing Efficient Camera ISP Filters on GPGPUs Using OpenCL (GPGPU 기반의 효율적인 카메라 ISP 구현)

  • Park, Jongtae;Facchini, Beron;Hong, Jingun;Burgstaller, Bernd
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2010.11a
    • /
    • pp.1784-1787
    • /
    • 2010
  • General Purpose Graphic Processing Unit (GPGPU) computing is a technique that utilizes the high-performance many-core processors of high-end graphic cards for general-purpose computations such as 3D graphics, video/image processing, computer vision, scientific computing, HPC and many more. GPGPUs offer a vast amount of raw computing power, but programming is extremely challenging because of hardware idiosyncrasies. The open computing language (OpenCL) has been proposed as a vendor-independent GPGPU programming interface. OpenCL is very close to the hardware and thus does little to increase GPGPU programmability. In this paper we present how a set of digital camera image signal processing (ISP) filters can be realized efficiently on GPGPUs using OpenCL. Although we found ISP filters to be memory-bound computations, our GPGPU implementations achieve speedups of up to a factor of 64.8 over their sequential counterparts. On GPGPUs, our proposed optimizations achieved speedups between 145% and 275% over their baseline GPGPU implementations. Our experiments have been conducted on a Geforce GTX 275; because of OpenCL we expect our optimizations to be applicable to other architectures as well.