绵延12000公里的温暖

退休以后,去自驾支教。……六年前,一位信息技术教师,有一个愿望。……利用信息技术,将教育的温暖与欢乐,绵延到12000公里以外的大山中。……因为在那里。有人卖掉房子,盖起学校。有人背井离乡,前往支教。也有人只身千里,送去欢笑。……因为在那里。没有网络,甚至没有公路,教育面临着挑战。但对于孩子而言,鞋子破了,也要徒步去上学。……于是,"十八道弯"山路崎岖,"云海"翻腾。驱车驶过,转眼间12000公里行于脚下。……在北川,在汶川,在凉山彝族自治州。……在宁强,在临沧,在普洱。     

领跑2009：官方·决策

在推进信息技术教育、引领教育信息化发展的进程中,总有一些人在前面领跑。官方的教育决策者在领跑,学术界的信息技术教育专家在领跑,电教馆长在领跑,信息技术教研员在领跑。校长在领跑,信息技术教育媒体也在领跑……这些不同层面、不同岗位上的“领跑人”,都在以不同的方式引领着广大师生奔跑,面向世界,面向未来,面向现代化。     

An Efficient Two-Phase Model for Computing Influential Nodes in Social Networks Using Social Actions

在社会网络的影响的测量在数据采矿社区收到了很多注意。影响最大化指发现尽量利用信息或产品采纳的有影响的用户的过程。在真实设置,在一个社会网络的一个用户的影响能被行动的集合建模(例如,份额,重新鸣叫,注释) 在其出版物以后由网络的另外的用户表现了。就我们的知识而言,在文学的所有建议模型同等地对待这些行动。然而,它是明显的一工具少些比一样的出版的份额影响的一份出版物相似。这建议每个行动有它影响的自己的水平(或重要性) 。在这份报纸,我们建议一个模型(叫的社会基于行动的影响最大化模型, SAIM ) 为在社会网络的影响最大化。在 SAIM,行动没在测量一个个人的影响力量同等地被考虑,并且它由二主要的步组成。在第一步,我们在社会网络计算每个个人的影响力量。这影响力量用 PageRank 从用户行动被计算。在这步的结束,我们得到每个节点被它的影响力量在标记的一个加权的社会网络。在 SAIM 的第二步,我们计算一个新概念说出 influence-BFS 树的使用的有影响的节点的一个最佳的集合。在大规模真实世界、合成的社会网络上进行的实验在计算揭示我们的模型 SAIM 的好表演,在可接受的时间规模,允许信息的最大的传播的有影响的节点的一个最小的集合。     

刘帆 医院CIO的三种身份

现阶段,信息化在医院中的应用依然停留在业务、管理的工具层面,主要在流程优化等方面发挥作用。而这种对于业务和管理的辅助作用,说明信息化应用还停留在工具层面。在医院领域信息化扮演的角色还需要转变,未来要产生影响业务的效果。在医院里,CIO应该有三种身份。首先他应该是能够站在决策层面的角色。CIO必须了解医院发展的方向,在这个发展进     

三剑合璧保安全

在服务器市场,外有IBM、惠普、戴尔,内有曙光、浪潮、联想、宝德等,市场竞争的激烈程度可想而知。在这样的大环境下,长城集团还是在2003年,宣布将服务器作为自己的四大独立事业部来运作。在此之前,长城的服务器只是隐藏在公司其它产品线的背后,处于“随需而售”的市场地位。在把服务器事业部独立之后,长城集团的态度是明朗的,或者说长城集团在更强烈的向市场表态:在服务器市场,长城的产品,不会落后,甚至可以更好。不过,就市场反应来看,处于“内忧外患”境地之下的长城服务器,并不被看好。但是,在一年之后,长城服务器市场占有率实现了百分…     

身行自由自如体验——联想扬天V480笔记本电脑是办公生活的得力助手

