RUSPACE(log n) \subseteq DSPACE(log2 n/log log n)

We present a deterministic algorithm running in space O(log² n /log log n ) solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(log n ) time-bounded algorithm for this problem running on a parallel pointer machine. Received February 1997, and in revised form August 1997, and in final form February 1998.     

BenQ RL2240H

日前Sony发布了一款家用网络数码底座,也有人称之为加强版数码闹钟。它具有7寸的触控屏幕。功能上支持一些社交网络的实时查看、网络收音、图片、应用部件（大概有1000多种,包括菜谱,体育消息等）,天气时间显示,附带一个基本浏览器功能可以看网员,其内置Web浏览器可以用触控的方式获取互联网信息,也可以通过基于Chumby的图像特性列举来自Flickr．Photobucket和Sony Personal Space获取相片当做相框使用。娱乐方面,它还可以成为网络收音机以及社交网络的客户端。     

基于非均匀模糊核的RL改进算法

针对传统均匀模糊模型下的Richardson Lucy（RL）算法存在振铃效应和细节丢失等问题,提出了一种基于非均匀模糊模型下的改进RL算法。基于Yu-Wing的射影运动模糊模型,通过在迭代过程中采用基于局部极值分解的方法提取含有图像结构但无振铃的边缘图像,将模糊图像和上述提取的边缘图像作为输入图像,用添加了局部先验项的RL法对输入图像进行去模糊。实验验证了算法抑制振铃效应的有效性,同时很好地保留了图像细节,表明非均匀模糊模型在相机抖动产生的模糊图像去模糊中更为有效。     

改进的RL模糊星图复原算法

研究了复杂工作环境对星敏感器成像的影响,总结了模糊图像退化与复原模型,并对经典RL模糊图像复原算法进行了分析.针对RL复原算法存在振铃效应的不足,提出了一种基于超拉普拉斯约束因子的RL复原算法.仿真结果表明:改进后的RL复原算法减弱了复原星图中的振铃效应,提高了复原星图的质量,为在复杂环境影响下星敏感器实现高精度星提取性能奠定了基础.     

Evading malware classifiers using RL agent with action-mask

International Journal of Information Security - For malware detection, the commonly known technique used by many commercial antivirus engines is signature-based methods. However, researchers have...     

FujiXerox DocuCentre SC2020

不知不觉间,富士施乐的中国定制机型已经推出了三个系列产品,毫无疑问,超高的性价比一定是其中的一条主线,可以看到,产品的性能在不断提升,操作的易用性也得到不断改善,用更便宜、更好用应该能够很好地概括这一系列定制产品。这一次,富士施乐推出的DocuCentre SC2020则是首款为中国低速彩机市场量身定制的产品,毫无疑问,彩色机型的加入绝对是中国定制系列产品的一大崭新亮点,它丰富了打印模式,带给了用户更好的使用体验,由此也将引领一场由黑白至彩色的变革。S C2020传承了中国定制的设计理念,简洁、紧凑的外型,提供了充足够用的功能,同时,富士施乐优秀的控制系统也不断加入进来,简化设定直接明了,功能的设置和执行都十分便利。而在节省方面,新推出的S C2020也有着优良的表现,它的能耗水平更低,并拥有实用的省墨模式,在出色完成打印任务的同时,还在潜移默化间降低了设备的使用成本。     

A Survey of the Rule Language RL/1

In this paper we introduced the RL project which aims to integrate logic programming,relational databases and constraint solving in a single relational framework.We gave a summary of the architecture of the RL/1 system and shorth discussed the characteristics of the RL/1 language.A target of the project has become to turn the RL/1 system into an industrial strength database interface.     

美国SC杂志咨询顾问谈信息安全

