SUN BROADCAST GROUP added 25 new affiliates to its roster in APRIL. The additions include: THE ROOSTER: S.I.P. BROADCASTING Top 40 WKLW (K-94.7)/PAINTSVILLE, KY EXPRESSVO: S.I.P. BROADCASTING … more

The website is the official source for facts about Sweden. It is publicly funded, with four organisations behind it: the Swedish Institute; the Swedish Government Offices, including the Ministry for Foreign Affairs and the Ministry of Enterprise, Energy and Communications; Business Sweden;...

Research Highlights: Mechanical clot removal alone may be as effective as combining it with intravenous (IV) clot-busting medications for stroke patients.    Mechanical clot removal alone reduced the risk of brain bleeding in this Japanese...

The business world has changed over the years and you’ll need to rely on digital methods of marketing your brand to succeed. One of the best ways to do that is through search engine optimization (SEO) to get better traffic for your business. When you use the right techniques and strategies, you can double your organic traffic.  If you’re in the business of helping people with their search engine optimization needs, here are some of the best ways to double your client’s organic traffic. Help Clients Work On Their Content You need to teach and advise your clients on how

The post Search Engine Optimization – How to Double Your Client’s Organic Traffic appeared first on Photoshop Lady.

WooCommerce 4.0 is here! Read all about the new, streamlined dashboard, time-saving store management tools, and enhanced reporting and analytics.

The post WooCommerce 4.0: Better, More Efficient Store Management appeared first on WooCommerce.

I am a longtime resident of Johnson County, currently in my 25th year of law enforcement. I worked for the Coralville Police Department in the late 1990’s and transferred to the Cedar Rapids Police Department in 1999 where I am a sergeant of the patrol division. I have degrees in criminal justice and organizational leadership and have advanced leadership training from Northwestern University in the School of Police Staff and Command.

Working in the second-largest city in the state has offered me many opportunities to lead. I have taught in the police academy and defensive tactics and as a field training instructor. I was the director of the Eastern Iowa Heroin Initiative, where I founded CRUSH of Iowa (Community Resources United to Stop Heroin). CRUSH is a community-based, grassroots organization helping all those affected by substance abuse disorder.

My passion has been community outreach. Currently I am a member of the Johnson County Human Trafficking Coalition and the Johnson County Prevention Partnership. Through these partnerships I will create a criminal interdiction team to fight the trafficking of humans, weapons and narcotics.

As sheriff, my top three concerns are substance abuse, mental health and human trafficking. I believe in creating long-lasting relationships with the community. I believe in common sense solutions without the haze of political bias. I believe that every citizen has a voice and should be heard. I believe in building a proactive and progressive law enforcement agency that serves with professionalism, compassion and dedication to the citizens. I believe we need to place the community back into community policing.

I am ready to be sheriff of Johnson County. I am a proven leader who is determined to build bridges with the citizens of the county and lead with accountability, trust and transparency. I will fight for all of Johnson County as sheriff because I have done so all of my life. This election is not just about me, it is about us. We, together, will make a positive impact on Johnson County. The status quo is not working. It’s time for change!

I would love to have your vote on June 2. We work better when we work together. People before politics!

Al Fear is a candidate in the Democratic primary for Johnson County sheriff. alfearforsheriff.com

Fin avril, 4,5 milliards de personnes étaient confinées à travers le globe à des degrés divers. Désertées depuis plusieurs semaines pour tenter d’enrayer la progression du coronavirus, les villes sont toutefois restées le terrain d’expression des street artistes, largement inspirés par cet épisode inédit de notre histoire. Sous les bombes colorées des graffeurs, les rues […]

GetLEI is an official and verified Registration Agent (RA) by Global Legal Entity Identifier Foundation (GLEIF). We provide a complete list of services related to LEI issuing, such as New registration, Renewal of expiring codes and transfer. Search and Lookup … Continued

The post Official LEI Registrar appeared first on WeLoveWP.

Patients with disabilities must receive the same level of lifesaving medical treatment from hospitals during the coronavirus pandemic as able-bodied patients, the Trump administration said.

It’s that time of year when Spoon Graphics gets a little older, with 2020 marking 13 years of tutorial creating, freebie sharing and article writing on what started as a blog that was attached to my portfolio website in 2007. Every April I take some time to reflect on the past 12 months and talk […]

