Interfacial polycondensation of diphenolic acid and isophthaloyl chloride

Interfacial polycondensation of diphenolic acid (DPA) and isophthaloyl chloride (IPC) in various solvent/water systems was investigated with tetrabutyl ammonium chloride as a phase transfer catalyst. It was found that a large mass of capsules were formed at the beginning of the reaction for all solvents examined but the capsule morphology and reaction results depended on the solvents. It is believed that the capsule shells make up of the reaction zone and a mechanism of the interfacial polycondensation is proposed accordingly. The effect of the solvents on the reaction was interpreted from the interaction between the polymer and the solvent according to the mechanism. The reaction conditions were optimized, and poly(DPA-IPC) with high intrinsic viscosity was prepared in high yield under the optimal condition. It is an amorphous polymer with glass transition temperature of about 160°C. © 2008 Wiley Periodicals, Inc. J Appl Polym Sci, 2008     

AlGaAs／GaAs HBT表面效应的二维数值分析

采用表面效应集总模型综合考虑表面费米能级钉扎和表面复合效应，对ＡｌＧａＡｓ／ＧａＡｓＨＢＴ表面效应的影响进行了二维数值模拟。结果表明，表面态的存在对集电极电流几乎不产生影响，但显著增加基极电流，使得电流增益明显下降。同时还发现在台面结构ＡＩＧａＡｓ／ＧａＡｓＨＢＴ中外基区表面复合的集边效应，即外基区表面复合主要发生在发射极台面与外基区的交界处附近，与外基区长度基本无关。模拟还表明基区缓变结构可以减少表面复合，提高电流增益。     

湘钢220KV备用电源自投方式商榷

针对湘钢三中央变电站２２０ｋＶ备用电源自投装置存在的问题，提出了新的方式和设想．分析采用新的方式后，停电时间由３．５ｓ缩短至０．０４～０．０９ｓ的可行性．同时还提出在ＳＦ６断路器的变电站，自投装置应采用的方式．     

基于多维彩色向量空间的火焰图像模糊聚类分割算法

针对火灾探测过程中早期火焰的分割技术研究,提出了一种基于多维彩色向量空间的火焰图像模糊聚类分割算法,该算法以运动目标序列图像之间变化的区域作为聚类模板,提取该聚类模板的RGB多维彩色特征向量,然后将图像的像素与聚类模板通过模糊聚类的方式进行分割。这种分割算法计算简单,时间开销较小,可以较好地获取火焰图像的边缘形态特征,并且能够明显消除不同光线下分割误差,实现快速无监督自动分割。     

Application of deep learning algorithms in geotechnical engineering: a short critical review

Artificial Intelligence Review - With the advent of big data era, deep learning (DL) has become an essential research subject in the field of artificial intelligence (AI). DL algorithms are...     

The HaLoop approach to large-scale iterative data analysis

The growing demand for large-scale data mining and data analysis applications has led both industry and academia to design new types of highly scalable data-intensive computing platforms. MapReduce has enjoyed particular success. However, MapReduce lacks built-in support for iterative programs, which arise naturally in many applications including data mining, web ranking, graph analysis, and model fitting. This paper (This is an extended version of the VLDB 2010 paper “HaLoop: Efficient Iterative Data Processing on Large Clusters” PVLDB 3(1):285–296, 2010.) presents HaLoop, a modified version of the Hadoop MapReduce framework, that is designed to serve these applications. HaLoop allows iterative applications to be assembled from existing Hadoop programs without modification, and significantly improves their efficiency by providing inter-iteration caching mechanisms and a loop-aware scheduler to exploit these caches. HaLoop retains the fault-tolerance properties of MapReduce through automatic cache recovery and task re-execution. We evaluated HaLoop on a variety of real applications and real datasets. Compared with Hadoop, on average, HaLoop improved runtimes by a factor of 1.85 and shuffled only 4 % as much data between mappers and reducers in the applications that we tested.     

Adaptive load balancing algorithm for multiple homing mobile nodes

In places where mobile users can access multiple wireless networks simultaneously, a multipath scheduling algorithm can benefit the performance of wireless networks and improve the experience of mobile users. However, existing literature shows that it may not be the case, especially for TCP flows. According to early investigations, there are mainly two reasons that result in bad performance of TCP flows in wireless networks. One is the occurrence of out-of-order packets due to different delays in multiple paths. The other is the packet loss which is resulted from the limited bandwidth of wireless networks. To better exploit multipath scheduling for TCP flows, this paper presents a new scheduling algorithm named Adaptive Load Balancing Algorithm (ALBAM) to split traffic across multiple wireless links within the ISP infrastructure. Targeting at solving the two adverse impacts on TCP flows, ALBAM develops two techniques. Firstly, ALBAM takes advantage of the bursty nature of TCP flows and performs scheduling at the flowlet granularity where the packet interval is large enough to compensate for the different path delays. Secondly, ALBAM develops a Packet Number Estimation Algorithm (PNEA) to predict the buffer usage in each path. With PNEA, ALBAM can prevent buffer overflow and schedule the TCP flow to a less congested path before it suffers packet loss. Simulations show that ALBAM can provide better performance to TCP connections than its other counterparts.     

The stable topology for residuated lattices

The spectrum of a residuated lattice L is the set Spec(L) of all prime i-filters. It is well known that Spec(L) can be endowed with the spectral topology. The main scope of this paper is to introduce and study another topology on Spec(L),?the so called stable topology, which turns out to be coarser than the spectral one. With this and in view, we introduce the notions of pure i-filter for a residuated lattice and the notion of normal residuated lattice. So, we generalize to case of residuated lattice some results relative to MV-algebras (Belluce and Sessa in Quaest Math 23:269–277, 2000; Cavaccini et?al. in Math Japonica 45(2):303–310, 1997) or BL-algebras (Eslami and Haghani in Kybernetika 45:491–506, 2009; Leustean in Central Eur J Math 1(3): 382–397, 2003; Turunen and Sessa in Mult-Valued Log 6(1–2):229–249, 2001).