Africa
Rhythm Modeling for Voice Conversion
van Niekerk, Benjamin, Carbonneau, Marc-André, Kamper, Herman
Voice conversion aims to transform source speech into a different target voice. However, typical voice conversion systems do not account for rhythm, which is an important factor in the perception of speaker identity. To bridge this gap, we introduce Urhythmic-an unsupervised method for rhythm conversion that does not require parallel data or text transcriptions. Using self-supervised representations, we first divide source audio into segments approximating sonorants, obstruents, and silences. Then we model rhythm by estimating speaking rate or the duration distribution of each segment type. Finally, we match the target speaking rate or rhythm by time-stretching the speech segments. Experiments show that Urhythmic outperforms existing unsupervised methods in terms of quality and prosody. Code and checkpoints: https://github.com/bshall/urhythmic. Audio demo page: https://ubisoft-laforge.github.io/speech/urhythmic.
Dynamic mean field programming
A dynamic mean field theory is developed for finite state and action Bayesian reinforcement learning in the large state space limit. In an analogy with statistical physics, the Bellman equation is studied as a disordered dynamical system; the Markov decision process transition probabilities are interpreted as couplings and the value functions as deterministic spins that evolve dynamically. Thus, the mean-rewards and transition probabilities are considered to be quenched random variables. The theory reveals that, under certain assumptions, the state-action values are statistically independent across state-action pairs in the asymptotic state space limit, and provides the form of the distribution exactly. The results hold in the finite and discounted infinite horizon settings, for both value iteration and policy evaluation. The state-action value statistics can be computed from a set of mean field equations, which we call dynamic mean field programming (DMFP). For policy evaluation the equations are exact. For value iteration, approximate equations are obtained by appealing to extreme value theory or bounds. The result provides analytic insight into the statistical structure of tabular reinforcement learning, for example revealing the conditions under which reinforcement learning is equivalent to a set of independent multi-armed bandit problems.
Fans left unable to sleep after watching 'terrifying' killer robots documentary on Netflix
Fans and casual viewers alike are stumbling upon'Unknown: Killer Robots' the chilling latest installment of Netflix's new documentary series'Unknown' -- and discovering that they can't unknow what they've just learned. 'I can only conclude that we have created a psychopathic demi-god and unleashed it on the world,' as one viewer tweeted about the streamer's in-depth look at AI's lethal potential and the military arms race for more autonomous weapons of war. Everyone from refugee groups that serve war-torn countries, to the very same scientific experts who appear in'Killer Robots' themselves, have voiced concern over the documentary's alarming revelations. In the words of one fan, the Netflix expose is'fascinating, thought-provoking, and the stuff of nightmares.' One fan said the Netflix doc is'fascinating, thought-provoking, and the stuff of nightmares' Everyone from refugee groups serving war-torn countries, to the very same scientific experts who appeared in Netflix's'Killer Robots,' have voiced concern over the doc's dark revelations One nonprofit devoted to helping refugees of the Taliban and the war in Afghanistan, Afghans For A Better Tomorrow, praised the film as'a groundbreaking documentary exploring the rise of AI-powered robots on the battlefield.'
Why Bill Gates Isn't too Worried About the Risks of AI
Bill Gates outlined how he thinks about the risks from artificial intelligence (AI) in a blog post on Tuesday. While Gates remains excited by the benefits that AI could bring, he shared his thoughts on the areas of risk he hears concern about most often. In the post, titled The risks of AI are real but manageable, Gates discusses five risks from AI in particular. First, AI-generated misinformation and deepfakes could be used to scam people or even sway the results of an election. Third, AI could take people's jobs.
The Jiminy Advisor: Moral Agreements among Stakeholders Based on Norms and Argumentation
Liao, Beishui (Zheijang University) | Pardo, Pere (a:1:{s:5:"en_US";s:24:"University of Luxembourg";}) | Slavkovik, Marija (University of Bergen) | van der Torre, Leendert (University of Luxembourg)
An autonomous system is constructed by a manufacturer, operates in a society subject to norms and laws, and interacts with end users. All of these actors are stakeholders affected by the behavior of the autonomous system. We address the challenge of how the ethical views of such stakeholders can be integrated in the behavior of an autonomous system. We propose an ethical recommendation component called Jiminy which uses techniques from normative systems and formal argumentation to reach moral agreements among stakeholders. A Jiminy represents the ethical views of each stakeholder by using normative systems, and has three ways of resolving moral dilemmas that involve the opinions of the stakeholders. First, the Jiminy considers how the arguments of the stakeholders relate to one another, which may already resolve the dilemma. Secondly, the Jiminy combines the normative systems of the stakeholders such that the combined expertise of the stakeholders may resolve the dilemma. Thirdly, and only if these two other methods have failed, the Jiminy uses context-sensitive rules to decide which of the stakeholders take preference over the others. At the abstract level, these three methods are characterized by adding arguments, adding attacks between arguments, and revising attacks between arguments. We show how a Jiminy can be used not only for ethical reasoning and collaborative decision-making, but also to provide explanations about ethical behavior.
Joint Machine-Transporter Scheduling for Multistage Jobs with Adjustable Computation Time
Khateri, Koresh, Beltrame, Giovanni
This paper presents a scalable solution with adjustable computation time for the joint problem of scheduling and assigning machines and transporters for missions that must be completed in a fixed order of operations across multiple stages. A battery-operated multi-robot system with a maximum travel range is employed as the transporter between stages and charging them is considered as an operation. Robots are assigned to a single job until its completion. Additionally, The operation completion time is assumed to be dependent on the machine and the type of operation, but independent of the job. This work aims to minimize a weighted multi-objective goal that includes both the required time and energy consumed by the transporters. This problem is a variation of the flexible flow shop with transports, that is proven to be NP-complete. To provide a solution, time is discretized, the solution space is divided temporally, and jobs are clustered into diverse groups. Finally, an integer linear programming solver is applied within a sliding time window to determine assignments and create a schedule that minimizes the objective. The computation time can be reduced depending on the number of jobs selected at each segment, with a trade-off on optimality. The proposed algorithm finds its application in a water sampling project, where water sampling jobs are assigned to robots, sample deliveries at laboratories are scheduled, and the robots are routed to charging stations.
Looking Beyond IoCs: Automatically Extracting Attack Patterns from External CTI
Alam, Md Tanvirul, Bhusal, Dipkamal, Park, Youngja, Rastogi, Nidhi
Public and commercial organizations extensively share cyberthreat Cyber Threat Intelligence (CTI) offers crucial insights into the intelligence (CTI) to prepare systems to defend against existing rapidly evolving cyber threat landscape. This information includes and emerging cyberattacks. However, traditional CTI has primarily any evidence to identify and assess the associated threats, such as focused on tracking known threat indicators such as IP addresses indicators of compromise (IOCs), IP addresses, domain names, and and domain names, which may not provide long-term value in file hashes, and any associated tactics, techniques, and procedures defending against evolving attacks. To address this challenge, we (TTPs) used by the attacker(s). For instance, CTI can provide comprehensive, propose to use more robust threat intelligence signals called attack contextual information on emerging threats like the patterns. LADDER is a knowledge extraction framework that can advanced persistent threat (APT), ScarCruft [58]. Also known as extract text-based attack patterns from CTI reports at scale. The APT37, the cyber threat intelligence on ScarCruft reported that the framework characterizes attack patterns by capturing the phases of APT targets "individuals in South Korean organizations" with the an attack in Android and enterprise networks and systematically primary objective of "cyber espionage."
Automatic Generation of Semantic Parts for Face Image Synthesis
Fontanini, Tomaso, Ferrari, Claudio, Bertozzi, Massimo, Prati, Andrea
Semantic image synthesis (SIS) refers to the problem of generating realistic imagery given a semantic segmentation mask that defines the spatial layout of object classes. Most of the approaches in the literature, other than the quality of the generated images, put effort in finding solutions to increase the generation diversity in terms of style i.e. texture. However, they all neglect a different feature, which is the possibility of manipulating the layout provided by the mask. Currently, the only way to do so is manually by means of graphical users interfaces. In this paper, we describe a network architecture to address the problem of automatically manipulating or generating the shape of object classes in semantic segmentation masks, with specific focus on human faces. Our proposed model allows embedding the mask class-wise into a latent space where each class embedding can be independently edited. Then, a bi-directional LSTM block and a convolutional decoder output a new, locally manipulated mask. We report quantitative and qualitative results on the CelebMask-HQ dataset, which show our model can both faithfully reconstruct and modify a segmentation mask at the class level. Also, we show our model can be put before a SIS generator, opening the way to a fully automatic generation control of both shape and texture.
A Mapping Study of Machine Learning Methods for Remaining Useful Life Estimation of Lead-Acid Batteries
Chevtchenko, Sérgio F, Rocha, Elisson da Silva, Cruz, Bruna, de Andrade, Ermeson Carneiro, de Araújo, Danilo Ricardo Barbosa
Energy storage solutions play an increasingly important role in modern infrastructure and lead-acid batteries are among the most commonly used in the rechargeable category. Due to normal degradation over time, correctly determining the battery's State of Health (SoH) and Remaining Useful Life (RUL) contributes to enhancing predictive maintenance, reliability, and longevity of battery systems. Besides improving the cost savings, correct estimation of the SoH can lead to reduced pollution though reuse of retired batteries. This paper presents a mapping study of the state-of-the-art in machine learning methods for estimating the SoH and RUL of lead-acid batteries. These two indicators are critical in the battery management systems of electric vehicles, renewable energy systems, and other applications that rely heavily on this battery technology. In this study, we analyzed the types of machine learning algorithms employed for estimating SoH and RUL, and evaluated their performance in terms of accuracy and inference time. Additionally, this mapping identifies and analyzes the most commonly used combinations of sensors in specific applications, such as vehicular batteries. The mapping concludes by highlighting potential gaps and opportunities for future research, which lays the foundation for further advancements in the field.
A Modal Logic for Explaining some Graph Neural Networks
Nunn, Pierre, Schwarzentruber, François
In this paper, we propose a modal logic in which counting modalities appear in linear inequalities. We show that each formula can be transformed into an equivalent graph neural network (GNN). We also show that each GNN can be transformed into a formula. We show that the satisfiability problem is decidable. We also discuss some variants that are in PSPACE.