Fox News Flash top entertainment and celebrity headlines are here. If you or someone you know is having thoughts of suicide, please contact the Suicide & Crisis Lifeline at 988 or 1-800-273-TALK (8255). Ashley Judd on Wednesday reportedly said grief-associated clumsiness led to her fracturing her leg earlier this year after the death of her mother. The "Double Jeopardy" actress, 54, said during a conversation series in association with UCLA's Friends of the Semel Institute for Neuroscience and Human Behavior that the "freak accident" fractured her femoral condyle near the knee last summer just months after her mom Naomi Judd, 76, died by suicide, according to the Hollywood Reporter. Judd has said she was the one who found her mother on April 30 at the country music star's Tennessee home.

Artificial Intelligence is a technology that simulates human intelligence processes by machines and computer systems. There's a plethora of different Artificial Intelligence applications including natural language processing, deep learning and speech recognition just to name a few. In 2023 all companies will be under pressure to reduce their carbon footprint and minimize their impact on the environment. In this respect, the race to adopt and profit from AI can be both a blessing and a hindrance. AI algorithms – as well as all the infrastructure needed to support and deliver them, such as cloud networks and edge devices – require increasing amounts of power and resources.

Information and communication technologies are rapidly changing and transforming the citizens' urban life, culture, and habits. Today, cities are lively, active, productive, and innovative, but, at the same time, cities face many problems, such as high density, traffic, waste, water and air pollution, unplanned urbanization, etc. Public and local administrations have focused on finding solutions to these problems and developing new strategies. According to the United Nations' World Population Prospects 2022 most recent forecasts, the world population might reach 8.5 billion in 2030, 9.7 billion in 2050, and 10.4 billion in 2100. By 2050, it is estimated that 68% of the world's population will live in cities. There are many different definitions of smart cities.

The real-time interpretation of the logging-while-drilling data allows us to estimate the positions and properties of the geological layers in an anisotropic subsurface environment. Robust real-time estimations capturing uncertainty can be very useful for efficient geosteering operations. However, the model errors in the prior conceptual geological models and forward simulation of the measurements can be significant factors in the unreliable estimations of the profiles of the geological layers. The model errors are specifically pronounced when using a deep-neural-network (DNN) approximation which we use to accelerate and parallelize the simulation of the measurements. This paper presents a practical workflow consisting of offline and online phases. The offline phase includes DNN training and building of an uncertain prior near-well geo-model. The online phase uses the flexible iterative ensemble smoother (FlexIES) to perform real-time assimilation of extra-deep electromagnetic data accounting for the model errors in the approximate DNN model. We demonstrate the proposed workflow on a case study for a historic well in the Goliat Field (Barents Sea). The median of our probabilistic estimation is on-par with proprietary inversion despite the approximate DNN model and regardless of the number of layers in the chosen prior. By estimating the model errors, FlexIES automatically quantifies the uncertainty in the layers' boundaries and resistivities, which is not standard for proprietary inversion.

In September 2021, the "One Hundred Year Study on Artificial Intelligence" project (AI100) issued the second report of its planned long-term periodic assessment of artificial intelligence (AI) and its impact on society. It was written by a panel of 17 study authors, each of whom is deeply rooted in AI research, chaired by Michael Littman of Brown University. The report, entitled "Gathering Strength, Gathering Storms," answers a set of 14 questions probing critical areas of AI development addressing the major risks and dangers of AI, its effects on society, its public perception and the future of the field. The report concludes that AI has made a major leap from the lab to people's lives in recent years, which increases the urgency to understand its potential negative effects. The questions were developed by the AI100 Standing Committee, chaired by Peter Stone of the University of Texas at Austin, consisting of a group of AI leaders with expertise in computer science, sociology, ethics, economics, and other disciplines.

Herein we propose an improved method for learning low-rank The requirement to repeatedly move large feature maps offand projections which can be incorporated into pre-trained CNNs on-chip during inference with convolutional neural networks to reduce their maximal memory requirements. So doing, this (CNNs) imposes high costs in terms of both energy approach seeks to both reduce the memory requirements on and time. In this work we explore an improved method for a device, and ideally to eliminate off-chip memory access compressing all feature maps of pre-trained CNNs to below a mid-forward-pass, which can dominate power usage [3, 4], specified limit. This is done by means of learned projections a goal which is would enable lower-power, edge-device deployed trained via end-to-end finetuning, which can then be folded deep networks.

