Preset (Everyday) + transform + exposure + graduated filter + radial filter. If shots like this take more than 2 minutes to edit, it’s probably not worth editing. ⏱
—
Boxing Day will be the last day to get my Lightroom presets discounted, which leaves you only 3 more days! Get on it! ???? (at Toronto, Ontario)

Recently, I walked you through how to create a simple landing page that used a couple different CSS animation techniques. “Animation” is a loose term, in web design usually referring to anything that involves movement. CSS transitions are one tool we are given to manipulate elements on state changes or mouse events, and when combines […]

The post Easy CSS Animation With Transition & Transforms appeared first on Web Designer Wall.

I wish I had found Alix Kates Shulman’s memoir "To Love What Is: A Marriage Transformed" in the first month of my husband’s severe TBI, and yet I may not have absorbed it the way I did reading it fifteen years post-injury.

We prove a continuity result for the shearlet transform when restricted to the space of smooth and rapidly decreasing functions with all vanishing moments. We define the dual shearlet transform, called here the shearlet synthesis operator, and we prove its continuity on the space of smooth and rapidly decreasing functions over $mathbb{R}^2 imesmathbb{R} imesmathbb{R}^ imes$. Then, we use these continuity results to extend the shearlet transform to the space of Lizorkin distributions, and we prove its consistency with the classical definition for test functions.

We use the classical Fourier analysis to introduce analytic families of weighted differential operators on the unit sphere. These operators are polynomial functions of the usual Beltrami-Laplace operator. New inversion formulas are obtained for totally geodesic Funk transforms on the sphere and the correpsonding lambda-cosine transforms.

We develop a distributional framework for the shearlet transform $mathcal{S}_{psi}colonmathcal{S}_0(mathbb{R}^2) omathcal{S}(mathbb{S})$ and the shearlet synthesis operator $mathcal{S}^t_{psi}colonmathcal{S}(mathbb{S}) omathcal{S}_0(mathbb{R}^2)$, where $mathcal{S}_0(mathbb{R}^2)$ is the Lizorkin test function space and $mathcal{S}(mathbb{S})$ is the space of highly localized test functions on the standard shearlet group $mathbb{S}$. These spaces and their duals $mathcal{S}_0^prime (mathbb R^2),, mathcal{S}^prime (mathbb{S})$ are called Lizorkin type spaces of test functions and distributions. We analyze the continuity properties of these transforms when the admissible vector $psi$ belongs to $mathcal{S}_0(mathbb{R}^2)$. Then, we define the shearlet transform and the shearlet synthesis operator of Lizorkin type distributions as transpose mappings of the shearlet synthesis operator and the shearlet transform, respectively. They yield continuous mappings from $mathcal{S}_0^prime (mathbb R^2)$ to $mathcal{S}^prime (mathbb{S})$ and from $mathcal{S}^prime (mathbb S)$ to $mathcal{S}_0^prime (mathbb{R}^2)$. Furthermore, we show the consistency of our definition with the shearlet transform defined by direct evaluation of a distribution on the shearlets. The same can be done for the shearlet synthesis operator. Finally, we give a reconstruction formula for Lizorkin type distributions, from which follows that the action of such generalized functions can be written as an absolutely convergent integral over the standard shearlet group.

In the present paper by the Fourier transform we show that every linear differential equations of $n$-th order has a solution in $L^1(Bbb{R})$ which is infinitely differentiable in $Bbb{R} setminus {0}$. Moreover the Hyers-Ulam stability of such equations on $L^1(Bbb{R})$ is investigated.

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.

The quantum Fourier transform brings efficiency in many respects, especially usage of resource, for most operations on quantum computers. In this study, the existing QFT-based and non-QFT-based quantum arithmetic operations are examined. The capabilities of QFT-based addition and multiplication are improved with some modifications. The proposed operations are compared with the nearest quantum arithmetic operations. Furthermore, novel QFT-based subtraction and division operations are presented. The proposed arithmetic operations can perform non-modular operations on all signed numbers without any limitation by using less resources. In addition, novel quantum circuits of two's complement, absolute value and comparison operations are also presented by using the proposed QFT based addition and subtraction operations.

