Resveratrol as Chemosensitizer Agent: State of Art and Future Perspectives

Resistance to chemotherapy still remains a major challenge in the clinic, impairing the quality of life and survival rate of patients. The identification of unconventional chemosensitizing agents is therefore an interesting aspect of cancer research. Resveratrol has emerged in the last decades as a fascinating molecule, able to modulate several cancer-related molecular mechanisms, suggesting a possible application as an adjuvant in cancer management. This review goes deep into the existing literature concerning the possible chemosensitizing effect of resveratrol associated with the most conventional chemotherapeutic drugs. Despite the promising effects observed in different cancer types in in vitro studies, the clinical translation still presents strong limitations due to the low bioavailability of resveratrol. Recently, efforts have been moved in the field of drug delivery to identifying possible strategies/formulations useful for a more effective administration. Despite the necessity of a huge implementation in this research area, resveratrol appears as a promising molecule able to sensitize resistant tumors to drugs, suggesting its potential use in therapy-refractory cancer patients.     

基于NR-Transformer的集群作业运行时间预测

高性能集群的作业调度通常使用作业调度系统来实现，准确填写作业运行时间能在很大程度上提升作业调度效率。现有的研究通常使用机器学习的预测方式，在预测精度和实用性上还存在一定的提升空间。为了进一步提高集群作业运行时间预测的准确率，考虑先对集群作业日志进行聚类，将作业类别信息添加到作业特征中，再使用基于注意力机制的NR-Transformer网络对作业日志数据建模和预测。在数据处理上，根据与预测目标的相关性、特征的完整性和数据的有效性，从历史日志数据集中筛选出7维特征，并按作业运行时间的长度将其划分为多个作业集，再对各作业集分别进行训练和预测。实验结果表明，相比于传统机器学习和BP神经网络，时序神经网络结构有更好的预测性能，其中NR-Transformer在各作业集上都有较好的性能。     

Urban livability in socially disadvantaged neighborhoods: The experience of the German program “socially integrative city”

This paper asks how the livability of socially disadvantaged urban neighborhoods can be improved with the help of publicly funded area-based urban regeneration. It builds on the history of area-based regeneration policies in Germany aiming at upgrading and resolving urban problems at the neighborhood level. Its main argument is as follows. First, the fate of conventional physical upgrading policies focusing on the livability of deprived urban areas depends on the development environment. While successful upgrading sometimes makes inner-city neighborhoods so attractive that they run into a trend towards gentrification and displacement of the urban poor, the stabilization of less privileged areas cannot always be guaranteed. Second, alternative approaches are needed, linking limited physical upgrading with socially oriented policies, building on strategies like neighborhood management and empowerment. Third, they can make a substantial contribution to stabilizing deprived neighborhoods, thereby improving the general living conditions and the opportunities of the urban poor. However, they require at least some permanent intervention. Thus, they transcend the logic of area-based regeneration normally limited to restoring faith into the private real estate market and thereby directing inward investment into them that improves the quality of the physical environment. Fourth, they are hardly able to overcome significant negative stigmatization in cities that are severely hit by economic downturn and population decline. This is especially true when they act as arrival areas for consecutive waves of migrants, making it necessary to redefine the role of those areas in cities and accepting their high concentration of urban problems as a starting point for different area-based policies dealing with them. The key empirical background of the paper is the German system of urban development grants and an evaluation of the so-called program of “socially integrative city”.     

基于人脸卡口数据的行人共现关系图谱构建

随着人脸识别技术的不断进步以及人脸卡口的大范围且密集的部署, 本文针对团伙犯罪案件侦察这一应用场景, 对人脸卡口数据进行深入挖掘, 探究其中行人间的共现关系, 获取所关注的嫌疑人的现实社交网络, 锁定团伙其余人员. 经过实验比对和论证, 本文使用Chinese Whispers聚类算法对行人节点进行识别, 通过Faiss加速邻接边的构建, 加速图的初始化步骤, 解决其聚类效率低下的问题. 在此基础上, 使用共现频次和Apriori算法中的置信度挖掘行人间的共现关系, 构建行人共现关系图谱.     

针对细微特征进行K-means聚类的电台分选识别技术

现代战场中的无线通信设备日益增多，精准获取个体信息已成为研究热点，但也是难点。针对通信电台，提出了一种分选识别技术。该技术从电台物理层特性出发，对其辐射信号的细微特征进行K-means聚类以实现分选，分选的同时提取各个个体的特征属性值，未知信号通过与特征属性值相关运算实现个体识别。该技术无需先验知识，无需训练运算，通过实验验证，其可行、高效，易于工程实现。     

A fuzzy logic PI control with feedforward compensation for hydrogen pressure in vehicular fuel cell system

