A primary mission of the U.S. Department of Agriculture Forest Service is multiple resource management, and one of the emerging themes is forest restoration. The National Silviculture Workshop, a biennial event co-sponsored by the Forest Service, was held May 7-10, 2007, in Ketchikan, Alaska, with the theme of "Integrated Restoration of Forested Ecosystems to Achieve Multiresource Benefits." This proceedings presents a compilation of state-of-the-art silvicultural research and forestry management papers that demonstrates integrated restoration to yield multiple resource benefits. These papers highlight national perspectives on ecosystem services, forest restoration and climate change, and regional perspectives on forest restoration and silvicultural practices to achieve multiple resource benefits from researchers and forest practitioners working in a broad array of forest types in the United States.

Wood has become an important energy alternative in Alaska, particularly in rural areas where liquid fuel costs can be substantial. In some cases, wood fuel is readily available to communities, increasing the attractiveness of wood energy. Wood energy systems in rural Alaska can also lead to employment gains as well as benefits to local cash economies. Many Alaska villages are now considering wood as a fuel source for community heating, several have completed feasibility studies, and others are moving forward with design and construction activities. Cordwood is readily available in many regions of Alaska, although not always in commercial quantities. However, for many small-scale applications, efficient cordwood systems could be a viable energy option. In this paper, we provide a qualitative review of factors such as wood fuel availability, cordwood system size, wood fuel cost, wood quality, labor, fuel drying, and underground piping. Other general observations are noted, based on case studies of operating cordwood systems in Alaska.

This synthesis provides an ecological foundation for management of the diverse ecosystems and fire regimes of North America, based on scientific principles of fire interactions with vegetation, fuels, and biophysical processes. Although a large amount of scientific data on fire exists, most of those data have been collected at small spatial and temporal scales. Thus, it is challenging to develop consistent science-based plans for large spatial and temporal scales where most fire management and planning occur. Understanding the regional geographic context of fire regimes is critical for developing appropriate and sustainable management strategies and policy. The degree to which human intervention has modified fire frequency, intensity, and severity varies greatly among different ecosystems, and must be considered when planning to alter fuel loads or implement restorative treatments. Detailed discussion of six ecosystems--ponderosa pine forest (western North America), chaparral (California), boreal forest (Alaska and Canada), Great Basin sagebrush (intermountain West), pine and pine-hardwood forests (Southern Appalachian Mountains), and longleaf pine (Southeastern United States)--illustrates the complexity of fire regimes and that fire management requires a clear regional focus that recognizes where conflicts might exist between fire hazard reduction and resource needs. In some systems, such as ponderosa pine, treatments are usually compatible with both fuel reduction and resource needs, whereas in others, such as chaparral, the potential exists for conflicts that need to be closely evaluated. Managing fire regimes in a changing climate and social environment requires a strong scientific basis for developing fire management and policy.

The past decade has seen resurgence in interest in gathering wild plants and fungi in cities. In addition to gathering by individuals, dozens of groups have emerged in U.S., Canadian, and European cities to facilitate access to nontimber forest products (NTFPs), particularly fruits and nuts, in public and private spaces. Recent efforts within cities to encourage public orchards and food forests, and to incorporate more fruit and nut trees into street tree planting programs indicate a growing recognition among planners that gathering is an important urban activity.

Sustaining the health, diversity, and productivity of national forests and grasslands is the mission of the U.S. Department of Agriculture (USDA) Forest Service.

We reviewed the literature to synthesize what is known about the use of fire to maintain and restore oak forests, woodlands, and savannas of the upper Midwestern United States, with emphasis on Minnesota, Wisconsin, and Michigan.

This research models a wood pellet heating system at the Tlingit-Haida Regional Housing Authority in Juneau, Alaska, used to provide thermal energy to a 929-m2 warehouse, as an alternative to a heating system that burns more costly fossil fuels. Research objectives were to evaluate project economics of the pellet system and to conduct cost:benefit analysis on key variables (initial capital cost, fuel oil cost, and wood pellet cost). Economic results of interest included net present value, payback, internal rate of return, and cost:benefit ratio. Monte Carlo simulations were conducted using RETScreen software with the parameters of heating oil cost, wood pellet cost, fuel price escalation, and heating load. Cost:benefit analysis was conducted for capital cost versus wood fuel cost and also versus alternative fuel cost. This research found that economic performance was favorable over a wide range of normal operating conditions, even when paying a relatively high price for wood fuel. A pellet production facility in southeast Alaska could lead to lower wood fuel costs and even more favorable regional economics.

