Step-by-step improvement of MPS method in simulating violent free-surface motions and impact-loads

The violent free-surface motions and the corresponding impact loads are numerically simulated by using the Moving Particle Semi-implicit (MPS) method, which was originally proposed by Koshizuka and Oka [10] for incompressible flows. In the original MPS method, there were several defects including non-optimal source term, gradient and collision models, and search of free-surface particles, which led to less-accurate fluid motions and non-physical pressure fluctuations. In the present study, how those defects can be remedied is illustrated by step-by-step improvements in the respective processes of the revised MPS method. For illustration, two examples are studied; (i) dam breaking problem and (ii) liquid sloshing inside a rectangular tank. The improvement of each step is explained and numerically demonstrated. The numerical results are also compared against the experimental results of Martin and Moyce [12] for dam-breaking problem and Kishev et al. [9] for sloshing problem. The numerical results for violent free-surface motions and impact pressures are in good agreement with their experimental data.     

Preventing TCP performance interference on asymmetric links using ACKs-first variable-size queuing

In developing network-enabled embedded systems, developers are often forced to spend a great deal of time and effort analyzing and solving network performance problems. In this paper, we address one such problem: TCP performance interference on an asymmetric link. The upload or download throughput abruptly degrades if there is simultaneously upload and download TCP traffic on the link. While the problem has been addressed by many researchers, their solutions are incomplete as they only improve throughput in one direction, require TCP protocol modifications in end-user devices or are effective for a limited range of network configurations.In order to overcome such limitations, we propose ACKs-first variable-size queuing (AFVQ) for a gateway. In doing so, we have derived an analytic model of the steady-state TCP performance with bidirectional traffic to clearly identify the two sources of the problem: the excessive queuing delay of ACK packets and the excessive number of ACK packets in the queue. Our AFVQ mechanism is designed to directly eliminate the two causes. Specifically, we have based AFVQ on two policies. First, ACKs-first scheduling is used to shorten the queuing delay of ACK packets. Second, the queue size for ACK packets is dynamically adjusted depending on the number of data packets queued in the gateway so that the number of ACK packets is reduced when packets are congested in the gateway. By applying the two policies simultaneously at the uplink and downlink output queue in the gateway, AFVQ achieves balanced TCP throughput improvements in both directions. In this way, it breaks circular dependencies between upload and download traffic.We have implemented AFVQ in our ADSL-based residential gateway using the traffic control module of the Linux kernel. Our gateway yields 95.2% and 93.8% of the maximum download and upload bandwidth, respectively. We have also evaluated the proposed mechanism using the ns-2 simulator over a wide range of network configurations and have shown that AFVQ achieves better upload and download throughput than other representative gateway-based mechanisms such as ACQ, ACKs-first scheduling and ACK Filtering.     

A factor combination approach to developing style guides for mobile phone user interface

This paper proposes a systematic approach to developing comprehensive guidelines for mobile phone user interface, and presents a case study to validate the approach. The approach applies a systematic combination of three critical factors: general usability principles, UI components and guideline properties to developing guidelines. In the case study, this factor combination approach was very effective in collecting experts’ ideas, creating guidelines and editing them. The resulting style guide can provide comprehensive and useful guidelines for designing mobile phone UI.

Relevance to Industry

UI designers can use the results of the study as a practical method to develop style guides for mobile phone UIs. The approach taken in the study will also be helpful in managing complex guideline information systematically.     

RFID-initiated workflow control to facilitate patient safety and utilization efficiency in operation theater

Objective

To control the workflow for surgical patients, we in-cooperate radio-frequency identification (RFID) technology to develop a Patient Advancement Monitoring System (PAMS) in operation theater.

Methods

The web-based PAMS is designed to monitor the whole workflow for the handling of surgical patients. The system integrates multiple data entry ports Across the multi-functional surgical teams. Data are entered into the system through RFID, bar code, palm digital assistance (PDA), ultra-mobile personal computer (UMPC), or traditional keyboard at designated checkpoints. Active radio-frequency identification (RFID) tag can initiate data demonstration on the computer screens upon a patient's arrival at any particular checkpoint along the advancement pathway.

Results

The PAMS can manage the progress of operations, patient localization, identity verification, and peri-operative care. The workflow monitoring provides caregivers’ instant information sharing to enhance management efficiency.

Conclusion

RFID-initiate surgical workflow control is valuable to meet the safety, quality, efficiency requirements in operation theater.     

Strong matching preclusion

The matching preclusion problem, introduced by Brigham et al. [R.C. Brigham, F. Harary, E.C. Violin, and J. Yellen, Perfect-matching preclusion, Congressus Numerantium 174 (2005) 185-192], studies how to effectively make a graph have neither perfect matchings nor almost perfect matchings by deleting as small a number of edges as possible. Extending this concept, we consider a more general matching preclusion problem, called the strong matching preclusion, in which deletion of vertices is additionally permitted. We establish the strong matching preclusion number and all possible minimum strong matching preclusion sets for various classes of graphs.     

基于前缀的Apriori算法

通过对Apriori算法的研究和分析,结合算法存在的缺陷,利用"桶"技术及压缩组合项集技术,对频繁项集提出了前缀概念,并提出了基于前缀的频繁项集挖掘算法。该算法将具有同一前缀的频繁项集的子集合作为一个节点,由频繁k-项集的子集合直接产生候选(k+1)-项集,从而省略了连接步中判断I1、I2是否能连接。同时,该算法使得整个程序中节点数目减少,这样不仅减少了内存消耗,而且提高了查找Ck和Lk的速度,尤其便于大型数据库的分布式处理。经实验证实,改进后的算法是可行的。     

交流阻抗法测定锂离子电池正极材料的导电率

采用交流阻抗法测定了3种锂离子电池正极材料LiCoO2,LiMn2O4和LiFePO4的电子导电率、离子导电率和材料电导率.结果表明,LiCoO2材料的电导率较高,含有聚阴离子基团LiFePO4材料的电子电导率和离子电导率均较低.     

Contour matching using epipolar geometry

Matching features computed in images is an important process in multiview image analysis. When the motion between two images is large, the matching problem becomes very difficult. In this paper, we propose a contour matching algorithm based on geometric constraints. With the assumption that the contours are obtained from images taken from a moving camera with static scenes, we apply the epipolar constraint between two sets of contours and compute the corresponding points on the contours. From the initial epipolar constraints obtained from corner point matching, candidate contours are selected according to the epipolar geometry, contour end point constraints, and contour distance measures. In order to reduce the possibility of false matches, the number of match points on a contour is also used as a selection measure. The initial epipolar constraint is refined from the matched sets of contours. The algorithm can be applied to a pair or two pairs of images. All of the processes are fully automatic and successfully implemented and tested with various real images     

异质环境中可靠组播的代理结构

文章提出了一种适于异质网络环境的可靠组播代理结构。这种代理结构将网络环境相异的可靠组播会话分解成若干个网络环境相似的子会话,从而缓解了异质网络环境的异构问题。不仅如此,通过在可靠组播代理中引入应用程序的语义,实现了语义可靠性,即应用程序能够根据语义控制它所需要的数据可靠性。     

数据仓库中元数据技术研究

元数据及其管理是数据仓库系统的核心部件,是内部技术人员开发与维护数据仓库的蓝图,是商业终端用户导航数据仓库以及定位有用信息的路标。该文详细介绍了无数据的功能及其管理,然后简单介绍了元数据联盟的开放信息模型。