卖场POP与POP制作系统

POP的含义 POP意思是“销售现场的广告”，由厂家提供的POP称为产品宣传POP，这种POP只宣传一个品牌，使用周期比较长。对于零售业者来说，使用最多的是自己制作的POP,也就是我们以下重点讲的“卖场POP”。     

基于Web的POP在线设计制作系统的实现

鉴于现有的单机版的POP系统不能满足大型连锁超市对POP的管理和需求，介绍了国内首个基于Web的POP流程管理和网上设计制作系统，用户能根据自己店铺的促销计划通过Internct管理POP计划，并按自己的要求在网上定制促销商品的POP，下载到本地打印。     

POP广告设计课程中的定位研究

本文通过对POP广告概念、种类、功能及其制作的介绍,结合在POP广告设计课程教学中存在的问题进行分析,提出设计POP广告的前提是要明确定位的问题,并以视觉传达的角度从目标定位、表现策略定位、表现形式定位这几个方面来研究POP广告设计中的具体问题,以此证实POP广告设计的定位思想是一种具有战略眼光的设计指导思想。     

证书更新时加密私钥拥有证明研究

为了解决证书更新过程时的加密私钥的拥有证明（Proof of Possession,POP）问题,首先对加密私钥的一些POP方法进行了研究,然后提出一个间接、基于轻量级目录服务器（the Lightweight Directory Access Protocol,LDAP）目录服务协议的Schema,它在证书更新的过程中和加密私钥POP紧密地联系在一起,很好地解决了加密私钥的POP问题,最后用实例来说明了加密私钥POP的管理过程。     

POP3协议异步方式的实现

本文讲述了如何采用异步方式在嵌入式系统中实现POP3协议接收邮件。首先简述了POP3协议的各个命令及其在异步方式中使用时所要注意的事项，其次讲述了为何采用异步方式，然后介绍POP3协议的收信过程，最后是对收取到的数据进行反编码，其中要涉及两种编码方式，即Quote_Printable编码和BASE64编码。     

软件情报站

POP熊虽然开始减肥了，但对美食的兴趣依然是丝毫不减。自从在网上看到了君之的烘焙博客，那精美的蛋糕和饼干彻底诱发TPOP熊的食欲，并让POP熊也萌发了自己做蛋糕的想法。POP熊乃是行动派，马上就网购了烘焙书籍、     

新软情报站

说实话，POP熊长这么大还没出过国，就连坐飞机都是10年前的事情了。前几天一位朋友从泰国旅游回来，把旅途见闻说得天花乱坠，让POP熊羡慕不已呀!     

新软情报站

夏日炎炎呀，最适合户外运动，前两周的张家界之行，爬了几天山让POP熊累得不行，但好处却是肚子变小了点。这周POP熊开始游泳了，希望能把腹肌从一块练成六块!     

一种基于SSH的电子邮件安全传输方式

讨论了目前邮件传输中存在的安全问题，分析了SSH的概念，特性和工作原理，提出了一种通过SSH为电子邮件提供传输安全的方案，并以POP3服务为例，给出了系统的实现过程和测试结果。     

新软情报站

春节要到了，POP熊在此给大家拜年了!传说虎年是寡年，所以赶在年前结婚的朋友还真不少，POP熊这段时间就收到了不少的红色“罚款单”眼瞅着过年还要给小辈们发压岁钱，     

反馈集问题的研究进展

反馈集问题是经典的NP难问题,在电路测试、操作系统解死锁、分析工艺流程、生物计算等领域都有重要应用,按照反馈集中元素类型可分为反馈顶点集(FVS)问题和反馈边集(FAS)问题。人们利用线性规划和局部搜索等技术设计了一系列关于FVS和FAS问题的近似算法,并基于分枝一剪枝策略和加权分治技术提出了FVS问题的精确算法。随着参数计算理论的发展,近年来参数化反馈集问题引起了人们的重视,并取得了很大突破。目前已经证明了无向图和有向图中FVS问题和FAS问题都是固定参数可解的(FPT)。利用树分解、分支搜索、迭代压缩等技术,对无向图FVS问题提出了一系列FPT算法。针对某些特殊的应用,人们开展了对具有特殊性质的图上FVS问题的研究,提出了一些多项式时间可解的精确算法。现首先介绍了在无向图中关于FVS问题的近似算法与精确算法,然后具体分析了FVS问题的参数化算法。进一步阐述了关于有向图和特殊图上FVS问题的研究现状,介绍了FAS问题的研究成果。基于对反馈集问题研究现状的分析,提出了今后FVS问题研究中值得关注的几个方面。     

特殊图的图修正问题研究综述

图修正问题是指在一个图中进行删除点、删除边或加边操作,使这个图转变成另一个具有某种特殊性质的图。图修正问题一直被广泛研究,尤其对弦图、区间图以及单位区间图的图修正问题的研究更是如此。弦图是完美图中最重要的一类图,也是(单位)区间图的父类图,很多经典的NP难问题在弦图上都是多项式可解的。区间图以及单位区间图在生物计算上有着广泛的应用。对这几类图的图修正问题的研究对计算机理论和实践有很大的贡献。首先介绍并总结了关于弦图、区间图以及单位区间图的图修正问题的重要算法和技术,然后对这些问题的研究现状进行分析,并提出了今后研究中值得关注的问题。     

网络编码中的优化问题研究

