儿童额叶癫痫临床和长程视频脑电图特征

目的通过对46例儿童额叶癫痫患儿的临床表现、长程视频脑电图（VEEG）特点进行分析,提高对儿童额叶癫痫的认识。方法收集2008年12月至2014年8月儿科门诊及住院确诊的46例儿童额叶癫痫病例的资料,回顾性分析其临床表现、VEEG及神经影像学等特征。结果本组患儿发病年龄最小11个月,最大15岁。46例患儿共监测到临床发作258次,明确临床发作34例,14.7%仅于清醒期发作,61.8%仅在睡眠期发作,23.5%在清醒、睡眠中均有发作;临床发作形式包括额叶失神、局部阵挛发作、偏转性强直、姿势性强直、过度运动性自动症、口咽自动症、发声、发笑发作、临床下放电和自主神经性发作等。73.9%患儿记录到发作间期额叶为主的癫痫样放电,63.0%患儿记录到发作期额叶为主的癫痫样放电。结论儿童额叶癫痫临床发作频繁、短暂,以睡眠期发作为主,临床表现复杂多样,易漏诊;长程VEEG可监测到儿童额叶癫痫发作期临床及异常脑电图表现,可提供明确诊断率。     

Some Improvements on Hermite-Hadamard's Inequalities for $s$-Convex Functions

Using an integral identity for a once differentiable mapping, this paper establishes Hadamard's integral inequalities for $s$-convex and $s$-concave mappings. In particular, our results improve and extend some known ones in the literature. Finally, these inequalities are applied to special means.     

A FAMILY OF GRADIENT PROJECTION METHODS

In this paper,we give a family of gradient projection methods with three parameters and theirconvergent properties.This family includes Rosen's gradient projection method,Wolfe's reducedgradient method and Zangwill's convex simplex method as its special cases.     

Division and <Emphasis Type="Italic">k</Emphasis>-th root theorems for <Emphasis Type="Italic">Q</Emphasis>-manifolds

We prove that a locally compact ANR-space X is a Q-manifold if and only if it has the Disjoint Disk Property (DDP), all points of X are homological Z _∞-points and X has the countable-dimensional approximation property (cd-AP), which means that each map f: K → X of a compact polyhedron can be approximated by a map with the countable-dimensional image. As an application we prove that a space X with DDP and cd-AP is a Q-manifold if some finite power of X is a Q-manifold. If some finite power of a space X with cd-AP is a Q-manifold, then X ² and X × [0, 1] are Q-manifolds as well. We construct a countable family χ of spaces with DDP and cd-AP such that no space X ∈ χ is homeomorphic to the Hilbert cube Q whereas the product X × Y of any different spaces X, Y ∈ χ is homeomorphic to Q. We also show that no uncountable family χ with such properties exists. This work was supported by the Slovenian-Ukrainian (Grant No. SLO-UKR 04-06/07)     

Codimension Two PL Embeddings of Spheres with Nonstandard Regular Neighborhoods

For a given polyhedron K(?)M,the notation RM(K)denotes a regular neigh- borhood of K in M.The authors study the following problem:find all pairs(m,k) such that if K is a compact k-polyhedron and M a PL m-manifold,then R_M(f(K))≌R_M(g(K))for each two homotopic PL embeddings f,g:K→M.It is proved that R_S~(k 2)(S~k)(?)S~k×D~2 for each k(?)2 and some PL sphere S~k(?)S~(k 2)(even for any PL sphere S~k(?)S~(K 2)having an isolated non-locally flat point with the singularity S~(k-1)(?) S~(k 1)such thatπ_1(S~(k 1)-S~(k-1))(?)Z).     

The Global Convergence of Self-Scaling BFGS Algorithm with Nonmonotone Line Search for Unconstrained Nonconvex Optimization Problems

The self-scaling quasi-Newton method solves an unconstrained optimization problem by scaling the Hessian approximation matrix before it is updated at each iteration to avoid the possible large eigenvalues in the Hessian approximation matrices of the objective function. It has been proved in the literature that this method has the global and superlinear convergence when the objective function is convex （or even uniformly convex）. We propose to solve unconstrained nonconvex optimization problems by a self-scaling BFGS algorithm with nonmonotone linear search. Nonmonotone line search has been recognized in numerical practices as a competitive approach for solving large-scale nonlinear problems. We consider two different nonmonotone line search forms and study the global convergence of these nonmonotone self-scale BFGS algorithms. We prove that, under some weaker condition than that in the literature, both forms of the self-scaling BFGS algorithm are globally convergent for unconstrained nonconvex optimization problems.     

Crossings and nestings of matchings and partitions

We present results on the enumeration of crossings and nestings for matchings and set partitions. Using a bijection between partitions and vacillating tableaux, we show that if we fix the sets of minimal block elements and maximal block elements, the crossing number and the nesting number of partitions have a symmetric joint distribution. It follows that the crossing numbers and the nesting numbers are distributed symmetrically over all partitions of , as well as over all matchings on . As a corollary, the number of -noncrossing partitions is equal to the number of -nonnesting partitions. The same is also true for matchings. An application is given to the enumeration of matchings with no -crossing (or with no -nesting).

     

基于RBC模型的动态随机一般均衡的数值解

以一般均衡为框架,引入随机变量的动态随机一般均衡系统,由于模型的庞大和函数形式的复杂,往往不能给出明确的数值解.本文给出几种操作性强的、有效的寻求一般化模型数值解的方法,并通过介绍模型参数确定的办法,使得理论的模型有了现实的含义.     

ON DIRECT METHOD OF SOLUTION FOR A CLASS OF SINGULAR INTEGRAL EQUATIONS

In this article, by introducing characteristic singular integral operator and associate singular integral equations (SIEs), the authors discuss the direct method of solution for a class of singular integral equations with certain analytic inputs. They obtain both the conditions of solvability and the solutions in closed form. It is noteworthy that the method is different from the classical one that is due to Lu.