The post Spoon Graphics Turns 13 Years Old — Traffic Down, Subscribers Up! appeared first on Spoon Graphics.

Access All Areas members have been requesting more Affinity Designer resources, so this week members can download this great set of Airbrush Shading Brushes made specifically for Affinity, courtesy of The Artifex Forge. Add organic texture shading to designs and illustrations with ease! This versatile shading brush pack contains a wide variety of textures – […]

The post Affinity Airbrush Shading Brushes for Premium Members appeared first on Spoon Graphics.

The team at StarTrek.com has released an official infographic video A Timeline Through the Star Trek Universe, Part 1 that includes all of the various TV and Movie series in their inter-connected places on the timeline.

WATCH: A Timeline Through the Star Trek Universe, Part I

The Star Trek saga has boldly traveled through space and time throughout its over fifty year history. Starfleet has visited the distant past, the far future, and even some alternate timelines. Need some context before you dive deep into Star Trek: Discovery and prepare for Star Trek: Picard? We've got you covered in Part One of our video timeline.

Here’s a snapshot of the complete timeline:

Interesting that they call this “Part 1”… Implying that there is much more to come.

From a DataViz design perspective, I’m not a fan of timelines that don’t keep a consistent scale. There’s a huge jump from the Big Bang 13.8 Billion years ago to the year 1900, then the scale is pretty even with 50-year jumps until the year 2150, and then the scale changes again, making the 50-year jumps are much farther apart.

It appears that this is an evolution of an original design project collaboration between Rachel Ivanoff and Jordan Twaddle that was on exhibit at the The Museum of Pop-Culture (MoPOP) in Seattle, Washington in 2016. The new video adds Star Trek: Discovery to the timeline, and video snippets from each of the shows.

Back in 2016, they shared this great animated GIF of the design evolution from the original timeline design process:

I hope they were involved in the development of the new timeline video as well.

By Jessica Corbett Common Dreams “The most robust study of the ice mass balance of Antarctica to date,” scientists say, “now puts Antarctica in the frame as one of the largest contributors to sea-level rise.” Scientists are expressing alarm over … Continue reading →

Although the performance of today's speech recognition systems is impressive, the experience for many is still one of errors, corrections, frustration and abandoning speech in favour of alternative interaction methods. We take a closer look at speech and find out why speech recognition is so difficult.

Do you want to add an Amazon affiliate store with WordPress? Amazon is the world’s largest online store that helps thousands of merchants to sell products online across the world. They have an official affiliate system that allows affiliate marketers like you to recommend Amazon products to your website’s audience and earn an affiliate commission. […]

The post How to Create an Amazon Affiliate Store (Step by Step) appeared first on IsItWP - Free WordPress Theme Detector.

A nearly two-minute, profanity-laced tirade at a code officer at a Miami Beach grocery store is the latest example of mounting tensions in the US over wearing masks to stem the spread of the coronavirus.

U.S. Rep. Ken Buck, who is also the chairman of the Colorado Republican Party, was captured ordering a local party official to report false election results in a primary race for a state Senate seat in a leaked audio recording released earlier this week.

We give a complete (and surprisingly simple) description of the affine Hecke category for $ ilde{A}_2$ in characteristic zero. More precisely, we calculate the Kazhdan-Lusztig polynomials, give a recursive formula for the projectors defining indecomposable objects and, for each coefficient of a Kazhdan-Lusztig polynomial, we produce a set of morphisms with such a cardinality.

The goal of this article is to investigate infinite dimensional affine diffusion processes on the canonical state space. This includes a derivation of the corresponding system of Riccati differential equations and an existence proof for such processes, which has been missing in the literature so far. For the existence proof, we will regard affine processes as solutions to infinite dimensional stochastic differential equations with values in Hilbert spaces. This requires a suitable version of the Yamada-Watanabe theorem, which we will provide in this paper. Several examples of infinite dimensional affine processes accompany our results.

We introduce an infinite-dimensional $p$-adic affine group and construct its irreducible unitary representation. Our approach follows the one used by Vershik, Gelfand and Graev for the diffeomorphism group, but with modifications made necessary by the fact that the group does not act on the phase space. However it is possible to define its action on some classes of functions.

