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
75279
Error Compensation in Leaf Power Problems
AbstractThe k-Leaf Power recognition problem is a particular case of graph
 power problems: For a given graph it asks whether there exists an
 unrooted tree—the k-leaf root—with leaves one-to-one labeled by
 the graph vertices and where the leaves have distance at most k iff their corresponding vertices in the graph are connected by an
 edge. Here we study "error correction" versions of k-Leaf
 Power recognition—that is, adding or deleting at most l
 edges to generate a graph that has a k-leaf root. We provide
 several NP-completeness results in this context, and we show that
 the NP-complete Closest 3-Leaf Power problem (the error
 correction version of 3-Leaf Power) is fixed-parameter
 tractable with respect to the number of edge modifications or vertex
 deletions in the given graph. Thus, we provide the seemingly first
 nontrivial positive algorithmic results in the field of error
 compensation for leaf power problems with k > 2. To this end, as a
 result of independent interest, we develop a forbidden subgraph
 characterization of graphs with 3-leaf roots.
2388533
Probe Matrix Problems: Totally Balanced Matrices
Let be a class of 0/1-matrices. A 0/1/ i¾?-matrix Awhere the i¾?s induce a submatrix is a probe matrixof if the i¾?s in Acan be replaced by 0s and 1s such that Abecomes a member of . We show that for being the class of totally balanced matrices, it can be decided in polynomial time whether Ais a probe totally balanced matrix. On our route toward proving this main result, we also prove that so-called partitioned probe strongly chordal graphs and partitioned probe chordal bipartite graphs can be recognized in polynomial time.
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.
6234679
A Model-based Approach to Hair Region Segmentation
Hair regions represent an important external feature in many tasks involving the processing of human faces. Currently, the task of locating the hair region in a facial image requires manual intervention. In this paper we examine the different aspects of the hair region segmentation problem and develop an automatic system for such a problem. The system incorporates the human knowledge on where the hair is usually located in a facial image. Segmentation is performed via the classification of image pixels and is based on both textural and geometrical features. Experiments have shown that the segmentation results are generally satisfactory and are at least comparable to the performance of manual extraction.
41178770
On matching coefficients
Abstract Explicit formulae are derived for the first four coefficients of the matching polynomial of a graph in terms of properties of the graph. An explicit formula is also derived for the number of triangles in the complement of a graph in terms of the parameters of the graph. Also, some extremal properties of regular multipartite graphs are identified.