Oceania
How ditching the nine-to-five could help businesses adapt as use of artificial intelligence increases
Switching from a nine-to-five to a nine-to-three workday could be the way forward in an increasingly hi-tech world, researchers say. A University of Otago report, released on Monday, found that while the impact of increased use of artificial intelligence (AI) on jobs was hard to predict, a shorter work week could help businesses and workers adapt. Report co-author Professor James Maclaurin said using AI alongside human workers could increase efficiency, productivity and potentially incomes. Avoiding AI, on the other hand, pushed workers into low-paid work while technology took on high value tasks. READ MORE: * Flexible work: The rise – and pros and cons – of shunning the'office' * Independent watchdog needed to probe Government's use of AI: law, computer science experts * The tech sector won't wait for us to catch up * While artificial intelligence is tipped to be'as significant as electricity', it's not coming for your job, yet "The key question is whether New Zealand will successfully deploy AI, ultimately increasing our GDP [gross domestic product], or [whether] more and more of the profits from the AI revolution flow to large, data-rich international companies such as Google and Facebook."
Here Are the Top 10 Ted Talks on AI That Are a Must-Watch
In the current scenario, where everything is going digital, Ted Talks have a great role in educating and imparting knowledge to a wider audience. These engaging interactions have robbed the minds of people and Ted Talks do not consume a lot of time. Instead, they just spread ideas in a very concise, interactive form so that it hooks and does not bore the audience. Ted Talks cover a wide variety of themes and topics, technology is one of them. It has a great archive of talks on artificial intelligence.
Humanoid Attack: New Form Of Click Fraud Identified Through Machine Learning
A research initiative from the US, Australia and China has identified a new strain of click fraud, dubbed'Humanoid Attack' that slips past conventional detection frameworks, and exploits real-life user interactions in mobile apps in order to generate revenue from fake clicks on embedded third-party framework advertisements. The paper, led by Shanghai Jiao Tong University, contends that this new variation on click fraud is already widely diffused, and identifies 157 infected apps out of the top-rated 20,000 apps across the Google Play and Huawei app markets. One HA-infected social and communication app discussed in the study is reported to have 570 million downloads. The report notes that four other apps'produced by the same company are manifested to have similar click fraud codes'. To detect apps which feature Humanoid Attack (HA), the researchers developed a tool entitled ClickScanner, which generates data dependency graphs, based on static analysis, from bytecode-level inspection of Android apps.
Stochastic Intervention for Causal Effect Estimation
Duong, Tri Dung, Li, Qian, Xu, Guandong
Causal inference methods are widely applied in various decision-making domains such as precision medicine, optimal policy and economics. Central to these applications is the treatment effect estimation of intervention strategies. Current estimation methods are mostly restricted to the deterministic treatment, which however, is unable to address the stochastic space treatment policies. Moreover, previous methods can only make binary yes-or-no decisions based on the treatment effect, lacking the capability of providing fine-grained effect estimation degree to explain the process of decision making. In our study, we therefore advance the causal inference research to estimate stochastic intervention effect by devising a new stochastic propensity score and stochastic intervention effect estimator (SIE). Meanwhile, we design a customized genetic algorithm specific to stochastic intervention effect (Ge-SIO) with the aim of providing causal evidence for decision making. We provide the theoretical analysis and conduct an empirical study to justify that our proposed measures and algorithms can achieve a significant performance lift in comparison with state-of-the-art baselines.
A Comprehensive Survey on Community Detection with Deep Learning
Su, Xing, Xue, Shan, Liu, Fanzhen, Wu, Jia, Yang, Jian, Zhou, Chuan, Hu, Wenbin, Paris, Cecile, Nepal, Surya, Jin, Di, Sheng, Quan Z., Yu, Philip S.
A community reveals the features and connections of its members that are different from those in other communities in a network. Detecting communities is of great significance in network analysis. Despite the classical spectral clustering and statistical inference methods, we notice a significant development of deep learning techniques for community detection in recent years with their advantages in handling high dimensional network data. Hence, a comprehensive overview of community detection's latest progress through deep learning is timely to both academics and practitioners. This survey devises and proposes a new taxonomy covering different categories of the state-of-the-art methods, including deep learning-based models upon deep neural networks, deep nonnegative matrix factorization and deep sparse filtering. The main category, i.e., deep neural networks, is further divided into convolutional networks, graph attention networks, generative adversarial networks and autoencoders. The survey also summarizes the popular benchmark data sets, model evaluation metrics, and open-source implementations to address experimentation settings. We then discuss the practical applications of community detection in various domains and point to implementation scenarios. Finally, we outline future directions by suggesting challenging topics in this fast-growing deep learning field.
Reputation Bootstrapping for Composite Services using CP-nets
Mistry, Sajib, Bouguettaya, Athman
We propose a novel framework to bootstrap the reputation of on-demand service compositions. On-demand compositions are usually context-aware and have little or no direct consumer feedback. The reputation bootstrapping of single or atomic services does not consider the topology of the composition and relationships among reputation-related factors. We apply Conditional Preference Networks (CP-nets) of reputation-related factors for component services in a composition. The reputation of a composite service is bootstrapped by the composition of CP-nets. We consider the history of invocation among component services to determine reputation-interdependence in a composition. The composition rules are constructed using the composition topology and four types of reputation-influence among component services. A heuristic-based Q-learning approach is proposed to select the optimal set of reputation-related CP-nets. Experimental results prove the efficiency of the proposed approach.
General Game Heuristic Prediction Based on Ludeme Descriptions
Stephenson, Matthew, Soemers, Dennis J. N. J., Piette, Eric, Browne, Cameron
This paper investigates the performance of different general-game-playing heuristics for games in the Ludii general game system. Based on these results, we train several regression learning models to predict the performance of these heuristics based on each game's description file. We also provide a condensed analysis of the games available in Ludii, and the different ludemes that define them.
Zero-shot Medical Entity Retrieval without Annotation: Learning From Rich Knowledge Graph Semantics
Kong, Luyang, Winestock, Christopher, Bhatia, Parminder
Medical entity retrieval is an integral component for understanding and communicating information across various health systems. Current approaches tend to work well on specific medical domains but generalize poorly to unseen sub-specialties. This is of increasing concern under a public health crisis as new medical conditions and drug treatments come to light frequently. Zero-shot retrieval is challenging due to the high degree of ambiguity and variability in medical corpora, making it difficult to build an accurate similarity measure between mentions and concepts. Medical knowledge graphs (KG), however, contain rich semantics including large numbers of synonyms as well as its curated graphical structures. To take advantage of this valuable information, we propose a suite of learning tasks designed for training efficient zero-shot entity retrieval models. Without requiring any human annotation, our knowledge graph enriched architecture significantly outperforms common zero-shot benchmarks including BM25 and Clinical BERT with 7% to 30% higher recall across multiple major medical ontologies, such as UMLS, SNOMED, and ICD-10.
What will they do? Modelling self-evacuation archetypes
Singh, Dhirendra, Strahan, Ken, McLennan, Jim, Robertson, Joel, Wickramasinghe, Bhagya
A decade on from the devastating Black Saturday bushfires in Victoria, Australia, we are at a point where computer simulations of community evacuations are starting to be used within the emergency services. While fire progression modelling is embedded in strategic and operational settings at all levels of government across Victoria, modelling of community response to such fires is only just starting to be evaluated in earnest. For community response models to become integral to bushfire planning and preparedness, the key question to be addressed is: when faced with a bushfire, what will a community really do? Typically this understanding has come from local experience and expertise within the community and services, however the trend is to move towards more informed data driven approaches. In this paper we report on the latest work within the emergency sector in this space. Particularly, we discuss the application of Strahan et al.'s self-evacuation archetypes to an agent-based model of community evacuation in regional Victoria. This work is part of the consolidated bushfire evacuation modelling collaboration between several emergency management stakeholders.
Simba
Package-level integration using multi-chip-modules (MCMs) is a promising approach for building large-scale systems. Compared to a large monolithic die, an MCM combines many smaller chiplets into a larger system, substantially reducing fabrication and design costs. Current MCMs typically only contain a handful of coarse-grained large chiplets due to the high area, performance, and energy overheads associated with inter-chiplet communication. This work investigates and quantifies the costs and benefits of using MCMs with finegrained chiplets for deep learning inference, an application domain with large compute and on-chip storage requirements. To evaluate the approach, we architected, implemented, fabricated, and tested Simba, a 36-chiplet prototype MCM system for deep-learning inference. Each chiplet achieves 4 TOPS peak performance, and the 36-chiplet MCM package achieves up to 128 TOPS and up to 6.1 TOPS/W. The MCM is configurable to support a flexible mapping of DNN layers to the distributed compute and storage units. To mitigate inter-chiplet communication overheads, we introduce three tiling optimizations that improve data locality. These optimizations achieve up to 16% speedup compared to the baseline layer mapping. Our evaluation shows that Simba can process 1988 images/s running ResNet-50 with a batch size of one, delivering an inference latency of 0.50 ms. Deep learning (DL) has become critical for addressing complex real-world problems.