Dynamics of Slider-Crank Mechanisms with Flexible Supports and Non-Ideal Forcing

Transient and steady state dynamic response of a class of slider-crank mechanisms is investigated. Specifically, the class of mechanisms examined involves rigid members but compliant supporting bearings. Moreover, the mechanisms are subjected to non-ideal forcing. Namely, both the driving and the resisting loads are expressed as a function of the angular coordinate describing the crank rotation. First, an appropriate set of equations of motion is derived by applying Lagrange's equations. These equations are strongly nonlinear due to the large rigid body rotation of the crank and the connecting rod, as well as due to the nonlinearities associated with the bearing action and the form of the driving and the resisting loads. Consequently, the dynamics of the resulting dynamical system is examined by solving the equations of motion numerically. More specifically, transient response is captured by direct integration, while determination of complete branches of steady state response is achieved by applying appropriate numerical methodologies. Initially, mechanisms whose crankshaft is supported by bearings with rolling elements and linear stiffness characteristics are examined. Then, numerical results are presented for rolling element bearings with nonlinear stiffness characteristics. Finally, the study is focused on mechanisms supported by hydrodynamic bearings. In all cases, the attention is focused on investigating the influence of the system parameters on its dynamics. Moreover, models with constant crank angular velocity are first analysed, since they provide valuable insight into some aspects of the system dynamics. Eventually, the emphasis is shifted to the general case of non-ideal forcing, originating from the dependence of the driving and the resisting moments on the crankshaft motion.     

�������ֲ������¶�Ԫ����ģ���к����������

In Bayesian analysis, the Markov Chain Monte Carlo (MCMC) algorithm is an efficient and simple method to compute posteriors. However, the chain may appear to converge while the posterior is improper, which will leads to incorrect statistical inferences. In this paper, we focus on the necessary and sufficient conditions for which improper hierarchical priors can yield proper posteriors in a multivariate linear model. In addition, we carry out a simulation study to illustrate the theoretical results, in which the Gibbs sampling and Metropolis-Hasting sampling are employed to generate the posteriors.     

Maximizing H‐Colorings of Connected Graphs with Fixed Minimum Degree

For graphs G and H , an H‐coloring of G is a map from the vertices of G to the vertices of H that preserves edge adjacency. We consider the following extremal enumerative question: for a given H , which connected n‐vertex graph with minimum degree δ maximizes the number of H‐colorings? We show that for nonregular H and sufficiently large n , the complete bipartite graph is the unique maximizer. As a corollary, for nonregular H and sufficiently large n the graph is the unique k‐connected graph that maximizes the number of H‐colorings among all k‐connected graphs. Finally, we show that this conclusion does not hold for all regular H by exhibiting a connected n‐vertex graph with minimum degree δ that has more ‐colorings (for sufficiently large q and n ) than .     

Further study of alternating iterations for rectangular matrices

Theory of matrix splittings is a useful tool in the analysis of iterative methods for solving systems of linear equations. When two splittings are given, it is of interest to compare the spectral radii of the corresponding iteration matrices. This helps to arrive at the conclusion that which splitting should one choose so that one can reach the desired solution of accuracy or the exact solution in a faster way. In the case of many splittings are provided, the comparison of the spectral radii is time-consuming. Such a situation can be overcome by introducing another iteration scheme which converges to the same solution of interest in a much faster way. In this direction, the theory of alternating iterations for real rectangular matrices is recently proposed. In this note, some more results to the theory of alternating iterations are added. A comparison result of two different alternating iteration schemes is then presented which will help us to choose the iteration scheme that will guarantee the faster convergence of the alternating iteration scheme. In addition to these results, a comparison result for proper weak regular splittings is also obtained.     

参数激励与强迫激励联合作用下非线性振动系统的余维2退化分叉

在本文里我们首先研究了具有Z_2-对称性的范式理论和退化向量场的普适开折理论。然后利用上述理论研究了参数激励与强迫激励联合作用下非线性振动系统的余维2退化分叉,从而解决了当解具有两个零特征值时解的稳定性问题。最后利用Melnikov方法求出了参数平面上的同宿分叉曲线,讨论了全局分叉的存在性。     

本征正交分解技术在屋盖风压场重建与预测中的应用

给出利用本征正交分解(POD)对屋盖风压场进行重建和预测的研究结果.对一个双坡屋盖用同步多点压力扫描系统进行了风洞试验,根据POD技术采用前若干阶本征模态重建屋盖风压场.采用两种方案预测未布置测压点位置的风压时间序列.第一种方案中利用插值技术获得没有测压点位置的本征模态值.第二种方案对参考屋盖和需预测的新屋盖分别进行试验,结合由参考屋盖试验萃取的本征模态和由新屋盖试验的风压数据计算的主坐标,预测出新屋盖未知区域的风压时间序列.文中对风压场重建和预测的效果作了分析,而且比较了根据测量的风压数据和预测的风压数据所计算的屋盖风致响应.     

Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited

Consider a simple graph and its proper edge coloring c with the elements of the set . We say that c is neighbor set distinguishing (or adjacent strong) if for every edge , the set of colors incident with u is distinct from the set of colors incident with v. Let us then consider a stronger requirement and suppose we wish to distinguishing adjacent vertices by sums of their incident colors. In both problems the challenging conjectures presume that such colorings exist for any graph G containing no isolated edges if only . We prove that in both problems is sufficient. The proof is based on the Combinatorial Nullstellensatz, applied in the “sum environment.” In fact the identical bound also holds if we use any set of k real numbers instead of as edge colors, and the same is true in list versions of the both concepts. In particular, we therefore obtain that lists of length ( in fact) are sufficient for planar graphs.     

Models of expansions of \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}${\mathbb N}$\end{document} with no end extensions

We deal with models of Peano arithmetic (specifically with a question of Ali Enayat). The methods are from creature forcing. We find an expansion of ${\mathbb N}$ such that its theory has models with no (elementary) end extensions. In fact there is a Borel uncountable set of subsets of ${\mathbb N}$ such that expanding ${\mathbb N}$ by any uncountably many of them suffice. Also we find arithmetically closed ${\mathcal A}$ with no ultrafilter on it with suitable definability demand (related to being Ramsey). © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

Forcing operators on MTL‐algebras

We study the forcing operators on MTL‐algebras, an algebraic notion inspired by the Kripke semantics of the monoidal t ‐norm based logic (MTL). At logical level, they provide the notion of the forcing value of an MTL‐formula. We characterize the forcing operators in terms of some MTL‐algebras morphisms. From this result we derive the equality of the forcing value and the truth value of an MTL‐formula (© 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

多目标最优化恰当有效解的稳定性

主要研究当两种类型的参数扰动时,多目标最优化问题中恰当有效解的稳定性.在点集映射的连续性意义下,分析讨论这种稳定性问题并分别给出引起扰动的两参数u,v所对应的点集映射Q1(u)和Q2(v),同时严格证明了在两个闭凸锥U,V上Q1(u)和Q2(v)的连续性定理.最后,通过附注对其进行补充和改进.