Smart pricing scheme: A multi-layered scoring rule application

Defining appropriate pricing strategy for smart environment is important and complex task at the same time. It holds the primal fraction in Demand Response (DR) program. In our work, we devise an incentive based smart dynamic pricing scheme for consumers facilitating a multi-layered scoring rule. The proposed strategy characterizes both incentive based DR and price based DR programs facilities. This mechanism is applied between consumer agents (CA) to electricity provider agent (EP) and EP to Generation Company (GENCO). Based on the Continuous Ranked Probability Score (CRPS), a hierarchical scoring system is formed among these entities, CA–EP–GENCO. As CA receives the dynamic day-ahead pricing signal from EP, it will schedule the household appliances to lower price period and report the prediction in a form of a probability distribution function to EP. EP, in similar way reports the aggregated demand prediction to GENCO. Finally, GENCO computes the base discount after running a cost-optimization problem. GENCO will reward EP with a fraction of discount based on their prediction accuracy. EP will do the same to CA based on how truthful they were reporting their intentions on device scheduling. The method is tested on real data provided by Ontario Power Company and we show that this scheme is capable to reduce energy consumption and consumers’ payment.     

Double auction mechanisms on Markovian networks

This paper studies the double auction (DA) mechanism in Ma and Li (2011) for a class of exchange economies. We extend their results to more general cases where sellers and buyers each form a complex time non-homogeneous Markovian chain, as specified in Ram et al. (2009), in the communication of their private information. A numerical example is also provided. Both bubbles and crashes are observed in the example, consistent with results of our theorems. Our example and theoretical results provide new evidence that a DA mechanism, widely utilized in real exchange markets, may contribute to the excess volatility identified in Shiller (1981) and LeRoy and Porter (1981).     

TuLP: A Family of Lightweight Message Authentication Codes for Body Sensor Networks简

A wireless sensor network （WSN） commonly whilst a body sensor network （BSN） must be secured with requires lower level security for public information gathering, strong authenticity to protect personal health information. In this paper, some practical problems with the message authentication codes （MACs）, which were proposed in the popular security architectures for WSNs, are reconsidered. The analysis shows that the recommended MACs for WSNs, e.g., CBC- MAC （TinySec）, OCB-MAC （MiniSec）, and XCBC-MAC （SenSee）, might not be exactly suitable for BSNs. Particularly an existential forgery attack is elaborated on XCBC-MAC. Considering the hardware limitations of BSNs, we propose a new family of tunable lightweight MAC based on the PRESENT block cipher. The first scheme, which is named TukP, is a new lightweight MAC with 64-bit output range. The second scheme, which is named TuLP-128, is a 128-bit variant which provides a higher resistance against internal collisions. Compared with the existing schemes, our lightweight MACs are both time and resource efficient on hardware-constrained devices.     

基于运行时模型的多样化云资源管理方法

多样化的受管资源和不断变化的管理需求,使得云管理面临很大的难度和复杂度.面对一个新的特定的管理需求,管理员往往是在已有管理软件的基础上进行二次开发,通过管理功能的获取和组织来构造新的管理系统.然而,由于缺乏通用的方法,二次开发的难度和复杂度依然很大.为了能够根据管理需求快速定制、集成、扩展已有的管理软件,提出一种基于运行时模型的多样化云资源管理方法.首先,在系统管理接口的基础上构造不同受管资源的运行时模型;其次,通过对不同的运行时模型进行合并,来构造包含所有目标受管资源的组合模型;最后,通过组合模型到用户特定模型的转换,来满足特定的管理需求.在OpenStack与Hyperic两款独立管理软件的基础上,实现了基于运行时模型的虚拟机软、硬件资源统一管理系统,验证了方法的可行性和有效性.     

旅行商问题中巡回路径的数据结构

旅行商问题中巡回路径的数据结构对局部启发式算法的效率起着非常关键的作用。巡回路径的数据结构必须能够查询一条回路中每个城市的相对顺序,并且能够将一条回路中的部分城市逆序。分析了数组表示法、伸展树表示法和两级树表示法表示巡回路径时各种基本操作的实现过程及时间复杂度。数组表示法能够在常数时间内确定一条回路中每个城市的相对顺序,但是最坏情况下完成逆序操作需要Ω（n）时间,不适用于大规模的旅行商问题。伸展树表示法执行查询和更新操作的平摊时间复杂度是O（logn）,适用于极大规模的旅行商问题。而两级树表示法在最坏情况下每一个更新操作的时间复杂度是O（n^0.5）,适用于大规模的旅行商问题。     

Holographic algorithms on bases of rank 2

An essential problem in the design of holographic algorithms is to decide whether the required signatures can be realized under a suitable basis transformation (SRP). For holographic algorithms with matchgates on domain size 2, , ,  and  have built a systematical theory. In this paper, we reduce SRP on domain size k≥3$k\ge 3$ to SRP on domain size 2 for holographic algorithms with matchgates on bases of rank 2. Furthermore, we generalize the collapse theorem of [3] to domain size k≥3$k\ge 3$.     

Counting maximal independent sets in directed path graphs

The problem of counting maximal independent sets is #P-complete for chordal graphs but solvable in polynomial time for its subclass of interval graphs. This work improves upon both of these results by showing that the problem remains #P-complete when restricted to directed path graphs but that a further restriction to rooted directed path graphs admits a polynomial time solution.     

Triangle strings: Structures for augmentation of vertex-disjoint triangle sets

Vertex-disjoint triangle sets (triangle sets for short) have been studied extensively. Many theoretical and computational results have been obtained. While the maximum triangle set problem can be viewed as the generalization of the maximum matching problem, there seems to be no parallel result to Berge's augmenting path characterization on maximum matching (C. Berge, 1957 [1]). In this paper, we describe a class of structures called triangle string, which turns out to be equivalent to the class of union of two triangle sets in a graph. Based on the concept of triangle string, a sufficient and necessary condition that a triangle set can be augmented is given. Furthermore, we provide an algorithm to determine whether a graph G with maximum degree 4 is a triangle string, and if G is a triangle string, we compute a maximum triangle set of it. Finally, we give a sufficient and necessary condition for a triangle string to have a triangle factor.