C. Torres, J. D. León-Morales, D. Traore, A. Glumineau, R. Boisliveau
{"title":"Teleoperation of an experimental platform of electrical machines through the Internet","authors":"C. Torres, J. D. León-Morales, D. Traore, A. Glumineau, R. Boisliveau","doi":"10.1109/ICDIM.2007.4444319","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444319","url":null,"abstract":"Although access to remote equipment through the Internet is becoming an actively investigated topic, most current implementation are dedicated to specific application environments, for example, remote laboratory. A Remote laboratory offers a cost-effective and flexible means for students to shared access to physical experiments. This paper presents the implementation of a experimental platform of induction motor though the Internet account the following important features: Easy implementation based in Software, webCam for images and video capture, online Help based on IP telephony, computes to distribute the task. The developed scheme is versatile and robust, allowing the different control and observer actions remotely through the Internet.","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":"129910884","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":"A semantics-based substitution for unsupported Z39.50 Bib-1 access points","authors":"Michalis Sfakakis, S. Kapidakis","doi":"10.1109/ICDIM.2007.4444222","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444222","url":null,"abstract":"Unsupported Z39.50 access points result to query failures and/or inconsistent answers, in spite of the protocol specification for a unified global access mechanism. A challenge to this issue is to substitute an unsupported access point with others, so that the most similar semantics to the original access point can be obtained. In this paper, we describe the Bib-1 access points semantics of the Z39.50 protocol using the RDF Schema language, based on the official semantics specification of the Z39.50 Bib-1 attribute set. Moreover, we suggest two algorithms for the substitution of unsupported access point exploiting semantics information from the RDFS graph. The algorithms produce the set of access points, the proper combination of which produces semantics similar to the original access point. Then, we optimize the resulting set of access points by producing the minimal set of them with the closest semantics to the original one. Finally, we present an implementation where Z39.50 searches could be done using our access point substitution algorithms.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"35 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":"126929525","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":"Exploration of multiple roots for a polynomial system","authors":"C. Grosan, A. Abraham","doi":"10.1109/ICDIM.2007.4444213","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444213","url":null,"abstract":"Several problems from engineering, chemistry, medicine, etc. can be formulated as a system of equations. Finding a solution for such a system sometimes requires high computational efforts. There are situations when these systems have multiple solutions. For such problems, the task is to find as many solutions as possible. In this paper, we deal with such systems of equations, which have multiple solutions and we attempt to solve them using two different approaches. Both approaches transform the problem into an optimization problem. The two approaches proposed in are (1) a modified line search and (2) an evolutionary algorithm. Several experiments are performed in order to emphasize the advantages and disadvantages of the two methods.","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":"129256251","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":"Adapting technologies to model contexts: Two approaches through RFID & NFC","authors":"J. Bravo, R. Hervás, G. Chavira, S. W. Nava","doi":"10.1109/ICDIM.2007.4444303","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444303","url":null,"abstract":"The adaptability of sensorial capabilities is crucial for the performing of daily activities in intelligent environments. There are a number of features that have to be considered, however, in order to avoid constraints of certain technologies. In this work we analyze model and interaction changes using Radiofrequency Identification (RFID) and Near Field Communication (NFC) technologies. When these kinds of technologies are adapted in an attempt to put proactive systems into practice, context-aware applications can suffer some changes; the interaction involved also undergoes changes.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"388 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":"114126045","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":"Predicting durability in DHTs using Markov chains","authors":"Fabio Picconi, B. Baynat, Pierre Sens","doi":"10.1109/ICDIM.2007.4444278","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444278","url":null,"abstract":"We consider the problem of data durability in low-bandwidth large-scale distributed storage systems. Given the limited bandwidth between replicas, these systems suffer from long repair times after a hard disk crash, making them vulnerable to data loss when several replicas fail within a short period of time. Recent work has suggested that the probability of data loss can be predicted by modeling the number of live replicas using a Markov chain. This, in turn, can then be used to determine the number of replicas necessary to keep the loss probability under a given desired value. Previous authors have suggested that the model parameters can be estimated using an expression that is constant or linear on the number of replicas. Our simulations, however, show that neither is correct, as these parameter values grow sublinearly with the number of replicas. Moreover, we show that using a linear expression will result in the probability of data loss being underestimated, while the constant expression will produce a significant overestimation. Finally, we provide an empirical expression that yields a good approximation of the sublinear parameter values. Our work can be viewed as a first step towards finding more accurate models to predict the durability of this type of systems.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"22 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":"121746305","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}
C. Almeida, R. Souza, C. Rodrigues, N. L. C. Junior
{"title":"Image retrieval using the curvature scale space (CSS) technique and the self-organizing map (SOM) model under rotation","authors":"C. Almeida, R. Souza, C. Rodrigues, N. L. C. Junior","doi":"10.1109/ICDIM.2007.4444249","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444249","url":null,"abstract":"In a previous work (de Almeida), we presented an approach for shape-based image retrieval using the curvature scale space (CSS) and self-organizing map (SOM) methods. Here, we examine the robustness of the representation with images under variations of rotation. Moreover, the CSS images extracted from a database are processed and represented by median vectors that constitutes the training data set for a SOM neural network. This way of representation improves the accuracy of image retrieval in comparison with the previous work (de Almeida) that used the first principal component of the PCA technique. A benchmark database is used to demonstrate the usefulness of the proposed methodology.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"9 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":"115275970","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 XML environment for multistructured textual documents","authors":"Emmanuel Bruno, Elisabeth Murisasco","doi":"10.1109/ICDIM.2007.4444228","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444228","url":null,"abstract":"XML is the de facto standard to describe structured data. Several applications in the context of information systems are based on its use: electronic publishing, technical documentation, digital libraries, web, etc. An XML document is mainly hierarchical. But, in some applications, several concurrent hierarchical structures could be associated to the same textual data. This paper presents an XML environment dedicated to the representation and the querying of such documents that we call multistructured textual documents. Our work aims at proposing a method for a compact representation of multiple trees over a single text based on segmentation. Segmentation encoding allows querying overlap/containment relations of markups belonging to different structures. This paper particularly focuses on the architecture of the XML environment implementing our proposals.","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":"115839867","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":"Practical and robust self-keying scheme for personal area networks","authors":"Jihoon Cho","doi":"10.1109/ICDIM.2007.4444271","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444271","url":null,"abstract":"Providing key pre-distribution in personal area networks (PANs) remains a challenging problem, in particular because of the unique characteristics of and constraints on, such networks. Several key pre-distribution schemes have been proposed for use in PANs. but these schemes only support key management within a PAN. In a ubiquitous environment, however, users with multiple personal wireless devices are likely to form mobile ad hoc networks, requiring key management between PANs. Moreover, PANs cannot rely on the universal accessibility of an online TTP, and PAN users are unlikely to delegate security operations to an external trusted party for privacy reasons. We thus propose a provably secure self-organising key pre-distribution scheme for use both within and between PANs.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"48 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":"124600740","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}
Nicolas Bussiere, Daniel Cheung-Foo-Wo, Vincent Hourdin, S. Lavirotte, M. Riveill, J. Tigli
{"title":"Optimized contextual discovery of Web Services for Devices","authors":"Nicolas Bussiere, Daniel Cheung-Foo-Wo, Vincent Hourdin, S. Lavirotte, M. Riveill, J. Tigli","doi":"10.1109/ICDIM.2007.4444307","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444307","url":null,"abstract":"Due to more and more mobile computers moving among smart and communicating devices in our everyday life, we observe the emergence of new constraints in software design. Indeed, device heterogeneity, dynamic software variation, and frequent mobile device apparition/disappearance make software applications compulsorily adapt to their context. In this paper, we will present an enhancement of ambient computing discovery mechanisms adding context handling capabilities to Web Services for Devices. As a matter of fact, we define contextual parameters for broadcasted requests so that only devices in the „selected context” reply, which aim at reducing the overall number of exchanged messages on the network.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"21 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":"126550739","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}
Manabu Ohta, Shun Yamasaki, Takayuki Yakushi, A. Takasu
{"title":"Authors’ names extraction from scanned documents","authors":"Manabu Ohta, Shun Yamasaki, Takayuki Yakushi, A. Takasu","doi":"10.1109/ICDIM.2007.4444202","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444202","url":null,"abstract":"Authors' names are a critical bibliographic element when searching or browsing academic articles stored in digital libraries. However, extracting such bibliographic data from printed documents requires human intervention; it is therefore not cost-effective, even using various document image-processing techniques such as optical character recognition (OCR). In this paper, we describe an automatic authors' names extraction method for academic articles scanned with OCR mark-up. The proposed method first extracts authors' blocks, which include assumed author/delimiter characters based on layout analysis, and then uses a specifically designed hidden Markov model (HMM) for labeling the unsegmented character strings in the block as those of either an author or a delimiter. We applied the proposed method to Japanese academic articles. Results of these experiments showed that the proposed method correctly extracted more than 99%, of authors' blocks with manual tuning; the proposed HMM correctly labeled more than 95% of the author name strings.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"57 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":"132554857","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}