Find Me OPPO X903

你可以不知道X903,但是你不可以不知道莱昂钠多·迪卡普里奥大片似的广告“Find Me”不错,这则铺天盖地的广告中的主角就是Find Me OPPO X903,这次OPPO可是大手笔。     

Low-Depth Witnesses are Easy to Find

Kolmogorov Complexity measures the amount of information in a string by the size of the smallest program that generates that string. Antunes, Fortnow, van Melkebeek, and Vinodchandran captured the notion of useful information by computational depth, the difference between the polynomial-time-bounded Kolmogorov complexity and traditional Kolmogorov complexity. We show unconditionally how to probabilistically find satisfying assignments for formulas that have at least one assignment of logarithmic depth. The converse holds under a standard hardness assumption though fails if BPP = FewP = EXP. We also prove that assuming the existence of good pseudorandom generators one cannot increase the depth of a string efficiently.     

建立自动化与IT的协作团队

控制系统与信息系统专员正致力于组成团队,力求以新的方法优化生产。商业压力和枝术进步促成这种合作的产生与发展。     

Using Static Analysis to Find Bugs

Static analysis examines code in the absence of input data and without running the code. It can detect potential security violations (SQL injection), runtime errors (dereferencing a null pointer) and logical inconsistencies (a conditional test that can't possibly be true). Although a rich body of literature exists on algorithms and analytical frameworks used by such tools, reports describing experiences in industry are much harder to come by. The authors describe FindBugs, an open source static-analysis tool for Java, and experiences using it in production settings. FindBugs evaluates what kinds of defects can be effectively detected with relatively simple techniques and helps developers understand how to incorporate such tools into software development.     

分布式哈希查找模型的研究

Chord模型结构是P2P网络的典型模型之一,它利用分布式哈希表（DHT）在应用层形成一个重叠网络,Chord模型应用Chord协议对关键字进行查找,分析Chord系统的关键字查找算法、节点的加入算法以及节点加入和退出对查找的影响。     

Hard Data Is Good to Find

Indices are a common and useful way to summarize a changing field for both the lay and the specialist reader, and it's time that we had them for information security.     

Library eBooks: Some Can't Find Them,Others Find Them and Don't Know What They Are

When discussing eBooks, people generally fall into two camps: they either don't know what eBooks are or know what they are but cannot find them at their local library. Libraries are beginning to successfully address the gap between patron awareness of electronic books in general and a library's holdings and circulation options. EBooks are a relatively new format, and many rights and business model issues between authors, publishers and distributors remain unresolved. EBook readers to a large degree receive more media attention than eBooks themselves. More and more people are looking to libraries to fill their eBook needs. OverDrive (http://overdrive.com) offers libraries eBooks with true to expectations portability. Libraries are beginning to successfully market their eBook collections and make discovery easier.     

Collaborate with Strangers to Find Own Preferences

We consider a model with n players and m objects. Each player has a “preference vector” of length m, that models his grades for all objects. The grades are initially unknown to the players. A player can learn his grade for an object by probing that object, but performing a probe incurs cost. The goal of a player is to learn his preference vector with minimal cost, by adopting the results of probes performed by other players. To facilitate communication, we assume that players collaborate by posting their grades for objects on a shared billboard: reading from the billboard is free. We consider players whose preference vectors are popular, i.e., players whose preferences are common to many other players. We present a sequential and a parallel algorithm to solve the problem with logarithmic cost overhead. An extended abstract of this work appeared in the 17th Ann. ACM Symp. on Parallelism in Algorithms and Architecture, Las Vegas, Nevada, July 2005. Research of B. Awerbuch supported by NSF grant ANIR-0240551 and NSF grant CCR-0311795. Research of Y. Azar supported in part by the German-Israeli Foundation and by the Israel Science Foundation. Research of B. Patt-Shamir supported in part by Israel Ministry of Science and Technology and by the Israel Science Foundation.     

基于authorware的找碴游戏设计

authorware多媒体制作软件除了制作课件以外，也能制作具有趣味性的游戏。衣文氽绍在authonrware中利用交互图标与判断图标等的结合实现找碴游戏的设计。     

Larger crossing angles make graphs easier to read

Objective: Aesthetics are important in algorithm design and graph evaluation. This paper presents two user studies that were conducted to investigate the impact of crossing angles on human graph comprehension.Method and results: These two studies together demonstrate our newly proposed two-step approach for testing graph aesthetics. The first study is a controlled experiment with purposely-generated graphs. Twenty-two subjects participated in the study and were asked to determine the length of a path which was crossed by a set of parallel edges at different angles. The result of an analysis of variance showed that larger crossing angles induced better task performance. The second study was a non-controlled experiment with general real world graphs. Thirty-seven subjects participated in the study and were asked to find the shortest path of two pre-selected nodes in a set of graph drawings. The results of simple regression tests confirmed the negative effect of small crossing angles. This study also showed that among our four proposed candidates, the minimum crossing angle on the path was the best measure for the aesthetic when path finding is important.Conclusion: Larger crossing angles make graphs easier to read.Implications: In situations where crossings cannot be completely removed (for example, graphs are non-planar, or a drawing convention is applied), or where effort needed to remove all crossings cannot be justified, the crossing angle should be maximized to reduce the negative impact of crossings to the minimum.     

基于最大Code码的极大完全子图算法

本文通过引入极大code码,提出了一种寻找图的极大完全子图的算法FMCSG,该算法用邻接矩阵表示图。在寻找极大完全子图时根据得到的code码及时剪掉非极大code码的子矩阵,从而减少对矩阵的遍历次数,提高了算法的效率。     

提高IQAS查询速度的一种方法

为了提高基于自然语言处理的智能答疑系统IQAS(IntelligentQuestionAnsweringSystem)中答案的查找速度,该文提出一种索引结构,它可以很快地使问题锁定在查找的范围之内。     

极小子集问题的逻辑代数解法

在粗集论中，决策表简化问题可转化为极小子集问题.本文给出极小子集问题的逻辑代数解法，即通过求逻辑函数的极小析取范式或极小合取范式来获得极小子集.     

一种优化的字符串seed的求解算法

研究了一种重要的字符规律性--字符串的seed.我们利用等价类的概念,提出了等价类树的结构.并在构建前缀等价类树和后缀等价类树的过程中,实时地求解出任意长度的字符串的seed.给定长度为n的字符串,这一算法的时间复杂度为O(nlogn).     

使用分类器自动发现特定领域的深度网入口

在深度网研究领域,通用搜索引擎(比如Google和Yahoo)具有许多不足之处:它们各自所能覆盖的数据量与整个深度网数据总量的比值小于1/3;与表层网中的情况不同,几个搜索引擎相结合所能覆盖的数据量基本没有发生变化.许多深度网站点能够提供大量高质量的信息,并且,深度网正在逐渐成为一个最重要的信息资源.提出了一个三分类器的框架,用于自动识别特定领域的深度网入口.查询接口得到以后,可以将它们进行集成,然后将一个统一的接口提交给用户以方便他们查询信息.通过8组大规模的实验,验证了所提出的方法可以准确高效地发现特定领域的深度网入口.     

用遗传模拟退火算法挖掘特征项权重的研究

能否在范例库中检索和选择出最为相似的范例决定了范例推理系统性能。文中介绍了遗传算法和模拟退火算法,比较了两种算法的特性,提出一种混合遗传模拟退火算法。该算法不但具有强的局部搜索能力,还缩短了搜索时间。将该算法用于发掘范例库上特征权重,理论分析和实验结果表明了这种混合遗传模拟退火算法优于普通的遗传算法。     

用遗传模拟退火算法挖掘特征项权重的研究

能否在范例库中检索和选择出最为相似的范例决定了范例推理系统性能。文中介绍了遗传算法和模拟退火算法，比较了两种算法的特性．提出一种混合遗传模拟退火算法。该算法不但具有强的局部搜索能力．还缩短了搜索时间。将该算法用于发掘范例库上特征权重，理论分析和实验结果表明了这种混合遗传模拟退火算法优于普通的遗传算法。     

寻医问药平台实施方案

随着中国的医疗保障制度在新中国成立后逐步建立和发展起来,中国的医疗保障制度在城乡经历了不同的发展过程,寻医问药平台构想的提出,切合医疗改革的大趋势,确切保证城乡公民公平地享受医疗服务资源,利用最简洁的手段获得最有效的医疗健康服务信息,提高对健康的认知。进而形成了默认的通讯工具“手机＋网络”的意识形态,消除时间、地点因素对医患双方沟通的限制。