During September 19-20, 2006, a conference was held at the University of Washington Botanic Gardens, Seattle, WA, with the title "Meeting the challenge: invasive plants in Pacific Northwest Ecosystems." The mission of the conference was to create strategies and partnerships to understand and manage invasions of non-native plants in the Pacific Northwest. The audience included over 180 professionals, students, and citizens from public and private organizations responsible for monitoring, studying, or managing non-native invasive plants. This proceedings includes twenty-seven papers based on oral presentations at the conference plus a synthesis paper that summarizes workshop themes, discussions, and related information. Topics include early detection and rapid response; control techniques, biology, and impacts; management approaches; distribution and mapping of invasive plants; and partnerships, education, and outreach.

Statement Highlights: To translate advances in scientific knowledge and innovations in stroke care into improvements in patient outcomes, comprehensive stroke systems of care must be in place to facilitate optimal stroke care delivery. New recommendations support policies that standardize the delivery of stroke care, lower barriers to emergency care for stroke, ensure stroke patients receive care at appropriate hospitals in a timely manner and improve access to secondary prevention and rehabilitation and recovery resources after stroke.

Traumatic brain injury (TBI) is a leading cause of death and disability. Older adults are more likely than younger individuals to sustain TBIs and less likely to survive them. TBI has been called the “silent epidemic,” and older adults are the “silent population” within this epidemic. This study evaluates whether indicators of preinjury health and functioning are associated with risk of incident traumatic brain injury (TBI) with loss of consciousness (LOC) and to evaluate health‐related factors associated with mortality in individuals with incident TBI.

I've never thought of myself as a "car person". The last new car I bought (and in fact, now that I think about it, the first new car I ever bought) was the quirky 1998 Ford Contour SVT. Since then we bought a VW station wagon in 2011

We’re delighted to launch the first ever website for this local irrigation company that has been around since 1989! Automated...continue reading

By Jon Queally Common Dreams “This is the stuff that worries me most. We don’t know what we’re doing, not trying to stop it, [and] with big consequences we don’t really understand.” The first global scientific review of its kind … Continue reading →

By Jon Queally Common Dreams “This is the stuff that worries me most. We don’t know what we’re doing, not trying to stop it, [and] with big consequences we don’t really understand.” The first global scientific review of its kind … Continue reading →

We consider a nonlinear Dirichlet problem driven by a nonhomogeneous differential operator plus an indefinite potential. In the reaction we have the competing effects of a singular term and of concave and convex nonlinearities. In this paper the concave term is parametric. We prove a bifurcation-type theorem describing the changes in the set of positive solutions as the positive parameter $lambda$ varies. This work continues our research published in arXiv:2004.12583, where $xi equiv 0 $ and in the reaction the parametric term is the singular one.

A topological dynamical system $(X,f)$ induces two natural systems, one is on the probability measure spaces and other one is on the hyperspace.

We introduce a concept for these two spaces, which is called entropy order, and prove that it coincides with topological entropy of $(X,f)$. We also consider the entropy order of an invariant measure and a variational principle is established.

In this paper we collect some open set-theoretic problems that appear in the large-scale topology (called also Asymptology). In particular we ask problems about critical cardinalities of some special (large, indiscrete, inseparated) coarse structures on $omega$, about the interplay between properties of a coarse space and its Higson corona, about some special ultrafilters ($T$-points and cellular $T$-points) related to finitary coarse structures on $omega$, about partitions of coarse spaces into thin pieces, and also about coarse groups having some extremal properties.

Willems et al.'s fundamental lemma asserts that all trajectories of a linear system can be obtained from a single given one, assuming that a persistency of excitation condition holds. This result has profound implications for system identification and data-driven control, and has seen a revival over the last few years. The purpose of this paper is to extend Willems' lemma to the situation where multiple (possibly short) system trajectories are given instead of a single long one. To this end, we introduce a notion of collective persistency of excitation. We will then show that all trajectories of a linear system can be obtained from a given finite number of trajectories, as long as these are collectively persistently exciting. We will demonstrate that this result enables the identification of linear systems from data sets with missing data samples. Additionally, we show that the result is of practical significance in data-driven control of unstable systems.

