大型铸钢支承辊充型和凝固过程数值模拟

在应用ViewCast软件模拟实际铸钢支承辊的凝固过程时，发现原始工艺易导致缺陷残留在上下辊颈中。根据计算机模拟结果改进原工艺设计，调整模具壁厚，达到良好效果。通过对原工艺和改进工艺进行模拟对比。模拟结果显示改进工艺可以使辊身与下辊颈快速凝固，整个铸件顺序凝固，从而使缩孔、宏观偏析最重的位置集中在冒口部位。采用底注式切线型内浇道的浇注系统，金属液充型过程平稳。     

大直径卷筒螺旋车床的改造

根据大直径卷筒螺旋的特点,将普通车床进行技术改造,增加了支撑底座、动力和运动传递部分,并根据螺距要求设计了内传动链.方便地实现了大直径卷筒螺旋的加工,既降低了成本,又充分利用了闲置的设备,取得良好的效果.     

船用中速柴油机定时齿轮罩壳均衡凝固工艺

通过对定时齿轮罩壳的结构分析,采用大孔出流理论设计浇注系统,根据均衡凝固有限补缩原理,设计出气冒口,实现薄壁壳体的浇口当冒口铸造工艺,提高铸件成品率,降低铸件的成本.     

单螺杆大振幅振动对挤出影响的数值模拟研究

借助CFD专用模拟软件PolyFlow,本文模拟了动态塑化单螺杆挤出机计量段中,聚合物熔体在单螺杆大振幅振动条件下的三维非等温输送流场,研究了大振幅振动力场对挤出产量、功率及螺杆特性的影响。模拟结果显示:振动参数有一个可选范围,当螺杆振动幅值超过该范围而落入横流反向区时,挤出流率将急剧下降,产能比严重降低,螺杆特性变软。     

Processing and interactive editing of huge point clouds from 3D scanners

This paper describes a new out-of-core multi-resolution data structure for real-time visualization, interactive editing and externally efficient processing of large point clouds. We describe an editing system that makes use of the novel data structure to provide interactive editing and preprocessing tools for large scanner data sets. Using the new data structure, we provide a complete tool chain for 3D scanner data processing, from data preprocessing and filtering to manual touch-up and real-time visualization. In particular, we describe an out-of-core outlier removal and bilateral geometry filtering algorithm, a toolset for interactive selection, painting, transformation, and filtering of huge out-of-core point-cloud data sets and a real-time rendering algorithm, which all use the same data structure as storage backend. The interactive tools work in real-time for small model modifications. For large scale editing operations, we employ a two-resolution approach where editing is planned in real-time and executed in an externally efficient offline computation afterwards. We evaluate our implementation on example data sets of sizes up to 63 GB, demonstrating that the proposed technique can be used effectively in real-world applications.     

A two-stage hardware scheduler combining greedy and optimal scheduling

Greedy scheduling heuristics provide a low complexity and scalable albeit particularly sub-optimal strategy for hardware-based crossbar schedulers. In contrast, the maximum matching algorithm for Bipartite graphs can be used to provide optimal scheduling for crossbar-based interconnection networks with a significant complexity and scalability cost. In this paper, we show how maximum matching can be reformulated in terms of Boolean operations rather than the more traditional formulations. By leveraging the inherent parallelism available in custom hardware design, we reformulate maximum matching in terms of Boolean operations rather than matrix computations and introduce three maximum matching implementations in hardware. Specifically, we examine a Pure Logic Scheduler with three dimensions of parallelism, a Matrix Scheduler with two dimensions of parallelism and a Vector Scheduler with one dimension of parallelism. These designs reduce the algorithmic complexity for an N×N$N\times N$ network from O(N³)$O\left(N^3\right)$ to O(1)$O\left(1\right)$, O(K)$O\left(K\right)$, and O(KN)$O\left(KN\right)$, respectively, where K$K$ is the number of optimization steps. While an optimal scheduling algorithm requires K=2N−1$K=2N-1$ steps, by starting with our hardware-based greedy strategy to generate an initial schedule, our simulation results show that the maximum matching scheduler can achieve 99% of the optimal schedule when K=9$K=9$. We examine hardware and time complexity of these architectures for crossbar sizes of up to N=1024$N=1024$. Using FPGA synthesis results, we show that a greedy schedule for crossbars, ranging from 8×8 to 256×256, can be optimized in less than 20 ns per optimization step. For crossbars reaching 1024×1024 the scheduling can be completed in approximately 10 μs with current technology and could reach under 90 ns with future technologies.     

Scanning Depth of Route Panorama Based on Stationary Blur

This work achieves an efficient acquisition of scenes and their depths along long streets. A camera is mounted on a vehicle moving along a straight or a mildly curved path and a sampling line properly set in the camera frame scans the 1D images over scenes continuously to form a 2D route panorama. This paper proposes a method to estimate the depth from the camera path by analyzing a phenomenon called stationary blur in the route panorama. This temporal blur is a perspective effect in parallel projection yielded from the sampling slit with a physical width. We analyze the behavior of the stationary blur with respect to the scene depth, vehicle path, and camera properties. Based on that, we develop an adaptive filter to evaluate the degree of the blur for depth estimation, which avoids error-prone feature matching or tracking in capturing complex street scenes and facilitates real time sensing. The method also uses much less data than the structure from motion approach so that it can extend the sensing area significantly. The resulting route panorama with depth information is useful for urban visualization, monitoring, navigation, and modeling.     

Detailed Real-Time Urban 3D Reconstruction from Video

The paper presents a system for automatic, geo-registered, real-time 3D reconstruction from video of urban scenes. The system collects video streams, as well as GPS and inertia measurements in order to place the reconstructed models in geo-registered coordinates. It is designed using current state of the art real-time modules for all processing steps. It employs commodity graphics hardware and standard CPU’s to achieve real-time performance. We present the main considerations in designing the system and the steps of the processing pipeline. Our system extends existing algorithms to meet the robustness and variability necessary to operate out of the lab. To account for the large dynamic range of outdoor videos the processing pipeline estimates global camera gain changes in the feature tracking stage and efficiently compensates for these in stereo estimation without impacting the real-time performance. The required accuracy for many applications is achieved with a two-step stereo reconstruction process exploiting the redundancy across frames. We show results on real video sequences comprising hundreds of thousands of frames.     

Uniform strength for large deflections of cantilever beams under end point load

Analysis is conducted for slender beams with a varying cross-section under large non-linear elastic deformation. A thickness variation function is derived to achieve optimal - constant maximum bending stress distribution along the beam for inclined end load of arbitrary direction. Closed form solutions are derived for the large deflections that correspond to the various loading conditions. The analysis is repeated for a beam with optimally varying width (for arbitrary end force) and the width variation function is also determined.