Computer vision is an interdisciplinary field that deals with how computers can be made for gaining high-level understanding from digital images or videos. From the perspective of engineering, it seeks to automate tasks that the human visual system can do. Country: China Funding: $1.6B SenseTime develops face recognition technology that can be applied to payment and picture analysis, which could be used, for instance, on bank card verification and security systems. Country: China Funding: $607M Megvii develops Face Cognitive Services - a platform offering computer vision technologies that enable your applications to read and understand the world better. Face allows you to easily add leading, deep learning-based image analysis recognition technologies into your applications, with simple and powerful APIs and SDKs.

Fixing bugs in a timely manner lowers various potential costs in software maintenance. However, manual bug fixing scheduling can be time-consuming, cumbersome, and error-prone. In this paper, we propose the Schedule and Dependency-aware Bug Triage (S-DABT), a bug triaging method that utilizes integer programming and machine learning techniques to assign bugs to suitable developers. Unlike prior works that largely focus on a single component of the bug reports, our approach takes into account the textual data, bug fixing costs, and bug dependencies. We further incorporate the schedule of developers in our formulation to have a more comprehensive model for this multifaceted problem. As a result, this complete formulation considers developers' schedules and the blocking effects of the bugs while covering the most significant aspects of the previously proposed methods. Our numerical study on four open-source software systems, namely, EclipseJDT, LibreOffice, GCC, and Mozilla, shows that taking into account the schedules of the developers decreases the average bug fixing times. We find that S-DABT leads to a high level of developer utilization through a fair distribution of the tasks among the developers and efficient use of the free spots in their schedules. Via the simulation of the issue tracking system, we also show how incorporating the schedule in the model formulation reduces the bug fixing time, improves the assignment accuracy, and utilizes the capability of each developer without much comprising in the model run times. We find that S-DABT decreases the complexity of the bug dependency graph by prioritizing blocking bugs and effectively reduces the infeasible assignment ratio due to bug dependencies. Consequently, we recommend considering developers' schedules while automating bug triage.

Medical data are often highly sensitive, and frequently there are missing data. Due to the data's sensitive nature, there is an interest in creating modelling methods where the data are kept in each local centre to preserve their privacy, but yet the model can be trained on and learn from data across multiple centres. Such an approach might be distributed machine learning (federated learning, collaborative learning) in which a model is iteratively calculated based on aggregated local model information from each centre. However, even though no specific data are leaving the centre, there is a potential risk that the exchanged information is sufficient to reconstruct all or part of the patient data, which would hamper the safety-protecting rationale idea of distributed learning. This paper demonstrates that the optimisation of a Cox survival model can lead to patient data leakage. Following this, we suggest a way to optimise and validate a Cox model that avoids these problems in a secure way. The feasibility of the suggested method is demonstrated in a provided Matlab code that also includes methods for handling missing data.

"I'm running out of time, but I'm also not gonna be like, 'I'm having a baby for the sake of having a baby,'" said the younger of the two. "One thing I would recommend," replied the older woman, "if it's an option: freeze your eggs." As a woman, you get to a certain age and babies – hypothetical, expected, realised – suddenly seem ubiquitous: in friendship circles, on social media, in targeted advertising for pregnancy tests and public health messages. But for women of my generation, the decision whether to have children feels more existentially fraught and morally complex than ever before. I have always wanted kids. I have always felt an uncomplicated joy at the chubbiness of babies' limbs and the infectiousness of a child's laughter.

The influence maximization paradigm has been used by researchers in various fields in order to study how information spreads in social networks. While previously the attention was mostly on efficiency, more recently fairness issues have been taken into account in this scope. In the present paper, we propose to use randomization as a mean for achieving fairness. While this general idea is not new, it has not been applied in this area. Similar to previous works like Fish et al. (WWW ’19) and Tsang et al. (IJCAI ’19), we study the maximin criterion for (group) fairness. In contrast to their work however, we model the problem in such a way that, when choosing the seed sets, probabilistic strategies are possible rather than only deterministic ones. We introduce two different variants of this probabilistic problem, one that entails probabilistic strategies over nodes (node-based problem) and a second one that entails probabilistic strategies over sets of nodes (set-based problem). After analyzing the relation between the two probabilistic problems, we show that, while the original deterministic maximin problem was inapproximable, both probabilistic variants permit approximation algorithms that achieve a constant multiplicative factor of 1 − 1/e minus an additive arbitrarily small error that is due to the simulation of the information spread. For the node-based problem, the approximation is achieved by observing that a polynomial-sized linear program approximates the problem well. For the set-based problem, we show that a multiplicative-weight routine can yield the approximation result. For an experimental study, we provide implementations of multiplicative-weight routines for both the set-based and the node-based problems and compare the achieved fairness values to existing methods. Maybe non-surprisingly, we show that the ex-ante values, i.e., minimum expected value of an individual (or group) to obtain the information, of the computed probabilistic strategies are significantly larger than the (ex-post) fairness values of previous methods. This indicates that studying fairness via randomization is a worthwhile path to follow. Interestingly and maybe more surprisingly, we observe that even the ex-post fairness values, i.e., fairness values of sets sampled according to the probabilistic strategies computed by our routines, dominate over the fairness achieved by previous methods on many of the instances tested.