Inserting renewable energy in the electric grid in a decentralized manneris a key challenge of the energy transition. However, at local scale, both production and demand display erratic behavior, which makes it delicate to match them. It is the goal of Energy Management Systems (EMS) to achieve such balance at least cost. We present EMSx, a numerical benchmark for testing control algorithms for the management of electric microgrids equipped with a photovoltaic unit and an energy storage system. EMSx is made of three key components: the EMSx dataset, provided by Schneider Electric, contains a diverse pool of realistic microgrids with a rich collection of historical observations and forecasts; the EMSx mathematical framework is an explicit description of the assessment of electric microgrid control techniques and algorithms; the EMSx software EMSx.jl is a package, implemented in the Julia language, which enables to easily implement a microgrid controller and to test it. All components of the benchmark are publicly available, so that other researchers willing to test controllers on EMSx may reproduce experiments easily. Eventually, we showcase the results of standard microgrid control methods, including Model Predictive Control, Open Loop Feedback Control and Stochastic Dynamic Programming.

This work has been motivated by recent papers that quantify the density of values of generic quadratic forms and other polynomials at integer points, in particular ones that use Rogers' second moment estimates. In this paper we establish such results in a very general framework. Namely, given any subhomogeneous function (a notion to be defined) $f: mathbb{R}^n o mathbb{R}$, we derive a necessary and sufficient condition on the approximating function $psi$ for guaranteeing that a generic element $fcirc g$ in the $G$-orbit of $f$ is $psi$-approximable; that is, $|fcirc g(mathbf{v})| le psi(|mathbf{v}|)$ for infinitely many $mathbf{v} in mathbb{Z}^n$. We also deduce a sufficient condition in the case of uniform approximation. Here, $G$ can be any closed subgroup of $operatorname{ASL}_n(mathbb{R})$ satisfying certain axioms that allow for the use of Rogers-type estimates.

We introduce primal and dual stochastic gradient oracle methods for decentralized convex optimization problems. Both for primal and dual oracles the proposed methods are optimal in terms of the number of communication steps. However, for all classes of the objective, the optimality in terms of the number of oracle calls per node in the class of methods with optimal number of communication steps takes place only up to a logarithmic factor and the notion of smoothness. By using mini-batching technique we show that all proposed methods with stochastic oracle can be additionally parallelized at each node.

Let $w$ be a word in $k$ variables. For a finite nilpotent group $G$, a conjecture of Amit states that $N_w(1) ge |G|^{k-1}$, where $N_w(1)$ is the number of $k$-tuples $(g_1,...,g_k)in G^{(k)}$ such that $w(g_1,...,g_k)=1$. Currently, this conjecture is known to be true for groups of nilpotency class 2. Here we consider a generalized version of Amit's conjecture, and prove that $N_w(g) ge |G|^{k-2}$, where $g$ is a $w$-value in $G$, for finite groups $G$ of odd order and nilpotency class 2. If $w$ is a word in two variables, we further show that $N_w(g) ge |G|$, where $g$ is a $w$-value in $G$ for finite groups $G$ of nilpotency class 2. In addition, for $p$ a prime, we show that finite $p$-groups $G$, with two distinct irreducible complex character degrees, satisfy the generalized Amit conjecture for words $w_k =[x_1,y_1]...[x_k,y_k]$ with $k$ a natural number; that is, for $g$ a $w_k$-value in $G$ we have $N_{w_k}(g) ge |G|^{2k-1}$.

Finally, we discuss the related group properties of being rational and chiral, and show that every finite group of nilpotency class 2 is rational.

We consider the most general class of linear inhomogeneous boundary-value problems for systems of ordinary differential equations of an arbitrary order whose solutions and right-hand sides belong to appropriate Sobolev spaces. For parameter-dependent problems from this class, we prove a constructive criterion for their solutions to be continuous in the Sobolev space with respect to the parameter. We also prove a two-sided estimate for the degree of convergence of these solutions to the solution of the nonperturbed problem.