Representation learning is a critical ingredient for natural language processing systems. Recent Transformer language models like BERT learn powerful textual representations, but these models are targeted towards token- and sentence-level training objectives and do not leverage information on inter-document relatedness, which limits their document-level representation power. For applications on scientific documents, such as classification and recommendation, the embeddings power strong performance on end tasks. We propose SPECTER, a new method to generate document-level embedding of scientific documents based on pretraining a Transformer language model on a powerful signal of document-level relatedness: the citation graph. Unlike existing pretrained language models, SPECTER can be easily applied to downstream applications without task-specific fine-tuning. Additionally, to encourage further research on document-level models, we introduce SciDocs, a new evaluation benchmark consisting of seven document-level tasks ranging from citation prediction, to document classification and recommendation. We show that SPECTER outperforms a variety of competitive baselines on the benchmark.

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.

We propose a new method for realistic human motion transfer using a generative adversarial network (GAN), which generates a motion video of a target character imitating actions of a source character, while maintaining high authenticity of the generated results. We tackle the problem by decoupling and recombining the posture information and appearance information of both the source and target characters. The innovation of our approach lies in the use of the projection of a reconstructed 3D human model as the condition of GAN to better maintain the structural integrity of transfer results in different poses. We further introduce a detail enhancement net to enhance the details of transfer results by exploiting the details in real source frames. Extensive experiments show that our approach yields better results both qualitatively and quantitatively than the state-of-the-art methods.

Style transfer is to render given image contents in given styles, and it has an important role in both computer vision fundamental research and industrial applications. Following the success of deep learning based approaches, this problem has been re-launched recently, but still remains a difficult task because of trade-off between preserving contents and faithful rendering of styles. Indeed, how well-balanced content and style are is crucial in evaluating the quality of stylized images. In this paper, we propose an end-to-end two-stream Fully Convolutional Networks (FCNs) aiming at balancing the contributions of the content and the style in rendered images. Our proposed network consists of the encoder and decoder parts. The encoder part utilizes a FCN for content and a FCN for style where the two FCNs have feature injections and are independently trained to preserve the semantic content and to learn the faithful style representation in each. The semantic content feature and the style representation feature are then concatenated adaptively and fed into the decoder to generate style-transferred (stylized) images. In order to train our proposed network, we employ a loss network, the pre-trained VGG-16, to compute content loss and style loss, both of which are efficiently used for the feature injection as well as the feature concatenation. Our intensive experiments show that our proposed model generates more balanced stylized images in content and style than state-of-the-art methods. Moreover, our proposed network achieves efficiency in speed.

In this paper we revisit the deterministic version of the Sparse Fourier Transform problem, which asks to read only a few entries of $x in mathbb{C}^n$ and design a recovery algorithm such that the output of the algorithm approximates $hat x$, the Discrete Fourier Transform (DFT) of $x$. The randomized case has been well-understood, while the main work in the deterministic case is that of Merhi et al.@ (J Fourier Anal Appl 2018), which obtains $O(k^2 log^{-1}k cdot log^{5.5}n)$ samples and a similar runtime with the $ell_2/ell_1$ guarantee. We focus on the stronger $ell_{infty}/ell_1$ guarantee and the closely related problem of incoherent matrices. We list our contributions as follows.

1. We find a deterministic collection of $O(k^2 log n)$ samples for the $ell_infty/ell_1$ recovery in time $O(nk log^2 n)$, and a deterministic collection of $O(k^2 log^2 n)$ samples for the $ell_infty/ell_1$ sparse recovery in time $O(k^2 log^3n)$.

2. We give new deterministic constructions of incoherent matrices that are row-sampled submatrices of the DFT matrix, via a derandomization of Bernstein's inequality and bounds on exponential sums considered in analytic number theory. Our first construction matches a previous randomized construction of Nelson, Nguyen and Woodruff (RANDOM'12), where there was no constraint on the form of the incoherent matrix.

Our algorithms are nearly sample-optimal, since a lower bound of $Omega(k^2 + k log n)$ is known, even for the case where the sensing matrix can be arbitrarily designed. A similar lower bound of $Omega(k^2 log n/ log k)$ is known for incoherent matrices.

Sparse models require less memory for storage and enable a faster inference by reducing the necessary number of FLOPs. This is relevant both for time-critical and on-device computations using neural networks. The stabilized lottery ticket hypothesis states that networks can be pruned after none or few training iterations, using a mask computed based on the unpruned converged model. On the transformer architecture and the WMT 2014 English-to-German and English-to-French tasks, we show that stabilized lottery ticket pruning performs similar to magnitude pruning for sparsity levels of up to 85%, and propose a new combination of pruning techniques that outperforms all other techniques for even higher levels of sparsity. Furthermore, we confirm that the parameter's initial sign and not its specific value is the primary factor for successful training, and show that magnitude pruning cannot be used to find winning lottery tickets.

