Since we’re home, I’m working to bring more LIVE conversations to you from our living rooms. ???? Join me + adventure photographer / filmmaker Ben Moon at 12:30PM PST tomorrow. There will be a live chat, so please ask us some questions as well. See you there. You might know Ben from his adventure and lifestyle photography or his beautiful films. Surviving cancer in his 20s gradually shifted his artistic focus from capturing the pursuit of adventure to telling nuanced human stories that have inspired and impacted millions. Most notably, his personal story battling colorectal cancer and his special relationship with his dog Denali, which he shares in his beautiful viral short film, now turned book, Denali. ABOUT BEN Ben Moon is an adventure, lifestyle, and portrait photographer whose vibrant images have graced the pages of Patagonia catalogues for the past 18 years.  In recent years, he has shifted his focus to filmmaking. In 2015, he founded his production company, Moonhouse as a platform for collaboration with friends and creatives to bring a wide range of thought-provoking, impactful and cinematically beautiful stories to life on-screen. As a director, Ben’s unique ability to connect with his subjects paired with the talent […]

The post Ben Moon: Surf, Survival, and Life on the Road appeared first on Chase Jarvis Photography.

Did you remember how was your life before Freepik and Flaticon. No I can’t remember the dark ages either. To celebrate this golden times, they are giving away once more an incredible package of 210 User Interface Icons in 3 versions: Flat, filled and lineal.  Download This work is licensed under a Creative Commons Attribution 3.0 License …

Cute Collection of 210 User Interface Icons Read More »

It has been a month since we launched our first online workshop and, to be honest, we really didn’t know whether people would enjoy them — or if we would enjoy running them. It was an experiment, but one we are so glad we jumped into! I spoke about the experience of taking my workshop online on a recent episode of the Smashing podcast. As a speaker, I had expected it to feel very much like I was presenting into the empty air, with no immediate feedback and expressions to work from.

We review some recent results on the phenomenon of surface superconductivity in the framework of Ginzburg-Landau theory for extreme type-II materials. In particular, we focus on the response of the superconductor to a strong longitudinal magnetic field in the regime where superconductivity survives only along the boundary of the wire. We derive the energy and density asymptotics for samples with smooth cross section, up to curvature-dependent terms. Furthermore, we discuss the corrections in presence of corners at the boundary of the sample.

This paper is devoted to the study of the singularity phenomenon of timelike extremal hypersurfaces in Minkowski spacetime $mathbb{R}^{1+3}$. We find that there are two explicit lightlike self-similar solutions to a graph representation of timelike extremal hypersurfaces in Minkowski spacetime $mathbb{R}^{1+3}$, the geometry of them are two spheres. The linear mode unstable of those lightlike self-similar solutions for the radially symmetric membranes equation is given. After that, we show those self-similar solutions of the radially symmetric membranes equation are nonlinearly stable inside a strictly proper subset of the backward lightcone. This means that the dynamical behavior of those two spheres is as attractors. Meanwhile, we overcome the double roots case (the theorem of Poincar'{e} can't be used) in solving the difference equation by construction of a Newton's polygon when we carry out the analysis of spectrum for the linear operator.

Let $f colon X o X$ be a surjective endomorphism of a normal projective surface. When $operatorname{deg} f geq 2$, applying an (iteration of) $f$-equivariant minimal model program (EMMP), we determine the geometric structure of $X$. Using this, we extend the second author's result to singular surfaces to the extent that either $X$ has an $f$-invariant non-constant rational function, or $f$ has infinitely many Zariski-dense forward orbits; this result is also extended to Adelic topology (which is finer than Zariski topology).

In cite{S 2017}, Suh gave a non-existence theorem for Hopf real hypersurfaces in the complex quadric with parallel normal Jacobi operator. Motivated by this result, in this paper, we introduce some generalized conditions named $mathcal C$-parallel or Reeb parallel normal Jacobi operators. By using such weaker parallelisms of normal Jacobi operator, first we can assert a non-existence theorem of Hopf real hypersurfaces with $mathcal C$-parallel normal Jacobi operator in the complex quadric $Q^{m}$, $m geq 3$. Next, we prove that a Hopf real hypersurface has Reeb parallel normal Jacobi operator if and only if it has an $mathfrak A$-isotropic singular normal vector field.

