25%小偏置碰撞策略及测试评估研究

随着汽车事故的增加,且小重叠碰撞事故死亡率居高不下,小偏置碰撞试验逐渐成为焦点。基于IIHS公布的最新车辆碰撞试验结果,统计超过100余款不同类型的25%小偏置碰撞车辆,建立碰撞转角与碰撞区域的数学模型,将25%小偏置碰撞归结为三种不同的碰撞策略,分别是吸能策略、掠过策略和掠过与吸能策略;并进行试验验证,对三种策略的优缺点进行分析。结果表明,小偏置碰撞试验可运用合理的碰撞策略达到法规要求,对25%小偏置碰撞试验具有一定的参考价值。     

Compensation of voltage disturbances using PEMFC supported Dynamic Voltage Restorer

The continuity of supply and quality of power are the two main significant aspects of today’s power delivery system. The Dynamic Voltage Restorer (DVR) is a series connected custom power device which improves the quality of power delivered to the consumers. This paper deals with the effectual exploitation of DVR for interconnecting the proton exchange membrane fuel cell (PEMFC) stack to the grid based on optimized proportional integral (PI) and fuzzy logic (FL) Controller. The real coded Genetic algorithm (GA) is used to optimize the PI controller parameters. The PEMFC operated boost converter is used to boost up the fuel cell output voltage to balance the DC side necessities of the voltage source converter (VSC). The proposed DVR provides balanced and unbalanced voltage sag/swell compensation, harmonic reduction as well as an active power injection to the grid. The designed method also protects the sensitive loads from source side power quality disturbances including short term interruption. In addition, the harmonic compensation performance of the proposed work is validated by comparing with the results of the H^∞ controller based DVR under medium level voltage condition. The simulation results from MATLAB/SIMULINK are discussed to prove the effectiveness of the planned method.     

加氢反应器头盖密封质量控制探讨

加氢反应器是加氢装置的重要组成部分,反应器头盖因工况复杂,导致密封难度较大,密封不严,会导致整个装置不能正常运转。为此,就其头盖拆装及密封问题进行探讨,提出有效的质量控制措施。     

基于儿童使用主体的建成环境评价尺度研究

评价尺度是建筑使用后评价的基 本问题之一，它是使用者评判建成环境好 坏、优劣的重要测度标准。为弥补目前环境 评价尺度研究方面的缺失，建立与儿童使用 主体相一致的建成环境评价尺度，对儿童常 用语义量词进行汇总和筛选，采用五级线 分刻度方法进行问卷调查研究。基于儿童的 理解，通过问卷试验分析，结果表明：双侧 5级区间评价尺度为：很（负面）；有点（负 面）；中等；有点（正面）；很（正面）；单侧 5级区间评价尺度为：不；好像有点；比较； 很；特别。     

Time-series clustering – A decade review

Clustering is a solution for classifying enormous data when there is not any early knowledge about classes. With emerging new concepts like cloud computing and big data and their vast applications in recent years, research works have been increased on unsupervised solutions like clustering algorithms to extract knowledge from this avalanche of data. Clustering time-series data has been used in diverse scientific areas to discover patterns which empower data analysts to extract valuable information from complex and massive datasets. In case of huge datasets, using supervised classification solutions is almost impossible, while clustering can solve this problem using un-supervised approaches. In this research work, the focus is on time-series data, which is one of the popular data types in clustering problems and is broadly used from gene expression data in biology to stock market analysis in finance. This review will expose four main components of time-series clustering and is aimed to represent an updated investigation on the trend of improvements in efficiency, quality and complexity of clustering time-series approaches during the last decade and enlighten new paths for future works.     

Effect of fortification with asparagus powder on the qualitative properties of processed cheese

The qualitative properties of processed cheese (PC) fortified with different levels of asparagus powder (AP) (0.5%, 1% and 1.5% wt/wt) were evaluated during storage. AP decreased the pH and lipolysis indexes and increased the phenolic content, antioxidant activity and proteolysis of the processed cheeses. AP made the structure of the cheese more elastic, increased the rigidity and decreased the spreadability compared with the control sample, which corresponded to the results obtained using dynamic oscillatory rheometry. The results showed that AP as a rich source of bioactive components could be used for the fortification of processed cheeses.     

Yield improvement and yield variability reduction in an EOQ model with planned shortages and random yield

This paper reports the results of an investigation of a set of continuous time, constant demand inventory models under the condition of yield uncertainty. Specifically, the impact of yield improvement programs on lot size, backorder level, and the resulting costs are examined. Models for improving yield rate and reducing yield variability are developed and examined through a series of numerical exercises. In addition, a model for the simultaneous improvement of yield rate and yield variability is presented for the case where there is a relationship between the mean and variance of the yield distribution. In all cases, investment programs improve the picture with respect to manufacturing yield for processes which are not necessarily under statistical control.     

Service composition for generic service graphs

Service composition is a promising approach to multimedia service provisioning, due to its ability to dynamically produce new multimedia content, and to customize the content for individual client devices. Previous research work has addressed various aspects of service composition such as composibility, QoS-awareness, and load balancing. However, most of the work has focused on applications where data flow from a single source is processed by intermediate services and then delivered to a single destination. In this paper, we address the service composition problem for multimedia services that can be modeled as directed acyclic graphs (DAGs). We formally define the problem and prove its NP hardness. We also design a heuristic algorithm to solve the problem. Our simulation results show that the algorithm is effective at finding low-cost composition solutions, and can trade off computation overhead for better results. When compared with a hop-by-hop approach for service composition, our algorithm can find composition solutions that aress 10% smaller in cost, even when the hop-by-hop approach uses exhaustive searches.     

Analysis of Distributed DDQ for QoS Router

In a packet switching network, congestion is unavoidable and affects the quality of real‐time traffic with such problems as delay and packet loss. Packet fair queuing (PFQ) algorithms are well‐known solutions for quality‐of‐service (QoS) guarantee by packet scheduling. Our approach is different from previous algorithms in that it uses hardware time achieved by sampling a counter triggered by a periodic clock signal. This clock signal can be provided to all the modules of a routing system to get synchronization. In this architecture, a variant of the PFQ algorithm, called digitized delay queuing (DDQ), can be distributed on many line interface modules. We derive the delay bounds in a single processor system and in a distributed architecture. The definition of traffic contribution improves the simplicity of the mathematical models. The effect of different time between modules in a distributed architecture is the key idea for understanding the delay behavior of a routing system. The number of bins required for the DDQ algorithm is also derived to make the system configuration clear. The analytical models developed in this paper form the basis of improvement and application to a combined input and output queuing (CIOQ) router architecture for a higher speed QoS network.