In this paper, a new method of selection of individuals for crossover is presented and tested. Its main idea is that one of the selected individuals is always a member of an "elite" group, consisting of n best individuals currently in the population. This method does not slow down the execution of the algorithm and shows a marked improvement in search results
{"title":"Using a set of elite individuals in a genetic algorithm","authors":"Mala SvurEu, M. Golub","doi":"10.1109/ITI.2004.242362","DOIUrl":"https://doi.org/10.1109/ITI.2004.242362","url":null,"abstract":"In this paper, a new method of selection of individuals for crossover is presented and tested. Its main idea is that one of the selected individuals is always a member of an \"elite\" group, consisting of n best individuals currently in the population. This method does not slow down the execution of the algorithm and shows a marked improvement in search results","PeriodicalId":320305,"journal":{"name":"26th International Conference on Information Technology Interfaces, 2004.","volume":"12 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":"121940097","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}
Compiler construction is a difficult task. Therefore more suitable solutions than the existent ones are needed. In this paper a framework (domain-specific visual language) for visual language design is presented. The framework automatically generates the compiler/interpreter by using visual notation. The main advantage of this approach is the use of a more appropriate visual notation and abstractions in comparison to classical textual notation of formal language specifications for compiler generators. Special attention is paid to better flexibility and reusability of the predefined semantic constructs
{"title":"Visual language framework for LISA","authors":"T. Kosar, D. Rebernak, M. Mernik, V. Zumer","doi":"10.1109/ITI.2004.241974","DOIUrl":"https://doi.org/10.1109/ITI.2004.241974","url":null,"abstract":"Compiler construction is a difficult task. Therefore more suitable solutions than the existent ones are needed. In this paper a framework (domain-specific visual language) for visual language design is presented. The framework automatically generates the compiler/interpreter by using visual notation. The main advantage of this approach is the use of a more appropriate visual notation and abstractions in comparison to classical textual notation of formal language specifications for compiler generators. Special attention is paid to better flexibility and reusability of the predefined semantic constructs","PeriodicalId":320305,"journal":{"name":"26th International Conference on Information Technology Interfaces, 2004.","volume":"65 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":"114966388","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}
If the businesses are to be successful in the electronic commerce arena, it is their imperative to identify and disseminate critical factors necessary for the success. The research presented here reports on the success factors of electronic commerce encountered among the top 500 Australian publicly listed companies. The response rate from survey was 22%. The majority of companies encountered a number of common success factors, including: effective project leader, having secure transactions, adequate resources, the use of new technology, etc. However, the analysis has also shown that the CSF are dependant on the type of industry
{"title":"CSF of e-commerce in large corporations","authors":"J. Kuzic, M. Kuzic","doi":"10.1109/ITI.2004.242176","DOIUrl":"https://doi.org/10.1109/ITI.2004.242176","url":null,"abstract":"If the businesses are to be successful in the electronic commerce arena, it is their imperative to identify and disseminate critical factors necessary for the success. The research presented here reports on the success factors of electronic commerce encountered among the top 500 Australian publicly listed companies. The response rate from survey was 22%. The majority of companies encountered a number of common success factors, including: effective project leader, having secure transactions, adequate resources, the use of new technology, etc. However, the analysis has also shown that the CSF are dependant on the type of industry","PeriodicalId":320305,"journal":{"name":"26th International Conference on Information Technology Interfaces, 2004.","volume":"12 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":"121470715","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 motivation for this research stemmed from a desire to create visual aids to help researchers/managers interpret ensembles of decision tree outputs generated by various algorithms. The method employed a simulation experiment (using only bagging) followed by application of the new visualization tools on actual survey data. Simulated data, with a prespecified structure, were "bagged" with the results presented using five graphical tools that recreated (and/or portrayed) the known data structures captured by the bagging algorithm. Then the same methodology was generalized to a structurally unknown, virgin (survey) data set. Results of the research are that five visual aids tools were examined (two of which are new approaches) and found to be useful for making action oriented interpretations from e.g., Web-survey data
{"title":"\"BOF\" trees diagram as a visual way to improve interpretability of tree ensembles","authors":"V. Luzar-Stiffler, C. Stiffler","doi":"10.2498/cit.2004.02.06","DOIUrl":"https://doi.org/10.2498/cit.2004.02.06","url":null,"abstract":"The motivation for this research stemmed from a desire to create visual aids to help researchers/managers interpret ensembles of decision tree outputs generated by various algorithms. The method employed a simulation experiment (using only bagging) followed by application of the new visualization tools on actual survey data. Simulated data, with a prespecified structure, were \"bagged\" with the results presented using five graphical tools that recreated (and/or portrayed) the known data structures captured by the bagging algorithm. Then the same methodology was generalized to a structurally unknown, virgin (survey) data set. Results of the research are that five visual aids tools were examined (two of which are new approaches) and found to be useful for making action oriented interpretations from e.g., Web-survey data","PeriodicalId":320305,"journal":{"name":"26th International Conference on Information Technology Interfaces, 2004.","volume":"16 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":"114324856","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 graphical object query language (GOQL) is a query language that complies with the ODMG standard and which runs on top of the O2 DBMS. The GOQL user interface comprises the user's view (UV) and the folders window (FW). The UV is a graphical representation of an ODMG database scheme, which hides from end-users most of the perplexing details of the object-oriented database model. The FW is a condensed version of the UV that serves as canvas upon which ad-hoc queries are constructed. The paper addresses principles behind the design of user interfaces and discusses features and characteristics of the GOQL user interface
{"title":"Design considerations of the GOQL interface","authors":"E. Keramopoulos, P. Pouyioutas, T. Ptohos","doi":"10.1109/ITI.2004.241877","DOIUrl":"https://doi.org/10.1109/ITI.2004.241877","url":null,"abstract":"The graphical object query language (GOQL) is a query language that complies with the ODMG standard and which runs on top of the O2 DBMS. The GOQL user interface comprises the user's view (UV) and the folders window (FW). The UV is a graphical representation of an ODMG database scheme, which hides from end-users most of the perplexing details of the object-oriented database model. The FW is a condensed version of the UV that serves as canvas upon which ad-hoc queries are constructed. The paper addresses principles behind the design of user interfaces and discusses features and characteristics of the GOQL user interface","PeriodicalId":320305,"journal":{"name":"26th International Conference on Information Technology Interfaces, 2004.","volume":"33 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":"130084475","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 deal with the problem of the increasing cost of IT systems in the public administration. This is contrary to what politicians are expecting when they want cheap state administration. Several objective and subjective causes are enumerated with the intention of calling attention of the parties concerned on correct planning of the budget
{"title":"Cheap state - expensive IT?","authors":"I. Futó","doi":"10.1109/ITI.2004.242951","DOIUrl":"https://doi.org/10.1109/ITI.2004.242951","url":null,"abstract":"We deal with the problem of the increasing cost of IT systems in the public administration. This is contrary to what politicians are expecting when they want cheap state administration. Several objective and subjective causes are enumerated with the intention of calling attention of the parties concerned on correct planning of the budget","PeriodicalId":320305,"journal":{"name":"26th International Conference on Information Technology Interfaces, 2004.","volume":"56 22","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132063446","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, we present a new clustering method which makes incremental the construction of an unsupervised neural model (self organizing map: SOM). In other words, the method is computed with both, the initial model based on the a priori available data and the data which arrive dynamically in the time. This approach is validated over Web navigation data and it is compared to classical neural clustering applied to the same data
{"title":"An incremental SOM for Web navigation patterns clustering","authors":"K. Benabdeslem, Younès Bennani","doi":"10.1109/ITI.2004.241604","DOIUrl":"https://doi.org/10.1109/ITI.2004.241604","url":null,"abstract":"In this paper, we present a new clustering method which makes incremental the construction of an unsupervised neural model (self organizing map: SOM). In other words, the method is computed with both, the initial model based on the a priori available data and the data which arrive dynamically in the time. This approach is validated over Web navigation data and it is compared to classical neural clustering applied to the same data","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":"128209665","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 introduce a Bayesian point source model which may be useful for modelling spatial data. It may provide a simple explanatory model for some data, whilst in other cases it may give a parsimonious representation. The model assumes that there are point sources (or sinks), usually at unknown positions, and that the mean value at a site depends on the distance from these sources. We discuss the general form of the model, and the MCMC approach for estimating model parameters. We demonstrate the methodology applying the model to a real data set
{"title":"Heteroscedastic Bayesian point source model for spatial data","authors":"C. Mauro, G. Mariagrazia, I. Luigi","doi":"10.1109/ITI.2004.241606","DOIUrl":"https://doi.org/10.1109/ITI.2004.241606","url":null,"abstract":"We introduce a Bayesian point source model which may be useful for modelling spatial data. It may provide a simple explanatory model for some data, whilst in other cases it may give a parsimonious representation. The model assumes that there are point sources (or sinks), usually at unknown positions, and that the mean value at a site depends on the distance from these sources. We discuss the general form of the model, and the MCMC approach for estimating model parameters. We demonstrate the methodology applying the model to a real data set","PeriodicalId":320305,"journal":{"name":"26th International Conference on Information Technology Interfaces, 2004.","volume":"1 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":"123096449","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}
Locking schemes for an advanced database management system such as object-oriented database system are complex and difficult to implement. Many interesting locking schemes are investigated and examined in depth in this paper. The two phase multigranularity locking protocol proposed by Won Kin (1992) and many improved locking schemes proposed by other researchers to manage simple object, composite objects and dynamic methods invocation involve a large variety of lock modes and utilises a fairly complex algorithms. This paper examines these locking schemes and look at their working mechanisms in the first part of the paper. This research introduces an object-based two-phased locking protocol (OB-2PLP) for a transaction management system in the Extolware Persistence Framework. The locking schemes designed and implemented in the research are applied to simple objects, objects in an inheritance hierarchy, complex objects, collection of objects and relationships among objects. A discussion comparing the proposed locking scheme with several other locking schemes is presented
{"title":"Object-based two-phased locking protocol in extolware persistence framework","authors":"T. Lim, S.P. Lee","doi":"10.1109/ITI.2004.241504","DOIUrl":"https://doi.org/10.1109/ITI.2004.241504","url":null,"abstract":"Locking schemes for an advanced database management system such as object-oriented database system are complex and difficult to implement. Many interesting locking schemes are investigated and examined in depth in this paper. The two phase multigranularity locking protocol proposed by Won Kin (1992) and many improved locking schemes proposed by other researchers to manage simple object, composite objects and dynamic methods invocation involve a large variety of lock modes and utilises a fairly complex algorithms. This paper examines these locking schemes and look at their working mechanisms in the first part of the paper. This research introduces an object-based two-phased locking protocol (OB-2PLP) for a transaction management system in the Extolware Persistence Framework. The locking schemes designed and implemented in the research are applied to simple objects, objects in an inheritance hierarchy, complex objects, collection of objects and relationships among objects. A discussion comparing the proposed locking scheme with several other locking schemes is presented","PeriodicalId":320305,"journal":{"name":"26th International Conference on Information Technology Interfaces, 2004.","volume":"28 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":"133845095","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 high level of diversity, timing variability and renewability characterizes today's heterogeneous computing environment. In addition to static-dynamic mapping and prediction, the remapping procedure can significantly improve system performance. Causes of remapping, as well as adjustment of threshold, period, horizon and shift determine remapping. Sporadic servers and especially multiple sporadic servers represent a natural mechanism of remapping. They enable a fair and more effective usage of environment resources. Experimental evaluation shows a significant improvement of application execution and system autonomy
{"title":"Remapping in heterogeneous computing","authors":"G. Martinović, L. Budin, Ž. Hocenski","doi":"10.1109/ITI.2004.242574","DOIUrl":"https://doi.org/10.1109/ITI.2004.242574","url":null,"abstract":"A high level of diversity, timing variability and renewability characterizes today's heterogeneous computing environment. In addition to static-dynamic mapping and prediction, the remapping procedure can significantly improve system performance. Causes of remapping, as well as adjustment of threshold, period, horizon and shift determine remapping. Sporadic servers and especially multiple sporadic servers represent a natural mechanism of remapping. They enable a fair and more effective usage of environment resources. Experimental evaluation shows a significant improvement of application execution and system autonomy","PeriodicalId":320305,"journal":{"name":"26th International Conference on Information Technology Interfaces, 2004.","volume":"20 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":"114656415","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
扫码关注我们
求助内容：
应助结果提醒方式：