Multiple views are a technique for concurrently providing the user with different and semantically meaningful perspectives, which emphasize distinct facets of the same object being observed. Therefore, this technique lends itself to the implementation of user interfaces that are better adapted to user requirements due to the possibility of selecting the suitable perspective on the object of manipulation, what is of particular significance in educational systems. The adequacy of multiple views' application in educational systems is considered in the paper and corroborated by the implementation of MUVIES, a multiple views user interface for intelligent tutoring systems.
{"title":"Interacting with educational systems using multiple views","authors":"V. Glavinic, A. Granić","doi":"10.1109/ITI.2001.938008","DOIUrl":"https://doi.org/10.1109/ITI.2001.938008","url":null,"abstract":"Multiple views are a technique for concurrently providing the user with different and semantically meaningful perspectives, which emphasize distinct facets of the same object being observed. Therefore, this technique lends itself to the implementation of user interfaces that are better adapted to user requirements due to the possibility of selecting the suitable perspective on the object of manipulation, what is of particular significance in educational systems. The adequacy of multiple views' application in educational systems is considered in the paper and corroborated by the implementation of MUVIES, a multiple views user interface for intelligent tutoring systems.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123751659","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}
In the article a HW/SW co-design methodology is presented, which enables early reasoning about system integration as well as verification of the designs. Specification PEARL methodology is based on a specification language with the same name, whose origins are in the standard Multiprocessor PEARL language. It has been enhanced by additional components for asymmetrical multiprocessor systems design as well as by additional parameters for schedulability analysis. Timed State Transition Diagrams have been introduced for program/task modelling, supporting the PEARL process model. The resulting task models are easily translated to PEARL task prototypes. The methodology and its specification language components are presented.
{"title":"HW/SW components for real-time systems co-design","authors":"Roman Gumzej, Matjai Colnarii","doi":"10.1109/ITI.2001.938055","DOIUrl":"https://doi.org/10.1109/ITI.2001.938055","url":null,"abstract":"In the article a HW/SW co-design methodology is presented, which enables early reasoning about system integration as well as verification of the designs. Specification PEARL methodology is based on a specification language with the same name, whose origins are in the standard Multiprocessor PEARL language. It has been enhanced by additional components for asymmetrical multiprocessor systems design as well as by additional parameters for schedulability analysis. Timed State Transition Diagrams have been introduced for program/task modelling, supporting the PEARL process model. The resulting task models are easily translated to PEARL task prototypes. The methodology and its specification language components are presented.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128589881","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}
A bivariate weighted Lagrange-Yen type interpolation formula is derived by means of the Kotel'nikov-Shannon sampling restoration formula for deterministic signals from Paley-Wiener function space L/sup 2/([-/spl pi/,/spl pi/]/sup 2/). The interpolation parameter size is computed with the approximation relative error level and the coordinatewise sample deviations are prescribed, when the sinc-type weight function is used for interpolation convergence rate improvement.
{"title":"Direct weighted Lagrange-Yen type interpolation in L/sup 2/([-/spl pi/,/spl pi/]/sup 2/)","authors":"T. K. Pogány, M. Tudor","doi":"10.1109/ITI.2001.938050","DOIUrl":"https://doi.org/10.1109/ITI.2001.938050","url":null,"abstract":"A bivariate weighted Lagrange-Yen type interpolation formula is derived by means of the Kotel'nikov-Shannon sampling restoration formula for deterministic signals from Paley-Wiener function space L/sup 2/([-/spl pi/,/spl pi/]/sup 2/). The interpolation parameter size is computed with the approximation relative error level and the coordinatewise sample deviations are prescribed, when the sinc-type weight function is used for interpolation convergence rate improvement.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121386740","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}
It is generally known that neural network algorithms are used for solving certain types of problems. Usually, we have a given problem and we look for the most suitable type of network, which would be able to solve the problem in the most effective way. We tried to suggest a method based on the fact that we will not look for the suitable network but the network will evolve itself.
{"title":"Problem solving based on evolutionary neural network algorithms","authors":"Peter Kocalka, Vlado Vojtek","doi":"10.1109/ITI.2001.938011","DOIUrl":"https://doi.org/10.1109/ITI.2001.938011","url":null,"abstract":"It is generally known that neural network algorithms are used for solving certain types of problems. Usually, we have a given problem and we look for the most suitable type of network, which would be able to solve the problem in the most effective way. We tried to suggest a method based on the fact that we will not look for the suitable network but the network will evolve itself.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"385 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115918488","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}
We consider a queueing model used previously (Scholz and Sunde, 1998) to model a military high frequency (HF) communication network. Our discussion has moved from the original case where we aimed to maintain a high grade of service for the highest priority traffic classes. The characteristics of this network were that link set-up time was longer than the service time: it often took longer to establish the connection than for the actual transmission of the message. In (Pearce et al., 2000) we looked at a polling model with multiple servers and multiple queues, with each server visiting the queues according to a server allocation algorithm. The queueing system comprises a set of waiting lines to which requests arrive to be served by a pool of servers. We restrict our attention to the case where movement of servers from queue to queue does not happen in zero time. Our discussion focuses on the basics of the two-queue situation. We look at the way this queueing model can be applied to a medical emergency room, where setting up for certain surgery procedures takes longer than the actual procedures themselves. The significance of this model is the applicability to different problems, from communication networks to medical emergency rooms.
我们考虑以前使用的排队模型(Scholz和Sunde, 1998)来模拟军事高频(HF)通信网络。我们的讨论已经脱离了最初的情况，在最初的情况下，我们的目标是为最高优先级的流量类别保持高级别的服务。这种网络的特点是链路建立时间比服务时间长:建立连接的时间往往比消息的实际传输时间长。在(Pearce et al.， 2000)中，我们研究了一个具有多个服务器和多个队列的轮询模型，每个服务器根据服务器分配算法访问队列。排队系统由一组等待队列组成，请求到达后由服务器池提供服务。我们将注意力限制在服务器在队列之间的移动不在零时间内发生的情况。我们的讨论集中在双队列情况的基础知识上。我们来看看这种排队模型如何应用于医疗急诊室，在那里，为某些手术程序设置所需的时间比实际程序本身要长。该模型的意义在于适用于不同的问题，从通信网络到医疗急诊室。
{"title":"On the application of a polling model with non-zero walk times and priority processing to a medical emergency-room environment","authors":"M. Cicin-Sain, C. Pearce, J. Sunde","doi":"10.1109/ITI.2001.937996","DOIUrl":"https://doi.org/10.1109/ITI.2001.937996","url":null,"abstract":"We consider a queueing model used previously (Scholz and Sunde, 1998) to model a military high frequency (HF) communication network. Our discussion has moved from the original case where we aimed to maintain a high grade of service for the highest priority traffic classes. The characteristics of this network were that link set-up time was longer than the service time: it often took longer to establish the connection than for the actual transmission of the message. In (Pearce et al., 2000) we looked at a polling model with multiple servers and multiple queues, with each server visiting the queues according to a server allocation algorithm. The queueing system comprises a set of waiting lines to which requests arrive to be served by a pool of servers. We restrict our attention to the case where movement of servers from queue to queue does not happen in zero time. Our discussion focuses on the basics of the two-queue situation. We look at the way this queueing model can be applied to a medical emergency room, where setting up for certain surgery procedures takes longer than the actual procedures themselves. The significance of this model is the applicability to different problems, from communication networks to medical emergency rooms.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134413427","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}
D. Šimić, M. Pavlovic, K. Sega, J. Hršak, V. Vadic, V. Šojat
Standard methodology for analysis of air pollution epidemiological time series expresses effects in terms of relative risk, i.e. increases in the number of events associated with a short term increase in air pollution. However, even large relative mortality rates may in fact reflect a very small effect in terms of person-years life loss. In Zagreb, mortality in 1995-1997 was significantly associated with concentrations of nitrogen dioxide (NO/sub 2/). We have used STL decomposition of time series into additive components of decreasing smoothness to test the hypothesis that mortality-air pollution association is due to short term mortality displacement. According to our results association between mortality and concentrations of NO/sub 2/ remains statistically significant at time scales ranging from a few days to 1-2 months.
{"title":"Is association between mortality and air pollution due to a short temporal displacement?","authors":"D. Šimić, M. Pavlovic, K. Sega, J. Hršak, V. Vadic, V. Šojat","doi":"10.1109/ITI.2001.938031","DOIUrl":"https://doi.org/10.1109/ITI.2001.938031","url":null,"abstract":"Standard methodology for analysis of air pollution epidemiological time series expresses effects in terms of relative risk, i.e. increases in the number of events associated with a short term increase in air pollution. However, even large relative mortality rates may in fact reflect a very small effect in terms of person-years life loss. In Zagreb, mortality in 1995-1997 was significantly associated with concentrations of nitrogen dioxide (NO/sub 2/). We have used STL decomposition of time series into additive components of decreasing smoothness to test the hypothesis that mortality-air pollution association is due to short term mortality displacement. According to our results association between mortality and concentrations of NO/sub 2/ remains statistically significant at time scales ranging from a few days to 1-2 months.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129405465","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}
The idea of combining classifiers in order to compensate their individual weakness and to preserve their individual strength has been widely used in pattern recognition applications. The cooperation of two feature families for handwritten digit recognition using SVM (Support Vector Machine) classifiers is examined. We investigate the advantages and weaknesses of various decision fusion schemes using rule-based reasoning. The obtained results show that it is difficult to exceed the recognition rate of the classifier applied straightforwardly on the feature families as one set. However, the rule-based cooperation schemes enable an easy and efficient implementation of various rejection criteria that leads to high reliability recognition systems.
{"title":"Handwritten digit recognition by combining support vector machines using rule-based reasoning","authors":"D. Gorgevik, D. Cakmakov, V. Radevski","doi":"10.1109/ITI.2001.938010","DOIUrl":"https://doi.org/10.1109/ITI.2001.938010","url":null,"abstract":"The idea of combining classifiers in order to compensate their individual weakness and to preserve their individual strength has been widely used in pattern recognition applications. The cooperation of two feature families for handwritten digit recognition using SVM (Support Vector Machine) classifiers is examined. We investigate the advantages and weaknesses of various decision fusion schemes using rule-based reasoning. The obtained results show that it is difficult to exceed the recognition rate of the classifier applied straightforwardly on the feature families as one set. However, the rule-based cooperation schemes enable an easy and efficient implementation of various rejection criteria that leads to high reliability recognition systems.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132091319","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}
Web site design and implementation is very often seen within companies and businesses as a 'technical task' whose realisation can improve their business operations dramatically and swiftly. At the same time, they do not consider any additional investment or research prior to the design and implementation of their Web site. Using a case study of a small to medium sized enterprise (SME) and its local operativity at Gatwick Airport (Crawley) in West Sussex, UK, we describe our approach to developing a Web site based on extensive surveys, which helped us to reveal the feasibility, purpose and operability of the company's Web site design. The company is called Aviation Aircraft Services (AAS), and is a SME that relies on major contracts from British Airways for cutlery, blanket and linen packaging.
{"title":"An approach to developing a Web site for SME","authors":"K. Patel, R. Jurić","doi":"10.1109/ITI.2001.938017","DOIUrl":"https://doi.org/10.1109/ITI.2001.938017","url":null,"abstract":"Web site design and implementation is very often seen within companies and businesses as a 'technical task' whose realisation can improve their business operations dramatically and swiftly. At the same time, they do not consider any additional investment or research prior to the design and implementation of their Web site. Using a case study of a small to medium sized enterprise (SME) and its local operativity at Gatwick Airport (Crawley) in West Sussex, UK, we describe our approach to developing a Web site based on extensive surveys, which helped us to reveal the feasibility, purpose and operability of the company's Web site design. The company is called Aviation Aircraft Services (AAS), and is a SME that relies on major contracts from British Airways for cutlery, blanket and linen packaging.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"20 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125773417","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}
Taking into account the continuous increase of traffic demands, it is necessary to increase satellite link capacity rationally. An efficient algorithm for sizing of N satellite links in mobile networks during exploitation is being developed, minimizing the total expansion cost. Capacity shortages are allowed so the problem is denoted as CEPS (Capacity Expansion Problem with Shortages). Using a network flow approach, the paper develops all possible expansion solutions for SPEP (Single Period Expansion Problem) and properties of extreme point solution are identified. The extreme flow theory enables separation of these extreme flows which can be a part of an optimal expansion solution from those which cannot. Such a heuristic approach enables the optimal result, using significantly less effort in programming and algorithm development. Our heuristic algorithm is compared with an algorithm based on an exact approach through many numerical examples. It is obvious that it is very effective, providing an optimal result with reasonable effort. The algorithm can be applied to short- or medium-term satellite network planning with a finite number of discrete time periods.
{"title":"A heuristic approach to satellite link capacity planning applied in mobile networks","authors":"S. Krile, M. Kos","doi":"10.1109/ITI.2001.938038","DOIUrl":"https://doi.org/10.1109/ITI.2001.938038","url":null,"abstract":"Taking into account the continuous increase of traffic demands, it is necessary to increase satellite link capacity rationally. An efficient algorithm for sizing of N satellite links in mobile networks during exploitation is being developed, minimizing the total expansion cost. Capacity shortages are allowed so the problem is denoted as CEPS (Capacity Expansion Problem with Shortages). Using a network flow approach, the paper develops all possible expansion solutions for SPEP (Single Period Expansion Problem) and properties of extreme point solution are identified. The extreme flow theory enables separation of these extreme flows which can be a part of an optimal expansion solution from those which cannot. Such a heuristic approach enables the optimal result, using significantly less effort in programming and algorithm development. Our heuristic algorithm is compared with an algorithm based on an exact approach through many numerical examples. It is obvious that it is very effective, providing an optimal result with reasonable effort. The algorithm can be applied to short- or medium-term satellite network planning with a finite number of discrete time periods.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125847482","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}
Client/server computing has created a deep paradigmatic shift in the information technology (IT) industry. It is replacing colossal monolithic mainframe systems with applications split across different computation units (clients and servers). Stateless business objects in the form of XML strings are a paradigm shift within a paradigm shift; this is a new client server revolution within the client server revolution. Stateless business objects in XML format break-up the client and server sides of an application into independent components that can interact together and roam across networks, with a unique and flexible interface definition. This paper proposes using the OMS (Object Mapping System) architecture template, to help system designers in building modern generic XML.
{"title":"Building a XML based Object Mapping System (OMS)","authors":"A. Trad, D. Kalpić","doi":"10.1109/ITI.2001.938002","DOIUrl":"https://doi.org/10.1109/ITI.2001.938002","url":null,"abstract":"Client/server computing has created a deep paradigmatic shift in the information technology (IT) industry. It is replacing colossal monolithic mainframe systems with applications split across different computation units (clients and servers). Stateless business objects in the form of XML strings are a paradigm shift within a paradigm shift; this is a new client server revolution within the client server revolution. Stateless business objects in XML format break-up the client and server sides of an application into independent components that can interact together and roam across networks, with a unique and flexible interface definition. This paper proposes using the OMS (Object Mapping System) architecture template, to help system designers in building modern generic XML.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126291244","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：