The concepts of the planned Electronic Procurement System of the Hungarian government is discussed. The definition of the concept started in June 1999 and the implementation starts in June 2001. The first phase of the project, which makes available an electronic catalogue to the organizations of the central budget, will be finished by the end of the year (2001). The whole system will be operational in 2003.
{"title":"The electronic procurement system of the Hungarian government","authors":"I. Futó","doi":"10.1109/ITI.2001.938015","DOIUrl":"https://doi.org/10.1109/ITI.2001.938015","url":null,"abstract":"The concepts of the planned Electronic Procurement System of the Hungarian government is discussed. The definition of the concept started in June 1999 and the implementation starts in June 2001. The first phase of the project, which makes available an electronic catalogue to the organizations of the central budget, will be finished by the end of the year (2001). The whole system will be operational in 2003.","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":"123351395","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 Unified Modeling Language (UML) proposes a set of models but does not have a methodology that clearly fixes both the use of these various models (diagrams) and the semantic links able to exist between them. In particular, the interaction diagrams of UML do not have, according to the current metamodel, an operational semantics defining formally how such a diagram is executed. The objective of this article is twofold: to propose a step towards a formal semantics to the interaction diagrams of UML by defining a partial order between messages and actions; and to generate a Petri net that defines the semantics of this diagram. Such a semantics can help the designer in the validation of his specifications, establishing a link between the interaction diagrams and the activity diagrams and also allowing to generate code.
{"title":"Ordering actions in sequence diagrams of UML","authors":"J. Cardoso, C. Sibertin-Blanc","doi":"10.1109/ITI.2001.937990","DOIUrl":"https://doi.org/10.1109/ITI.2001.937990","url":null,"abstract":"The Unified Modeling Language (UML) proposes a set of models but does not have a methodology that clearly fixes both the use of these various models (diagrams) and the semantic links able to exist between them. In particular, the interaction diagrams of UML do not have, according to the current metamodel, an operational semantics defining formally how such a diagram is executed. The objective of this article is twofold: to propose a step towards a formal semantics to the interaction diagrams of UML by defining a partial order between messages and actions; and to generate a Petri net that defines the semantics of this diagram. Such a semantics can help the designer in the validation of his specifications, establishing a link between the interaction diagrams and the activity diagrams and also allowing to generate code.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"5 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":"128708693","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 imposed directionality in the relation assigning to restriction in the partial lambda calculus to obtain a reduction system. Investigation of such reduction systems gave some results concerning confluence in the past which we believe can be sharpened.
{"title":"Toward a reduction system commuting with beta reduction in the partial lambda calculus","authors":"S. Gaborovic","doi":"10.1109/ITI.2001.938046","DOIUrl":"https://doi.org/10.1109/ITI.2001.938046","url":null,"abstract":"We imposed directionality in the relation assigning to restriction in the partial lambda calculus to obtain a reduction system. Investigation of such reduction systems gave some results concerning confluence in the past which we believe can be sharpened.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"365 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":"124582509","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 mathematical model for the cost optimization of the EL-TO Zagreb thermal power plant has been developed. The plant supplies hot water for district heating, process steam for industry and electric power. The rather detailed mathematical model of the plant includes models of all main components like gas turbine facilities with heat recovery boilers, high pressure steam generators, back-pressure turbines, peak load boilers and other equipment like heat exchangers, deaerators and pressure reduction valves. All boilers can use alternatively natural gas or heavy oil as fuel while gas turbines are supplied with natural gas only. The generalized reduced gradient method was used for solving the strongly nonlinear optimization problem. The goal of the mathematical model was to minimize the production cost by satisfying the district heat and industrial steam consumption. Results of the sensitivity analyses of the influence of extraction steam pressure levels on cost function are presented as well as a comparison of optimization results with operational data.
{"title":"Optimization model for EL-TO Zagreb cogeneration plant","authors":"Z. Bogdan, M. Baburić, N. Šerman","doi":"10.1109/ITI.2001.938032","DOIUrl":"https://doi.org/10.1109/ITI.2001.938032","url":null,"abstract":"A mathematical model for the cost optimization of the EL-TO Zagreb thermal power plant has been developed. The plant supplies hot water for district heating, process steam for industry and electric power. The rather detailed mathematical model of the plant includes models of all main components like gas turbine facilities with heat recovery boilers, high pressure steam generators, back-pressure turbines, peak load boilers and other equipment like heat exchangers, deaerators and pressure reduction valves. All boilers can use alternatively natural gas or heavy oil as fuel while gas turbines are supplied with natural gas only. The generalized reduced gradient method was used for solving the strongly nonlinear optimization problem. The goal of the mathematical model was to minimize the production cost by satisfying the district heat and industrial steam consumption. Results of the sensitivity analyses of the influence of extraction steam pressure levels on cost function are presented as well as a comparison of optimization results with operational data.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"122 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":"121965866","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 article goes into the analysis of program executive path at length, performs a system of program executive path visualization, compares several aspects of different path coverage criteria and discusses the implementation of two specific, yet important, path combinations. In the end, it discusses briefly the significance based on this system and further study.
{"title":"A system on visualization of program executive path and extraction of path sets","authors":"Cai Zhimin, Rong Guo-ping, Zhou Peng, Pan Jin-gui","doi":"10.1109/ITI.2001.938003","DOIUrl":"https://doi.org/10.1109/ITI.2001.938003","url":null,"abstract":"This article goes into the analysis of program executive path at length, performs a system of program executive path visualization, compares several aspects of different path coverage criteria and discusses the implementation of two specific, yet important, path combinations. In the end, it discusses briefly the significance based on this system and further study.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"24 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":"132211762","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 product quality characteristics should be the prime drivers when assessing and improving the quality of the software development process as we are concerned with the product quality. The quality of the software product is determined by the quality of the software process. This seems intuitive but there is no empirical evidence to prove its validity yet. QIS establishes a system that enables to analyse the relation between base practices and processes of the SPICE model and the eleven product quality factors and criteria of McCall's (1977) model for software product evaluation. The main goal of QIS is to evaluate and verify benefits gained by improving the process maturity level. In front line of both, the process model and product quality model is the software product improvement, resulting in a high quality software product delivered on time and at less cost.
{"title":"The concept of quality information system (QIS)","authors":"Ninoslav Slavek","doi":"10.1109/ITI.2001.938001","DOIUrl":"https://doi.org/10.1109/ITI.2001.938001","url":null,"abstract":"The product quality characteristics should be the prime drivers when assessing and improving the quality of the software development process as we are concerned with the product quality. The quality of the software product is determined by the quality of the software process. This seems intuitive but there is no empirical evidence to prove its validity yet. QIS establishes a system that enables to analyse the relation between base practices and processes of the SPICE model and the eleven product quality factors and criteria of McCall's (1977) model for software product evaluation. The main goal of QIS is to evaluate and verify benefits gained by improving the process maturity level. In front line of both, the process model and product quality model is the software product improvement, resulting in a high quality software product delivered on time and at less cost.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"94 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":"131668470","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}
Describes the backbone network structure for an information network and CATV applications. Cable TV is a natural network for carrying high-capacity, bandwidth-intense information. In the age of analogue programme signals, cable's capacity was a natural transmission medium for broadcast colour TV and high-fidelity stereo-sound TV programmes. In the new digital programme signal age, cable's high capacity is a natural network for carrying interactive, computer-based, data-intensive multimedia programs.
{"title":"Broadband CATV network - design and simulation","authors":"R. Volnar","doi":"10.1109/ITI.2001.938064","DOIUrl":"https://doi.org/10.1109/ITI.2001.938064","url":null,"abstract":"Describes the backbone network structure for an information network and CATV applications. Cable TV is a natural network for carrying high-capacity, bandwidth-intense information. In the age of analogue programme signals, cable's capacity was a natural transmission medium for broadcast colour TV and high-fidelity stereo-sound TV programmes. In the new digital programme signal age, cable's high capacity is a natural network for carrying interactive, computer-based, data-intensive multimedia programs.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"51 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":"133253448","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}
Focuses on the design of a parallel processor targeted at the rapid execution of neural networks. The basic architecture of the toroidal neural processor (TNP) is based on a toroidal mesh. This architecture was inspired by the need for a low-cost massively parallel processing system that could emulate a large variety of neural models. The TNP consists of two basic elements: a control unit and some processing units. The control unit acts as distributor of information and instructions for the processing units. The processing units perform exact operations on the data, based on the execution of instructions. The design of the TNP has a typical SIMD architecture. The processor has an enhanced interface with the host computer. This interface provides not only operations for programming and control of the TNP, but, in addition, any type of neural network and learning algorithm can be implemented through this interface. In the design of the TNP are implemented 10 control unit instructions and 11 processing unit instructions. The architecture of the TNP is optimized for Xilinx Virtex devices. The design uses many features of this family of FPGA devices. The VHDL constructs are mapped into hardware in the synthesis, optimization, place-and-route and implementation process. The optimization can significantly change the hardware that is generated. The TNP was tested, simulated and implemented in a Xilinx Foundation Technology Express version 3.3i environment with the Virtex XCV300 FPGA array and the HW-AFX-BG352-100 prototyping platform. The whole design can be implemented in Virtex E and Spartan devices too.
重点介绍了一种针对神经网络快速执行的并行处理器的设计。环面神经处理器(TNP)的基本结构是基于环面网格。这种架构的灵感来自于对一种低成本的大规模并行处理系统的需求，这种系统可以模拟各种各样的神经模型。TNP由两个基本部件组成:一个控制单元和一些处理单元。控制单元充当处理单元的信息和指令的分发者。处理单元根据指令的执行，对数据执行精确的操作。TNP的设计具有典型的SIMD体系结构。处理器与主机的接口增强了。该接口不仅提供TNP的编程和控制操作，还可以通过该接口实现任何类型的神经网络和学习算法。在TNP的设计中，实现了10条控制单元指令和11条处理单元指令。TNP的架构针对Xilinx Virtex设备进行了优化。本设计利用了该系列FPGA器件的许多特点。VHDL结构在合成、优化、放置和路由和实现过程中映射到硬件中。优化可以显著改变生成的硬件。TNP在Xilinx Foundation Technology Express 3.3i环境中进行了测试、模拟和实现，采用了Virtex XCV300 FPGA阵列和HW-AFX-BG352-100原型平台。整个设计也可以在Virtex E和Spartan设备上实现。
{"title":"Design of the neural processor optimized for Xilinx Virtex FPGA devices","authors":"J. Hudec, M. Hust'ava","doi":"10.1109/ITI.2001.938061","DOIUrl":"https://doi.org/10.1109/ITI.2001.938061","url":null,"abstract":"Focuses on the design of a parallel processor targeted at the rapid execution of neural networks. The basic architecture of the toroidal neural processor (TNP) is based on a toroidal mesh. This architecture was inspired by the need for a low-cost massively parallel processing system that could emulate a large variety of neural models. The TNP consists of two basic elements: a control unit and some processing units. The control unit acts as distributor of information and instructions for the processing units. The processing units perform exact operations on the data, based on the execution of instructions. The design of the TNP has a typical SIMD architecture. The processor has an enhanced interface with the host computer. This interface provides not only operations for programming and control of the TNP, but, in addition, any type of neural network and learning algorithm can be implemented through this interface. In the design of the TNP are implemented 10 control unit instructions and 11 processing unit instructions. The architecture of the TNP is optimized for Xilinx Virtex devices. The design uses many features of this family of FPGA devices. The VHDL constructs are mapped into hardware in the synthesis, optimization, place-and-route and implementation process. The optimization can significantly change the hardware that is generated. The TNP was tested, simulated and implemented in a Xilinx Foundation Technology Express version 3.3i environment with the Virtex XCV300 FPGA array and the HW-AFX-BG352-100 prototyping platform. The whole design can be implemented in Virtex E and Spartan devices too.","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":"129383500","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 a multimedia application intended for observing and analysing microfluctuations of light around various objects and, in particular around living beings. The being is shot by a classical analogue SVHS motion camera connected to a TV tuner. Images are then grabbed by the software in regular time intervals. The sequences of images are then processed, and as a result, the microfluctuations of light around the beings become visible. Consequently, due to the possible interference between light and the organisms' biofield some insight into the state of the latter can be gained. It should be noticed that the interpretation of the results can be performed by a well-trained person.
{"title":"Low cost energy analyser of beings","authors":"S. Krivograd, M. Škarja, B. Žalik, D. Podgorelec","doi":"10.1109/ITI.2001.938029","DOIUrl":"https://doi.org/10.1109/ITI.2001.938029","url":null,"abstract":"The paper deals with a multimedia application intended for observing and analysing microfluctuations of light around various objects and, in particular around living beings. The being is shot by a classical analogue SVHS motion camera connected to a TV tuner. Images are then grabbed by the software in regular time intervals. The sequences of images are then processed, and as a result, the microfluctuations of light around the beings become visible. Consequently, due to the possible interference between light and the organisms' biofield some insight into the state of the latter can be gained. It should be noticed that the interpretation of the results can be performed by a well-trained person.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"30 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":"124667269","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}
Genetic algorithms are a computational paradigm belonging to the class of optimization techniques known as evolutionary computation. They have been implemented successfully to solve many difficult optimization problems. We have developed a new genetic algorithm for the maximum independent set problem based on the elitist strategy. The algorithm presented is tested on the so-called DIMACS benchmark graphs. The effectiveness of the algorithm is very satisfactory since it outperforms in most cases the genetic algorithms for the maximum independent set problem reported in the literature.
{"title":"An elitist genetic algorithm for the maximum independent set problem","authors":"A. Taranenko, A. Vesel","doi":"10.1109/ITI.2001.938044","DOIUrl":"https://doi.org/10.1109/ITI.2001.938044","url":null,"abstract":"Genetic algorithms are a computational paradigm belonging to the class of optimization techniques known as evolutionary computation. They have been implemented successfully to solve many difficult optimization problems. We have developed a new genetic algorithm for the maximum independent set problem based on the elitist strategy. The algorithm presented is tested on the so-called DIMACS benchmark graphs. The effectiveness of the algorithm is very satisfactory since it outperforms in most cases the genetic algorithms for the maximum independent set problem reported in the literature.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"35 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":"127562891","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
扫码关注我们
求助内容：
应助结果提醒方式：