基于Pro/E和Simulink正切机构擦鞋机的运动仿真

针对目前使用的电动擦鞋机存在占地面积大,噪音大,耗电,使用区域受电源限制等缺点,设计出一种新型无能耗的正切机构擦鞋机。利用Pro/E对其三维建模,结合人机工程学进行设计,确定机构具体尺寸,设计制造出样机。为验证其实用性,应用矩阵法建立其数学模型,使用Siruulink对其简化的正切机构模型进行运动仿真,得出毛刷辊子转速,脚踏力与时间的关系曲线。并推荐了合理的踩踏力和毛刷转速。通过样机实验表明擦鞋效果较好,转速高,能够满足擦 鞋要求。     

Brownian Bridge and Other Path-dependent Gaussian Processes Vectorial Simulation

The iterative simulation of the Brownian bridge is well known. In this article, we present a vectorial simulation alternative based on Gaussian processes for machine learning regression that is suitable for interpreted programming languages implementations. We extend the vectorial simulation of path-dependent trajectories to other Gaussian processes, namely, sequences of Brownian bridges, geometric Brownian motion, fractional Brownian motion, and Ornstein–Ulenbeck mean reversion process.     

A Study on SMO Algorithm for Solving ϵ-SVR with Non-PSD Kernels

Sequential minimal optimization (SMO) algorithm is effective in solving large-scale support vector machine (SVM). The existing algorithms all assume that the kernels are positive definite (PD) or positive semi-definite (PSD) and should meet the Mercer condition. Some kernels, however, such as sigmoid kernel, which originates from neural network and then is extensively used in SVM, are conditionally PD in certain circumstances; in addition, practically, it is often difficult to prove whether a kernel is PD or PSD or not except some well-known kernels. So, the applications of the existing algorithm of SMO are limited. Considering the deficiency of the traditional ones, this algorithm of solving ?-SVR with nonpositive semi-definite (non-PSD) kernels is proposed. Different from the existing algorithms which must consider four Lagrange multipliers, the algorithm proposed in this article just need to consider two Lagrange multipliers in the process of implementation. The proposed algorithm simplified the implementation by expanding the original dual programming of ?-SVR and solving its KKT conditions, thus being easily applied in solving ?-SVR with non-PSD kernels. The presented algorithm is evaluated using five benchmark problems and one reality problem. The results show that ?-SVR with non-PSD provides more accurate prediction than that with PD kernel.     

Weighted Support Vector Machine Using k-Means Clustering

The support vector machine (SVM) has been successfully applied to various classification areas with great flexibility and a high level of classification accuracy. However, the SVM is not suitable for the classification of large or imbalanced datasets because of significant computational problems and a classification bias toward the dominant class. The SVM combined with the k-means clustering (KM-SVM) is a fast algorithm developed to accelerate both the training and the prediction of SVM classifiers by using the cluster centers obtained from the k-means clustering. In the KM-SVM algorithm, however, the penalty of misclassification is treated equally for each cluster center even though the contributions of different cluster centers to the classification can be different. In order to improve classification accuracy, we propose the WKM–SVM algorithm which imposes different penalties for the misclassification of cluster centers by using the number of data points within each cluster as a weight. As an extension of the WKM–SVM, the recovery process based on WKM–SVM is suggested to incorporate the information near the optimal boundary. Furthermore, the proposed WKM–SVM can be successfully applied to imbalanced datasets with an appropriate weighting strategy. Experiments show the effectiveness of our proposed methods.     

Graph colouring approach for cell formation problems

This paper presents a graph-theoretic approach for solving the clustering problem in group technology. The machine-component incidence matrix is used to form the weight matrix. Using the two weight matrices, one for the machines and the other for the parts, two graphs are developed. The nodes of each graph are coloured using the proper colouring method. An edge, whose adjacent nodes are of same colour, partitions the graph into subgraphs, thus creating machine-part cells. This cell formation method yields solutions which compare favourably with respect to other available methods. This procedure is illustrated using an example problem from the literature.     

