Miracle-dz/UniFAR-FTUs huggingface dataset:
Actin binding domain of filamin distinguishes posterior from anterior actin filaments in migrating Dictyostelium cells

Actin filaments in different parts of a cell interact with specific actin binding proteins (ABPs) and perform different functions in a spatially regulated manner. However, the mechanisms of those spatially-defined interactions have not been fully elucidated. If the structures of actin filaments differ in different parts of a cell, as suggested by previous in vitro structural studies, ABPs may distinguish these structural differences and interact with specific actin filaments in the cell. To test this hypothesis, we followed the translocation of the actin binding domain of filamin (ABDFLN) fused with photoswitchable fluorescent protein (mKikGR) in polarized Dictyostelium cells. When ABDFLN-mKikGR was photoswitched in the middle of a polarized cell, photoswitched ABDFLN-mKikGR rapidly translocated to the rear of the cell, even though actin filaments were abundant in the front. The speed of translocation (>3 μm/s) was much faster than that of the retrograde flow of cortical actin filaments. Rapid translocation of ABDFLN-mKikGR to the rear occurred normally in cells lacking GAPA, the only protein, other than actin, known to bind ABDFLN. We suggest that ABDFLN recognizes a certain feature of actin filaments in the rear of the cell and selectively binds to them, contributing to the posterior localization of filamin.
Privacy preserving set intersection based on bilinear groups

