The main goal is to present the business process renovation as the key element of e-business orientation and the highest level of strategy for managing change that commonly cannot be handled by continuous improvement and reengineering methods or organizational restructuring. We introduce a business rule-transformation approach to business renovation. Its motivation is to help establish an environment and approach in which business rules can be traced from their origin in the business environment through to their implementation in information systems
{"title":"The business rule-transformation approach","authors":"A. Kovačič, A. Groznik","doi":"10.1109/ITI.2004.241400","DOIUrl":"https://doi.org/10.1109/ITI.2004.241400","url":null,"abstract":"The main goal is to present the business process renovation as the key element of e-business orientation and the highest level of strategy for managing change that commonly cannot be handled by continuous improvement and reengineering methods or organizational restructuring. We introduce a business rule-transformation approach to business renovation. Its motivation is to help establish an environment and approach in which business rules can be traced from their origin in the business environment through to their implementation in information systems","PeriodicalId":320305,"journal":{"name":"26th International Conference on Information Technology Interfaces, 2004.","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130840441","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}
Applied is a systems view to modelling of mammalian cell cultivation in a bioreactor for biotechnological applications. Proposed is a model with a hierarchical structure with three levels: the macroscopic level of a reactor, microscopic level of a cell population, and molecular level of protein interactions with cyclin dependent kineases. The macroscopic model provides basis for production process control by optimal feeding of nutrients and growth factors during cultivation. The microscopic model simplifies a cell population into three pools of cells: P proliferating, Q quiescent, and D dead cells. Dynamics of cell population is determined by the least square estimation of the specific rates of the pool transitions. The molecular model enables theoretical basis for prediction of G1/S transition and the rate of transition from proliferating cells into quiescent state. Conceptual application of the molecular model in conjunction with the mammalian cell production system is discussed
{"title":"Simulation of mammalian cell population dynamics","authors":"Z. Kurtanjek","doi":"10.1109/ITI.2004.242818","DOIUrl":"https://doi.org/10.1109/ITI.2004.242818","url":null,"abstract":"Applied is a systems view to modelling of mammalian cell cultivation in a bioreactor for biotechnological applications. Proposed is a model with a hierarchical structure with three levels: the macroscopic level of a reactor, microscopic level of a cell population, and molecular level of protein interactions with cyclin dependent kineases. The macroscopic model provides basis for production process control by optimal feeding of nutrients and growth factors during cultivation. The microscopic model simplifies a cell population into three pools of cells: P proliferating, Q quiescent, and D dead cells. Dynamics of cell population is determined by the least square estimation of the specific rates of the pool transitions. The molecular model enables theoretical basis for prediction of G1/S transition and the rate of transition from proliferating cells into quiescent state. Conceptual application of the molecular model in conjunction with the mammalian cell production system is discussed","PeriodicalId":320305,"journal":{"name":"26th International Conference on Information Technology Interfaces, 2004.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133675263","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}
Several methods for representing (drawing) graphs are considered, which minimize different energies of the representations. The idea of representations is generalized to maps. Some well-known operations on maps are defined, using a set of matrices. These matrices can also be used to obtain the representations of the derived maps from representations of original maps
{"title":"Representations of graphs and maps","authors":"T. Pisanski, A. Žitnik","doi":"10.1109/ITI.2004.242813","DOIUrl":"https://doi.org/10.1109/ITI.2004.242813","url":null,"abstract":"Several methods for representing (drawing) graphs are considered, which minimize different energies of the representations. The idea of representations is generalized to maps. Some well-known operations on maps are defined, using a set of matrices. These matrices can also be used to obtain the representations of the derived maps from representations of original maps","PeriodicalId":320305,"journal":{"name":"26th International Conference on Information Technology Interfaces, 2004.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114329813","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}
Educational programs in information technology have to be continually re-evaluated and revised. A study was conducted to determine perceived IT knowledge requirements for business professionals. The study suggests that IT professionals in business have to be armed with a mix of knowledge in IT technology, management, and business operations. Also, it shows that practitioners perceive managerial and business issues as being more important than do students
{"title":"Evaluating IT knowledge requirements for business professionals","authors":"M. Varga, C. Stiffler, V. Luzar-Stiffler","doi":"10.1109/ITI.2004.242070","DOIUrl":"https://doi.org/10.1109/ITI.2004.242070","url":null,"abstract":"Educational programs in information technology have to be continually re-evaluated and revised. A study was conducted to determine perceived IT knowledge requirements for business professionals. The study suggests that IT professionals in business have to be armed with a mix of knowledge in IT technology, management, and business operations. Also, it shows that practitioners perceive managerial and business issues as being more important than do students","PeriodicalId":320305,"journal":{"name":"26th International Conference on Information Technology Interfaces, 2004.","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133174936","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}
Extreme complexity of traffic systems imposes Avo problems in their simulation: the simulation speed, and the model's level of details. The simulation speed is improved by using better simulation algorithms, or by using more processing power. The level of details is managed by the most appropriate modeling scale. The simultaneous usage of multiple scales gives multiscale models. We have implemented a prototype simulator in order to investigate the possibility of using agents in multiscale modeling. The agents model characteristics of vehicles and drivers' behavior. Preliminary experiments have shown satisfactory simulation speed. We plan to enhance the simulator with agents that model road sections in order to support meso- and macroscale models
{"title":"Implementing multiscale traffic simulators using agents","authors":"G. Jakovljević, D. Basch","doi":"10.1109/ITI.2004.242272","DOIUrl":"https://doi.org/10.1109/ITI.2004.242272","url":null,"abstract":"Extreme complexity of traffic systems imposes Avo problems in their simulation: the simulation speed, and the model's level of details. The simulation speed is improved by using better simulation algorithms, or by using more processing power. The level of details is managed by the most appropriate modeling scale. The simultaneous usage of multiple scales gives multiscale models. We have implemented a prototype simulator in order to investigate the possibility of using agents in multiscale modeling. The agents model characteristics of vehicles and drivers' behavior. Preliminary experiments have shown satisfactory simulation speed. We plan to enhance the simulator with agents that model road sections in order to support meso- and macroscale models","PeriodicalId":320305,"journal":{"name":"26th International Conference on Information Technology Interfaces, 2004.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126066121","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 describe new binary algorithm for the prediction of alpha and beta protein folding types from RNA, DNA and amino acid sequences. The method enables quick, simple and accurate prediction of alpha and beta protein folds on a personal computer by means of few binary patterns of coded amino acid and nucleotide physicochemical properties. The algorithm was tested with machine learning SMO (sequential minimal optimisation) classifier for the support vector machines and classification trees, on a dataset of 140 dissimilar protein folds. Depending on the method of testing, the overall classification accuracy was 91.43%-100% and the tenfold cross-validation result of the procedure was 83.57%->90%. Genetic code randomisation analysis based on 100,000 different codes tested for the protein fold prediction quality indicated that: a) there is a very low chance of p=2.7times10-4 that a better code than the natural one specified by the binary coding algorithm is randomly produced, b) dipeptides represent basic protein units with respect to the natural genetic code defining of the secondary protein structure
{"title":"Binary coding, mRNA information and protein structure","authors":"N. Štambuk, P. Konjevoda, N. Gotovac","doi":"10.2498/CIT.2004.02.02","DOIUrl":"https://doi.org/10.2498/CIT.2004.02.02","url":null,"abstract":"We describe new binary algorithm for the prediction of alpha and beta protein folding types from RNA, DNA and amino acid sequences. The method enables quick, simple and accurate prediction of alpha and beta protein folds on a personal computer by means of few binary patterns of coded amino acid and nucleotide physicochemical properties. The algorithm was tested with machine learning SMO (sequential minimal optimisation) classifier for the support vector machines and classification trees, on a dataset of 140 dissimilar protein folds. Depending on the method of testing, the overall classification accuracy was 91.43%-100% and the tenfold cross-validation result of the procedure was 83.57%->90%. Genetic code randomisation analysis based on 100,000 different codes tested for the protein fold prediction quality indicated that: a) there is a very low chance of p=2.7times10-4 that a better code than the natural one specified by the binary coding algorithm is randomly produced, b) dipeptides represent basic protein units with respect to the natural genetic code defining of the secondary protein structure","PeriodicalId":320305,"journal":{"name":"26th International Conference on Information Technology Interfaces, 2004.","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130166045","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}
With the huge amount of available textual data, we need to find convenient ways to process the data and to get invaluable information. It appears that the use of factorial correspondence analysis allows to get most of the information included in the data. Besides, even after the data processing, we still have a big amount of material and we need visualization tools to display it. In this paper, we show how to use correspondence analysis in a sensible way and we give an application on the analysis of the internal scientific production of an important research center in France : the INRIA, the french national institute for research in computer science and control
{"title":"Intensive use of correspondence analysis for information retrieval","authors":"A. Morin","doi":"10.1109/ITI.2004.241694","DOIUrl":"https://doi.org/10.1109/ITI.2004.241694","url":null,"abstract":"With the huge amount of available textual data, we need to find convenient ways to process the data and to get invaluable information. It appears that the use of factorial correspondence analysis allows to get most of the information included in the data. Besides, even after the data processing, we still have a big amount of material and we need visualization tools to display it. In this paper, we show how to use correspondence analysis in a sensible way and we give an application on the analysis of the internal scientific production of an important research center in France : the INRIA, the french national institute for research in computer science and control","PeriodicalId":320305,"journal":{"name":"26th International Conference on Information Technology Interfaces, 2004.","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127409816","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 analysis of designed experiment with missing observation has been dealt by the use of the EM algorithm even before the fundamental paper by Dempster, Laird and Rubin (1977). The direct application of the EM algorithm to a data set following designed experiments such as randomized block designs, or factorial experiments, with missing observations may lead to the estimation of parametric functions that are not estimable. In this paper we present an adjustment of the EM algorithm for additive classification models that prevents the user from obtaining results, which are not reliable. The adjustment consists in applying the R-process introduced by Birkes, Dodge and Seely (1976), that determines which are the estimable parametric functions. The observations and the parameters are then partitioned in a suitable way, and the maximum likelihood estimates for the estimable parametric functions are derived applying EM to each partition. The proposed algorithm is called REM; several numerical examples and one application are presented
{"title":"Adjusting the EM algorithm for design of experiments with missing data","authors":"Y. Dodge, Alice Zoppé","doi":"10.1109/ITI.2004.242811","DOIUrl":"https://doi.org/10.1109/ITI.2004.242811","url":null,"abstract":"The analysis of designed experiment with missing observation has been dealt by the use of the EM algorithm even before the fundamental paper by Dempster, Laird and Rubin (1977). The direct application of the EM algorithm to a data set following designed experiments such as randomized block designs, or factorial experiments, with missing observations may lead to the estimation of parametric functions that are not estimable. In this paper we present an adjustment of the EM algorithm for additive classification models that prevents the user from obtaining results, which are not reliable. The adjustment consists in applying the R-process introduced by Birkes, Dodge and Seely (1976), that determines which are the estimable parametric functions. The observations and the parameters are then partitioned in a suitable way, and the maximum likelihood estimates for the estimable parametric functions are derived applying EM to each partition. The proposed algorithm is called REM; several numerical examples and one application are presented","PeriodicalId":320305,"journal":{"name":"26th International Conference on Information Technology Interfaces, 2004.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129447855","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 multidatabase system (MDBS) is a software package that allows user transactions to invoke retrieval and update instructions against data located in autonomous heterogeneous hardware and software environments. Here, the Tanagra Project is presented, a large part of which is a simple MDBS API. This API is introduced, and the data model it uses is described. The layers of the API and the tasks and capabilities of each layer are defined. Ways of handling standard data operations are shown. Possible extensions of the API are discussed, as well as its limitations and shortcomings
{"title":"The Tanagra project - a simple MDBS API","authors":"O. Orel, K. Križanović, M. Baranović","doi":"10.1109/ITI.2004.241599","DOIUrl":"https://doi.org/10.1109/ITI.2004.241599","url":null,"abstract":"A multidatabase system (MDBS) is a software package that allows user transactions to invoke retrieval and update instructions against data located in autonomous heterogeneous hardware and software environments. Here, the Tanagra Project is presented, a large part of which is a simple MDBS API. This API is introduced, and the data model it uses is described. The layers of the API and the tasks and capabilities of each layer are defined. Ways of handling standard data operations are shown. Possible extensions of the API are discussed, as well as its limitations and shortcomings","PeriodicalId":320305,"journal":{"name":"26th International Conference on Information Technology Interfaces, 2004.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115617078","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}
V. Rabljenovic, Mario KlobuEar, Ivan MariC, Davorin Gabriel
The internal routing protocol in an autonomous system (AS) describes how the routers, devices of the third level of the OSI network model, establish mutual communication by sending notices on available network segments. The selection framework of IP routing protocols is determined by different parameters of theoretical and practical nature. A theoretical overview is given using the comparison of possibilities described in corresponding IETF RFC standards. Practical considerations relating to specifically determined conditions in a particular network, including the topology and interdependencies with other implemented technologies, additionally define the selection framework of a corresponding internal routing protocol. The selection of the internal protocol for the CARNet network (TCP/IP private WAN network), which was a component of the first stage in constructing the gigabit CARNet network, is dealt in this paper
{"title":"Internal routing protocol in gigabit CARNet network - selection and transition","authors":"V. Rabljenovic, Mario KlobuEar, Ivan MariC, Davorin Gabriel","doi":"10.1109/ITI.2004.242576","DOIUrl":"https://doi.org/10.1109/ITI.2004.242576","url":null,"abstract":"The internal routing protocol in an autonomous system (AS) describes how the routers, devices of the third level of the OSI network model, establish mutual communication by sending notices on available network segments. The selection framework of IP routing protocols is determined by different parameters of theoretical and practical nature. A theoretical overview is given using the comparison of possibilities described in corresponding IETF RFC standards. Practical considerations relating to specifically determined conditions in a particular network, including the topology and interdependencies with other implemented technologies, additionally define the selection framework of a corresponding internal routing protocol. The selection of the internal protocol for the CARNet network (TCP/IP private WAN network), which was a component of the first stage in constructing the gigabit CARNet network, is dealt in this paper","PeriodicalId":320305,"journal":{"name":"26th International Conference on Information Technology Interfaces, 2004.","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124410215","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
扫码关注我们
求助内容：
应助结果提醒方式：