Let $H$ be a Krull monoid with finite class group $G$ such that every class contains a prime divisor. We consider the system $mathcal L (H)$ of all sets of lengths of $H$ and study when $mathcal L (H)$ contains or is contained in a system $mathcal L (H')$ of a Krull monoid $H'$ with finite class group $G'$, prime divisors in all classes and Davenport constant $mathsf D (G')=mathsf D (G)$. Among others, we show that if $G$ is either cyclic of order $m ge 7$ or an elementary $2$-group of rank $m-1 ge 6$, and $G'$ is any group which is non-isomorphic to $G$ but with Davenport constant $mathsf D (G')=mathsf D (G)$, then the systems $mathcal L (H)$ and $mathcal L (H')$ are incomparable.

Our goal in this article is to study the global Lorentz estimates for gradient of weak solutions to $p$-Laplace double obstacle problems involving the Schr"odinger term: $-Delta_p u + mathbb{V}|u|^{p-2}u$ with bound constraints $psi_1 le u le psi_2$ in non-smooth domains. This problem has its own interest in mathematics, engineering, physics and other branches of science. Our approach makes a novel connection between the study of Calder'on-Zygmund theory for nonlinear Schr"odinger type equations and variational inequalities for double obstacle problems.

In this work we study the dynamical behavior Tonelli Lagrangian systems defined on the tangent bundle of the torus $mathbb{T}^2=mathbb{R}^2 / mathbb{Z}^2$. We prove that the Lagrangian flow restricted to a high energy level $ E_L^{-1}(c)$ (i.e $ c> c_0(L)$) has positive topological entropy if the flow satisfies the Kupka-Smale propriety in $ E_L^{-1}(c)$ (i.e, all closed orbit with energy $c$ are hyperbolic or elliptic and all heteroclinic intersections are transverse on $E_L^{-1}(c)$). The proof requires the use of well-known results in Aubry-Mather's Theory.

ErdH{o}s and Hajnal constructed a 4-coloring of the triples of an $N$-element set such that every $n$-element subset contains 2 triples with distinct colors, and $N$ is double exponential in $n$. Conlon, Fox and R"odl asked whether there is some integer $qge 3$ and a $q$-coloring of the triples of an $N$-element set such that every $n$-element subset has 3 triples with distinct colors, and $N$ is double exponential in $n$. We make the first nontrivial progress on this problem by providing a $q$-coloring with this property for all $qgeq 9$, where $N$ is exponential in $n^{2+cq}$ and $c>0$ is an absolute constant.

We present the correspondence between Lax integrable systems with spectral parameter on a Riemann surface, and Conformal Field Theories, in quite general set-up suggested earlier by the author. This correspondence turns out to give a prequantization of the integrable systems in question.

There are $n ge 2$ stacks, each filled with $d$ items, and one empty stack. Every stack has capacity $d > 0$. A robot arm, in one stack operation (step), may pop one item from the top of a non-empty stack and subsequently push it onto a stack not at capacity. In a {em labeled} problem, all $nd$ items are distinguishable and are initially randomly scattered in the $n$ stacks. The items must be rearranged using pop-and-pushs so that in the end, the $k^{ m th}$ stack holds items $(k-1)d +1, ldots, kd$, in that order, from the top to the bottom for all $1 le k le n$. In an {em unlabeled} problem, the $nd$ items are of $n$ types of $d$ each. The goal is to rearrange items so that items of type $k$ are located in the $k^{ m th}$ stack for all $1 le k le n$. In carrying out the rearrangement, a natural question is to find the least number of required pop-and-pushes.

Our main contributions are: (1) an algorithm for restoring the order of $n^2$ items stored in an $n imes n$ table using only $2n$ column and row permutations, and its generalization, and (2) an algorithm with a guaranteed upper bound of $O(nd)$ steps for solving both versions of the stack rearrangement problem when $d le lceil cn ceil$ for arbitrary fixed positive number $c$. In terms of the required number of steps, the labeled and unlabeled version have lower bounds $Omega(nd + nd{frac{log d}{log n}})$ and $Omega(nd)$, respectively.

Several problems of artificial intelligence, such as predictive learning, formal concept analysis or inductive logic programming, can be viewed as a special case of half-space separation in abstract closure systems over finite ground sets. For the typical scenario that the closure system is given via a closure operator, we show that the half-space separation problem is NP-complete. As a first approach to overcome this negative result, we relax the problem to maximal closed set separation, give a greedy algorithm solving this problem with a linear number of closure operator calls, and show that this bound is sharp. For a second direction, we consider Kakutani closure systems and prove that they are algorithmically characterized by the greedy algorithm. As a first special case of the general problem setting, we consider Kakutani closure systems over graphs, generalize a fundamental characterization result based on the Pasch axiom to graph structured partitioning of finite sets, and give a sufficient condition for this kind of closures systems in terms of graph minors. For a second case, we then focus on closure systems over finite lattices, give an improved adaptation of the greedy algorithm for this special case, and present two applications concerning formal concept and subsumption lattices. We also report some experimental results to demonstrate the practical usefulness of our algorithm.

For future Internet of Things (IoT)-based Big Data applications (e.g., smart cities/transportation), wireless data collection from ubiquitous massive smart sensors with limited spectrum bandwidth is very challenging. On the other hand, to interpret the meaning behind the collected data, it is also challenging for edge fusion centers running computing tasks over large data sets with limited computation capacity. To tackle these challenges, by exploiting the superposition property of a multiple-access channel and the functional decomposition properties, the recently proposed technique, over-the-air computation (AirComp), enables an effective joint data collection and computation from concurrent sensor transmissions. In this paper, we focus on a single-antenna AirComp system consisting of $K$ sensors and one receiver (i.e., the fusion center). We consider an optimization problem to minimize the computation mean-squared error (MSE) of the $K$ sensors' signals at the receiver by optimizing the transmitting-receiving (Tx-Rx) policy, under the peak power constraint of each sensor. Although the problem is not convex, we derive the computation-optimal policy in closed form. Also, we comprehensively investigate the ergodic performance of AirComp systems in terms of the average computation MSE and the average power consumption under Rayleigh fading channels with different Tx-Rx policies. For the computation-optimal policy, we prove that its average computation MSE has a decay rate of $O(1/sqrt{K})$, and our numerical results illustrate that the policy also has a vanishing average power consumption with the increasing $K$, which jointly show the computation effectiveness and the energy efficiency of the policy with a large number of sensors.

Restless multi-armed bandits are a class of discrete-time stochastic control problems which involve sequential decision making with a finite set of actions (set of arms). This paper studies a class of constrained restless multi-armed bandits (CRMAB). The constraints are in the form of time varying set of actions (set of available arms). This variation can be either stochastic or semi-deterministic. Given a set of arms, a fixed number of them can be chosen to be played in each decision interval. The play of each arm yields a state dependent reward. The current states of arms are partially observable through binary feedback signals from arms that are played. The current availability of arms is fully observable. The objective is to maximize long term cumulative reward. The uncertainty about future availability of arms along with partial state information makes this objective challenging. Applications for CRMAB abound in the domain of cyber-physical systems. This optimization problem is analyzed using Whittle's index policy. To this end, a constrained restless single-armed bandit is studied. It is shown to admit a threshold-type optimal policy, and is also indexable. An algorithm to compute Whittle's index is presented. Further, upper bounds on the value function are derived in order to estimate the degree of sub-optimality of various solutions. The simulation study compares the performance of Whittle's index, modified Whittle's index and myopic policies.

We present a sound and complete method for the verification of qualitative liveness properties of replicated systems under stochastic scheduling. These are systems consisting of a finite-state program, executed by an unknown number of indistinguishable agents, where the next agent to make a move is determined by the result of a random experiment. We show that if a property of such a system holds, then there is always a witness in the shape of a Presburger stage graph: a finite graph whose nodes are Presburger-definable sets of configurations. Due to the high complexity of the verification problem (non-elementary), we introduce an incomplete procedure for the construction of Presburger stage graphs, and implement it on top of an SMT solver. The procedure makes extensive use of the theory of well-quasi-orders, and of the structural theory of Petri nets and vector addition systems. We apply our results to a set of benchmarks, in particular to a large collection of population protocols, a model of distributed computation extensively studied by the distributed computing community.

One of the main open problems in the qualitative theory of real planar differential systems is the study of limit cycles. In this article, we present an algorithmic approach for detecting how many limit cycles can bifurcate from the periodic orbits of a given polynomial differential center when it is perturbed inside a class of polynomial differential systems via the averaging method. We propose four symbolic algorithms to implement the averaging method. The first algorithm is based on the change of polar coordinates that allows one to transform a considered differential system to the normal form of averaging. The second algorithm is used to derive the solutions of certain differential systems associated to the unperturbed term of the normal of averaging. The third algorithm exploits the partial Bell polynomials and allows one to compute the integral formula of the averaged functions at any order. The last algorithm is based on the aforementioned algorithms and determines the exact expressions of the averaged functions for the considered differential systems. The implementation of our algorithms is discussed and evaluated using several examples. The experimental results have extended the existing relevant results for certain classes of differential systems.

We study the language universality problem for One-Counter Nets, also known as 1-dimensional Vector Addition Systems with States (1-VASS), parameterized either with an initial counter value, or with an upper bound on the allowed counter value during runs. The language accepted by an OCN (defined by reaching a final control state) is monotone in both parameters. This yields two natural questions: 1) Does there exist an initial counter value that makes the language universal? 2) Does there exist a sufficiently high ceiling so that the bounded language is universal? Despite the fact that unparameterized universality is Ackermann-complete and that these problems seem to reduce to checking basic structural properties of the underlying automaton, we show that in fact both problems are undecidable. We also look into the complexities of the problems for several decidable subclasses, namely for unambiguous, and deterministic systems, and for those over a single-letter alphabet.

