期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到3,817篇文章
< 1 2 … 191 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Modeling and Optimization of Diffusion Process Scheduling under Strict Queue Time Constraints in Semiconductor Manufacturing 认领 引用
1
作者 Liangchao Chen Yan Qiao +3 位作者 Siwei Zhang Bin Liu Yonghua Shao Sijun Zhan 《Computer Modeling in Engineering & Sciences》 SCIE EI 2026年第4期488-519,共32页
This article examines wafer lots scheduling in the diffusion area in semiconductor manufacturing.The diffusion area comprises multiple tool groups.Each of them contains non-identical semiconductor tools.All tools can ... This article examines wafer lots scheduling in the diffusion area in semiconductor manufacturing.The diffusion area comprises multiple tool groups.Each of them contains non-identical semiconductor tools.All tools can process multiple wafer lots simultaneously,and wafer lots processed together in a tool are called a wafer batch.Besides,each wafer lot has specific queue time limits(QTLs)between consecutive processing operations,making the scheduling problem more complicated.To solve it,a discrete backtracking search optimization algorithm(DBSA)is designed for optimizing both wafer lot assignments and wafer batch processing sequences.Once the processing sequence of wafer batches at each tool is determined,a linear program(LP)is built to obtain optimal starting and completion time points of wafer batches while satisfying QTLs.If a schedule is examined to have no feasible solution by the LP,a proposed approach is used to regroup wafer lots to form wafer batches and adjust their processing sequences to potentially make it feasible.Extensive experiments show that DBSA reliably produces feasible schedules and outperforms GA,MixPSO,and GWO,with up to 17.75%,19.19%,and 9.21%reductions in average cycle time,respectively,demonstrating its superiority in both solution quality and practical applicability. 展开更多
关键词 Metaheuristic algorithms queue time limits scheduling semiconductor manufacturing
暂未订购 下载PDF
AoI-Driven Queue Management and Power Control in V2V Networks:A GNN-Enhanced MARL Approach 认领 引用
2
作者 Fang Hao Li Xiao +2 位作者 Guo Chongtao Liang Le Jin Shi 《China Communications》 SCIE EI CSCD 2026年第4期292-311,共20页
Queue management and resource allocation play a critical role in enabling cooperative status awareness in vehicular networks.This paper investigates the problem of age of information(AoI)-aware status updates in vehic... Queue management and resource allocation play a critical role in enabling cooperative status awareness in vehicular networks.This paper investigates the problem of age of information(AoI)-aware status updates in vehicle-to-vehicle(V2V)communication,where each vehicle’s status is represented by multiple interdependent packets.To enable fine-grained queue management at the packet level under resource constraints,we formulate a joint optimization problem that simultaneously learns active packet dropping and transmit power control strategies.A hybrid action space is designed to support both discrete dropping decisions and continuous power control.To exploit the graphstructured interference inherent in V2V topology,a graph neural network(GNN)is introduced to aggregate slowly varying large-scale fading,allowing agents to capture topological dependencies implicitly without frequent message exchange.The overall framework is built upon multi-agent proximal policy optimization(MAPPO),with centralized training and decentralized execution(CTDE).Simulations demonstrate that the proposed method significantly reduces average AoI across a wide range of network densities,channel conditions,and traffic loads,consistently outperforming several baselines. 展开更多
关键词 age of information graph neural network multi-agent proximal policy optimization queue management resource allocation vehicular networks
暂未订购 下载PDF
A GATED SERVICE SINGLE VACATION M/G/1 QUEUE SYSTEM WITH SETUP AND CLOSEDOWN TIMES AND DIFFERENT CUSTOMER ARRIVAL RATES 认领 引用
3
作者 Ying SUN Zhanyou MA Tongyu XU 《Acta Mathematica Scientia》 SCIE CSCD 2026年第1期407-426,共20页
A gated service single vacation M/G/1 queue with setup and closedown periods,and different customer arrival rates,is studied in this paper.The probability generating function of the number of systems for customers who... A gated service single vacation M/G/1 queue with setup and closedown periods,and different customer arrival rates,is studied in this paper.The probability generating function of the number of systems for customers who are at the initial moment of service period is analyzed by using a total probability theorem,and the stability condition of the system is obtained.The stationary distribution of the queue length is solved by the regeneration cycle method.The stochastic decomposition of queue length in the steady state is calculated,and the service cycle is obtained.Moreover,classified discussions are established in order to solve the steady-state distribution for the waiting time.The variation of system performance indicators with parameters is analyzed by performing numerical experiments. 展开更多
关键词 different arrival rates regeneration cycle method stochastic decomposition theorem stationary queue length
暂未订购 下载PDF
Modeling Port Congestion Using Queueing Theory:The Case of the Autonomous Port of Conakry 认领 引用
4
作者 Abdoul Karim Diallo Coumba Diallo +1 位作者 Karamoko Sita Diallo Papa Ngom 《Journal of Applied Mathematics and Physics》 2026年第1期122-138,共17页
This article highlights the relevance of queuing theory as a decision-making tool for solving congestion problems in Guinean ports,particularly of the Autonomous Port of Conakry(APC).Port congestion,which often causes... This article highlights the relevance of queuing theory as a decision-making tool for solving congestion problems in Guinean ports,particularly of the Autonomous Port of Conakry(APC).Port congestion,which often causes delays and additional logistics costs,is a major obstacle to economic development.Using an analytical approach and numerical simulation,the study proposes a realistic model of the operation of the APC container terminal based on the GI/GI/c general queuing model,adapted to complex systems where the distributions of arrivals and services are not necessarily exponential.The Statistical tests performed on empirical data from the year 2023 revealed that ship interarrival times follow a Weibull distribution,while service times are well described by a Gamma distribution.Integrating these distributions into the GI/GI/c framework enabled realistic simulation of the port system’s behavior.The simulation results show an average waiting time of about 1.4 days,a berth occupancy rate of 43%,and a high probability that the system is empty,indicating good operational fluidity.The average observed service rate,estimated at 0.033 ships/hour,demonstrates the port’s ability to efficiently handle vessels without generating congestion.These performances confirm the positioning of the Autonomous Por3t of Conakry,through its container terminal,among the most efficient in West Africa in 2023.The methodological approach developed in this paper,combining probabilistic modeling and simulation,can be extended to other ports in the region for comparative analysis,to support strategic planning of port infrastructure,and to guide decision-making regarding investment and capacity optimization. 展开更多
关键词 Queuing Theory Autonomous Port of Conakry Container Terminal Port Congestion Queue Modeling
Stochastic interpretation for a single server retrial queue with Bernoulli feedback and negative customers 认领 引用
5
作者 Mohamed Boualem Amina Angelika Bouchentouf +1 位作者 Aicha Bareche Mouloud Cherfaoui 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2025年第1期1-19,共19页
In this paper,we introduce a qualitative analysis in order to study the monotonicity and comparability properties of a single-server retrial queueing model with Bernoulli feedback and negative customers,relative to st... In this paper,we introduce a qualitative analysis in order to study the monotonicity and comparability properties of a single-server retrial queueing model with Bernoulli feedback and negative customers,relative to stochastic orderings.Performance measures of such a system are available explicitly,while their forms are cumbersome(these formulas include integrals of Laplace transform,solutions of functional equations,etc.).Therefore,they are not exploitable from the application point of view.To overcome these difficulties,we present stochastic comparison methods in order to get qualitative estimates of these measures.In particular,we prove the monotonicity of the transition operator of the embedded Markov chain.In addition,we establish conditions for which transition operators as well as stationary probabilities,associated with two embedded Markov chains,having the same structure but with different parameters,are comparable relative to the given stochastic orderings.Further,numerical examples are carried out to illustrate the theoretical results. 展开更多
关键词 retrial queueing models negative arrivals stochastic orderings monotonicity simulation
暂未订购 下载PDF
Equilibrium Strategies in M/M/1 Retrial Queues with Variable Service Rate 认领 引用
6
作者 LIU Yuanyuan YAN Zhaozeng YANG Qin 《应用概率统计》 CSCD 北大核心 2025年第3期448-466,共19页
We consider a single server constant retrial queue,in which a state-dependent service policy is used to control the service rate.Customer arrival follows Poisson process,while service time and retrial time are exponen... We consider a single server constant retrial queue,in which a state-dependent service policy is used to control the service rate.Customer arrival follows Poisson process,while service time and retrial time are exponential distributions.Whenever the server is available,it admits the retrial customers into service based on a first-come first-served rule.The service rate adjusts in real-time based on the retrial queue length.An iterative algorithm is proposed to numerically solve the personal optimal problem in the fully observable scenario.Furthermore,we investigate the impact of parameters on the social optimal threshold.The effectiveness of the results is illustrated by two examples. 展开更多
关键词 variable service rate retrial queues real-time adaptability equilibrium strategies algorithm
暂未订购 下载PDF
A Service Ratio-Based Dynamic Fair Queueing Algorithm for Packet-Switching Networks 认领 引用
7
作者 尹德斌 谢剑英 +2 位作者 张燕 吴健珍 孙华丽 《Journal of Donghua University(English Edition)》 EI CAS 2008年第2期187-194,共8页
A new weighted fair queueing algorithm is proposed, which uses the novel flow-based service ratio parameters to schedule flows. This solves the main drawback of traditional weighted fair queneing algorithms- the packe... A new weighted fair queueing algorithm is proposed, which uses the novel flow-based service ratio parameters to schedule flows. This solves the main drawback of traditional weighted fair queneing algorithms- the packet-based calculation of the weight parameters. In addition, this paper proposes a novel service ratio calculation method and a queue mangement technology. The former adjusts the service ratio parameters adaptively based on the dynamics of the packet lengths and thee solves the unfairness problem induced by the variable packet length. The latter improves the utilization of the server＇s queue buffer and reduces the delay jitter through restricting the buffer length for each flow. 展开更多
关键词 weighted fair queueing queue scheduling packet switching network service ratio
暂未订购 下载PDF
Analytical Modeling of a Multi-queue Nodes Network Router 认领 引用
8
作者 Hussein Al-Bahadili Jafar Ababneh Fadi Thabtah 《International Journal of Automation and computing》 2011年第4期459-464,共6页
This paper presents the derivation of an analytical model for a multi-queue nodes network router, which is referred to as the multi-queue nodes （mQN） model. In this model, expressions are derived to calculate two pe... This paper presents the derivation of an analytical model for a multi-queue nodes network router, which is referred to as the multi-queue nodes （mQN） model. In this model, expressions are derived to calculate two performance metrics, namely, the queue node and system utilization factors. In order to demonstrate the flexibility and effectiveness of the mQN model in analyzing the performance of an mQN network router, two scenarios are performed. These scenarios investigated the variation of queue nodes and system utilization factors against queue nodes dropping probability for various system sizes and packets arrival routing probabilities. The performed scenarios demonstrated that the mQN analytical model is more flexible and effective when compared with experimental tests and computer simulations in assessing the performance of an mQN network router. 展开更多
关键词 Congested networks network routers active queue managements multi-queue nodes （mQN） systems analytical model- ing utilization factor.
暂未订购 下载PDF
High Throughput Scheduling Algorithms for Input Queued Packet Switches 认领 引用 被引量：4
9
作者 R.Chithra Devi D.Jemi Florinabel Narayanan Prasanth 《Computers, Materials & Continua》 SCIE EI 2022年第1期1527-1540,共14页
The high-performance computing paradigm needs high-speed switching fabrics to meet the heavy traffic generated by their applications.These switching fabrics are efficiently driven by the deployed scheduling algorithms... The high-performance computing paradigm needs high-speed switching fabrics to meet the heavy traffic generated by their applications.These switching fabrics are efficiently driven by the deployed scheduling algorithms.In this paper,we proposed two scheduling algorithms for input queued switches whose operations are based on ranking procedures.At first,we proposed a Simple 2-Bit(S2B)scheme which uses binary ranking procedure and queue size for scheduling the packets.Here,the Virtual Output Queue(VOQ)set with maximum number of empty queues receives higher rank than other VOQ’s.Through simulation,we showed S2B has better throughput performance than Highest Ranking First(HRF)arbitration under uniform,and non-uniform traffic patterns.To further improve the throughput-delay performance,an Enhanced 2-Bit(E2B)approach is proposed.This approach adopts an integer representation for rank,which is the number of empty queues in a VOQ set.The simulation result shows E2B outperforms S2B and HRF scheduling algorithms with maximum throughput-delay performance.Furthermore,the algorithms are simulated under hotspot traffic and E2B proves to be more efficient. 展开更多
关键词 Crossbar switch input queued switch virtual output queue scheduling algorithm high performance computing
暂未订购 下载PDF
The queueing model for quantum key distribution network 认领 引用 被引量：7
10
作者 温浩 韩正甫 +1 位作者 郭光灿 洪佩琳 《Chinese Physics B》 SCIE EI CAS 2009年第1期46-50,共5页
This paper develops a QKD （quantum key distribution）-based queueing model to investigate the data delay on QKD link and network, especially that based on trusted relays. It shows the mean packet delay performance of... This paper develops a QKD （quantum key distribution）-based queueing model to investigate the data delay on QKD link and network, especially that based on trusted relays. It shows the mean packet delay performance of the QKD system. Furthermore, it proposes a key buffering policy which could effectively improve the delay performance in practice. The results will be helpful for quality of service in practical QKD systems. 展开更多
关键词 quantum key distribution quantum cryptography quantum network queueing model
暂未订购 下载PDF
TRANSIENT SOLUTION FOR QUEUE-LENGTH DISTRIBUTION OF Geometry/G/1 QUEUEING MODEL 认领 引用 被引量：11
11
作者 Luo Chuanyi Tang Yinghui Liu Renbin 《Applied Mathematics(A Journal of Chinese Universities)》 2007年第1期95-100,共6页
In this paper, the Geometry/G/1 queueing model with inter-arrival times generated by a geometric（parameter p） distribution according to a late arrival system with delayed access and service times independently distr... In this paper, the Geometry/G/1 queueing model with inter-arrival times generated by a geometric（parameter p） distribution according to a late arrival system with delayed access and service times independently distributed with distribution {gj }, j≥ 1 is studied. By a simple method （techniques of probability decomposition, renewal process theory） that is different from the techniques used by Hunter（1983）, the transient property of the queue with initial state i（i ≥ 0） is discussed. The recursion expression for u -transform of transient queue-length distribution at any time point n^＋ is obtained, and the recursion expression of the limiting queue length distribution is also obtained. 展开更多
关键词 discrete time queue u-transform transient distribution, stationary distribution, recursion expression.
暂未订购 下载PDF
The Efect of Queueing Strategy on Network Trafc 认领 引用 被引量：3
12
作者 张学军 管祥民 +1 位作者 孙登峰 唐绍婷 《Communications in Theoretical Physics》 SCIE CAS CSCD 2013年第10期496-502,共7页
In recent years, the transportation system has been faced by increasing challenge in congestion and inefficiency, and research in traffic network has become a significant area of interest. In this paper, we introduce ... In recent years, the transportation system has been faced by increasing challenge in congestion and inefficiency, and research in traffic network has become a significant area of interest. In this paper, we introduce a dynamic-information-based （DIB） queueing strategy into network traffic model under the efficient routing strategy. DIB makes a packet with higher priority to be delivered if there are less packets travelling along its path from the current node to the destination. It is found that, compared with the traditional first-in-first-out （FIFO） queueing strategy, DIB can effectively bMance the traffic load of the system via delaying packets to be delivered to congested nodes. Although the network capacity has no obvious changes, some other indexes which reflect transportation efficiency are efficiently improved in the congestion state. Besides, extensive simulation results and discussions are provided to explain the phenomena. The results may provide novel insights for research on traffic systems. 展开更多
关键词 networked traffic complex network queueing strategy scale-free network
暂未订购 下载PDF
A FUZZY-LOGIC CONTROL ALGORITHM FOR ACTIVE QUEUE MANAGEMENT IN IP NETWORKS 认领 引用 被引量：11
13
作者 Liu Weiyan Zhang Shunyi +1 位作者 Zhang Mu Liu Tao 《Journal of Electronics(China)》 2008年第1期102-107,共6页
Active Queue Management (AQM) is an active research area in the Internet community. Random Early Detection (RED) is a typical AQM algorithm, but it is known that it is difficult to configure its parameters and its ave... Active Queue Management (AQM) is an active research area in the Internet community. Random Early Detection (RED) is a typical AQM algorithm, but it is known that it is difficult to configure its parameters and its average queue length is closely related to the load level. This paper proposes an effective fuzzy congestion control algorithm based on fuzzy logic which uses the pre- dominance of fuzzy logic to deal with uncertain events. The main advantage of this new congestion control algorithm is that it discards the packet dropping mechanism of RED, and calculates packet loss according to a preconfigured fuzzy logic by using the queue length and the buffer usage ratio. Theo- retical analysis and Network Simulator (NS) simulation results show that the proposed algorithm achieves more throughput and more stable queue length than traditional schemes. It really improves a router's ability in network congestion control in IP network. 展开更多
关键词 Congestion control Fuzzy logic AQM （Active Queue Management） RED （Random Early Detection） IP network
暂未订购 下载PDF
Another Fast and Simple DEM Depression-Filling Algorithm Based on Priority Queue Structure 认领 引用 被引量：4
14
作者 LIU Yong-He ZHANG Wan-Chang XU Jing-Wen 《Atmospheric and Oceanic Science Letters》 2009年第4期214-219,共6页
Some depression cells with heights lower than their surrounding cells may often be found in Grid-based digital elevation models (DEM) dataset due to sampling errors.The depression-filling algorithm presented by Planch... Some depression cells with heights lower than their surrounding cells may often be found in Grid-based digital elevation models (DEM) dataset due to sampling errors.The depression-filling algorithm presented by Planchon and Darboux works very quickly compared to other published methods.Despite its simplicity and deli-cacy,this algorithm remains difficult to understand due to its three complex subroutines and its recursive execution.Another fast algorithm is presented in this article.The main idea of this new algorithm is as follows:first,the DEM dataset is viewed as an island and the outer space as an ocean;when the ocean level increases,the DEM cells on the island's boundary will be inundated;when a cell is inundated for the first time,its elevation is increased to the ocean level at that moment;after the ocean has inun-dated the entire DEM,all of the depressions are filled.The depression-removing processing is performed using a priority queue.Theoretically,this new algorithm is a fast algorithm despite the fact that it runs more slowly than Planchon and Darboux's method.Its time-complexity in both the worst case and in an average case is O(8nlog 2 (m)),which is close to O(n).The running speed of this algorithm depends mainly on the insertion operation of the priority queue.As shown by the tests,the depres-sion-filling effects of this algorithm are correct and valid,and the overall time consumption of this algorithm is less than twice the time consumed by Planchon & Darboux's method for handling a DEM smaller than 2500×2500 cells.More importantly,this new algorithm is simpler and easier to understand than Planchon and Darboux's method This advantage allows the correct program code to be written quickly. 展开更多
关键词 digital elevation models depression removing priority queue quick algorithm
暂未订购 下载PDF
FUNCTIONAL ANALYSIS METHOD FOR THE M/G/1 QUEUEING MODEL WITH OPTIONAL SECOND SERVICE 认领 引用 被引量：5
15
作者 艾尼.吾甫尔 艾合买提.卡斯木 《Acta Mathematica Scientia》 SCIE CSCD 2014年第4期1301-1330,共30页
By studying the spectral properties of the underlying operator corresponding to the M/G/1 queueing model with optional second service we obtain that the time-dependent solution of the model strongly converges to its s... By studying the spectral properties of the underlying operator corresponding to the M/G/1 queueing model with optional second service we obtain that the time-dependent solution of the model strongly converges to its steady-state solution. We also show that the time-dependent queueing size at the departure point converges to the corresponding steady-state queueing size at the departure point. 展开更多
关键词 M/G/1 queueing model with optional second service eigenvalue resolvent set
暂未订购 下载PDF
Dynamic properties of chasers in a moving queue based on a delayed chasing model 认领 引用 被引量：1
16
作者 郭宁 丁建勋 +2 位作者 凌翔 石琴 Reinhart Kühne 《Chinese Physics B》 SCIE EI CAS CSCD 2016年第5期106-110,共5页
A delayed chasing model is proposed to simulate the chase behavior in the queue, where each member regards the closest one ahead as the target, and the leader is attracted to a target point with slight fluctuation. Wh... A delayed chasing model is proposed to simulate the chase behavior in the queue, where each member regards the closest one ahead as the target, and the leader is attracted to a target point with slight fluctuation. When the initial distances between neighbors possess an identical low value, the fluctuating target of the leader can cause an amplified disturbance in the queue. After a long period of time, the queue recovers the stable state from the disturbance, forming a straightline-like pattern again, but distances between neighbors grow. Whether the queue can keep stable or not depends on initial distance, desired velocity, and relaxation time. Furthermore, we carry out convergence analysis to explain the divergence transformation behavior and confirm the convergence conditions, which is in approximate agreement with simulations. 展开更多
关键词 chase queue disturbance convergence analysis
暂未订购 下载PDF
THE TRANSIENT SOLUTION FOR M/G/1 QUEUEWITH SERVER VACATIONS 认领 引用 被引量：16
17
作者 唐应辉 《Acta Mathematica Scientia》 SCIE 1997年第3期276-282,共7页
In this paper, the transient solutions for M/G/1 queues with single server vacation and multiple server vacations are firstly studied, and the recursion expressions of their Laplace transform are given. Further the di... In this paper, the transient solutions for M/G/1 queues with single server vacation and multiple server vacations are firstly studied, and the recursion expressions of their Laplace transform are given. Further the distribution and stochastic decomposition result of the queue length at a random point in equilibrium are directly obtained from the transient solution. As will be seen this paper provides a intuitive and elegant method for studying transient solutions for M/G/1 queues with single server. 展开更多
关键词 server-vacation queue length transient solution stochastic decomposition
暂未订购 下载PDF
THE QUEUE-LENGTH DISTRIBUTION FOR M^x/G/1 QUEUE WITH SINGLE SERVER VACATION 认领 引用 被引量：2
18
作者 唐应辉 唐小我 《Acta Mathematica Scientia》 SCIE 2000年第3期397-408,共12页
This paper studies the bulk-arrival M-x/G/1 queue with single server vacation. By introducing the server busy period and using the Laplace transform, the recursion expression of the Laplace transform of the transient ... This paper studies the bulk-arrival M-x/G/1 queue with single server vacation. By introducing the server busy period and using the Laplace transform, the recursion expression of the Laplace transform of the transient queue-length distribution is derived. Furthermore, the distribution and stochastic decomposition result of the queue length at a random point in equilibrium are obtained. Especially some results for the single-arrival M/G/1 queue with single server vacation and bulk-arrival M-x/G/1 queue but with no server vacation can be derived directly by the results obtained in this paper. 展开更多
关键词 server vacation queue length transient distribution equilibrium distribution stochastic decomposition
暂未订购 下载PDF
Queue reduction in discrete-event systems by relabeling 认领 引用 被引量：1
19
作者 Yongmei GAN Ting JIAO W. M. WONHAM 《Control Theory and Technology》 EI CSCD 2018年第3期232-240,共9页
The customer population of entities potentially requesting to join a queue for service often have identical structure, i.e., the same state set and isomorphic transitions. The state size of the automaton modeling a qu... The customer population of entities potentially requesting to join a queue for service often have identical structure, i.e., the same state set and isomorphic transitions. The state size of the automaton modeling a queue will grow rapidly with increase of the size of this population. However, by relabeling the queue arrival events and service events to the same symbols respectively, the automaton model of a queue will be converted to the structure of a buffer, which is proved to be independent of the total size of the customer population, as long as the queue size is held fixed. We propose the model of a dynamic buffer to embody order and shift of a queue. The result is applied to a manufacturing facility with a dynamic buffer to manage the repair of broken down machines. 展开更多
关键词 Queue relabeling identical structures invariance property discrete-event systems
Design of Queue for DNA-based Computer 认领 引用 被引量：2
20
作者 李汪根 丁永生 《Journal of Donghua University(English Edition)》 EI CAS 2006年第2期47-50,共4页
This paper discusses the design of the queue for DNA-based computer on the point view of data structure. The nucleotide encodings for all components of the queue are given out formally. The linear double-stranded DNA ... This paper discusses the design of the queue for DNA-based computer on the point view of data structure. The nucleotide encodings for all components of the queue are given out formally. The linear double-stranded DNA molecules are used as the storage structure of the queue, and the basic bio-operations over the queue are described. Furthermore, the comparison between the queue of the electronic computer and that of DNA-based computer are elucidated. To prove the feasibility of our work, nucleotide encodings for an instance of queue are given out. All the biological technology mentioned in this paper can be practically implemented in the laboratory. Based on this work, other data structures could be developed in DNA-based computer. 展开更多
关键词 data structure queue DNA-based computer.
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 191 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