Due to the limitations of traditional laser processing technology, which is confined to two-dimensional planes, it is difficult to meet the demands of complex curved surface laser processing. This study proposes a laser processing robot digital twin system for complex curved surfaces. Two surface trajectory generation strategies are introduced: the surface projection algorithm based on a scanning model supports the generation of unknown surface trajectories, and the STEP model analysis method based on OCC(Opencascade) enables trajectory generation for user-defined surfaces. Furthermore, a multi-task digital twin system is developed, integrating dynamic simulation of surface trajectories and real-time mapping of laser processing. Experimental verification shows that the system successfully realizes the full-process monitoring of graphene wire preparation by laser induction and arc additive manufacturing on complex curved surfaces.

Cellular network providers collect and use a wide variety of data for assessing the service quality experienced by their smartphone users. The data is essential for tasks ranging from event detection, problem diagnosis, impact analysis, coverage and capacity planning, load balancing, and performance optimization. For example, service quality measurements and data from drive-by tests provide useful and detailed information about different aspects of quality of service such as dropped calls due to handovers or radio interference. However, a major challenge for effective service quality management in operational setup is the presence of missing or unavailable data. Furthermore, the cellular data is inherently multidimensional, i.e. is a function of several variables such as location, device type, and time. Motivated by recent advances in handling multidimensional data, we propose to use tensor algebraic models and methods for cellular data prediction. The main idea is to model the data as a low rank tensor and use a rank constrained interpolation for data prediction. We focus on two recently proposed algebraic models employing two different notions of tensor rank. We test and compare the performance of the two approaches on real-world data sets collected from an operational cellular network and indicate the regimes in which one method is superior to the other. Based on these observations the proposed algorithm chooses the best of the two approaches using cross-validation.

Tensor robust principal component analysis (PCA) approaches have drawn considerable interests in many applications such as background subtraction, denoising, and outlier detection, etc. In this paper we propose an online tensor robust PCA where the multidimensional data (tensor) is revealed sequentially in online mode, and tensor PCA is updated based on the latest estimation and the newly collected data. Compared to the tensor robust PCA in batch mode, we significantly reduce the required memory and improve the computation efficiency. Application on fusing cloud-contaminated satellite images demonstrates that the proposed method shows superiority in both convergence speed and performance compared to the state-of-the-art approaches.

In this paper, we present a novel unsupervised method for detecting outliers in image databases, when the images are misaligned by action of transformations forming a group. The main idea is that when the aligned data lie in a low dimensional subspace, the misaligned data, assuming that the group size is small, will lie in a low dimensional group-invariant subspace. We then explicitly exploit this additional algebraic property and propose an algorithm for detecting outliers that is robust to data misalignment. We perform extensive comparison with current state of the art methods and show the superior performance of our algorithm.

In this paper we propose novel methods for completion (from limited samples) and de-noising of multilinear (tensor) data and as an application consider 3-D and 4- D (color) video data completion and de-noising. We exploit the recently proposed tensor-Singular Value Decomposition (t-SVD)[11]. Based on t-SVD, the notion of multilinear rank and a related tensor nuclear norm was proposed in [11] to characterize informational and structural complexity of multilinear data. We first show that videos with linear camera motion can be represented more efficiently using t-SVD compared to the approaches based on vectorizing or flattening of the tensors. Since efficiency in representation implies efficiency in recovery, we outline a tensor nuclear norm penalized algorithm for video completion from missing entries. Application of the proposed algorithm for video recovery from missing entries is shown to yield a superior performance over existing methods. We also consider the problem of tensor robust Principal Component Analysis (PCA) for de-noising 3-D video data from sparse random corruptions. We show superior performance of our method compared to the matrix robust PCA adapted to this setting as proposed in [4].

MOTIVATION: Expression profiling in diverse tissues is fundamental to understanding gene function as well as therapeutic target identification. The vast collection of expressed sequence tags (ESTs) and the associated tissue source information provides an attractive opportunity for studying gene expression. RESULTS: To facilitate EST-based expression analysis, we developed GEPIS (gene expression profiling in silico), a tool that integrates EST and tissue source information to compute gene expression patterns in a large panel of normal and tumor samples. We found EST-based expression patterns to be consistent with published papers as well as our own experimental results. We also built a GEPIS Regional Atlas that depicts expression characteristics of all genes in a selected genomic region. This program can be adapted for large-scale screening for genes with desirable expression patterns, as illustrated by our large-scale mining for tissue- and tumor-specific genes. AVAILABILITY: The email server version of the GEPIS application is freely available at http://share.gene.com/share/gepis. An interactive version of GEPIS will soon be freely available at http://www.cgl.ucsf.edu/Research/genentech/gepis/. The source code, modules, data and gene lists can be downloaded at http://share.gene.com/share/gepis.

SUMMARY: Although the HMMER package is widely used to produce profile hidden Markov models (profile HMMs) for protein domains, it has been difficult to create a profile HMM for signal peptides. Here we describe an approach for building a complex model of eukaryotic signal peptides by the standard HMMER package. Signal peptide prediction with this model gives a 95.6% sensitivity and 95.7% specificity. AVAILABILITY: The profile HMM for signal peptides, data sets, and the scripts for analyzing data are available for non-commercial use at http://share.gene.com/.