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
18367158
A distributed database server for continuous media
In our project, we are adopting a new approach for handling video data. We view the video as a well-defined data type with its own description, parameters and applicable methods. The system is based on PREDATOR, an open-source object-relational DBMS. PREDATOR uses Shore as the underlying storage manager. Supporting video operations (storing, searching-by-content and streaming) and new query types (query-by-example and multi-feature similarity searching) requires major changes in many of the traditional system components. More specifically, the storage and buffer manager has to deal with huge volumes of data with real-time constraints. Query processing has to consider the video methods and operators in generating, optimizing and executing the query plans.
8805498
Bounded Degree Closest k-Tree Power Is NP-Complete
An undirected graph G=V,E is the k-power of an undirected tree T=V,E' if u,v∈ E iff u andi¾?v are connected by a path of length at mosti¾?k ini¾?T. The treei¾?T is called the tree root ofi¾?G. Tree powers can be recognized in polynomial time. The thus naturally arising question is whether a graphi¾?G can be modified by adding or deleting a specified number of edges such thati¾?G becomes a tree power. This problem becomes NP-complete for ki¾? 2. Strengthening this result, we answer the main open question of Tsukiji and Chen [COCOON 2004] by showing that the problem remains NP-complete when additionally demanding that the tree roots must have bounded degree.
2256716
Minimum Membership Set Covering and the Consecutive Ones Property
The Minimum Membership Set Cover problem has recently been introduced and studied in the context of interference reduction in cellular networks. It has been proven to be notoriously hard in several aspects. Here, we investigate how natural generalizations and variations of this problem behave in terms of the consecutive ones property: While it is well-known that classical set covering problems become polynomial-time solvable when restricted to instances obeying the consecutive ones property, we experience a significantly more intricate complexity behavior in the case of Minimum Membership Set Cover. We provide polynomial-time solvability, NP-completeness, and approximability results for various cases here. In addition, a number of interesting challenges for future research is exhibited
13379605
Protein Fold Recognition Through Application of Residual Dipolar Coupling Data
Residual dipolar coupling (RDC) represents one of the most exciting emerging NMR techniques for studying protein structures. However, solving a protein structure using RDC data alone is a highly challenging problem as it often requires that the starting structure model be close to the actual structure of a protein, for the structure calculation procedure to be effective. We report in this paper a computer program, RDC-PROSPECT, for identification of a structural homolog or analog of a target protein in PDB, which best matches the 15N-1H RDC data of the protein recorded in a single ordering medium. The identified structural homolog/analog can then be used as a starting model for RDC-based structure calculation. Since RDC-PROSPECT uses only RDC data and predicted secondary structure information, its performance is virtually independent of sequence similarity between a target protein and its structural homolog/analog, making it applicable to protein targets out of the scope of current protein threading techniques. We have tested RDC-PROSPECT on all 15N-1H RDC data (representing 33 proteins) available in the BMRB database and the literature. The program correctly identified the structural folds for approximately 80% of the target proteins, significantly better than previously reported results, and achieved an average alignment accuracy of 97.9% residues within 4-residue shift. Through a careful algorithmic design, RDC-PROSPECT is at least one order of magnitude faster than previously reported algorithms for principal alignment frame search, making our algorithm fast enough for large-scale applications.
10065672
The waiting time distribution for a TDMA model with a finite buffer and state-dependent service
We obtain detailed analytic formulas for the density and probability distribution of the waiting time in a time-division multiple-access (TDMA) model with a finite buffer and state-dependent service. On successive intervals of length equal to the duration of a slot, the density is expressed as a linear combination of beta densities with positive coefficients. A recursive scheme, obtained by a matrix-analytic derivation, allows for the highly efficient computations of the coefficient sequences. An expression for the mean waiting time is derived using the classical queueing formula L=/spl lambda/W. We also demonstrate that our methodology provides a concise treatment of various special cases that have been studied over the past half century.