• Title/Summary/Keyword: Data Transactions

Search Result 8,803, Processing Time 0.029 seconds

Research on Mining Technology for Explainable Decision Making (설명가능한 의사결정을 위한 마이닝 기술)

  • Kyungyong Chung
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.24 no.4
    • /
    • pp.186-191
    • /
    • 2023
  • Data processing techniques play a critical role in decision-making, including handling missing and outlier data, prediction, and recommendation models. This requires a clear explanation of the validity, reliability, and accuracy of all processes and results. In addition, it is necessary to solve data problems through explainable models using decision trees, inference, etc., and proceed with model lightweight by considering various types of learning. The multi-layer mining classification method that applies the sixth principle is a method that discovers multidimensional relationships between variables and attributes that occur frequently in transactions after data preprocessing. This explains how to discover significant relationships using mining on transactions and model the data through regression analysis. It develops scalable models and logistic regression models and proposes mining techniques to generate class labels through data cleansing, relevance analysis, data transformation, and data augmentation to make explanatory decisions.

Design and Implementation of a Reprocessing Transaction Model for Mobile Computing Environments (모바일 컴퓨팅 환경을 위한 재수행 트랜잭션 모델의 설계 및 구현)

  • 김동현;홍봉희
    • Journal of KIISE:Databases
    • /
    • v.30 no.2
    • /
    • pp.184-196
    • /
    • 2003
  • Mobile transactions updating spatial objects are long transactions that can update independently local objects of mobile clients during disconnection. Validation based protocols that are well known to be appropriate for mobile transactions are required to abort a conflicted transaction in order to keep data consistent. Since abortion leads to cancel of all of tile updates, it is not desirable to use the abortion for resolving conflicts of mobile transactions. In this paper, we propose a reprocessing transaction model to resolve the update conflicts between mobile transactions without aborting them. We also design a mobile transaction server to support the reprocessing transaction and build a prototype of a mobile field system. The reprocessing transaction is a subtransaction of a newly committed mobile transaction and re-executes only conflicted objects with foreign conflicted objects. We also introduce a progressive reprocessing scheme to expose non-conflicted objects of the mobile transaction to other transactions in order to reduce starvation of reprocessing transactions.

Finding Meaningful Pattern of Key Words in IIE Transactions Using Text Mining (텍스트마이닝을 활용한 산업공학 학술지의 논문 주제어간 연관관계 연구)

  • Cho, Su-Gon;Kim, Seoung-Bum
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.38 no.1
    • /
    • pp.67-73
    • /
    • 2012
  • Identification of meaningful patterns and trends in large volumes of text data is an important task in various research areas. In the present study we crawled the keywords from the abstracts in IIE Transactions, one of the representative journals in the field of Industrial Engineering from 1969 to 2011. We applied low-dimensional embedding method, clustering analysis, association rule, and social network analysis to find meaningful associative patterns of key words frequently appeared in the paper.

A transaction-based vertical partitioning algorithm (트랜잭션 중심의 발견적 파일 수직 분한 방법)

  • 박기택;김재련
    • Journal of the military operations research society of Korea
    • /
    • v.22 no.1
    • /
    • pp.81-96
    • /
    • 1996
  • In a relational database environment, partitioning of data is directly concerned with the amount of data that needs to be required in a query or transaction. In this paper, we consider non-overlapping, vertical partitioning. Vertical partitioning algorithm in this paper is composed of two phases. In phase 1, we cluster the attributes with zero-one integer program that maximize affinity among attributes. The result of phase 1 is called 'Initial Fragments'. In phase 2, we modify Initial Fragments that is not directly considered by cost factors, making use of a transaction-based partitioning method. A transaction-based partitioning method is partitioning attributes according to a set of transactions. In this phase we select logical accesses which needs to be required in a transaction as comparison criteria. In phase 2, proposed algorithm consider only small number of modification of Initial Fragments in phase 1. This algorithm is so insensible to number of transactions and of attributes that it can applied to relatively large problems easily.

  • PDF

The Assessment of the Monetary Market of Russia at the Present Stage of Development

  • Vyborova, Elena Nikolaevna
    • East Asian Journal of Business Economics (EAJBE)
    • /
    • v.5 no.1
    • /
    • pp.33-49
    • /
    • 2017
  • This article can see the analysis of the monetary market of Russia at the present stage, its main segments. An assessment is given to the regulation of mechanism by liquidity, the transactions of the Bank of Russia on the provision of liquidity and on absorption of liquidity, the transaction of fixed action and the transaction in the public market are analyzed. To determine the tendency of development of the monetary market and its segments. In the work using the methods of multivariate statistics, the tools of financial mathematics. To be analyzed the amount of data from the 2015 -2016 year, the 2013 year. (daily data). Hypothesis 1. The dynamics of the money market of Russia at the present stage of development of domestic economy is rather stable. Hypothesis 2.The many transactions of regulation to decrease the liquidity of by monetary movement, the control function. Also in the article consider the contour of the financial transaction. This article reveals the theoretical bases of analysis of profitability of credit operations.