Neural style transfer is a well-known branch of deep learning research, with many interesting works and two major drawbacks. Most of the works in the field are hard to use by non-expert users and substantial hardware resources are required. In this work, we present a solution to both of these problems. We have applied neural style transfer to real-time video (over 25 frames per second), which is capable of running on mobile devices. We also investigate the works on achieving temporal coherence and present the idea of fine-tuning, already trained models, to achieve stable video. What is more, we also analyze the impact of the common deep neural network architecture on the performance of mobile devices with regard to number of layers and filters present. In the experiment section we present the results of our work with respect to the iOS devices and discuss the problems present in current Android devices as well as future possibilities. At the end we present the qualitative results of stylization and quantitative results of performance tested on the iPhone 11 Pro and iPhone 6s. The presented work is incorporated in Kunster - AR Art Video Maker application available in the Apple's App Store.

Software Defined Networking is currently revolutionizing computer networking by decoupling the network control (control plane) from the forwarding functions (data plane) enabling the network control to become directly programmable and the underlying infrastructure to be abstracted for applications and network services. Next to the well-known OpenFlow protocol, the XML-based NETCONF protocol is also an important means for exchanging configuration information from a management platform and is nowadays even part of OpenFlow. In combination with NETCONF, YANG is the corresponding protocol that defines the associated data structures supporting virtually all network configuration protocols. YANG itself is a semantically rich language, which -- in order to facilitate familiarization with the relevant subject -- is often visualized to involve other experts or developers and to support them by their daily work (writing applications which make use of YANG). In order to support this process, this paper presents an novel approach to optimize and simplify YANG data models to assist further discussions with the management and implementations (especially of interfaces) to reduce complexity. Therefore, we have defined a bidirectional mapping of YANG to UML and developed a tool that renders the created UML diagrams. This combines the benefits to use the formal language YANG with automatically maintained UML diagrams to involve other experts or developers, closing the gap between technically improved data models and their human readability.

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.

A process according to various approaches includes flushing an intermediate transfer line between a raffinate stream transfer line and a desorbent stream transfer line away from the adsorptive separation chamber to remove residual fluid including desorbent from intermediate transfer line. The process may include directing the residual fluid flushed from the intermediate transfer line to a recycle stream to introduce the residual fluid into the adsorptive separation chamber.

A perpendicular spin-transfer torque magnetic random access memory (STTMRAM) element includes a fixed layer having a magnetization that is substantially fixed in one direction and a barrier layer formed on top of the fixed layer and a free layer. The free layer has a number of alternating laminates, each laminate being made of a magnetic layer and an insulating layer. The magnetic layer is switchable and formed on top of the barrier layer. The free layer is capable of switching its magnetization to a parallel or an anti-parallel state relative to the magnetization of the fixed layer during a write operation when bidirectional electric current is applied across the STTMRAM element. Magnetic layers of the laminates are ferromagnetically coupled to switch together as a single domain during the write operation and the magnetization of the fixed and free layers and the magnetic layers of the laminates have perpendicular anisotropy.

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.

Memory system operations are extended for a data processor by DMA, cache, or memory controller to include a DMA descriptor, including a set of operations and parameters for the operations, which provides for data compression and decompression during or in conjunction with processes for moving data between memory elements of the memory system. The set of operations can be configured to use the parameters and perform the operations of the DMA, cache, or memory controller. The DMA, cache, or memory controller can support moves between memory having a first access latency, such as memory integrated on the same chip as a processor core, and memory having a second access latency that is longer than the first access latency, such as memory on a different integrated circuit than the processor core.

A recursive type-IV discrete cosine transform system includes a first permutation device, a recursive type-III discrete cosine/sine transform device, a cosine/sine factor generation device, a recursive type-II discrete cosine/sine transform device, a second permutation device. The first permutation device performs two-dimensional order permutation operation on N digital signals for generating N two-dimensional first temporal signals. The recursive type-III discrete cosine/sine transform device repeats a type-III discrete cosine/sine transform for generating second temporal signals. The cosine/sine factor generation device sequentially performs cosine/sine factor multiplication and corresponding addition operations for generating third temporal signals. The recursive type-II discrete cosine/sine transform device repeats a type-II discrete cosine/sine transform for generating fourth temporal signals. The second permutation device performs a one-dimensional order permutation operation for generating N one-dimensional output signals. The N one-dimensional output signals are obtained by performing a type-IV discrete cosine transform on the N digital input signals.

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.

