结合句法依存信息的方面级情感分类

引入句法依存信息到原方面术语,提出一种新的方面术语表示方法,利用Glove词向量表示单词以及单词与单词之间的依存关系,构造出包含句法依存信息的依存关系邻接矩阵和依存关系表示矩阵,利用图卷积神经网络和多头注意力机制将句法依存信息融入到方面术语中,使得方面术语表达与上下文结构高度相关。将改进后的方面词术语表示替换到现有模型后,模型泛化能力得到有效提升。对比试验和分析结果表明:该方法具有有效性和泛化性。     

Tactile colour pictogram to improve artwork appreciation of people with visual impairments

A recent development in tactile technology enables an improvement in the appreciation of the visual arts for people with visual impairment (PVI). The tactile sense, in conjunction with, or a possibly as an alternative to, the auditory sense, would allow PVIs to approach artwork in a more self‐driven and engaging way that would be difficult to achieve with just an auditory stimulus. Tactile colour pictograms (TCPs), which are raised geometric patterns, are ideographic characters that are designed to enable PVIs to identify colours and interpret information by touch. In this article, three TCPs are introduced to code colours in the Munsell colour system. Each colour pattern consists of a basic cell size of 10 mm × 10 mm to represent the patterns consistently in terms of regular shape. Each TCP consists of basic geometric patterns that are combined to create primary, secondary, and tertiary colour pictograms of shapes indicating colour hue, intensity and lightness. Each TCP represents 29 colours including six hues; they were then further expanded to represent 53 colours. Two of them did not increase the cell size, the other increased the cell size 1.5 times for some colours, such as yellow‐orange, yellow, blue, and blue‐purple. Our proposed TCPs use a slightly larger cell size compared to most tactile patterns currently used to indicate colour, but code for more colours. With user experience and identification tests, conducted with 23 visually impaired adults, the effectiveness of the TCPs suggests that they were helpful for the participants.     

2种侧围加强内框总成检具结构对比分析

概述了侧围加强内框总成与周边零件的匹配关系,从检具操作的人机工程出发,描述了侧围加强内框总成检具的2种定位方式和结构设计,对比了2种定位方式对于检测结果的影响,总结了其优点和弊端,结果表明侧围加强内框总成检具采用车内方向朝下的定位方式效果更好。     

Morphological study of thin films: Simulation and experimental insights using horizontal visibility graph

We studied the morphological nature of various thin films such as silicon carbide (SiC), diamond (C), germanium (Ge), and gallium nitride (GaN) on silicon substrate Si(100) using the pulsed laser deposition (PLD) method and Monte Carlo simulation. We, for the first time, systematically employed the visibility algorithm graph to meticulously study the morphological features of various PLD grown thin films. These thin-film morphologies are investigated using random distribution, Gaussian distribution, patterned heights, etc. The nature of the interfacial height of individual surfaces is examined by a horizontal visibility graph (HVG). It demonstrates that the continuous interfacial height of the silicon carbide, diamond, germanium, and gallium nitride films are attributed to random distribution and Gaussian distribution in thin films. However, discrete peaks are obtained in the brush and step-like morphology of germanium thin films. Further, we have experimentally verified the morphological nature of simulated silicon carbide, diamond, germanium, and gallium nitride thin films were grown on Si(100) substrate by pulsed laser deposition (PLD) at elevated temperature. Various characterization techniques have been used to study the morphological, and electrical properties which confirmed the different nature of the deposited films on the Silicon substrate. Decent hysteresis behavior has been confirmed by current-voltage (IV) measurement in all the four deposited films. The highest current has been measured for GaN at ～60 nA and the lowest current in SiC at ～30 nA level which is quite low comparing with the expected signal level (μA). The HVG technique is suitable to understand surface features of thin films which are substantially advantageous for the energy devices, detectors, optoelectronic devices operating at high temperatures.     

Pattern design and optimization of yarn-dyed plaid fabric using isolation niche genetic algorithm and rough set theory

