20851072
Constructing a SCORM-Compliant Intelligent Strategy Repository
Developing a pedagogical learning content that can be delivered among different Learning Management Systems (LMSs) is a critical task for most instructors. Although the Sharable Content Object Reference Model (SCORM) has proposed a mechanism allowing the exchange of learning contents between LMSs, to embed learning strategies to SCORM-compliant learning content is still an open issue. This paper proposes a mechanism to construct a SCORM-compliant strategy repository which contains learning strategies. The strategy repository can be adapted to satisfy the requirement of instructor for designing learning content with strategies embedded. The strategy repository presented in this paper is with the following advantages: (a) the strategies stored are domain independent; (b) the strategies offered are adaptable; (c) the strategies saved can be continuously evolved; (d) the strategies stored can be reusable.
16852145
The infinity Lambda test
In this paper, WC proposed the infinity Lambda test. The infinity Lambda test can be applied IO deal with data dependence of coupled arrays with symbolic (urrknowr, at compile time) bounds. Experimental data reflecting the effect of the infinity Lambda test are also presented.
7900750
A Web-service oriented framework for building SCORM compatible learning management systems
Managing the large amount of learning content involved in the development of an expandable learning management system (LMS) is a critical task for most educational organizations. In designing such a system, consideration must be given not only to the requirement of instructors and students, but also to the adaptive qualities of the system itself, because of the rapidly changing software environment. Unlike most enterprises, educational organization can't afford high system maintenance. Development of a flexible, expandable and reliable learning management system is, therefore, imperative. This paper proposes a Web service oriented framework in building a sharable content object reference model (SCORM) compatible LMS. We integrated the SCORM concept with distributed computing technologies to build the components of the LMS and demonstrate how these services can be configured to create a complete system. This framework increases reusability and reduces the maintenance requirements of the LMS. It provides a way for small educational organizations, with limited resources, to build a complete SCORM compatible LMS. In such an ideal situation, the content provider not only provides the content, but also the service for the consumers of that content.
37782928
A multi-dimensional version of the I test
Abstract Two-dimensional arrays with linear subscripts occur quite frequently in real programs. In general, for multi-dimensional linear arrays under constant bounds the Lambda test is an efficient data dependence method to check whether there exist real solutions. In this paper, we propose a multi-dimensional version of the I test, the multi-dimensional I test, that can be applied to testing whether there are integer solutions for multi-dimensional linear arrays under constant limits. Experiments with benchmark showing the effects of the multi-dimensional I test on testing precision and testing efficiency are also presented.
39715098
A Requirement-Based Project Estimation Approach
22379683
Analyzing reconfigurable algorithms for managing replicated data
We analyze reconfigurable algorithms for managing replicated data to determine how often one should detect and react to failure conditions so that reorganization operations can be performed at the appropriate time to improve the availability of replicated data. We use dynamic voting as a case study to reveal design trade-offs for designing such reconfigurable algorithms and illustrate how often failure detection and reconfiguration activities should be performed so as to maximize data availability. Stochastic Petri nets are used as a tool to facilitate our analysis.
27561759
Splice site prediction using support vector machines with a Bayes kernel
One of the most important tasks in correctly annotating genes in higher organisms is to accurately locate the DNA splice sites. Although relatively high accuracy has been achieved by existing methods, most of these prediction methods are computationally extensive. Due to the enormous amount of DNA sequences to be processed, the computational speed is an important issue to consider. In this paper, we present a new machine learning method for predicting DNA splice sites, which first applies a Bayes feature mapping (kernel) to project the data into a new feature space and then uses a linear Support Vector Machine (SVM) as a classifier to recognize the true splice sites. The computation time is linear to the number of sequences tested, while the performance is notably improved compared with the Naive Bayes classifier in terms of classification accuracy, precision, and recall. Our classification results are also comparable to the solution quality obtained by the SVMs with polynomial kernels, while the speed of our proposed method is significantly faster. This is a notable improvement in computational modeling considering the huge amount of DNA sequences to be processed.
13097054
RQL: Global Placement via Relaxed Quadratic Spreading and Linearization
This paper describes a simple and effective quadratic placement algorithm called RQL. We show that a good quadratic placement, followed by local wirelength-driven spreading can produce excellent results on large-scale industrial ASIC designs. As opposed to the current top performing academic placers [4,7,11], RQL does not embed a linearization technique within the solver. Instead, it only requires a simpler, pure quadratic objective function in the spirit of [8,10,23]. Experimental results show that RQL outperforms all available academic placers on the ISPD-2005 placement contest benchmarks. In particular, RQL obtains an average wire- length improvement of 2.8%, 3.2%, 5.4%, 8.5%, and 14.6% versus mPL6 [5], NTUPlaceS [7], Kraflwerk [20], APlace2.0 [11], and Capo10.2 [18], respectively. In addition, RQL is three, seven, and ten times faster than mpL6, Capo10.2, and APlace2.0, respectively. On the ISPD-2006 placement contest benchmarks, on average, RQL obtains the best scaled wirelength among all available academic placers.
10162254
In-broker access control: towards efficient end-to-end performance of information brokerage systems
An XML brokerage system is a distributed XML database system that comprises data sources and brokers which, respectively, hold XML documents and document distribution information. However, all existing information brokerage systems view or handle query brokering and access control as two orthogonal issues: query brokering is a system issue that concerns costs and performance, while access control is a security issue that concerns information confidentiality. As a result, access control deployment strategies (in terms of where and when to do access control) and the impact of such strategies on end-to-end system performance are neglected by existing information brokerage systems. In addition, data source side access control deployment is taken-for-granted as the "right" thing to do. In this paper, we challenge this traditional, taken-for-granted access control deployment methodology, and argue that query brokering and access control are not two orthogonal issues because access control deployment strategies can have a significant impact on the "whole" system's end-to-end performance. We propose the first in-broker access control deployment strategy where access control is "pushed" from the boundary into the "heart" of the information brokerage system
5795561
An in-depth analysis of information markets with aggregate uncertainty
The novel idea of setting up Internet-based virtual markets, information markets, to aggregate dispersed information and predict outcomes of uncertain future events has empirically found its way into many domains. But the theoretical examination of information markets has lagged relative to their implementation and use. This paper proposes a simple theoretical model of information markets to understand their information dynamics. We investigate and provide initial answers to a series of research questions that are important to understanding how information markets work, which are: (1) Does an information market converge to a consensus equilibrium? (2) If yes, how fast is the convergence process? (3) What is the best possible equilibrium of an information market? and (4) Is an information market guaranteed to converge to the best possible equilibrium?
12805154
Efficient rectilinear Steiner tree construction with rectilinear blockages
Given n points on a plane, a rectilinear Steiner minimal tree (RSMT) connects these points through some extra points called Steiner points to achieve a tree with minimal total wire length. Taking blockages into account dramatically increases the problem complexity. It is extremely unlikely that an efficient optimal algorithm exists for rectilinear Steiner minimal tree construction with rectilinear blockages (RSMTRB). Although there exist some heuristic algorithms for this problem, they have either poor quality or expensive running time. In this paper, we propose an efficient and effective approach to solve RSMTRB. The connection graph we used in this approach is called spanning graph which only contains O(n) edges and vertices. An O(n log n) time algorithm is proposed to construct spanning graph for RSMTRB. The experimental results show that this approach can achieve a solution with significantly reduced wire length. The total run time increased is negligible in the whole design flow.