Rescue vessels are the main actors in maritime safety and rescue operations. At the same time, aerial drones bring a significant advantage into this scenario. This paper presents the research directions of the AutoSOS project, where we work in the development of an autonomous multi-robot search and rescue assistance platform capable of sensor fusion and object detection in embedded devices using novel lightweight AI models. The platform is meant to perform reconnaissance missions for initial assessment of the environment using novel adaptive deep learning algorithms that efficiently use the available sensors and computational resources on drones and rescue vessel. When drones find potential objects, they will send their sensor data to the vessel to verity the findings with increased accuracy. The actual rescue and treatment operation are left as the responsibility of the rescue personnel. The drones will autonomously reconfigure their spatial distribution to enable multi-hop communication, when a direct connection between a drone transmitting information and the vessel is unavailable.

In this paper we analyze a continuous version of the maximal covering location problem, in which the facilities are required to be interconnected by means of a graph structure in which two facilities are allowed to be linked if a given distance is not exceed. We provide a mathematical programming framework for the problem and different resolution strategies. First, we propose a Mixed Integer Non Linear Programming formulation, and derive properties of the problem that allow us to project the continuous variables out avoiding the nonlinear constraints, resulting in an equivalent pure integer programming formulation. Since the number of constraints in the integer programming formulation is large and the constraints are, in general, difficult to handle, we propose two branch-&-cut approaches that avoid the complete enumeration of the constraints resulting in more efficient procedures. We report the results of an extensive battery of computational experiments comparing the performance of the different approaches.