In this paper we construct an equivariant embedding of the affine space $mathbb{A}^n$ with the translation group action into a complete non-projective algebraic variety $X$ for all $n geq 3$. The theory of toric varieties is used as the main tool for this construction. In the case of $n = 3$ we describe the orbit structure on the variety $X$.

Large transformer-based language models have been shown to be very effective in many classification tasks. However, their computational complexity prevents their use in applications requiring the classification of a large set of candidates. While previous works have investigated approaches to reduce model size, relatively little attention has been paid to techniques to improve batch throughput during inference. In this paper, we introduce the Cascade Transformer, a simple yet effective technique to adapt transformer-based models into a cascade of rankers. Each ranker is used to prune a subset of candidates in a batch, thus dramatically increasing throughput at inference time. Partial encodings from the transformer model are shared among rerankers, providing further speed-up. When compared to a state-of-the-art transformer model, our approach reduces computation by 37% with almost no impact on accuracy, as measured on two English Question Answering datasets.

This paper considers the multi-group multicast beamforming optimization problem, for which the optimal solution has been unknown due to the non-convex and NP-hard nature of the problem. By utilizing the successive convex approximation numerical method and Lagrangian duality, we obtain the optimal multicast beamforming solution structure for both the quality-of-service (QoS) problem and the max-min fair (MMF) problem. The optimal structure brings valuable insights into multicast beamforming: We show that the notion of uplink-downlink duality can be generalized to the multicast beamforming problem. The optimal multicast beamformer is a weighted MMSE filter based on a group-channel direction: a generalized version of the optimal downlink multi-user unicast beamformer. We also show that there is an inherent low-dimensional structure in the optimal multicast beamforming solution independent of the number of transmit antennas, leading to efficient numerical algorithm design, especially for systems with large antenna arrays. We propose efficient algorithms to compute the multicast beamformer based on the optimal beamforming structure. Through asymptotic analysis, we characterize the asymptotic behavior of the multicast beamformers as the number of antennas grows, and in turn, provide simple closed-form approximate multicast beamformers for both the QoS and MMF problems. This approximation offers practical multicast beamforming solutions with a near-optimal performance at very low computational complexity for large-scale antenna systems.

Traffic signs are essential map features globally in the era of autonomous driving and smart cities. To develop accurate and robust algorithms for traffic sign detection and classification, a large-scale and diverse benchmark dataset is required. In this paper, we introduce a traffic sign benchmark dataset of 100K street-level images around the world that encapsulates diverse scenes, wide coverage of geographical locations, and varying weather and lighting conditions and covers more than 300 manually annotated traffic sign classes. The dataset includes 52K images that are fully annotated and 48K images that are partially annotated. This is the largest and the most diverse traffic sign dataset consisting of images from all over world with fine-grained annotations of traffic sign classes. We have run extensive experiments to establish strong baselines for both the detection and the classification tasks. In addition, we have verified that the diversity of this dataset enables effective transfer learning for existing large-scale benchmark datasets on traffic sign detection and classification. The dataset is freely available for academic research: https://www.mapillary.com/dataset/trafficsign.

For $n$-vertex graphs with treewidth $k = O(n^{1/2-epsilon})$ and an arbitrary $epsilon>0$, we present a word-RAM algorithm to compute vertex separators using only $O(n)$ bits of working memory. As an application of our algorithm, we give an $O(1)$-approximation algorithm for tree decomposition. Our algorithm computes a tree decomposition in $c^k n (log log n) log^* n$ time using $O(n)$ bits for some constant $c > 0$.

We finally use the tree decomposition obtained by our algorithm to solve Vertex Cover, Independent Set, Dominating Set, MaxCut and $3$-Coloring by using $O(n)$ bits as long as the treewidth of the graph is smaller than $c' log n$ for some problem dependent constant $0 < c' < 1$.

We present a new system, EEV, for verifying binarized neural networks (BNNs). We formulate BNN verification as a Boolean satisfiability problem (SAT) with reified cardinality constraints of the form $y = (x_1 + cdots + x_n le b)$, where $x_i$ and $y$ are Boolean variables possibly with negation and $b$ is an integer constant. We also identify two properties, specifically balanced weight sparsity and lower cardinality bounds, that reduce the verification complexity of BNNs. EEV contains both a SAT solver enhanced to handle reified cardinality constraints natively and novel training strategies designed to reduce verification complexity by delivering networks with improved sparsity properties and cardinality bounds. We demonstrate the effectiveness of EEV by presenting the first exact verification results for $ell_{infty}$-bounded adversarial robustness of nontrivial convolutional BNNs on the MNIST and CIFAR10 datasets. Our results also show that, depending on the dataset and network architecture, our techniques verify BNNs between a factor of ten to ten thousand times faster than the best previous exact verification techniques for either binarized or real-valued networks.

