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.
It is well-known that carbohydrate sugar chains, or glycans, play various well in cellular processes, including cancer, but the elucidation of glycans is difficult because of their complex structure. Both computational methods and mathematical models are necessary to integrate and analyze the information of glycomics data so as to efficiently detect glycan structures. In this paper, we propose a new...
A two-stage supply chain scheduling problem is considered, where the first stage is job production and the second stage is job delivery. The focus is on the study of the integration of production scheduling with delivery of finished products to customers. In our considered model each job can be processed on either of two identical machines, and then delivered by a vehicle to a customer location. We...
Abnormal regulation of signaling pathways is the key factor causing disease. For better understanding disease mechanisms, many methods have been proposed to identify the significantly differential pathways between diseases and normal individuals via microarray gene expression datasets. Unlike previous common analysis processes, which is focused on merging gene difference into difference of pathway...
In this paper, we propose a method for calculating probability of scores for men’s team competition in artistic gymnastics. We here assume each gymnast's score as a normal distribution and provide a mathematical formulation for 6-5-4 format in the team competition. By setting the different mean and standard deviation (SD) of the normal distribution, we calculate the distributions of the team score,...
In this paper, we tackle with indefinite kernels by introducing projection matrix to formulate a positive semidefinite kernel. The projection matrix has a nice property of sharing the same set of eigenvectors with the original kernel. The proposed model can be regarded as a generalized version of spectrum method (denoising method and flipping method) by varying parameter λ. The problem of selecting...
The Best Nine is a post-season All-Star honor given out in Nippon Professional Baseball. Every year one player per league is voted as the best at each position by baseball writers. However some players who were not elected may have gotten superior results than players who were elected. Thus we try election of another Best Nine based only on official records. We elect players who have high efficiency...
We are concerned with a product portfolio management problem in which a firm wants to enter a competitive market by offering new products where there are existing products belonging to a competitor. The objective of the new entrant firm is to find out an optimal product portfolio that maximizes its expected shared surplus. The market incumbent firm can react by adjusting its existing product portfolio...
Word search is a classical puzzle to search for all given words on a given assignment of letters to a rectangular grid (matrix). This problem is clearly in P. The inverse of this problem is more difficult, which asks to assign letters in a given alphabet to a matrix of given size so that every word in a given wordset can be found horizontally, vertically, or diagonally. This problem is in NP; it admits...
This paper considers a parallel queuing system with two heterogeneous servers where the task is dispatched to the two servers. The threshold assignment policy dispatches the tasks according to the number of customers in server 1. Firstly, we obtain the stationary condition of the system. Secondly, we give the stationary performance indices by using a matrix-geometric solution theory. Finally, we develop...
Inventory routing problem (IRP) which is a problem integrated with inventory control and vehicle routing is a typical NP-hard problem, and also is the key of inventory and distribution coordinated optimization in the vendor managed inventory (VMI). An IRP of petrol secondary delivery system on the background of petroleum and petrochemical enterprise is investigated. Given a set of homogeneous vehicles...
The multiple knapsack problem is to pack some items into given knapsacks, such that the sum of the knapsack profits is maximized. This paper is concerned with a variant of the multiple knapsack problem, called the multiple knapsack problem with compatible bipartite graph (MKPCBG), where two items can be packed into the same knapsack only if their corresponding vertices are adjacent in the given compatible...
We present constant-time testing algorithms for the generalized shogi (Japanese chess) and chess. These problems are known to be EXPTIME-complete. A testing algorithm (or a tester) for a property accepts an input if it has the property and rejects it if it’s far from having the property in high probability (e.g., at least 2/3) by reading only a constant part of the input. A property is said to be...
Online product reviews contain valuable information about customer requirements (CRs). Intelligent analysis of a large volume of online CRs attracts interest from researchers in different fields. However, many research studies only concern sentiment polarity in different level and designers still need to read these reviews to absorb comprehensive CRs. In this research, online reviews are analyzed...
An increasing attention has been paid to efficiency analysis in the health care area. Among the existing efficiency assessment techniques, data envelopment analysis (DEA) plays an important role in a wide range of applications as for measuring the relative efficiency of different health care sectors. This paper focuses on a second stage of the analysis, which is operated after efficiency evaluation...
As a common task in the fields of bioinformatics, enrichment analysis aims to investigate the functional association between a gene list of interest which often derived from biological experiments, and specific gene sets in a large database. The core problem of enrichment analysis can be characterized as a two-objective optimization problem. In this paper, we formulated the multiple gene sets enrichment...
In this paper a method is presented for detection of melanin globules often present in melanocytic skin lesions images. The detection is done by performing image analysis similar to the one used in clinical evaluation. The method uses multi-stage image filtering to extract objects present in the dermoscopic image that match globule structure pattern. Classification of the found objects is made based...
Given a graph G = (V,E) with a set W ⊆ V of vertices, we enumerate colorings to W such that for every two enumerated colorings c and c' the corresponding colored graphs (G, c) and (G, c') are not isomorphic. This problem has an important application in the study of isomers of chemical graphs such as generation of benzen isomers from a tree-like chemical graph structure. The number of such colorings...
The Traveling Salesman Problem (TSP) is one of the most well-known NP-hard optimization problems. Following a recent trend of research which focuses on developing algorithms for special types of TSP instances, namely graphs of limited degree, and thus alleviating a part of the time and space complexity, we present a polynomial-space branching algorithm for the TSP in graphs with degree at most 5,...
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.