We establish versions of Conley's (i) fundamental theorem and (ii) decomposition theorem for a broad class of hybrid dynamical systems. The hybrid version of (i) asserts that a globally-defined "hybrid complete Lyapunov function" exists for every hybrid system in this class. Motivated by mechanics and control settings where physical or engineered events cause abrupt changes in a system's governing dynamics, our results apply to a large class of Lagrangian hybrid systems (with impacts) studied extensively in the robotics literature. Viewed formally, these results generalize those of Conley and Franks for continuous-time and discrete-time dynamical systems, respectively, on metric spaces. However, we furnish specific examples illustrating how our statement of sufficient conditions represents merely an early step in the longer project of establishing what formal assumptions can and cannot endow hybrid systems models with the topologically well characterized partitions of limit behavior that make Conley's theory so valuable in those classical settings.

By using dissipativity approach, we establish the stability condition for the feedback connection of a deterministic dynamical system $Sigma$ and a stochastic memoryless map $Psi$. After that, we extend the result to the class of large scale systems in which: $Sigma$ consists of many sub-systems; and $Psi$ consists of many "stochastic actuators" and "probability controllers" that control the actuator's output events. We will demonstrate the proposed approach by showing the design procedures to globally stabilize the manufacturing systems while locally balance the stock levels in any production process.

