全文获取类型
收费全文 | 154篇 |
免费 | 5篇 |
国内免费 | 3篇 |
学科分类
工业技术 | 162篇 |
出版年
2023年 | 2篇 |
2022年 | 11篇 |
2021年 | 9篇 |
2020年 | 4篇 |
2019年 | 7篇 |
2018年 | 8篇 |
2017年 | 7篇 |
2016年 | 5篇 |
2015年 | 3篇 |
2014年 | 9篇 |
2013年 | 14篇 |
2012年 | 10篇 |
2011年 | 10篇 |
2010年 | 8篇 |
2009年 | 6篇 |
2008年 | 6篇 |
2007年 | 2篇 |
2006年 | 2篇 |
2005年 | 3篇 |
2003年 | 8篇 |
2002年 | 2篇 |
2000年 | 2篇 |
1999年 | 3篇 |
1998年 | 2篇 |
1997年 | 3篇 |
1996年 | 1篇 |
1995年 | 3篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1970年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有162条查询结果,搜索用时 18 毫秒
1.
2.
Algorithms and complexity concerning the preemptive scheduling of periodic,real-time tasks on one processor 总被引:6,自引:2,他引:4
We investigate the preemptive scheduling of periodic, real-time task systems on one processor. First, we show that when all parameters to the system are integers, we may assume without loss of generality that all preemptions occur at integer time values. We then assume, for the remainder of the paper, that all parameters are indeed integers. We then give, as our main lemma, both necessary and sufficient conditions for a task system to be feasible on one processor. Although these conditions cannot, in general, be tested efficiently (unless P=NP), they do allow us to give efficient algorithms for deciding feasibility on one processor for certain types of periodic task systems. For example, we give a pseudo-polynomial-time algorithm for synchronous systems whose densities are bounded by a fixed constant less than 1. This algorithm represents an exponential improvement over the previous best algorithm. We also give a polynomial-time algorithm for systems having a fixed number of distinct types of tasks. Furthermore, we are able to use our main lemma to show that the feasibility problem for task systems on one processor is co-NP-complete in the strong sence. In order to show this last result, we first show the Simultaneous Congruences Problem to be NP-complete in the strong sense. Both of these last two results answer questions that have been open for ten years. We conclude by showing that for incomplete task systems, that is, task systems in which the start times are not specified, the feasibility problem is
2
p
-complete.This work was supported in part by National Science Foundation Grant No. CCR-8711579. Some of these results were presented at the 15th Symposium on Mathematical Foundations of Computer Science, 1990. 相似文献
3.
Sanjoy Chakraborty Apu Kumar Saha Ratul Chakraborty Moumita Saha Sukanta Nama 《国际智能系统杂志》2022,37(1):52-104
The search for food stimulated by hunger is a common phenomenon in the animal world. Mimicking the concept, recently, an optimization algorithm Hunger Games Search (HGS) has been proposed for global optimization. On the other side, the Whale Optimization Algorithm (WOA) is a commonly utilized nature-inspired algorithm portrayed by a straightforward construction with easy parameters imitating the hunting behavior of humpback whales. However, due to minimum exploration of the search space, WOA has a high chance of trapping into local solutions, and more exploitation leads it towards premature convergence. The concept of hunger from HGS is merged with the food searching techniques of the whale to lessen the inherent drawbacks of WOA. Two weights of HGS are adaptively designed for every whale using the respective hunger level for balancing search strategies. Performance verification of the proposed hunger search-based whale optimization algorithm (HSWOA) is done by comparing it with 10 state-of-the-art algorithms, including three very recently developed algorithms on 30 classical benchmark functions. Comparison with some basic algorithms, recently modified algorithms, and WOA variants is performed using IEEE CEC 2019 function set. Statistical performance of the proposed algorithm is verified with Friedman's test, boxplot analysis, and Nemenyi multiple comparison test. The operating speed of the algorithm is determined and tested with complexity analysis and convergence analysis. Finally, seven real-world engineering problems are solved and compared with a list of metaheuristic algorithms. Numerical and statistical performance comparison with state-of-the-art algorithms confirms the efficacy of the newly designed algorithm. 相似文献
4.
The feasibility of general task systems with precedence constraints on multiprocessor platforms 总被引:1,自引:1,他引:0
Feasibility analysis determines (prior to system execution-time) whether a specified collection of hard-real-time jobs executed
on a processing platform can meet all deadlines. In this paper, we derive near-optimal sufficient tests for determining whether
a given collection of jobs can feasibly meet all deadlines upon a specified multiprocessor platform assuming job migration
is permitted. The collection of jobs may contain precedence constraints upon the order of execution of these jobs. The derived
tests are general enough to be applied even when the collection of jobs is incompletely specified. We discuss the applicability
of these tests to the scheduling of collections of jobs that are generated by systems of recurrent real-time tasks. We also
show that our feasibility conditions may be used to obtain global-EDF schedulability conditions.
相似文献
Sanjoy BaruahEmail: |
5.
Sumit Misra Sanjoy Kumar Saha Chandan Mazumdar 《Innovations in Systems and Software Engineering》2017,13(4):261-269
Multiple data streams coming out of a complex system form the observable state of the system. The streams may correspond to various sensors attached with the system or outcome of internal processes. Such stream data may consist of multiple attributes and may differ in terms of their frequency of generation and observation. The streams may have dependency among themselves. One will have to rely on such data streams for monitoring the health of the system or to take any corrective measure. Predicting the value of certain stream data is an important task that can help one to take decision and act accordingly. In this work, a simple but generic visualization of a complex system is presented and thereafter a linear regression-based dynamic model for short-term prediction is proposed. The model is based on the past history of the attributes of multiple streams as suggested by the domain experts. But, it automatically determines the meaningful attributes and reformulates the model. The model is also re-computed if the prediction error exceeds the allowable tolerance. All these make the model dynamic. Experiment is carried out with stock market data streams to predict the close value well in advance. It is observed that in terms of quality of prediction and performance metric, the proposed model is quite effective. 相似文献
6.
Houxiang Kang Ye Peng Kangyu Hua Yufei Deng Maria Bellizzi Dipali Rani Gupta Nur Uddin Mahmud Alfredo S.Urashima Sanjoy Kumar Paul Gary Peterson Yilin Zhou Xueping Zhou Md Tofazzal Islam Guo-Liang Wang 《工程(英文)》2021,7(9):1326-1335
Wheat blast, caused by the fungus Magnaporthe oryzae Triticum (MoT) pathotype, is a devastating disease persistent in South America and Bangladesh. Since MoT generally fails to cause visual symptoms in wheat until the heading stage when the infection would have advanced, disease control by fungicide application solely based on the detection of visual symptoms is ineffective. To develop an accurate and sensitive method to detect MoT at the seedling and vegetative stages for disease control, we sequenced the genomes of two MoT isolates from Brazil and identified two DNA fragments, MoT-6098 and MoT-6099, that are present in the MoT genome but not in the genome of the rice-infecting Magnaporthe oryzae Oryzae (MoO) pathotype. Using polymerase chain reaction (PCR), we confirmed the specificity of the two markers in 53 MoT and MoO isolates from South America and Bangladesh. To test the efficiency of the two markers, we first established a loop-mediated isothermal amplification (LAMP) method to detect MoT at isothermal conditions, without the use of a PCR machine. Following this, we used the Cas12a protein and guide RNAs (gRNAs) to target the MoT-6098 and MoT-6099 sequences. The activated Cas12a showed indiscriminate single-stranded deoxyribonuclease (ssDNase) activity. We then combined target-dependent Cas12a ssDNase activation with recombinase polymerase amplification (RPA) and nucleic acid lateral flow immunoassay (NALFIA) to develop a method that accurately, sensitively, and cost-effectively detects MoT-specific DNA sequences in infected wheat plants. This novel technique can be easily adapted for the rapid detection of wheat blast and other important plant diseases in the field. 相似文献
7.
Choudhury Alokeparna Samanta Sourav Pratihar Sanjoy Bandyopadhyay Oishila 《Applied Intelligence》2022,52(7):7339-7372
Applied Intelligence - Microscopic Image segmentation has a crucial role in detecting and diagnosing numerous critical diseases like Alzheimer’s disease, Kidney disease, Cancer, many... 相似文献
8.
The recurring real-time task model for hard-real-time task is studied from a feasibility-analysis perspective. This model generalizes earlier models such as the sporadic task model and the generalized multiframe task model. Algorithms are presented for the static-priority and dynamic-priority feasibility-analysis of systems of independent recurring real-time tasks in a preemptive uniprocessor environment. 相似文献
9.
Pure carbon dioxide was absorbed into distilled water and sodium hydroxide solution, in cocurrent two phase annular flow in helically coiled tubes in order to measure physical and chemical mass transfer coefficients and interfacial areas. (k*La) was correlated by the pressure drop in the test sections and interfacial areas were found to vary with the liquid phase energy dissipation. According to a new theory, (k*L) has been shown to be a function of the root mean square vorticity near the interface. The root mean square vorticity has been related to the pressure drop, gas density, liquid flow rate and liquid velocity. The physical mass transfer coefficients theoretically predicted are in good agreement with experimental results. 相似文献
10.