Under the circumstance of perceptual consumption, it is still challenging to grasp consumer's emotions and demands due to the large search space, diversified preferences, and easy fatigue of consumers. To reduce user fatigue and enlarge search space, a novel method was presented to design and optimize the pattern of yarn-dyed plaid fabric using the isolation niche genetic algorithm and rough set theory. Each pattern was encoded as a chromosome based on the real number code. The population was initialized and evolved using INGA to maintain the diversity. The rough set theory was adopted as the fitness function of isolation niche genetic algorithm to extract the consumer's demands. After multiple evolutions, a large set of practical patterns of the yarn-dyed plaid fabric are obtained. Experiments were carried out by 24 testers of different ages and genders. The results prove that the proposed method based on the isolation niche genetic algorithm and rough set theory is feasible and effective, supplying references to the designer.     

Feeding behavior parameters and temporal patterns in mid-lactation Holstein cows across a range of residual feed intake values

Residual feed intake (RFI) is a measurement of the difference between actual and predicted feed intake when adjusted for energy sinks; more efficient cows eat less than predicted (low RFI) and inefficient cows eat more than predicted (high RFI). Data evaluating the relationship between RFI and feeding behaviors (FB) are limited in dairy cattle; therefore, the objective of this study was to determine daily and temporal FB in mid-lactation Holstein cows across a range of RFI values. Mid-lactation Holstein cows (n = 592 multiparous; 304 primiparous) were enrolled in 17 cohorts at 97 ± 26 d in milk (± standard deviation), and all cows within a cohort were fed a common diet using automated feeding bins. Cow RFI was calculated as the difference between predicted and observed dry matter intake (DMI) after accounting for parity, days in milk, milk energy, metabolic body weight and change, and experiment. The associations between RFI and FB at the level of meals and daily totals were evaluated using mixed models with the fixed effect of RFI and the random effects of cow and cohort. Daily temporal FB analyses were conducted using 2-h blocks and analyzed using mixed models with the fixed effects of RFI, time, RFI × time, and cohort, and the random effect of cow (cohort). There was a positive linear association between RFI and DMI in multiparous cows and a positive quadratic relationship in primiparous cows, where the rate of increase in DMI was less at higher RFI. Eating rate, DMI per meal, and size of the largest daily meal were positively associated with RFI. Daily temporal analysis of FB revealed an interaction between RFI and time for eating rate in multiparous and primiparous cows. The eating rate increased with greater RFI at 11 of 12 time points throughout the day, and eating rate differed across RFI between multiple time points. There tended to be an interaction between RFI and time for eating time and bin visits in multiparous cows but not primiparous cows. Overall, there was a time effect for all FB variables, where DMI, eating time and rate, and bin visits were greatest after the initial daily feeding at 1200 h, increased slightly after each milking, and reached a nadir at 0600 h (6 h before feeding). Considering the relationship between RFI and eating rate, additional efforts to determine cost-effective methods of quantifying eating rate in group-housed dairy cows is warranted. Further investigation is also warranted to determine if management strategies to alter FB, especially eating rate, can be effective in increasing feed efficiency in lactating dairy cattle.     

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

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

Structure-sensitive semantic matching for aggregate question answering over knowledge base

Aggregate question answering essentially returns answers for given questions by obtaining query graphs with unique dependencies between values and corresponding objects. Word order dependency, as the key to uniquely identify dependency of the query graph, reflects the dependencies between the words in the question. However, due to the semantic gap caused by the expression difference between questions encoded with word vectors and query graphs represented with logical formal elements, it is not trivial to match the correct query graph for the question. Most existing approaches design more expressive query graphs for complex questions and rank them just by directly calculating their similarities, ignoring the semantic gap between them. In this paper, we propose a novel Structure-sensitive Semantic Matching(SSM) approach that learns aligned representations of dependencies in questions and query graphs to eliminate their gap. First, we propose a cross-structure matching module to bridge the gap between two modalities(i.e., textual question and query graph). Then, we propose an entropy-based gated AQG filter to remove the structural noise caused by the uncertainty of dependencies. Finally, we present a two-channel query graph representation that fuses the semantics of abstract structure and grounding content of the query graph explicitly. Experimental results show that SSM could learn aligned representations of questions and query graphs to eliminate the gaps between their dependencies, and improves up to 12% (F1 score) on aggregation questions of two benchmark datasets.