5256780
XML-Based Frameworks for Internet Commerce
XML-based frameworks or industry standatrds for Intemet Commerce are rapidly launched and changed. The contribution of this paper is to increase the understanding and facilitate comparison and evaluation of the most commonly refered framworks. The paper provides a survey of the architecture and message definition of BizTalk, cXML, eCo Framework, ICE (Information and Content Exchange), IOTP (Internet Open Trading Protocol), OAG (Open Applications Group), RosettaNet, xCBL, ebXML and ontology.org. The relationships between these frameworks are cooperative and competitive and thus the merger and change are unavoidable. At present eCo Framework and xCBL are tightly cooperative and supported by others. The competing initiative is centered around Microsoft’s BizTalk, supported by cXML and OAG. The future will probably see closer cooperation to make formats compatible. Microsoft is both promoting BizTalk and is a member of eCo Framework.
14081236
Potential Advantages of Semantic Web for Internet Commerce
Past decade saw much hype in the area of information technology. The emerging of semantic Web makes us ask if it is another hype. This paper focuses on its potential application in Internet commerc ...
10814374
The DNF exception problem
Given a disjunctive normal form (DNF) expression ϕ and a set A of vectors satisfying the expression, called the set of exceptions, we would like to update ϕ to get a new DNF which is false on A, and otherwise is equivalent to ϕ. Is there an algorithm with running time polynomial in the number of variables, the size of the original formula and the number of exceptions, which produces an updated formula of size bounded by a certain type of function of the same parameters?We give an efficient updating algorithm, which shows that the previously known best upper bound for the size of the updated expression is not optimal in order of magnitude. We then present a lower bound for the size of the updated formula in terms of the parameters, which is the first known lower bound for this problem. We also consider the special case (studied previously in the complexity theory of disjunctive normal forms) where the initial formula is identically true, and give efficient updating algorithms, providing new upper bounds for the size of the updated expression.
1206474
Interactive classification using a granule network
Classification is one of the main tasks in machine learning, data mining and pattern recognition. Compared with the extensively studied data-driven approaches, the interactively user-driven approaches are less explored. A granular computing model is suggested for re-examining the classification problems. An interactive classification method using the granule network is proposed, which allows multi-strategies for granule tree construction and enhances the understanding and interpretation of the classification process. This method is complementary to the existing classification methods.
11721850
Estimating LOC for information systems from their conceptual data models
Effort and cost estimation is crucial in software management. Estimation of software size plays a key role in the estimation. Line of Code (LOC) is still a commonly used software size measure. Despite the fact that software sizing is well recognized as an important problem for more than two decades, there is still much problem in existing methods. Conceptual data model is widely used in the requirements analysis for information systems. It is also not difficult to construct conceptual data models in the early stage of developing information systems. Much characteristic of an information system is actually reflected from its conceptual data model. We explore into the use of conceptual data model for estimating LOC. This paper proposes a novel method for estimating LOC for an information system from its conceptual data model through the use of multiple linear regression model. We have validated the method through collecting samples from both the industry and open-source systems.
1680683
Subscription Propagation in Highly-Available Publish/Subscribe Middleware
Achieving availability and scalability while providing service guarantees such as in-order, gapless delivery is essential for deploying publish/subscribe messaging middleware in wide area networks. Scalability often requires a publish/subscribe system to propagate subscription information and perform content matching across the network. Existing subscription propagation algorithms do not support in-order, gapless delivery in a redundant overlay network.This paper presents a novel approach that utilizes virtual time (VT) vectors to convey temporal consistency in propagating incremental and consolidated subscription information. The VT vectors provide a means of testing sufficiency of filtering information, by comparing a broker's VT vector with that of a message. When the test fails, indicating insufficient broker subscription information, safety may be preserved by "flooding" the message to all neighbors on a routing tree. This approach does not require subscription state agreement across redundant paths and hence is highly available. We present a detailed evaluation of the approach.
6467988
Empirical and Theoretical Comparisons of Selected Criterion Functions for Document Clustering
This paper evaluates the performance of different criterion functions in the context of partitional clustering algorithms for document datasets. Our study involves a total of seven different criterion functions, three of which are introduced in this paper and four that have been proposed in the past. We present a comprehensive experimental evaluation involving 15 different datasets, as well as an analysis of the characteristics of the various criterion functions and their effect on the clusters they produce. Our experimental results show that there are a set of criterion functions that consistently outperform the rest, and that some of the newly proposed criterion functions lead to the best overall results. Our theoretical analysis shows that the relative performance of the criterion functions depends on (i) the degree to which they can correctly operate when the clusters are of different tightness, and (ii) the degree to which they can lead to reasonably balanced clusters.