{"title":"Performance analysis and comparison of assured and premium service in differentiated services networks","authors":"B. Cvetkoska","doi":"10.1109/ITI.2002.1024719","DOIUrl":"https://doi.org/10.1109/ITI.2002.1024719","url":null,"abstract":"This paper explores the performance of the two types of services supported by the Differentiated services - Assured Service and Premium service. It focuses on the mechanisms used for implementation of the Expedited Forwarding Per-Hop Behavior (EF PHB) and Assured Forwarding PHB (AF PHB), analyzing them with respect to the main QoS parameters: throughput, delay and drop rate. The impact of the scheduling algorithms and also the impact Of AF (Assured Forwarding) and EF (Expedited Forwarding) on the BE (Best Effort) traffic is investigated. Simulations were carried out under different traffic conditions (different levels of burstiness, packet sizes and traffic service types) and different parameters.","PeriodicalId":420216,"journal":{"name":"ITI 2002. Proceedings of the 24th International Conference on Information Technology Interfaces (IEEE Cat. No.02EX534)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133250846","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Effectiveness of mapping human-oriented information to feedback from a software interface","authors":"Pietro Murano","doi":"10.1109/ITI.2002.1024673","DOIUrl":"https://doi.org/10.1109/ITI.2002.1024673","url":null,"abstract":"This paper describes an experiment which tests anthropomorphic user interface feedback against non-anthropomorphic user interface feedback. The experiment has considered the effectiveness and user approval of the anthropomorphic and non-anthropomorphic user interface feedback. The experiment is worthwhile, as the Computer Science community is not in agreement concerning effectiveness and user approval of anthropomorphic user interface feedback. The specific area or setting for the experiment has been English as a Foreign Language (EFL). The results from the experiment are very promising being statistically significant. They show that the anthropomorphic user interface feedback was more effective and preferred by users.","PeriodicalId":420216,"journal":{"name":"ITI 2002. Proceedings of the 24th International Conference on Information Technology Interfaces (IEEE Cat. No.02EX534)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114704049","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The interactive explorer of Web presentation units","authors":"J. Piecha","doi":"10.1109/ITI.2002.1024713","DOIUrl":"https://doi.org/10.1109/ITI.2002.1024713","url":null,"abstract":"Data files available on Web server contain very often various data formats linked into a composition producing sequence presented frame by frame as a movie. The multimedia database design methods have to consider many rules that must be integrated to obtain standards for simplifying development of the application and for fast exploration of the product. The paper presents several aspects of design techniques giving a unified composition, modularity of the application and navigation standards within the product. The database is accessed in a remote server of the computer network.","PeriodicalId":420216,"journal":{"name":"ITI 2002. Proceedings of the 24th International Conference on Information Technology Interfaces (IEEE Cat. No.02EX534)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132227215","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Analysing inference rules for cardinality constraints","authors":"T. Dolezal","doi":"10.1109/ITI.2002.1024650","DOIUrl":"https://doi.org/10.1109/ITI.2002.1024650","url":null,"abstract":"In this paper, we analyse cardinality constraints for n-ary relationship types. In general, cardinality constraints consist of minimum and maximum parts. We extend the approach presented in an earlier paper, Dolezal (1999) which analysed the maximum part of the cardinality constraints to the minimum part and define a powerful semantics of the minimum part of cardinality constraints. In scope of an n-ary relationship type, there are dependencies between cardinality constraints. We give inference rules for cardinality constraints consisting both of minimum and maximum parts and prove the correctness of the rules. We show that the minimum and maximum parts of cardinality constraints are mutually dependent, although we work with 0 and 1 values for the minimum part and 1 and N values for the maximum part. The given framework is a basis for the future research of dependencies between different kinds of cardinality constraints.","PeriodicalId":420216,"journal":{"name":"ITI 2002. Proceedings of the 24th International Conference on Information Technology Interfaces (IEEE Cat. No.02EX534)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134619236","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Genetic algorithms in animation of volumetric clouds","authors":"B. Lipuš, N. Guid","doi":"10.1109/ITI.2002.1024711","DOIUrl":"https://doi.org/10.1109/ITI.2002.1024711","url":null,"abstract":"Realistic modeling and animating clouds are ones of the hardest tasks in computer animation. There are different techniques used in computer graphics for representing clouds. Our work is based on volume-rendered implicit junction, for volumetric cloud modeling. Basically, implicit primitives are controlled by a modified particle system. We propose genetic algorithms for initialization of the particle system. They provide an alternative to traditional optimization techniques and are also useful in the key-frame animation. Additionally, we introduce some new ideas in volumetric clouds animation: advanced techniques for controlling a large collection of individual elements - flocks and autonomous behavior. Some properties of these techniques are also applicable in the cloud animation.","PeriodicalId":420216,"journal":{"name":"ITI 2002. Proceedings of the 24th International Conference on Information Technology Interfaces (IEEE Cat. No.02EX534)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133408268","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An application for distance learning of data structures and sorting algorithms","authors":"M. Colnaric","doi":"10.1109/ITI.2002.1024664","DOIUrl":"https://doi.org/10.1109/ITI.2002.1024664","url":null,"abstract":"In the paper an application for demonstration and analysis of data structures and sorting algorithms is presented. Their operation can be animated and demonstrated on asserted or generated input data, with different statistical distributions. Analysis of the performance and of the complexity of various algorithms can be calculated and/or measured.","PeriodicalId":420216,"journal":{"name":"ITI 2002. Proceedings of the 24th International Conference on Information Technology Interfaces (IEEE Cat. No.02EX534)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122026260","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Distributed software: from component model to software architecture","authors":"P. Aniorté, F. Seyler","doi":"10.1109/ITI.2002.1024716","DOIUrl":"https://doi.org/10.1109/ITI.2002.1024716","url":null,"abstract":"Today, Information Systems are often distributed and heterogeneous. Thus, software systems become more and more complex and their evolution is difficult to manage. Our works deal with prolonging life of heterogeneous distributed systems with the help of component reuse. Such systems need a distributed adaptable software architecture to be implemented. In this paper, we propose a component model for redeveloping software. First, we briefly present the component paradigm in which we place our works. Then we position our component model with regard to related works. The interface of the component is described by the way of points of interaction. These points are used to manage different types of interactions in order to build a graph of interactions allowing the integration of the reused components. We finish with the presentation of the distributed adaptable software architecture allowing to implement this graph. Each part of this paper is illustrated with a concrete case, the European ASIMIL project.","PeriodicalId":420216,"journal":{"name":"ITI 2002. Proceedings of the 24th International Conference on Information Technology Interfaces (IEEE Cat. No.02EX534)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123553619","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On the design of agent-based systems using UML and extensions","authors":"M. Dînsoreanu, I. Salomie, K. Pusztai","doi":"10.1109/ITI.2002.1024675","DOIUrl":"https://doi.org/10.1109/ITI.2002.1024675","url":null,"abstract":"The Unified Software Development Process (USDP) and Unified Modeling Language (UML) have been now generally accepted as the standard methodology and modeling language for developing object-oriented systems. Although agent-based systems introduce new issues, we consider that USDP and UML can be used in an extended manner for modeling agent-based systems. We present a methodology for designing agent-based systems and the specific models expressed in the UML-based notation corresponding to each phase of the software development process. UML was extended using the provided mechanism: stereotypes. Therefore, this approach can be managed with any CASE tool supporting UML. A case study, the development of a specific agent-based student assessment system (SAS), is presented.","PeriodicalId":420216,"journal":{"name":"ITI 2002. Proceedings of the 24th International Conference on Information Technology Interfaces (IEEE Cat. No.02EX534)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121956030","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A new approach to CFD research: combining AVL's FIRE code with user combustion model","authors":"M. Baburić, Z. Bogdan, N. Duić","doi":"10.1109/ITI.2002.1024703","DOIUrl":"https://doi.org/10.1109/ITI.2002.1024703","url":null,"abstract":"A new oil-combustion model was implemented into the AVL's CFD code FIRE and validation performed. The validation consisted of the simulation and the comparison with the existing Magnussen model. For the simulation purpose the domain was determined first, while user-defined functions simulating conditions at the inlet were done subsequently. The comparisons with the Magnussen results as with some approximate experimental results were done at the end. The paper shows flexibility of AVL's code in usage of user-defined functions, which enables combining the advantages of a commercial code and user modelling.","PeriodicalId":420216,"journal":{"name":"ITI 2002. Proceedings of the 24th International Conference on Information Technology Interfaces (IEEE Cat. No.02EX534)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130096096","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Maximum likelihood estimation of noisy Gaussian Markov random fields","authors":"M. Coli, L. Ippoliti","doi":"10.1109/ITI.2002.1024656","DOIUrl":"https://doi.org/10.1109/ITI.2002.1024656","url":null,"abstract":"In this paper we consider the issues involved in signal extraction and parameter estimation of particular spatial and spatio temporal processes observed with additive Gaussian noise. Within spatial statistics, we discuss maximum likelihood estimation of noisy auto-Gaussian models. For large lattices the estimation method can be computationally demanding thus, we present a maximum likelihood estimator which can be computed in O(n/sup 2/) steps. Spatio temporal processes are of main interest and parameter estimation of the STARG+Noise model class is also considered. The statistical properties of the proposed maximum likelihood estimator are finally explored in a simulation study.","PeriodicalId":420216,"journal":{"name":"ITI 2002. Proceedings of the 24th International Conference on Information Technology Interfaces (IEEE Cat. No.02EX534)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129440924","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}