基于物联网的实体店商品评价信息系统的设计

商品的评价信息会直接影响消费者的主观决策,但实体店商品评价信息消费者却无法及时获取.为使消费者能够了解实体店的商品评价信息,设计并实现了基于物联网技术的实体店商品评价信息模型系统.系统通过对近场通信NFC标签的读写和基于二维码快速导航的B/S模式商品评价系统的信息查存,实现了商品联网、评价信息共享等功能.评价数据共享模型系统的建立,既方便了消费者,也为商家改良商品提供了具有参考价值的信息.     

基于Web的油气资源评价软件实现

传统的油气资源评价软件以单机版为主,文中提出了基于Web的油气资源评价软件的主要架构,应用ExtJS技术、Ajax技术实现了基于Web的非参数发现序列评价软件及USGS非常规评价软件,并为多用户并发访问建立了多用户并发平台.基于Web的油气资源评价软件实现了将评价参数信息、评价计算及评价结果信息提交Oracle数据库,该研究为进一步开发油气资源评价软件打下了基础.     

图像融合评价方法的研究

图像融合就是用一种特定的算法将两幅或多幅图像合成为一幅新图像.图像融合的评价包括主观评价和客观评价.本文总结介绍了现有的图像融合评价方法,其中着重介绍了图像融合的客观评价方法,可分为5类:统计特性评价方法;信息量评价方法;图像清晰度评价方法;信噪比评价方法;光谱信息评价方法.然后又介绍了两种新的图像融合评价方法,最后提...     

基于层次分析法的营销全业务量化积分评价体系构建研究

紧紧围绕现代服务体系建设要求,以评价因子为基础,以量化积分为路径,以权重配比为条件,构建了营销全业务量化积分评价体系。以层次分析法为基础进行建模仿真,探索形成适合营销专业特点的评价模型,保证结果客观公正,全程化覆盖,实现总体评价精准。该评价体系首次实现了对营销全业务总体评价的打分,同时总体评价又可细分为过程评价和专业评价,可以更加精准地实现对营销的全业务管控,保障业务规范运作。实践表明,项目实施有力推动了营销工作的自我修复和自我提升,助力电力营商环境优化。     

基于微课的“翻转课堂”教学评价体系研究

文章分析了传统教学评价方法存在的问题,并提出了基于微课的"翻转课堂"教学评价体系。该教学评价体系是以课前准备、课堂学习和课后复习(作品展示)为基线,进行全过程考核的评价体系,并提出了课前评价、课堂评价和课后评价的质量指标体系。     

基于模糊物元的构件质量评价模型

基于构件的软件开发是软件复用的有效方法,构件质量评价将为构件开发提供良好的可见性.目前的构件质量评价模型都是静态的,即无论构件在任何应用环境中,对构件的质量评价都为相同值.借鉴ISO/IEC9126软件质量评价模型,提出了构件质量评价指标体系.将可拓学中的动态物元引入评价模型,采用动态物元描述构件质量,并用模糊物元评价方法对构件质量进行评价.建立了随应用环境变化的基于模糊物元的构件质量评价模型.     

基于Web的多元教师评价系统的研究

本文主要对新时期以来,我国教育评估研究取得的主要进展和对未来需要进一步研究的问题作了探讨,制定出了一整套教师评价的较为科学的标准,并以ASP.NET为开发平台开发出了多元教师评价系统。该系统实现了网上评价主体的多元化,根据科学的评价权重分析,计算出每个教师的最后得分,寓科学性、简便性、公平性为一体,减轻了教师评价过程中的工作量。同时,该系统具有广泛性和通用性,对教学工作的进一步规范化、标准化,也会起到一定的促进作用。     

关于声学设计的“主观评价”标准的讨论

