Journal of Information and Organizational Sciences (JIOS)
Not a member yet
455 research outputs found
Sort by
Towards more efficient e-learning, intelligence and adapted teaching material
No full textThis article presents results of a research project in which we attempted to determine the relationship between efficient E-learning and teaching materials adapted based on students’ structure of intelligence. The project was conducted on approximately 500 students, 23 classes, nine elementary schools, with ten teachers of history, informatics and several licensed psychologists. E-teaching material was prepared for the subject of History for eight-grade students of elementary school. Students were tested for the structure of intelligence, and based on their most prominent component, they were divided into groups, using teaching materials adapted to their most prominent intelligence component. The results have shown that use of the adapted teaching materials achieved 6-12% better results than E-materials not adapted to students’ structure of intelligence
Determining semantic similarity of it systems based on the comparison of their graphical data models
No full textModelling is the basis for research and development of IT systems. Graphical models and graphic representations of models originally built in non-graphic languages and formalisms are often used. In modelling IT systems a need exists for comparing graphical models which can represent different variations of the same or similar modelled content or graphical models which, with certain revisions, could be applied in various domains. Graphical model in the latter case first needs to be translated into another form of predicate expressions or formal languages of modelled content representation. The lack of translation of the model for comparison is a time-consuming venture and may result in the loss of modelled relations due to differences in the "language" and representation symbols. The goal of the paper is to explore and propose methods and procedures for determining similarities of IT systems based on the comparison of their graphical data models. The procedure of determining the similarities of graphical data models of the same type shall at the end of my research be based on semantic and structural similarity of models. In this article procedures for determining semantic similarity and their application is discussed together with examples and the procedure for determining structural similarity is proposed in roughly as it is in the finishing state of current research activities
Considering Interactions among Multiple Criteria for the Server Selection
No full textDecision-making about server selection is one of the multi-criteria decision-making (MCDM) processes where interactions among criteria should be considered. The paper introduces and develops some solutions for considering interactions among criteria in the MCDM problems. In the frame procedure for MCDM by using the group of methods, based on assigning weights, special attention is given to the synthesis of the local alternatives’ values into the aggregate values where the mutual preferential independence between two criteria is not assumed. Firstly, we delineate how to complete the additive model into the multiplicative one with synergic and redundancy elements in the case that criteria are structured in one level and in two levels. Furthermore, we adapted the concept of the fuzzy Choquet integral to the multi-attribute value theory. Studying and comparing the results of the example case of the server selection obtained by both aggregation approaches, the paper highlights the advantages of the first one since it does not require from decision makers to determine the weights of all possible combinations of the criteria and it enables the further use of the most preferred MCDM methods
Web-based Systems Development: The Influence of Disciplinary Backgrounds on Design Practices
No full textWeb development teams are multidisciplinary, bringing together designers from a variety of backgrounds. A Web designer’s professional training and education can shape his problem-solving orientation and world view by indoctrinating certain values and conditioning him to think and behave in certain ways. This paper presents an analysis of data gathered across 14 interviews, wherein four distinct orientations were identified: (1) Web development as the design of a functional software application (emphasis on back-end functionality); (2) as the design of an interactive tool (emphasis on ergonomics); (3) as the design of a communicational dialogue (emphasis on audience engagement); and (4) as an extension of branded graphic design (emphasis on visual presentation)
An Algorithm for Detecting the Principal Allotment among Fuzzy Clusters and Its Application as a Technique of Reduction of Analyzed Features Space Dimensionality
No full textThis paper describes a modification of a possibilistic clustering method based on the concept of allotment among fuzzy clusters. Basic ideas of the method are considered and the concept of a principal allotment among fuzzy clusters is introduced. The paper provides the description of the plan of the algorithm for detection principal allotment. An analysis of experimental results of the proposed algorithm’s application to the Tamura’s portrait data in comparison with the basic version of the algorithm and with the NERFCM-algorithm is carried out. A methodology of the algorithm’s application to the dimensionality reduction problem is outlined and the application of the methodology is illustrated on the example of Anderson’s Iris data in comparison with the result of principal component analysis. Preliminary conclusions are formulated also
PNMBG: Point Neighborhood Merging with Border Grids
No full textThe special clustering algorithm is attractive for the task of grouping arbitrary shaped database into several proper classes. Up to now, a wide variety of clustering algorithms designed for this task have been proposed, the majority of these algorithms is density-based. But the effectivity and efficiency still is the great challenges for these algorithms as far as the clustering quality of such task is concerned. In this paper, we propose an arbitrary shaped clustering method with border grids (PNMBG), PNMBG is a crisp partition method. It groups objects to point neighborhoods firstly, and then iteratively merges these point neighborhoods into clusters via grids, only bordering grids are considered during the merging stage. Experiments show that PNMBG has a good efficiency especially on the database with high dimension. In general, PNMBG outperforms DBSCAN in the term of efficiency and has an almost same effectivity with the later
Creating an effective learning environment through an E-Learning Instructional Programme (ELIP)
No full textThough numerous research reports have provided a body of information about benefits of e-learning there are barriers such as, asynchronous communication channels, lack of personalisation, which decrease the level of interaction between the learner and instructor [13].The aim of this paper is to discuss and outline a framework on e-learning pedagogical and technology issues which provide a basis for the creation of an e-learning instructional programme (ELIP). The Phase I of this research start with the creation of a framework for an e-learning environment and derivation of the e-learning instructional programme (ELIP); Phase II is aimed to implement a popular audio playback device (iPod) and VoIP. In this phase 40 learners, one instructor and three tutors will be observed and their experiences will be evaluated through focus group interviews and documents analysis. This research was based on a qualitative research approach [78],[44]
1957-2007: 50 Years of Higher Order Programming Languages
No full textFifty years ago one of the greatest breakthroughs in computer programming and in the history of computers happened -- the appearance of FORTRAN, the first higher-order programming language. From that time until now hundreds of programming languages were invented, different programming paradigms were defined, all with the main goal to make computer programming easier and closer to as many people as possible. Many battles were fought among scientists as well as among developers around concepts of programming, programming languages and paradigms. It can be said that programming paradigms and programming languages were very often a trigger for many changes and improvements in computer science as well as in computer industry. Definitely, computer programming is one of the cornerstones of computer science.Today there are many tools that give a help in the process of programming, but there is still a programming tasks that can be solved only manually. Therefore, programming is still one of the most creative parts of interaction with computers.Programmers should chose programming language in accordance to task they have to solve, but very often, they chose it in accordance to their personal preferences, their beliefs and many other subjective reasons.Nevertheless, the market of programming languages can be merciless to languages as history was merciless to some people, even whole nations. Programming languages and developers get born, live and die leaving more or less tracks and successors, and not always the best survives. The history of programming languages is closely connected to the history of computers and computer science itself. Every single thing from one of them has its reflexions onto the other. This paper gives a short overview of last fifty years of computer programming and computer programming languages, but also gives many ideas that influenced other aspects of computer science. Particularly, programming paradigms are described, their intentions and goals, as well as the most of the significant languages of all paradigms
An Efficient Algorithm for Congestion Control in Highly Loaded DiffServ/MPLS Networks
No full textThe optimal QoS path provisioning of coexisted and aggregated traffic in networks is still demanding problem. All traffic flows in a domain are distributed among LSPs (Label Switching Path) related to N service classes, but the congestion problem of concurrent flows can appear. As we know the IGP (Interior Getaway Protocol) uses simple on-line routing algorithms (e.g. OSPFS, IS-IS) based on shortest path methodology. In QoS end-to-end provisioning where some links may be reserved for certain traffic classes (for particular set of users) it becomes insufficient technique. On other hand, constraint based explicit routing (CR) based on IGP metric ensures traffic engineering (TE) capabilities. The algorithm proposed in this paper may find a longer but lightly loaded path, better than the heavily loaded shortest path. LSP can be pre-computed much earlier, possibly during SLA (Service Level Agreement) negotiation process. As we need firm correlation with bandwidth management and traffic engineering (TE) the initial (pro-active) routing can be pre-computed in the context of all priority traffic flows (former contracted SLAs) traversing the network simultaneously. It could be a very good solution for congestion avoidance and for better load-balancing purpose where links are running close to capacity. Also, such technique could be useful in inter-domain end-to-end provisioning, where bandwidth reservation has to be negotiated with neighbor ASes (Autonomous System). To be acceptable for real applications such complicated routing algorithm can be significantly improved. Algorithm was tested on the network of M core routers on the path (between edge routers) and results are given for N=3 service classes. Further improvements through heuristic approach are made and results are discussed