A novel integrated microfluidic chip for on-demand electrostatic droplet charging and sorting

On-demand droplet sorting is extensively applied for the efficient manipulation and genome-wide analysis of individual cells.However,state-of-the-art microfluidic chips for droplet sorting still suffer from low sorting speeds,sample loss,and labor-intensive preparation procedures.Here,we demonstrate the development of a novel microfluidic chip that integrates droplet generation,on-demand electrostatic droplet charging,and high-throughput sorting.The charging electrode is a copper wire buried above the nozzle of the microchannel,and the deflecting electrode is the phosphate buffered saline in the microchannel,which greatly simplifies the structure and fabrication process of the chip.Moreover,this chip is capable of high-frequency droplet generation and sorting,with a frequency of 11.757 kHz in the drop state.The chip completes the selective charging process via electrostatic induction during droplet generation.On-demand charged microdroplets can arbitrarilymove to specific exit channels in a three-dimensional(3D)-deflected electric field,which can be controlled according to user requirements,and the flux of droplet deflection is thereby significantly enhanced.Furthermore,a lossless modification strategy is presented to improve the accuracy of droplet deflection or harvest rate from 97.49% to 99.38% by monitoring the frequency of droplet generation in real time and feeding it back to the charging signal.This chip has great potential for quantitative processing and analysis of single cells for elucidating cell-to-cell variations.

Joint Optimization for on-Demand Deployment of UAVs and Spectrum Allocation in UAVs-Assisted Communication

To improve the efficiency and fairness of the spectrum allocation for ground communication assisted by unmanned aerial vehicles(UAVs),a joint optimization method for on-demand deployment and spectrum allocation of UAVs is proposed,which is modeled as a mixed-integer non-convex optimization problem(MINCOP).An algorithm to estimate the minimum number of required UAVs is firstly proposed based on the pre-estimation and simulated annealing.The MINCOP is then decomposed into three sub-problems based on the block coordinate descent method,including the spectrum allocation of UAVs,the association between UAVs and ground users,and the deployment of UAVs.Specifically,the optimal spectrum allocation is derived based on the interference mitigation and channel reuse.The association between UAVs and ground users is optimized based on local iterated optimization.A particle-based optimization algorithm is proposed to resolve the subproblem of the UAVs deployment.Simulation results show that the proposed method could effectively improve the minimum transmission rate of UAVs as well as user fairness of spectrum allocation.

A distributed on-demand bandwidth-constrained multicast routing protocol for wireless ad hoc networks

To meet the bandwidth requirement for the multicasting data flow in ad hoc networks, a distributed on- demand bandwidth-constrained multicast routing （BCMR） protocol for wireless ad hoc networks is proposed. With this protocol, the resource reservation table of each node will record the bandwidth requirements of data flows, which access itself, its neighbor nodes and hidden nodes, and every node calculates the remaining available bandwidth by deducting the bandwidth reserved in the resource reservation table from the total available bandwidth of the node. Moreover, the BCMR searches in a distributed manner for the paths with the shortest delay conditioned by the bandwidth constraint. Simulation results demonstrate the good performance of BCMR in terms of packet delivery reliability and the delay. BCMR can meet the requirements of real time communication and can be used in the multicast applications with low mobility in wireless ad hoc networks.

Comparative study of on-demand and daily use of sertraline in treatment of premature ejaculation:A randomized clinical trial

Objective:The intravaginal ejaculatory latency time(IELT)may increase less in on-demand compared to daily intake,but may fulfill a suitable treatment for specific patients.We decided to compare the efficacy and safety of on-demand and daily use of sertraline in order to find the most effective and least complicated method in treatment of premature ejaculation(PE).Methods:This study was parallel or concurrent control randomized clinical trial.Two hundred and forty patients with PE diagnosed by urologist in the two groups of 120 from July 2017 to February 2019 enrolled in the study.In the first group,it is prescribed 50 mg sertraline each 12 h daily and the second group received 50 mg 4 h before coitus for 4 and 8 weeks.The IELT before treatment and during all coitus after treatment were recorded by the patient’s wife with a stopwatch.Results:Mean IELT before,4 and 8 weeks after treatment in two groups were:On-demand group 101.62±65.44 s,208.75±128.02 s and 265.87±145.70 s;daily use group 102.50-81.22 s,276.87±181.08 s and 353.75±176.45 s,respectively.The ejaculation time increased significantly in both groups(p<0.05).However,increase in ejaculation time in daily use group was significantly higher than the on-demand group in 4 weeks(p=0.036),especially in 8 weeks(p=0.009).The percent of side effects in daily use group(26.7%)was higher than on-demand group(20%)(p<0.05).Drowsiness,diarrhea and vertigo were significantly higher in the daily use than on-demand(p<0.05).Conclusions:On-demand and daily use of sertraline are effective and usually have no serious complications,but the on-demand method is considerably more tolerable.In patients who did not tolerate to daily use of this drug,on-demand could be used as a salvage therapy.