Quantum dialogue is a process of two way secure and simultaneous communication using a single channel. Recently, a Measurement Device Independent Quantum Dialogue (MDI-QD) protocol has been proposed (Quantum Information Processing 16.12 (2017): 305). To make the protocol secure against information leakage, the authors have discarded almost half of the qubits remaining after the error estimation phase. In this paper, we propose two modified versions of the MDI-QD protocol such that the number of discarded qubits is reduced to almost one-fourth of the remaining qubits after the error estimation phase. We use almost half of their discarded qubits along with their used qubits to make our protocol more efficient in qubits count. We show that both of our protocols are secure under the same adversarial model given in MDI-QD protocol.

Wireless sensor networks have attracted much attention because of many applications in the fields of industry, military, medicine, agriculture, and education. In addition, the vast majority of researches has been done to expand its applications and improve its efficiency. However, there are still many challenges for increasing the efficiency in different parts of this network. One of the most important parts is to improve the network lifetime in the wireless sensor network. Since the sensor nodes are generally powered by batteries, the most important issue to consider in these types of networks is to reduce the power consumption of the nodes in such a way as to increase the network lifetime to an acceptable level. The contribution of this paper is using topology control, the threshold for the remaining energy in nodes, and two of the meta-algorithms include SA (Simulated annealing) and VNS (Variable Neighbourhood Search) to increase the energy remaining in the sensors. Moreover, using a low-cost spanning tree, an appropriate connectivity control among nodes is created in the network in order to increase the network lifetime. The results of simulations show that the proposed method improves the sensor lifetime and reduces the energy consumed.

XSS is a security vulnerability that permits injecting malicious code into the client side of a web application. In the simplest situations, XSS vulnerabilities arise when a web application includes the user input in the web output without due sanitization. Such simple XSS vulnerabilities can be detected fairly reliably with blackbox scanners, which inject malicious payload into sensitive parts of HTTP requests and look for the reflected values in the web output.

Contemporary blackbox scanners are not effective against stored XSS vulnerabilities, where the malicious payload in an HTTP response originates from the database storage of the web application, rather than from the associated HTTP request. Similarly, many blackbox scanners do not systematically handle context-sensitive XSS vulnerabilities, where the user input is included in the web output after a transformation that prevents the scanner from recognizing the original value, but does not sanitize the value sufficiently. Among the combination of two basic data sources (stored vs reflected) and two basic vulnerability patterns (context sensitive vs not so), only one is therefore tested systematically by state-of-the-art blackbox scanners.

Our work focuses on systematic coverage of the three remaining combinations. We present a graybox mechanism that extends a general purpose database to cooperate with our XSS scanner, reporting and injecting the test inputs at the boundary between the database and the web application. Furthermore, we design a mechanism for identifying the injected inputs in the web output even after encoding by the web application, and check whether the encoding sanitizes the injected inputs correctly in the respective browser context. We evaluate our approach on eight mature and technologically diverse web applications, discovering previously unknown and exploitable XSS flaws in each of those applications.

This work addresses the problem of traffic management at and near an isolated un-signalized intersection for autonomous and networked vehicles through coordinated optimization of their trajectories. We decompose the trajectory of each vehicle into two phases: the provisional phase and the coordinated phase. A vehicle, upon entering the region of interest, initially operates in the provisional phase, in which the vehicle is allowed to optimize its trajectory but is constrained to guarantee in-lane safety and to not enter the intersection. Periodically, all the vehicles in their provisional phase switch to their coordinated phase, which is obtained by coordinated optimization of the schedule of the vehicles' intersection usage as well as their trajectories. For the coordinated phase, we propose a data-driven solution, in which the intersection usage order is obtained through a data-driven online "classification" and the trajectories are computed sequentially. This approach is computationally very efficient and does not compromise much on optimality. Moreover, it also allows for incorporation of "macro" information such as traffic arrival rates into the solution. We also discuss a distributed implementation of this proposed data-driven sequential algorithm. Finally, we compare the proposed algorithm and its two variants against traditional methods of intersection management and against some existing results in the literature by micro-simulations.

