Multi-step nonlinear conjugate gradient methods for unconstrained minimization

Conjugate gradient methods are appealing for large scale nonlinear optimization problems, because they avoid the storage of matrices. Recently, seeking fast convergence of these methods, Dai and Liao (Appl. Math. Optim. 43:87–101, 2001) proposed a conjugate gradient method based on the secant condition of quasi-Newton methods, and later Yabe and Takano (Comput. Optim. Appl. 28:203–225, 2004) proposed another conjugate gradient method based on the modified secant condition. In this paper, we make use of a multi-step secant condition given by Ford and Moghrabi (Optim. Methods Softw. 2:357–370, 1993; J. Comput. Appl. Math. 50:305–323, 1994) and propose two new conjugate gradient methods based on this condition. The methods are shown to be globally convergent under certain assumptions. Numerical results are reported.     

美国线路共享政策的实施与现状

线路共享指的是，用户除了从自己归属的本地电话公司（ILEC）以外还能选择从其它运营公司（主要指CLEC）为自己提供数据业务，并且不必安装第二条电话线。线路共享为现有电话线路上开展数据业务竞争铺平了道路，它在美国被视作能否成功开放DSL市场的关键因素。本文对美国针对DSL发展问题出台线路共享政策以及线路共享政策出台后的实施状况加以报道。对于我国制定线路共享政策和实施管理提供参考。     

Contractible subgraphs, Thomassen’s conjecture and the dominating cycle conjecture for snarks

We show that the conjectures by Matthews and Sumner (every 4-connected claw-free graph is Hamiltonian), by Thomassen (every 4-connected line graph is Hamiltonian) and by Fleischner (every cyclically 4-edge-connected cubic graph has either a 3-edge-coloring or a dominating cycle), which are known to be equivalent, are equivalent to the statement that every snark (i.e. a cyclically 4-edge-connected cubic graph of girth at least five that is not 3-edge-colorable) has a dominating cycle.We use a refinement of the contractibility technique which was introduced by Ryjá?ek and Schelp in 2003 as a common generalization and strengthening of the reduction techniques by Catlin and Veldman and of the closure concept introduced by Ryjá?ek in 1997.     

Analysis of tunnel diode antenna using iterative method

An efficient iterative method, based on the wave concept has been used to analyze the printed tunnel diode integrated antenna. A high computational speed has been achieved by introducing a 2D fast Fourier transformation (2D-FFT) in wave-guide environment. The simulated results are compared with published data and a good agreement is observed.     

Terahertz planar antennas for future wireless communication: A technical review

With the monotonic increasing demand of the higher bandwidth for the next generation wireless communication system, the extension of the operating frequency of the communication system to the millimeter/Terahertz wave regime of the electromagnetic spectrum where several low-attenuation windows exist is inevitable. However, before the commercial implementation of the wireless communication in these low-attenuation windows, there are various obstacles which need to be addressed by the scientists and researchers. The atmospheric path loss is the main obstacle to the full-fledged implementation of the terahertz wireless communication. The remedy to this problem is the use of high-power sources, efficient detectors and high gain antenna systems. This paper reviews these technical issues with the special attention to the planar antennas which might contribute to the compact, inexpensive, and low profile future terahertz wireless communication system design.     

Helly-Type Theorems for Line Transversals to Disjoint Unit Balls

We prove Helly-type theorems for line transversals to disjoint unit balls in ℝ ^d . In particular, we show that a family of n≥2d disjoint unit balls in ℝ ^d has a line transversal if, for some ordering ≺ of the balls, any subfamily of 2d balls admits a line transversal consistent with ≺. We also prove that a family of n≥4d−1 disjoint unit balls in ℝ ^d admits a line transversal if any subfamily of size 4d−1 admits a transversal. Andreas Holmsen was supported by the Research Council of Norway, prosjektnummer 166618/V30. Otfried Cheong and Xavier Goaoc acknowledge support from the French-Korean Science and Technology Amicable Relationships program (STAR).     

Embedded design based virtual instrument program for positron beam automation

Automation of positron beam experiment with a single chip embedded design using a programmable system on chip (PSoC) which provides easy interfacing of the high-voltage DC power supply is reported. Virtual Instrument (VI) control program written in Visual Basic 6.0 ensures the following functions (i) adjusting of sample high voltage by interacting with the programmed PSoC hardware, (ii) control of personal computer (PC) based multi channel analyzer (MCA) card for energy spectroscopy, (iii) analysis of the obtained spectrum to extract the relevant line shape parameters, (iv) plotting of relevant parameters and (v) saving the file in the appropriate format. The present study highlights the hardware features of the PSoC hardware module as well as the control of MCA and other units through programming in Visual Basic.     

适用于分析圆形微带贴片的Sommerfeld积分技术

本文研究了印刷圆形微带贴片分析中所涉及的Ｓｏｍｍｅｒｆｅｌｄ积分，选择合适的积分路径，简化了对极点的处理；通过提取积分函数的准静态项，加速积分的收敛。数值试验表明，本文方法能使积分时间缩短６－１３倍。     

Wetting, adsorption and surface critical phenomena

Our understanding of interfacial phenomena at the surfaces of critical systems, and in particular at the surfaces of critical binary liquid mixtures, has improved significantly in the past decade. There is now substantial agreement between theory and experiment. In this paper we review recent experimental progress, provide a conceptual framework within which the majority of these experiments can now be understood, and discuss critically any remaining unresolved discrepancies between experiments or with theory.     

Tutte uniqueness of line graphs

We prove that if a graph H has the same Tutte polynomial as the line graph of a d-regular, d-edge-connected graph, then H is the line graph of a d-regular graph. Using this result, we prove that the line graph of a regular complete t-partite graph is uniquely determined by its Tutte polynomial. We prove the same result for the line graph of any complete bipartite graph.