An efficient edge based data structure for the compressible Reynolds-averaged Navier–Stokes equations on hybrid unstructured meshes

An efficient edge based data structure has been developed in order to implement an unstructured vertex based finite volume algorithm for the Reynolds-averaged Navier–Stokes equations on hybrid meshes. In the present approach, the data structure is tailored to meet the requirements of the vertex based algorithm by considering data access patterns and cache efficiency. The required data are packed and allocated in a way that they are close to each other in the physical memory. Therefore, the proposed data structure increases cache performance and improves computation time. As a result, the explicit flow solver indicates a significant speed up compared to other open-source solvers in terms of CPU time. A fully implicit version has also been implemented based on the PETSc library in order to improve the robustness of the algorithm. The resulting algebraic equations due to the compressible Navier–Stokes and the one equation Spalart–Allmaras turbulence equations are solved in a monolithic manner using the restricted additive Schwarz preconditioner combined with the FGMRES Krylov subspace algorithm. In order to further improve the computational accuracy, the multiscale metric based anisotropic mesh refinement library PyAMG is used for mesh adaptation. The numerical algorithm is validated for the classical benchmark problems such as the transonic turbulent flow around a supercritical RAE2822 airfoil and DLR-F6 wing-body-nacelle-pylon configuration. The efficiency of the data structure is demonstrated by achieving up to an order of magnitude speed up in CPU times.     

Patterns in environmental priorities revealed through government open data portals

The ways in which environmental priorities are framed are varied and influenced by political forces. One technological advance--the proliferation of government open data portals (ODPs)--has the potential to improve governance through facilitating access to data. Yet it is also known that the data hosted on ODPs may simply reflect the goals and interests of multiple levels of political power. In this article, I use traditional statistical correlation and regression techniques along with newer natural language processing and machine learning algorithms to analyze the corpus of datasets hosted on government ODPs (total: 49,066) to extract patterns that relate scales of governance and political liberalism/conservatism to the priorities and meaning attached to environmental issues. I find that state-level and municipal-level ODPs host different categories of environmental datasets, with municipal-level ODPs generally hosting more datasets pertaining to services and amenities and state-level ODPs hosting more datasets pertaining to resource protection and extraction. Stronger trends were observed for the influences of political conservatism/liberalism among state-level ODPs than for municipal-level ODPs.     

Reversible data hiding based on RSBEMD coding and adaptive multi-segment left and right histogram shifting

By leveraging the secret data coding using the remainder storage based exploiting modification direction (RSBEMD), and the pixel change operation recording based on multi-segment left and right histogram shifting, a novel reversible data hiding (RHD) scheme is proposed in this paper. The secret data are first encoded by some specific pixel change operations to the pixels in groups. After that, multi-segment left and right histogram shifting based on threshold manipulation is implemented for recording the pixel change operations. Furthermore, a multiple embedding policy based on chess board prediction (CBP) and threshold manipulation is put forward, and the threshold can be adjusted to achieve adaptive data hiding. Experimental results and analysis show that it is reversible and can achieve good performance in capacity and imperceptibility compared with the existing methods.     

Limitations of the Clausius‐Mossotti function used in dielectrophoresis and electrical impedance studies of biomacromolecules

Dielectrophoresis (DEP) studies have progressed from the microscopic scale of cells and bacteria, through the mesoscale of virions to the molecular scale of DNA and proteins. The Clausius‐Mossotti function, based on macroscopic electrostatics, is invariably employed in the analyses of all these studies. The limitations of this practice are explored, with the conclusion that it should be abandoned for the DEP study of proteins and modified for native DNA. For macromolecular samples in general, a DEP theory that incorporates molecular‐scale interactions and the influence of permanent dipoles is more appropriate. Experimental ways to test these conclusions are proposed.     

A signal adaptive diffusion filter for video coding: Mathematical framework and complexity reductions