Ants-Based On-Demand Routing Algorithm for Mobile Ad Hoc Networks

An ants-based on-demand routing algorithm （AORA） specialized for mobile ad hoc networks is proposed. AORA measures the network＇s traffic information including delivery time, route energy etc. by the continuous delivery of data packets, then calculates the compositive parameter for each route which can be seen as the stigmity and uses it to choose the comparatively optimal route in real time. To adjust the weight of each traffic information, the algorithm can meet the different demand of the network＇s user. Multipath source self repair routing （MSSRR） algorithm and dynamic source routing （DSR） can be seen as the special samples of AORA. The routing overhead is not increased in this algorithm. By using simulation, it can be seen that the performance of AORA is better than that of DSR in all scenarios obviously, especially the delivery fraction is increased by more than 100 96.

Network coding-aware cache replacement policy in on-demand broadcast environments

Network coding has been proved to be an effective technique in improving the performance of data broadcast systems because clients requesting different data items can be served simultaneously in one broadcast. Previous studies showed that its efficiency is highly related to the content of clients' cache. However, existing data broadcast systems do not take network coding information into account when making cache replacement decisions. In this paper, we propose two networks coding-aware cache replacement policies called DLRU and DLRU-CP to supplement network coding assisted data broadcast in on-demand broadcast environments. In DLRU, both data access and decoding contribution are taken into account to make replacement decisions. DLRU-CP is based on DLRU but allows clients to retrieve decodable data items that have not been requested yet. The performance gain of our proposed cache replacement policies over traditional cache replacement policy is shown in the simulation results, which demonstrate conclusively that the proposed policies can effectively reduce the overall response time.

On-Demand Service in Cloud Computing

Cloud computing provides a new paradigm for hardware and software infrastructure design as well as planning and usage of information systems. It offers flexible, efficient, inexpensive, and quality services. This paper proposes an on-demand service system using the cloud computing architecture and analyzes important issues such as organization, management, and monitoring of distributed service resources; context-aware on-demand service modeling, on-demand automated service composition in large-scale networks, and service system analysis based on complex system theory. Continuous Operating Reference Station （CORS） of a geo-spatial information system is taken as an example, and its architecture is analyzed from the perspective of cloud computing. Some fundamental questions are raised about its service.

Route maintenance of on-demand routing protocol in mobile ad hoc networks

In mobile ad hoc networks （MANETs）, if a mnltihop route breaks, route maintenance is typically performed to establish a new route which causes high control overhead and long packet delay. To decrease the time of recovery and the overhead of maintenance, a new route maintenance mechanism in which the maintenance is confined to the vicinity of the broken link is proposed. This mechanism patches broken route through some other nodes in which only nodes near the broken link（s） may need to be substituted and the rest of nodes can be retained on the route. The broken link can be repaired without considering its relative position in the whole path, so the abihty of dealing with hnk failure is improved obviously. Simulation results show that the proposed strategy improves network performance significantly, such as in merits of control overhead and packet delay.

Topology Control for Ad-Hoc Networks: A Comprehensive Review for Table Driven and On-Demand Routing Protocols

Routing on ad-hoc network has become a major research issue among the networking communities due to its increasing complexity and the surge of challenging problems. One major factor contributing to this tendency is that every terminal of an ad-hoc network is also functioning as a network router. In this paper we provide a comprehensive review about the principles and mechanisms of routing protocols used in ad-hoc networks. For comparison purposes, we discuss some relevant technical issues of two well-known routing strategies, namely On-Demand (Proactive routing) and Table-Driven (Reactive routing). In particular, focus our attention on two major and well-known routing protocols: AODV (Ad-hoc On-Demand Distance Vector Protocol) and OLSR (Optimized Link State Routing Protocol). Our study has no intention to suggest any definite solution for any ad-hoc network, because it is the case depending on dictated by the nature and varying factors of networks. Instead, we demonstrate our major perception and describe general models that may assist us while modeling a given network.

