新一代液晶显示系统设计与实现

随着时代的演进和科技的进步,液晶显示已经在现代科技产品中得到广泛应用,为了提高液晶显示系统在带有电容触摸技术的现代电子产品中开发与应用,文章中采用新一代8位STM8S208系列MCU和ET-12864F液晶显示模块,设计了一种新型的液晶显示系统;同时介绍了STM8S208单片机的优越性和ET-12864F液晶显示模块的具体操作方法,并给出了单片机STM8S208与液晶显示模块ET-12864F构建的硬件接口电路和程序设计;经实践应用,该液晶显示系统应用开发成本低,效率高具有较好的项目应用参考价值。     

Parameterized complexity of control problems in Maximin election

Elections are a central model in a variety of areas. This paper studies parameterized computational complexity of five control problems in the Maximin election. We obtain the following results: constructive control by adding candidates is W[2]-hard with respect to the parameter “number of added candidates”; both constructive and destructive control by adding/deleting voters are W[1]-hard with respect to the parameter “number of added/deleted voters”.     

Robust model selection with flexible trimming

The forward search provides data-driven flexible trimming of a C_p statistic for the choice of regression models that reveals the effect of outliers on model selection. An informed robust model choice follows. Even in small samples, the statistic has a null distribution indistinguishable from an F distribution. Limits on acceptable values of the C_p statistic follow. Two examples of widely differing size are discussed. A powerful graphical tool is the generalized candlestick plot, which summarizes the information on all forward searches and on the choice of models. A comparison is made with the use of M-estimation in robust model choice.     

基于ADF4360-8的频率合成系统

用ADF4360-8和AD8343芯片作为变频核心器件,将70MHz信号转变为具有频率稳定、波形完整的11.4MHz中频信号。实验证明,该方案设计对接收机的稳定工作起到重要的作用,变频系统具有结构简单、操作方便、稳定性高等特点。     

Finding an Euclidean anti--centrum location of a set of points

An obnoxious facility is to be located inside a polygonal region of the plane, maximizing the sum of the k smallest weighted Euclidean distances to n given points, each protected by some polygonal forbidden region. For the unweighted case and k fixed an O(n²logn) time algorithm is presented. For the weighted case a thorough study of the relevant structure of the multiplicatively weighted order-k-Voronoi diagram leads to the design of an O(kn³+n³logn) time algorithm for finding an optimal solution to the anti-t-centrum problem for every t=1,…,k, simultaneously.     

On a new class of analytic functions associated with conic domain

The aim of this paper is to generalize the conic domain defined by Kanas and Wisniowska, and define the class of functions which map the open unit disk E onto this generalized conic domain. A brief comparison between these conic domains is the main motivation of this paper. A correction is made in selecting the range interval of order of conic domain.     

A comparative runtime analysis of heuristic algorithms for satisfiability problems

The satisfiability problem is a basic core NP-complete problem. In recent years, a lot of heuristic algorithms have been developed to solve this problem, and many experiments have evaluated and compared the performance of different heuristic algorithms. However, rigorous theoretical analysis and comparison are rare. This paper analyzes and compares the expected runtime of three basic heuristic algorithms: RandomWalk, (1+1) EA, and hybrid algorithm. The runtime analysis of these heuristic algorithms on two 2-SAT instances shows that the expected runtime of these heuristic algorithms can be exponential time or polynomial time. Furthermore, these heuristic algorithms have their own advantages and disadvantages in solving different SAT instances. It also demonstrates that the expected runtime upper bound of RandomWalk on arbitrary k-SAT (k?3) is O(n(k−1)), and presents a k-SAT instance that has Θ(n(k−1)) expected runtime bound.     

Observer-based networked control for continuous-time systems with random sensor delays

This paper is concerned with the networked control system design for continuous-time systems with random measurement, where the measurement channel is assumed to subject to random sensor delay. A design scheme for the observer-based output feedback controller is proposed to render the closed-loop networked system exponentially mean-square stable with H_∞ performance requirement. The technique employed is based on appropriate delay systems approach combined with a matrix variable decoupling technique. The design method is fulfilled through solving linear matrix inequalities. A numerical example is used to verify the effectiveness and the merits of the present results.