Analysis and simulation of the grinding process. Part I: Generation of the grinding wheel surface

This paper is in three parts describing the analysis and simulation of the grinding process. This first part is concerned with the generation of the wheel surface by single point diamond dressing. In grinding, the grinding wheel has to be dressed periodically to restore wheel form and cutting efficiency. Understanding the process of generating the grinding wheel surface is important for the control of the grinding process. Generation of the wheel surface is simulated as a single diamond dressing process on a computer generated wheel. The wheel is simulated by grains randomly spaced in the wheel volume. The topography of the wheel cutting surface is generated by simulating the action of an ideal dressing tool as it dresses the wheel. The simulation of the wheel topography takes account of the motion of the dressing tool, grain size, grain spacing, grain fracture and grain break-out. The simulated cutting surface is used for further simulations of grinding. The simulation of grinding using the simulated grinding wheel surface is described in Sections 2 and 3 where a comparison is made of results predicted from simulation with results obtained from experiments. By matching simulated and experimental results, it is possible to explain the relative importance of dressing and grinding parameters.     

大型铸件成形过程数值模拟及工艺优化

用工程湍流模式计算大型铸件充型凝固过程三维速度场、温度场时,对提高模拟计算精度和效率进行了探讨。应用新的计算方法对大型不锈钢和合金铸铁件进行数值模拟,优化其铸造工艺。     

针对有向图的局部扩展的重叠社区发现算法

当前社区发现算法主要是针对无向图研究社区结构,但在实际复杂网络中,链接关系时常表现出非对称性或方向性,比如Twitter的用户关注关系,文献网络的引 用关系,网页之间的超链接关系等应用网络。因此,本文依据信息在复杂网络中的传播规律和流动方向性,提出了k-Path共社区邻近相似性概念及计算方法,用于衡量结点在同一社区的相似性程度,并给出了把有向图转换为带方向权值的无向图的方法。基于带权无向图提出了一种从局部扩展来探测社区的重叠社区发现算法(Local and wave-like extension algorithm of detecting overlapping community, LWS-OCD)。在真实数据集上的实验表明,共社区邻近相似性概念实现了有向到无向的合理转换,而且提高了社区结点的聚集效果,LWS-OCD算法能够有效地发现带权无向图中的重叠社区。     

对比度、颜色一致性和灰度像素保持的消色算法

目的 为了解决目前消色算法中不能同时保持原始图像的对比度,颜色一致性和灰度像素特征的问题,提出一种新的优化算法,最大限度地同时保留这些视觉特性。方法 为了保持原始图像的结构和局部对比度信息,用双高斯模型构建像素对之间的误差能量项;为了保持颜色一致性,采用局部线性嵌入模型构建能量项,确保原始图像中颜色一致的像素在结果图像中也拥有一样的灰度级;为了保持灰度像素特征,先标记出原始图像中的灰度像素,并强制规定这些像素的灰度值是已知的且在消色变换的过程中始终不变,然后用双高斯模型构建出灰度像素与其他像素之间的误差能量项。线性结合这3个能量项,得到目标能量函数,再通过迭代法求解出使总能量值达到最小的灰度值,从而得到了最终的消色结果。结果 实验结果表明,本文算法能够同时较好地保持原始图像中的对比度、颜色一致性和灰度像素特征。结论 本文算法基本符合人类对图像对比度变化的感知程度,而且能够很好地保持细节信息和全局结构,可应用于数字打印、模式识别等方面,具有很大的应用价值。     

On the criteria for designing complex orthogonal space-time block codes

A complex orthogonal design (COD) used in space-time block codes is a kind of combinatorial design. It has been well studied because it has a fast maximum-likelihood decoding algorithm and achieves full diversity. When designing CODs, there are seven characteristics that should be considered, which include code rate, decoding delay, transceiver signal linearization, peak-to-average power ratio, etc. In this paper, we study the relationships among these design criteria. We prove that the maximum rate of generalized CODs (GCODs) that meet the last five criteria is 1/2. Moreover, we present a new method to construct GCODs based on CODs. Using this method on balanced complex orthogonal designs (BCODs), we obtain a novel class of GCODs that performs almost perfectly with respect to all the seven properties.     