信 息 安 全 的 投 资 汇 报 理 论 要想说服企业的CEO和财务总监投资 信息安全是一件非常头痛的事,信息安全的 投入对企业领导来讲看不到明显的回报,同 时还要花费时间聆听信息安全负责人的讨 价还价,SC 杂志的咨询顾问们早已经在关注这个问题并希望他们对这个问题的看法能够帮助企业认清为什么要投资信息安全。 第一个话题就是如何从企业领导和财 务紧缩的钱包里获得信息安全预算。 咨询顾问的观点是企业的信息安全负 责人首先要忘记 FUD(fear/uncertainty/ doubt)害怕、不确定、怀疑,全力推荐信 …     

RL模糊神经网络及其在采油控制中的应用

针对石油开采中“电动机长期处于相对轻载状态”的问题，提出了规则自调整的RL模糊神经网络模型，并将其应用于抽油机的间歇控制中，该模型具有良好的自适应性能，在不断向环境学习的过程中，自动调节自身参数及结构，实现了模糊推理和模糊规则的构建，基于该模型开发的抽油机电控制器已在大庆，胜利等采油厂投入使用，实践表明，抽油机启停时间合理，在保证采油量的前提下，节电率达30％以上，有效地解决了抽油机“相对轻载”的问题。     

Coordination of cooperation policies in a peer-to-peer system using swarm-based RL

The performance of a system of interacting peers depends strongly on their individual resource contributions. In this paper, we have devised a self-organized coordination mechanism for cooperation policy setting of rational peers that have only partial views of the whole peer-to-peer system in order to improve the overall welfare of the system. The proposed mechanism is based on a distributed Reinforcement Learning (RL) approach and sets cooperation policies of the peers through their self-organized interactions by exchanging the local value functions among the neighbors. We demonstrate that a Pareto optimal equilibrium emerges in the system from fair cooperation of the constituent peers.     

Grid-Oriented Computation: Modified Bessel Functions $$\mathcal{J}_V \left( Z \right)$$ ν(z) and $$\mathcal{K}_V \left( Z \right)$$ ν (z)

Programming and Computer Software - The problem of computation of modified real and complex Bessel functions $\mathcal{J}_V \left( Z \right)$ ν(z) and $\mathcal{K}_V \left( Z \right)$...     

Generating Boolean \mu-expressions

In this paper, we consider the class of Boolean -functions, which are the Boolean functions definable by -expressions (Boolean expressions in which no variable occurs more than once). We present an algorithm which transforms a Boolean formulaE into an equivalent -expression-if possible-in time linear in E times , where E is the size ofE andn _m is the number of variables that occur more than once inE. As an application, we obtain a polynomial time algorithm for Mundici's problem of recognizing -functions fromk-formulas [17]. Furthermore, we show that recognizing Boolean -functions is co-NP-complete for functions essentially dependent on all variables and we give a bound close to co-NP for the general case.     

Mutually unbiased maximally entangled bases in $$\mathbb {C}^d\otimes \mathbb {C}^d$$

We study mutually unbiased maximally entangled bases (MUMEB’s) in bipartite system \(\mathbb {C}^d\otimes \mathbb {C}^d (d \ge 3)\). We generalize the method to construct MUMEB’s given in Tao et al. (Quantum Inf Process 14:2291–2300, 2015), by using any commutative ring R with d elements and generic character of \((R,+)\) instead of \(\mathbb {Z}_d=\mathbb {Z}/d\mathbb {Z}\). Particularly, if \(d=p_1^{a_1}p_2^{a_2}\ldots p_s^{a_s}\) where \(p_1, \ldots , p_s\) are distinct primes and \(3\le p_1^{a_1}\le \cdots \le p_s^{a_s}\), we present \(p_1^{a_1}-1\) MUMEB’s in \(\mathbb {C}^d\otimes \mathbb {C}^d\) by taking \(R=\mathbb {F}_{p_1^{a_1}}\oplus \cdots \oplus \mathbb {F}_{p_s^{a_s}}\), direct sum of finite fields (Theorem 3.3).