A System for Mining Traversal Patterns from Web Log Files (웹 로그 화일에서 순회 패턴 탐사를 위한 시스템)

  • 박종수;윤지영
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.10a
    • /
    • pp.4-6
    • /
    • 2001
  • In this paper, we designed a system that can mine user's traversal patterns from web log files. The system cleans an input data, transactions of a web log file, and finds traversal patterns from the transactions, each of which consists of one user's access pages. The resulting traversal patterns are shown on a web browser, which can be used to analyze the patterns in visual form by a system manager or data miner. We have implemented the system in an IBM personal computer running on Windows 2000 in MS visual C++, and used the MS SQL Server 2000 to store the intermediate files and the traversal patterns which can be easily applied to a system for knowledge discovery in databases.

  • PDF

Analysis of Blockchain Network and Cryptocurrency Safety Issues

  • Taegyu Lee
    • International journal of advanced smart convergence
    • /
    • v.12 no.3
    • /
    • pp.40-50
    • /
    • 2023
  • Blockchain is a technology designed to prevent tampering with digital documents or information, safeguarding transaction data and managing it in a structured manner. This proves beneficial in addressing issues of trust and data protection in B2B, B2C, and C2B transactions. Blockchain finds utility not only in financial transactions but also across diverse industrial sectors. This study outlines significant cases and responses that jeopardize the security of blockchain networks and cryptocurrency technology. Additionally, it analyzes safety and risk factors related to blockchain and proposes effective testing methods to preemptively counter these challenges. Furthermore, this study presents key security evaluation metrics for blockchain to ensure a balanced assessment. Additionally, it provides evaluation methods and various test case models for validating the security of blockchain and cryptocurrency transaction services, making them easily applicable to the testing process.

A feature data model in milling process planning (밀링 공정설계의 특징형상 데이터 모델)

  • Lee, Choong-Soo;Rho, Hyung-Min
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.21 no.2
    • /
    • pp.209-216
    • /
    • 1997
  • A feature is well known as a medium to integrate CAD, CAPP and CAM systems. For a part drawing including both simple geometry and compound geometry, a process plan such as the selection of process, machine tool, cutting tool etc. normally needs simple geometry data and non-geometry data of the feature as the input. However, a extended process plan such as the generation of process sequence, operation sequence, jig & fixture, NC program etc. necessarily needs the compound geometry data as well as the simple geometry data and non-geometry data. In this paper, we propose a feature data model according to the result of analyzing necessary data, including the compound geometry data, the simple geometry data and the non-geometry data. Also, an example of the feature data model in milling process planning is described.

Searchable Encrypted String for Query Support on Different Encrypted Data Types

  • Azizi, Shahrzad;Mohammadpur, Davud
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.10
    • /
    • pp.4198-4213
    • /
    • 2020
  • Data encryption, particularly application-level data encryption, is a common solution to protect data confidentiality and deal with security threats. Application-level encryption is a process in which data is encrypted before being sent to the database. However, cryptography transforms data and makes the query difficult to execute. Various studies have been carried out to find ways in order to implement a searchable encrypted database. In the current paper, we provide a new encrypting method and querying on encrypted data (ZSDB) for different data types. It is worth mentioning that the proposed method is based on secret sharing. ZSDB provides data confidentiality by dividing sensitive data into two parts and using the additional server as Dictionary Server. In addition, it supports required operations on various types of data, especially LIKE operator functioning on string data type. ZSDB dedicates the largest volume of execution tasks on queries to the server. Therefore, the data owner only needs to encrypt and decrypt data.

Multilevel Security Management for Global Transactions

  • Jeong, Hyun-Cheol
    • Proceedings of the IEEK Conference
    • /
    • 2000.07b
    • /
    • pp.735-738
    • /
    • 2000
  • The most important issue in database security is correct concurrency control under the restrictive security policy. The goal of secure transaction management is to keep security and provide many concurrent users with the high availability of database. In this paper, we consider the security environment of multidatabase system with replicated data. The read-from relationship in the existed serializability is improper in security environment. So, we define new read-from relationship and propose new secure 1-copy quasi-seriailzability by utilizing this relationship and display some examples. This security environment requires both the existed local autonomy and the security autonomy as newly defined restriction. To solve covert channel problem is the most difficult issue in developing secure scheduling scheme. The proposed secure 1-copy quasi-serializability is very proper for global transactions in that this serializability not violates security autonomy and prevents covert channel between global transactions.

  • PDF