Provided are a storage device, controller, and method for using host transfer rates to select a recording medium transfer rate for transferring data to a recording medium. A host transfer rate of data with respect to a buffer is measured. Provided are a plurality of recording medium transfer rates at which data is transferred between the buffer and the recording medium. A determination is made of an amount of decrease in the host transfer rate. The recording medium transfer rate is selected based on the amount of decrease in the host transfer rate. A transfer rate at which the storage device transfers data is set to the selected recording medium transfer rate.

A transfer control circuit stores data in a FIFO memory, outputs data in the FIFO memory in response to a data request signal, and outputs a state signal in accordance with an amount of stored data in the FIFO memory. An output data generating unit outputs image data having a horizontal image size in accordance with a horizontal count value and a horizontal synchronizing signal, and thereafter, outputs blank data. When the state signal indicates that the FIFO memory is in a “EMPTY” or “MODERATE” storage state, a blank control unit outputs a blank addition signal until the FIFO memory changes to a “FULL” storage state.

A bus interconnect interfaces a host system to a radio frequency (RF) generator that is coupled to a plasma chamber. The bus interconnect includes a first set of host ports, which are used to provide a power component setting and a frequency component setting to the RF generator. The ports of the first set of host ports are used to receive distinct variables that change over time. The bus interconnect further includes a second set of generator ports used to send a power read back value and a frequency read back value to the host system. The bus interconnect includes a sampler circuit integrated with the host system. The sampler circuit is configured to sample signals at the ports of the first set at selected clock edges to capture operating state data of the plasma chamber and the RF generator.

A data transfer control apparatus includes a transferring unit that transfers data from a transfer source memory to a transfer destination memory, according to an instruction from a first processor; and a first processor configured to detect a process execute by the first processor, determine whether transfer of the data is urgent, based on the type of the detected process, and control the transferring unit or the first processor to transfer the data, based on a determination result.

A data transfer control apparatus includes a transferring unit that transfers data from a transfer source memory to a transfer destination memory, according to an instruction from a first processor; and a first processor configured to detect a process execute by the first processor, determine whether transfer of the data is urgent, based on the type of the detected process, and control the transferring unit or the first processor to transfer the data, based on a determination result.

A heat transfer fluid emulsion includes a heat transfer fluid, and liquid droplets dispersed within the heat transfer fluid, where the liquid droplets are substantially immiscible with respect to the heat transfer fluid and have dimensions that are no greater than about 100 nanometers. In addition, the thermal conductivity of the heat transfer fluid emulsion is greater than the thermal conductivity of the heat transfer fluid.

A method and circuit arrangement utilize a low latency variable transfer network between the register files of multiple processing cores in a multi-core processor chip to support fine grained parallelism of virtual threads across multiple hardware threads. The communication of a variable over the variable transfer network may be initiated by a move from a local register in a register file of a source processing core to a variable register that is allocated to a destination hardware thread in a destination processing core, so that the destination hardware thread can then move the variable from the variable register to a local register in the destination processing core.

A data processing system arranged for receiving over a network, according to a data transfer protocol, data directed to any of a plurality of destination identities, the data processing system comprising: data storage for storing data received over the network; and a first processing arrangement for performing processing in accordance with the data transfer protocol on received data in the data storage, for making the received data available to respective destination identities; and a response former arranged for: receiving a message requesting a response indicating the availability of received data to each of a group of destination identities; and forming such a response; wherein the system is arranged to, in dependence on receiving the said message.

Techniques for automatically partitioning a multi-platform data transform flow graph to one or more target output platforms are provided. The techniques include performing type inference on a transform graph, wherein the transform graph comprises one or more data transforms, automatically partitioning the transform graph to one or more target output platforms based on one or more policies, performing an optimization of the partitioned transform graph, and generating code, from the partitioned transform graph, for each set of the one or more data transforms based on the one or more target output platforms.

Transferring files to a baseboard management controller (‘BMC’) in a computing system, including: receiving, by the BMC, a request to initiate an update of the computing system; identifying, by the BMC, an area in memory within the computing system for storing an update file; and transmitting, by the BMC, a request to register the BMC as a virtual memory device.