By Evan H. DeLucia Courtesy of EOS Critics of biofuels like ethanol argue they are an unsustainable use of land. But with careful management, next-generation grass-based biofuels can net climate savings and improve their ecosystems. As the world seeks strategies … Continue reading →

The Cannabis Issue As we look ahead to sunnier days, few things are as satisfying as a scoop of nice, cold ice cream.…

Uncut Gems is one of those "his own worst enemy" capers. You know, the kind of movie where you sit there for two hours watching some doofus constantly trip over his own laces — usually figuratively, sometimes literally — on the way to a personal epiphany about how all his bad choices and lack of useful self-awareness have led him to whatever unpleasant place they lead him to.…

Extraction was supposedly the most-watched new movie on Netflix last week, and yet it feels suspiciously like one you've already seen, possibly late at night on some obscure cable channel back in the '90s.…

Biocidal compositions and their use in aqueous media, such as metalworking fluids, the compositions comprising a biocidal agent; and a non-biocidal primary amino alcohol compound of the formula (I); wherein R1, R2, R3, R4, and R5 are as defined herein.

A computer-implemented method for classifying documents for data loss prevention may include 1) identifying training documents for a machine learning classifier configured for data loss prevention, 2) performing a semantic analysis on training documents to identify topics within the set training documents, 3) applying a similarity metric to the topics to identify at least one unrelated topic with a similarity to the other topics within the plurality of topics, as determined by the similarity metric, that falls below a similarity threshold, 4) identifying, based on the semantic analysis, at least one irrelevant training document within the set of training documents in which a predominance of the unrelated topic is above a predominance threshold, and 5) excluding the irrelevant training document from the set of training documents based on the predominance of the unrelated topic within the irrelevant training document. Various other methods, systems, and computer-readable media are also disclosed.

Methods and arrangements for conducting a search using query logs. A query log is consulted and query rewrite rules are learned automatically based on data in the query log. The learning includes obtaining click-through data present in the query log.

Systems and methods are disclosed that may be implemented for network management system (NMS) configuration management support for network devices using a learning and natural language processing application to capture the usage and behavior of the Command Line Interface (CLI) of a network device with the aid of a CLI knowledge model, which in one example may be ontology-based.

Systems and methods for recommending media content items are provided. In some implementations, a method includes, identifying a first set of media items selected by a first plurality of users; causing a second set of media items to be displayed to a second user not included in the first plurality of users in accordance with the first set of media items. The first set of media items and the second set of media items are associated with a same media item category. In some implementations, the method optionally includes, identifying the second set of media items without regard to media content item selection history associated with the second user. In some implementations, the first and second sets of media items are news items.

In one embodiment, a system includes a data collection system configured to collect a data from a control system by using an offline mode of operations. The system further includes a configuration management system configured to manage a hardware configuration and a software configuration for the control system based on the data. The system additionally includes a rule engine configured to use the data as input and to output a health assessment by using a rule database, and a report generator configured to provide a health assessment for the control system.

A computer implemented method of constructing formal definitions in intelligent glossaries for interpreting text, comprising the steps of: providing at least one Distinction having a Boundary, an Indication, a Counter-indication and a Frame; modeling each Distinction as a diagram to provide a Distinction Model; verifying each distinction model as being an instantiation of a generic Distinction Pattern; providing at least one Arrangement made of nonintersecting Marks of Distinction containing Indications from the verified Distinction Model; writing at least one Formulation for each Indication appearing in verified Distinction model and Arrangement, providing well-founded Indications; calculating precise Formulations in Natural Language from well-founded Indications by substituting Variables symbols and/or replacing Constants symbols to transform imprecise Formulations into precise Formulations; selecting a Definition type and embedding at least one precise Formulation and Definition type as a formal Definition in an Intelligent Glossary to provide computerized Semantic Systems of Intelligent Glossaries.