能量平衡和延迟约束的水声网络路由协议

水声网络路由协议是水声网络研究的一个热点问题。水声网络路由协议面临着节点能量有限、带宽窄、高传播延迟等的限制。本文从能量和延迟角度出发,设计了一种能量平衡和延迟约束的路由协议。该协议通过感知周边节点能量和负载,使得节点在选择转发节点时尽量选择剩余能量高的节点,同时在网络负载较高时能有效避开网络拥塞区域,从而在能量均衡的同时降低数据包的端到端延迟。     

Generic and efficient framework for search trees on flash memory storage systems

Tree index structures are crucial components in data management systems. Existing tree index structure are designed with the implicit assumption that the underlying external memory storage is the conventional magnetic hard disk drives. This assumption is going to be invalid soon, as flash memory storage is increasingly adopted as the main storage media in mobile devices, digital cameras, embedded sensors, and notebooks. Though it is direct and simple to port existing tree index structures on the flash memory storage, that direct approach does not consider the unique characteristics of flash memory, i.e., slow write operations, and erase-before-update property, which would result in a sub optimal performance. In this paper, we introduce FAST (i.e., Flash-Aware Search Trees) as a generic framework for flash-aware tree index structures. FAST distinguishes itself from all previous attempts of flash memory indexing in two aspects: (1) FAST is a generic framework that can be applied to a wide class of data partitioning tree structures including R-tree and its variants, and (2) FAST achieves both efficiency and durability of read and write flash operations through memory flushing and crash recovery techniques. Extensive experimental results, based on an actual implementation of FAST inside the GiST index structure in PostgreSQL, show that FAST achieves better performance than its competitors.     

Creating a live, public short message service corpus: the NUS SMS corpus

Short Message Service (SMS) messages are short messages sent from one person to another from their mobile phones. They represent a means of personal communication that is an important communicative artifact in our current digital era. As most existing studies have used private access to SMS corpora, comparative studies using the same raw SMS data have not been possible up to now. We describe our efforts to collect a public SMS corpus to address this problem. We use a battery of methodologies to collect the corpus, paying particular attention to privacy issues to address contributors’ concerns. Our live project collects new SMS message submissions, checks their quality, and adds valid messages. We release the resultant corpus as XML and as SQL dumps, along with monthly corpus statistics. We opportunistically collect as much metadata about the messages and their senders as possible, so as to enable different types of analyses. To date, we have collected more than 71,000 messages, focusing on English and Mandarin Chinese.     

Impacts of employee participation and trust on e-business readiness, benefits, and satisfaction

An increasing number of firms have invested large sums in implementing electronic business (e-business). Nowadays, while the e-businesses are fostering rapid industrial growth, employees are the one who factually engage with information exchange, communication and support e-business processes. However, prior literature has paid scant attention in determining e-business value and its drivers from employee perspective. Thus, the present study attempts to investigate how user participation and trust drives e-business value in terms of e-business readiness, e-business benefits, and e-business satisfaction. For this sake, data collected from 143 employees at Taiwanese IT related firms and analyzed with partial least square (PLS) structural equation approach reveal that trust and user participation were significant precursors of employee e-business satisfaction. The results strongly support the contention that trust directly affects e-business satisfaction, and indirectly affects it through e-business readiness and e-business benefits. The research model and findings will help managers implement e-business successfully and offer valuable references for researchers interested in developing related theories.     

块效应图像质量模糊评估标准

研究和讨论了图像质量评估方法,提出一种基于模糊推理的块效应评估标准。假设图像由平滑区域、边缘区域以及纹理区域等组成,而且不同的区域应采用不同的方法进行质量评估。在此基础上,给出了三个分别适用于不同区域的图像质量评估因子,并提出了一个灵活的模糊图像质量评估方法。此方法把块效应和图像本身具有的边缘分开,防止了边缘会被误认为是块效应。仿真结果表明,提出的标准对于不同的图像具有鲁棒性,有一般图像质量评价标准的性能。