E. Di Sciascio, F. Donini, M. Mongiello, G. Piscitelli
Electronic commerce needs the aid of software tools to check the validity of business processes in order to fully automate the exchange of information through the network. Symbolic model checking has been used to formally verify specifications of secure transactions in a business-to-business system. The fundamental principles behind symbolic model checking are presented, along with techniques used to model mutual exclusion of processes and atomic transactions. The computational resources required to check the example process are presented, and faults detected in this process through symbolic verification are documented.
{"title":"Automatic support for verification of secure transactions in distributed environment using symbolic model checking","authors":"E. Di Sciascio, F. Donini, M. Mongiello, G. Piscitelli","doi":"10.1109/ITI.2001.938054","DOIUrl":"https://doi.org/10.1109/ITI.2001.938054","url":null,"abstract":"Electronic commerce needs the aid of software tools to check the validity of business processes in order to fully automate the exchange of information through the network. Symbolic model checking has been used to formally verify specifications of secure transactions in a business-to-business system. The fundamental principles behind symbolic model checking are presented, along with techniques used to model mutual exclusion of processes and atomic transactions. The computational resources required to check the example process are presented, and faults detected in this process through symbolic verification are documented.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"293 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131991630","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 this paper the new algorithm for static task graph scheduling on multiprocessor systems is proposed and a comparison with two algorithms known from the literature is presented. The comparison of the algorithms is made in terms of the completion times of resulting schedules using a prototype standard task graph set.
{"title":"A comparison of the static task graph scheduling algorithms","authors":"J. Brest, V. Zumer","doi":"10.1109/ITI.2001.937995","DOIUrl":"https://doi.org/10.1109/ITI.2001.937995","url":null,"abstract":"In this paper the new algorithm for static task graph scheduling on multiprocessor systems is proposed and a comparison with two algorithms known from the literature is presented. The comparison of the algorithms is made in terms of the completion times of resulting schedules using a prototype standard task graph set.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"25 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":"132251937","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 article presents probabilistic uncertainty modeling of multi-level systems of events, mutually linked by transitive events. A method for multi-level systems with potentials to emerge new functional states is suggested and the application is illustrated by a two-level example of systems pertinent to a game with a die and a coin. The presented procedure provides analogy to more complex transitive systems operating in uncertain circumstances with a redistribution of capabilities and demands in case of cascades of failures.
{"title":"Uncertainty of multi-level systems of events","authors":"K. Ziha","doi":"10.1109/ITI.2001.938053","DOIUrl":"https://doi.org/10.1109/ITI.2001.938053","url":null,"abstract":"The article presents probabilistic uncertainty modeling of multi-level systems of events, mutually linked by transitive events. A method for multi-level systems with potentials to emerge new functional states is suggested and the application is illustrated by a two-level example of systems pertinent to a game with a die and a coin. The presented procedure provides analogy to more complex transitive systems operating in uncertain circumstances with a redistribution of capabilities and demands in case of cascades of failures.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"14 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":"115526449","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}
This paper describes a real-time kernel for running embedded applications on a recent family of Motorola microcontrollers. Both periodic and aperiodic real-time tasks are managed, as well as non real-time tasks. The kernel has been called Yartos, and uses a hard real-time scheduling algorithm based on an EDF approach for the periodic task; aperiodic tasks are executed with a total bandwidth server.
{"title":"A hard real-time kernel for Motorola microcontrollers","authors":"E. Mumolo, M. Nolich, Massimo Oss Noser","doi":"10.1109/ITI.2001.938000","DOIUrl":"https://doi.org/10.1109/ITI.2001.938000","url":null,"abstract":"This paper describes a real-time kernel for running embedded applications on a recent family of Motorola microcontrollers. Both periodic and aperiodic real-time tasks are managed, as well as non real-time tasks. The kernel has been called Yartos, and uses a hard real-time scheduling algorithm based on an EDF approach for the periodic task; aperiodic tasks are executed with a total bandwidth server.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"17 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":"125772276","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 paper describes work on a linguistic database of grammatical sentences of the Croatian language. In databases, sentences are shown as constituent structure trees, and words are shown with features and their values. The main project which is concerned with language databases is the Penn Treebank project of the Linguistic Data Consortium (A. Bias et al., 1995). The database is a result of theoretical research in the field of computational linguistics and its application in the Croatian language. The database of grammatical sentences of the Croatian language can also be accessed through the Internet.
本文描述了克罗地亚语语法句子的语言数据库的工作。在数据库中，句子以组成结构树的形式显示，单词以特征和值的形式显示。与语言数据库有关的主要项目是语言数据联盟的Penn Treebank项目(A. Bias et al.， 1995)。该数据库是计算语言学领域的理论研究及其在克罗地亚语中的应用的结果。克罗埃西亚语语法句子资料库也可透过网际网路存取。
{"title":"Database of grammatical sentences of Croatian language","authors":"B. Tepes, V. Mateljan","doi":"10.1109/ITI.2001.938051","DOIUrl":"https://doi.org/10.1109/ITI.2001.938051","url":null,"abstract":"The paper describes work on a linguistic database of grammatical sentences of the Croatian language. In databases, sentences are shown as constituent structure trees, and words are shown with features and their values. The main project which is concerned with language databases is the Penn Treebank project of the Linguistic Data Consortium (A. Bias et al., 1995). The database is a result of theoretical research in the field of computational linguistics and its application in the Croatian language. The database of grammatical sentences of the Croatian language can also be accessed through the Internet.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"8 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":"127782891","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 paper deals with protocols and architectures for a multi-platform distribution of real time applications. The main motivation for the work comes from a research project in robotics where different computers run distributed applications within a real time framework with different operating systems.
{"title":"MGP: a distributed, multi-platform, programming environment for real-time applications","authors":"E. Mumolo, S. Moratto, M. Nolich, G. Vercelli","doi":"10.1109/ITI.2001.938057","DOIUrl":"https://doi.org/10.1109/ITI.2001.938057","url":null,"abstract":"The paper deals with protocols and architectures for a multi-platform distribution of real time applications. The main motivation for the work comes from a research project in robotics where different computers run distributed applications within a real time framework with different operating systems.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"182 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":"133406059","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 novel method employing fuzzy logic and a genetic algorithm for automatic tuning of a Proportional Integral Derivative (PID) controller is presented. The technique adopted is based on the theory of dead-beat control. A fuzzy logic technique has been used to predict the controller output and the crisp consequent values of the rulebase on the Takagi-Sugeno model are optimized using a genetic algorithm. The proposition is an extension of the work by R. Bandyopadhyay and D. Patranabis (2001), where the rulebase was prepared based on the knowledge of process experts. Significant improvement has been obtained using a genetic algorithm by optimizing the crisp consequent values of the rulebase. As can be seen from the simulated results, the method shows substantial improvement over the controller tuned with the Ziegler-Nichols formula (J.G. Ziegler and N.B. Nichols, 1942) and the PID controller proposed by Bandyopadhyay and Patranabis.
提出了一种利用模糊逻辑和遗传算法实现比例积分导数(PID)控制器自动整定的新方法。所采用的技术是基于无差拍控制理论。采用模糊逻辑技术预测控制器输出，并采用遗传算法优化Takagi-Sugeno模型规则库的脆尾值。该命题是R. Bandyopadhyay和D. Patranabis(2001)的工作的延伸，其中规则库是根据过程专家的知识准备的。利用遗传算法对规则库的清晰结果值进行优化，得到了显著的改进。从仿真结果可以看出，该方法比采用Ziegler-Nichols公式(J.G. Ziegler and N.B. Nichols, 1942)和Bandyopadhyay和Patranabis提出的PID控制器有了很大的改进。
{"title":"A fuzzy-genetic approach for automatic tuning of a PID controller","authors":"U. Chakraborty, R. Bandyopadhyay, D. Patranabis","doi":"10.1109/ITI.2001.938034","DOIUrl":"https://doi.org/10.1109/ITI.2001.938034","url":null,"abstract":"A novel method employing fuzzy logic and a genetic algorithm for automatic tuning of a Proportional Integral Derivative (PID) controller is presented. The technique adopted is based on the theory of dead-beat control. A fuzzy logic technique has been used to predict the controller output and the crisp consequent values of the rulebase on the Takagi-Sugeno model are optimized using a genetic algorithm. The proposition is an extension of the work by R. Bandyopadhyay and D. Patranabis (2001), where the rulebase was prepared based on the knowledge of process experts. Significant improvement has been obtained using a genetic algorithm by optimizing the crisp consequent values of the rulebase. As can be seen from the simulated results, the method shows substantial improvement over the controller tuned with the Ziegler-Nichols formula (J.G. Ziegler and N.B. Nichols, 1942) and the PID controller proposed by Bandyopadhyay and Patranabis.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"217 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":"115648283","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}
Modern business relationships demand interoperability of various e-commerce applications using standardized protocols and formats for data interchange. A key factor for establishing seamless communication among enterprises is a common business vocabulary. The eXtensible Markup Language (XML) is one of the most promising standards for defining and naming data. XML is a Meta Language that allows each user to define the structure of the data relevant for a particular problem domain. However, XML is still an immature technology, which leads to problems regarding its deployment. We still do not have global agreement on the semantics and therefore each industry vertical has its own XML specification. The paper presents our approach to resolving the issue of heterogeneous XML semantics. We propose an object oriented approach and the use of standard libraries, which should present a common basis on which each new XML specification should be built.
{"title":"The XML esperanto or Tower of Babel: do we speak the same XML?","authors":"N. Vrcek, D. Kermek","doi":"10.1109/ITI.2001.938020","DOIUrl":"https://doi.org/10.1109/ITI.2001.938020","url":null,"abstract":"Modern business relationships demand interoperability of various e-commerce applications using standardized protocols and formats for data interchange. A key factor for establishing seamless communication among enterprises is a common business vocabulary. The eXtensible Markup Language (XML) is one of the most promising standards for defining and naming data. XML is a Meta Language that allows each user to define the structure of the data relevant for a particular problem domain. However, XML is still an immature technology, which leads to problems regarding its deployment. We still do not have global agreement on the semantics and therefore each industry vertical has its own XML specification. The paper presents our approach to resolving the issue of heterogeneous XML semantics. We propose an object oriented approach and the use of standard libraries, which should present a common basis on which each new XML specification should be built.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"15 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":"126516470","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}
Survival analysis is class of statistical methods for studying the occurrence and timing of many different kinds of events. In this research we applied survival analysis for comparing and estimating flushing times of sixteen protrenances of Penduculate Oak (euercus Robur L.). Flushing time is a very important feature of the physiological character and it is known that later flushing Oak has some good properties that are preserved even when it is grown on non-native sites. The survival analysis showed significant difference in flushing time of sixteen provenances and based on these results some later flushing Oak provenances were determined.
{"title":"Applying survival analysis for estimating and comparing flushing time variability","authors":"S. Perić, B. Bašić, J. Gračan, A. Jazbec","doi":"10.1109/ITI.2001.938030","DOIUrl":"https://doi.org/10.1109/ITI.2001.938030","url":null,"abstract":"Survival analysis is class of statistical methods for studying the occurrence and timing of many different kinds of events. In this research we applied survival analysis for comparing and estimating flushing times of sixteen protrenances of Penduculate Oak (euercus Robur L.). Flushing time is a very important feature of the physiological character and it is known that later flushing Oak has some good properties that are preserved even when it is grown on non-native sites. The survival analysis showed significant difference in flushing time of sixteen provenances and based on these results some later flushing Oak provenances were determined.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"63 4 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":"130535318","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 usually impossible to exactly solve hard optimization problems. One is thus directed to iterative algorithms. In the implementation of these iterative algorithms, some common characteristics can be observed, which can be generalized in an object-oriented framework. This can significantly reduce the time needed for implementation of an iterative algorithm. This paper presents a class hierarchy, which can be used as an object-oriented framework for the solutions of iterative problems. Utilizing the options available in object-oriented languages, it separates the class interface from the implementation.
{"title":"General object-oriented framework for iterative optimization algorithms","authors":"Z. Vanjak, V. Mornar","doi":"10.1109/ITI.2001.938045","DOIUrl":"https://doi.org/10.1109/ITI.2001.938045","url":null,"abstract":"It is usually impossible to exactly solve hard optimization problems. One is thus directed to iterative algorithms. In the implementation of these iterative algorithms, some common characteristics can be observed, which can be generalized in an object-oriented framework. This can significantly reduce the time needed for implementation of an iterative algorithm. This paper presents a class hierarchy, which can be used as an object-oriented framework for the solutions of iterative problems. Utilizing the options available in object-oriented languages, it separates the class interface from the implementation.","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":"130198346","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
扫码关注我们
求助内容：
应助结果提醒方式：