Pub Date : 2003-06-16DOI: 10.1109/ITI.2003.1225398
Z. Zenzerović, S. Bešlić
We present a mathematical model addressing the problem of cargo transport by container ship on the selected route where a certain number of containers of various masses and types are chosen out of a total number of containers available in loading port in order to achieve maximum transport profitability, provided maximum payload and transport capacity of container ship. Since the profitability is an index of operation efficiency expressed as a fraction, a respective mathematical model can be solved using linear fractional programming. The model was tested on a real-life example of feeder ship "Lipa" owned by "Losinjska plovidba", Rijeka, operating on route Rijeka-Gioia Tauro.
{"title":"Optimization of cargo transport with a view to cost efficient operation of container ship","authors":"Z. Zenzerović, S. Bešlić","doi":"10.1109/ITI.2003.1225398","DOIUrl":"https://doi.org/10.1109/ITI.2003.1225398","url":null,"abstract":"We present a mathematical model addressing the problem of cargo transport by container ship on the selected route where a certain number of containers of various masses and types are chosen out of a total number of containers available in loading port in order to achieve maximum transport profitability, provided maximum payload and transport capacity of container ship. Since the profitability is an index of operation efficiency expressed as a fraction, a respective mathematical model can be solved using linear fractional programming. The model was tested on a real-life example of feeder ship \"Lipa\" owned by \"Losinjska plovidba\", Rijeka, operating on route Rijeka-Gioia Tauro.","PeriodicalId":266179,"journal":{"name":"Proceedings of the 25th International Conference on Information Technology Interfaces, 2003. ITI 2003.","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115163566","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}
Pub Date : 2003-06-16DOI: 10.1109/ITI.2003.1225368
Z. Franić
Rapid advances in Internet technologies and the subsequent proliferation of economic activity on the Internet have given rise to the Internet economy. To address the Internet economy, certain Web characterisation should be applied, describing the structure, size, usage and content of the Web. The complex elements of such metrics include number of domains, users, hosts and number of WWW pages within the particular top-level domain. Long-term systematic measurements of such data enable us to estimate "time lag" in Internet usage and Internet growth between respective countries, i.e. time needed for particular country to reach the number of hosts and WWW pages in other countries. Also, a correlation was found between country's GDP and number of hosts and WWW pages. This implies that Internet usage in a particular country is a reasonable proxy for factors that promote (or inhibit) the adoption of new technologies, which result in higher rates of economic output growth. Using data on hosts and WWW pages under top-level domain hr, in Internet usage in January 2003, Croatia was about 1 year behind CEFTA average and 2 to 4 years behind EU average.
{"title":"Some aspects of Internet metrics: case of Croatia","authors":"Z. Franić","doi":"10.1109/ITI.2003.1225368","DOIUrl":"https://doi.org/10.1109/ITI.2003.1225368","url":null,"abstract":"Rapid advances in Internet technologies and the subsequent proliferation of economic activity on the Internet have given rise to the Internet economy. To address the Internet economy, certain Web characterisation should be applied, describing the structure, size, usage and content of the Web. The complex elements of such metrics include number of domains, users, hosts and number of WWW pages within the particular top-level domain. Long-term systematic measurements of such data enable us to estimate \"time lag\" in Internet usage and Internet growth between respective countries, i.e. time needed for particular country to reach the number of hosts and WWW pages in other countries. Also, a correlation was found between country's GDP and number of hosts and WWW pages. This implies that Internet usage in a particular country is a reasonable proxy for factors that promote (or inhibit) the adoption of new technologies, which result in higher rates of economic output growth. Using data on hosts and WWW pages under top-level domain hr, in Internet usage in January 2003, Croatia was about 1 year behind CEFTA average and 2 to 4 years behind EU average.","PeriodicalId":266179,"journal":{"name":"Proceedings of the 25th International Conference on Information Technology Interfaces, 2003. ITI 2003.","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121369721","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}
Pub Date : 2003-06-16DOI: 10.1109/ITI.2003.1225369
Branka Mraović
The informational society is based on global networks and computer communications, creating a wide range of virtual communities, imposing a new type of logic: network logic. Information technologies are not mere technical facts, but primarily they are social catalysts; by penetrating into the core of life and mind, computer networks expand the manoeuvrable space available to human actors, providing us with a new form and meaning of the concept of human agency. What is revolutionary about this technology is that it provides a potential change of legitimacy in the sense of opening space for the individual to defy dominating coalitions of power and become an equal participant in the cyberspace discourse. Social audit becomes an important agent of social change, providing for the involvement of different actors in the realisation of these changes.
{"title":"The speed of mind in the informational society","authors":"Branka Mraović","doi":"10.1109/ITI.2003.1225369","DOIUrl":"https://doi.org/10.1109/ITI.2003.1225369","url":null,"abstract":"The informational society is based on global networks and computer communications, creating a wide range of virtual communities, imposing a new type of logic: network logic. Information technologies are not mere technical facts, but primarily they are social catalysts; by penetrating into the core of life and mind, computer networks expand the manoeuvrable space available to human actors, providing us with a new form and meaning of the concept of human agency. What is revolutionary about this technology is that it provides a potential change of legitimacy in the sense of opening space for the individual to defy dominating coalitions of power and become an equal participant in the cyberspace discourse. Social audit becomes an important agent of social change, providing for the involvement of different actors in the realisation of these changes.","PeriodicalId":266179,"journal":{"name":"Proceedings of the 25th International Conference on Information Technology Interfaces, 2003. ITI 2003.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123768051","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}
Pub Date : 2003-06-16DOI: 10.1109/ITI.2003.1225392
W. Legierski, R. Widawski
A construction of timetabling is considered to be a computationally hard problem. The problem lies not only in NP-completeness, but also in a number of complicated interactions between different users. We present a system of automated timetabling (SAT), as a proposition for a global look at timetabling. It describes four tools for managing timetable. The constraint programming (CP) techniques were used for solving the problem. CP provides both declarativity and flexibility. Moreover it allows easily add a new constraint and model numerous specific constraints that are often encountered in such problems. Additional local search was incorporated into CP to allow effectively optimise timetable.
{"title":"System of automated timetabling","authors":"W. Legierski, R. Widawski","doi":"10.1109/ITI.2003.1225392","DOIUrl":"https://doi.org/10.1109/ITI.2003.1225392","url":null,"abstract":"A construction of timetabling is considered to be a computationally hard problem. The problem lies not only in NP-completeness, but also in a number of complicated interactions between different users. We present a system of automated timetabling (SAT), as a proposition for a global look at timetabling. It describes four tools for managing timetable. The constraint programming (CP) techniques were used for solving the problem. CP provides both declarativity and flexibility. Moreover it allows easily add a new constraint and model numerous specific constraints that are often encountered in such problems. Additional local search was incorporated into CP to allow effectively optimise timetable.","PeriodicalId":266179,"journal":{"name":"Proceedings of the 25th International Conference on Information Technology Interfaces, 2003. ITI 2003.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122443274","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}
Pub Date : 2003-06-16DOI: 10.1109/ITI.2003.1225390
J. Knezović, M. Kovač
Natural, continuous tone images have the very important property of high correlation of adjacent pixels. This property is cleverly exploited in lossless image compression where, prior to the statistical modeling and entropy coding step, predictive coding is used as a decorrelation tool. The use of prediction for the current pixel also reduces the cost of the applied statistical model for entropy coding. Linear prediction, where the predicted value is a linear function of previously encoded pixels (causal template), has proven to give very good results as a decorrelation tool in lossless image compression. We concentrate on adaptive linear predictors used in lossless image coding and propose a new linear prediction method.
{"title":"Gradient based selective weighting of neighboring pixels for predictive lossless image coding","authors":"J. Knezović, M. Kovač","doi":"10.1109/ITI.2003.1225390","DOIUrl":"https://doi.org/10.1109/ITI.2003.1225390","url":null,"abstract":"Natural, continuous tone images have the very important property of high correlation of adjacent pixels. This property is cleverly exploited in lossless image compression where, prior to the statistical modeling and entropy coding step, predictive coding is used as a decorrelation tool. The use of prediction for the current pixel also reduces the cost of the applied statistical model for entropy coding. Linear prediction, where the predicted value is a linear function of previously encoded pixels (causal template), has proven to give very good results as a decorrelation tool in lossless image compression. We concentrate on adaptive linear predictors used in lossless image coding and propose a new linear prediction method.","PeriodicalId":266179,"journal":{"name":"Proceedings of the 25th International Conference on Information Technology Interfaces, 2003. ITI 2003.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122088472","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}
Pub Date : 2003-06-16DOI: 10.1109/ITI.2003.1225400
Simona Colucci, T. D. Noia, E. Sciascio, F. Donini, M. Mongiello
As more resources and services become available on the Web, there is a growing need for infrastructures that, based on advertised descriptions, semantically match in a peer-to-peer way providers with requesters of Web services. We address the problem of matchmaking of Web services from a knowledge representation perspective. Based on our approach we propose match categorization in terms of exact match, potential match (when request and offer though not identical are compatible) and partial match (when one or more inconsistency is present) and rank of matches within categories. Then we report on our implementation of the proposed matchmaking framework in a prototype system.
{"title":"Description logics approach to semantic matching of Web services","authors":"Simona Colucci, T. D. Noia, E. Sciascio, F. Donini, M. Mongiello","doi":"10.1109/ITI.2003.1225400","DOIUrl":"https://doi.org/10.1109/ITI.2003.1225400","url":null,"abstract":"As more resources and services become available on the Web, there is a growing need for infrastructures that, based on advertised descriptions, semantically match in a peer-to-peer way providers with requesters of Web services. We address the problem of matchmaking of Web services from a knowledge representation perspective. Based on our approach we propose match categorization in terms of exact match, potential match (when request and offer though not identical are compatible) and partial match (when one or more inconsistency is present) and rank of matches within categories. Then we report on our implementation of the proposed matchmaking framework in a prototype system.","PeriodicalId":266179,"journal":{"name":"Proceedings of the 25th International Conference on Information Technology Interfaces, 2003. ITI 2003.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128710424","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}
Pub Date : 2003-06-16DOI: 10.1109/ITI.2003.1225410
D. I. Vidović, V. Vukšić
In order to survive in highly competitive business environments, companies have to continuously change their business processes. It is apparent that developing dynamic models of business processes prior to their change could increase the success of reengineering projects. This research investigates a suitability of business process modelling tool ARIS for dynamic modelling of business processes. Information system modelling and simulation modelling are discussed from the business process change perspective. An example of business process modelling in Croatian insurance company is provided.
{"title":"Dynamic business process modelling using ARIS","authors":"D. I. Vidović, V. Vukšić","doi":"10.1109/ITI.2003.1225410","DOIUrl":"https://doi.org/10.1109/ITI.2003.1225410","url":null,"abstract":"In order to survive in highly competitive business environments, companies have to continuously change their business processes. It is apparent that developing dynamic models of business processes prior to their change could increase the success of reengineering projects. This research investigates a suitability of business process modelling tool ARIS for dynamic modelling of business processes. Information system modelling and simulation modelling are discussed from the business process change perspective. An example of business process modelling in Croatian insurance company is provided.","PeriodicalId":266179,"journal":{"name":"Proceedings of the 25th International Conference on Information Technology Interfaces, 2003. ITI 2003.","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123996296","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}
Pub Date : 2003-06-16DOI: 10.1109/ITI.2003.1225325
J. Šehanović, N. Tatković, M. Žugaj
The concept of "offices without paper" originated during the 1980s. The primary idea behind this notion was that the application of computers and computer networking would decrease the amount of paper used in office work. Today, this same concept is understood as the computerization of all office work. In a similar vein "universities without paper" represents the promotion and employment of information and communication technology (ICT) in the overall scheme of activities in post-secondary institutions. ICT influences all aspects of human life, which includes both education and post-secondary institutions. It makes it possible for any type of information to be accessible to anyone, a condition that necessitates changes in methods of learning, choice and presentation of curriculum, ways of learning, etc. The task of the teacher is for them to adapt their teaching to the changes brought about by ICT. The objective of this article is to illustrate some of the aspects of employing ICT in the process of post-secondary education, which leads to the creation of "universities without paper". Consequently, the article deals with the influence of ICT on the efficiency of post-secondary institutions in the Republic of Croatia (RC) from the aspect of the demands placed before them by the information society.
{"title":"University without paper","authors":"J. Šehanović, N. Tatković, M. Žugaj","doi":"10.1109/ITI.2003.1225325","DOIUrl":"https://doi.org/10.1109/ITI.2003.1225325","url":null,"abstract":"The concept of \"offices without paper\" originated during the 1980s. The primary idea behind this notion was that the application of computers and computer networking would decrease the amount of paper used in office work. Today, this same concept is understood as the computerization of all office work. In a similar vein \"universities without paper\" represents the promotion and employment of information and communication technology (ICT) in the overall scheme of activities in post-secondary institutions. ICT influences all aspects of human life, which includes both education and post-secondary institutions. It makes it possible for any type of information to be accessible to anyone, a condition that necessitates changes in methods of learning, choice and presentation of curriculum, ways of learning, etc. The task of the teacher is for them to adapt their teaching to the changes brought about by ICT. The objective of this article is to illustrate some of the aspects of employing ICT in the process of post-secondary education, which leads to the creation of \"universities without paper\". Consequently, the article deals with the influence of ICT on the efficiency of post-secondary institutions in the Republic of Croatia (RC) from the aspect of the demands placed before them by the information society.","PeriodicalId":266179,"journal":{"name":"Proceedings of the 25th International Conference on Information Technology Interfaces, 2003. ITI 2003.","volume":"451 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125781083","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}
Pub Date : 2003-06-16DOI: 10.1109/ITI.2003.1225419
B. Nagy
We present some Boolean programming (0-1 programming) problems and some truth-teller-liar puzzles (using only 'and' connectives). We translate the puzzles to Boolean programming problems. The constraints of our problems are equalities and inequalities; we write them to atomic form. Using these atomic restrictions we construct a graph-representation. When there are some nonlinear constraints, they are represented by so-called critical edges. We give some transformations of graphs. We show a graph-algorithm to get a/all solution(s) of the presented Boolean programming problems and puzzles, with examples. A version of the algorithm to get the optimal solution will also be given.
{"title":"Boolean programming, truth-teller-liar puzzles and related graphs","authors":"B. Nagy","doi":"10.1109/ITI.2003.1225419","DOIUrl":"https://doi.org/10.1109/ITI.2003.1225419","url":null,"abstract":"We present some Boolean programming (0-1 programming) problems and some truth-teller-liar puzzles (using only 'and' connectives). We translate the puzzles to Boolean programming problems. The constraints of our problems are equalities and inequalities; we write them to atomic form. Using these atomic restrictions we construct a graph-representation. When there are some nonlinear constraints, they are represented by so-called critical edges. We give some transformations of graphs. We show a graph-algorithm to get a/all solution(s) of the presented Boolean programming problems and puzzles, with examples. A version of the algorithm to get the optimal solution will also be given.","PeriodicalId":266179,"journal":{"name":"Proceedings of the 25th International Conference on Information Technology Interfaces, 2003. ITI 2003.","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131196195","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}
Pub Date : 2003-06-16DOI: 10.1109/ITI.2003.1225377
P. Rojanavasu, O. Pinngern
We propose a new method to create an intelligent Web search agent based on combining rough sets and fuzzy sets. Firstly, we create user profiles which is the important part to approximate query and document. We also design categories of user interests by grouping key terms. We update and create new categories automatically from user feedback. Secondly, we use combined rough and fuzzy sets to refine each query. Each query and document has two parts: a set of core queries and a set of possibly queries. Then we submit a set of queries to WWW search engines. Thirdly, a rough fuzzy set is used to represent each result from WWW search engines. Lastly, we compute a degree of similarity between query and documents for ranking purpose. Using these techniques, we can improve the precision level of the result from WWW search engines that are suitable for individual usage.
{"title":"Extended rough fuzzy sets for Web search agent","authors":"P. Rojanavasu, O. Pinngern","doi":"10.1109/ITI.2003.1225377","DOIUrl":"https://doi.org/10.1109/ITI.2003.1225377","url":null,"abstract":"We propose a new method to create an intelligent Web search agent based on combining rough sets and fuzzy sets. Firstly, we create user profiles which is the important part to approximate query and document. We also design categories of user interests by grouping key terms. We update and create new categories automatically from user feedback. Secondly, we use combined rough and fuzzy sets to refine each query. Each query and document has two parts: a set of core queries and a set of possibly queries. Then we submit a set of queries to WWW search engines. Thirdly, a rough fuzzy set is used to represent each result from WWW search engines. Lastly, we compute a degree of similarity between query and documents for ranking purpose. Using these techniques, we can improve the precision level of the result from WWW search engines that are suitable for individual usage.","PeriodicalId":266179,"journal":{"name":"Proceedings of the 25th International Conference on Information Technology Interfaces, 2003. ITI 2003.","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115678939","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
扫码关注我们
求助内容：
应助结果提醒方式：