We define local indices for projective umbilics and godrons (also called cusps of Gauss) on generic smooth surfaces in projective 3-space. By means of these indices, we provide formulas that relate the algebraic numbers of those characteristic points on a surface (and on domains of the surface) with the Euler characteristic of that surface (resp. of those domains). These relations determine the possible coexistences of projective umbilics and godrons on the surface. Our study is based on a "fundamental cubic form" for which we provide a closed simple expression.

Given spherically symmetric characteristic initial data for the Einstein-scalar field system with a positive cosmological constant, we provide a criterion, in terms of the dimensionless size and dimensionless renormalized mass content of an annular region of the data, for the formation of a future trapped surface. This corresponds to an extension of Christodoulou's classical criterion by the inclusion of the cosmological term.

The main goal of this paper is to achieve a parametrization of the solution set of the truncated matricial Hausdorff moment problem in the non-degenerate and degenerate situation. We treat the even and the odd cases simultaneously. Our approach is based on Schur analysis methods. More precisely, we use two interrelated versions of Schur-type algorithms, namely an algebraic one and a function-theoretic one. The algebraic version, worked out in our former paper arXiv:1908.05115, is an algorithm which is applied to finite or infinite sequences of complex matrices. The construction and discussion of the function-theoretic version is a central theme of this paper. This leads us to a complete description via Stieltjes transform of the solution set of the moment problem under consideration. Furthermore, we discuss special solutions in detail.

In this paper, we give a criterion of the Gorenstein property of the Ehrhart ring of the stable set polytope of an h-perfect graph: the Ehrhart ring of the stable set polytope of an h-perfect graph $G$ is Gorenstein if and only if (1) sizes of maximal cliques are constant (say $n$) and (2) (a) $n=1$, (b) $n=2$ and there is no odd cycle without chord and length at least 7 or (c) $ngeq 3$ and there is no odd cycle without chord and length at least 5.

We study a two-stage reneging queue with Poisson arrivals, exponential services, and two levels of exponential reneging behaviors, extending the popular Erlang A model that assumes a constant reneging rate. We derive approximate analytical formulas representing performance measures for the two-stage queue following the Markov chain decomposition approach. Our formulas not only give accurate results spanning the heavy-traffic to the light-traffic regimes, but also provide insight into capacity decisions.

High-performance implementations of graph algorithms are challenging to implement on new parallel hardware such as GPUs, because of three challenges: (1) difficulty of coming up with graph building blocks, (2) load imbalance on parallel hardware, and (3) graph problems having low arithmetic intensity. To address these challenges, GraphBLAS is an innovative, on-going effort by the graph analytics community to propose building blocks based in sparse linear algebra, which will allow graph algorithms to be expressed in a performant, succinct, composable and portable manner. In this paper, we examine the performance challenges of a linear algebra-based approach to building graph frameworks and describe new design principles for overcoming these bottlenecks. Among the new design principles is exploiting input sparsity, which allows users to write graph algorithms without specifying push and pull direction. Exploiting output sparsity allows users to tell the backend which values of the output in a single vectorized computation they do not want computed. Load-balancing is an important feature for balancing work amongst parallel workers. We describe the important load-balancing features for handling graphs with different characteristics. The design principles described in this paper have been implemented in "GraphBLAST", the first open-source linear algebra-based graph framework on GPU targeting high-performance computing. The results show that on a single GPU, GraphBLAST has on average at least an order of magnitude speedup over previous GraphBLAS implementations SuiteSparse and GBTL, comparable performance to the fastest GPU hardwired primitives and shared-memory graph frameworks Ligra and Gunrock, and better performance than any other GPU graph framework, while offering a simpler and more concise programming model.

Event-related potential (ERP) speller can be utilized in device control and communication for locked-in or severely injured patients. However, problems such as inter-subject performance instability and ERP-illiteracy are still unresolved. Therefore, it is necessary to predict classification performance before performing an ERP speller in order to use it efficiently. In this study, we investigated the correlations with ERP speller performance using a resting-state before an ERP speller. In specific, we used spectral power and functional connectivity according to four brain regions and five frequency bands. As a result, the delta power in the frontal region and functional connectivity in the delta, alpha, gamma bands are significantly correlated with the ERP speller performance. Also, we predicted the ERP speller performance using EEG features in the resting-state. These findings may contribute to investigating the ERP-illiteracy and considering the appropriate alternatives for each user.