We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication complexities (N is the number of parties in the protocol). Our protocol is obtained in the malicious model, in which we assume a probabilistic polynomial-time bounded adversary actively controls a fixed set of t (t < N/2) parties. We use a (t + 1,N)-threshold version of the Boneh-Goh-Nissim (BGN) cryptosystem whose underlying group supports bilinear maps. The BGN cryptosystem is generally used in applications where the plaintext space should be small, because there is still a Discrete Logarithm (DL) problem after the decryption. In our protocol the plaintext space can be as large as bounded by the security parameter τ, and the intractability of DL problem is utilized to protect the private datasets. Based on the bilinear map, we also construct some efficient non-interactive proofs. The security of our protocol can be reduced to the common intractable problems including the random oracle, subgroup decision and discrete logarithm problems. The computation complexity of our protocol is O(NS2τ3) (S is the cardinality of each party's dataset), and the communication complexity is O(NS2τ) bits. A similar work by Kissner et al. (2006) needs O(N2S2τ3) computation complexity and O(N2S2τ) communication complexity for the same level of correctness as ours.
Infrastructural Innovation: Flexibility, Generativity and the Mobile Internet

This article addresses issues related to how to enable broadest possible innovative activities by infrastructural technology design. The authors focus on the development of high level services based on mobile telecommunication technologies. The focus of their analysis is how features of the technology enable or constrain innovations. They do so by looking at embryos of the Mobile Internet (primarily the Norwegian CPA platform, but also two pre-CPA platforms in Norway and Japanâ€™s i-mode) through the concepts of end-to-end architecture, programmability of terminals and generativity. This analysis illustrates that the change from closed infrastructures like MobilInfo and SMSinfo to more open ones like CPA and i-mode increased the speed and range of innovations substantially. At the same time the differences between CPA and i-mode regarding programmability of terminals, and the billing service provided by the CPA network enabling the billing of individual transactions, also contributed to basically the same speed and range of innovations around CPA as i-mode in spite of the huge differences in investments into the networks made by the owners. The analysis also points out important differences between the Internet and the existing Mobile Internet regarding technological constrains on innovations. It points out important ways in which powerful actorsâ€™ strategies inhibit innovations and how they embed their strategies into the technology and creates technological barriers for innovation.
Deconstruction and Reconstruction of Legal Education in China: Legitimacy and Diffusion of an Academic Discipline from 1949 to 2012

Using documentary data, we investigate the evolution of legal education in China from 1949 to 2012. During this period, legal education evolved from an illegitimate practice to a legitimate practice over three distinct periods of nullification, reconstruction, and rationalization. Textual data suggest that the legitimization of legal education has been constituted and driven by three social forces: organizational ecology, the domestic institutional environment, and world culture. Their functioning and interplay have shaped the institutionalization of legal education in China. Our analysis indicates that the legitimacy granted to legal education by the state is the key force in driving institutionalization, that the world society provides models for imitation, and that the influence of organizational ecology is derived largely from state initiatives. The findings point to a more holistic picture of the diffusion of educational practices operating at multiple levels in a socialist society.
Learning and Extending Lexical Ontologies by using Machine Learning Methods

In this paper design of relationship links for extraction of semantic information especially for a visual corpus of architecture, on a case study of historical relics is discussed. Further definition of relationship functions between entities -or terms with related attributesare shown by a visual graph or simple formula. Domain dependent designs of relationship as a part of ontology development for the selected corpus, and based on it implementation of tools like protégé are presented. It concludes with conceptual sketch of one application of this model for layout learning semantic information access of the architectural corpora.
Inequality of Learning in Industrialised Countries

Within-country differences in educational outcomes are compared for a large group of industrialised countries. We investigate where inequality is greatest, the association between inequality in learning and average levels of learning, the interpretation of measured levels of inequality, and differences in inequality at the top and bottom of the national distributions. Our analysis is based on test score data for 21 countries present in the Trends in International Mathematics and Science Study (TIMSS), the Programme for International Student Assessment (PISA), and the Progress in International Reading Literacy Study (PIRLS). The use of three different surveys avoids reliance on a single source.
On construction of k-wise independent random variables

A 0–1probability space is a probability space (Ω, 2Ω,P), where the sample space Ω⊂-{0, 1} n for somen. A probability space isk-wise independent if, whenY i is defined to be theith coordinate or the randomn-vector, then any subset ofk of theY i 's is (mutually) independent, and it is said to be a probability spacefor p1,p2, . ,p n ifP[Y i =1]=p i .
Clustering with case-based reasoning for wireless sensor network

In wireless sensor network one of the key issues is how to maximize the network lifetime since it consists of sensor nodes of limited energy. Numerous cluster-based routing schemes have been proposed for sensor networks. Here various important factors such as sensing coverage and distribution of live nodes need to be effectively accounted in forming the clusters. In this paper we propose a new scheme which considers the nodes' remaining energy, distance between the nodes, and sensor coverage in clustering the nodes. We also employ the case-based reasoning technique in the clustering process. Compared with the existing cluster-based protocols such as LEACH and Coverage-Preserving protocol through computer simulation, the proposed scheme allows substantially enhanced network lifetime and coverage. Especially, it is more effective when the network has been used for a while and thus some nodes have become inoperable.
of the Annual Meeting of the Cognitive Science Society Title Predicting Noun and Verb Latencies : Influential Variables and Task Effects Permalink

Natural language comprehension involves processing a multitude of words that vary along many dimensions, some of which may reflect statistical regularities in language. These variables may differ in their relative importance across various types of words and tasks. This study used a multiple regression approach to investigate potentially important predictors of noun-verb processing across naming, grammatical categorization, and sentence completion tasks. Although there were some indications of different predictors for nouns vs verb processing, the strongest predictors of response latencies were primarily determined by the types of processing most important for a given task. One variable of particular interest was the newly created Noun-Verb Distributional Difference (NVDD) metric developed by Chiarello et al. (1999). NVDD values reflect statistical regularities in language regarding the typicality of the contexts in which nouns and verbs tend to occur. The results suggest that although noun-verb typicality, as assessed via the NVDD, is a valid measure of regularities in noun-verb contexts within a linguistic corpus, individuals may not be very sensitive to this dimension in standard psycholinguistic processing tasks.
Study on fast rough alignment for two-stage protein structure comparison algorithm

This paper presents a preliminary study on fast rough alignment for two-stage protein structure comparison (PSC) algorithm. In this paper, we proposed a new two-stage PSC algorithm. In the previous research, nongeometric protein information has been studied and applied in proposed PSC algorithm. The preliminary experiment result reveals that nongeometric information, especially biochemical information, is very useful in rough alignment stage of proposed two-stage PSC algorithm.
Service differentiation of communication-bound processes in a real-time operating system

The majority of today's Internet-based services are generally not concerned about the level of quality of service (QoS) presented to their users. For many such services, however, the QoS perceived by users is becoming a critical success factor. The main QoS attributes include those related to the service availability and timeliness. Ensuring them is essential to many services. In our opinion, this has to be achieved not only by providing services with appropriate access bandwidth, or through QoS awareness of the network communication protocols used, but also by means of a differentiation of the usage of system resources by server processes. We focus on Internet-based multimedia data delivery services (e.g., services provided by Web, FTP and video-on-demand servers). These services are run by processes whose activity is typically dominated by network communication; we call them communication-bound processes. We present the design and implementation of an operating system extension for quality-of-service differentiation among classes of communication-bound processes. The system allows to define classes of services with different quality attributes concerning the network data delivery performance. The proposed architecture provides server application developers with an object-based communication library (similar to the standard TCP/IP socket library), that supports different classes of service. Implementation issues and optimization strategies are also discussed. Quantitative measures aimed at evaluating the effectiveness of the proposed architecture are provided.
The cutting EDGE of IP router configuration

Human error in configuring routers undermines attempts to provide reliable, predictable end-to-end performance on IP networks. Manual configuration, while expensive and error-prone, is the dominant mode of operation, especially for large enterprise networks. These networks often lack the basic building blocks---an accurate equipment inventory, a debugged initial configuration, and a specification of local configuration policies---to support the holy grail of automation. We argue the migrating an existing network to automated configuration is a rich and challenging research problem rooted in data analysis and in the modeling of network protocols and operational practices. We propose a novel, bottom-up approach that proceeds in three phases: (i)analysis of configuration data to summarize the existing network state and uncover configuration problems; (ii) data mining to identify the network's local configuration policies and violations of these policies; and ultimately (iii)boot-strapping of a database to drive future configuration changes. The first stage reduces the number of errors, the second normalizes the local policies, and the third prevents new errors and reduces the manpower needed to configure the network. We describe the architecture of our EDGE tool for steps (i) and (ii), and present some examples from our experiences applying the tool to several large enterprise networks.
Adhesion, Biofilm Formation, and Genomic Features of Campylobacter jejuni Bf, an Atypical Strain Able to Grow under Aerobic Conditions

Campylobacter jejuni is the leading cause of bacterial enteritis in Europe. Human campylobacteriosis cases are frequently associated to the consumption of contaminated poultry meat. To survive under environmental conditions encountered along the food chain, i.e., from poultry digestive tract its natural reservoir to the consumer’s plate, this pathogen has developed adaptation mechanisms. Among those, biofilm lifestyle has been suggested as a strategy to survive in the food environment and under atmospheric conditions. Recently, the clinical isolate C. jejuni Bf has been shown to survive and grow under aerobic conditions, a property that may help this strain to better survive along the food chain. The aim of this study was to evaluate the adhesion capacity of C. jejuni Bf and its ability to develop a biofilm. C. jejuni Bf can adhere to abiotic surfaces and to human epithelial cells, and can develop biofilm under both microaerobiosis and aerobiosis. These two conditions have no influence on this strain, unlike results obtained with the reference strain C. jejuni 81-176, which harbors only planktonic cells under aerobic conditions. Compared to 81-176, the biofilm of C. jejuni Bf is more homogenous and cell motility at the bottom of biofilm was not modified whatever the atmosphere used. C. jejuni Bf whole genome sequence did not reveal any gene unique to this strain, suggesting that its unusual property does not result from acquisition of new genetic material. Nevertheless some genetic particularities seem to be shared only between Bf and few others strains. Among the main features of C. jejuni Bf genome we noticed (i) a complete type VI secretion system important in pathogenicity and environmental adaptation; (ii) a mutation in the oorD gene involved in oxygen metabolism; and (iii) the presence of an uncommon insertion of a 72 amino acid coding sequence upstream from dnaK, which is involved in stress resistance. Therefore, the atypical behavior of this strain under aerobic atmosphere may result from the combination of insertions and mutations. In addition, the comparison of mRNA transcript levels of several genes targeted through genome analysis suggests the modification of regulatory processes in this strain.
BER performance of turbo coded multi-hop networks using iterative channel information estimation scheme

In this paper, the bit error rate (BER) performance of turbo coded multi-route multi-hop networks is presented. Multi-hop networks have received much attention in recent years because of their large channel capacity. When the information bit streams are transmitted over multiple routes, a route diversity effect would also be possible. In order to improve the route diversity effect the receiver side should carry out the decoding process taking route conditions for each route into account. However, it is difficult for the receiver side to know the condition of the whole of a route because of multi-hopping. To cope with this problem, the system dealt with in this paper uses a channel information estimation scheme that exploits the number of error-corrected bits in the decoding process to estimate the route condition. The BER performance is investigated by computer simulations under an additive white gaussian noise and a flat Rayleigh fading environment. As the result, the channel information estimation scheme works well in Rayleigh fading environment as well. The advantage of this estimation scheme is that it needs no parity check bits that are indispensable in the conventional scheme.
Effects of Combined Therapy with Ezetimibe Plus Simvastatin After Drug-Eluting Stent Implantation in a Porcine Coronary Restenosis Model

The aim of this study was to examine the anti-proliferative and anti-inflammatory effects of ezetimibe/simvastatin (E/S) after drug-eluting stent (DES) implantation in a porcine coronary restenosis model. Pigs were randomized into two groups in which the coronary arteries (23 pigs) had DES. Stents were deployed with oversizing (stent/artery ratio 1.3:1) in porcine coronary arteries. Fifteen pigs were taken 10/20 mg of E/S and eight pigs were not taken E/S. Histopathologic analysis was assessed at 28 days after stenting. In neointima, most inflammatory cells were lymphohistiocytes. Lymphohistiocyte count was not different between two groups (337±227 vs. 443±366 cells, P=0.292), but neointima area was significantly smaller (1.00±0.49 mm2 vs. 1.69±0.98 mm2, P=0.021) and percent area stenosis was significantly lower (23.3±10% vs. 39±19%, P=0.007) in E/S group compared with control group. There were no significant differences in fibrin score (1.99±0.79 vs. 1.81±0.88, P=0.49), endothelial score (1.75±0.66 vs. 1.80±0.59, P=0.79), and the percent of endothelium covered lumen (43±21% vs. 45±21%, P=0.84) between E/S group and control group. Combined therapy with ezetimibe and simvastatin inhibits neointimal hyperplasia, but does not inhibit inflammatory infiltration and arterial healing after DES implantation in a porcine coronary restenosis model.
A Note on Dijkstra's Shortest Path Algorithm

An assertion that Dijkstra's algorithm for shortest paths (adapted to allow arcs of negative weight) runs in <italic>O</italic>(<italic>n</italic><supscrpt>3</supscrpt>) steps is disproved by showing a set of networks which take <italic>O</italic>(<italic>n</italic>2<supscrpt><italic>n</italic></supscrpt>) steps.
Influence of Five Potential Anticancer Drugs on Wnt Pathway and Cell Survival in Human Biliary Tract Cancer Cells

Background: The role of Wnt signalling in carcinogenesis suggests compounds targeting this pathway as potential anti-cancer drugs. Several studies report activation of Wnt signalling in biliary tract cancer (BTC) thus rendering Wnt inhibitory drugs as potential candidates for targeted therapy of this highly chemoresistant disease. Methods: In this study we analysed five compounds with suggested inhibitory effects on Wnt signalling (DMAT, FH535, myricetin, quercetin, and TBB) for their cytotoxic efficiency, mode of cell death, time- and cell line-dependent characteristics as well as their effects on Wnt pathway activity in nine different BTC cell lines. Results: Exposure of cancer cells to different concentrations of the compounds results in a clear dose-dependent reduction of viability for all drugs in the order FH535 > DMAT > TBB > myricetin > quercetin. The first three substances show high cytotoxicity in all tested cell lines, cause a direct cytotoxic effect by induction of apoptosis and inhibit pathway-specific signal transduction in a Wnt transcription factor reporter activity assay. Selected target genes such as growth-promoting cyclin D1 and the cell cycle progression inhibitor p27 are down- and up-regulated after treatment, respectively. Conclusions: Taken together, these data demonstrate that the small molecular weight inhibitors DMAT, F535 and TBB have a considerable cytotoxic and possibly Wnt-specific effect on BTC cell lines in vitro. Further in vivo investigation of these drugs as well as of new Wnt inhibitors may provide a promising approach for targeted therapy of this difficult-to-treat tumour.
From Ambiguous Words to Key-Concept Extraction

Automatic acquisition of keywords for given document is still an area of active research. In this paper, we consider shift from keyword-based representation to other perspective on representation of document's focus in form of key-concepts. The advantage of using concepts over simple words is that concepts, apart from words, are unambiguous. This leads to better understanding of key-concepts than keywords. We present novel method of key-concept extraction, which provides an efficient way of automatic acquisition of key-concepts in machine processing. We evaluate our approach on classification problem, where we compare it to baseline TF-IDF keyword model and present its competitive results. We discuss its potential of its utilisation on the Web.
Interleaving Temporal Planning and Execution: IXTET-EXEC

Execution control of plans is a very active domain of research, but remains a major challenge when performed on board real autonomous mobile robots. In such a context, where execution concurrency, resources contention and environment dynamic characterize the domain, the use of a temporal planner and a temporal executive whose processes are interleaved is desirable. In this paper, we propose a framework to integrate deliberative planning, plan repair and execution control in a dynamic environment with real-time constraints. It is based on lifted partial order temporal planning techniques which produce flexible plans and allow, under certain conditions discussed in the paper, plan repair interleaved with plan execution. This framework has been implemented using the planning system IXTET, integrated in the LAAS architecture in interac∗Travail realise en collaboration avec le CNES et ASTRIUM. tion with a procedural executive, tested in simulation and deployed on an ATRV robotic platform.
Robust coding for uncertain sources: a minimax approach

This paper is concerned with designing minimum average length uniquely decodable codes, for a family of source distributions for which the relative entropy with respect to a given nominal distribution is bounded above by some fixed number. This formulation leads to a minimax source coding problem, in which the minimizing players are the codeword lengths, while the maximizing players are the uncertain source distributions. It is further shown, via a large deviations duality relation, that the minimax source coding problem is equivalent to a coding problem which minimizes the average of an exponential pay-off instead of the conventional average length pay-off. Both Shannon coding and Huffman coding methods are generalized to this new criterion of performance, leading to robust codes which perform well with respect to an uncountable family of source distributions. However, the code lengths are designed with respect to a known nominal distribution, which is obtained either through modeling assumptions or via empirical techniques. Simulations are also presented comparing the Shannon/Huffman codes with the robust codes, when the source distribution is uncertain, while a sensitivity analysis shows that the new codes are much less sensitive to the uncertainty description. In addition, a fixed length source coding theorem is derived in which the encoding error tends to zero as the length of the codes tends to infinity, uniformly over the set of uncertain distributions which satisfy the relative entropy bound. Finally, generalizations to uncertainty described by the total variation norm is discussed