灌装机进料管的新型动态密封结构

饮料生产过程中，料液从进料管输入灌装机，进料管处于静止状态，灌装机处于旋转状态，因此进料管的动态密封技术尤为重要。目前灌装机均采用“V”型密封圈实现进料管的动态密封，存在着密封圈易老化、使用寿命较短、不易更换、价格昂贵等问题。通过对动态密封技术的研究，作者发明了一种新型的动态密封结构，采用弹簧结构，实现了进料管道的柔性动态连接，并将摩擦面转移到两只碳化硅密封圈处。经过实践表明，此项技术具有寿命长、易更换、造价低等优点。     

如何应用网络同传提高机房管理水平

通过使用网络同传技术,总结出了使用过程中需注意的一些问题,尤其是对网络环境的优化、交换机的配置等问题进行了重点阐述。     

Electronic Gaming Machine Gambling: Measuring Motivation

Electronic gambling machines (EGMs) are known to be a particularly risky form of gambling (Petry. Addiction 98(5):645–655, 2003). It is vital that researchers and clinicians are aware of factors which could lead to people having problems with this form. Gambling motivation is one such factor. This study developed a measure of EGM gambling motivations based on the results of qualitative research conducted with EGM problem gamblers and experienced counsellors (Thomas et al. Int J Mental Health Addiction 7:97–107, 2009). A community based sample of 232 females (M = 29.60 years of age, SD = 15.41 years) and 123 males (M = 29.64 years of age, SD = 12.29 years) participated. Exploratory factor analysis extracted three motivational factors indicating people gambled on EGMs to escape, for its accessibility and for the social environment. Gambling to escape and for its accessibility had substantial positive correlations with frequency of EGM gambling and gambling problems. Social environment correlated less well with these indicators of excessive gambling. Correlations between factors suggested the accessible, social experience offered by EGM venues increases their appeal as a means of escape. The new subscales were internally consistent and demonstrated good evidence of validity. This new measure will facilitate future investigations into the relationships between gambling motivations, other aetiological factors and EGM problem gambling.     

Properties of adaptive clinical trial signature design in the presence of gene and gene-treatment interaction

Traditional phase III clinical trials are powered to detect an overall treatment effect. However, it has increasingly been shown that many treatments are effective only for a subset of a population. The adaptive signature design uses genomic/proteomic information to prospectively predict a subset of patients more sensitive to treatment. Tests for overall treatment effect and for treatment effect in the predicted subset are conducted. In this work properties of the adaptive signature design are investigated through simulation. It was found that models which excluded expression main effect terms had higher empirical power than models which included them.     

Web of resistance: Deleuzian digital space and hacktivism

This article argues that the Internet possesses the potential to challenge corporate and Statist domination of digital space. Mapping Gilles Deleuze and Felix Guattari’s concepts of the rhizome, smooth/striated space, and the nomad onto the idea of digital connectivity, I show how hacktivism can initiate change both online and off. In the first section, I argue that the Internet is characteristic of a rhizome. As a rhizome, the Internet’s structure affords it a flexible, morphological, and ultimately a vibrantly powerful configuration. As a result of its connective and generative power, corporate and State entities seek to control digital space. These controlling institutions stratify, segment, and claim ownership over the flat, smooth space. The second section, then, shows how the Internet becomes striated through corporate and State interests. As a remedy, the third section advocates for hacktivism as a form of nomadic action. In this section, I focus on the Distributed Denial of Service attack as a form of deterritorialization that redistributes the flow of information. Acting as a digital machine de guerre engaging in online direct action, and against the legal apparatus of the State, hacktivists create a rupture in the rhizomatic structure and form smooth spaces within a striated network. In the final section, I advocate for sustained smooth digital spaces that allow for new modes of association that radiate outward from the digital to the physical world.