MNP法在接触网热状态检测中的研究

红外热成像技术广泛应用于很多领域,故将红外热成像技术与图像处理相结合对接触网热状态进行检测。在图像处理中,首先进行红外图像的预处理,然后采用基于互信息的图像模板匹配对红外图像目标进行检测与识别。互信息是图像模板匹配的相似性度量标准,且图像模板的互信息计算即联合概率分布估计的主要方法是非参数窗法,针对NP窗法计算时间较长的缺点,采用三角形分布代替NP窗法的均匀分布的改进非参数窗法。实验结果表明了MNP法计算的联合概率分布的准确性更高且计算时间也较短。

Carba NP法对产碳青霉烯酶菌株快速检测的研究

目的探讨生化试验Carba NP法用于产碳青霉烯酶肠杆菌属和假单胞菌属细菌的快速检测,以及鉴别区分产碳青霉烯酶A、B、D类型的准确程度与适用性。方法对2014年10月-2015年3月从医院临床标本分离的23株亚胺培南耐药菌株进行Carba NP法试验,并将阳性结果与PCR结果进行比对。结果 Carba NP法检测的23株胺培南耐药菌株中4株显色结果呈阳性,说明其产生碳青霉烯酶,并可将其进一步区分为2株A型、2株B型;对该4株耐药菌进行PCR检测产碳青霉烯酶基因,1株含基因VIM,1株含基因NDM(B型),2株含基因KPC(A型),该结果与Carba NP法结果相符。结论 Carba NP法简单易行、成本低廉、快速方便,特异性和灵敏度均较高,不仅能快速检测出产碳青霉烯酶菌株,并且能进一步判定产碳青霉烯酶菌株的类型,节省了检测时间,有助于提高产碳青霉烯酶菌株的检出率,结合PCR及测序能有效控制医院获得性感染。

NPS顾客忠诚度测评法研究

忠诚顾客的数量决定了企业的生存与发展,也是企业实现长期健康、可持续发展的唯一途径。本文比较分析了最新顾客忠诚测评法——NPS(净推介者值)顾客忠诚测评法及其优势,力图给国内企业应用NPS测评法进行顾客忠诚管理提供一些启示。

佳能Canon复印机的NP显影法

NP显影法是日本佳能公司在其生产的复印机上采用的一种特殊的显影方式,亦称为单组份跳跃式显影法。跳跃显影的原理如下: 在显影滚筒内装有固定磁极,显影滚筒旋转时,由于筒内磁铁的作用,在滚筒上吸附的磁性显影剂(墨粉)一起转动。

CIM法应用于鲍曼不动杆菌和铜绿假单胞菌耐碳青霉烯类检测的价值

目的:探讨改良Carba NP法和碳青霉烯酶失活(CIM)法应用于鲍曼不动杆菌和铜绿假单胞菌耐碳青霉烯类抗菌药物快速检测中的价值。方法:纳入东莞市长安医院2020年3月至2021年3月期间临床分离的88株铜绿假单胞菌及88株鲍曼不动杆菌为研究对象,所有菌株均采用改良Carba NP法和CIM法检测,后以基因检测作为金标准,观察两种方法的检测价值(灵敏度、特异度、阴性预测值与阳性预测值)。结果:铜绿假单胞菌通过CIM法检测的灵敏度(96.15%)、阴性预测值(75.00%)均高于改良Carba NP法(84.62%、29.41%),差异均具有统计学意义(P<0.05);特异度(90.00%)、阳性预测值(98.68%)与改良Carba NP法(50.00%、92.96%)比较,差异均无统计学意义(P>0.05);鲍曼不动杆菌通过CIM法检测的灵敏度(90.67%)、特异度(92.31%)、阴性预测值(63.16%)及(98.55%)均高于改良Carba NP法(78.67%、53.85%、30.43%、90.77%),差异均具有统计学意义(P<0.05)。结论:CIM法应用于鲍曼不动杆菌和铜绿假单胞菌耐碳青霉烯类抗菌药物快速检测的价值比改良Carba NP法更高。

Quantum Algorithms for Some Well—Known NP Problems

It is known that quantum computer is more powerful than classical computer.In this paper we present quantum algorithms for some famous NP problems in graph theory and combination theory,these quantum algorithms are at least quadratically faster than the classical ones.

Carba NP碳青霉烯酶检测方法在医院感染监测中的应用

