Journal of Information and Organizational Sciences (JIOS)
Not a member yet
455 research outputs found
Sort by
MODELING AND SOLVING SELF-REFERENTIAL PUZZLES
No full textThe so-called self-referential puzzles are a very interesting kind of logic puzzles,aiming at developing the skill of logical thinking. A self-referential puzzle consists of asequence of questions about the puzzle itself. In this paper, we shall show some selfreferentialpuzzles, demonstrate how to model and solve them as propositional logicproblems, and how to mechanically generate new puzzles. For this, we shall make use ofthe specific advantages of Mozart/Oz system – the finite domain constraint programminglanguage and environment.We shall also show some new puzzles, according to our best knowledge not yet publishedelsewhere. The program in Mozart/Oz using our method generated these puzzles
DATA ANALYSIS FOR AGENT BASED MOBILE SERVICES
No full textOne of the high interesting areas in the distributed systems is the problem ofbuilding and running pervasive computing services for mobile users. The central point forbuilding such a services is to appropriately model the physical and data environment. In thispaper we concentrate on the data part of such an environment that would enable creating ageneral scheme for a category of flexible services for mobile users. We define the basicprofile of the users and methods, how the services should deal with the profiles. Formodeling the presence of the user in the data environment (even if he/she is off-line) theagent-based solution was chosen, so the distributed system is build as a multi-agent system
Comparison of simple graphical process models
No full textComparing structure of graphical process models can reveal different variations of processes. Since most contemporary norms for process modeling lean on directed connectivity of objects in the model, their connections structure form sequences which can be translated into performing scenarios. While the sequences can be tested for completeness in performing process activities using simulation methods, the similarity or difference of static characteristics of sequences in different model variants is difficult to explore. The goal of the paper is to test the appliance of a method for comparison of graphical models by analyzing and comparing the static characteristics of process models. Therefore a metamodel of process models is developed and a comparison procedure conducted using a graphical model comparison algorithm
An Ontological Approach to Study and Manage Digital Chain of Custody of Digital Evidence
No full textChain of custody of digital evidence in digital forensic field are today essential part of digital investigation process. In order the evidence to be accepted by the court as valid, chain of custody for digital evidence must be kept, or it must be known who exactly, when, where, why and how came into contact with evidence in each stage of the digital investigations process. This paper deals with digital evidence and chain of custody of digital evidence. Authors definetaxonomy and use an ontological approach to manage chain of custody of digital evidence. The aim of this paper was to develop ontology to provide a new approach to study and better understand chain of custody of digital evidence . Additionally, developed ontology can be used as a method to further develop a set of standard and procedures for secure management with digital evidence
The impact of Game-based learning on the achievement of learning goals and motivation for learning mathematics - literature review
No full textInformation technologies are an integral part of a contemporary society which bases its progress on knowledge being one goal of education. Beside acquiring knowledge, skills and routines, the goal of education is to create a complete individual who can rationally and timely make decisions, purposefully react in new situations and be trained for life-long learning. In order to accomplish all this, it is necessary to make educational process more creative, contemporary and adjusted to new generations of computer literate pupils who demand quicker and more frequent interactions, a lot of information at the same time, generations who quickly acquire rules of computer games. Computer games meeting pedagogical criteria should become an integral part of learning. Teaching with mathematical computer games, which fulfil pedagogical criteria, influences pupils’ motivation, learning, retention and forgetting. This paper provides a review of literature in this field and determines whether the use of mathematical computer games contributes to more efficient realisation of educational goals at all level of education. Furthermore, considering prior research we have attempted to establish whether the use of mathematical games for teaching has an impact on the formation of a positive attitude of pupils of different ages toward the subject of mathematics, their motivation and knowledge acquisition when compared to learning without computer games. Finally, we have analysed different research methods concerning this issue and assessed the impact of pedagogically designed mathematical computer games on the realisation of educational goals and quality improvement of teaching and learning
Some useful structures for categorical approach for program behavior
No full textUsing of category theory in computer science has extremely grown in the last decade. Categories allow us to express mathematical structures in unified way. Algebras are used for constructing basic structures used in computer programs. A program can be considered as an element of the initial algebra arising from the used programming language. In our contribution we formulate two ways of expressing algebras in categories. We also construct the codomain functor from the arrow category of algebras into the base category of sets which objects are also the carrier-sets of the algebras. This functor expresses the relation between algebras and carrier-sets
Analysis of Top 500 Central and East European Companies Net Income Using Benford's Law
No full textThere are numerous useful methods that can be conducted in data analysis in order to check data correctness and authenticity. One of contemporary and efficient methods is application of so-called Benford's Law. In this paper we examine ways of application of this law in investigation of specific net income number set. Our aim is to make a conclusion if this number set conforms to Benford's Law. An examination target focus is set on values of top 500 central and east European companies according to their income. Data set contains 1,500 records and spans through 3 years (2007, 2008 and 2009) including 500 net incomes per year. Research is based on net income profit and loss subsets as well as absolute values of net income. Analysis covers first digit Benford's Law test and proves conformance to Benford's Law of all observed subsets
Transition between process models (BPMN) and service models (WS-BPEL and other standards): A systematic review
No full textBPMN and BPEL have become de facto standards for modeling of business processes and imple-mentation of business processes via Web services. There is a quintessential problem of discrep-ancy between these two approaches as they are applied in different phases of lifecycle and theirfundamental concepts are different — BPMN is a graph based language while BPEL is basicallya block-based programming language. This paper shows basic concepts and gives an overviewof research and ideas which emerged during last two years, presents state of the art and possiblefuture research directions. Systematic literature review was performed and critical review wasgiven regarding the potential of the given solutions
The Modeling and Complexity of Dynamical Systems by Means of Computation and Information Theories
No full textWe present the modeling of dynamical systems and finding of their complexity indicators by the use of concepts from computation and information theories, within the framework of J. P. Crutchfield's theory of ε-machines. A short formal outline of the ε-machines is given. In this approach, dynamical systems are analyzed directly from the time series that is received from a properly adjusted measuring instrument. The binary strings are parsed through the parse tree, within which morphologically and probabilistically unique subtrees or morphs are recognized as system states. The outline and precise interrelation of the information-theoretic entropies and complexities emanating from the model is given. The paper serves also as a theoretical foundation for the future presentation of the DSA program that implements the ε-machines modeling up to the stochastic finite automata level