bluuebunny/crossref_metadata_2025 huggingface dataset:
Beyond itemsets
Authors: Thirumuruganathan Saravanan , Rahman Habibur , Abbar Sofiane , Das Gautam
Published: May 2015

We assume a dataset of transactions generated by a set of users over structured items where each item could be described through a set of features. In this paper, we are interested in identifying the frequent featuresets (set of features) by mining item transactions. For example, in a news website, items correspond to news articles, the features are the named-entities/topics in the articles and an item transaction would be the set of news articles read by a user within the same session. We show that mining frequent featuresets over structured item transactions is a novel problem and show that straightforward extensions of existing frequent itemset mining techniques provide unsatisfactory results. This is due to the fact that while users are drawn to each item in the transaction due to a subset of its features, the transaction by itself does not provide any information about such underlying preferred features of users. In order to overcome this hurdle, we propose a featureset uncertainty model where each item transaction could have been generated by various featuresets with different probabilities. We describe a novel approach to transform item transactions into uncertain transaction over featuresets and estimate their probabilities using constrained least squares based approach. We propose diverse algorithms to mine frequent featuresets. Our experimental evaluation provides a comparative analysis of the different approaches proposed.
Large-scale distributed graph computing systems
Authors: Lu Yi , Cheng James , Yan Da , Wu Huanhuan
Published: May 2015

With the prevalence of graph data in real-world applications (e.g., social networks, mobile phone networks, web graphs, etc.) and their ever-increasing size, many distributed graph computing systems have been developed in recent years to process and analyze massive graphs. Most of these systems adopt Pregel's vertex-centric computing model, while various techniques have been proposed to address the limitations in the Pregel framework. However, there is a lack of comprehensive comparative analysis to evaluate the performance of various systems and their techniques, making it difficult for users to choose the best system for their applications. We conduct extensive experiments to evaluate the performance of existing systems on graphs with different characteristics and on algorithms with different design logic. We also study the effectiveness of various techniques adopted in existing systems, and the scalability of the systems. The results of our study reveal the strengths and limitations of existing systems, and provide valuable insights for users, researchers and system developers.
Efficient top-k simrank-based similarity join
Authors: Tao Wenbo , Yu Minghe , Li Guoliang
Published: May 2015

SimRank is a popular and widely-adopted similarity measure to evaluate the similarity between nodes in a graph. It is time and space consuming to compute the SimRank similarities for all pairs of nodes, especially for large graphs. In real-world applications, users are only interested in the most similar pairs. To address this problem, in this paper we study the
top-k SimRank-based similarity join
problem, which finds
k
most similar pairs of nodes with the largest SimRank similarities among all possible pairs. To the best of our knowledge, this is the first attempt to address this problem. We encode each node as a vector by summarizing its neighbors and transform the calculation of the SimRank similarity between two nodes to computing the dot product between the corresponding vectors. We devise an efficient two-step framework to compute top-
k
similar pairs using the vectors. For large graphs, exact algorithms cannot meet the high-performance requirement, and we also devise an approximate algorithm which can efficiently identify top-
k
similar pairs under user-specified accuracy requirement. Experiments on both real and synthetic datasets show our method achieves high performance and good scalability.
Online topic-aware influence maximization
Authors: Chen Shuo , Fan Ju , Li Guoliang , Feng Jianhua , Tan Kian-lee , Tang Jinhui
Published: May 2015