Spiking neural networks (SNNs) are considered as a potential candidate to overcome current challenges such as the high-power consumption encountered by artificial neural networks (ANNs), however there is still a gap between them with respect to the recognition accuracy on practical tasks. A conversion strategy was thus introduced recently to bridge this gap by mapping a trained ANN to an SNN. However, it is still unclear that to what extent this obtained SNN can benefit both the accuracy advantage from ANN and high efficiency from the spike-based paradigm of computation. In this paper, we propose two new conversion methods, namely TerMapping and AugMapping. The TerMapping is a straightforward extension of a typical threshold-balancing method with a double-threshold scheme, while the AugMapping additionally incorporates a new scheme of augmented spike that employs a spike coefficient to carry the number of typical all-or-nothing spikes occurring at a time step. We examine the performance of our methods based on MNIST, Fashion-MNIST and CIFAR10 datasets. The results show that the proposed double-threshold scheme can effectively improve accuracies of the converted SNNs. More importantly, the proposed AugMapping is more advantageous for constructing accurate, fast and efficient deep SNNs as compared to other state-of-the-art approaches. Our study therefore provides new approaches for further integration of advanced techniques in ANNs to improve the performance of SNNs, which could be of great merit to applied developments with spike-based neuromorphic computing.

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.

"The penalty kicks, the final goals in the Olympics, playing in front of the president, in front of 90,000 people ... that is what I was born to do ... and my brain is what I used to get myself there."

As COVID-19 fears grew, public officials and sports execs contemplated health risks — and debated a PR message — but let 33,000 fans into a Seattle Sounders soccer match, emails show. By Ken Armstrong, ProPublica, and David Gutman and Lewis Kamb, The Seattle Times On March 6, at 2:43 p.m., the health officer for Public Health — Seattle & King County, the hardest-hit region in the first state to be slammed by COVID-19, sent an email to a half-dozen colleagues, saying, “I want to cancel large group gatherings now.”…

Cops are hackers now, too.…

Yesterday, Spokane Mayor Nadine Woodward and other local leaders urged Gov. Jay Inslee to allow Spokane County to open on a different schedule than the rest of the state.  Inslee, however, wouldn't budge.…

A system and method that facilitates urban traffic state detection based on support vector machine (SVM) and multilayer perceptron (MLP) classifiers is provided. Moreover, the SVM and MLP classifiers are fused into a cascaded two-tier classifier that improves the accuracy of the traffic state classification. To further improve the accuracy, the cascaded two-tier classifier (e.g., MLP-SVM), a single SVM classifier and a single MLP classifier are fused to determine a final decision for a traffic state. In addition, fusion strategies are employed during training and implementation phases to compensate for data acquisition and classification errors caused by noise and/or outliers.

The disclosed embodiments describe a method, an apparatus, an application specific integrated circuit, and a server that provides a fast and efficient look up for data analysis. The apparatus and server may be configured to obtain data segments from a plurality of input devices. The data segments may be individual unique subsets of the entire data set obtained by a plurality input devices. A hash function may be applied to an aggregated set of the data segments. A result of the hash function may be stored in a data structure. A codebook may be generated from the hash function results.

A process is presented for quenching a process stream in a paraffin dehydrogenation process. The process comprises cooling a propane dehydrogenation stream during the hot residence time after the process stream leaves the catalytic bed reactor section. The process includes cooling and compressing the product stream, taking a portion of the product stream and passing the portion of the product stream to the mix with the process stream as it leaves the catalytic bed reactor section.

Embodiments of methods and apparatuses for isomerization of paraffins are provided. In one example, a method comprises the steps of separating an isomerization effluent into a product stream that comprises branched paraffins and a stabilizer vapor stream that comprises HCl, H2, and C6-hydrocarbons. C6-hydrocarbons are removed from the stabilizer overhead vapor stream to form a HCl and H2-rich stream. An isomerization catalyst is activated using at least a portion of the HCl and H2-rich stream to form a chloride-promoted isomerization catalyst. A paraffin feed stream is contacted with the chloride-promoted isomerization catalyst in the presence of hydrogen for isomerization of the paraffins.

