The use of natural (Pinus pinaster) resin in the production of printing ink and the printability effect

Alkyd resins are generally used in the production of printing inks. All industries look for alternative raw materials in the production of ink with the growing inclination toward using natural products. Resins forming the vehicle of the ink to be obtained from natural resources will provide benefits for the environment, nature, and living creatures. The aim of the study was to promote the use of natural resin in the ink system. Natural Pinus pinaster resin was added into vegetable and mineral oil-based solvents in pure form with alkyd resin in different amounts and ink varnishes of different combinations were prepared. Then, printing inks were produced from these varnishes in pure and hybrid form. Following the assessment of the rheological properties of the inks prepared, printing tests were conducted to assess the printing quality parameters. Ideal mixing ratios of the natural resins in the ink were determined for printability. The environmental importance and advantages of the use of natural resins were discussed. Recommendations were given in line with the results to encourage widespread use of natural resins in near future.     

A new deep intuitionistic fuzzy time series forecasting method based on long short-term memory

The Journal of Supercomputing - In recent years, deep artificial neural networks can have better forecasting performance than many other artificial neural networks. The long short-term memory...     

Retrospective adaptive prefetching for interactive Web GIS applications

A major task of a Web GIS (Geographic Information Systems) system is to transfer map data to client applications over the Internet, which may be too costly. To improve this inefficient process, various solutions are available. Caching the responses of the requests on the client side is the most commonly implemented solution. However, this method may not be adequate by itself. Besides caching the responses, predicting the next possible requests from a client and updating the cache with responses for those requests together provide a remarkable performance improvement. This procedure is called “prefetching” and makes caching mechanisms more effective and efficient. This paper proposes an efficient prefetching algorithm called Retrospective Adaptive Prefetch (RAP), which is constructed over a heuristic method that considers the former actions of a given user. The algorithm reduces the user-perceived response time and improves user navigation efficiency. Additionally, it adjusts the cache size automatically, based on the memory size of the client’s machine. RAP is compared with four other prefetching algorithms. The experiments show that RAP provides better performance enhancements than the other methods.     

Maximization of total surface area of Pt-SnO<Subscript>2</Subscript>/Al<Subscript>2</Subscript>O<Subscript>3</Subscript> catalyst by the Taguchi method

The maximization of the total surface area of Pt-SnO₂/Al₂O₃ catalyst was studied by using the Taguchi method of experimental design. The catalysts were prepared by sol-gel method. The effects of HNO₃, H₂O and aluminum nitrate concentrations and the stirring rate on the total surface area were studied at three levels of each. L₉ orthogonal array leading nine experiments was used in the experimental design. The parameter levels that give maximum total surface area were determined and experimentally verified. In the range of conditions studied it was found that, medium levels of HNO₃ and H₂O concentration and lower levels of aluminum nitrate concentration and stirring rate maximize the total surface area.     

HamleDT: Harmonized multi-language dependency treebank

We present HamleDT—a HArmonized Multi-LanguagE Dependency Treebank. HamleDT is a compilation of existing dependency treebanks (or dependency conversions of other treebanks), transformed so that they all conform to the same annotation style. In the present article, we provide a thorough investigation and discussion of a number of phenomena that are comparable across languages, though their annotation in treebanks often differs. We claim that transformation procedures can be designed to automatically identify most such phenomena and convert them to a unified annotation style. This unification is beneficial both to comparative corpus linguistics and to machine learning of syntactic parsing.     

Improved phase performance for rotman lens

Rotman lenses are used to obtain multiple beams from a single array. Although the beams produced by the feed antennas at focal points have no path length errors, the beams produced by feed antennas at off focal points may have large path length errors. These path length errors cause deterioration in the multiple beams. In this article, two novel methods are introduced to obtain feed curves which reduce the path length errors of off focal feed points significantly, compared with the commonly used circular and elliptical feed curves. The first method obtains feed curve points based on having zero path length error at three chosen points of the radiating array for each beam direction. The second method uses the particle swarm optimization method for obtaining optimum feed points for each beam direction. The results show that there is a very significant drop in the level of the maximum path length errors (in the order of about 1:4). © 2012 Wiley Periodicals, Inc. Int J RF and Microwave CAE 23: 634–638, 2013.     

One-Way Functions Using Algorithmic and Classical Information Theories

We prove several results relating injective one-way functions, time-bounded conditional Kolmogorov complexity, and time-bounded conditional entropy. First we establish a connection between injective, strong and weak one-way functions and the expected value of the polynomial time-bounded Kolmogorov complexity, denoted here by?E(K ^t (x|f(x))). These results are in both directions. More precisely, conditions on?E(K ^t (x|f(x))) that imply that?f is a weak one-way function, and properties of?E(K ^t (x|f(x))) that are implied by the fact that?f is a strong one-way function. In particular, we prove a separation result: based on the concept of time-bounded Kolmogorov complexity, we find an interval in which every function?f is a necessarily weak but not a strong one-way function. Then we propose an individual approach to injective one-way functions based on Kolmogorov complexity, defining Kolmogorov one-way functions and prove some relationships between the new proposal and the classical definition of one-way functions, showing that a Kolmogorov one-way function is also a deterministic one-way function. A relationship between Kolmogorov one-way functions and the conjecture of polynomial time symmetry of information is also proved. Finally, we relate?E(K ^t (x|f(x))) and two forms of time-bounded entropy, the unpredictable entropy?H ^unp, in which ??one-wayness?? of a function can be easily expressed, and the Yao⁺ entropy, a measure based on compression/decompression schema in which only the decompressor is restricted to be time-bounded.     

A general topology-based framework for adaptive insertion of cohesive elements in finite element meshes

Large-scale simulation of separation phenomena in solids such as fracture, branching, and fragmentation requires a scalable data structure representation of the evolving model. Modeling of such phenomena can be successfully accomplished by means of cohesive models of fracture, which are versatile and effective tools for computational analysis. A common approach to insert cohesive elements in finite element meshes consists of adding discrete special interfaces (cohesive elements) between bulk elements. The insertion of cohesive elements along bulk element interfaces for fragmentation simulation imposes changes in the topology of the mesh. This paper presents a unified topology-based framework for supporting adaptive fragmentation simulations, being able to handle two- and three-dimensional models, with finite elements of any order. We represent the finite element model using a compact and “complete” topological data structure, which is capable of retrieving all adjacency relationships needed for the simulation. Moreover, we introduce a new topology-based algorithm that systematically classifies fractured facets (i.e., facets along which fracture has occurred). The algorithm follows a set of procedures that consistently perform all the topological changes needed to update the model. The proposed topology-based framework is general and ensures that the model representation remains always valid during fragmentation, even when very complex crack patterns are involved. The framework correctness and efficiency are illustrated by arbitrary insertion of cohesive elements in various finite element meshes of self-similar geometries, including both two- and three-dimensional models. These computational tests clearly show linear scaling in time, which is a key feature of the present data-structure representation. The effectiveness of the proposed approach is also demonstrated by dynamic fracture analysis through finite element simulations of actual engineering problems.