29068512
Perceptions of credibility of scholarly information on the web
The purpose of this study is to investigate factors influencing students' perception of the credibility of scholarly information on the web. In addition to the four types of source credibility proposed by previous studies (presumed credibility, reputed credibility, surface credibility, and experienced credibility), this study shows that two other types of source credibility (verifiable credibility and cost-effort credibility) play a significant role in shaping students' perceptions of credibility. Circumstances that affect students' willingness to accept scholarly information on the web are identified. Implications for web system design are also discussed.
34520117
Print vs. electronic resources: A study of user perceptions, preferences, and use
The arrival and proliferation of electronic resources and digital libraries have a number of significant impacts on the use of print resources and traditional libraries. This study explores the extent to which graduate students in a metropolitan university setting use print and electronic resources. Reading preferences and use of print and electronic resources vary among different disciplines. Graduate students seem to expect a hybrid of print and electronic resources. They desire to meet their information needs through a mix of print and online resources, even though reasons for supplementing another type of resource differ. Circumstances that affect the selection of use between digital libraries and traditional libraries are also discussed.
31153136
An Adaptive Scheduling Algorithm for Molecule Docking Design on Grid
Grid provides a promising platform for the efficient execution of drug molecular docking design. Scheduling such applications is challenging for the heterogeneity, autonomy, and dynamic adaptability of grid resources. Assuming resource owners have a preemptive priority, we propose an adaptive algorithm of jobs scheduling based on time balancing strategy, which solves parallel molecular docking task by using the idle resources in the Grid. A mathematical model is developed to predict performance, which also considers systems with heterogeneous machine utilization and heterogeneous service distribution. According to the time balancing policy, ligands are partitioned into several subtasks and scheduled. The expected value of molecular docking completion time is predicted with performance model. To get better parallel computing performance, an optimal subset of heterogeneous resources with the shortest parallel executing time of tasks can be selected with the algorithm.
315976
Resource Annotation Framework in a Georeferenced and Geospatial Digital Library
G-Portal is a georeferenced and geospatial digital library that aims to identify, classify and organize geospatial and georeferenced resources on the web and to provide digital library services for these resources. Annotation service is supported in G-Portal to enable users to contribute content to the digital library. In this paper, we present a resource annotation framework for georeferenced and geospatial digital libraries and discuss its application in G-Portal. The framework is flexible for managing annotations of heterogeneous web resources. It allows users to contribute not only the annotation content but also the schema of the annotations. Meanwhile, other digital library services, such as visualization and classification, can be provided over the annotations since they are treated as first class objects. This paper mainly focuses on the design of the resource annotation framework.
11497838
On organizing and accessing geospatial and georeferenced Web resources using the G-Portal system
In order to organise and manage geospatial and georeferenced information on the Web making them convenient for searching and browsing, a digital portal known as G-Portal has been designed and implemented. Compared to other digital libraries, G-Portal is unique for several of its features. It maintains metadata resources in XML with flexible resource schemas. Logical groupings of metadata resources as projects and layers are possible to allow the entire metadata collection to be partitioned differently for users with different information needs. These metadata resources can be displayed in both the classification-based and map-based interfaces provided by G-Portal. G-Portal further incorporates both a query module and an annotation module for users to search metadata and to create additional knowledge for sharing respectively. G-Portal also includes a resource classification module that categorizes resources into one or more hierarchical category trees based on user-defined classification schemas. This paper gives an overview of the G-Portal design and implementation. The portal features will be illustrated using a collection of high school geography examination-related resources.
15321284
From Durational Specifications to TLA Designs of Timed Automata
Different temporal logics tend to emphasise different aspects of a hybrid system. In this paper, we study the predicative interpretation of Duration Calculus (DC) and Temporal Logic of Actions (TLA) and the link between them. A notation called generic composition is used to simplify the manipulation of predicates. The modalities of possibility and necessity become generic composition and its inverse of converse respectively. The transformation between different temporal logics is also characterised as such modalities. The formalism provides a framework in which human experience about hybrid system development can be formalised as refinement laws. A high-level durational specification can be decomposed to two durational specifications driven by an automaton. In such a stepwise design process, durational features are reduced while automaton features increase gradually. The application of the technique is demonstrated in the case study of the gas burner problem.
12816052
Worst-Case Analysis of Scheduling Heuristics of Parallel Systems
Abstract It is well-known that most scheduling problems arising from parallel systems are NP -hard, even under very special assumptions. Thus, various suboptimal algorithms, in particular heuristics, were proposed in the literature. Worst-case error bounds are established in this paper for heuristics of makespan minimization of parallel computations. Different parallel computation models are investigated, including interprocessor communication, task duplication, multiprocessor tasks and parallel tasks. Due to the heterogeneity of these systems, scheduling heuristics can be far away from the optimal solutions. These bounds provide insights to the design of scheduling heuristics in order to obtain good performance guarantee than arbitrary heuristics. Moreover, the performance guarantee of these special heuristics is independent of model parameters such as the maximal duplication degree, processor requirement and parallelization degree.