嵌入式系统可信启动机制设计与实现

嵌入式系统在生活中不可或缺,如何增强其安全性是急需解决的问题;现有解决办法局限于理论层面且不符合嵌入式系统实际需求;为实现嵌入式系统安全启动并满足其实际应用需求,设计并实现了嵌入式系统可信启动机制;该机制以可信计算理论为基础,提出一种适用于嵌入式环境的高效、透明的可信框架模型,设计完成嵌入式可信计算硬件模块(ETHM)以及其逻辑结构,构造可靠稳定的接口机制,实现了完整的可信链传递、操作系统高可信启动机制等技术的集成设计;通过实验验证,该可信机制对操作系统安全性可以进行准确判定,并做出正常启动或发出警告的正确指令;实验结果表明,该可信机制具备安全性、可靠性、高效性的特点,并满足嵌入式系统实际应用需求.     

基于LabVIEW的特殊复杂信号源研究与设计

围绕导航通信系统的抗干扰测试需求以及对现役无线电导航系统的性能评估任务,研究并设计了一种复杂环境下的信号源并给出了数学模型;该信号源设计要求能够产生包括理想、多径、干扰以及信道噪声在内的、具有天线效应的实际复杂信号;在多径延时的设置上,给出了一种精度更高,延时任意的信号生成方法;最后以PXIe-5672为硬件测试平台,由计算机软件LabVIEW产生波形数据,并通过控制仪器驱动实现信号的存储和发生,完成了整个信号源的设计;仿真结果表明了该设计方案可行有效.     

基于物联网的大学信息化教学辅助实验平台应用

在大学教学过程中,实验是一种必不可少的辅助手段。但是,面对日益增长的实验科研需求,一方面是设备使用紧张,另一方面是昂贵的实验器材不能够充分被利用,因此,如何实现实验设备的充分利用是大学信息化建设面临的一个主要问题。文章采用物联网技术将仪器设备布置于网络中,并允许用户通过远程访问使用仪器设备进行科研,同时通过一个具体实例来阐述物联网实验平台构造,从而提高设备使用率。     

全定制心电采集的模拟集成电路设计

设计和实现了一种应用于健康监测设备的采集心电信号的模拟集成电路(IC)。该电路系统包括集成了右腿驱动电路的仪表放大器,二阶有源低通滤波器,第二级放大电路,高电源抑制比(PSRR)的低压差线性稳压电源(LDO)以及导联脱落检测电路。与其他已有的方案相比,该全定制模拟集成电路系统集成了工业级应用所需要的全部功能,并且表现出更好的共模抑制和电源抑制性能。芯片采用SMIC0.18μmCMOS工艺流片,且已完成测试,通过电极成功采集到人体心电信号。测试结果表明,该模拟IC实现了在0.5~100Hz带宽内51dB的增益,系统的共模抑制比和电源抑制比为75dB和90dB。在2.9V~5.5V电源电压下正常工作时,芯片消耗190μA的电流。     

基于离散粒子群算法全局QoS最优的Web服务选择

Web服务选择是Web服务组合中重要问题,也是一个NP难问题,使用离散粒子群算法对该问题进行建模求解并针对粒子群算法后期容易陷入局部最优进行改进,借鉴遗传算法中杂交变异的思想对算法迭代后期的一部分粒子进行杂交变异,实验仿真证明,由于杂交变异的引入,能够求得Web服务组合全局QoS更优的解。     

Analytic center cutting plane method for multiple kernel learning

Multiple Kernel Learning (MKL) is a popular generalization of kernel methods which allows the practitioner to optimize over convex combinations of kernels. We observe that many recent MKL solutions can be cast in the framework of oracle based optimization, and show that they vary in terms of query point generation. The popularity of such methods is because the oracle can fortuitously be implemented as a support vector machine. Motivated by the success of centering approaches in interior point methods, we propose a new approach to optimize the MKL objective based on the analytic center cutting plane method (accpm). Our experimental results show that accpm outperforms state of the art in terms of rate of convergence and robustness. Further analysis sheds some light as to why MKL may not always improve classification accuracy over naive solutions.     

