Semi-online scheduling on two machines with GoS levels and partial information of processing time.
Ontology highlight
ABSTRACT:
SUBMITTER: Luo T
PROVIDER: S-EPMC3942401 | biostudies-other | 2014
REPOSITORIES: biostudies-other
Similar Datasets
Project description:Deconvolution of bulk transcriptomics data from mixed cell populations is vital to identify the cellular mechanism of complex diseases. Existing deconvolution approaches can be divided into two major groups: supervised and unsupervised methods. Supervised deconvolution methods use cell type-specific prior information including cell proportions, reference cell type-specific gene signatures, or marker genes for each cell type, which may not be available in practice. Unsupervised methods, such as non-negative matrix factorization (NMF) and Convex Analysis of Mixtures (CAM), in contrast, completely disregard prior information and thus are not efficient for data with partial cell type-specific information. In this paper, we propose a semi-supervised deconvolution method, semi-CAM, that extends CAM by utilizing marker information from partial cell types. Analysis of simulation and two benchmark data have demonstrated that semi-CAM outperforms CAM by yielding more accurate cell proportion estimations when markers from partial/all cell types are available. In addition, when markers from all cell types are available, semi-CAM achieves better or similar accuracy compared to the supervised method using signature genes, CIBERSORT, and the marker-based supervised methods semi-NMF and DSA. Furthermore, analysis of human chlamydia-infection data with bulk expression profiles from six cell types and prior marker information of only three cell types suggests that semi-CAM achieves more accurate cell proportion estimations than CAM.
| S-EPMC7096458 | biostudies-literature
Project description:In recent years, the individualized demand of customers brings small batches and diversification of orders towards enterprises. The application of enabling technologies in the factory, such as the industrial Internet of things (IIoT) and cloud manufacturing (CMfg), enhances the ability of customer requirement automatic elicitation and the manufacturing process control. The job shop scheduling problem with a random job arrival time dramatically increases the difficulty in process management. Thus, how to collaboratively schedule the production and logistics resources in the shop floor is very challenging, and it has a fundamental and practical significance of achieving the competitiveness for an enterprise. To address this issue, the real-time model of production and logistics resources is built firstly. Then, the task entropy model is built based on the task information. Finally, the real-time self-adaption collaboration of production and logistics resources is realized. The proposed algorithm is carried out based on a practical case to evaluate its effectiveness. Experimental results show that our proposed algorithm outperforms three existing algorithms.
| S-EPMC7472176 | biostudies-literature
Project description:Children seem able to efficiently interpret a variety of linguistic cues during speech comprehension, yet have difficulty interpreting sources of nonlinguistic and paralinguistic information that accompany speech. The current study asked whether (paralinguistic) voice-activated role knowledge is rapidly interpreted in coordination with a linguistic cue (a sentential action) during speech comprehension in an eye-tracked sentence comprehension task with children (ages 3-10 years) and college-aged adults. Participants were initially familiarized with 2 talkers who identified their respective roles (e.g., PRINCESS and PIRATE) before hearing a previously introduced talker name an action and object ("I want to hold the sword," in the pirate's voice). As the sentence was spoken, eye movements were recorded to 4 objects that varied in relationship to the sentential talker and action (target: SWORD, talker-related: SHIP, action-related: WAND, and unrelated: CARRIAGE). The task was to select the named image. Even young child listeners rapidly combined inferences about talker identity with the action, allowing them to fixate on the target before it was mentioned, although there were developmental and vocabulary differences on this task. Results suggest that children, like adults, store real-world knowledge of a talker's role and actively use this information to interpret speech.
| S-EPMC4634560 | biostudies-literature
Project description:It is an open question how fast information processing can be performed and whether quantum effects can speed up the best existing solutions. Signal extraction, analysis, and compression in diagnostics, astronomy, chemistry, and broadcasting build on the discrete Fourier transform. It is implemented with the fast Fourier transform (FFT) algorithm that assumes a periodic input of specific lengths, which rarely holds true. A lesser-known transform, the Kravchuk-Fourier (KT), allows one to operate on finite strings of arbitrary length. It is of high demand in digital image processing and computer vision but features a prohibitive runtime. Here, we report a one-step computation of a fractional quantum KT. The quantum d-nary (qudit) architecture we use comprises only one gate and offers processing time independent of the input size. The gate may use a multiphoton Hong-Ou-Mandel effect. Existing quantum technologies may scale it up toward diverse applications.
| S-EPMC6641944 | biostudies-literature
Project description:Many natural processes rely on optimizing the success ratio of a search process. We use an experimental setup consisting of a simple online game in which players have to find a target hidden on a board, to investigate how the rounds are influenced by the detection of cues. We focus on the search duration and the statistics of the trajectories traced on the board. The experimental data are explained by a family of random-walk-based models and probabilistic analytical approximations. If no initial information is given to the players, the search is optimized for cues that cover an intermediate spatial scale. In addition, initial information about the extension of the cues results, in general, in faster searches. Finally, strategies used by informed players turn into non-stationary processes in which the length of e ach displacement evolves to show a well-defined characteristic scale that is not found in non-informed searches.
| S-EPMC5216393 | biostudies-literature
Project description:This paper considers single machine scheduling and due date assignment with setup time. The setup time is proportional to the length of the already processed jobs; that is, the setup time is past-sequence-dependent (p-s-d). It is assumed that a job's processing time depends on its position in a sequence. The objective functions include total earliness, the weighted number of tardy jobs, and the cost of due date assignment. We analyze these problems with two different due date assignment methods. We first consider the model with job-dependent position effects. For each case, by converting the problem to a series of assignment problems, we proved that the problems can be solved in O(n(4)) time. For the model with job-independent position effects, we proved that the problems can be solved in O(n(3)) time by providing a dynamic programming algorithm.
| S-EPMC4167446 | biostudies-other
Project description:Citations play an important role in medical and scientific databases by indicating the authoritative source of the data. Manual citation entry is tedious and prone to errors. We describe a method and make available computer scripts which automate the process of citation entry. We use an open citation project PERL module (PARSER) for parsing citation data that is then used to retrieve PubMed records to supply the (validated) reference. Our PERL scripts are available via a link in the web references section of this article.
| S-EPMC3752282 | biostudies-literature
Project description:We consider a single-machine two-agent problem where the objective is to minimize a weighted combination of the total completion time and the total tardiness of jobs from the first agent given that no tardy jobs are allowed for the second agent. A branch-and-bound algorithm is developed to derive the optimal sequence and two simulated annealing heuristic algorithms are proposed to search for the near-optimal solutions. Computational experiments are also conducted to evaluate the proposed branch-and-bound and simulated annealing algorithms.
| S-EPMC3915531 | biostudies-other
Project description:When humans attempt to perform two tasks at once, execution of the first task usually leads to postponement of the second one. This task delay is thought to result from a bottleneck occurring at a central, amodal stage of information processing that precludes two response selection or decision-making operations from being concurrently executed. Using time-resolved functional magnetic resonance imaging (fMRI), here we present a neural basis for such dual-task limitations, e.g. the inability of the posterior lateral prefrontal cortex, and possibly the superior medial frontal cortex, to process two decision-making operations at once. These results suggest that a neural network of frontal lobe areas acts as a central bottleneck of information processing that severely limits our ability to multitask.
| S-EPMC2527865 | biostudies-literature
Project description:An unknown quantum state cannot be copied and broadcast freely due to the no-cloning theorem. Approximate cloning schemes have been proposed to achieve the optimal cloning characterized by the maximal fidelity between the original and its copies. Here, from the perspective of quantum Fisher information (QFI), we investigate the distribution of QFI in asymmetric cloning machines which produce two nonidentical copies. As one might expect, improving the QFI of one copy results in decreasing the QFI of the other copy. It is perhaps also unsurprising that asymmetric phase-covariant cloning outperforms universal cloning in distributing QFI since a priori information of the input state has been utilized. However, interesting results appear when we compare the distributabilities of fidelity (which quantifies the full information of quantum states), and QFI (which only captures the information of relevant parameters) in asymmetric cloning machines. Unlike the results of fidelity, where the distributability of symmetric cloning is always optimal for any d-dimensional cloning, we find that any asymmetric cloning outperforms symmetric cloning on the distribution of QFI for d ≤ 18, whereas some but not all asymmetric cloning strategies could be worse than symmetric ones when d > 18.
| S-EPMC4258659 | biostudies-other