Constructing the Co cyclic Structures for Crossed Copro duct Coalgebras

In this paper, we construct a cocylindrical object associated to two coal-gebras and a cotwisted map. It is shown that there exists an isomorphism between the cocyclic object of the crossed coproduct c...     

A method for image encryption based on fractional-order hyperchaotic systems

By using sequences generated from fractional-order hyperchaotic systems, a color image encryption scheme is investigated. Firstly, a plain image, which is known to users in advance, is chosen as a secret key to confuse the original image. Then, the confused image is encrypted by the sequences generated from the fractional-order hyperchaotic systems. With this simple encryption method, we can get an encrypted image that is fully scrambled and diused. For chaos-based image cryptosystems, this encryption scheme enhances the security and improves the eectiveness. Furthermore, the cryptosystem resists the dierential attack. Experiments show that the algorithm is suitable for image encryption, and some statistical tests are provided to show the high security in the end     

基于相机标定的双目三维景物重建方法

介绍了一种基于相机标定的双目静止镜头下的三维景物重建方法.方法假设已经通过相机标定的方法得到两个相机的内外投影矩阵参数,通过投影矩阵和几何的方法,配合图像配准技术,恢复感兴趣场景的深度信息,达到三维景物重建的目的.本方法主要是基于几何变换的方法,巧妙避开了三维投影矩阵的计算,直接从真实图像映射为虚拟极平面图像,可以达到比较好的效果.     

Linear Key Predistribution Schemes

In a key predistribution scheme, some secret information is distributed among a set of users. For a given family of privileged groups, this secret information must enable every user in a privileged group to compute a common key associated with that group. Besides, this common key must remain unknown to some specified coalitions of users outside the privileged group. We present in this paper a new model, based on linear algebraic techniques, for the design of key predistribution schemes that unifies all previous proposals. This new model provides a common mathematical formulation and a better understanding of key predistribution schemes. Two new families of key predistribution schemes that are obtained by using this model are presented. Those families provide, for some specification structures, schemes that have better information rates than the ones given in previous proposals or fit in situations that have not been considered before.     

Injective hulls are not natural

In a category with injective hulls and a cogenerator, the embeddings into injective hulls can never form a natural transformation, unless all objects are injective. In particular, assigning to a field its algebraic closure, to a poset or Boolean algebra its Mac-Neille completion, and to an R-module its injective envelope is not functorial, if one wants the respective embeddings to form a natural transformation. Received January 21, 2000; accepted in final form August 10, 2001. RID="h1" RID="h2" RID="h3" ID="h1"The hospitality of York University is gratefully acknowledged by the first author. ID="h2"Third author partially supported by the Grant Agency of the Czech Republic under Grant no. 201/99/0310, and the hospitality of York University is also acknowledged. ID="h3"Partial financial assistance by the Natural Sciences and Engineering Councel of Canada is acknowledged by the fourth author.     

Enterprise security economics: A self‐defense versus cyber‐insurance dilemma

We propose a model that optimizes enterprise investments in cybersecurity using expected utility theory. The model allows computing (a) investment in self‐defense to reduce the risk of security breaches, (b) investment in cyber insurance to transfer the residual risk to insurance companies, and (c) investment in forensic readiness to make the insured firms capable of generating provable insurance claims about security breaches. A three‐phase–based model of vulnerability rate evolution over time is proposed and used to estimate the different planned security expenditures throughout the investment horizon. At the starting time of investment, a decision maker invests to cover the existing risk of breach and periodically spends to cover the additional risk observed due to the release of new vulnerabilities. In this work, the intermediate tranches are determined while considering three different attitudes of decision makers, namely, optimistic, pessimistic, and realistic. An analysis is conducted to assess the performance of the proposed models.     

SFE-SSD: 浅层特征增强的SSD算法在小目标检测问题中的研究与应用

SSD (Single Shot Multibox Dectetor)算法由于具有高速且高精度的检测性能,是目前最好的目标检测算法之一.但由于提取检测框的特征层的特征信息不足, SSD算法在小目标检测任务中表现不佳.为了解决这个问题,目前大部分方法以严重牺牲检测速度为代价提升目标检测模型的精度. 本文提出了SFE-SSD (Shallow Feature Enhancement SSD)提升SSD模型在小目标检测任务中的性能.首先我们采用反卷积操作对SSD算法中检测框金字塔特征层的最浅特征层进行特征扩张.接着通过特征融合机制对扩张后的特征层进行特征增强操作.浅层特征增强策略与SSD 的原始框提取金字塔特征层是并行结构,一定程度上是可以减少检测速度的损失.实验结果显示,我们的方法在PASCAL VOC 2007数据库上精度达到了78.4\%mAP高于SSD算法1.2\%,检测速度达到了81帧/秒,并且在小目标检测任务中有着显著的提升.     

REPETITIVE CLUSTER-TILTED ALGEBRAS

Let H be a finite-dimensional hereditary algebra over an algebraically closed field k and C F m be the repetitive cluster category of H with m ≥ 1. We investigate the properties of cluster tilting objects in C F m and the structure of repetitive clustertilted algebras. Moreover, we generalize Theorem 4.2 in [12] (Buan A, Marsh R, Reiten I. Cluster-tilted algebra, Trans. Amer. Math. Soc., 359(1)(2007), 323-332.) to the situation of C F m , and prove that the tilting graph KCFm of C F m is connected.     

基于矩阵逻辑方程的识别对象状态转化研究

进行错误识别,首先我们需要研究识别的对象.因此,研究首先将错误识别对象分为识别状态、真是状态、应该状态和目标状态等四种状态,并且讨论了几种类型之间的关系.最后运用矩阵逻辑方程求解了识别状态转化为目标状态的转化方式.