Automatic Identification of False Friends in Parallel Corpora: Statistical and Semantic Approach

False friends are pairs of words in two languages that are perceived as similar but have different meanings. We present an improved algorithm for acquiring false friends from sentence-level aligned parallel corpus based on statistical observations of words occurrences and co-occurrences in the parallel sentences. The results are compared with an entirely semantic measure for cross-lingual similarity between words based on using the Web as a corpus through analyzing the words’ local contexts extracted from the text snippets returned by searching in Google. The statistical and semantic measures are further combined into an improved algorithm for identification of false friends that achieves almost twice better results than previously known algorithms. The evaluation is performed for identifying cognates between Bulgarian and Russian but the proposed methods could be adopted for other language pairs for which parallel corpora and bilingual glossaries are available.

Parallel Class Intersection Matrices of Orthogonal Resolutions

This work was partially supported by the Bulgarian National Science Fund under Contract No MM 1405. Part of the results were announced at the Fifth International Workshop on Optimal Codes and Related Topics (OCRT), White Lagoon, June 2007, Bulgaria

Self-adapting parallel metric-space search engine for variable query loads

This research focuses on automatically adapting a search engine size in response to fluctuations in query workload. Deploying a search engine in an Infrastructure as a Service (IaaS) cloud facilitates allocating or deallocating computer resources to or from the engine. Our solution is to contribute an adaptive search engine that will repeatedly re-evaluate its load and, when appropriate, switch over to a dierent number of active processors. We focus on three aspects and break them out into three sub-problems as follows: Continually determining the Number of Processors (CNP), New Grouping Problem (NGP) and Regrouping Order Problem (ROP). CNP means that (in the light of the changes in the query workload in the search engine) there is a problem of determining the ideal number of processors p active at any given time to use in the search engine and we call this problem CNP. NGP happens when changes in the number of processors are determined and it must also be determined which groups of search data will be distributed across the processors. ROP is how to redistribute this data onto processors while keeping the engine responsive and while also minimising the switchover time and the incurred network load. We propose solutions for these sub-problems. For NGP we propose an algorithm for incrementally adjusting the index to t the varying number of virtual machines. For ROP we present an ecient method for redistributing data among processors while keeping the search engine responsive. Regarding the solution for CNP, we propose an algorithm determining the new size of the search engine by re-evaluating its load. We tested the solution performance using a custom-build prototype search engine deployed in the Amazon EC2 cloud. Our experiments show that when we compare our NGP solution with computing the index from scratch, the incremental algorithm speeds up the index computation 2{10 times while maintaining a similar search performance. The chosen redistribution method is 25% to 50% faster than other methods and reduces the network load around by 30%. For CNP we present a deterministic algorithm that shows a good ability to determine a new size of search engine. When combined, these algorithms give an adapting algorithm that is able to adjust the search engine size with a variable workload.

Design and analysis of a compliant parallel pan-tilt platform

In combination of the advantages of both parallel mechanisms and compliant mechanisms, a compliant parallel mechanism with two rotational DOFs (degrees of freedom) is designed to meet the requirement of a lightweight and compact pan-tilt platform. Firstly, two commonly-used design methods i.e. direct substitution and FACT (Freedom and Constraint Topology) are applied to design the configuration of the pan-tilt system, and similarities and differences of the two design alternatives are compared. Then inverse kinematic analysis of the candidate mechanism is implemented by using the pseudo-rigid-body model (PRBM), and the Jacobian related to its differential kinematics is further derived to help designer realize dynamic analysis of the 8R compliant mechanism. In addition, the mechanism’s maximum stress existing within its workspace is tested by finite element analysis. Finally, a method to determine joint damping of the flexure hinge is presented, which aims at exploring the effect of joint damping on actuator selection and real-time control. To the authors’ knowledge, almost no existing literature concerns with this issue.

Efficacy and Safety of Cannabidiol and Tetrahydrocannabivarin on Glycemic and Lipid Parameters in Patients With Type 2 Diabetes: A Randomized, Double-Blind, Placebo-Controlled, Parallel Group Pilot Study

OBJECTIVE Cannabidiol (CBD) and D9-tetrahydrocannabivarin (THCV) are nonpsychoactive phytocannabinoids affecting lipid and glucose metabolism in animal models. This study set out to examine the effects of these compounds in patients with type 2 diabetes. RESEARCH DESIGN AND METHODS In this randomized, double-blind, placebo-controlled study, 62 subjects with noninsulin-treated type 2 diabetes were randomized to five treatment arms: CBD (100 mg twice daily), THCV (5 mg twice daily), 1:1 ratio of CBD and THCV (5 mg/5 mg, twice daily), 20:1 ratio of CBD and THCV (100 mg/5 mg, twice daily), or matched placebo for 13 weeks. The primary end point was a change in HDL-cholesterol concentrations from baseline. Secondary/tertiary end points included changes in glycemic control, lipid profile, insulin sensitivity, body weight, liver triglyceride content, adipose tissue distribution, appetite, markers of inflammation, markers of vascular function, gut hormones, circulating endocannabinoids, and adipokine concentrations. Safety and tolerability end points were also evaluated. RESULTS Compared with placebo, THCV significantly decreased fasting plasma glucose (estimated treatment difference [ETD] = 21.2 mmol/L; P < 0.05) and improved pancreatic b-cell function (HOMA2 b-cell function [ETD = 244.51 points; P < 0.01]), adiponectin (ETD = 25.9 3 106 pg/mL; P < 0.01), and apolipoprotein A (ETD = 26.02 mmol/L; P < 0.05), although plasma HDL was unaffected. Compared with baseline (but not placebo), CBD decreased resistin (2898 pg/ml; P < 0.05) and increased glucose-dependent insulinotropic peptide (21.9 pg/ml; P < 0.05). None of the combination treatments had a significant impact on end points. CBD and THCV were well tolerated. CONCLUSIONS THCV could represent a newtherapeutic agent in glycemic control in subjects with type 2 diabetes.

A comparison of three methods for detecting KRAS mutations in formalin-fixed colorectal cancer specimens.

BACKGROUND: KRAS mutation testing is required to select patients with metastatic colorectal cancer (CRC) to receive anti-epidermal growth factor receptor antibodies, but the optimal KRAS mutation test method is uncertain. METHODS: We conducted a two-site comparison of two commercial KRAS mutation kits - the cobas KRAS Mutation Test and the Qiagen therascreen KRAS Kit - and Sanger sequencing. A panel of 120 CRC specimens was tested with all three methods. The agreement between the cobas test and each of the other methods was assessed. Specimens with discordant results were subjected to quantitative massively parallel pyrosequencing (MPP). DNA blends were tested to determine detection rates at 5% mutant alleles. RESULTS: Reproducibility of the cobas test between sites was 98%. Six mutations were detected by cobas that were not detected by Sanger, and five were confirmed by MPP. The cobas test detected eight mutations which were not detected by the therascreen test, and seven were confirmed by MPP. Detection rates with 5% mutant DNA blends were 100% for the cobas and therascreen tests and 19% for Sanger. CONCLUSION: The cobas test was reproducible between sites, and detected several mutations that were not detected by the therascreen test or Sanger. Sanger sequencing had poor sensitivity for low levels of mutation.

An efficient parallel MoM to analyze microstrip structures

[EN]The increasing use of microstrip technology require more accurate analysis methods like full wave method of moments. However, this involves a great computational effort. To reduce the computation time, an alternative parallel method to analyze irregular microstrip structures is presented in this paper. This method calculates the unknown surface current on the planar structure trough a irregular rectangular division using basis and weighted functions. The parallel algorithm performs the calculus of a [Z] matrix and then solves the system using current densities as the unknowns. This parallel program was implemented in the IBM-SP2 using MPI library.

Parallel Cyclostationarity-Exploiting Algorithm for Energy-Efficient Spectrum Sensing

The evolution of wireless communication systems leads to Dynamic Spectrum Allocation for Cognitive Radio, which requires reliable spectrum sensing techniques. Among the spectrum sensing methods proposed in the literature, those that exploit cyclostationary characteristics of radio signals are particularly suitable for communication environments with low signal-to-noise ratios, or with non-stationary noise. However, such methods have high computational complexity that directly raises the power consumption of devices which often have very stringent low-power requirements. We propose a strategy for cyclostationary spectrum sensing with reduced energy consumption. This strategy is based on the principle that p processors working at slower frequencies consume less power than a single processor for the same execution time. We devise a strict relation between the energy savings and common parallel system metrics. The results of simulations show that our strategy promises very significant savings in actual devices.

A single-code software model for multiphysics analysis-engine on parallel and distributed computers with the PHYSICA toolkit

Abstract not available

Communication latency hiding in a parallel conjugate gradient method

Abstract not available

Modelling continuum mechanics phenomena using three dimensional unstructured meshes on massively parallel processors

The difficulties encountered in implementing large scale CM codes on multiprocessor systems are now fairly well understood. Despite the claims of shared memory architecture manufacturers to provide effective parallelizing compilers, these have not proved to be adequate for large or complex programs. Significant programmer effort is usually required to achieve reasonable parallel efficiencies on significant numbers of processors. The paradigm of Single Program Multi Data (SPMD) domain decomposition with message passing, where each processor runs the same code on a subdomain of the problem, communicating through exchange of messages, has for some time been demonstrated to provide the required level of efficiency, scalability, and portability across both shared and distributed memory systems, without the need to re-author the code into a new language or even to support differing message passing implementations. Extension of the methods into three dimensions has been enabled through the engineering of PHYSICA, a framework for supporting 3D, unstructured mesh and continuum mechanics modeling. In PHYSICA, six inspectors are used. Part of the challenge for automation of parallelization is being able to prove the equivalence of inspectors so that they can be merged into as few as possible.

Parallel Cyclostationarity-Exploiting Algorithm for Energy-Efficient Spectrum Sensing

The evolution of wireless communication systems leads to Dynamic Spectrum Allocation for Cognitive Radio, which requires reliable spectrum sensing techniques. Among the spectrum sensing methods proposed in the literature, those that exploit cyclostationary characteristics of radio signals are particularly suitable for communication environments with low signal-to-noise ratios, or with non-stationary noise. However, such methods have high computational complexity that directly raises the power consumption of devices which often have very stringent low-power requirements. We propose a strategy for cyclostationary spectrum sensing with reduced energy consumption. This strategy is based on the principle that p processors working at slower frequencies consume less power than a single processor for the same execution time. We devise a strict relation between the energy savings and common parallel system metrics. The results of simulations show that our strategy promises very significant savings in actual devices.

Improving drug discovery using hybrid softcomputing methods

Virtual screening (VS) methods can considerably aid clinical research, predicting how ligands interact with drug targets. Most VS methods suppose a unique binding site for the target, but it has been demonstrated that diverse ligands interact with unrelated parts of the target and many VS methods do not take into account this relevant fact. This problem is circumvented by a novel VS methodology named BINDSURF that scans the whole protein surface in order to find new hotspots, where ligands might potentially interact with, and which is implemented in last generation massively parallel GPU hardware, allowing fast processing of large ligand databases. BINDSURF can thus be used in drug discovery, drug design, drug repurposing and therefore helps considerably in clinical research. However, the accuracy of most VS methods and concretely BINDSURF is constrained by limitations in the scoring function that describes biomolecular interactions, and even nowadays these uncertainties are not completely understood. In order to improve accuracy of the scoring functions used in BINDSURF we propose a hybrid novel approach where neural networks (NNET) and support vector machines (SVM) methods are trained with databases of known active (drugs) and inactive compounds, being this information exploited afterwards to improve BINDSURF VS predictions.

Improving drug discovery using a neural networks based parallel scoring function

Virtual Screening (VS) methods can considerably aid clinical research, predicting how ligands interact with drug targets. Most VS methods suppose a unique binding site for the target, but it has been demonstrated that diverse ligands interact with unrelated parts of the target and many VS methods do not take into account this relevant fact. This problem is circumvented by a novel VS methodology named BINDSURF that scans the whole protein surface to find new hotspots, where ligands might potentially interact with, and which is implemented in massively parallel Graphics Processing Units, allowing fast processing of large ligand databases. BINDSURF can thus be used in drug discovery, drug design, drug repurposing and therefore helps considerably in clinical research. However, the accuracy of most VS methods is constrained by limitations in the scoring function that describes biomolecular interactions, and even nowadays these uncertainties are not completely understood. In order to solve this problem, we propose a novel approach where neural networks are trained with databases of known active (drugs) and inactive compounds, and later used to improve VS predictions.