Weighted norm inequalities of Bochner-Riesz means

Let w be a Muckenhoupt weight and be the weighted Hardy spaces. We use the atomic decomposition of and their molecular characters to show that the Bochner-Riesz means are bounded on for 0<p?1 and δ>max{n/p−(n+1)/2,[n/p]rw⁻¹(rw−1)−(n+1)/2}, where rw is the critical index of w for the reverse Hölder condition. We also prove the boundedness of the maximal Bochner-Riesz means for 0<p?1 and δ>n/p−(n+1)/2.     

Fourier multipliers and periodic solutions of delay equations in Banach spaces

In this paper we characterize the existence and uniqueness of periodic solutions of inhomogeneous abstract delay equations and establish maximal regularity results for strong solutions. The conditions are obtained in terms of R-boundedness of linear operators determined by the equations and Lp- Fourier multipliers. Periodic mild solutions are also studied and characterized.     

Cutsets and anti-chains in linear lattices

Consider the poset, ordered by inclusion, of subspaces of a four-dimensional vector space over a field with 2 elements. We prove that, for this poset, any cutset (i.e., a collection of elements that intersects every maximal chain) contains a maximal anti-chain of the poset. In analogy with the same result by Duffus, Sands, and Winkler [D. Duffus, B. Sands, P. Winkler, Maximal chains and anti-chains in Boolean lattices, SIAM J. Discrete Math. 3 (2) (1990) 197-205] for the subset lattice, we conjecture that the above statement holds in any dimension and for any finite base field, and we prove some special cases to support the conjecture.     

Precoloring extension on unit interval graphs

In the precoloring extension problem a graph is given with some of the vertices having preassigned colors and it has to be decided whether this coloring can be extended to a proper k-coloring of the graph. Answering an open question of Hujter and Tuza [Precoloring extension. III. Classes of perfect graphs, Combin. Probab. Comput. 5 (1) (1996) 35-56], we show that the precoloring extension problem is NP-complete on unit interval graphs.     

Complexity results on restricted instances of a paint shop problem for words

We study the following problem: an instance is a word with every letter occurring twice. A solution is a 2-coloring of its letters such that the two occurrences of every letter are colored with different colors. The goal is to minimize the number of color changes between adjacent letters.This is a special case of the paint shop problem for words, which was previously shown to be NP-complete. We show that this special case is also NP-complete and even APX-hard. Furthermore, derive lower bounds for this problem and discuss a transformation into matroid theory enabling us to solve some specific instances within polynomial time.     

Modal series solution for an epidemic model

In this article, we generalize a recently proposed method to obtain an exact general solution for the classical Susceptible, Infected, Recovered and Susceptible (SIRS) epidemic mathematical model. This generalization is based upon the nonlinear coupling of two frequencies in an infinite modal series solution. It is shown that these series provide a nonstandard approach in order to obtain an accurate analytical solution for the classical SIRS epidemic model. Numerical results of the SIRS epidemic model for real and complex frequencies are included in order to test the validity and reliability of the method. This method could be applied to a wide class of models in physics, chemistry or engineering.     

A psychophysical model of decision making

Herein we develop a psychophysical model of decision making based on the difference between objective clock time and the human brain’s perception of time. In this model the utility function is given by the survival probability, which is shown to be a generalized hyperbolic distribution. The parameters of the utility function are fit to intertemporal choice model experimental data and decision making is determined to be a 1/f-noise process.     

Regularization in quantum field theory from the causal point of view

The causal approach to perturbative quantum field theory is presented in detail, which goes back to a seminal work by Henri Epstein and Vladimir Jurko Glaser in 1973 [12]. Causal perturbation theory is a mathematically rigorous approach to renormalization theory, which makes it possible to put the theoretical setup of perturbative quantum field theory on a sound mathematical basis. Epstein and Glaser solved this problem for a special class of distributions, the time-ordered products, that fulfill a causality condition, which itself is a basic requirement in axiomatic quantum field theory. In their original work, Epstein and Glaser studied only theories involving scalar particles. In this review, the extension of the method to theories with higher spin, including gravity, is presented. Furthermore, specific examples are presented in order to highlight the technical differences between the causal method and other regularization methods, like, e.g. dimensional regularization.     

国家地面数字电视广播USB测试接收机的数据传输与处理

本文介绍了利用USB2.0和CY7C68013芯片开发USB接口通信系统的基本过程,介绍了使用DirectShow开发多媒体播放系统的基本流程,并且介绍了如何将上述两种技术结合起来,开发国家地面数字电视广播USB测试接收机的数据传输和处理系统.     

USB广播播放控制系统设计

USB广播播放控制系统采用“一线通”设计方案,整个外部设备与主控计算机只有一根USB线相联,简化了结构,提高了可靠性。详细介绍了系统的硬件电路的设计和软件模块的编程,包括接口与主控电路、数模模数转换电路、调频电路的设计以及USB固件程序、USB驱动程序、播放控制窗口程序的编制。该系统功能强大,性价比较高,在各类学校及企事业单位等小型广播站具有广阔的市场前景。