Transferring files to a baseboard management controller (‘BMC’) in a computing system, including: receiving, by the BMC, a request to initiate an update of the computing system; identifying, by the BMC, an area in memory within the computing system for storing an update file; and transmitting, by the BMC, a request to register the BMC as a virtual memory device.

A method for designing a transformer in an integrated circuit includes receiving one or more desired characteristics of the transformer from user input and iteratively determining a design solution for the transformer through one or more simulations and modifications using a rule-set. The method combines the one or more desired characteristics with other preset characteristics of the transformer or the integrated circuit. A first model of the transformer is defined with typical load impedances and simulated having the combined characteristics to determine performance. Results of the simulation are processed to calculate performance with the load impedances specified by the user. The results are further processed to obtain a mathematical model that includes tuning capacitors. The first and subsequent models are modified by drawing on a rule-set of expert knowledge relating to general dependency of at least one design criterion, such as a physical, geometrical or performance characteristic, with another design criterion.

A method and apparatus for partitioning of the input design into repeating patterns called template cores for the application of reticle enhancement methods, design verification for manufacturability and design corrections for optical and process effects is accomplished by hierarchy analysis to extract cell overlap information. Also hierarchy analysis is performed to extract hierarchy statistics. Finally template core candidates are identified. This allows to the design to be made amenable for design corrections or other analyses or modifications that are able to leverage the hierarchy of the design since the cell hierarchy could otherwise be very deep or cells could have significant overlap with each other.

A multilingual electronic transfer dictionary provides for automatic topic disambiguation by including one or more topic codes in definitions contained the dictionary. Automatic topic disambiguation is accomplished by determining the frequencies of topic codes within a block of text. Dictionary entries having more frequently occurring topic codes are preferentially selected over those having less frequently occurring topic codes. When the topic codes are members of a hierarchical topical coding system, such as the International Patent Classification system, an iterative method can be used with starts with a coarser level of the coding system and is repeated at finer levels until an ambiguity is resolved. The dictionary is advantageously used for machine translation, e.g. between Japanese and English.

A method for transmitting blocks of data in data packets from a first device on a network to a second device on the network comprising the steps of, providing a File Transmitter Application in communication with the first device, which File Transmitter Application is adapted to control the transmission of the blocks of data in data packets on the network, including the timing of the commencement of the transmission of the data blocks on the network, providing a File Receiver Application in communication with the second device and in communication with the File Transmitter Application, which File Receiver Application is adapted to transmit Acknowledgment data to the File Transmitter Application relating to the receipt of data blocks received at the second device, commencing the transmission of a first data block from the first device to the second device, by way of the network and commencing the transmission of the second data block from the first device to the second device, by way of the network.

A method of transferring data using a Trivial File Transport Protocol (TFTP) includes sending first request packet from client to server, first request packet requesting that first file be transferred; transferring first file according to first request packet if first acknowledgement packet is received at client from server indicating that server can accommodate request of first request packet; sending second request packet from client to the server if transfer of first file does not complete successfully, the second request packet including TFTP option indicating that transfer of first file be retried beginning at first block after final block that was successfully transferred in response to first request packet; and retrying transfer of first file according to second request packet if second acknowledgement packet is received at client from server indicating that server can accommodate request of second request packet.

A cytosine analog, a method of preparation of a cytosine analog, a DNA methyltransferase 1 inhibitor, and a method for DNA methylation inhibition, is provided for the treatment of diseases associated with deviations from normal DNA methylation. The analog of cytosine may be comprised of 1, N4, 5 and 6-substituted derivatives of cytosine or 5,6-dihydrocytosine, wherein the analog can be described by the chemical formula where R1 is H, R3, R4, 2'-deoxyribosyl, R4 is alkyl or aryl, X is N or C, wherein if X in the analog of formula I is N, then R5 is no substituent and if X in the analog of formula I and/or II is C or if X in the analog of formula II is N, then R5 and R6 are independently alkyl, aryl, hydroxyalkyl, aminoalkyl, hydroxyl, carboxyl, amino group, alkoxyl, aryloxyl, aminoalkyl, aminoaryl, thio group, sulfonyl, sulfinyl or halogen.

A data transform method and a data transformer. The method includes: importing a data transform rule; acquiring from the data transform rule a source data definition, a destination data definition and a data transform rule definition; predicting resource energy consumption parameters of a data transform node server according to the source data definition, the destination data definition and the data transform rule definition; and deploying a resource energy consumption optimization policy of the data transform node server according to the predicted resource energy consumption parameters of the data transform node server.