The connection between visual input and tactile sensing is critical for object manipulation tasks such as grasping and pushing. In this work, we introduce the challenging task of estimating a set of tactile physical properties from visual information. We aim to build a model that learns the complex mapping between visual information and tactile physical properties. We construct a first of its kind image-tactile dataset with over 400 multiview image sequences and the corresponding tactile properties. A total of fifteen tactile physical properties across categories including friction, compliance, adhesion, texture, and thermal conductance are measured and then estimated by our models. We develop a cross-modal framework comprised of an adversarial objective and a novel visuo-tactile joint classification loss. Additionally, we develop a neural architecture search framework capable of selecting optimal combinations of viewing angles for estimating a given physical property.

A brain-computer interface (BCI) enables a user to communicate with a computer directly using brain signals. Electroencephalograms (EEGs) used in BCIs are weak, easily contaminated by interference and noise, non-stationary for the same subject, and varying across different subjects and sessions. Therefore, it is difficult to build a generic pattern recognition model in an EEG-based BCI system that is optimal for different subjects, during different sessions, for different devices and tasks. Usually, a calibration session is needed to collect some training data for a new subject, which is time consuming and user unfriendly. Transfer learning (TL), which utilizes data or knowledge from similar or relevant subjects/sessions/devices/tasks to facilitate learning for a new subject/session/device/task, is frequently used to reduce the amount of calibration effort. This paper reviews journal publications on TL approaches in EEG-based BCIs in the last few years, i.e., since 2016. Six paradigms and applications -- motor imagery, event-related potentials, steady-state visual evoked potentials, affective BCIs, regression problems, and adversarial attacks -- are considered. For each paradigm/application, we group the TL approaches into cross-subject/session, cross-device, and cross-task settings and review them separately. Observations and conclusions are made at the end of the paper, which may point to future research directions.