Influence maximization, whose objective is to select
k
users (called seeds) from a social network such that the number of users influenced by the seeds (called influence spread) is maximized, has attracted significant attention due to its widespread applications, such as viral marketing and rumor control. However, in real-world social networks, users have their own interests (which can be represented as topics) and are more likely to be influenced by their friends (or friends' friends) with similar topics. We can increase the influence spread by taking into consideration topics. To address this problem, we study topic-aware influence maximization, which, given a topic-aware influence maximization (TIM) query, finds
k
seeds from a social network such that the topic-aware influence spread of the
k
seeds is maximized. Our goal is to enable online TIM queries. Since the topic-aware influence maximization problem is NP-hard, we focus on devising efficient algorithms to achieve instant performance while keeping a high influence spread. We utilize a maximum influence arborescence (MIA) model to approximate the computation of influence spread. To efficiently find
k
seeds under the MIA model, we first propose a best-effort algorithm with 1 − 1/
e
approximation ratio, which estimates an upper bound of the topic-aware influence of each user and utilizes the bound to prune large numbers of users with small influence. We devise effective techniques to estimate tighter upper bounds. We then propose a faster topic-sample-based algorithm with ε · (1 − 1/
e
) approximation ratio for any ε ∈ (0, 1], which materializes the influence spread of some topic-distribution samples and utilizes the materialized information to avoid computing the actual influence of users with small influences. Experimental results show that our methods significantly outperform baseline approaches.
Walk, not wait
Authors: Nazi Azade , Zhou Zhuojie , Thirumuruganathan Saravanan , Zhang Nan , Das Gautam
Published: May 2015

In this paper, we introduce a novel, general purpose, technique for faster sampling of nodes over an online social network. Specifically, unlike traditional random walks which wait for the convergence of sampling distribution to a predetermined target distribution - a waiting process that incurs a high query cost - we develop WALK-ESTIMATE, which starts with a much shorter random walk, and then proactively estimate the sampling probability for the node taken before using acceptance-rejection sampling to adjust the sampling probability to the predetermined target distribution. We present a novel backward random walk technique which provides provably unbiased estimations for the sampling probability, and demonstrate the superiority of WALK-ESTIMATE over traditional random walks through theoretical analysis and extensive experiments over real world online social networks.
Querying with access patterns and integrity constraints
Authors: Benedikt Michael , Leblay Julien , Tsamoura Efthymia
Published: May 2015

Traditional query processing involves a search for plans formed by applying algebraic operators on top of primitives representing access to relations in the input query. But many querying scenarios involve two interacting issues that complicate the search. On the one hand, the search space may be limited by access restrictions associated with the interfaces to datasources, which require certain parameters to be given as inputs. On the other hand, the search space may be extended through the presence of integrity constraints that relate sources to each other, allowing for plans that do not match the structure of the user query.

In this paper we present the first optimization approach that attacks both these difficulties within a single framework, presenting a system in which classical cost-based join optimization is extended to support both access-restrictions and constraints. Instead of iteratively exploring subqueries of the input query, our optimizer explores a space of proofs that witness the answering of the query, where each proof has a direct correspondence with a query plan.
General incremental sliding-window aggregation
Authors: Tangwongsan Kanat , Hirzel Martin , Schneider Scott , Wu Kun-Lung
Published: May 2015

Stream processing is gaining importance as more data becomes available in the form of continuous streams and companies compete to promptly extract insights from them. In such applications, sliding-window aggregation is a central operator, and incremental aggregation helps avoid the performance penalty of re-aggregating from scratch for each window change.

This paper presents Reactive Aggregator (RA), a new framework for incremental sliding-window aggregation. RA is general in that it does not require aggregation functions to be invertible or commutative, and it does not require windows to be FIFO. We implemented RA as a drop-in replacement for the Aggregate operator of a commercial streaming engine. Given
m
updates on a window of size
n
, RA has an algorithmic complexity of
O
(
m
+
m
log (
n/m
)), rivaling the best prior algorithms for any
m
. Furthermore, RA's implementation minimizes overheads from allocation and pointer traversals by using a single flat array.
Answering why-not questions on reverse top-
k
queries
Authors: Gao Yunjun , Liu Qing , Chen Gang , Zheng Baihua , Zhou Linlin
Published: May 2015

Why-not questions, which aim to seek clarifications on the missing tuples for query results, have recently received considerable attention from the database community. In this paper, we systematically explore
why-not questions on reverse top-k queries
, owing to its importance in multi-criteria decision making. Given an initial reverse top-
k
query and a missing/why-not weighting vector set

W
m

that is absent from the query result, why-not questions on reverse top-
k
queries explain why

W
m

does not appear in the query result and provide suggestions on how to refine the initial query with minimum penalty to include

W
m

in the refined query result. We first formalize why-not questions on reverse top-
k
queries and reveal their semantics, and then propose a
unified framework
called
WQRTQ
to answer why-not questions on both
monochromatic
and
bichromatic
reverse top-
k
queries. Our framework offers three solutions, namely, (i) modifying a query point
q
, (ii) modifying a why-not weighting vector set

W
m

and a parameter
k
, and (iii) modifying
q
,

W
m

, and
k
simultaneously, to cater for different application scenarios. Extensive experimental evaluation using both real and synthetic data sets verifies the effectiveness and efficiency of the presented algorithms.
Practical authenticated pattern matching with optimal proof size
Authors: Papadopoulos Dimitrios , Papamanthou Charalampos , Tamassia Roberto , Triandopoulos Nikos
Published: May 2015

We address the problem of authenticating pattern matching queries over textual data that is outsourced to an untrusted cloud server. By employing cryptographic accumulators in a novel optimal integrity-checking tool built directly over a suffix tree, we design the first authenticated data structure for verifiable answers to pattern matching queries featuring
fast generation of constant-size proofs.
We present two main applications of our new construction to authenticate: (i) pattern matching queries over text documents, and (ii) exact path queries over XML documents. Answers to queries are verified by proofs of size at most 500 bytes for text pattern matching, and at most 243 bytes for exact path XML search, independently of the document or answer size. By design, our authentication schemes can also be parallelized to offer extra efficiency during data outsourcing. We provide a detailed experimental evaluation of our schemes showing that for both applications the times required to compute and verify a proof are very small---e.g., it takes less than 10μs to generate a proof for a pattern (mis)match of 10
2
characters in a text of 10
6
characters, once the query has been evaluated.
A performance study of big data on small nodes
Authors: Loghin Dumitrel , Tudor Bogdan Marius , Zhang Hao , Ooi Beng Chin , Teo Yong Meng
Published: May 2015

The continuous increase in volume, variety and velocity of Big Data exposes datacenter resource scaling to an energy utilization problem. Traditionally, datacenters employ x86-64 (big) server nodes with power usage of tens to hundreds of Watts. But lately, low-power (small) systems originally developed for mobile devices have seen significant improvements in performance. These improvements could lead to the adoption of such small systems in servers, as announced by major industry players. In this context, we systematically conduct a performance study of Big Data execution on small nodes in comparison with traditional big nodes, and present insights that would be useful for future development. We run Hadoop MapReduce, MySQL and in-memory Shark workloads on clusters of ARM big. LITTLE boards and Intel Xeon server systems. We evaluate execution time, energy usage and total cost of running the workloads on self-hosted ARM and Xeon nodes. Our study shows that there is no
one size fits all
rule for judging the efficiency of executing Big Data workloads on small and big nodes. But small memory size, low memory and I/O bandwidths, and software immaturity concur in canceling the lower-power advantage of ARM servers. We show that I/O-intensive MapReduce workloads are more energy-efficient to run on Xeon nodes. In contrast, database query processing is always more energy-efficient on ARM servers, at the cost of slightly lower throughput. With minor software modifications, CPU-intensive MapReduce workloads are almost four times cheaper to execute on ARM servers.
Robust local community detection
Authors: Wu Yubao , Jin Ruoming , Li Jing , Zhang Xiang
Published: May 2015

Given a large network, local community detection aims at finding the community that contains a set of query nodes and also maximizes (minimizes) a goodness metric. This problem has recently drawn intense research interest. Various goodness metrics have been proposed. However, most existing metrics tend to include irrelevant subgraphs in the detected local community. We refer to such irrelevant subgraphs as free riders. We systematically study the existing goodness metrics and provide theoretical explanations on why they may cause the free rider effect. We further develop a query biased node weighting scheme to reduce the free rider effect. In particular, each node is weighted by its proximity to the query node. We define a query biased density metric to integrate the edge and node weights. The query biased densest subgraph, which has the largest query biased density, will shift to the neighborhood of the query nodes after node weighting. We then formulate the query biased densest connected subgraph (QDC) problem, study its complexity, and provide efficient algorithms to solve it. We perform extensive experiments on a variety of real and synthetic networks to evaluate the effectiveness and efficiency of the proposed methods.
Understanding the causes of consistency anomalies in Apache Cassandra
Authors: Fan Hua , Ramaraju Aditya , McKenzie Marlon , Golab Wojciech , Wong Bernard
Published: May 2015

A recent paper on benchmarking eventual consistency showed that when a constant workload is applied against Cassandra, the staleness of values returned by read operations exhibits interesting but unexplained variations when plotted against time. In this paper we reproduce this phenomenon and investigate in greater depth the low-level mechanisms that give rise to stale reads. We show that the staleness spikes exhibited by Cassandra are strongly correlated with garbage collection, particularly the "stop-the-world" phase which pauses all application threads in a Java virtual machine. We show experimentally that the staleness spikes can be virtually eliminated by delaying read operations artificially at servers immediately after a garbage collection pause. In our experiments this yields more than a 98% reduction in the number of consistency anomalies that exceed 5ms, and has negligible impact on throughput and latency.
An efficient similarity search framework for SimRank over large dynamic graphs
Authors: Shao Yingxia , Cui Bin , Chen Lei , Liu Mingming , Xie Xing
Published: May 2015

SimRank is an important measure of vertex-pair similarity according to the structure of graphs. The similarity search based on SimRank is an important operation for identifying similar vertices in a graph and has been employed in many data analysis applications. Nowadays, graphs in the real world become much larger and more dynamic. The existing solutions for similarity search are expensive in terms of time and space cost. None of them can efficiently support similarity search over large dynamic graphs. In this paper, we propose a novel two-stage random-walk sampling framework (TSF) for SimRank-based similarity search (e.g., top-
k
search). In the preprocessing stage, TSF samples a set of one-way graphs to index raw random walks in a novel manner within
O
(
NR

g

) time and space, where
N
is the number of vertices and
R

g

is the number of one-way graphs. The one-way graph can be efficiently updated in accordance with the graph modification, thus TSF is well suited to dynamic graphs. During the query stage, TSF can search similar vertices fast by naturally pruning unqualified vertices based on the connectivity of one-way graphs. Furthermore, with additional
R

q

samples, TSF can estimate the SimRank score with probability [EQUATION] if the error of approximation is bounded by 1 -- ε. Finally, to guarantee the scalability of TSF, the one-way graphs can also be compactly stored on the disk when the memory is limited. Extensive experiments have demonstrated that TSF can handle dynamic billion-edge graphs with high performance.
Compaction management in distributed key-value datastores
Authors: Ahmad Muhammad Yousuf , Kemme Bettina
Published: May 2015

Compactions are a vital maintenance mechanism used by datastores based on the log-structured merge-tree to counter the continuous buildup of data files under update-intensive workloads. While compactions help keep read latencies in check over the long run, this comes at the cost of significantly degraded read performance over the course of the compaction itself. In this paper, we offer an in-depth analysis of compaction-related performance overheads and propose techniques for their mitigation. We offload large, expensive compactions to a dedicated
compaction server
to allow the datastore server to better utilize its resources towards serving the actual workload. Moreover, since the newly compacted data is already cached in the compaction server's main memory, we fetch this data over the network directly into the datastore server's local cache, thereby avoiding the performance penalty of reading it back from the filesystem. In fact, pre-fetching the compacted data from the remote cache
prior
to switching the workload over to it can eliminate local cache misses altogether. Therefore, we implement a smarter warmup algorithm that ensures that all incoming read requests are served from the datastore server's local cache even as it is warming up. We have integrated our solution into HBase, and using the YCSB and TPC-C benchmarks, we show that our approach significantly mitigates compaction-related performance problems. We also demonstrate the scalability of our solution by distributing compactions across multiple compaction servers.
D
2
P
Authors: Guerraoui Rachid , Kermarrec Anne-Marie , Patra Rhicheek , Taziki Mahsa
Published: May 2015

The upsurge in the number of web users over the last two decades has resulted in a significant growth of online information. This information growth calls for recommenders that personalize the information proposed to each individual user. Nevertheless, personalization also opens major privacy concerns.

This paper presents
D
2
P
, a novel protocol that ensures a strong form of differential privacy, which we call distance-based differential privacy, and which is particularly well suited to recommenders.

D
2
P
avoids revealing exact user profiles by creating
altered
profiles where each item is replaced with another one at some
distance.
We evaluate
D
2
P
analytically and experimentally on MovieLens and Jester datasets and compare it with other private and non-private recommenders.
FrogWild!
Authors: Mitliagkas Ioannis , Borokhovich Michael , Dimakis Alexandros G. , Caramanis Constantine
Published: May 2015

We propose FrogWild, a novel algorithm for fast approximation of high PageRank vertices, geared towards reducing network costs of running traditional PageRank algorithms. Our algorithm can be seen as a quantized version of power iteration that performs multiple parallel random walks over a directed graph. One important innovation is that we introduce a modification to the GraphLab framework that only partially synchronizes mirror vertices. This partial synchronization vastly reduces the network traffic generated by traditional PageRank algorithms, thus greatly reducing the per-iteration cost of PageRank. On the other hand, this partial synchronization also creates dependencies between the random walks used to estimate PageRank. Our main theoretical innovation is the analysis of the correlations introduced by this partial synchronization process and a bound establishing that our approximation is close to the true PageRank vector.

We implement our algorithm in GraphLab and compare it against the default PageRank implementation. We show that our algorithm is very fast, performing each iteration in less than one second on the Twitter graph and can be up to 7x faster compared to the standard GraphLab PageRank implementation.
Hyperglycemia-induced changes in resistin gene expression in white adipose tissue in piglets
Authors: Ocłoń Ewa , Zubel-Łojek Joanna , Latacz Anna , Pierzchała-Koziec Krystyna
Published: May 2015

Previous data strongly indicated that resistin, an adipocyte-derived signalling peptide, plays an important role in metabolism and glucose homeostasis. Thus, the aim of the present study was to examine changes in synthesis and concentration of resistin in white adipose tissue in response to hyperglycemia in piglets. In order to develop hyperglycemia, piglets (10-week-old, Polish Landrace fatteners, female) received intraperitoneal (ip) injection of 150 mg streptozotocin (HI, n=6) or 60 mg synthetic glucocorticoid (HII, n=6). An injection of NaCl physiological saline was used as a control (n=6). Plasma resistin level was significantly higher in HII group compared with the control, while no difference was observed in HI. In epicardial adipose tissue (EAT ) the resistin mRNA level significantly increased whereas the opposite effect was observed for omental fat tissue (OAT ) in both experimental groups. Additionally, the resistin concentration did not change in EAT ; however, it was decreased in omental adipose tissue in response to hyperglycemia. The results obtained indicate that activity of resistin strongly depends on glycemic status as well as adipose tissue localization.
Does the activity of producer group organizations improve the production of pigs?
Authors: Knecht Damian , Jankowska-Mąkosa Anna , Duziński Kamil
Published: May 2015

There are many works dealing with the activities of small farms, however there is a lack of papers about production and economic performance of small farms associated in producer group organizations. The aim of the study was to compare the production parameters of selected pig producer groups over two years (2010-2011). The basis for the analysis were the results of surveys carried out in 174 individual farms, which were members of 4 groups of pig producers. The study was conducted through direct interviews using a personal questionnaire. The average herd size of sows increased in the next year by 18.5% and the average annual production volume of fatteners by 9.3%. Average meatiness increased from 53.8% to 54.5%. In order to estimate the revenues a model of factors dependent on the farmer was created, expressed as the production of 1 kg of raw material. Three independent variables were introduced into the model: meatiness of fatteners (X1), the size of produced fatteners (X2), weight of fatteners (X3). The model developed in the study was proposed to groups as a tool to measure the efficiency of production and is currently being used by them. The results indicate that the activities of pig producers have a positive effect on production effectiveness and confirms the validity of horizontal integration in agriculture. Managing production in accordance with the statute imposed on the producer group showed a similar quality of produced raw materials, while the average annual sales of fatteners increased, which may contribute to the ability to negotiate purchase prices.
Perception of environment in farm animals – A review
Authors: Adamczyk Krzysztof , Górecka-Bruzda Aleksandra , Nowicki Jacek , Gumułka Małgorzata , Molik Edyta , Schwarz Tomasz , Earley Bernadette , Klocek Czesław
Published: May 2015

Perception of the environment by farm animals is fundamental for expression of behaviour and of their adaptation to different environmental conditions. From a breeding-environmental perspective, perception becomes increasingly important when a production system negatively impacts on animals such that their normal expression of behaviour is compromised. Therefore, research on the perceptual abilities of farm animals is of crucial importance to understand the animalenvironment relationship. This review is focused on research related to sensory perception of farm animals. It should be stressed that the world of animal senses is very difficult to explore, we have limited knowledge of the complexity of the animal’s ability to perceive and process environmental stimuli.
Prediction of Pork Belly Composition Using the Computer Vision Method on Transverse Cross-Sections
Authors: Čítek Jaroslav , Stupka Roman , Okrouhlá Monika , Vehovský Karel , Stádník Luděk , Němečková Dana , Šprysl Michal
Published: May 2015

The objective of this study was to identify the pig belly characteristics and to develop regression equations predicting its composition. Based on video image and chemical analysis of 216 bellies, the predictive variables were selected according to their relation to chemically determined belly lipid contents. To estimate the belly fat percentage (BF%), the two best equations constructed were: Equation 1: BF% = 49.960 - 0.7174 × SHME2 + 0.5047 × HE2A (R2 = 0.66, RMSE = 3.22); Equation 2: BF% = 43.888 - 0.6014 × SHME2 + 0.4769 × HE2A + 0.0014 × ARTO2 - 0.2697 × HE3A (R2 = 0.70, RMSE = 2.25), where: SHME2 = lean meat percentage area of the belly 2 from total cut area, HE2A = the Belly2 height at point 1, ARTO2 = the Belly2 total cut area, HE3A = the Belly3 height at point 1. Compared to lean meat, the percentage of belly fat (BF%) appears to be a more appropriate criterion for the objective evaluation of belly composition due to the simplicity and accuracy of the final regression equation (higher R2).
Historical occurrence and extinction of Atlantic salmon in the River Elbe from the fourteenth to the twentieth centuries
Authors: Andreska Jan , Hanel Lubomír
Published: May 2015

Data on the occurrence, biology, and historical background of the Atlantic salmon, Salmo salar L., (Pisces, Salmoniformes) in the Elbe river basin (Europe, North Sea drainage area) with a focus on Bohemian territory (Central Europe) from the fourteenth to twentieth centuries are summarized in this paper. Historical methods of salmon fishing in Central Europe and historical legal protection of salmon in Bohemia are presented. The salmon is a model example of species which was extirpated as a result of anthropogenic changes in the landscape and rivers in some water systems. The human activities, such as stream bed regulation, dam system construction, other migration barriers, water pollution, fisheries exploitation, that led to the extirpation of Atlantic salmon in the Elbe river basin (are discussed. The last sporadic migrating native salmon were registered in the Bohemian section of the Elbe river basin in the mid twentieth century.
Toxoplasmosis in immunocompetent and immunocompromised population of Constanţa, Romania
Authors: Rugină S. , Dumitru Irina Magdalena , Dumitru E.
Published: May 2015

We analyzed a total of 412 adult patients diagnosed with toxoplasmosis in the Clinical Infectious Diseases Hospital Constanta between 01Jan 2010 - 01 Jan 2015. Of these patients, 82.03% were from urban area, 74% female, majority aged 30-48 years. 3.15% were diagnosed with HIV infection (13 patients), in four of these patients, toxoplasmosis was the primary clinical manifestation. The most common clinical manifestation in nonHIV infected patients was painless cervical adenopathy (106 patients), 49 patients had associated infection with Toxocara and in HIV infected patients prevailed cerebral toxoplasmosis (toxoplasmic encephalitis, with or without focal CNS lesions). 59 pregnant women (6 with acute infection and 53 with chronic infection) were followed during pregnancy. Reporting the number of cases of toxoplasma infection in Constanta population (254.693 inhabitants), we obtain a prevalence of 161.76 cases/100.000 inhabitants. Most of the patients were female and their supervision is required for possible implications in pregnancy. We believe that Toxoplasma infection is underdiagnosed in our county.
Banking Competition and Efficiency: Empirical Analysis on the Bosnia and Herzegovina Using Panzar-Rosse Model
Authors: Memić Deni
Published: May 2015

Background: Competition in the banking industry has been an important topic in the scientific literature as researchers tried to assess the level of competition in the banking sector. Objectives: This paper has an aim to investigate the market structure and a long term equilibrium of the banking market in Bosnia and Herzegovina nationwide as well as on its constitutional entities as well as to evaluate the monopoly power of banks during the years 2008-2012. Methods/Approach: The paper is examining the market structure using the most frequently applied measures of concentration k-bank concentration ratio (CRk) and Herfindahl-Hirschman Index (HHI) as well as evaluating the monopoly power of banks by employing Panzar-Rosse “H-statistic”. Results: The empirical results using CRk and HHI show that Bosnia and Herzegovina banking market has a moderately concentrated market with a concentration decreasing trend. The Panzar-Rosse “H-statistic” suggests that banks in Bosnia and Herzegovina operate under monopoly or monopolistic competition depending on the market segment. Conclusions: Banks operating on the banking market in Bosnia and Herzegovina seem to be earning their total and interest revenues under monopoly or perfectly collusive oligopoly.
Investigating the roles of vocabulary knowledge and word recognition speed in Chinese language listening
Authors: Cai Wei
Published: May 2015

This study examines the roles of vocabulary knowledge and word recognition speed in Chinese listening proficiency. A standardized listening proficiency test and a self-designed vocabulary knowledge test were used to measure participants’ listening proficiency and vocabulary knowledge respectively. The gating method was used to examine participants’ word recognition speed. The result shows a high correlation between vocabulary knowledge and listening proficiency and a high medium correlation between word recognition speed and listening proficiency. In terms of the contributions of vocabulary knowledge and word recognition speed to listening proficiency, the result shows that vocabulary knowledge contributes to 77.1% of listening proficiency and is a stronger predictor of listening proficiency. In contrast, word recognition speed does not contribute over or beyond vocabulary knowledge to listening proficiency.
Discriminant indices for distinguishing thalassemia and iron deficiency in patients with microcytic anemia: a meta-analysis
Authors: Hoffmann Johannes J.M.L. , Urrechaga Eloísa , Aguirre Urko
Published: May 2015

More than 40 mathematical indices have been proposed in the hematological literature for discriminating between iron deficiency anemia and thalassemia trait in subjects with microcytic red blood cells (RBCs). None of these discriminant indices is 100% sensitive and specific and also the ranking of the discriminant indices is not consistent. Therefore, we decided to conduct the first meta-analysis of the most frequently used discriminant indices.

An extensive literature search yielded 99 articles dealing with 12 indices that were investigated five or more times. For each discriminant index we calculated the diagnostic odds ratio (DOR) and summary ROC analysis was done for comparing the performance of the indices.

The ratio of microcytic to hypochromic RBCs (M/H ratio) showed the best performance, DOR=100.8. This was significantly higher than that of all other indices investigated. The RBC index scored second (DOR=47.0), closely followed by the Sirdah index (DOR=46.7) and the Ehsani index (DOR=44.7). Subsequently, there was a group of four indices with intermediate and three with lower DOR. The lowest performance (DOR=6.8) was found for the RDW (Bessman index). Overall, the indices performed better for adults than for children.

The M/H ratio outperformed all other discriminant indices for discriminating between iron deficiency anemia and thalassemia trait. Although its sensitivity and specificity are not high enough for making a definitive diagnosis, it is certainly of value for identifying those subjects with microcytic RBC in whom diagnostic tests for confirming thalassemia are indicated.
In vitro and in vivo analysis of human fibroblast reprogramming and multipotency
Authors: Pang Rongqing , Zhu Xiangqing , Geng Jia , Zhang Yongyun , Wang Qiang , He Jie , Wang Jinxiang , Zhu Guangxu , Xiong Fu , Zhang Cheng , Ruan Guangping , Pan Xinghua
Published: May 2015

Multipotent stem cells have potential therapeutic roles in the treatment of Duchenne muscular dystrophy (DMD). However, the limited access to stem cell sources restricts their clinical application. To address this issue, we established a simple in vitro epigenetic reprogramming technique in which skin fibroblasts are induced to dedifferentiate into multipotent cells. In this study, human fibroblasts were isolated from circumcised adult foreskin and were reprogrammed by co-culture for 72 h with fish oocyte extract (FOE) in serum-free medium. The cells were then observed and analyzed by immunofluorescence staining, flow cytometry and in vitro differentiation assays. Then FOE-treated human fibroblasts were transplanted by tail vein injection into irradiated mdx mice, an animal model of DMD. Two months after injection, the therapeutic effects of FOE-treated fibroblasts on mdx skeletal muscle were evaluated by serum creatine kinase (CK) activity measurements and by immunostaining and RT-PCR of human dystrophin expression. The results indicated that the reprogrammed fibroblasts expressed higher levels of the pluripotent antigen markers SSEA-4, Nanog and Oct-4, and were able to differentiate in vitro into adipogenic cells, osteoblastic cells, and myotube-like cells. Tail vein injection of FOE-treated fibroblasts into irradiated mdx mice slightly reduced serum CK activity and the percentage of centrally nucleated myofibers two months after cell transplantation. Furthermore, we confirmed human dystrophin protein and mRNA expression in mdx mouse skeletal muscle. These data demonstrated that FOE-treated fibroblasts were multipotent and could integrate into mdx mouse myofibers through the vasculature.
The role of fructose in metabolism and cancer
Authors: Charrez Bérénice , Qiao Liang , Hebbard Lionel
Published: May 2015

Fructose consumption has dramatically increased in the last 30 years. The principal form has been in the form of high-fructose corn syrup found in soft drinks and processed food. The effect of excessive fructose consumption on human health is only beginning to be understood. Fructose has been confirmed to induce several obesity-related complications associated with the metabolic syndrome. Here we present an overview of fructose metabolism and how it contrasts with that of glucose. In addition, we examine how excessive fructose consumption can affect de novo lipogenesis, insulin resistance, inflammation, and reactive oxygen species production. Fructose can also induce a change in the gut permeability and promote the release of inflammatory factors to the liver, which has potential implications in increasing hepatic inflammation. Moreover, fructose has been associated with colon, pancreas, and liver cancers, and we shall discuss the evidence for these observations. Taken together, data suggest that sustained fructose consumption should be curtailed as it is detrimental to long-term human health.
Red blood cells in Rett syndrome: oxidative stress, morphological changes and altered membrane organization
Authors: Ciccoli Lucia , De Felice Claudio , Leoncini Silvia , Signorini Cinzia , Cortelazzo Alessio , Zollo Gloria , Pecorelli Alessandra , Rossi Marcello , Hayek Joussef
Published: May 2015

In this review, we summarize the current evidence on the erythrocyte as a previously unrecognized target cell in Rett syndrome, a rare (1:10 000 females) and devastating neurodevelopmental disorder caused by loss-of-function mutations in a single gene (i.e.MeCP2,CDKL5, or rarelyFOXG1). In particular, we focus on morphological changes, membrane oxidative damage, altered membrane fatty acid profile, and aberrant skeletal organization in erythrocytes from patients with typical Rett syndrome andMeCP2gene mutations. The beneficial effects of ω-3 polyunsaturated fatty acids (PUFAs) are also summarized for this condition to be considered as a ‘model’ condition for autism spectrum disorders.
Approximate generalized derivations close to derivations in Lie C
*-algebras
Authors: Eshaghi Madjid , Abbaszadeh Sadegh
Published: May 2015

We apply a fixed point theorem to prove that there exists a unique
derivation close to an approximately generalized derivation in Lie
C
*-algebras. Also, we prove the hyperstability of generalized
derivations. In other words, we find some conditions under which an
approximately generalized derivation becomes a derivation.
Performance Analysis of Remote Desktop Virtualization based on Hyper-V versus Remote Desktop Services
Authors: Darabont Örs , Kiss Konrád József , Domokos József
Published: May 2015

The fast spread of computer networks and broadband Internet access, and also the development of different operating systems, makes possible to use different virtualization techniques and virtual machines. The release and spread of virtualization platforms makes possible the development of cost-effective information systems that can provide in addition dynamic resource management and simplified system administration.

In this paper we present a comparative performance analysis of Remote Desktop Virtualization based on Hyper-V versus Remote Desktop Services. We introduce system architecture for the two tested scenario and test environment including detailed hardware description.

The main conclusions of the paper are that despite the higher acquisition and maintenance costs, the Remote Desktop Services outperforms the Hyper-V based Remote Desktop Virtualization in memory, CPU and also storage management.
Hardware Implementation of a Neuro-Fuzzy Controller Using High Level Synthesis Tool
Authors: Tămas Tibor , Brassai Sándor Tihamér
Published: May 2015

The purpose of this work is to present the design flow and the implementation of a neuro-fuzzy controller Intellectual Property (IP) core, using High Level Synthesis (HLS) tool. The realized IP core is designed for FPGA based embedded system architectures. The implemented control algorithm is a Sugeno model based Adaptive Neuro-Fuzzy Inference System (ANFIS). The optimization possibilities using the HLS tool and the designing of the interfaces for the IP core are presented.
Kinematic Analysis of 2 DoF Spherical Mechanism Applying Constraint Equations
Authors: Tolvaly-Rosca Ferenc , Papp István
Published: May 2015

Constraint equations for complex robot structures can lead to a large number of equations. Also, constraint equations permits universal solutions for various mechanisms and solving a large number of equations can be simplified with numerical solutions. Therefore, if discreet solutions are allowed, a universal way to determine the necessary control parameters of a mechanism for different positions, or corresponding positions for different driving parameters is to use constraint equations. A direct kinematical analysis of a 2 DoF spherical mechanism with two driving axes is presented; a numerical simulation is made for given arm dimensions; according to specified degrees of freedom, a simplified CAD model is built and driven with the angular parameters.
Cataract surgery today and 20 years ago
Authors: Rozegnał-Madej Agnieszka , Żarnowski Tomasz
Published: May 2015

Introduction. Cataract surgery is one of the most important surgical procedures in ophthalmology.

Aim. The aim of this study is to compare cataract surgeries performed in 1994 and 2014.

Material and methods. A retrospective analysis of 100 cataract procedures in 1994, as well as a total of 100 cataract procedures performed in 2014. The authors considered the following factors: age, sex, vision acuity, cataract type, preoperative patient preparation, intra- and postoperative complications, and total hospitalization time.

Results. Back in 1994, extracapsular cataract extraction (ECCE) was the most common treatment technique. It caused more intraoperative complications (46) and postoperative complications (38) and longer total hospitalization time (9.25 days±3.25 SD). In 2014, all procedures were performed using phacoemulsification. As a result, the number of intraoperative (20) and postoperative (14) complications has dropped significantly. Total hospitalization time was also reduced (1.53 days±1.08 SD).

Conclusions. Phacoemulsification significantly improved cataract treatment. This method is much safer and more effective than ECCE.
Ovarian cancer: early detection, angiogenesis, lymphangiogenesis and current prospects for therapy
Authors: Wertel Iwona , Bednarek Wiesława , Czekierdowski Artur , Kotarski Jan
Published: May 2015

I Chair and Department of Gynecological Oncology and Gynecology is a specialist research center providing help in diagnostics and treatment of gynecological malignancies. The research work is focused on the processes of angiogenesis and lymphangiogenesis. Development of blood and lymphatic vessels is subject to research in a wide range of malignancies, including ovarian cancer, endometrial cancer and uterine sarcomas. Angiogenesis in malignancies of the female genital tract is investigated by using some modern 3D sonography that uses high-definition blood flow imaging. Ovarian Tumors and Early Ovarian Cancer Detection unit was established in 2002 and since that time more than 3500 patients with difficult to diagnose tumors have been consulted and treated in the Department. Ovarian cancer immunology studies are the second leading research fiekld in the 1st Chair Department of Gynecological Oncology and Gynecology. The Department is well equipped with diagnostic devices as well as a scientific laboratory. This allows for studies in the fields of imaging of masses, their immunology, biochemistry and molecular biology. Understanding immunological response in patients with ovarian cancer is the key to develop new, effective therapies, including immunological vaccines. In this area we are cooperating with prominent international research centers: Department of Surgery, University of Michigan and Department of Microbiology and Immunology, University of Arkansas. Results of our research are published in both Polish and international journals specializing in fields of gynecology, oncology, immunology and basic science.
Capillaroscopic patterns in patients with systemic sclerosis, psoriasis and alopecia and their correlations with serum concentrations of several angiogenic markers
Authors: Chodorowska Grażyna , Michalska-Jakubus Małgorzata , Bartosińska Joanna , Gerkowicz Agnieszka , Adamczyk Michał , Krasowska Dorota
Published: May 2015

Introduction. Capillaroscopy is a non-invasive imaging method that allows cutaneous microcirculation to be analyzed. During the last decades, a diagnostic and prognostic potential of nailfold capillaroscopy (NVC) has been gaining increasing appreciation. The main indications include Raynaud phenomenon and scleroderma spectrum diseases, however the usefulness of this technique is also suggested in a variety of non-rheumatic diseases.

Aim. To assess capillaroscopic patterns in systemic scleroderma (SSc), psoriasis (PV), psoriatic arthritis (PsA), alopecia areata (AA) and androgenetic alopecia. To evaluate serum levels of several endothelial and angiogenic markers, and their relation to capillaroscopic pattern.

Material and methods. There were evaluated 295 patients with systemic scleroderma (SSc), psoriasis (PV), psoriatic arthritis (PsA), alopecia areata (AA) and androgenetic alopecia, as well as age- and sex-matched controls, were examined. In each subject, NVC was performed and serum concentration levels of several angiogenic markers.

Results. In SSc three NVC patterns: early, active and late were distinguished. Angiopoietin-2 concentrations were higher and andothelial microparticles were lower in patients with late NVC pattern. We found several differences between the NVC pattern in PV and PsA. No correlations between NVC pattern and serum levels of angiogenic markers were revealed. In AA, we distinguished both normal and abnormal NVC patterns, although the normal patterns were more frequent. Branching capillaries and features of neoformation were often present in patients with the abnormal pattern. In androgenetic alopecia, the normal NVC pattern was most frequently present, however, we found several statistically significant capillarosopic alterations, like branching capillaries, features of neoformation and altered distribution of capillaries.

Discussion and Conclusions. Serum levels of Ang-2 and EMPs may reflect capillary damage in SSc. NVC pattern varies between PV and PsA patients. The presence of abnormal NVC patterns in alopecia patients might show the role of disturbances in microcirculation in the diseases. Further studies are required to confirm the hypothesis.