On-Demand Post-Disaster Emergency Shelters

In post-disaster emergency shelter aid, various relief agencies and other actors with different backgrounds need to cooperate in a tremendously short amount of time and under very different circumstances. In this article, we describe a research project that develops and tests a new approach in which the demands for shelters in a specific situation are methodically connected with available, innovative and sustainable shelter solutions, a DSS （decision support system）. The DSS is a digital tool that translates the gathered evidence on needs, solutions and location including long-term effects of shelter provision into advice for the provision of sustainable, integral broader shelter solutions and designs. The outcome is a set of characteristics for a DSS for the provision of on-demand emergency shelters. A DSS that meets these characteristics leads to the provision of sustainable shelters that meet the needs of the users and, therefore, have higher performance in long term.

Diversified Business Model of On-Demand Cooking:An Analysis Based on the Business Model Canvas

With the acceleration of the pace of social life and the emergence of the convenience economy,the requirements for on-demand cooking services have increased due to the increasing demand for food quality and the health concerns associated with takeaway food,as well as the lack of cooking skills.This paper aims to analyze the business model of on-demand cooking service platforms in China with the theory of Business Model Canvas proposed by Alexander Osterwalder.By exploring the advantages and disadvantages of the business model of on-demand door-to-door cooking,the study seeks to provide relevant recommendations.

On-demand:新“游戏”?新“模式”?

IBM蓄意要将"On demand"发展成为未来第三代电子商务的新"模式"。尽管这一理想蓝图已经在业界引起极大反响,但更多的声音却表示怀疑:这究竟是一场新游戏,还是从根本上改变电子商务运作的新模式?

Trust-based Intelligent Scheme for Mitigating Black Hole Attacks in IoT

Internet of Things(IoT)networks are characterized by a multitude of wireless,interconnected devices that can dynamically join or exit the network without centralized administration or fixed infrastructure for routing.While multipath routing in IoT networks can improve data transmission reliability and load balancing by establishing multiple paths between source and destination nodes,these networks are susceptible to security threats due to their wireless nature.Traditional security solutions developed for conventional networks are often ill-suited to the unique challenges posed by IoT environments.In response to these challenges,this paper proposes the integration of the Ad hoc On-demand Multipath Distance Vector(AOMDV)routing protocol with a trust model to enhance network performance.Key findings from this research demonstrate the successful fusion of AOMDV with a trust model,resulting in tangible improvements in network performance.The assessment of trustworthiness bolsters both security and routing capabilities in IoT networks.The trust model plays a crucial role in mitigating black hole attacks in IoT networks by evaluating the trustworthiness of nodes and helping in the identification and avoidance of malicious nodes that may act as black holes.Simulation results validate the efficacy of the proposed trust-based routing mechanism in achieving its objectives.Trust plays a pivotal role in decision-making and in the creation of secure distribution systems.By assessing the trustworthiness of nodes,both network security and routing efficiency can be enhanced.The effectiveness of the proposed trust-based routing mechanism is scrutinized through simulations,offering insights into its potential advantages in terms of improved network security and routing performance in the context of the IoT.

Combinations of Transportation Policies to Promote BRT Usage Using Artificial Society Model

Various transportation systems have been developed in recent years.In this study,an artificial society model is developed to examine the combination of transportation policies in urban areas.In this model,each trip maker selects the primary and terminal transportation modes.An artificial society model is applied to the southeastern region of Osaka City,Japan.The effects of introducing BRT(bus rapid transit,primary transportation)and on-demand buses(terminal transportation)are investigated.The results confirm that BRT is used by a certain number of users.An increase in the use of BRT will increase the amount of walking,thus resulting in a healthy city.However,on-demand buses are rarely used as terminal transportation.Additionally,the development of bicycle parking stations near BRT stops is shown to be effective in the northern section of the BRT route.

High efficiency AODV routing protocol based on link availability prediction in MANETs

To cope with the problem of low protocol efficiency of the standard ad hoc on-demand distance vector （AODV） routing protocol with the periodic Hello message broadcast mechanism, a new link availability prediction based strategy is introduced to reduce the amount of Hello messages. In this strategy, a novel wireless link availability prediction model under line-of-sight （LOS） propagation environments is proposed based on which the parameter of Hello Interval in AODV can be dynamically adjusted to achieve the goal of changing the frequency of Hello message broadcasts under different link stability degrees. Simulation results demonstrate that, compared with the standard AODV with the periodic Hello message broadcast mechanism, the proposed protocol effectively reduces unnecessary control message overhead and greatly improves the performance in terms of end-to-end delay and efficiency.