在现今社会中,生活与工作的节奏在不断加快,很多人的办公方式和办公地点在发生着改变。移动办公,移动计算已经成为办公生活中不可缺少的一部分,移动计算也便成为非常重要的一环。在你我身边,有一部分人常常都是在移动中进行办公的。公司的高层领导更是如此,他们常常外出公干,在不同地点办公、参加会议,他们甚至被人们冠以"空中飞人"的称号。这次我们找     

风景

你站在桥上看风景,看风景的人在楼上看你。明月装饰了你的窗子,你装饰了别人的梦。卞之琳的这首诗,文字简单,描绘的画面细腻而自然,悠悠情思令人遐想。一扇窗子,一座小桥。近处的你,远处的别人,你在看风景却也在风景中。鸟在空中飞,天空是它最熟悉的风景;鱼在海底游,海是它最熟悉的风景;蜗牛在地上爬,壳就是它最熟悉的风景。     

要想忘不了,就用网络记事本

平时在网吧或者在单位的时候,有时经常要在电脑上随手记点东西,可是如果只是记在本机,在其他地方我们就看不到所记的事情了。那么何不试试网络记事本,把要记的东西放在这些地方,既方便使用,还能随处访问。     

Bamboo的“写”意生活

1981年8月,IBM推出了世界上第一台个人电脑,从此掀开了个人信息时代的大幕。在随后的29年中,不同生产商在各自擅长的领域中扮演着领跑角色,有人在处理器行业驰骋,有人在存储行业扛鼎,可谓是各显其能。正是如此,在29年后的今天PC家族人丁兴旺,英雄倍出。     

信息科技全方位助力复工复产

信息科技助力复工复产,共同战胜疫情。体现企业社会责任众志成城,共战疫情,华为人在行动在整个疫情发生之后,整个社会都在行动,包括政府、企业都在行动。华为公司全体员工也都行动起来。公司组织200多名紧急保障的团队在一线支持,同时在深圳总部、在中国区总部北京都有相应的平台、人员,还有生产人员以及业务人员全力在支持这次战疫。一台设备的生产都第一时间通过流程优先处理,保证设备最快速地到一线进行安装调试。     

面向对象程序的抽象类测试之研究

许多面向对象语言支持抽象类机制,抽象类是一种特殊的类,因为它本身不能被实例化,所以对抽象类的基于执行的测试就比测试一般具体类更复杂。测试一般类需要该类的实例,然后调用方法执行测试用例,并分析测试结果,而测试抽象类就不能直接这样做了。论文首先分析了抽象类的故障特征,并提出了抽象类测试的改进方法。     

Current and future research directions in network optimization

In this paper, we discuss a number of current and future research directions in network optimization. First, we categorize current research efforts as primarily methodological or primarily applied and we carefully define the boundaries of each class. In addition, we survey the present capabilities of network algorithms. Next, we delineate objectives in each class. Finally, we list several network problems for each class that should, in our opinion, be investigated and we give pertinent background information.     

On <Emphasis Type="Italic">L</Emphasis>-soft merotopies

The goal of this paper is to focus on the notions of merotopy and also merotopology in the soft universe. First of all, we propose L-soft merotopic (nearness) spaces and L-soft guild. Then, we study binary, contigual, regular merotopic spaces and also relations between them. We show that the category of binary L-soft nearness spaces is bireflective in the category of L-soft nearness spaces. Later, we define L-approach soft merotopological (nearness) spaces by giving several examples. Finally, we define a simpler characterization of L-approach soft grill merotopological space called grill-determined L-approach soft merotopological space. We investigate the categorical structures of these notions such as we prove that the category of grill-determined L-approach soft merotopological spaces is a topological category over the category of L-soft topological spaces. At the end, we define a partial order on the family of all L-approach soft grill merotopologies and show that this family is a completely distributive complete lattice with respect to the defined partial order.     

C＋＋中构造函数的三种调用问题解析