The invention provides a process for the synthesis of a polycarbonate, the process comprising the step of reacting carbon dioxide with at least one epoxide in the presence of a catalyst of formula (I) and a chain transfer agent. The invention also provides a polymerization system for the copolymerization of carbon dioxide and at least one epoxide comprising a catalyst of formula (I) and a chain transfer agent, polycarbonates produced by the inventive process, a block copolymer comprising a polycarbonate produced by the inventive process, and a method of producing the block copolymer. The invention also relates to novel catalysts of formula (III).

Meter electronics (20) for quantifying a fluid being transferred is provided. The meter electronics (20) includes an interface (201) configured to communicate with a flowmeter assembly of a vibratory flowmeter and receive a vibrational response and a processing system (203) coupled to the interface (201). The processing system (203) is configured to measure a volume flow and a density for a predetermined time portion of the fluid transfer, determine if the fluid transfer is non-aerated during the predetermined time portion, if the predetermined time portion is non-aerated then add a volume-density product to an accumulated volume-density product and add the volume flow to an accumulated volume flow, and determine a non-aerated volume-weighted density for the fluid transfer by dividing the accumulated volume-density product by the accumulated volume flow.

The present invention relates to a resin composition for protective layer transfer sheets which includes a polyester resin produced by polycondensing a polyhydric alcohol component containing a hydrogenated bisphenol A in an amount of 30 mol % or more and a polycarboxylic acid component containing a benzenedicarboxylic acid in an amount of 50 mol % or more.

There is provided a thermal transfer sheet including a base sheet, and a dye receiving layer formed on the base sheet and containing a mixture of copolymer A including styrene and acrylonitrile as monomers and a copolymer B including 2-phenoxyethyl methacrylate and 2-hydroxyethyl methacrylate as monomers.

A vinyl chloride-based resin latex which froths little when unreacted monomer remaining in the latex are recovered under heat and reduced-pressure conditions, and a thermal transfer image-receiving sheet which has satisfactory water resistance, does not yellow during storage, and gives images having excellent durability and light resistance. The invention provides a vinyl chloride-based resin latex contains a copolymer containing a vinyl chloride and an epoxy-group-containing vinyl or contains vinyl chloride, an epoxy-group-containing vinyl, and a carboxylic acid vinyl ester, wherein a content of the epoxy-group-containing vinyl is 0.1% by weight or more but less than 3% by weight, and wherein the latex contains no surfactant, and has a solid concentration of 25% by weight or more; a process for producing the latex; and a thermal transfer image-receiving sheet obtained using the latex.

In an intermediate transfer medium, a substrate, protective layers having a layered structure of two or more layers, and a receiving layer are layered in this order. One layer in the protective layers having the layered structure contains, as a main component, one material or a mixture of two or more materials selected from the group consisting of polyesters having a high polymerization degree, a number-average molecular weight (Mn) of not less than 12,000 and a Tg of not less than 60° C., polycarbonates and polyester urethanes. Another layer in the protective layers having the layered structure contains one or more materials selected from the group consisting of polyvinyl alcohols, polyvinyl butyrals, polyvinyl acetals and polyvinyl pyrrolidones or includes a cationic resin, and the receiving layer contains a side chain-type aralkyl-modified silicone in an amount of 0.5-5% by weight on a base of the total weight of the receiving layer.

Disclosed is a thermal transfer image-receiving sheet which excels in adhesiveness to a receiving layer and solvent resistance, and a manufacturing method thereof. In the thermal transfer image-receiving sheet, which includes a porous layer, a barrier layer, a receiving layer which are stacked in this order on a substrate, the porous layer includes a binder resin and hollow particles, and the barrier layer includes (i) (A) a first acrylic resin and (B) one or more kinds of resins selected from the group consisting of polyester resins, polyvinyl pyrrolidone type resins, polyester type urethane resin, and a second acrylic resin which differs from the first acrylic resin; or (ii) a polyvinyl pyrrolidone type resin.

Systems for spacing and transferring objects between operative stations are provided. Such systems can be used with ovens for preforms for plastic material, in blowing or stretch-blowing machines and for other applications in the packaging field. Such systems provide spacing and transferring of objects advancing in procession on transport elements, from a minimum pitch to a preset pitch larger than said minimum pitch, and for transferring said spaced objects to handling elements.