Input Transactions Research Articles

IMPLEMENTASI DATA KEUANGAN DENGAN ZAHIR ACCOUNTING PADA PT. ANUGERAH ANALISIS SEMPURNA

With the number of data transactions that occur, if data collection is done manually much time wasted for financial data processing. Because many stages to be done to be able to produce financial statements. The resulting data is not necessarily accurate and appropriate. Accounting applications have been created to facilitate in making decisions on the business run. The use of computer accounting applications is very efficient and effective for a businessman or a trader in running his business. Processing financial data that only live input transaction data alone, can produce the desired report for decision making. By using Zahir Accounting the ease given is indeed designed as simple as possible so that users can easily understand the features provided. In the processing of data that has been inputted directly form the journal and also the financial statements. So it is very effective and efficient if using computer accounting application Zahir Accounting 5.1 version either beginners or professional.

Auto Accessories, Inc.: An Educational Case on Online Transaction Processing (OLTP) and Controls as Compared to Batch Processing and Controls

ABSTRACT The intent of this educational case is to increase students' understanding of online transaction processing (OLTP) and controls as compared to batch processing and controls. Learning concepts about batch processing is important because many entities continue to use batch processing for critical applications such as payroll, credit card processing, and Big Data. Students learn the advantages and disadvantages of batch processing and OLTP. The case provides a Microsoft Access database that includes a working batch program (module) and an online screen (form). Students use the form to update an employee table in a relational database with OLTP and use the module to update an employee master file with batch processing. Students compare the output from batch processing to the output from OLTP after processing the same input transactions and demonstrate that the outputs match when no input or processing errors exist. Students implement similar data validation edits in both the module and the form. Also, students implement run-to-run control total checks in the module and report input data errors in a batch-processed error report. Students learn processing and controls that are unique to batch processing, unique to OLTP, and common to both processing modes.

ANALISIS SISTEM AKUNTANSI PEMERINTAH PUSAT (SAPP) DI KANTOR AKUNTANSI REGIONAL JAKARTA

ABSTRACT - This research is intended to describe Central Government Accounting System (SAPP)implemented by the State Financial Accounting Agency (BAKUN) through The Regional Accounting Office(KAR) and the expected outcomes of Central Government Accounting System. In a accounting system, financialstatements generated rely on the accuracy and validity of data input transactions. The accuracy and validity ofthe Government's financial statements generated will depend on the quality of the work done by KARs inmanaging the Government's financial transaction data input.The method usedin this research isby analyzing the problems/obstaclesfaced by KAR Jakarta and alsoanalyzing the process performed by KAR Jakarta during 2000 – 20001. Analysis was performed on cashreceipt transactiondata processingsubsystem (Cash Receipt) and governmentcashexpenditures (CashDisbursement), and general ledger subsystem (General Ledger) used and done by using Analysis CriticalSuccess Factor (CSF), Performance Grid, Proses Modeling, Data Modeling, and Network Modeling. Theresult of this research shows that there are some problems/obstacles faced by KAR in managing data offinancial transactions of the Government. By using these results are then made efforts to repair the runningsystem.Keywords: Central Government Accounting System, Regional Accounting Office, Central AccountingSystem, process modeling, data modeling, critical success factor.

Assessing transaction efficiency for biomass: a case study of the Upper Peninsula of Michigan

In concordance to the renewable portfolio standard program, the state of Michigan promotes generation of renewable electricity through the renewable energy plan. Despite policy efforts, performance figures reveal an industry that has not gained the momentum one would expect. This article focuses on five biomass-related transactions aiming to diagnose whether input transactions have performed as transaction cost economics (TCE) would predict. Based on qualitative analyses, results show that the coordination mechanism adopted by logging firms and biomass processors have led parties to experience hold-up problems. The paper concludes with an alternative strategy to alleviate hold-ups and devise an efficient market for biomass.

The direct and immediate link test regarding deduction of input VAT: a consumption-based test versus an economic-based test?

It follows explicitly from the EC VAT Directive that the deduction of input VAT depends on a positive link between on the one hand the incurred expenses and on the other hand the planned or actually completed taxed output transactions. In theory and in practice, however, the deeper nature of this link constantly gives rise to uncertainty, and thus also uncertainty in relation to the necessary distinction between direct costs and overhead costs. The purpose of this article is to analyse the recent case law of the Court of Justice of the European Union (ECJ) with a view to assessing the status of the relevant test used when establishing the link between a taxable person's different input and output transactions.

A COMBINTORIAL TREE BASED FREQUENT PATTERN MINING

