微型之字形压电式能量收集器输出电压的建模和仿真

为了有效解决无线传感器网络节点的供电难题,提出之字形结构的微型压电式能量收集器。相比于传统的直悬臂梁,此结构等效加大了压电梁的长度,降低了系统的固有振动频率。建立了之字形压电梁的本构方程和受迫振动方程,推导得到其输出电压的频域表达式。基于之字形压电梁的结构,利用ANSYS软件对其进行了谐响应分析。仿真结果表明,压电梁的输出电压在各阶固有振动频率处存在极值,符合理论分析的结果;输出电压大小随压电梁长度增加而降低,随压电梁宽度增加而升高,但均为非线性关系;压电梁末端质量块的长度和厚度、基体层厚度减小时,会导致输出电压的增大。在论文中所提出的结构尺寸下,10根直梁构成的之字形结构压电梁,在其一阶固有振动频率处,输出电压可达10 V以上,符合无线传感器网络节点的实际供电需求,证明了之字形压电梁结构的有效性。     

基于B/S结构的考勤系统设计

在分析考勤系统需求的基础上,结合实际学生考勤信息录入与汇总的特点,设计了基于B/S结构的课堂考勤系统。应用该系统可方便地进行学生考勤信息的录入、修改与管理,并可进行考勤信息的自动汇总。系统依据权限实现了角色分类,可按角色登录及查询具体的考勤信息,并可进行学生考勤信息的汇总和导出,提高了工作效率。     

GAMMA300型七自由度机械臂运动学仿真

针对机械臂的运动学问题以及运动路径的设计问题,以冗余度为1的美国ROBAI公司生产的7自由度冗余机械臂GAMMA300为具体研究对象,对七自由度机械臂进行运动学建模与仿真.利用Robotics Toolbox机器人工具箱编写该机械手的运动学程序.通过仿真实现了预定目标,验证了设计参数的正确性和可行性,为机械臂末端执行器的精确定位和轨迹规划提供了理论依据.对于冗余机械臂一般逆运动学封闭解的研究有一定的实用价值.     

数字绘画风格类型探析

数字绘画是绘画艺术、设计艺术及信息技术的结合体,它既承袭了传统手绘的艺术特征,又闪耀着了现代设计的理性光辉,在信息技术日益蓬勃的今天,数字绘画的风格类型在各国文化背景滋养下已种类繁多,琳琅满目。文章旨在对其风格类型做出分析比较,通过梳理当下各类风格的特征,以此为本土创作者提供更多参考与空间,以求创造差异并树立本土数字绘画的个性。     

High‐precision formation control of nonlinear multi‐agent systems with switching topologies: A learning approach

Arbitrary high precision is considered one of the most desirable control objectives in the relative formation for many networked industrial applications, such as flying spacecrafts and mobile robots. The main purpose of this paper is to present design guidelines of applying the iterative schemes to develop distributed formation algorithms in order to achieve this control objective. If certain conditions are met, then the control input signals can be learned by the developed algorithms to accomplish the desired formations with arbitrary high precision. The systems under consideration are a class of multi‐agent systems under directed networks with switching topologies. The agents have discrete‐time affine nonlinear dynamics, but their state functions do not need to be identical. It is shown that the learning processes resulting from the relative output formation of multi‐agent systems can converge exponentially fast with the increase of the iteration number. In particular, this work induces a distributed algorithm that can simultaneously achieve the desired relative output formation between agents and regulate the movement of multi‐agent formations as desired along the time axis. The illustrative numerical simulations are finally performed to demonstrate the effectiveness and performance of the proposed distributed formation algorithms. Copyright © 2014 John Wiley & Sons, Ltd.     

Recover Fault Services via Complex Service-to-Node Mappings in Wireless Sensor Networks

With the motivation of seamlessly extending wireless sensor networks to the external environment, service-oriented architecture comes up as a promising solution. However, as sensor nodes are failure prone, this consequently renders the whole wireless sensor network to seriously faulty. When a particular node is faulty, the service on it should be migrated into those substitute sensor nodes that are in a normal status. Currently, two kinds of approaches exist to identify the substitute sensor nodes: the most common approach is to prepare redundancy nodes, though the involved tasks such as maintaining redundancy nodes, i.e., relocating the new node, lead to an extra burden on the wireless sensor networks. More recently, other approaches without using redundancy nodes are emerging, and they merely select the substitute nodes in a sensor node’s perspective i.e., migrating the service of faulty node to it’s nearest sensor node, though usually neglecting the requirements of the application level. Even a few work consider the need of the application level, they perform at packets granularity and don’t fit well at service granularity. In this paper, we aim to remove these limitations in the wireless sensor network with the service-oriented architecture. Instead of deploying redundancy nodes, the proposed mechanism replaces the faulty sensor node with consideration of the similarity on the application level, as well as on the sensor level. On the application level, we apply the Bloom Filter for its high efficiency and low space costs. While on the sensor level, we design an objective solution via the coefficient of a variation as an evaluation for choosing the substitute on the sensor level.     

A study on effects of security risks on acceptance of enterprise cloud service: moderating of employment and non-employment using PLS multiple group analysis

This paper analyzed the effects of security risk factors fit for cloud computing paradigm on the acceptance of enterprise cloud service with intent to illuminate the factors for vitalizing the adoption of corporate cloud services in the future. The acceptance intention was set as a dependent variable. Independent variables were set in reference to the technology acceptance theory. Security risks were categorized into compliance risk, information leakage risk, troubleshooting risk and service discontinuation risk to design a model for analysis.     

Attribute reduction in interval-valued information systems based on information entropies

Interval-valued data appear as a way to represent the uncertainty affecting the observed values. Dealing with interval-valued information systems is helpful to generalize the applications of rough set theory. Attribute reduction is a key issue in analysis of interval-valued data. Existing attribute reduction methods for single-valued data are unsuitable for interval-valued data. So far, there have been few studies on attribute reduction methods for interval-valued data. In this paper, we propose a framework for attribute reduction in interval-valued data from the viewpoint of information theory. Some information theory concepts, including entropy, conditional entropy, and joint entropy, are given in interval-valued information systems. Based on these concepts, we provide an information theory view for attribute reduction in interval-valued information systems. Consequently, attribute reduction algorithms are proposed. Experiments show that the proposed framework is effective for attribute reduction in interval-valued information systems.     

Adaptive genetic algorithms guided by decomposition for PCSPs: application to frequency assignment problems

This paper proposes Adaptive Genetic Algorithms Guided by structural knowledges coming from decomposition methods, for solving PCSPs. The family of algorithms called AGAGD_x_y is designed to be doubly generic, meaning that any decomposition method and different heuristics for the genetic operators can be considered. To validate the approach, the decomposition algorithm due to Newman was used and several crossover operators based on structural knowledge such as the cluster, separator and the cut were tested. The experimental results obtained on the most challenging Minimum Interference-FAP problems of CALMA instances are very promising and lead to interesting perspectives to be explored in the future.