Given a fixed graph $H$ that embeds in a surface $Sigma$, what is the maximum number of copies of $H$ in an $n$-vertex graph $G$ that embeds in $Sigma$? We show that the answer is $Theta(n^{f(H)})$, where $f(H)$ is a graph invariant called the `flap-number' of $H$, which is independent of $Sigma$. This simultaneously answers two open problems posed by Eppstein (1993). When $H$ is a complete graph we give more precise answers.

In-band full-duplex systems can transmit and receive information simultaneously on the same frequency band. However, due to the strong self-interference caused by the transmitter to its own receiver, the use of non-linear digital self-interference cancellation is essential. In this work, we describe a hardware architecture for a neural network-based non-linear self-interference (SI) canceller and we compare it with our own hardware implementation of a conventional polynomial based SI canceller. In particular, we present implementation results for a shallow and a deep neural network SI canceller as well as for a polynomial SI canceller. Our results show that the deep neural network canceller achieves a hardware efficiency of up to $312.8$ Msamples/s/mm$^2$ and an energy efficiency of up to $0.9$ nJ/sample, which is $2.1 imes$ and $2 imes$ better than the polynomial SI canceller, respectively. These results show that NN-based methods applied to communications are not only useful from a performance perspective, but can also be a very effective means to reduce the implementation complexity.

A classical problem in appointment scheduling, with applications in health care, concerns the determination of the patients' arrival times that minimize a cost function that is a weighted sum of mean waiting times and mean idle times. One aspect of this problem is the sequencing problem, which focuses on ordering the patients. We assess the performance of the smallest-variance-first (SVF) rule, which sequences patients in order of increasing variance of their service durations. While it was known that SVF is not always optimal, it has been widely observed that it performs well in practice and simulation. We provide a theoretical justification for this observation by proving, in various settings, quantitative worst-case bounds on the ratio between the cost incurred by the SVF rule and the minimum attainable cost. We also show that, in great generality, SVF is asymptotically optimal, i.e., the ratio approaches 1 as the number of patients grows large. While evaluating policies by considering an approximation ratio is a standard approach in many algorithmic settings, our results appear to be the first of this type in the appointment scheduling literature.

In this paper, we propose a new nonlinear detector with improved interference suppression in Multi-User Multiple Input, Multiple Output (MU-MIMO) system. The proposed detector is a combination of the following parts: QR decomposition (QRD), low complexity users sorting before QRD, sorting-reduced (SR) K-best method and minimum mean square error (MMSE) pre-processing. Our method outperforms a linear interference rejection combining (IRC, i.e. MMSE naturally) method significantly in both strong interference and additive white noise scenarios with both ideal and real channel estimations. This result has wide application importance for scenarios with strong interference, i.e. when co-located users utilize the internet in stadium, highway, shopping center, etc. Simulation results are presented for the non-line of sight 3D-UMa model of 5G QuaDRiGa 2.0 channel for 16 highly correlated single-antenna users with QAM16 modulation in 64 antennas of Massive MIMO system. The performance was compared with MMSE and other detection approaches.

We utilize recent results on the exact block error probability of Gaussian random codes in additive white Gaussian noise to analyze Gaussian random coding for massive multiple-access at finite message length. Soft iterative interference cancellation is found to closely approach the performance bounds recently found in [1]. The existence of two fundamentally different regimes in the trade-off between power and bandwidth efficiency reported in [2] is related to much older results in [3] on power optimization by linear programming. Furthermore, we tighten the achievability bounds of [1] in the low power regime and show that orthogonal constellations are very close to the theoretical limits for message lengths around 100 and above.

We study the problem of jointly designing a sparse sensor and actuator schedule for linear dynamical systems while guaranteeing a control/estimation performance that approximates the fully sensed/actuated setting. We further prove a separation principle, showing that the problem can be decomposed into finding sensor and actuator schedules separately. However, it is shown that this problem cannot be efficiently solved or approximated in polynomial, or even quasi-polynomial time for time-invariant sensor/actuator schedules; instead, we develop deterministic polynomial-time algorithms for a time-varying sensor/actuator schedule with guaranteed approximation bounds. Our main result is to provide a polynomial-time joint actuator and sensor schedule that on average selects only a constant number of sensors and actuators at each time step, irrespective of the dimension of the system. The key idea is to sparsify the controllability and observability Gramians while providing approximation guarantees for Hankel singular values. This idea is inspired by recent results in theoretical computer science literature on sparsification.

Narrowband internet-of-things (NB-IoT) is a competitive 5G technology for massive machine-type communication scenarios, but meanwhile introduces narrowband interference (NBI) to existing broadband transmission such as the long term evolution (LTE) systems in enhanced mobile broadband (eMBB) scenarios. In order to facilitate the harmonic and fair coexistence in wireless heterogeneous networks, it is important to eliminate NB-IoT interference to LTE systems. In this paper, a novel sparse machine learning based framework and a sparse combinatorial optimization problem is formulated for accurate NBI recovery, which can be efficiently solved using the proposed iterative sparse learning algorithm called sparse cross-entropy minimization (SCEM). To further improve the recovery accuracy and convergence rate, regularization is introduced to the loss function in the enhanced algorithm called regularized SCEM. Moreover, exploiting the spatial correlation of NBI, the framework is extended to multiple-input multiple-output systems. Simulation results demonstrate that the proposed methods are effective in eliminating NB-IoT interference to LTE systems, and significantly outperform the state-of-the-art methods.

Making changes to a program to optimize its performance is an unscalable task that relies entirely upon human intuition and experience. In addition, companies operating at large scale are at a stage where no single individual understands the code controlling its systems, and for this reason, making changes to improve performance can become intractably difficult. In this paper, a learning system is introduced that provides AI assistance for finding recommended changes to a program. Specifically, it is shown how the evaluative feedback, delayed-reward performance programming domain can be effectively formulated via the Monte Carlo tree search (MCTS) framework. It is then shown that established methods from computational games for using learning to expedite tree-search computation can be adapted to speed up computing recommended program alterations. Estimates of expected utility from MCTS trees built for previous problems are used to learn a sampling policy that remains effective across new problems, thus demonstrating transferability of optimization knowledge. This formulation is applied to the Apache Spark distributed computing environment, and a preliminary result is observed that the time required to build a search tree for finding recommendations is reduced by up to a factor of 10x.

Homomorphic encryption (HE) allows direct computations on encrypted data. Despite numerous research efforts, the practicality of HE schemes remains to be demonstrated. In this regard, the enormous size of ciphertexts involved in HE computations degrades computational efficiency. Near-memory Processing (NMP) and Computing-in-memory (CiM) - paradigms where computation is done within the memory boundaries - represent architectural solutions for reducing latency and energy associated with data transfers in data-intensive applications such as HE. This paper introduces CiM-HE, a Computing-in-memory (CiM) architecture that can support operations for the B/FV scheme, a somewhat homomorphic encryption scheme for general computation. CiM-HE hardware consists of customized peripherals such as sense amplifiers, adders, bit-shifters, and sequencing circuits. The peripherals are based on CMOS technology, and could support computations with memory cells of different technologies. Circuit-level simulations are used to evaluate our CiM-HE framework assuming a 6T-SRAM memory. We compare our CiM-HE implementation against (i) two optimized CPU HE implementations, and (ii) an FPGA-based HE accelerator implementation. When compared to a CPU solution, CiM-HE obtains speedups between 4.6x and 9.1x, and energy savings between 266.4x and 532.8x for homomorphic multiplications (the most expensive HE operation). Also, a set of four end-to-end tasks, i.e., mean, variance, linear regression, and inference are up to 1.1x, 7.7x, 7.1x, and 7.5x faster (and 301.1x, 404.6x, 532.3x, and 532.8x more energy efficient). Compared to CPU-based HE in a previous work, CiM-HE obtain 14.3x speed-up and >2600x energy savings. Finally, our design offers 2.2x speed-up with 88.1x energy savings compared to a state-of-the-art FPGA-based accelerator.

See the Code - See it Full Page - See Details

Horizontal and Vertical scrolling with faded out content. **Please note:** I have not cross browser tested this, however this method leverages `background-attachment: local`, currently usable in everything except Android Browser & Opera Mini according to <a href="https://caniuse.com/#feat=background-attachment" target="_blank">caniuse.com</a>, meaning there is great support across devices and many Android devices use Google Chrome for Android rather than the OS browser. **Additional note:** There is a bug when previewing this pen on mobile, due to loading the example within an `iframe`. The shadow rgba values are read as a non transparent, this does not happen when previewing locally not in an iframe :-)

This Pen uses: HTML, SCSS, JavaScript, and

[IMAGE-1] I honestly don't know how people like Bryan Stevenson keep up the fight. Just Mercy is the true origin story of a literal social justice warrior, a Harvard-educated lawyer who, in the late 1980s, launched the Equal Justice Initiative in Montgomery, Alabama, to take on the neediest, most desperate cases.…

Ask any working musician why they play live, why they lug their equipment to and from bars and restaurants and wine-tasting rooms week after week, and they'll point to the same nebulous thing: It's the connection with an audience.…

While events around the country have been put on hold, Coeur d’Alene’s Summer Theatre is still slated for a show at the end of the month. But it won’t be in the usual format.…

While its main goal is to introduce the humble breakfast taco to more Spokane eaters, owners of the new quick food stop Taco Vado say breakfast burritos have actually been its bestselling menu item since opening about a month ago.…

The present invention provides a process for preparing a compound of formula (VI) or a salt thereof, the process comprising: (i) reacting 4-methoxyphenyl acetone with an amine of formula (VIII) under conditions of reductive amination to produce a compound of formula (II) or a salt thereof, wherein there is no isolation of an imine intermediate formed during the reductive amination; (ii) condensing the compound (II) or the acid addition salt thereof with an α-haloketone of formula (III) to produce the compound of formula (IV); (iii) reducing the compound (IV) to a compound of formula (V); and (iv) reducing the compound (V) to the compound of formula (VI), wherein the reduction is carried out in the presence of either (1) a hydrogen donating compound in the presence of a hydrogen transfer catalyst; or (2) ammonium formate using a hydrogenation catalyst, wherein R1 and R2 are independently optionally substituted arylalkyl, and Hal is selected from chloro or bromo.

Provided are an anti-static and anti-microbial surface treatment agent including a quaternary ammonium salt compound as an active ingredient and a method of preventing a polymer fiber from developing static electricity by using the surface treatment agent. The quaternary ammonium salt compound has excellent anti-static and anti-microbial effects for the prevention or improvement of static electricity in a polymer fiber. Accordingly, the quaternary ammonium salt compound is suitable for use as a fabric softener, or an anti-static agent, and also, provides anti-microbial effects to a polymer fiber.

A “Wearable Electromyography-Based Controller” includes a plurality of Electromyography (EMG) sensors and provides a wired or wireless human-computer interface (HCI) for interacting with computing systems and attached devices via electrical signals generated by specific movement of the user's muscles. Following initial automated self-calibration and positional localization processes, measurement and interpretation of muscle generated electrical signals is accomplished by sampling signals from the EMG sensors of the Wearable Electromyography-Based Controller. In operation, the Wearable Electromyography-Based Controller is donned by the user and placed into a coarsely approximate position on the surface of the user's skin. Automated cues or instructions are then provided to the user for fine-tuning placement of the Wearable Electromyography-Based Controller. Examples of Wearable Electromyography-Based Controllers include articles of manufacture, such as an armband, wristwatch, or article of clothing having a plurality of integrated EMG-based sensor nodes and associated electronics.

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.

A surfactant composition for agricultural chemicals, containing fatty acid polyoxyalkylene alkyl ether expressed by the following general formula (I), R1CO(EO)m(PO)nOR2 (I) wherein the fatty acid polyoxyalkylene alkyl ether has a narrow ratio of 55% by mass or more, where the narrow ratio is expressed by the following formula (A): Narrow ratio=Σi=nMAX−2i=nMAX+2Yi (A).

Novel surfactants and drying, drycleaning and soil repellency compositions containing such surfactants which utilize such surfactants. The surfactants are fluorine containing quaternary ammonium salts, and the drying, drycleaning and soil repellency compositions contain at least one halocarbon component and at least one of the fluorine containing surfactants. These compositions have the ability to remove water or aqueous films from the surfaces of a broad range of substrates and impart soil repellency to fabrics.

Provided is a surface treated calcium carbonate filler for resins, which comprises calcium carbonate particles, the surface of which has been treated with at least one surface active agent (A) selected from the group consisting of saturated fatty acids, unsaturated fatty acids, alicyclic carboxylic acids, resin acids, and salts thereof and with at least one compound (B) having the ability to chelate alkaline earth metals, the compound (B) being selected from the group consisting of phosphonic acids, polycarboxylic acids, and salts thereof. The surface treated calcium carbonate filler for resins of the present invention deteriorates little with time, has satisfactory dispersibility in resins, and can give a sheet or film which has a satisfactory balance among durability, weatherability, strength, and thermal stability, and is useful as a battery separator or a light reflector.

Disclosed herein are surface treatments for soft silicone gel materials such as silicone intraocular lenses.

A method, system and computer program product for intelligently responding to hardware failures so as to optimize system performance. An administrative server monitors the utilization of the hardware as well as the software components running on the hardware to assess a context of the software components running on the hardware. Upon detecting a hardware failure, the administrative server analyzes the hardware failure to determine the type of hardware failure and analyzes the properties of the workload running on the failed hardware. The administrative server then responds to the detected hardware failure based on various factors, including the type of the hardware failure, the properties of the workload running on the failed hardware and the context of the software running on the failed hardware. In this manner, by taking into consideration such factors in responding to the detected hardware failure, a more intelligent response is provided that optimizes system performance.

The invention in particular has as an object detecting incompatibility between equipment items of a on-board system. A logic interface associated with one equipment item comprises at least one input while a logic interface associated with another equipment item comprises at least one output. The input and the output are connected. After a minimal data definition level associated with the input and a data definition level associated with the output have been obtained (505), the said minimal data definition level associated with the input is compared (515) with the said data definition level associated with the output. Following this comparison, if the said minimal data definition level associated with the input is lower than the said data definition level associated with the output, an alarm indicating an incompatibility of these two equipment items is generated (545).

Memory devices adapted to repair single unprogrammable cells during a program operation, and to repair columns containing unprogrammable cells during a subsequent erase operation. Programming of such memory devices includes determining that a single cell is unprogrammable and repairing the single cell, and repairing a column containing the single cell responsive to a subsequent erase operation.

A double data rate memory physical interface having self checking loopback logic on-chip is disclosed. Disposed on the chip is a first linear feedback shift register, which is capable of generating a set of test data values that comprise at least two data bits. Also disposed on the chip is a second linear feedback shift register. The second linear feedback shift register is capable of generating a set of expected data values that match the test data values. Further, an internal loopback error check element is disposed on the chip. The internal loopback error check element is used to compare the set of expected data values with the set of test data values.

The present invention relates to a subsurface refuse collection system comprising an underground bunker (4), a refuse container (3), a deposit bin (1) and a cover (2) with automatic opening and closing which can be powered electrically using a solar system. The container (3) is collected by means of an automated crane (18) with automatic hitching to facilitate collection. The system is equipped with multiple devices to measure volume and weight of the refuse deposited in the deposit bin (1), for the purpose of system monitoring or improvements to the management of truck routes. It also includes a safety device to prevent accidental fails into the underground bunker during collection.

A method and apparatus for including in a processor instructions for performing logical-comparison and branch support operations on packed or unpacked data. In one embodiment, instruction decode logic decodes instructions for an execution unit to operate on packed data elements including logical comparisons. A register file including 128-bit packed data registers stores packed single-precision floating point (SPFP) and packed integer data elements. The logical comparisons may include comparison of SPFP data elements and comparison of integer data elements and setting at least one bit to indicate the results. Based on these comparisons, branch support actions are taken. Such branch support actions may include setting the at least one bit, which in turn may be utilized by a branching unit in response to a branch instruction. Alternatively, the branch support actions may include branching to an indicated target code location.

A method and apparatus for including in a processor instructions for performing logical-comparison and branch support operations on packed or unpacked data. In one embodiment, instruction decode logic decodes instructions for an execution unit to operate on packed data elements including logical comparisons. A register file including 128-bit packed data registers stores packed single-precision floating point (SPFP) and packed integer data elements. The logical comparisons may include comparison of SPFP data elements and comparison of integer data elements and setting at least one bit to indicate the results. Based on these comparisons, branch support actions are taken. Such branch support actions may include setting the at least one bit, which in turn may be utilized by a branching unit in response to a branch instruction. Alternatively, the branch support actions may include branching to an indicated target code location.

A system (200) and a method (100) of operating a computing device to perform memoization are disclosed. The method includes determining whether a result of a function is stored in a cache and, if so, retrieving the result from the cache and, if not, calculating the result and storing it in the cache. The method (100) includes transforming (104) by the computing device at least one selected from the input parameters and the output parameters of the function, the transforming being based on an analysis of the function and its input arguments to establish whether or not there is a possible relationship reflecting redundancy among the input parameters and output parameters of the function. The transforming may include at least one of: use of symmetry, scaling, linear shift, interchanging of variables, inversion, polynomial and/or trigonometric transformations, spectral or logical transformations, fuzzy transformations, and systematic arrangement of parameters.

A method and apparatus for including in a processor instructions for performing logical-comparison and branch support operations on packed or unpacked data. In one embodiment, instruction decode logic decodes instructions for an execution unit to operate on packed data elements including logical comparisons. A register file including 128-bit packed data registers stores packed single-precision floating point (SPFP) and packed integer data elements. The logical comparisons may include comparison of SPFP data elements and comparison of integer data elements and setting at least one bit to indicate the results. Based on these comparisons, branch support actions are taken. Such branch support actions may include setting the at least one bit, which in turn may be utilized by a branching unit in response to a branch instruction. Alternatively, the branch support actions may include branching to an indicated target code location.

The present invention aims to provide a surface modification method for a rubber vulcanizate or a thermoplastic elastomer, which can impart excellent sliding properties and excellent durability against repeated sliding motion and can allow the surface to maintain the sealing properties, without using expensive self-lubricating plastics. The present invention relates to a surface modification method for modifying a rubber vulcanizate or a thermoplastic elastomer as an object to be modified, the method including: step 1 of forming polymerization initiation points on the object to be modified; step 2 of radically polymerizing a monomer, starting from the polymerization initiation points, by irradiation with LED light at 300 nm to 400 nm to grow polymer chains on a surface of the object to be modified; and step 3 of esterifying, transesterifying or amidating side chains of the polymer chains.

In embodiments of driver interface functions to interface client function drivers, a set of serial communication protocol driver interfaces are exposed by a core driver stack, and the serial communication protocol driver interfaces include driver interface functions to interface with client function drivers that correspond to client devices configured for data communication in accordance with the serial communication protocol. A client function driver can check for the availability of a driver interface function before interfacing with the core driver stack via the serial communication protocol driver interfaces. A contract version identifier can also be received from the client function driver via an extension of the driver interface functions, where the contract version identifier indicates a set of operation rules by which the client function driver interfaces with the core driver stack.

A memory system includes a CPU that communicates commands and addresses to a main-memory module. The module includes a buffer circuit that relays commands and data between the CPU and the main memory. The memory module additionally includes an embedded processor that shares access to main memory in support of peripheral functionality, such as graphics processing, for improved overall system performance. The buffer circuit facilitates the communication of instructions and data between CPU and the peripheral processor in a manner that minimizes or eliminates the need to modify CPU, and consequently reduces practical barriers to the adoption of main-memory modules with integrated processing power.