Reexamining the Factors for Trust in Cultivating Online Customer Repurchase Intentions: The Moderating Effect of Perceived Waiting

With the advancement of Internet technology, online shopping has emerged as a popular way of making purchases. However, because online shopping does not allow immediate enjoyment of purchases as bricks-and-mortar shops do, cultivating customers' trust in online businesses is especially important in attracting return customers. Previous studies have put forward the factors that build multidimensional trust but not systematically examined them. This article reexamines factors of building customer trust and makes a systematic study of the relationship between customers' perceived waiting and repurchase intention. This study examines online stores' professional ability, integrity, and benevolence were selected as the three constructing factors of trust. A total of 351 valid customer questionnaires were collected and analyzed using structural equation modeling. It was found that the most influential factor in customer trust was the security of the online business' information system, followed by the privacy protection, whereas the third-party guarantees and recommendation exhibited the third strongest correlation. Furthermore, the perceived waiting was a significant factor affecting customers' decision to return, notwithstanding their trust in an online business.     

Technology-Based Service Encounters Using Self-Service Technologies in the Healthcare Industry

Although there have been studies discussing the influence of technology-based services on the overall service efficiency and quality of organizations in various industries, very little effort has been devoted to investigating this issue in the healthcare industry. Hospital image is considered to be a crucial factor influencing patients' choice of hospitals, but few studies specifically examine its association with technology-based services. By consulting the model of the European Customer Satisfaction Index, a research model for evaluating the impact of the use of technology-based services on hospital image, patient satisfaction, and patient loyalty in the healthcare industry is developed and examined in this study using survey data collected from 738 patients at two medical centers with an online appointment system. The research results confirm the importance of providing quality, technology-based services in enhancing hospital image, patient satisfaction, and patient loyalty. The implications of this research and suggestions for future work are also discussed.     

Ergonomic Analysis of Head‐Mounted Night Vision Goggle Systems in Simulated Ground Operations

This study compared the mounting time and strain on the head‐neck while using an old model (forehead and cheek supported) and a new model (head harness supported) of head‐mounted night vision goggle systems in the postures of standing, sitting, and lying prone. The results showed that effectively reducing the mounting time was attributed to the ease and less time required for length adjustments of the head harness in the new model. The novel device received higher positive subjective ratings for convenience and comfort while wearing than did the old model. Although the weight of the new model was decreased to 0.794 kg and the length was reduced to 0.155 m, the loads on the head‐neck complex remained high. These findings suggest that a rifle should be fitted with the night vision goggle or handheld model to decrease neck‐shoulder workload if the prone position is the most frequent and important posture for soldiers. © 2011 Wiley Periodicals, Inc.     

Bounded parallel-batching scheduling with two competing agents

We consider a scheduling problem in which two agents, each with a set of non-preemptive jobs, compete to perform their jobs on a common bounded parallel-batching machine. Each of the agents wants to minimize an objective function that depends on the completion times of its own jobs. The goal is to schedule the jobs such that the overall schedule performs well with respect to the objective functions of both agents. We focus on minimizing the makespan or the total completion time of one agent, subject to an upper bound on the makespan of the other agent. We distinguish two categories of batch processing according to the compatibility of the agents. In the case where the agents are incompatible, their jobs cannot be processed in the same batch, whereas all the jobs can be processed in the same batch when the agents are compatible. We show that the makespan problem can be solved in polynomial time for the incompatible case and is NP-hard in the ordinary sense for the compatible case. Furthermore, we show that the latter admits a fully polynomial-time approximation scheme. We prove that the total completion time problem is NP-hard and is polynomially solvable for the incompatible case with a fixed number of job types.