笔者曾就家庭影院声学设计的客观评价为大家进行了深入浅出的分析,并辅以测试设备及声学测试步骤的简介,基本上把室内声场的客观评价方法教给了大家。但是,这只是评价家庭影院声音音质的一个方面。本章,笔者将从专业的声学角度来为大家解析家庭影院中声音主观评价的标准,教大家如何用"耳朵"来"说话"。对声音的评价主要可分为两类:一类是客观评价。客观评价是指使用测试仪器进行测试得到的结果。这种测试方法严格,仪器昂贵,数据较为准确,具有很高的参考价值。但这种结果不容易理解,还可能与真实的聆听感受略有区别。另一类就是主观评价。所谓的主观评价是相对于客观评价而言的,并非主观随意描述。主观评价是通过主观感受对实际声音进行评价。进行主观评     

基于运行统计的网络管理系统连接质量模糊评价

为了评价网络管理系统的运行质量,提出了网络管理系统连接质量的概念,给出了建立连接质量评价指标体系的参考建议,设计了一组反映连接质量的评价指标体系并以连接质量作为考核网络管理系统运行质量的重要指标.应用模糊数学中的模糊评价算法建立了评价基于运行统计的网络管理系统连接质量的模糊评价模型,以不同本地话务汇接局网管数据为实例,构建了相应的连接质量实例并应用模糊评价方法对其进行了模糊评价,从而获得网络管理系统运行质量的量化评价结果.     

基于VB.net的金融生态评价系统设计开发

为了构建和谐的金融生态环境,高效的金融生态评价系统是必需的。文中采用层次分析法构建了宝鸡市金融生态环境评价指标体系,基于VB.net开发工具,采用SQL Server 2000作为后台数据库设计出了一个金融生态环境评价系统。并以宝鸡市各县区为例,通过金融生态环境评价系统进行宝鸡市金融生态环境水平评价。评价结果表明,评价系统的设计实现了金融生态环境评价的准确化、自动化、高效化,并为下一步利用评价结果分析建立数字化的金融生态系统奠定了良好的基础。     

Bounding algorithms for two-terminal network reliability

Determining the exact reliability of a complex network involves extremely large amount of computation. Consequently, it is appropriate to discuss method for approximating network reliability. This paper develops methods for obtaining upper and lower bounds for two-terminal network reliability. Construction of different layers for a network is used to develop an algorithm to compute an upper bound for the reliability of a network. The nodes of this network are completely reliable and arcs fail statistically independently with known probabilities. A simple approach, to obtain a lower bound for the reliability of the network is also presented. Examples illustrate the use of the algorithms and show that the proposed bounds fare better than the well-known Esary and Proschan bounds.     

A design technique for reliable networks under a nonuniform trafficdistribution

Many network-reliability analysis techniques define and compute a variety of reliability measures. Most techniques assume that network connectivity is the only determining factor in network reliability; and merely analyze an existing network structure but do not provide any methodology for reliable design. This paper presents a heuristic design algorithm to enhance the reliability of existing communication networks by modifying their topology. This algorithm improves the reliability of the least reliable node (reliability is the probability that messages transmitted from a given node reach their destination). To use this algorithm on large networks, a reliability analysis method is developed which determines approximate network reliability values in linear-time when an upper bound is placed upon the in-degree of all network nodes. The heuristic network design algorithm uses this approximate reliability analysis technique to place additional links. The goal of this link placement is to improve the reliability of the least-reliable node. The placement of additional links is a function of both the traffic distribution and the connectivity of the network. This process continues until either a desired level of network reliability is achieved or a maximum number of additional links has been added. A unique feature of this design strategy is that it has quadratic time-complexity when the maximum in-degree of all network nodes is limited     

A New Algorithm for the Reliability Analysis of Multi-Terminal Networks

In a probabilistic network, source-to-multiple-terminal reliability (SMT reliability) is the probability that a specified vertex can reach every other vertex. This paper derives a new topological formula for the SMT reliability of probabilistic networks. The formula generates only non-cancelling terms. The non-cancelling terms in the reliability expression correspond one-to-one with the acyclic t-subgraphs of the network. An acyclic t-subgraph is an acyclic graph in which every link is in at least one spanning rooted tree of the graph. The sign to be associated with each term is easily computed by counting the vertices and links in the corresponding subgraph. Overall reliability is the probability that every vertex can reach every other vertex in the network. For an undirected network, it is shown the SMT reliability is equal to the overall reliability. The formula is general and applies to networks containing directed or undirected links. Furthermore link failures in the network can be s-dependent. An algorithm is presented for generating all acyclic t-subgraphs and computing the reliability of the network. The reliability expression is obtained in symbolic factored form.     

