30494509
Translating unknown cross-lingual queries in digital libraries using a web-based approach
10320126
Resolving the unencoded character problem for chinese digital libraries
Constructing a Chinese digital library, especially for historical article archiving, is often hindered by the small character sets supported by current computer systems. This paper is aimed at resolving the unencoded character problem with a practical and composite approach for Chinese digital libraries. The proposed approach consists of the glyph expression model, glyph structure database, and supporting tools. With this approach, the following problems can be resolved. First, the extensibility of Chinese characters can be preserved. Second, it would be as easy to generate, input, display, and search unencoded characters as existing ones. Third, it is compatible with existing encoding schemes that most computers use. This approach has been utilized by organizations and projects in various application domains including archeology, linguistics, ancient texts, calligraphy and paintings, and stone and bronze rubbings. For example, in Academia Sinica, a very large full-text database of ancient texts called Scripta Sinica has been created using this approach. The Union Catalog of National Digital Archives Project (NDAP) dealt with the unencoded characters encountered when merging the metadata of 12 different thematic domains from various organizations. Also, in Bronze Inscriptions Research Team (BIRT) of Academia Sinica, 3,459 bronze inscriptions were added, which is very helpful to the education and research in historic linguistics
44717149
Peer-to-Peer Support for File Transfer and Caching Mechanism
In existing Internet file transfer mechanism, proxy servers play a major role in load balancing and reducing duplicate file access requests for services like FTP and WWW. However, proxy servers are usually unaware of the availability of cached contents on other peer proxy servers. This is a waste of time since duplicate requests are needed. Unnecessary traffic can be reduced if cooperation and coordination among peer proxies can be utilized. In this paper, peer-to-peer support was incorporated in ordinary file transfer and caching mechanism to reduce unnecessary processing time and storage. Through the location service, hosts requesting file services can dynamically determine if a copy is available and its current location. Work load for file servers will be greatly reduced, and personalization of file transfer configuration can be fully supported.
14678674
Enhanced intranet management in a DHCP-enabled environment
The DHCP (dynamic host configuration protocol) is widely deployed in resource allocation and intranet management. However the DHCP mechanism is not mandatory and the DHCP server can neither force DHCP clients to release their leases, nor enforce cooperation from externally configured hosts that are DHCP-unaware. Although new DHCP options such as DHCP reconfigure extension have been proposed, the basic problems inherent in DHCP mechanism cannot be solved without first strengthening its operations. In the paper a DHCP-based infrastructure for intranet management is proposed by combining the resource allocation functions of the DHCP server with the packet filtering features of MAC (Medium Access Control) bridges such as Ethernet switches and wireless access points. DHCP clients and DHCP-unaware hosts that do not abide by the DHCP mechanism or our management policy will be denied network accesses by MAC bridges. Resource allocation and access control can be integrated and local configuration conflicts can be reduced to the minimum.
40595039
Constructing a Wrapper-Based DRM System for Digital Content Protection in Digital Libraries
Conventional digital libraries utilize access control and digital watermarking techniques to protect their digital content. These methods, however, have drawbacks. First, after passing the identity authentication process, authorized users can easily redistribute the digital assets. Second, it is impractical to expect a digital watermarking scheme to prevent all kinds of attack. Thus, how to enforce property rights after digital content has been released to authorized users is a crucial and challenging issue. In this paper, we propose a wrapper-based approach to digital content protection that integrates digital watermarking, cryptography, information protection technology, and a rights model. In this rights enforcement environment, the behavior of all content players is monitored and digital content can only be accessed after certain usage rules have been satisfied. Furthermore, the proposed architecture can be easily integrated into any digital content player, or even existing DRM systems in digital libraries. With the protection of the proposed DRM system, the abuse of digital content can be drastically reduced.
94229
Translating unknown queries with web corpora for cross-language information retrieval
It is crucial for cross-language information retrieval (CLIR) systems to deal with the translation of unknown queries due to that real queries might be short. The purpose of this paper is to investigate the feasibility of exploiting the Web as the corpus source to translate unknown queries for CLIR. We propose an online translation approach to determine effective translations for unknown query terms via mining of bilingual search-result pages obtained from Web search engines. This approach can alleviate the problem of the lack of large bilingual corpora, translate many unknown query terms, provide flexible query specifications, and extract semantically-close translations to benefit CLIR tasks -- especially for cross-language Web search.
8736539
A hole-filling strategy for reconstruction of smooth surfaces in range images
Creating models of real scenes is a complex task for which the use of traditional modelling techniques is inappropriate. For this task, laser rangefinders are frequently used to sample the scene from several viewpoints, with the resulting range images integrated into a final model. In practice, due to surface reflectance properties, occlusions and accessibility limitations, certain areas of the scenes are usually not sampled, leading to holes and introducing undesirable artifacts in the resulting models. We present an algorithm for filling holes on surfaces reconstructed from point clouds. The algorithm is based on moving least squares and can recover both geometry and shading information, providing a good alternative when the properties to be reconstructed are locally smooth. The reconstruction process is mostly automatic and the sampling rate in the reconstructed areas follows the given samples. We demonstrate the use of the algorithm on both real and synthetic data sets to obtain complete geometry and reasonable shading.
12016558
Constrained motion control of flexible robot manipulators based on recurrent neural networks
In this paper, a neural network approach is presented for the motion control of constrained flexible manipulators, where both the contact force everted by the flexible manipulator and the position of the end-effector contacting with a surface are controlled. The dynamic equations for vibration of flexible link and constrained force are derived. The developed control, scheme can adaptively estimate the underlying dynamics of the manipulator using recurrent neural networks (RNNs). Based on the error dynamics of a feedback controller, a learning rule for updating the connection weights of the adaptive RNN model is obtained. Local stability properties of the control system are discussed. Simulation results are elaborated on for both position and force trajectory tracking tasks in the presence of varying parameters and unknown dynamics, which show that the designed controller performs remarkably well.
2271365
Minimal period retiming under process variations
With aggressive scaling down of feature sizes in VLSI fabrication, process variations have become a critical issue in designs. With process variations, timing optimization should consider the randomness introduced in delays. This paper considers how to retime a circuit under process variations. A statistical retiming problem is defined on the concept of a disutility function. Based on a new minimal period retiming algorithm, two algorithms are presented for the statistical retiming problem. Both theoretical and experimental results are given.
26189
Detecting Instances of Shape Classes That Exhibit Variable Structure
This paper proposes a method for detecting shapes of variable structure in images with clutter. The term “variable structure” means that some shape parts can be repeated an arbitrary number of times, some parts can be optional, and some parts can have several alternative appearances. The particular variation of the shape structure that occurs in a given image is not known a priori. Existing computer vision methods, including deformable model methods, were not designed to detect shapes of variable structure; they may only be used to detect shapes that can be decomposed into a fixed, a priori known, number of parts. The proposed method can handle both variations in shape structure and variations in the appearance of individual shape parts. A new class of shape models is introduced, called Hidden State Shape Models, that can naturally represent shapes of variable structure. A detection algorithm is described that finds instances of such shapes in images with large amounts of clutter by finding globally optimal correspondences between image features and shape models. Experiments with real images demonstrate that our method can localize plant branches that consist of an a priori unknown number of leaves and can detect hands more accurately than a hand detector based on the chamfer distance.
42707225
A Web-based Course in English as a Second Language: A Case Study