高能量高信号强度节点优先的AODV路由协议

针对AODV协议只选择具有最少跳数路由,而不考虑节点能量即将耗尽或节点即将离开邻节点传送范围,造成路由频繁中断的问题,提出新的改进方案,在路由发现阶段,选择能量较高和信号强度较强的节点作为路由节点,在路由维护阶段,对能量即将耗尽或即将离开邻节点有效传送范围的节点进行路由备份。仿真实验结果表明改进后的协议能够有效增加数据包投递率和减少平均端到端延时,并能有效减缓能耗速度,提高整个网络的生存期。

生态产品价值市场化实现:需求导向、定价方式及制度配置

生态产品价值的实现离不开市场配置资源作用的发挥,而价格是市场经济中决定资源配置的核心因素,生态产品价值市场化实现路径中必须考虑价格这一因素。从西方经济学角度看,市场均衡价格实现时市场资源得到最优配置,而市场均衡价格由供需双方共同决定,由此不仅需要从供给方角度探索生态产品价格形成模式,还必须关注需求方对其价格形成的影响。有必要突破传统重供给的成本导向法和竞争导向法两种定价方法的束缚,转向重需求的需求导向法讨论定价,然后以需求方行为作为切入点,围绕监管方、供给方和需求方三方行为的互动模式,针对这些主体行为可能引发的问题,提出建立健全生态产品价值实现中“三位一体”法律规制体系的框架性建议。

移动节点多数据项实时广播调度算法的研究

随着物联网技术的广泛应用,如何高效、准确的向大量移动节点传递信息是数据广播研究的热点。由于广播数据具有时效性且GPRS网络的不稳定,移动节点常会出现获取的数据已失效。如何保证移动节点获取的数据有效,同时降低移动节点的能耗,缩短请求的访问时间是个很重要的研究课题。分析了适用于多数据项请求的QEM算法、改进型QEM算法等在该实时模型中的适用性,针对On-demand广播模式下的两个子问题,即请求选择问题和广播调度问题,提出了最小延迟时间优先请求和最大数据项访问频率优先调度的算法。理论分析仿真、实验测试显示,提出的广播调度算法相对于原有算法在实时模型下可以有效缩短请求的平均访问时间,改进系统的平均性能。

Dynamic Cluster Head for Lifetime Efficiency in WSN

Saving energy and increasing network lifetime are significant challenges in wireless sensor networks （WSNs）. In this paper, we propose a mechanism to distribute the responsibility of cluster-heads among the wireless sensor nodes in the same cluster based on the ZigBee standard, which is the latest WSN standard. ZigBee supports ad hoc on-demand vector （AODV） and cluster-tree routing protocols in its routing layer. However, none of these protocols considers the energy level of the nodes in the network establishing process or in the data routing process. The cluster-tree routing protocol supports single or multi-cluster networks. However, each single cluster in the multi-cluster network has only one node acting as a cluster head. These cluster-heads are fixed in each cluster during the network lifetime. Consequently, using these cluster-heads will cause them to die quickly, and the entire linked nodes to these cluster-heads will be disconnected from the main network. Therefore, the proposed technique to distribute the role of the cluster head among the wireless sensor nodes in the same cluster is vital to increase the lifetime of the network. Our proposed technique is better in terms of performance than the original structure of these protocols. It has increased the lifetime of the wireless sensor nodes, and increased the lifetime of the WSN by around 50% of the original network lifetime.

6G Service Coverage with Mega Satellite Constellations

The rapid development and continuous updating of the mega satellite constellation(MSC)have brought new visions for the future 6G coverage extension, where the global seamless signal coverage can realize ubiquitous services for user terminals. However, global traffic demands present nonuniform characteristics. Therefore, how to ensure the on-demand service coverage for the specific traffic demand, i.e., the ratio of traffic density to service requirement per unit area, is the core issue of 6G wireless coverage extension exploiting the MSC. To this regard, this paper first discusses the open challenges to reveal the future direction of 6G wireless coverage extension from the perspective of key factors affecting service coverage performance, i.e., the network access capacity, space segment capacity and their matchingrelationship. Furthermore, we elaborate on the key factors affecting effective matchings of the aforementioned aspects, thereby improving service coverage capability.