简要回顾了网络编码的理论研究,阐述了网络编码优化问题研究的重要意义.在介绍网络信息流模型的基础上,针对优化问题的陈述、特点和解法,结合最新的研究成果进行了综述.根据优化目标的不同,优化问题可分成4类:最小花费组播,无向网络的最大吞吐率,最小编码节点、编码边,基于网络编码的网络拓扑设计.归纳了问题的求解性质,对其中的(线性或凸)规划问题总结了求解的一般方法,对NP完全问题讨论了最新的启发式算法及其设计难点.同时,展望了未来的发展方向.     

Optimization Models Of Anti-Terrorist Protection*

The paper gives an overview of a number of mathematical models and problems on planning anti-terrorist and special actions. These are problems of monitoring a territory, protecting critical infrastructure (described by optimization models), interdicting transport and information networks. It is shown that many territory control problems can be reduced to well-known optimization problems on graphs, shortest paths search, and minimal covering on graphs. The problems of protecting critical infrastructure and interdicting networks are reduced to stochastic minimax game problems.     

Bi-level and Multi-Level Programming Problems: Taxonomy of Literature Review and Research Issues

This paper presents taxonomy of detailed literature reviews on bi-level programming problems (BLPPs), multi-level programming problems (MLPPs) and associated research problems, while providing detail of solution techniques at the same time. In this taxonomy of review, we classified the multi-level programming problems into two types: (i) General multi-level programming problems (MLPPs) (ii) multi-level multi-objective programming problems (ML-MOPPs) which are further sub classified based on the algorithmic and optimality studies. Bi-level programming problems (BLPPs) are considered as special cases of multi-level programming problems with two level structures. The present literature review includes approximately all prior and latest references on BLPPs, and MLPPs, related solution methodologies. The general related concepts are briefly described while associated references are included for further investigations. The aim of this paper is to provide an easy and systematic road map of currently available literature studies on BLPPs and MLPPs for future researchers.     

Evolutionary Algorithms for Minimax Problems in Robust Design

Many robust design problems can be described by minimax optimization problems. Classical techniques for solving these problems have typically been limited to a discrete form of the problem. More recently, evolutionary algorithms, particularly coevolutionary optimization techniques, have been applied to minimax problems. A new method of solving minimax optimization problems using evolutionary algorithms is proposed. The performance of this algorithm is shown to compare favorably with the existing methods on test problems. The performance of the algorithm is demonstrated on a robust pole placement problem and a ship engineering plant design problem.     

基于最优子段的矩形优化排样

为有效解决企业实际生产中的矩形优化排样问题,对矩形优化排样算法进行研究, 给出基于最优子段的矩形优化排样算法,有效解决了企业实际生产中的长板矩形优化排样问题。 首先基于动态规划算法求出所有小于剪床刀刃长度的最优子段的最佳排样方式,然后以所求的最 优子段作为可用子段在长板上进行优化排样,并将矩形优化排样问题转化为完全背包问题。最后 基于分支定界技术的整数规划算法对其进行求解。企业应用实例表明该算法在解决长板矩形优化 问题方面优于其他算法。     

The effects of individually personalized computer-based instructional program on solving mathematics problems

This study investigated the effects of an individually personalized computer-based instructional program on the achievement and attitudes regarding mathematics computational problems and word problems of 104 middle school American students. Students were blocked by math entering knowledge based on pre-test scores, then randomly assigned to a personalized or non-personalized version of the computer-based instructional program. A significant two-way interaction (treatment by math entering knowledge) reflected that personalized higher-level math entering knowledge students and non-personalized higher-level math entering knowledge students had similar post-test scores but personalized lower-level math entering knowledge students scored significantly higher on the post-test than non-personalized lower-level math entering knowledge students. Another significant two-way interaction (math entering knowledge by problem type) reflected that students with higher-level math entering knowledge scored considerably higher on the computational problems than on the word problems while students with lower-level math entering knowledge scored significantly higher on the computational problems than on the word problems. Student attitudes were significantly more favorable toward the personalized computer-based instructional program.     

On a Class of Symmetric Optimization Problems

Optimization problems with criterion functions and admissible sets symmetric with respect to some transformations are considered. Conditions are studied which guarantee that solutions of these problems exist on a set of points fixed with respect to the initial transformation for continuous problems and on a set of quasifixed points for integer problems.     

Implicit branching and parameterized partial cover problems

Covering problems are fundamental classical problems in optimization, computer science and complexity theory. Typically an input to these problems is a family of sets over a finite universe and the goal is to cover the elements of the universe with as few sets of the family as possible. The variations of covering problems include well-known problems like Set Cover, Vertex Cover, Dominating Set and Facility Location to name a few. Recently there has been a lot of study on partial covering problems, a natural generalization of covering problems. Here, the goal is not to cover all the elements but to cover the specified number of elements with the minimum number of sets. In this paper we study partial covering problems in graphs in the realm of parameterized complexity. Classical (non-partial) version of all these problems has been intensively studied in planar graphs and in graphs excluding a fixed graph H as a minor. However, the techniques developed for parameterized version of non-partial covering problems cannot be applied directly to their partial counterparts. The approach we use, to show that various partial covering problems are fixed parameter tractable on planar graphs, graphs of bounded local treewidth and graph excluding some graph as a minor, is quite different from previously known techniques. The main idea behind our approach is the concept of implicit branching. We find implicit branching technique to be interesting on its own and believe that it can be used for some other problems.