In a vehicular fuel cell system, alternative load and frequent purge action can lead to anode pressure varies with the hydrogen mass flow fluctuation. It's crucial to control the pressure difference between anode and cathode within a reasonable range to avoid adverse phenomena such as membrane failure, reactant starvation, or even water management fault. In this paper, an improved proportional integrative (PI) controller by the fuzzy logic technique that considers the engineer experience and knowledge on the hydrogen supply system behavior is proposed for hydrogen pressure control, in which the PI parameters are tuned by a fuzzy decision process. Furthermore, load current and purge action regarded as input disturbances are applied for feedforward compensation to reduce the pressure response hysteresis. A hydrogen supply subsystem based on the proportional valve is modeled, and corresponding parameters are determined by analyzing the response time and steady pressure fluctuation. The performance of the conventional PI controller, the fuzzy logic PI (FLPI) controller and fuzzy logic PI with feedforward (FLPIF) controller is validated. The presented results indicated that the FLPI controller significantly improves the dynamic response of hydrogen pressure compared to the PI controller, and the FLPIF controller can further reduce overshoot caused by disturbance. Finally, the proposed FLPIF controller is implemented on a rapid prototype platform of the hydrogen supply subsystem and an actual fuel cell system, exhibiting satisfactory performance.     

A Tradeoff Between Accuracy and Speed for K-Means Seed Determination

With a sharp increase in the information volume, analyzing and retrieving this vast data volume is much more essential than ever. One of the main techniques that would be beneficial in this regard is called the Clustering method. Clustering aims to classify objects so that all objects within a cluster have similar features while other objects in different clusters are as distinct as possible. One of the most widely used clustering algorithms with the well and approved performance in different applications is the k-means algorithm. The main problem of the k-means algorithm is its performance which can be directly affected by the selection in the primary clusters. Lack of attention to this crucial issue has consequences such as creating empty clusters and decreasing the convergence time. Besides, the selection of appropriate initial seeds can reduce the cluster’s inconsistency. In this paper, we present a new method to determine the initial seeds of the k-mean algorithm to improve the accuracy and decrease the number of iterations of the algorithm. For this purpose, a new method is proposed considering the average distance between objects to determine the initial seeds. Our method attempts to provide a proper tradeoff between the accuracy and speed of the clustering algorithm. The experimental results showed that our proposed approach outperforms the Chithra with 1.7% and 2.1% in terms of clustering accuracy for Wine and Abalone detection data, respectively. Furthermore, achieved results indicate that comparing with the Reverse Nearest Neighbor (RNN) search approach, the proposed method has a higher convergence speed.     

基于Word2Vec模型特征扩展的Web搜索结果聚类性能的改进

对于用户泛化和模糊的查询，将Web搜索引擎返回的列表内容聚类处理，便于用户有效查找感兴趣的内容。由于返回的列表由称为片段（snippet）的短文本组成，而传统的单词频率-逆文档频率（TF-IDF）特征选择模型不能适用于稀疏的短文本，使得聚类性能下降。一个有效的方法就是通过一个外部的知识库对短文本进行扩展。受到基于神经网络词表示方法的启发，提出了通过词嵌入技术的Word2Vec模型对短文本扩展，即采用Word2Vec模型的TopN个最相似的单词用于对片段（snippet）的扩展，扩展文档使得TF-IDF模型特征选择得到聚类性能的提高。同时考虑到通用性单词造成的噪声引入，对扩展文档的TF-IDF矩阵进行了词频权重修正。实验在两个公开数据集ODP239和SearchSnippets上完成，将所提方法和纯snippet无扩展的方法、基于Wordnet的特征扩展方法和基于Wikipedia的特征扩展方法进行了对比。实验结果表明，所提方法在聚类性能方面优于对比方法。     

大规模生物网络马尔可夫聚类的并行化算法

马尔可夫聚类算法（MCL）是在大规模生物网络中寻找模块的一个有效方法，能够挖掘网络结构和功能影响力较大的模块。算法涉及到大规模矩阵计算，因此复杂度可达立方阶次。针对复杂度高的问题，提出了基于消息传递接口（MPI）的并行化马尔可夫聚类算法以提高算法的计算性能。首先，生物网络转化成邻接矩阵；然后，根据算法的特性，按照矩阵的规模判断并重新生成新矩阵以处理非平方倍数矩阵的计算；其次，并行计算通过按块分配的方式能够有效地实现任意规模矩阵的运算；最后，循环并行计算直至收敛，得到网络聚类结果。通过模拟网络和真实生物网络数据集的实验结果表明，与全块集体式通信（FCC）并行方法相比，平均并行效率提升了10个百分点以上，因此可以将该优化算法应用在不同类型的大规模生物网络中。