一道数字排列题算法演示的C#实现

编程解决实际问题,不仅通过大量的编程实践,掌握一定的编程技巧,同时也需要找到解决问题的正确方案。通过一道数字排列题的解决演示,灵活运用C#语言编程实现该问题算法的可视化演示。     

基于Delphi的新老中国标准书号转换设计

介绍了国际标准书号的相关知识,分析了10位及13位中国标准书号的组成结构及其校验码的生成方法,并利用Delphi实现校验码生成及不同位数中国标准书号之间相互转换的程序。     

VB实现数字小写转大写算法

在开发一些财经类管理信息系统时,常常遇到人民币阿拉伯数字按照汉语习惯和规定自动转换成大写格式的问题。本文提供了一种简洁明了的算法,并在VB环境下完整实现。     

基于.NET框架的新型PACS系统设计

为提高图像归档与传输系统的可靠性和可移植性,提出一种.NET框架下PACS系统设计与的实现解决方案.该方案采用了双机热备数据库服务器、影像服务器与数据库服务器分离、在线-近线-离线三级存储和多点备份的体系结构,和采用检查、报告和管理3种业务流程.在对体系结构、业务流程、数据库设计和软件功能模决设计之后,详细描述通过数据模型层、教据访问层和用类工厂方法实现系统移植的方法,结果表明系统的可靠性和移植性得到增强.     

一种集群文件系统中的服务器发现协议

提出了非定向服务器发现协议,用于解决集群环境下服务器动态查找的问题。该协议以广播技术为基础,以GCFS集群文件系统为应用平台。在满足系统初启时能够正常工作的基本要求外,对系统的可扩展性、可恢复性以及可移植性都有较好的支持。很好地克服了定向查找在以上方面存在的不足。     

不同土壤湿度和雨强下径流曲线模型的改进

前期土壤湿度条件和降雨强度是影响径流曲线（SCS-CN）模型径流量预测精度的重要因素。分析不同流域下二者对SCS-CN模型性能的影响,对提高模型预测精度至关重要。基于5个半干旱半湿润和湿润流域的降雨径流资料,利用偏相关分析和K-均值聚类改进SCS-CN模型。结果表明：在重新划分前期土壤湿度条件区间后,模型预测能力大幅度提升,有效降低模型平均偏差,纳什效率系数平均提高42.8%。基于最大10 min雨强对SCS-CN模型改进后,纳什效率系数得到一定提高,且半干旱半湿润流域的提升幅度略大于湿润流域。改进的模型在研究流域都取得较好的效果,平均偏差均低于7 mm;除呈村流域非汛期外纳什效率系数均达到0.93,平均提升89%;均方根误差平均降低29.2 mm。     

Deteriorating job scheduling to minimize the number of late jobs with setup times

Deteriorating jobs scheduling problems have been widely studied recently. However, research on scheduling problems with deteriorating jobs has rarely considered explicit setup times. With the current emphasis on customer service and meeting the promised delivery dates, we consider a single-machine scheduling problem to minimize the number of late jobs with deteriorating jobs and setup times in this paper. We derive some dominance properties, a lower bound, and an initial upper bound by using a heuristic algorithm to speed up the search process of the branch-and-bound algorithm. Computational experiments show that the algorithm can solve instances up to 1000 jobs in a reasonable amount of time.     

NTRU参数选择方法的研究

NTRU算法是一种基于环的公开密钥体制,与RSA和ECC等典型的加密算法相比,在安全性和速度方面具有明显的优势。分析目前比较成熟的攻击NTRU方法,从安全的角度,根据不同的应用场合,给出NTRU加密参数选择方法,减少选择NTRU参数的盲目性,达到提高算法的执行速度、减少占用系统资源的目的。     

Unfriend or ignore tweets?: A time series analysis on Japanese Twitter users suffering from information overload

In recent years, with increased opportunities to post content on social media, a number of users are experiencing information overload in relation to social media use. This study addresses how Japanese Twitter users suffering from information overload cope with their stress, focusing on two actions: (1) The “unfriending” activities and (2) The changes in tweet processing methods. Objective data, such as numbers of friends, were collected through Twitter's open Application Programming Interfaces (APIs), and subjective data, such as perceived information overload and tweet processing methods, were collected through a web-based survey as a panel dataset (n = 778). The results demonstrated that although users experience information overload, they continue to increase their number of friends, and that the users who experience information overload modify their usage habits to avoid seeing all received tweets. In short, users do not choose a strategy to reduce the absolute number of received tweets, but only a strategy that involves changing the processing method of the received tweets.     

Estimating the number of usability problems

The number of usability problems discovered in a user trial or identified in a heuristic evaluation can never be claimed to be exhaustive. This raises the question of how many usability problems remained undetected. In ergonomics/human factors research this subject matter is often addressed by asking how many participants are sufficient to discover a specific proportion of the usability problems. Current approaches to answer this question suffer from various biasing mechanisms, which undermine the credibility of the popular ‘rule of thumb’ that five participants are sufficient for the discovery of 80% of ‘all’ usability problems. This 5-user rule appears to be speculative in its application as a stop rule. In this paper, I compare actual estimates of the number of usability problems. Underestimation surfaces as a permanent threat. The so-called Turing estimate (C_T) appears to be the most satisfactory. However, also C_T estimates may suffer from underestimation. Therefore max(C_T,C_F) with the C_F estimate based on partitioned frequencies is proposed as the most adequate estimate of the number of usability problems in the studies presented.