In this paper, we introduce the concept of circular Pythagorean fuzzy set (value) (C-PFS(V)) as a new generalization of both circular intuitionistic fuzzy sets (C-IFSs) proposed by Atannassov and Pythagorean fuzzy sets (PFSs) proposed by Yager. A circular Pythagorean fuzzy set is represented by a circle that represents the membership degree and the non-membership degree and whose center consists of non-negative real numbers $\mu$ and $\nu$ with the condition $\mu^2+\nu^2\leq 1$. A C-PFS models the fuzziness of the uncertain information more properly thanks to its structure that allows modelling the information with points of a circle of a certain center and a radius. Therefore, a C-PFS lets decision makers to evaluate objects in a larger and more flexible region and thus more sensitive decisions can be made. After defining the concept of C-PFS we define some fundamental set operations between C-PFSs and propose some algebraic operations between C-PFVs via general $t$-norms and $t$-conorms. By utilizing these algebraic operations, we introduce some weighted aggregation operators to transform input values represented by C-PFVs to a single output value. Then to determine the degree of similarity between C-PFVs we define a cosine similarity measure based on radius. Furthermore, we develop a method to transform a collection of Pythagorean fuzzy values to a PFS. Finally, a method is given to solve multi-criteria decision making problems in circular Pythagorean fuzzy environment and the proposed method is practiced to a problem about selecting the best photovoltaic cell from the literature. We also study the comparison analysis and time complexity of the proposed method.

In this paper we observe a set, possibly a continuum, of signals corrupted by noise. Each signal is a finite mixture of an unknown number of features belonging to a continuous dictionary. The continuous dictionary is parametrized by a real non-linear parameter. We shall assume that the signals share an underlying structure by saying that the union of active features in the whole dataset is finite. We formulate regularized optimization problems to estimate simultaneously the linear coefficients in the mixtures and the non-linear parameters of the features. The optimization problems are composed of a data fidelity term and a (l1 , Lp)-penalty. We prove high probability bounds on the prediction errors associated to our estimators. The proof is based on the existence of certificate functions. Following recent works on the geometry of off-the-grid methods, we show that such functions can be constructed provided the parameters of the active features are pairwise separated by a constant with respect to a Riemannian metric. When the number of signals is finite and the noise is assumed Gaussian, we give refinements of our results for p = 1 and p = 2 using tail bounds on suprema of Gaussian and $\chi$2 random processes. When p = 2, our prediction error reaches the rates obtained by the Group-Lasso estimator in the multi-task linear regression model.

A fault diagnosis method for power electronics converters based on deep feedforward network and wavelet compression is proposed in this paper. The transient historical data after wavelet compression are used to realize the training of fault diagnosis classifier. Firstly, the correlation analysis of the voltage or current data running in various fault states is performed to remove the redundant features and the sampling point. Secondly, the wavelet transform is used to remove the redundant data of the features, and then the training sample data is greatly compressed. The deep feedforward network is trained by the low frequency component of the features, while the training speed is greatly accelerated. The average accuracy of fault diagnosis classifier can reach over 97%. Finally, the fault diagnosis classifier is tested, and final diagnosis result is determined by multiple-groups transient data, by which the reliability of diagnosis results is improved. The experimental result proves that the classifier has strong generalization ability and can accurately locate the open-circuit faults in IGBTs.

Neural models and policies are now ubiquitous in modern robotics. The prevailing approach to training these follows a two stage process - a large, comprehensive collection of data (often state and action pairs) is used to train a suitable model or policy, which is then frozen and deployed. Unfortunately, this results in models that are unable to adapt to changes in the environment, which is a particular concern in robotics. For example, it would be preferable for a robot dynamics model to handle context dependent kinematic or dynamic properties, or a collaborative robot relying on predictions of human behaviour to adapt to different human abilities or preferences. Many existing adaptive control techniques [1] attempting to tackle this problem rely on carefully considered parametric models, but these may lack the requisite capacity for prediction that is typically associated with neural models. In contrast, meta-learning and adaptive neural control approaches addressing this problem are often quite cumbersome to train and implement. This paper introduces a simple and effective approach to achieve adaptation for neural network models.