Frequent pattern mining is a process of extracting frequently occurring itemset patterns from very large data storages. These frequent patterns are used to generate association rules which define the relationship among items. The strength of the relationship can be measured using two different units namely support value and confidence level. Any relationship that satisfies minimum threshold of support value is known as frequent pattern. There are several methods and algorithms suggested to mine frequent patterns from large databases. Most of the methods can be assessed for its complexity based on the number of processing levels and number of candidate sets with subsets that are generated in each level. In this study, the combinatorial approach which generates minimal number of combinations using a tree structure and automatically filters infrequent itemsets and mine frequent patterns is suggested. It scans input database once and carries out minimized intersections to count the support value. The complexity is based on the number of transactions and the maximum length of transactions. The new approach purely depends on the size of input transaction database. The combinatorial approach does not depend on the unknown number of processing levels and there is nocandidate sets and subsets generation. The proposed method makes minimal number of combinations when compared to number of candidate sets and subsets in other methods. The method is compared with number of existing legendary methods for its performance.

Web Search Results Visualization Using Enhanced Branch and Bound Bookshelf Tree Incorporated with B3-Vis

Enhancements in data mining for effective information retrieval is an emerging trend. This growth in turn has motivated researchers to seek new techniques for knowledge extraction. This research paper, induce the need for an incremental data mining approach based on data structure called the Bookshelf tree. The provoked approach is shown to be effective for solving problems related to efficiency of handling data updates, accuracy, processing input transactions, and answering user queries. This paper proposes a Branch and Bound Bookshelf Tree incorporated with association mining for self organization of the results retrieved from the RFDDb. This research work focus on the new techniques for keyword search over a mass of tables, and show that they can achieve substantially higher relevance than solutions based on a traditional search engine using Referenced attribute Functional Dependency Database (RFDDb). Branch and Bound is for best optimized result and the bookshelf tree is for organizing result for effective and efficient Information Retrieval (IR).B3-Vis Technique is proposed for visualizing the results retrieved from the Branch and Bound Bookshelf Tree. The relevant queries are arranged in each frame of Book Shelf for effective Information Retrieval. Finally, the search results are presented in visual mode, which allows a user to navigate between extracted schemas. leaves. At level i the members of the solution space are partitioned by their x i values. Members with x i = 1 are in the left subtree.Members with x i = 0 are in the right sub tree and could exchange roles of left and right subtree.Association mining that discovers dependencies among values of an attribute was introduced by Agrawal et al.(5) and has emerged as a prominent research area. The association mining (5) problem also referred to as the market basket problem can be formally defined as follows. Let I = {i 1 , i 2 , . . . , i n } be a set of items. Let D = {t 1 , t 2 , . . .,t m } be a set of transactions called the database. Each transaction in D has a unique transaction ID and contains a subset of the items in I. A rule is defined as an implication of the form X ⇒ Y where X, Y ⊂ I and X ∩ Y = ∅ . The sets of items (6) (for short itemsets) X and Y is called antecedent (left-hand-side or LHS) and consequent (right-hand-side or RHS) of the rule respectively. Several measures have been introduced to define the strength of the relationship between itemsets X and Y such as support, confidence, and interest. The definitions of these measures, from a probabilistic model is (7) given below.

Data Quality Measurement using Data Mining

Regarding to use of correct information in many applications, data quality measurement is very important. Nowadays, many statistical methods for measuring the quality of data have been proposed. The major problem of statistical methods is to lack of using data nature to measure the quality. Data mining is another method for measuring the quality of data. Data mining algorithms extract some knowledge. The extracted knowledge is used to measure the quality of data. In this paper, we introduce a new method, which uses data mining to extract some knowledge from database, and then we use it to measure the quality of input transaction.

Backward integration and collusion in a duopoly model with asymmetric costs

This paper formalizes the idea that input transactions might be used to implement side payments among colluding firms. A model is proposed to analyze the effect of backward integration on collusive outcomes in a downstream duopoly with asymmetric marginal costs. Vertical integration expands the set of collusive outcomes that are sustainable for a given realization of the discount factor. This is an additional effect of vertical integration that antitrust authorities should consider. Side payments implemented by input sales are more relevant the larger the difference in marginal costs, since they allow for the shifting of production towards the relatively more efficient firms, while maintaining firms’ incentives to collude. A price of the input above that posted by an alternative source or sales of the input below cost may be observed, depending on the realization of downstream firms’ costs.

우리나라 공공도서관의 ASK_a 서비스 모형 개발

본 논문에서는 공공도서관의 새로운 서비스 영역인 ASK_a 서비스 운영모형을 제안하였다. 제안한 모형이 갖는 기능을 입력과 처리, 출력과정으로 구분하여 설계하였다. 최적의 입력 형식은 웹 폼형식을 제안하였고, 처리과정은 공공도서관의 혼합형(수평형, 계층형) 협력모델을 제안하였고, 출력 과정은 제공된 질문-해답정보에 대한 아카이빙 정책을 제안하였다. 특히 ASK_a 서비스가 성공적으로 운영되도록 하기 위해서 제안한 모형의 핵심을 공공도서관의 협력연계를 통한 외부 인력과 자원활용으로 하였다. 이러한 협력의 최종목표는 고도의 전문정보 서비스를 공공도서관 이용자에게 제공하는 것이다. The new service of Korean public library, ASK_a service model suggests a new management practice in collaborative digital reference services. The model has three functions: input transaction, process transaction, and output transaction. The best form for input is the web form. The best form for process is a model with a hybrid type of public libraries(hierarchical and lateral type). The output suggests the archiving policy for gathering the query-answer data. The core of this model is providing an advanced information service to its users through cooperation with public libraries and external manpower.

