{"title":"Equivalence detection using parse-tree normalization for math search","authors":"M. Shatnawi, Abdou Youssef","doi":"10.1109/ICDIM.2007.4444297","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444297","url":null,"abstract":"In recent years, efforts have begun to put math contents on the Web. As for other types of Web information, search capabilities should be provided to enable users to find what they need because without the ability to search the data for specific items, the data is useless. Conventional (i.e. textbased or even multimedia-based) search engines fall short of providing math-search capabilities. Preliminary efforts to create math-search systems have started, and many of the issues and the challenges for building such systems have been identified. One of the more difficult challenges is the detection of mathematical equivalence between expression in users’ queries and expressions in math contents. The purpose of this research is to develop techniques and algorithm for equivalence-detection based math search. In particular, this research aims to explore some proposed normalization rules, then to develop a general way that can be utilized to transform both the repository contents and users’ input expressions into a unified normalized form.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115746845","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}
{"title":"Design of MMS (Mobile Mapping Systems) applicable to LBS (Local Based Services)","authors":"Jin-Suk Kang, Yonghee You, M. Sung","doi":"10.1109/ICDIM.2007.4444270","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444270","url":null,"abstract":"The mobile mapping system using the vehicle equipped the GPS, IMU, CCD Camera is the effective system for the management of the road facilities, update of the digital map, and etc. If the geographic information which is acquired by the mobile mapping system can be transmitted in real-time, users can process what they want using latest data. We have developed a prototype image recognition system capable of identifying landmark (typically, city buildings and structures) from photographs captured on camera phones. The image recognition process runs server-side, as a Web service accessible over GPRS from a Web enabled phone or PDA. Photographs of landmarks are preloaded into a central database, which is then queried by users submitting images from their camera phones. The image recognition algorithm is robust to variations in both illumination and point of view. In this paper, the effective method was suggested for the transmission of the geographic information acquired by camera attached to a PDA such as position data, altitude data, and image data in the wireless Internet environment in real-time.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130977296","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}
{"title":"Transaction clustering of web log data files using genetic algorithm","authors":"P. Pichappan","doi":"10.1109/ICDIM.2007.4444300","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444300","url":null,"abstract":"Increasingly web applications found to impact on numerous environments. The web log data offer more promises and particularly application of the genetic algorithms is significant as it represents the relations between different data components. We have used simple genetic algorithms to log files and we found that the preliminary results are more promising there by open more avenues for future research.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"87 19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128377210","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}
{"title":"Plan recognition in smart environments","authors":"Niels Snoeck, H. V. Kranenburg, H. Eertink","doi":"10.1109/ICDIM.2007.4444308","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444308","url":null,"abstract":"This position paper describes our approach to recognizing tasks of mobile users in a smart environment. Such high-level interpretation of behavior enables context-aware applications to adapt to the users’ needs and intentions. In the AI community, plan recognition techniques have proven their applicability in recognizing the tasks of software agents in a controlled environment. However, these approaches fall short in recognizing tasks of people in a real-world environment. Therefore, we propose several extensions to plan recognition techniques by using constraints and hybrid reasoning algorithms. In addition, we propose to improve the plan recognition process with multi-step processing of context information. We also discuss how our approach leverages some of the difficulties of plan recognition in smart environments.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116979428","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}
{"title":"Using organizational memory and forum in an organizational learning context","authors":"A. Leblanc, Marie-Hélène Abel","doi":"10.1109/ICDIM.2007.4444234","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444234","url":null,"abstract":"Information and communication technologies have transformed the way people work and have a growing impact on long life learning. Organizational learning is an increasingly important area of research that concerns the way organizations learn and thus augment their competitive advantage, innovativeness, and effectiveness. Within the project MEMORAe2.0, we are interested by the capitalization of knowledge in the context of an organization and by organizational learning. We developed the E-MEMORAe2.0 environment which is based on the concept of learning organizational memory. In this paper, we present the organizational learning approach; we stress the role of an organizational memory in this approach; and we specify the use of a forum concept in such a context. Then we present the approach MEMORAe and the environment we developed.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114590575","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}
Matthias Fabriek, S. Brinkkemper, Jeroen van Dullemen
{"title":"A method for application portfolio rationalization","authors":"Matthias Fabriek, S. Brinkkemper, Jeroen van Dullemen","doi":"10.1109/ICDIM.2007.4444267","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444267","url":null,"abstract":"Application portfolio rationalization (APR) aims to analyze and restructure the complete set of applications in an organization. This paper presents a new APR method that assimilates various research results and empirical experiences. It explains that APR does not automatically return on investment: it is important to use the right method in order to get benefits. APR consists of three main steps: the assessment phase, where information on the applications and the portfolio is gathered, the evaluation phase, where the information is analyzed, and the planning phase, where all actions are planned that improve the portfolio and reduce complexity. A real life case of a financial services company shows the method in practice.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115507522","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}
{"title":"Dominium: an approach to regulate agents societies in dynamic environments","authors":"Pier-Giovanni Taranti, R. Choren","doi":"10.1109/ICDIM.2007.4444324","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444324","url":null,"abstract":"The cooperation between agents for accomplish their goals is a major issue in MAS but, due the agents autonomy, they can made the “no cooperate” option, in opposing to the global goals of the system. This paper presents the Dominium, an approach for regulated systems that can tame the agents and that offer support to dynamic geo-referenced environments.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124487334","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}
{"title":"An approach to distributed model selection for multimedia content-based indexing in a decentralized context","authors":"Afshin Nikseresht, Marc Gelgon","doi":"10.1109/ICDIM.2007.4444254","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444254","url":null,"abstract":"A major need of multimedia indexing and retrieval on a P2P network is related to characterisation of classes. Currently, many multimedia retrieval systems have been proposed and developed but these systems are not designed to be distributed across different computers on a network. We focus on the case that many retrieval systems exist on the network where all densities are Gaussian mixtures due to its numerous good properties. In this paper, we have proposed an algorithm which uses a combination of cross validation and merging to find the best model among many models which exist on the network for a unique class .","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126358076","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}
{"title":"Vector model improvement using suffix trees","authors":"J. Martinovič, T. Novosad, V. Snás̃el","doi":"10.5019/J.IJCIR.2009.168","DOIUrl":"https://doi.org/10.5019/J.IJCIR.2009.168","url":null,"abstract":"There are many ways how to search for documents in document collections. These methods take advantage of Boolean, vector, probabilistic and other models for representation of documents, queries, rules and procedures which can determine correspondence between user requests and documents. Each of these models have several restrictions. These restrictions do not allow a user to find all relevant documents. There are many irrelevant documents among returned ones by the system and some relevant documents missing at all. In the article there is a new method suggested which uses suffix trees for the vector query improvement. This method treats with documents as a, set of phrases (sentences) not just as a set of words. The sentence has a specific, semantic meaning (words in the sentence are ordered). This is advantage in comparison with the treated document just like with, a bag of words.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126879243","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}
{"title":"Source code management system for E-learning based programming education","authors":"Jeong-Hoon Ji, Su-Hyun Park, G. Woo, Hwan-Gue Cho","doi":"10.1109/ICDIM.2007.4444250","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444250","url":null,"abstract":"Content based data retrieval technology is well-known in the information retrieval area. It assumes that the subject data is unstructured, but sometimes this data can be structured. This is true for computer programs. In this paper, we have proposed a canonical form of program source codes, which explicitly reveal the program structure explicitly As an application of the canonical form, the program similarity can be computed with an additional technique named local alignment, which has previously been proposed in computational biology. We have implemented a source code management system based on this method as a subsystem of the E-learning system called ESPA, supporting the evaluation of programs submitted in programming courses. We have compared the effectiveness of our method with JPlag, one of the most stable tool plagiarism detection tools currently being used.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116115841","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}