目的研究Carba NP法检测3株产酶菌株同源性及耐药机制,探讨Carba NP碳青霉烯酶检测方法在医院感染监测中的应用价值,为临床治疗提供参考依据。方法于2012年7月-2013年1月采用Carba NP法对检出3株产碳青霉烯酶克雷伯菌属细菌进行鉴定、药物敏感性、菌株特征及药物敏感谱;PCR扩增和测序碳青霉烯酶的基因型;PFGE电泳探讨3株菌的亲缘关系。结果菌株1为肺炎克雷伯菌,产碳青霉烯酶酶KPC-2;菌株2为肺炎克雷伯菌,产碳青霉烯酶IMP-4,菌株3为产酸克雷伯菌,同时产KPC-2和IMP-4;PFGE结果表明该3株菌不是近源的克隆株,提示KPC-2和IMP-4基因元件在该病房的跨种属传播。结论 Carba NP能早期迅速准确的检出菌株是否产碳青霉烯酶,为产碳青霉烯酶菌株的医院感染提供早期线索,在医院感染监测、控制中有重要应用价值,结合PCR及测序,PFGE的结果能在医院获得性感染控制方面发挥积极的作用。

生命性对英汉语NP用法的作用——一项语料考察

“生命性”范畴普遍存在于自然话语之中。名词短语 (NP)在语言交际中有重要作用。本文利用取自英汉语书刊 2 0 .7万字的语料 ,对生命性与英汉语NP用法之间的关系作了考察 ,意在分析生命性(度 )对NP在语法、语义、语篇各层面的用法 (或功能 )的作用 ,揭示其背后的认知根源。

Robust Virtual Network Embedding Based on Component Connectivity in Large-Scale Network

Virtual network embedding problem which is NP-hard is a key issue for implementing software-defined network which is brought about by network virtualization. Compared with other studies which focus on designing heuristic algorithms to reduce the hardness of the NP-hard problem we propose a robust VNE algorithm based on component connectivity in large-scale network. We distinguish the different components and embed VN requests onto them respectively. And k-core is applied to identify different VN topologies so that the VN request can be embedded onto its corresponding component. On the other hand, load balancing is also considered in this paper. It could avoid blocked or bottlenecked area of substrate network. Simulation experiments show that compared with other algorithms in large-scale network, acceptance ratio, average revenue and robustness can be obviously improved by our algorithm and average cost can be reduced. It also shows the relationship between the component connectivity including giant component and small components and the performance metrics.

A Quantum Algorithm for Finding a Hamilton Circuit

A quantum algorithm for solving the classical NP-complete problem - the Hamilton circuit is presented. The algorithm employs the quantum SAT and the quantum search algorithms. The algorithm is square-root faster than classical algorithm, and becomes exponentially faster than classical algorithm if nonlinear quantum mechanical computer is used.

Sequential fault diagnosis strategy with imperfect tests considering life cycle cost

The problem of sequential fault diagnosis is to construct a diagnosis tree that can isolate the failure sources with minimal test cost. Pervious sequential fault diagnosis strategy generating algorithms only consider the execution cost at application stage, which may result in a solution with poor quality from the view of life cycle cost. Furthermore, due to the fact that uncertain information exists extensively in the real-world systems, the tests are always imperfect. In order to reduce the cost of fault diagnosis in the realistic systems, the sequential fault diagnosis problem with imperfect tests considering life cycle cost is presented and formulated in this work, which is an intractable NP-hard AND/OR decision tree construction problem. An algorithm based on AND/OR graph search is proposed to solve this problem. Heuristic search based on information theory is applied to generate the sub-tree in the algorithm. Some practical issues such as the method to improve the computational efficiency and the diagnosis strategy with multi-outcome tests are discussed. The algorithm is tested and compared with previous algorithms on the simulated systems with different scales and uncertainty. Application on a wheel momentum system of a spacecraft is studied in detail. Both the simulation and application results suggest that the cost of the diagnosis strategy can be reduced significantly by using the proposed algorithm, especially when the placement cost of the tests constitutes a large part of the total cost.

Current Situation of Drug Abuse and Countermeasures in Japan

Drug abuse is a common problem that all countries in the world face. The most distinguishing characteristic of drug abuse in ｜apart is that use of stimulants, mostly methamphetamine, accounts for over 80% of the arrests. Abuse of a stimulant called Philopon was widespread after the Second World War in ]apan, but the situation was dramatically improved after 1954 because the Japanese government enacted the Stimulant Control Act and restructured the police system and Japanese society recovered from post-war unrest. The situation of drug abuse in Japan has become less serious compared to the past and to the situation in many other countries, because we are taking comprehensive and nationwide measures, including proactive disclosure of the situation, control, drug abuse prevention class, and introduction of partial suspension of sentence. On the other hand, as in many countries, the rapid spread of new psychoactive substances （NPS） in recent years became a serious social issue. The situation of NPS has been rapidly improving due to comprehensive and government-wide measures, but the means of acquisition is quickly shifting to the Internet. It is necessary to strengthen cyber patrol.

Enhancing real-time performance via controlled actor relocation in wireless sensor and actor networks

Actors'relocation is utilized during the network initialization to enhance real-time performance of wireless sensor and actor networks(WSANs)which is an important issue of WSANs.The actor deployment problem in WSANs is proved NP-Hard whether the amount of actors is redundant or not,but to the best of our knowledge,no effective distributed algorithms in previous research can solve the problem.Thus two actor deployment strategies which need not the boundary control compared with present deployment strategies are proposed to solve this problem approximately based on the Voronoi diagram.Through simulation experiment,the results show that our distributed strategies are more effective than the present deployment strategies in terms of real-time performance,convergence time and energy consumption.

