Journal of Information and Organizational Sciences (JIOS)
Not a member yet
455 research outputs found
Sort by
Use of Concept Lattices for Data Tables with Different Types of Attributes
No full textIn this paper we describe the application of Formal Concept Analysis (FCA) for analysis of data tables with different types of attributes. FCA represents one of the conceptual data mining methods. The main limitation of FCA in classical case is the exclusive usage of binary attributes. More complex attributes then should be converted into binary tables. In our approach, called Generalized One-Sided Concept Lattices, we provide a method which deal with different types of attributes (e.g., ordinal, nominal, etc.) within one data table. Therefore, this method allows to create same FCA-based output in form of concept lattice with the precise many-valued attributes and the same interpretation of concept hierarchy as in the classical FCA, without the need for specific unified preprocessing of attribute values
ESSENTIAL CHARACTERISTICS OF AN ERP SYSTEM : CONCEPTUALIZATION AND OPERATIONALIZATION
No full textThe interest of firms in ERP systems has been echoed in both the scientific andprofessional literature. It is worth noting however that while this literature has becomeincreasingly abundant, there does not yet exist an operational definition of the ERP conceptthat is, if not unanimously, at least widely accepted. This constitutes a handicap for boththe research and practice communities. The present study outlines what could beconsidered as an ERP by first determining the essentially required characteristics of such asystem: integration, flexibility and transversality. Indicators are then provided in order tooperationalise these three characteristics. The study concludes by proposing a researchframework on the impact of an ERP’s key characteristics upon the performance of thesystem in a given organisational setting
A TRANSACTION COST ANALYSIS OF MICROPAYMENTS IN MOBILE COMMERCE
No full textPersonalised, location-related and differentiated services in the mobile digitaleconomy create a demand for suitable pricing models. In the case of disaggregated“microservices” (e.g., small digitalized information or service units), as well as for theacquisition of low-value physical goods, the deployment of micropayments seemsappropriate.This paper analyzes the economic efficiency of marginal transaction amounts in the mcommercearea by applying the theoretical approach of transaction cost economics. Forthis purpose, a separation of technical and cognitive transaction costs is applied. Theinfluence of selected determinants such as specifity, uncertainty and bounded rationality ontransaction costs in mobile commerce micropayments is analyzed. The result is a morelikely application of micropayments for physical goods such as beverages or parking ticketsthan for digital goods and services, given the theoretical assumptions of the model. Inaddition, indicators for a significant above-zero lower limit of transaction amounts inmobile commerce are presented
Classification of Hydro Chemical Data in the Reduced Dimensional Space
No full textThe main objective of this paper is to systematically analyze the performance of water samples classifications for different data representations. We compare the classification of full data representation to the classification of data items in lower dimensional space obtained by projection of original data on the space of first principal components and further on the space of centroids of classes. We use linear support vector machines for classification of ground water samples collected from five different localities of Odra River basin and results are evaluated by standard measures including recall, precision and F1measure
Quantum Algorithm for Finding a Maximum Clique in an Undirected Graph
No full textThe maximum clique in an undirected graph is the largest subset of a set of graph's vertices where each pair of elements in the subset is connected. In this paper I would like to propose an algorithm for quantum computers that finds a maximum clique in an arbitrary undirected graph. An algorithm has O(|V|2|V|/2) worst case time complexity and O(2|V|/2) best case time complexity. Algorithm's space complexity for each case is O(|V|). An algorithm is based on a version of Grover's quantum algorithm for finding element in an unsorted list in which there can be an unknown number of solutions
Critical Success Factors Aspects of the Enterprise Resource Planning Implementation
No full textConsidering a global importance of small and medium sized enterprises (SMEs) they are in the spotlight of ERP implementation retail stores. Many of the relevant studies indicate the importance and diversity of the ERP implementation process. This paper presents results of the authors' research of the implementation success factors from the point of view of implementation participants. Based on the experience of a number of ERP implementations, authors compare the Croatian and international implementing practice of ERP solutions, taking into account the same critical success and the same ERP solution. Te emphasisis is put specifically on the three key participants in an implementation process: CEOs, project managers and successful-advanced users. Regardless of the relatively limited number of end users who took part in this study, it indicates a significant coincidence of Croatian and international practices in the part of perception of the critical success factors for ERP implementation, but also different views of key participants in the successful implementation
ACTIVE DATABASES, BUSINESS RULES AND REACTIVE AGENTS – WHAT IS THE CONNECTION?
No full textThese three technologies were and still are mainly treated separately. Since notmuch work has been carried out in defining and combining them together, we are going topresent what has been done and put accent on what could be done. Namely, they rely uponsimilar paradigms and concepts, as will be shown later on, and can be treated ascomplementary technologies. In this paper we will show that reactive agents reactaccording to some set of business rules and active databases can be used as a suitablemeans for implementing business rules and in those way reactive agents as well. Sincereactive agents have been well defined, recent improvements in the fields of activedatabases technology and especially business rules provide the reason to consider thebenefits to be achieved from combining these fields
Planning and Optimization of AGV Jobs by Petri Net and Genetic Algorithm
No full textThe following article presents the possibilities of job optimization on a maritime container terminal, in order to increase the system productivity and optimize the terminal capacity. Automated guided vehicles (AGVs) are now becoming popular mode of container transport in seaport terminals. The moving of vehicles can be described as the set of discrete events and states. Some of these states can be undesirable such as conflicts and deadlocks. It is necessary to apply adequate control policy to avoid deadlocks and block the vehicles’ moving only in the case of dangerous situation.This paper addresses the use a Petri net as modeling and scheduling tool in this context. The aim of AGV scheduling is to dispatch a set of AGVs to improve the productivity of a system and reduce delay in a batch of pickup/drop-off jobs under certain constraints such as deadlines, priority, etc. The final goals are related to optimization of processing time and minimization of the number of AGVs involved while maintaining the system throughput.To find better solutions, the authors propose the integration MRF1 class of Petri net (MRF1PN) with a genetic algorithm. Also, the use of a matrix based formal method is proposed to analyze discrete event dynamic system (DEDS). The algorithm is described to deal with multi-project, multi-constrained scheduling problem with shared resources. The developed model was tested and validated by simulation of typical scenarios of the container terminal of Port Koper. Modularity and simplicity of the approach allow using the model to monitor and test the efficiency of the processes, and also to propose future alternative solutions to optimize the schedule of operations and the employment of AGV at the terminal
Adapting hierarchical clustering distance measures for improved presentation of relationships between transaction elements
No full textCommon goal of descriptive data mining techniques is presenting new information in concise, easily interpretable and understandable ways. Hierarchical clustering technique for example enables simple visualization of distances between analyzed objects or attributes. However, common distance measures used by existing data mining tools are usually not well suited for analyzing transactional data using this particular technique. Including new types of measures specifically aimed at transactional data can make hierarchical clustering a much more feasible choice for transactional data analysis. This paper presents and analyzes convenient measure types, providing methods of transforming them to represent distances between transaction elements more appropriately. Developed measures are implemented, verified and compared in hierarchical clustering analysis on both artificial data as well as referent transactional datasets
Automated motive-based user review analysis in the context of mobile app acceptance: Opportunities and applications
No full textThe increasing amount and importance of user-generated content that is available in the web necessitates methods of its effective and efficient utilization. In this paper a system is presented that enables automated classification of user reviews concerning the usage motives mentioned in the reviews. Four possible applications of the system are discussed in detail in the course of this paper: a learning environment for mobile app development, a download prognosis mechanism, an app prizing decision support system, and a recommendation system. These applications are evaluated concerning state-of-the-art methods that currently address the challenge as well as advantages of the implementation of a motive-based system in the particular business processes