An efficient algorithm for computing global reliability of anetwork

Global reliability of a network is defined and then evaluated using spanning trees of the network graph. An algorithm for generating spanning trees (termed, appended spanning trees) that are mutually disjoint is proposed. Each appended spanning tree represents a probability term in the final global reliability expression. The algorithm gives the global reliability of a network directly. It is illustrated with an example. The algorithm is fast, requires very little memory, is adaptable to multiprocessors, and can be terminated at an appropriate stage for an approximate value of global reliability     

节点不完全可靠无向网络k-端可靠度计算

可靠性是保障网络系统正常运行的必要条件,k-端可靠性问题是网络可靠性的最一般问题.通过对已有的计算2-端可靠度的方法进行扩展和改进,提出了一种计算节点不可靠无向网络k-端可靠度的方法.先将图的边定义为链路及其端点,然后通过矩阵变换运算,得到不相交的k-端路径,在此基础上,利用条件概率对k-端路径的概率进行求解以得到网络...     

Reliability Evaluation in Computer-Communication Networks

The network reliability for a computer-communication network is defined and a method based on spanning trees is proposed for its evaluation. The network reliability expression and s-t terminal reliability expression are compared assuming an equal probability of survival for each communication link. Examples illustrate the method.     

无线传感器网络可靠性建模方法

无线传感器网络部署设计的基础就是可靠性,因此,对无线传感器网络可靠性研究已经成为全世界在这个领域中研究的一个重点内容。无线传感器网络可靠性研究的一个有效方法就是建立数学模型。为了能够更好地进行无线传感器网络可靠性的建模,本文先介绍了无线传感器网络结构和节点模型,然后主要对无线传感器网络可靠性建模方法进行分析,提出了K-可靠性模型,并对无线传感器网络系统设计时参考依据进行简单说明。经过实践证明,无线传感器网络的可靠性完全能够通过K-可靠性模型进行测量。     

移动核心网电路域CE结构性隐患优化简

分析了移动核心网电路域CE组网的现状，指出原先CE接入网设计中存在结构性网络安全隐患，例如当单个路由器或接口故障时，会导致业务的中断。针对上述隐患提出网络安全隐患优化解决方案。该方案在实践中得到了验证，能有效消除了网络结构性安全隐患，增强网络的安全性和可靠性。     

Reliability optimization of computer-communication networks

The evaluation of the reliability of a given computer communication network is a NP-hard problem. Hence, the problem of assigning reliabilities to links of a fixed computer communication network topology to optimize the system reliability is also NP-hard. A heuristic method is developed to assign links to a given topology so that the system reliability of the network is near optimal. The method provides a way to assign reliability measures to the links of a network to increase overall reliability. It is based on the principle that the most reliable link should be assigned to the most vulnerable edge. The method computes an importance order for the edges of the network and uses the order to assign link reliabilities. If there are fewer than six links in a network, it can be shown that the method gives optimal assignment     

Ad Hoc网络可靠性评估

针对一种特殊的通信网Ad Hoc网络,提出了一种可靠性评估算法,首先根据物理拓扑抽象出Ad Hoc网络模型,并充分分析Ad Hoc网络特点确定失效判据,依据失效判据进行可靠性建模,选择合适的可靠性模型。将Ad Hoc网络模型划分为逻辑上的一个个子区域,采用层次分析法确定各个子区域的权重系数,在各子区域内,利用最小定点割集确定Ad Hoc网络中的重要节点,同时根据生成树算法确定重要节点的权重系数,从而可以计算出Ad Hoc网络的可靠度。最后通过实例说明某Ad Hoc网络的可靠性评估。