安徽省某三甲医院114预约挂号服务实践与思考

118114号码百事通全国健康服务中心与安徽省某三甲医院合作,将声讯与信息技术结合应用于114预约挂号服务平台,实现院外平台服务与院内医疗服务的有效衔接,充分利用医疗资源,为患者提供现场、网络、电话、手机客户端等多渠道预约就诊.文章对此服务实践进行了阐述,并对所遇问题进行了探讨,为预约挂号及其相关健康服务便捷化、信息化、人性化发辰提供实践经验.     

矫偏条件波动及其在VaR估计中的应用——以一般正态VaR估计为例

反映金融市场条件波动时变性的模型都只是时资产真实数据生成过程的一种近似拟合,许多模型严格来说存在设定偏误,这样可能导致由它们所预测的条件波动相对真实值存在偏差.本文用一回归模型检验一般正态VaR估计中的简单平均方法估计的条件波动是否存在偏差,另一方面用它对这一条件波动估计值进行矫正,并以此为基础估计相应的VaR.通过对上证指数和深成指数1995-2005年日收益率数据的分析,我们发现,用简单平均方法对我国股市波动进行估计存在非常大的条件偏差,并发现波动矫偏后所预测的VaR值的准确性和有效性都明显提高.     

A method for sample size calculation via E-value in the planning of observational studies

Confounding adjustment plays a key role in designing observational studies such as cross-sectional studies, case-control studies, and cohort studies. In this article, we propose a simple method for sample size calculation in observational research in the presence of confounding. The method is motivated by the notion of E-value, using some bounding factor to quantify the impact of confounders on the effect size. The method can be applied to calculate the needed sample size in observational research when the outcome variable is binary, continuous, or time-to-event. The method can be implemented straightforwardly using existing commercial software such as the PASS software. We demonstrate the performance of the proposed method through numerical examples, simulation studies, and a real application, which show that the proposed method is conservative in providing a slightly bigger sample size than what it needs to achieve a given power.     

On dual power assignment optimization for biconnectivity

Topology control is an important technology of wireless ad hoc networks to achieve energy efficiency and fault tolerance. In this paper, we study the dual power assignment problem for 2-edge connectivity and 2-vertex connectivity in the symmetric graphical model which is a combinatorial optimization problem from topology control technology.The problem is arisen from the following origin. In a wireless ad hoc network where each node can switch its transmission power between high-level and low-level, how can we establish a fault-tolerantly connected network topology in the most energy-efficient way? Specifically, the objective is to minimize the number of nodes assigned with high power and yet achieve 2-edge connectivity or 2-vertex connectivity.We addressed these optimization problems (2-edge connectivity and 2-vertex connectivity version) under the general graph model in (Wang et al. in Theor. Comput. Sci., 2008). In this paper, we propose a novel approximation algorithm, called Candidate Set Filtering algorithm, to compute nearly-optimal solutions. Specifically, our algorithm can achieve 3.67-approximation ratio for both 2-edge connectivity and 2-vertex connectivity, which improves the existing 4-approximation algorithms for these two cases.     

城市流动人口家庭生存状况及其社会救助政策探究——基于广州市的调查

本文从家庭视角考察流动人口群体,以深入了解其生活状况,并在此基础上研究相关的社会救助政策,从社会不同维度认识来穗流动人口,以更好地为他们服务,促进他们的社会融合。     

创造教育之探讨

提高学生的思维能力,开拓创新精神,激发创造兴趣。在课堂教学中进行创造教育。这是实施创造教育的基本途径。     

A greedy algorithm for the minimum 2-connected m-fold dominating set problem

To save energy and alleviate interference in a wireless sensor network, connected dominating set (CDS) has been proposed as the virtual backbone. Since nodes may fail due to accidental damage or energy depletion, it is desirable to construct a fault tolerant CDS, which can be modeled as a \(k\)-connected \(m\)-fold dominating set \(((k,m)\)-CDS for short): a subset of nodes \(C\subseteq V(G)\) is a \((k,m)\)-CDS of \(G\) if every node in \(V(G)\setminus C\) is adjacent with at least \(m\) nodes in \(C\) and the subgraph of \(G\) induced by \(C\) is \(k\)-connected.In this paper, we present an approximation algorithm for the minimum \((2,m)\)-CDS problem with \(m\ge 2\). Based on a \((1,m)\)-CDS, the algorithm greedily merges blocks until the connectivity is raised to two. The most difficult problem in the analysis is that the potential function used in the greedy algorithm is not submodular. By proving that an optimal solution has a specific decomposition, we managed to prove that the approximation ratio is \(\alpha +2(1+\ln \alpha )\), where \(\alpha \) is the approximation ratio for the minimum \((1,m)\)-CDS problem. This improves on previous approximation ratios for the minimum \((2,m)\)-CDS problem, both in general graphs and in unit disk graphs.     

人民调解制度的内在困结与进路破解

当下人民调解制度已无可逆转地走向凋萎,加之人民群众的“法意识”从模糊走向具象,亦加剧了“诉讼爆炸”现象.非诉纠纷解决机制的学术研究和实践探索似一股“学术运动”,一度引人瞩目,但终因与诉讼制度不衔接、零散不成体系等原因而深陷泥淖,众多人民调解组织处于半工作甚至闲置状态.文章以法院功能改革为切入点,构建立体化纠纷解决机制,推行柔性司法,让法院能够为当事人提供多样化的程序服务,赋予并尊重当事人解决纠纷的自主性.它的推行可有效缓解诉讼压力,深入化解矛盾,稳定社会,满足群众对多元化纠纷解决之方式的需求,也是人民调解制度改革与前进的价值坐标.     

Total coloring of planar graphs without adjacent short cycles

In the study of computer science, optimization, computation of Hessians matrix, graph coloring is an important tool. In this paper, we consider a classical coloring, total coloring. Let \(G=(V,E)\) be a graph. Total coloring is a coloring of \(V\cup {E}\) such that no two adjacent or incident elements (vertex/edge) receive the same color. Let G be a planar graph with \(\varDelta \ge 8\). We proved that if for every vertex \(v\in V\), there exists two integers \(i_v,j_v\in \{3,4,5,6,7\}\) such that v is not incident with adjacent \(i_v\)-cycles and \(j_v\)-cycles, then the total chromatic number of graph G is \(\varDelta +1\).     

Multiscale Adaptive Regression Models for Neuroimaging Data

Neuroimaging studies aim to analyze imaging data with complex spatial patterns in a large number of locations (called voxels) on a two-dimensional (2D) surface or in a 3D volume. Conventional analyses of imaging data include two sequential steps: spatially smoothing imaging data and then independently fitting a statistical model at each voxel. However, conventional analyses suffer from the same amount of smoothing throughout the whole image, the arbitrary choice of smoothing extent, and low statistical power in detecting spatial patterns. We propose a multiscale adaptive regression model (MARM) to integrate the propagation-separation (PS) approach (Polzehl and Spokoiny, 2000, 2006) with statistical modeling at each voxel for spatial and adaptive analysis of neuroimaging data from multiple subjects. MARM has three features: being spatial, being hierarchical, and being adaptive. We use a multiscale adaptive estimation and testing procedure (MAET) to utilize imaging observations from the neighboring voxels of the current voxel to adaptively calculate parameter estimates and test statistics. Theoretically, we establish consistency and asymptotic normality of the adaptive parameter estimates and the asymptotic distribution of the adaptive test statistics. Our simulation studies and real data analysis confirm that MARM significantly outperforms conventional analyses of imaging data.