Studying high impact fix-inducing changes

As software systems continue to play an important role in our daily lives, their quality is of paramount importance. Therefore, a plethora of prior research has focused on predicting components of software that are defect-prone. One aspect of this research focuses on predicting software changes that are fix-inducing. Although the prior research on fix-inducing changes has many advantages in terms of highly accurate results, it has one main drawback: It gives the same level of impact to all fix-inducing changes. We argue that treating all fix-inducing changes the same is not ideal, since a small typo in a change is easier to address by a developer than a thread synchronization issue. Therefore, in this paper, we study high impact fix-inducing changes (HIFCs). Since the impact of a change can be measured in different ways, we first propose a measure of impact of the fix-inducing changes, which takes into account the implementation work that needs to be done by developers in later (fixing) changes. Our measure of impact for a fix-inducing change uses the amount of churn, the number of files and the number of subsystems modified by developers during an associated fix of the fix-inducing change. We perform our study using six large open source projects to build specialized models that identify HIFCs, determine the best indicators of HIFCs and examine the benefits of prioritizing HIFCs. Using change factors, we are able to predict 56 % to 77 % of HIFCs with an average false alarm (misclassification) rate of 16 %. We find that the lines of code added, the number of developers who worked on a change, and the number of prior modifications on the files modified during a change are the best indicators of HIFCs. Lastly, we observe that a specialized model for HIFCs can provide inspection effort savings of 4 % over the state-of-the-art models. We believe our results would help practitioners prioritize their efforts towards the most impactful fix-inducing changes and save inspection effort.     

基于大规模MIMO网络的低复杂度块对角化算法

在多用户MIMO系统下行链路中,块对角化（Block diagonalization, BD）预编 码算法的和速率性能要优于匹配滤波算法（Matched filter, MF）和迫零算法（Zero forc i ng, ZF）。然而,传统的BD算法利用矩阵分解来构造除当前用户的其他所有用户信道的零空 间,需要O(N2)浮点运算次数（Float point operations, FLOPs）。当 基站的天线数N趋向于大规模时,BD算法计算复杂度巨大。本文 提出一种基于投影子方法构造其他用户合成信道的零空间的BD算法,该算法仅需O( N)FLOPs。仿真表明：同传统的BD算法相比,本文所提出的低复杂度BD算法显著地降低 了实现复杂度,而和速率性能损失微小,仍然优于MF和ZF,并且当N趋 向于大规模时,它的和速率性能趋向于传统的BD算法和SVD算法。     

Robust‐Adaptive Control Strategies for a Time Delay Bioelectrochemical Process Using Interval Observers

The paper addresses the design and the analysis of adaptive and robust‐adaptive control strategies for a complex recycled wastewater treatment bioprocess. The design procedures are developed under the realistic assumptions that the bacterial growth rates are unknown and the influent flow rates are time‐varying and uncertain, but some lower and upper bounds of these uncertainties are known. The proposed control structures are achieved by combining a linearizing control law with an appropriately (asymptotic or interval based) state observer and with a parameter estimator used for on‐line estimation of unknown kinetics. These approaches are applied to a complex time delay bioprocess resulting from the association of a recycling bioreactor with an electrochemical reactor. Numerical simulations are performed in order to validate the proposed algorithms.     

AT90CAN128的CAN多节点总线同步通信

针对CAN总线多节点的同步性应用,介绍了两种滤波方式,实现了基于AVR单片机ATg0CAN128的CAN总线多节点同步通信。利用CAN总线的点对点、点对多点和广播通信方式以及其特有的报文滤波和非破坏性总线仲裁技术,对多节点的同步性进行探讨,且接入方式简易。     

Image blur and energy broadening effects in XPEEM

We report image blurring and energy broadening effects in energy-filtered XPEEM when illuminating the specimen with soft X-rays at high flux densities. With a flux of 2×10¹³ photons/s, the lateral resolution in XPEEM imaging with either core level or secondary electrons is degraded to more than 50 nm. Fermi level broadening up to several hundred meV and spectral shift to higher kinetic energies are also systematically observed. Simple considerations suggest that these artifacts result from Boersch and Loeffler effects, and that the electron-electron interactions are strongest in the initial part of the microscope optical path. Implications for aberration corrected instruments are discussed.     

Limitations of a Mapping Algorithm with Fragmentation Mimics (MAFM) when modeling statistical data sources based on measured packet network traffic

Knowing the estimation of a statistical process’s parameters for measured network traffic is very important as it can then be further used for the statistical analyses and modeling of network traffic in simulation tools. It is for this reason that different estimation methods are proposed that allow estimations of the statistical processes of network traffic. One of them is our own histograms comparison (EMHC) based method that can be used to estimate statistical data-length process parameters from measured packet traffic. The main part of EMHC method is Mapping Algorithm with Fragmentation Mimics (MAFM).     

HFPaC: GPU friendly height field parallel compression

In this paper, we present a novel method for fast lossy or lossless compression and decompression of regular height fields. The method is suitable for SIMD parallel implementation and thus inherently suitable for modern GPU architectures. Lossy compression is achieved by approximating the height field with a set of quadratic Bezier surfaces. In addition, lossless compression is achieved by superimposing the residuals over the lossy approximation. We validated the method’s efficiency through a CUDA implementation of compression and decompression algorithms. The method allows independent decompression of individual data points, as well as progressive decompression. Even in the case of lossy decompression, the decompressed surface is inherently seamless. In comparison with the GPU-oriented state-of-the-art method, the proposed method, combined with a widely available lossless compression method (such as DEFLATE), achieves comparable compression ratios. The method’s efficiency slightly outperforms the state-of-the-art method for very high workloads and considerably for lower workloads.     

An architectural counterpoint in Universal Everything: Fluid Bodies exhibition

ABSTRACT

This exhibition review focuses on the quest for weaving boundaries between body-form-space-and material relationship using immersive technologies. Emerging as an architectural counterpoint, Universal Everything: Fluid Bodies exhibition held in Borusan Contemporary focuses on how we perceive the motion and form in relation to it, as well as fusing senses of kinaesthetic and synaesthetic through a data driven and motion-based visual representation. Through these algorithms, the exhibition displays how neuroarchitecture reminds us of the senses of perception. The architectural counterpoint, intention as an interaction and encounter of the body with ‘the machine’ as the ‘voyeur body’ and how this observational dialogue becomes a research methodology in understanding the nature of movement in space through digital tools.