The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Given a graph G = (V, E) with non-negative edge lengths, a subset R ⊂ V, a Steiner tree for R in G is an acyclic subgraph of G interconnecting all vertices in R and a terminal Steiner tree is defined to be a Steiner tree in G with all the vertices of R as its leaves. A bottleneck edge of a Steiner tree is an edge with the largest length in the Steiner tree. The bottleneck Steiner tree problem (BSTP)...
The diameter of a graph is the maximum distance among all pairs of nodes. Determining the diameter of a graph in the tradition way costs O(mn) time, where n is the number of nodes and m is the number of edges. A social network can be modelled as a graph. With the rapid expansion of social networks, the number of nodes in a social network could be hundreds of millions. In this paper, we propose a new...
Modularity is widely-used objective function to detect communities and there are lots of algorithms based on modularity maximization. The leading eigenvector method is one of them where modularity is maximized by choosing the first eigenvector as partition result. To analyze in depth the information provided by other eigenvectors, modularity maximization could be transformed to vector partitioning...
In recent years, many researchers have proposed intelligent systems based on the IoT (Internet of Things). Among these smart systems, one of the most common applications is intelligent surveillance system. Due to the development of the camera, some applications adopt higher resolution of images to get more accurate results. Therefore, how to process these high-resolution images in real time has become...
Many daily problems can be mapped into a graph matching problem and can be solved by using graph theory algorithms. There are many different definitions of optimization about graph matching. Consider optimization of matching on a bipartite graph, where the two partite sets represent sets of apprentices and teachers, respectively. Each apprentice has a preference list, ranking a nonempty subset of...
In this paper, we build a sponsored search auction platform to simulate and analysis the auction result for auctioneers. We propose to use geometrically decreasing sequence to capture the click behavior of internet users. In our simulations, the results show that theoretical properties of the charging mechanisms are captured, and the proposed platform reflects the charging mechanism's property. Therefore,...
The growth of public DNA sequence and metagenomic data over the last two decades has been exponential. Bioinformatics researchers are confronted with analysis of massive data sets, while the problem is still growing at an alarming rate in the near future. In this paper, we integrate many open source software tools in biological sequences analysis to construct an effective cloud-based microbial metagenomics...
In this paper, we propose algorithms for biomolecular docking sites selection problem by various machine learning approaches with selective features reduction. The proposed method can reduce the number of various amino acid features before constructing machine learning prediction models. Given frame boxes with features, the proposed method analyzes the important features by correlation coefficients...
Mate-pair sequencing is a technology for sequencing two ends of long DNA fragments, which has been widely used in genome scaffolding. Although the cost of mate-pair sequencing is now affordable, its accuracy has been limited by the lower quality and contamination. The 3rd generation sequencing is able to generate long reads for genome scaffolding. However, the error rates and cost are still too high...
The main goal of this study is to predict common and exclusive linear epitopes from two different grouper iridovirus protein sequences and launch their applications to vaccine design. The prediction mechanism is essentially based on integrating previously developed linear/conformational epitope prediction systems, the structural prediction system (Phyre2), and the sequencestructure alignment tools...
Finite element method (FEM) must be created the element mesh, it is very tedious and time-consuming. A novel meshless method doesn't require generating the element mesh, it reduces a large amount of computational and human time. The shape parameter plays a key role of meshless methods, the authors usually choose the shape parameter by trial and error or some other ad-hoc means. This study will propose...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.