30330476
Measurement Models for Survivability and Competitiveness of Very Large E-marketplace
E-Marketplace is a man-made profit center with emergent customer requirements. This emergence nature poses many difficulties for e-marketplace to satisfy its customers and thus affects its survivability and competitiveness. To challenge this issue, this paper has introduced a novel emergent emarketplace model, and analyzed and quantified the emergent properties of emarketplace from simple ESMs to very large complex electronic intermediary EIMs. The measurement models developed in this paper are very useful for producing dynamic interaction records appropriate for further simulation model of e-marketplaces.
5572698
Concept exchange: constructing interoperable electronic product catalogues in an emergent environment
Research in interoperability of electronic product catalogues has primarily focused on resolving semantic conflicts arisen from the heterogeneously designed electronic product catalogues. We argue that while existing integration strategies providing static connections between various heterogeneous catalogues over mediating ontologies, ontologies themselves exhibit heterogeneity and lack of evolvability. What's more, reclassifying terms to link public ontologies is very difficult to avoid inaccuracy problem that is critical to electronic commerce. This paper highlights the problems of flexibility, exactness and evolvability that have received little attention in the literature and provides an overview of the concept exchange approach to interoperability. It illustrates why this is able to better solve the identified problems, presents the different features compared with other approaches and suggests how the concept exchange framework is working.
14231112
A Transparent Collaborative Integration Approach for Ad Hoc Product Data
Product data integration is an essential issue for many e-commerce interoperable business systems. Core to this issue is how to maintain semantic consistency between heterogeneous product data that are semantically different in structure, concept and context. To resolve the issue, this paper proposes a transparent collaborative integration approach, which is built on a layered framework of messaging, structure, concept and collaboration. The key to this framework is three collaboration engines, which resolves semantic consistency issues between millions of contextual vocabularies of SMEs
6950256
Context representation, transformation and comparison for ad hoc product data exchange
Product data exchange is the precondition of business interoperation between Web-based firms. However, millions of small and medium sized enterprises (SMEs) encode their Web product data in ad hoc formats for electronic product catalogues. This prevents product data exchange between business partners for business interoperation. To solve this problem, this paper has proposed a novel concept-centric catalogue engineering approach for representing, transforming and comparing semantic contexts in ad hoc product data exchange. In this approach, concepts and contexts of product data are specified along data exchange chain and are mapped onto several novel XML product map (XPM) documents by utilizing XML hierarchical structure and its syntax. The designed XPM has overcome the semantic limitations of XML markup and has achieved the semantic interoperation for ad hoc product data exchange.
9204785
Achieving Transparent Integration of Information, Documents and Processes
While progress is made in the individual integration of business information, documents and processes, the issue of how to vertically integrate these individually integrated results needs to be resolved. This paper proposes a novel TRANSCODE approach to the issue. The approach represents business information, business documents and business processes in three TRANSCODE structures, which are then implemented, conceptualized and reified in an integrated and flexible 3-layer TRANSCODE model
37890888
Alibaba International: Building a Global Electronic Marketplace
Alibaba is the largest global electronic marketplace (GEM) in the world in terms of its participated users. It was successful due to the factors of China's foreign trade regime, the image of low product cost of China, Alibaba's contingent adaptation to users' changing requirements and e-commerce environments. Alibaba is not a technically mature GEM platform compared with the ideal functions of GEM. Suggested solution for Alibaba to continuing its success is to adopt a novel GEM connectivity model
15601163
High Efficiency Digital Halftoning with Two-Element Error Kernel
A high efficiency and good quality error-diffused halftoning is proposed in this paper. An objective halftone image quality evaluation method based on human visual system obtained by least-mean-square is also introduced. The error diffusion algorithm, first introduced by Floyd and Steinberg in 1975, is currently the most popular method of digital halftoning. However, some annoying shortcomings, such as patches of regular textures, worm effect, and computational complexity still need to be improved. Ostromoukhov proposed a three-element error diffusion solving the problems described above, and achieved excellent performance. In this paper, we further reduced the complexity with the proposed two-element error diffusion by cooperating with the proposed LMS-trained quality evaluation. As demonstrated in experiments, the proposed technique further reduced the complexity by 33% compared to Ostromoukhov's method, and it is still comparable in image quality.
122476415
Improved Algorithms and Complexity Results for Power Domination in Graphs
The Power Dominating Set problem is a variant of the classical domination problem in graphs: Given an undirected graph G=(V,E), find a minimum P⊆V such that all vertices in V are “observed” by vertices in P. Herein, a vertex observes itself and all its neighbors, and if an observed vertex has all but one of its neighbors observed, then the remaining neighbor becomes observed as well. We show that Power Dominating Set can be solved by “bounded-treewidth dynamic programs.” Moreover, we simplify and extend several NP-completeness results, particularly showing that Power Dominating Set remains NP-complete for planar graphs, for circle graphs, and for split graphs. Specifically, our improved reductions imply that Power Dominating Set parameterized by |P| is W[2]-hard and cannot be better approximated than Dominating Set.
14944633
On Exact and Approximation Algorithms for Distinguishing Substring Selection
The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string which is, with respect to Hamming metric, “away” from the good strings and “close” to the bad strings.
8023010
PROSPECT-PSPP: an automatic computational pipeline for protein structure prediction
Knowledge of the detailed structure of a protein is crucial to our understanding of the biological functions of that protein. The gap between the number of solved protein structures and the number of protein sequences continues to widen rapidly in the post-genomics era due to long and expensive processes for solving structures experimentally. Computational prediction of structures from amino acid sequence has come to play a key role in narrowing the gap and has been successful in providing useful information for the biological research community. We have developed a prediction pipeline, PROSPECT-PSPP, an integration of multiple computational tools, for fully automated protein structure prediction. The pipeline consists of tools for (i) preprocessing of protein sequences, which includes signal peptide prediction, protein type prediction (membrane or soluble) and protein domain partition, (ii) secondary structure prediction, (iii) fold recognition and (iv) atomic structural model generation. The centerpiece of the pipeline is our threading-based program PROSPECT. The pipeline is implemented using SOAP (Simple Object Access Protocol), which makes it easier to share our tools and resources. The pipeline has an easy-to-use user interface and is implemented on a 64-node dual processor Linux cluster. It can be used for genome-scale protein structure prediction. The pipeline is accessible at http://csbl.bmb.uga.edu/protein_pipeline.
1715544
Pattern matching for arc-annotated sequences
We study pattern matching for arc-annotated sequences. An O(nm) time algorithm is given for the problem to determine whether a length m sequence with nested arc annotation is an arc-preserving subsequence (aps) of a length n sequence with nested arc annotation, called APS(NESTED,NESTED). Arc-annotated sequences and, in particular, those with nested arc annotation are motivated by applications in RNA structure comparison. Our algorithm generalizes results for ordered tree inclusion problems and it is useful for recent fixed-parameter algorithms for LAPCS(NESTED,NESTED), which is the problem of computing a longest arc-preserving common subsequence of two sequences with nested arc annotations. In particular, the presented dynamic programming methodology implies a quadratic-time algorithm for an open problem posed by Vialette.