K. Sanjeevan, J. Cruellas, A. Canals, T. Millan, D. Chiorean, M. Mullet, M. Robert
UML (Unified Modelling Language) defines a standard notation for object-oriented systems. It is now the de-facto standard graphical language for specifying, constructing, visualising and documenting software-intensive systems. Some extensions to the original standard have also been proposed and implemented for business modelling. NEPTUNE (Nice Environment with a Process and Tools Using Norms and Examples) is a European Commission-funded project under the IST (Information Society Technologies) programme. A significant innovation in this project is the incorporation of the use of UML in contexts other than software engineering (viz. in business process modelling and knowledge engineering). Additionally, the validation tools that we are developing check for coherency between UML diagrams (for each working context) - something that is not available in other tools. Customised document generation is another powerful functionality.
{"title":"NEPTUNE - an integrated UML toolset and methodology","authors":"K. Sanjeevan, J. Cruellas, A. Canals, T. Millan, D. Chiorean, M. Mullet, M. Robert","doi":"10.1109/ITI.2001.938063","DOIUrl":"https://doi.org/10.1109/ITI.2001.938063","url":null,"abstract":"UML (Unified Modelling Language) defines a standard notation for object-oriented systems. It is now the de-facto standard graphical language for specifying, constructing, visualising and documenting software-intensive systems. Some extensions to the original standard have also been proposed and implemented for business modelling. NEPTUNE (Nice Environment with a Process and Tools Using Norms and Examples) is a European Commission-funded project under the IST (Information Society Technologies) programme. A significant innovation in this project is the incorporation of the use of UML in contexts other than software engineering (viz. in business process modelling and knowledge engineering). Additionally, the validation tools that we are developing check for coherency between UML diagrams (for each working context) - something that is not available in other tools. Customised document generation is another powerful functionality.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"185 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":"125671878","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. Dimitrova, T. Georgiev, A. Ratkov, V. Ivanova, J. Kristeva, B. Ratkov, A. Mantchev
Dynamic experimental data of sorption and desorption phase of L-lysine ion-exchange purification process are investigated. The behaviour of the experimental data is described through non-linear dynamic mathematical models, taking into account the relationship between L-lysine concentration and pH of the culture broth, temperature, flow rate, etc. The adequacy of the proposed time series models is confirmed by simulation research.
{"title":"Modelling of L-lysine purification process","authors":"A. Dimitrova, T. Georgiev, A. Ratkov, V. Ivanova, J. Kristeva, B. Ratkov, A. Mantchev","doi":"10.1109/ITI.2001.938036","DOIUrl":"https://doi.org/10.1109/ITI.2001.938036","url":null,"abstract":"Dynamic experimental data of sorption and desorption phase of L-lysine ion-exchange purification process are investigated. The behaviour of the experimental data is described through non-linear dynamic mathematical models, taking into account the relationship between L-lysine concentration and pH of the culture broth, temperature, flow rate, etc. The adequacy of the proposed time series models is confirmed by simulation research.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"73 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":"130283659","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}
An algorithm for quasi-regular hexagon tessellation of uniformly distributed points is presented. At first, the needed definitions and notations are introduced. Then, the algorithm for the tessellation, based on "laying-down the sticks" analogy, is given. Finally, the estimation of the algorithm time complexity is done.
{"title":"Quasi-regular tessellation of hexagons","authors":"B. Kaucic, B. Žalik","doi":"10.1109/ITI.2001.938048","DOIUrl":"https://doi.org/10.1109/ITI.2001.938048","url":null,"abstract":"An algorithm for quasi-regular hexagon tessellation of uniformly distributed points is presented. At first, the needed definitions and notations are introduced. Then, the algorithm for the tessellation, based on \"laying-down the sticks\" analogy, is given. Finally, the estimation of the algorithm time complexity is done.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"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":"133080594","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}
Sun Yubing, Peng Honghui, Lin Zuoquan, Huang Dekun
A software agent system for automatic information gathering, filtering, classifying and delivering of news information on the Internet is provided. The structure and functions of the system are presented. The algorithms of document pre-processing and representation using vectors, auto-classification, auto-learning of user interest are described. Finally, some experiments on the classification of news information are discussed.
{"title":"A software agent system for news information delivery on Internet","authors":"Sun Yubing, Peng Honghui, Lin Zuoquan, Huang Dekun","doi":"10.1109/ITI.2001.938012","DOIUrl":"https://doi.org/10.1109/ITI.2001.938012","url":null,"abstract":"A software agent system for automatic information gathering, filtering, classifying and delivering of news information on the Internet is provided. The structure and functions of the system are presented. The algorithms of document pre-processing and representation using vectors, auto-classification, auto-learning of user interest are described. Finally, some experiments on the classification of news information are discussed.","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":"115764233","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}
Based on evolutionary computation (EC) concepts, we developed an evolutionary navigator (EN) as an approach to path planning and navigation. The EN is characterized by generality, flexibility and adaptability. It integrates the planning process in the evolutionary algorithm, which: (1) accommodates different optimization criteria and changes in these criteria; (2) incorporates various types of problem specific domain knowledge; and (3) enables good tradeoffs among near-optimality of paths, high planning efficiency and effective handling of unknown obstacles.
{"title":"Evolution of path finding","authors":"M. Gombosi","doi":"10.1109/ITI.2001.938009","DOIUrl":"https://doi.org/10.1109/ITI.2001.938009","url":null,"abstract":"Based on evolutionary computation (EC) concepts, we developed an evolutionary navigator (EN) as an approach to path planning and navigation. The EN is characterized by generality, flexibility and adaptability. It integrates the planning process in the evolutionary algorithm, which: (1) accommodates different optimization criteria and changes in these criteria; (2) incorporates various types of problem specific domain knowledge; and (3) enables good tradeoffs among near-optimality of paths, high planning efficiency and effective handling of unknown obstacles.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"9 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":"124793508","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 presents a methodology overview for test synthesis of VLSI and ASIC systems using an automated process of VHDL synthesis simultaneously with Automatic Functional Test Generator (AFTG). The determination of the test efficiency of instruction mixes is discussed.
{"title":"Design methodology and practice of VLSI functional test synthesis","authors":"J. Hudec","doi":"10.1109/ITI.2001.938056","DOIUrl":"https://doi.org/10.1109/ITI.2001.938056","url":null,"abstract":"The paper presents a methodology overview for test synthesis of VLSI and ASIC systems using an automated process of VHDL synthesis simultaneously with Automatic Functional Test Generator (AFTG). The determination of the test efficiency of instruction mixes is discussed.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"353 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":"115897205","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 main motto of rough sets is: "Let the data speak for themselves!". Rough sets are based on the theory of sets. The main applications of rough set theory are attribute reduction, rule generation and prediction. Many examples of applications of rough sets to process control, economics, medical diagnosis, biochemistry, environmental science, biology, chemistry psychology, conflict analysis and other fields can be found in (Lin and Cercone, 1997; Polkowski and Skowron, 1998; Slowinski, 1992). We developed a different algorithm for searching the core. The application can be used in most mentioned cases.
粗糙集的主要格言是:“让数据自己说话!”粗糙集是建立在集合理论基础上的。粗糙集理论的主要应用是属性约简、规则生成和预测。粗糙集在过程控制、经济学、医学诊断、生物化学、环境科学、生物学、化学心理学、冲突分析等领域的应用实例在(Lin和Cercone, 1997;Polkowski and Skowron, 1998;Slowinski, 1992)。我们开发了一种不同的算法来搜索核心。该应用程序可用于上述大多数情况。
{"title":"Core searching on rough sets","authors":"K. Boži","doi":"10.1109/ITI.2001.938021","DOIUrl":"https://doi.org/10.1109/ITI.2001.938021","url":null,"abstract":"The main motto of rough sets is: \"Let the data speak for themselves!\". Rough sets are based on the theory of sets. The main applications of rough set theory are attribute reduction, rule generation and prediction. Many examples of applications of rough sets to process control, economics, medical diagnosis, biochemistry, environmental science, biology, chemistry psychology, conflict analysis and other fields can be found in (Lin and Cercone, 1997; Polkowski and Skowron, 1998; Slowinski, 1992). We developed a different algorithm for searching the core. The application can be used in most mentioned cases.","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":"125289593","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 design of a mobile robot which is underway at DEEI, the EE&CS Dept of the University of Trieste, is described. The design has been entirely performed using UML, and the whole architecture is presented together with the diagrams which correspond to every component of the robot: mechanics, electronics and computational sub-systems.
{"title":"Object oriented design of a mobile robot using UML","authors":"E. Mumolo, S. Moratto, M. Nolich, G. Vercelli","doi":"10.1109/ITI.2001.938058","DOIUrl":"https://doi.org/10.1109/ITI.2001.938058","url":null,"abstract":"The design of a mobile robot which is underway at DEEI, the EE&CS Dept of the University of Trieste, is described. The design has been entirely performed using UML, and the whole architecture is presented together with the diagrams which correspond to every component of the robot: mechanics, electronics and computational sub-systems.","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":"128861862","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 method for compromise factor extraction from covariance/correlation matrices corresponding to different strata is introduced. Compromise factors are independent and on this constraint they explain the largest possible part of the variables' total variance over the strata. Binary samples are also investigated. The so-called compromise representation of the strata is introduced. A practical application for parallel factoring of medical data in different strata is also presented.
{"title":"Parallel factoring of strata","authors":"M. Bolla","doi":"10.1109/ITI.2001.938028","DOIUrl":"https://doi.org/10.1109/ITI.2001.938028","url":null,"abstract":"A method for compromise factor extraction from covariance/correlation matrices corresponding to different strata is introduced. Compromise factors are independent and on this constraint they explain the largest possible part of the variables' total variance over the strata. Binary samples are also investigated. The so-called compromise representation of the strata is introduced. A practical application for parallel factoring of medical data in different strata is also presented.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"33 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":"127350518","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 R-function method is presented. This method is used to solve the inverse problem of heat conduction. The problem of stationary heat conduction is considered in a certain limited domain /spl Omega/.
本文介绍了r函数法。该方法用于求解热传导逆问题。在某限定域内考虑稳态热传导问题。
{"title":"On R-function theory and its application in inverse problems of heat conduction","authors":"R. Gryzmkowski, K. Korek","doi":"10.1109/ITI.2001.938047","DOIUrl":"https://doi.org/10.1109/ITI.2001.938047","url":null,"abstract":"In this paper the R-function method is presented. This method is used to solve the inverse problem of heat conduction. The problem of stationary heat conduction is considered in a certain limited domain /spl Omega/.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"16 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":"115437908","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
扫码关注我们
求助内容：
应助结果提醒方式：