Multi‐Unit Bayesian Auction with Demand or Budget Constraints

We consider the problem of revenue maximization on multi‐unit auctions where items are distinguished by their relative values; any pair of items has the same ratio of values to all buyers. As is common in the study of revenue maximizing problems, we assume that buyers' valuations are drawn from public known distributions and they have additive valuations for multiple items. Our problem is well motivated by sponsored search auctions, which made money for Google and Yahoo! in practice. In this auction, each advertiser bids an amount b_i to compete for ad slots on a web page. The value of each ad slot corresponds to its click‐through‐rate, and each buyer has her own per‐click valuations, which is her private information. Obviously, a strategic bidder may bid an amount that is different with her true valuation to improve her utility. Our goal is to design truthful mechanisms avoiding this misreporting. We develop the optimal (with maximum revenue) truthful auction for a relaxed demand model (where each buyer i wants at most d_i items) and a sharp demand model (where buyer i wants exactly d_i items). We also find an auction that always guarantees at least half of the revenue of the optimal auction when the buyers are budget constrained. Moreover, all of the auctions we design can be computed efficiently, that is, in polynomial time.     

物联网安全课程教学与实践方法的探索

目前《物联网安全》课程的教学体系尚未完善,教学内容、教学目标和知识点要求不清晰.针对这些问题,文章对物联网安全课程中知识点内容讲解的组织,实验内容的选择等方面有针对性地提出了一些教改方案和设想,旨在引导学生加深对物联网安全的认识,培养学生对物联网技术的学习兴趣.     

试析Web程序中常见字符串问题的处理

从PHP实现字符串的正确输出入手,分析了PHP中相关字符串处理函数在Web程序开发中发挥的重要作用。     

Evolutionary level set method for structural topology optimization

This paper proposes an evolutionary accelerated computational level set algorithm for structure topology optimization. It integrates the merits of evolutionary structure optimization (ESO) and level set method (LSM). Traditional LSM algorithm is largely dependent on the initial guess topology. The proposed method combines the merits of ESO techniques with those of LSM algorithm, while allowing new holes to be automatically generated in low strain energy within the nodal neighboring region during optimization. The validity and robustness of the new algorithm are supported by some widely used benchmark examples in topology optimization. Numerical computations show that optimization convergence is accelerated effectively.     

车用尾气催化转化器结构的计算辅助设计与分析系统

采用ＡｕｔｏＬＩＳＰ语言,编制了运行于ＡｕｔｏＣＡＤ平台上的车用尾催化转化器结构的计算辅助设计与分析系统。该系统结合了参数化设计与性能分析功能,并采用对话框驱动执行的方式,使系统的使用具有直观、方便的特点,可为车用尾气催化转化器的研制工作提供有益帮助。,     

综合业务和区分业务比较研究

为了在Internet上提供有服务质量等级和保证的服务,现在已经提出的在传输层上的实现方案包括综合业务（Integtated Services）和区分业务（Differentiated Services)。本文分析了两种方案的体系结构、工作原理和服务类型,比较了二者在设计思想、实现机制、QoS特性等方面的差异和优缺点,介绍了两种模型相互结合的扩展体系结构及最新研究进展。     

大纯滞后过程的采样控制及其工程实现中的若干问题

提出了采样控制机制的新观点,介绍控制器参数确定的新方法,分析了采样控制的质量,指出了在工程实施应考虑的若干问题。     

一个基于加权和组合降维的web文本分类系统

设计了一个web文本分类系统,采用了基于统计分析和粗糙集组合的方法进行降维;降维时考虑了属性的位置信息,采用加权方式标注属性的不同重要性,以达到提高分类速度和分类准确度的目的。     

Equilibria and their bifurcations in a recurrent neural network involving iterates of a transcendental function.

Some practical models contain so complicated mathematical expressions that it is hard to determine the number and distribution of all equilibria, not mentioning the qualitative properties and bifurcations of those equilibria. The three-node recurrent neural network system with two free weight parameters, originally introduced by Ruiz, Owens, and Townley in 1997, is such a system, for which the equation of equilibria involves transcendental function tanh(x) and its iterates. Not computing coordinates of its equilibria, in this paper, we display an effective technique to determine the number and distribution of its equilibria. Without full information about equilibria, our method enables to further study qualitative properties of those equilibria and discuss their saddle node, pitchfork, and Hopf bifurcations by approximating center manifolds.     

基于用户查询的多关系群体挖掘改进算法

多关系群体挖掘是近年来快速发展的重要的数据挖掘领域之一.传统的群体挖掘方法是假定网络中只有一种关系,并且挖掘结果与用户需求无关.但现实中的社会网络中存在着多种关系.基于用户查询,不同的关系表现出不同的重要性.分析了多关系群体挖掘中关系提取的问题,提出一种新算法对满足用户期望的关系进行最优线性合并.利用获得的合并关系提高群体挖掘的精准性.