构造函数是一种用于创建对象的特殊成员函数,构造函数的调用顺序问题对类的定义至关重要,本文从简单类对象的创建、类组合（一个类的对象是另一个类的数据成员）和类继承三种情况下分析了构造函数的调用问题,一定程度上诠释了类定义中的这一关键因素,为更好掌握C＋＋的编程思想提供了理论依据和程序示例。     

Boolean functions with long prime implicants

In this short note we introduce a hierarchy of classes of Boolean functions, where each class is defined by the minimum allowed length of prime implicants of the functions in the class. We show that for a given DNF and a given class in the hierarchy, it is possible to test in polynomial time whether the DNF represents a function from the given class. For the first class in the hierarchy we moreover present a polynomial time algorithm which for a given input DNF outputs a shortest logically equivalent DNF, i.e. a shortest DNF representation of the underlying function. This class is therefore a new member of a relatively small family of classes for which the Boolean minimization problem can be solved in polynomial time. For the second class and higher classes in the hierarchy we show that the Boolean minimization problem can be approximated within a constant factor.     

Reversible client/server interactions

In the setting of session behaviours, we study an extension of the concept of compliance when a disciplined form of backtracking and of output skipping is present. After adding checkpoints to the syntax of session behaviours, we formalise the operational semantics via an LTS, and define natural notions of checkpoint compliance and sub-behaviour, which we prove to be both decidable. Then we extend the operational semantics with skips and we show the decidability of the obtained compliance.     

OODB延迟视图维护模型

针对面向对象数据库中视图的特点，提出了一个延迟视图维护的模型以及相关的更新算法，在视图更新时，要考虑导出它的类的改动，以有以此类为根的继承和类组成子层次结构中的所有类的改动，因此，为每个类添加一个修改列表，为依赖于它的视图保存修改信息。     

Dynamic cluster generation for a fuzzy classifier with ellipsoidalregions

In this paper, we discuss a fuzzy classifier with ellipsoidal regions that dynamically generates clusters. First, for the data belonging to a class we define a fuzzy rule with an ellipsoidal region. Namely, using the training data for each class, we calculate the center and the covariance matrix of the ellipsoidal region for the class. Then we tune the fuzzy rules, i.e., the slopes of the membership functions, successively until there is no improvement in the recognition rate of the training data. Then if the number of the data belonging to a class that are misclassified into another class exceeds a prescribed number, we define a new cluster to which those data belong and the associated fuzzy rule. Then we tune the newly defined fuzzy rules in the similar way as stated above, fixing the already obtained fuzzy rules. We iterate generation of clusters and tuning of the newly generated fuzzy rules until the number of the data belonging to a class that are misclassified into another class does not exceed the prescribed number. We evaluate our method using thyroid data, Japanese Hiragana data of vehicle license plates, and blood cell data. By dynamic cluster generation, the generalization ability of the classifier is improved and the recognition rate of the fuzzy classifier for the test data is the best among the neural network classifiers and other fuzzy classifiers if there are no discrete input variables     

On Interval Systems [<Emphasis Type="Italic">x</Emphasis>] = [<Emphasis Type="Italic">A</Emphasis>][<Emphasis Type="Italic">x</Emphasis>] + [<Emphasis Type="Italic">b</Emphasis>] and the Powers of Interval Matrices in Complex Interval Arithmetics

For the interval system of equations defined by [x] = [A][x] + [b] we derive necessary and sufficient criteria for the existence of solutions [x]. Furthermore we give necessary and sufficient criteria for the convergence of powers of [A]. In contrast to former results we treat complex interval arithmetics.     

Analyzing clusters of class characteristics in OO applications

The transition from Java 1.4 to Java 1.5 has provided the programmer with more flexibility due to the inclusion of several new language constructs, such as parameterized types. This transition is expected to increase the number of class clusters exhibiting different combinations of class characteristics. In this paper we investigate how the number and distribution of clusters are expected to change during this transition. We present the results of an empirical study were we analyzed applications written in both Java 1.4 and 1.5. In addition, we show how the variability of the combinations of class characteristics may affect the testing of class members.