In this paper we combine video compression and modern image processing methods. We construct novel iterative filter methods for prediction signals based on Partial Differential Equation (PDE) based methods. The mathematical framework of the employed diffusion filter class is given and some desirable properties are stated. In particular, two types of diffusion filters are constructed: a uniform diffusion filter using a fixed filter mask and a signal adaptive diffusion filter that incorporates the structures of the underlying prediction signal. The latter has the advantage of not attenuating existing edges while the uniform filter is less complex. The filters are embedded into a software based on HEVC with additional QTBT (Quadtree plus Binary Tree) and MTT (Multi-Type-Tree) block structure. In this setting, several measures to reduce the coding complexity of the tool are introduced, discussed and tested thoroughly. The coding complexity is reduced by up to 70% while maintaining over 80% of the gain. Overall, the diffusion filter method achieves average bitrate savings of 2.27% for Random Access having an average encoder runtime complexity of 119% and 117% decoder runtime complexity. For individual test sequences, results of 7.36% for Random Access are accomplished.     

Synthesis,spectral investigation and development of tetrahedral copper(II) complexes as artificial metallonucleases and antimalarial agents

Seven new copper(II) complexes of type [Cu(A)(L)]?H₂O (A = sparfloxacin, ciprofloxacin, levofloxacin, gatifloxacin, pefloxacin, ofloxacin, norfloxacin; L = 5‐[(3‐chlorophenyl)diazenyl]‐4‐hydroxy‐1,3‐thiazole‐2(3H)‐thione) were synthesized and characterized using elemental and thermogravimetric analyses, and electronic, electron paramagnetic resonance (EPR), Fourier transform infrared and liquid chromatography–mass spectroscopies. Tetrahedral geometry around copper is assigned in all complexes using EPR and electronic spectral analyses. All complexes were investigated for their interaction with herring sperm DNA utilizing absorption titration (K_b = 1.27–3.13 × 10⁵ M^?1) and hydrodynamic volume measurement studies. The studies suggest the classical intercalative mode of DNA binding. The cleavage reaction on pUC19 DNA was monitored by agarose gel electrophoresis. The results indicate that the Cu(II) complexes can more effectively promote the cleavage of plasmid DNA. The superoxide dismutase mimic activity of the complexes was evaluated by nitroblue tetrazolium assay, and the complexes catalysed the dismutation of superoxide at pH = 7.8 with IC₅₀ values in the range 0.597–0.900 μM. The complexes were screened for their in vitro antibacterial activity against five pathogenic bacteria. All the complexes are good cytotoxic agents and show LC₅₀ values ranging from 5.559 to 11.912 µg ml^?1. All newly synthesized Cu(II) complexes were also evaluated for their in vitro antimalarial activity against Plasmodium falciparum strain (IC₅₀ = 0.62–2.0 µg ml^?1). Copyright © 2015 John Wiley & Sons, Ltd.     

一种快速解压的无损压缩算法

随着信息技术的不断发展,大量数据给存储和传输都带来了巨大的挑战。数据压缩能够有效减少数据量,方便数据的处理和传输。无损压缩是一种利用数据的冗余特点进行压缩的压缩方法,解压时可以完全还原数据而不会有任何失真。在研究LZO算法的快速解压原理基础上,设计了一种新的压缩算法。该算法通过减少压缩数据中压缩块的数量,降低了解压程序的执行开销。测试结果表明,新算法可实现比LZO算法更快的解压速度。     

Prediction of risk factors of cyberbullying-related words in Korea: Application of data mining using social big data

The study examined a decision tree analysis using social big data to conduct the prediction model on types of risk factors related to cyberbullying in Korea. The study conducted an analysis of 103,212 buzzes that had noted causes of cyberbullying and data were collected from 227 online channels, such as news websites, blogs, online groups, social network services, and online bulletin boards. Using opinion-mining method and decision tree analysis, the types of cyberbullying were sorted using SPSS 25.0. The results indicated that the total rate of types of cyberbullying in Korea was 44%, which consisted of 32.3% victims, 6.4% perpetrators, and 5.3% bystanders. According to the results, the impulse factor was also the greatest influence on the prediction of the risk factors and the propensity for dominance factor was the second greatest factor predicting the types of risk factors. In particular, the impulse factor had the most significant effect on bystanders, and the propensity for dominance factor was also significant in influencing online perpetrators. It is necessary to develop a program to diminish the impulses that were initiated by bystanders as well as victims and perpetrators because many of those bystanders have tended to aggravate impulsive cyberbullying behaviors.