How many times has your website taken a while to load? How many times have you said, "Meh. Your Google page speed score and your core web vitals are more important than ever. Even if you're making sales right now, it's only a matter of time before your competition decides it's better to be the hare and not the tortoise. All of the great content, social media promotion, and keyword research in the world won't matter if your website is a slug on a rainy day.

While the concept of the digital twin is not new or something people haven't heard before, the advancement in the involved factors, specifically technology, has led to people renewing their focus on it for a plethora of reasons. Metaverses are swiftly becoming the next playground for hearts and minds, with the big tech brands connecting vast datasets to create experiential worlds for consumers. It won't take long for the metaverse to become a reality for governments and enterprises as well, with digital twins and 5G converging to connect the dots for digital realms. With ransomware assaults on the ascent in the Asia Pacific and cyber attackers progressively utilizing new innovations like artificial intelligence (AI), nation-states (including Australia, India, Singapore, Hong Kong, Korea, and Japan) recently came together at a US Summit and promised to team up on the developing issue. This will incorporate better approaches to mitigate the risk to physical infrastructure.

Tech companies, retailers and real-estate firms working on ways to alleviate the strain of constant delivery on urban environments envision an alternate scenario: skies filled with zipping delivery drones and floating dirigible warehouses, streets and sidewalks teeming with as many robots as people, familiar storefronts serving as automated stockrooms for online fulfillment. A look at how innovation and technology are transforming the way we live, work and play. The e-commerce process, from order to fulfillment, will gradually move toward total automation, says David Wilson, chief executive of machinery company Columbus McKinnon, which uses robotic components in warehouse lifting equipment. "The vehicle that pulls up is an autonomously driven vehicle. The unpacking is done with vision technology and robotic equipment. The movement of equipment to automated storage and retrieval systems is done via mobile robots," Mr. Wilson says, describing the warehouse of the future.

Currently, many theoretical as well as practically relevant questions towards the transferability and robustness of Convolutional Neural Networks (CNNs) remain unsolved. While ongoing research efforts are engaging these problems from various angles, in most computer vision related cases these approaches can be generalized to investigations of the effects of distribution shifts in image data. In this context, we propose to study the shifts in the learned weights of trained CNN models. Here we focus on the properties of the distributions of dominantly used 3x3 convolution filter kernels. We collected and publicly provide a dataset with over 1.4 billion filters from hundreds of trained CNNs, using a wide range of datasets, architectures, and vision tasks. In a first use case of the proposed dataset, we can show highly relevant properties of many publicly available pre-trained models for practical applications: I) We analyze distribution shifts (or the lack thereof) between trained filters along different axes of meta-parameters, like visual category of the dataset, task, architecture, or layer depth. Based on these results, we conclude that model pre-training can succeed on arbitrary datasets if they meet size and variance conditions. II) We show that many pre-trained models contain degenerated filters which make them less robust and less suitable for fine-tuning on target applications. Data & Project website: https://github.com/paulgavrikov/cnn-filter-db

As medicine continues to test automated machine learning tools, many hope that low-cost support tools will help narrow care gaps in countries with constrained resources. But new research suggests it's those countries that are least represented in the data being used to design and test most clinical AI -- potentially making those gaps even wider. Researchers have shown that AI tools often fail to perform when used in real-world hospitals. It's the problem of transferability: An algorithm trained on one patient population with a particular set of characteristics won't necessarily work well on another. Those failures have motivated a growing call for clinical AI to be both trained and validated on diverse patient data, with representation across spectrums of sex, age, race, ethnicity, and more.