Price Uncertainty and Vertical Integration: An Empirical Examination of Petrochemical Firms

Input transactions in the petrochemical industry are subject to temporal specificity. That is, non-performance in quantity, such as delaying delivery, is highly costly to producers and can be an effective holdup strategy. Buyers and sellers of petrochemical inputs have been averse to frequent price changes. The aversion to haggling over prices reflects the desire of maintaining stable input supplies critical to production efficiency. In the 1970s, two oil price shocks induced high price volatility in the industry. The price volatility created immense pressures for price adjustments in contracts. The traditional agreements of inflexible prices were destabilized, resulting in widespread disputes and renegotiation. The industry and the time period together create a natural opportunity for examining how governance structures of transactions adapt to price uncertainty. This paper examines in particular the effects of input price uncertainty on vertical integration. Based on plant-level data for U.S. producers of 49 petrochemical products, this study finds that the producers' extents of vertical integration, measured by their degrees of input self-sufficiency, were positively related to input price volatility during the period of the oil price shocks. The positive reaction of vertical integration to input price volatility is attributed to the producers who had the highest expecting costs of supply disruption.

Ordering and selecting production rules for constraint maintenance: complexity and heuristic solution

Presents a technique for analyzing the run-time behavior of integrity constraint repair actions, i.e. active database rules that are specifically designed to correct violations of database integrity. When constraints become violated due to an incorrect user transaction, rule computation is started to restore the database to a correct state. Since repair actions may be numerous and may conflict with each other, automated support for the analysis of their run-time behavior is necessary. The proposed technique helps the rule base administrator define a repair rule selection strategy such that the computation terminates for every input transaction, the final database state satisfies all the constraints, and the user's preferences among different ways to restore integrity are taken into account. In addition, it can be used by the rule designer to spot "dangerous" rules that may be subject to redesign. This problem is formulated as an optimization problem on directed hypergraphs, which we demonstrate to be NP-hard and which we solve by means of a heuristic algorithm.

Application of production standards in complex organizations under uncertainty

This article explores the optimal determination of production (quantitative) standards under alternative assumptions concerning the ability of complex organizations to adjust variable inputs as the price of output becomes known. The model allows for transaction costs associated with ex ante and ex post input acquisitions (e.g., contracting for labor services). When such input transaction costs are not observable by top management, pecuniary incentive schemes based on ex post performance are considered. We show that standard-based compensation schemes can be built into the ex post optimization model so that the profit-maximizing production standards and the incentive designs are simultaneously determined.

Applications of Byzantine agreement in database systems

In this paper we study when and how B Byzantine agreement protocol can he used in general-purpose database management systems. We present an overview of the failure model used for Byzantine agreement, and of the protocol itself. We then present correctness criteria for database processing in this failure environment and discuss strategies for satisfying them. In doing this, we present new failure models for input/output nodes and study ways to distribute input transactions to processing nodes under these models. Finally, we investigate applications of Byzantine agreement protocols in the more common failure environment where processors are assumed to halt after a failure.

Formal verification of information derivability in databases using precedence analysis

One of the problems in database design is the lack of formal methods to verify the consistency of the design decisions. In this paper, we present the precedence analysis of information sets, and we apply it to the verification of some database design decisions. We propose a method to perform information derivability analysis. This method can be used to formally verify the logical consistency of database requirements. It can also be used to verify the query derivability from the database contents and to verify the derivability of this contents from the input transactions.

Location of Firms with Input Transactions

The locations of two firms with input-output linkages are studied. First, from a study of the equilibrium locations it is shown that there are generally an infinite number of equilibrium locational patterns for such a system, and it is argued that the actual equilibrium locations can only be determined by considering the dynamic process of the equilibrium. Then, the optimal locations are obtained, and compared with equilibrium locations. A mechanical model and a programming model are proposed to obtain the optimal locations and the equilibrium locations, respectively.

Sistem Informasi Persediaan Obat di Puskesmas Sepatan Tangerang

Sepatan Health Center is a facility or health service agency that serves for the health of thecommunity on district Sepatan, at this place there is a pharmacy which is a container medicine. As afunction of accelerating and facilitate the activities of drug data management, it needs technology thatis implemented in the health service agency that is Sepatan Tangerang Health Center. The purpose ofthis research is to build the Information System of Drug Inventory at Sepatan Tangerang Public HealthCenter with web based by using Prototype development method which starts with flowchart analysis,design using UML Diagram and PHP programming language and MySQL database and test with BlackBox. The result of this research is a Drug Inventory Information System that can perform the process ofdrug data input transactions, receipt transactions, location change transactions, expense transactionsand booking transactions and generate a good report of each transaction made.