Embodiments relate to a computer implemented information processing system, method and program product for data access. The information processing system includes a data store having a top tier store and at least another tier store with the top tier store including a counter for each entry of a symbol and another tier store including a representative frequency value defined for the another tier store. A sorter is also provided configured to sort the symbol in the top tier store and the another tier stores according to a value generated in the counter for the assessed symbol. The said sorter is also configured to restore entry of the symbol in the top tier store, in response to a symbol having moved from said top tier store to another tier store, by using the representative frequency value defined for said another store to which said symbol was moved.

In a wireless communication system, a compact control signaling scheme is provided for signaling the selected retransmission mode and codeword identifier for a codeword retransmission when one of a plurality of codewords being transmitted over two codeword pipes to a receiver fails the transmission and when the base station/transmitter switches from a higher order channel rank to a lower order channel rank, either by including one or more additional signaling bits in the control signal to identify the retransmitted codeword, or by re-using existing control signal information in a way that can be recognized by the subscriber station/receiver to identify the retransmitted codeword. With the compact control signal, the receiver is able to determine which codeword is being retransmitted and to determine the corresponding time-frequency resource allocation for the retransmitted codeword.

Efficient computation of complex multiplication results and very efficient fast Fourier transforms (FFTs) are provided. A parallel array VLIW digital signal processor is employed along with specialized complex multiplication instructions and communication operations between the processing elements which are overlapped with computation to provide very high performance operation. Successive iterations of a loop of tightly packed VLIWs are used allowing the complex multiplication pipeline hardware to be efficiently used. In addition, efficient techniques for supporting combined multiply accumulate operations are described.

Systems and methods are provided for generating at least one high fidelity resource state. A classical code and punctured to provide a first set of generators and a second set of generators. The first set of generators is mapped to a set of stabilizer generators, and the second set of generators is mapped to a set of logical operators. A set of resource states are prepared in physical qubits. A decoding process is performed on the resource states according to a quantum code represented by the set of stabilizer generators and the set of logical operators, and qubits corresponding to the stabilizers are measured.

Apparatus comprising an input connected to receive an input signal, a lookup table comprising a plurality of input entries and first and second output entries for each input entry. The look up table receives the input signal and returns a lower input entry, an upper input entry, the second output entry for the lower input entry, and the first output entry for the upper input entry. A first subtractor subtracts the lower input entry from the input signal to produce a first difference. A second subtractor subtracts the input signal from the upper input entry to produce a second difference. First and second multipliers multiply the first and second differences by the first output entry for the upper input entry and the second output entry for the lower input entry, respectively, to produce first and second products. An adder adds the first and second products to produce an output signal.

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 microprocessor having performs an architectural instruction that instructs it to perform an operation on first and second source operands to generate a result and to write the result to a destination register only if its architectural condition flags satisfy a condition specified in the architectural instruction. A hardware instruction translator translates the instruction into first and second microinstructions. To execute the first microinstruction, an execution pipeline performs the operation on the source operands to generate the result. To execute the second microinstruction, it writes the destination register with the result generated by the first microinstruction if the architectural condition flags satisfy the condition, and writes the destination register with the current value of the destination register if the architectural condition flags do not satisfy the condition.

A computing method includes accepting a definition of a computing task, which includes multiple Processing Elements (PEs) having execution dependencies. The computing task is compiled for concurrent execution on a multiprocessor device, by arranging the PEs in a series of two or more invocations of the multiprocessor device, including assigning the PEs to the invocations depending on the execution dependencies. The multiprocessor device is invoked to run software code that executes the series of the invocations, so as to produce a result of the computing task.

A system and method for efficient compilation and invocation of function type calls in a virtual machine (VM), or other runtime environment, and particularly for use in a system that includes a Java Virtual Machine (JVM). In accordance with an embodiment, the system comprises a virtual machine for executing a software application; a memory space for the application byte code comprising callsites generated using a function type carrier; a bytecode to machine code compiler which performs MethodHandle invocation optimizations; a memory space for the compiled machine code; and a memory space for storing software objects as part of the software application. The system enables carrying the function type from the original MethodHandle to a callsite in the generated bytecode, including maintaining generics information for a function type acquired from a target function, and generating a callsite based on the generics information for the function object invocation.