Energy-constrained ferry route design for sparse wireless sensor networks

In recent years,using message ferries as mechanical carriers of data has been shown to be an effective way to collect information in sparse wireless sensor networks.As the sensors are far away from each other in such highly partitioned scenario,a message ferry needs to travel a long route to access all the sensors and carry the data collected from the sensors to the sink.Typically,practical constraints(e.g.,the energy)preclude a ferry from visiting all sensors in a single tour.In such case,the ferry can only access part of the sensors in each tour and move back to the sink to get the energy refilled.So,the energy-constrained ferry route design(ECFRD)problem is discussed,which leads to the optimization problem of minimizing the total route length of the ferry,while keeping the route length of each tour below a given constraint.The ECFRD problem is proved to be NP-hard problem,and the integer linear programming(ILP)formulation is given.After that,efficient heuristic algorithms are proposed to solve this problem.The experimental results show that the performances of the proposed algorithms are effective in practice compared to the optimal solution.

Efficient network coding-based retransmission algorithm for reliable wireless multicast

Recent research shows using network sion efficiency in wireless networks greatly et for retransmission over composite fading coding for reliable multicast can improve the retransmis- In this paper, we study how to code the composite pack- channels efficiently. For the composite fading environ- ment with muhiple receivers, receivers experience different fading at any time. It＇ s very important to code the composite packet so that intended receivers are in good channel qualities, because in- tended receivers in deep fading have little opportunity to receive the composite packet correctly. Hence, we propose a novel composite packet coding principle of maximizing the total SNR of intend- ed receivers. Since the proposed principle is an NP-complete problem, an efficient heuristic algo- rithm with low complexity is given for finding a suboptimal solution. Simulation results show the heu- ristic based scheme achieves higher transmission efficiency than other network coding-based schemes due to the multi-user diversity gain.

The Complexity and On-Line Algorithm for Automated Storage and Retrieval System with Stacker Cranes on One Rail

This paper considers an on-line scheduling and routing problem concerning the automated storage and retrieval system from tobacco industry. In this problem, stacker cranes run on one common rail between two racks. Multiple input/output-points are located at the bottom of the racks. The stacker cranes transport bins between the input/output-points and cells on the racks to complete requests generated over time. Each request should be accomplished within its response time. The objective is to minimize the time by which all the generated requests are completed. Under a given physical layout, the authors study the complexity of the problem and design on-line algorithms for both one-stacker-crane model and two-stacker-crane model. The algorithms axe validated by instances and numerical simulations.

MULTITASK n-VEHICLE EXPLORATION PROBLEM:COMPLEXITY AND ALGORITHM

This paper extends the single-task n-Vehicle Exploration Problem to Multitask n-Vehicle Exploration Problem （MTNVEP）, by combining n-Vehicle Exploration Problem with Job Scheduling Problem. At first, the authors prove that MTNVEP is NP-hard for fixed number of tasks, and it is strongly NP-hard for general number of tasks. Then they propose an improved accurate algorithm with computing time O（n3n）, which is better than O（n!） as n becomes sufficiently large. Moreover, four heuristic algorithms are proposed. Effectiveness of the heuristic algorithms is illustrated by experiments at last.

Acyclic colorings of graphs with bounded degree

A k coloring(not necessarily proper) of vertices of a graph is called acyclic, if for every pair of distinct colors i and j the subgraph induced by the edges whose endpoints have colors i and j is acyclic. We consider some generalized acyclic k colorings, namely, we require that each color class induces an acyclic or bounded degree graph. Mainly we focus on graphs with maximum degree 5. We prove that any such graph has an acyclic 5 coloring such that each color class induces an acyclic graph with maximum degree at most 4. We prove that the problem of deciding whether a graph G has an acyclic 2 coloring in which each color class induces a graph with maximum degree at most 3 is NP complete, even for graphs with maximum degree 5. We also give a linear time algorithm for an acyclic t improper coloring of any graph with maximum degree d assuming that the number of colors is large enough.

Scheduling Problems with Rejection to Minimize the Maximum Flow Time

This paper considers the scheduling problem with rejection on m identical parallel machines to minimize the maximum flow time. The authors show that this problem is NP-hard even when there is a single machine and all jobs have two distinct release dates. Furthermore, the authors present a dynamic programming algorithm and two approximation algorithms to solve them.

A class of polynomially solvable 0-1 programming problems and an application

It is well known that general 0-1 programming problems are NP-Complete and their optimal solutions cannot be found with polynomial-time algorithms unless P=NP. In this paper, we identify a specific class of 0-1 programming problems that is polynomially solvable, and propose two polynomial-time algorithms to find its optimal solutions. This class of 0-1 programming problems commits to a wide range of real-world industrial applications. We provide an instance of representative in the field of supply chain management.