Miracle-dz/UniFAR-FTUs huggingface dataset:
Aberrant expression of Arpin in human breast cancer and its clinical significance

Arpin (Arp2/3 complex inhibitor), a novel protein found in 2013, plays a pivotal role in cell motility and migration. However, the precise role of Arpin in cancer is unclear. This study investigated the expression of Arpin in breast cancer and evaluated its correlation with the characteristics of clinical pathology and prognosis of breast cancer patients. Immunohistochemistry (IHC) for Arpin protein was performed on formalin‐fixed, paraffin‐embedded 176 breast cancer tissues and 43 normal breast tissues while qRT‐PCR for Arpin mRNA with 104 paired tumour and paratumoural tissues from breast cancer patients respectively. The association of Arpin expression with clinical pathological features and survival was assessed in a retrospective cohort analysis of patients. The results showed that the expression of Arpin protein in cancer tissues was lower compared to that in normal breast and the expression of Arpin mRNA was also lower in cancer tissues than that in the matched paratumoural tissues. Among the 176 breast cancer patients, the lower expression of Arpin was significantly associated with advanced tumour, nodes and metastasis system stage, and the reduced Arpin expression was strongly associated with axillary lymph node metastasis using univariate and multivariate logistic regression analysis [odds ratio: 3.242; 95% confidence interval (CI): 1.526, 6.888; P < 0.05]. Furthermore, Arpin expression was an independent risk factor for recurrence‐free survival (HR: 0.373; 95% CI: 0.171, 0.813; P < 0.05). As Arpin expression was first examined in human breast cancer tissues with qRT‐PCR and IHC, our results suggest that Arpin downregulation may contribute to the initiation and development of breast cancer metastasis. Therefore, as a potential predictive marker, Arpin deserves future studies.
Cell-mediated extracellular acidification and bone resorption: evidence for a low pH in resorbing lacunae and localization of a 100-kD lysosomal membrane protein at the osteoclast ruffled border

The extracellular compartment where bone resorption occurs, between the osteoclast and bone matrix, is shown in this report to be actively acidified. The weak base acridine orange accumulates within this compartment but dissipates after incubation with ammonium chloride. Upon removal of ammonium chloride, the cells are able to rapidly reacidify this compartment. The highly convoluted plasma membrane of the osteoclast facing this acidic compartment (ruffled border) is shown to contain a 100-kD integral membrane protein otherwise present in limiting membranes of lysosomes and other related acidified organelles (Reggio, H., D. Bainton, E. Harms, E. Coudrier, and D. Louvard, 1984, J. Cell Biol., 99:1511-1526; Tougard, C., D. Louvard, R. Picart, and A. Tixier-Vidal, 1985, J. Cell Biol. 100:786-793). Antibodies recognizing this 100-kD lysosomal membrane protein cross-react with a proton-pump ATPase from pig gastric mucosae (Reggio, H., D. Bainton, E. Harms, E. Coudrier, and D. Louvard, 1984, J. Cell Biol., 99:1511-1526), therefore raising the possibility that it plays a role in the acidification of both intracellular organelles and extracellular compartments. Lysosomal enzymes are also directionally secreted by the osteoclast into the acidified extracellular compartment which can therefore be considered as the functional equivalent of a secondary lysosome with a low pH, acid hydrolases, the substrate, and a limiting membrane containing the 100-kD antigen.
1 Visual Object Perception and Long-Term Memory

Palmeri & Tarr 2 " they took twenty seven eight-by-ten color glossy photographs with circles and arrows and a paragraph on the back of each one explaining what each one was to be used as evidence against us. "-from Alice's Restaurant, The late cognitive psychologist and memory theorist, Robert G. Crowder (MJT's colleague for six years), was fond of saying " memory is perception. " What he meant was that memory is not a box in which things – objects, meanings, etc. – are stored. To Bob, memory was intrinsic to and a consequence of information processing, whether it be perceptual, linguistic, or cognitive in nature. In this context it seems natural that our chapter discusses both object perception and object memory. At the same time, we acknowledge that in classic information processing flowcharts – as well as in the organization of most introductory textbooks – object perception precedes sensory or iconic memory (Chapter 2? ), which precedes short-term or working memory (Chapter 3? ), which precedes long-term memory (e.g., Atkinson & Shiffrin, 1968). By such accounts, visual perception is a modular, encapsulated input system, while memory is a cognitive box where you put information (c.f., Fodor, 1983). But as we shall see, contemporary research has demonstrated far closer links between object perception and object memory than anticipated by classic approaches to perception and cognition (Palmeri & Gauthier, 2004). Indeed, we are of the same mind as Bob: drawing a clear demarcation between perception and memory is misguided. We begin with a discussion of how objects are perceived and come to be represented over experience. And we describe the perceptual nature of the particular information stored in long-term memory that allows us to recognize, identify, categorize, and perform perceptual skills on visual objects. These topics forge natural links to other chapters in this volume. To what extent do visual working memory and long-term memory have similar representational formats Palmeri & Tarr 3 (Chapter 3? )? How closely tied is visual working memory to visual long-term memory (Chapter 3? )? What are the relationships between objects and scenes (Chapter 5? )? What are the relationships between visual memory for objects, conceptual knowledge about objects, and functional knowledge of how to use objects (Chapter 7? )? Two themes weave their way throughout this chapter. One theme concerns the role of abstraction in perception and memory. Our everyday experience suggests that familiar objects can be recognized effortlessly under dramatically …
An RNN-based prosodic information synthesizer for Mandarin text-to-speech

A new RNN-based prosodic information synthesizer for Mandarin Chinese text-to-speech (TTS) is proposed in this paper. Its four-layer recurrent neural network (RNN) generates prosodic information such as syllable pitch contours, syllable energy levels, syllable initial and final durations, as well as intersyllable pause durations. The input layer and first hidden layer operate with a word-synchronized clock to represent current-word phonologic states within the prosodic structure of text to be synthesized. The second hidden layer and output layer operate on a syllable-synchronized clock and use outputs from the preceding layers, along with additional syllable-level inputs fed directly to the second hidden layer, to generate desired prosodic parameters. The RNN was trained on a large set of actual utterances accompanied by associated texts, and can automatically learn many human-prosody phonologic rules, including the well-known Sandhi Tone 3 F0-change rule. Experimental results show that all synthesized prosodic parameter sequences matched quite well with their original counterparts, and a pitch-synchronous-overlap-add-based (PSOLA-based) Mandarin TTS system was also used for testing of our approach. While subjective tests are difficult to perform and remain to be done in the future, we have carried out informal listening tests by a significant number of native Chinese speakers and the results confirmed that all synthesized speech sounded quite natural.
Vietnamese Named Entity Recognition using Token Regular Expressions and Bidirectional Inference

This paper describes an efficient approach to improve the accuracy of a named entity recognition system for Vietnamese. The approach combines regular expressions over tokens and a bidirectional inference method in a sequence labelling model. The proposed method achieves an overall $F_1$ score of 89.66% on a test set of an evaluation campaign, organized in late 2016 by the Vietnamese Language and Speech Processing (VLSP) community.
An evolutional approach for record deduplication and improving accuracy level in large repositories

This paper deals how genetic programming can be used for record de-duplication. Many systems rely on the data integrity for offering high quality services that may be affected by the existence of near-replicas, quasi-replicas, or replicas entries in their repositories. So, there has been a huge effort from private and public organizations for developing effective methods for removing duplicates from large data repositories. It is because of clear, duplicate-free repositories not only allow the retrieval of higher-quality data but also lead to a more concise data representation and for efficient savings in execution time and resources to proceed the data. In this paper, we improve the results of a GP-based approach for record de-duplication by doing a comprehensive set of experiments regarding its parameterization setup. Our experiments show that some parameter like efficiency, accuracy can improve the results to up 30%. Thus, the obtained results can be used as preventive way for suggesting the best way to set up our GP-based approach parameters to record de-duplication.
A Distributed Cooperating Constraints Solving System

An appropriate combination of symbolic and numeric solvers often makes it possible to solve problems that none of these solvers can tackle alone. In this paper, we specify a cooperative architecture which allows using concurrently heterogeneous solvers when handling constraints over the reals. This architecture is based upon agents that communicate via asynchronous message passing. Agents are synchronized when a failure or a success occurs. Disjunctive constraints are handled by backtracking. Operational semantics and terminating conditions of such systems are discussed. Implementation issues are addressed. We end the presentation by several examples and give some computational results from a first prototype.
Evaluating eco-driving advice using GPS/CANBus data

Vehicles in the US use approximately 1.4 billion liters of fuel a day. This number can be reduced by driving more fuel efficiently. Several sources provide fuel saving eco-driving advice, but the advices are often quite abstract. This paper uses a large set of high-frequent GPS and Controller Area Network Bus (CANBus) data from four similar vehicles to evaluate the eco-driving advice. The CANBus data provides information such as the fuel consumption per second and rounds per minute of the engine. The vehicles are compared and evaluated on the drivers' ability to follow the eco-driving advice. This comparison shows that there is a 23% difference in the fuel efficiency. This difference is due to quite different speed and acceleration profiles of the drivers but also that stopping at a traffic light consumes double the fuel compared to not stopping. Overall it is shown that there is good potential for saving fuel by following the eco-driving advice. However, no single advice dominates, and multiple advices are found to have a positive effect on the fuel efficiency.
Operating systems for component software environments

Although component software has emerged as one of the most significant and commercially successful technologies of the past few years, few operating systems (OSs) are designed to host and manage component software effectively. Components impact OS architectures in the areas of security, process isolation, code sharing, installation management and user interface design. A more radical question is: can effective OSs be built of modular, interchangeable component parts? The thesis of this paper is that effective support of components is a key requirement for OSs of the future.
Strong asymptotics on the support of the measure of orthogonality for polynomials orthogonal with respect to a discrete Sobolev inner product

In (6, 8) relative asymptotics for Sobolev orthogonal polynomials were studied. When the continuous part of the measure satisfies the Szegýo condition, the strong asymptotics outside the support of the measure follow from (6, 8). In this paper, we analyze this problem on the support of the measure. 1. Introduction and statements of results Some problems arising from approximation theory, mathematical physics, and number theory have motivated different generalizations of the standard notion of orthogonality. If µ is a finite positive Borel measure supported on the real line, then {pn} is the sequence of standard orthonormal polynomials (OP) with respect to µ when
Wagner's Law - A Spurious Relationship?

Wagner's Law, the proposition that there is a long-run tendency for the public sector to grow relative to national income, has become a stylized fact in public finance. Numerous empirical studies have found strong support for the Law, particularly in a time-series framework. In this paper it is argued that these findings are likely to be spurious, because they have been performed on non-stationary variables that are not cointegrated. In the paper Swedish data for the period 1861-1990 are used.
IntScope: Automatically Detecting Integer Overflow Vulnerability in X86 Binary Using Symbolic Execution

The number of identified integer overflow vulnerabilities has been increasing rapidly in recent years. In this paper, we present a system, IntScope, which can automatically detect integer overflow vulnerabilities in x86 binaries before an attacker does, with the goal of finally eliminating the vulnerabilities. IntScope first translates the disassembled code into our own intermediate representation (IR), and then performs a path sensitive data flow analysis on the IR by leveraging symbolic execution and taint analysis to identify the vulnerable point of integer overflow. Compared with other approaches, IntScope does not run the binary directly, and is scalable to large software as it can just symbolically execute the interesting program paths. Experimental results show IntScope is quite encouraging: it has detected more than 20 zero-day integer overflows (e.g., CVE-2008-4201, FrSIRT/ADV-2008-2919) in widely-used software such as QEMU, Xen and Xine.
Do Real Estate Prices and Stock Prices Move Together? An International Analysis

The relationship between stock prices and real estate prices has been the subject of substantial debate in both the academic and practitioner literatures. Existing studies have focused on the time series of stock and real estate returns using data from a single country, such as the U.S. By necessity, these studies examine return and price changes over short intervals, creating a bias when property values are smoothed from year to year. Using data from 17 different countries over 14 years, this paper examines the relation between stock returns and changes in property values and rents. Consistent with other country-specific studies, we find that, with the exception of Japan, the contemporaneous relation between yearly real estate price changes and stock returns is not statistically significant. However, when the data are pooled across countries and when we look at longer measurement intervals, a significant relation between stock returns and both rents and value changes becomes apparent. Real estate prices are also found to be significantly influenced by GDP growth rates and provide a good long-term hedge against inflation but a poor year-to-year hedge. Copyright American Real Estate and Urban Economics Association.
Identifying and Querying Local and Large-Scale Structures Using L∞ Norms in Visual Analytics

We introduce a new visual analytic framework based on the L∞ norm. This framework involves a three-operator algebra on hyper-rectangles. We have developed a visual analytic system that generates set-wise rules from simple gestures in an exploratory visual GUI. Logging these rules allows us to apply our analysis to a new sample or batch of data so that we can assess the validity and reliability of our visual-analytic model. The basic idea is to design an analytic system around rectangular (weighted hypercube) description regions. The composition of these regions (using three operators) can be used to define local and large-scale structures and provides the basis for a formal description of structures suitable for visual analytics.
Information quality issues in telco database marketing campaigns

This paper discusses information quality issues concerning consumer data assimilated by telecommunication companies (telcos) in regional and global ventures. First, it describes various problematic and evolving environmental constraints that necessitate the adoption of new integration technologies. Then, it describes the consumer information characteristics and demonstrates that they require handling as a product having a full life-cycle. Our prime objectives are to assess the business impact of consumer data quality and to determine effective information technology decision-making strategies for telco database marketing campaigns.
Dynamic downlink OFDM resource allocation with interference mitigation and macro diversity for multimedia services in wireless cellular systems

This paper presents efficient dynamic resource allocation schemes with interference mitigation techniques for multimedia services in downlink OFDM mobile cellular systems. The performance of the proposed algorithms is evaluated in terms of user quality of service (QoS) and system spectral efficiency. It is shown that the best sub-carrier allocation (BSA) scheme with interference mitigation and macro-diversity techniques gives significant performance gains in terms of system spectral efficiency. Furthermore, sharing the system bandwidth amongst real-time stream-type voice and bursty data services can support much larger system loads than having a hard division.
Throughput improvement of optimal turbo coded V-BLAST technique in MIMO-AM system

In this paper, we propose and analyze an Adaptive Modulation System with optimal Turbo Coded V-BLAST (Vertical-Bell-lab Layered Space-Time) technique that adopts the extrinsic information from MAP (Maximum A Posteriori) Decoder with Iterative Decoding as a priori probability in two decoding procedures of V-BLAST scheme; the ordering and the slicing. Also, we consider and compare The Adaptive Modulation System using conventional Turbo Coded V-BLAST technique that is simply combined V-BLAST scheme with Turbo Coding scheme and that is decoded by the ML(Maximum Likelihood) decoding algorithm. In addition, we apply MIMO (Multiple Input Multiple Output) schemes to the systems for more performance improvement. The result indicates that the proposed systems achieve a better throughput performance than the conventional systems in the whole SNR range. And in terms of the throughput performance, the suggested system is close proximity to the conventional system using the ML decoding algorithm. In addition, the simulation result shows that the maximum throughput improvement in each MIMO scheme is respectively about 350 kbps, 460 kbps, and 740 kbps. It is suggested that the effect of the proposed decoding algorithm accordingly gets higher as the number of system antenna increases.
On the asymptotic error probability of composite relay channels

Consider the composite relay channel consisting of a set of relay channels associated to a probability measure. The current channel is a draw from its probability and in some cases arbitrary small error probability cannot be guaranteed for all channels in the set. In this paper, instead of finding the maximum achievable rate subject to a small error probability (EP) for all the channels in the set, we look at the asymptotic behavior of EP for a given rate. The notion of achievable EP is introduced as a novel performance measure for wireless relay channels. We can intuitively define it as the smallest EP that can be asymptotically achieved for a given rate. The behavior of EP is directly related to the ∈-capacity of each channel in the set. It is shown that the behavior of EP is upper and lower bounded by the outage probability of a region which is referred to as the full error region. Then every code with a rate belonging to this region yields EP equal to one. Finally, new coding for oblivious cooperation simultaneously exploiting both Decode-and-Forward (DF) and Compress-and-Forward (CF) strategies is investigated. The Gaussian relay channel with slow fading is also discussed.
2010 2nd International Conference on Industrial Mechatronics and Automation Finger Vein Identification Based on 2-d Gabor Filter

In order to improve the efficiency of finger vein identification, this paper proposed a new identification method based on the direction feature of the vein image. Firstly, 2-D Gabor filter is used to filter the original vein image. Then the phase and direction texture features are extracted. An algorithm is used for fusion at feature level. Finally, a modified Hamming distance measure is used for matching. The proposed method does not require any image pre-processing and positioning. It is easy to use and has a good performance on extracting the vein feature with an identification rate of 99.31%.
Tn5 Transposase Active Site Mutations Suggest Position of Donor Backbone DNA in Synaptic Complex*

Tn5 transposase (Tnp), a 53.3-kDa protein, enables the movement of transposon Tn5 by a conservative mechanism. Within the context of a protein and DNA synaptic complex, a single Tnp molecule catalyzes four sequential DNA breaking and joining reactions at the end of a single transposon. The three amino acids of the DDE motif (Asp-97, Asp-188, and Glu-326), which are conserved among transposases and retroviral integrases, have been shown previously to be absolutely required for all catalytic steps. To probe the effect of active site geometry on the ability to form synaptic complexes and perform catalysis, single mutations at each position of the DDE motif were constructed. The aspartates were changed to glutamates, and the glutamate was changed to an aspartate. These mutants were studied by performing in vitro binding assays using short oligonucleotide substrates simulating the natural substrates for the synaptic complex formation and subsequent transposition steps. The results indicate that the aspartate to glutamate mutations restrict synaptic complex formation with substrates resembling the natural transposon prior to transferred strand nicking. This suggests a structural model in which the donor backbone DNA, prior to nicking, occupies the same space that is invaded by the longer side chains present in the aspartate to glutamate mutants. Additionally, catalytic assays support the previous proposal that the active site coordinates two divalent metal ions.
On the Capacity of p-Persistent CSMA

The CSMA-based algorithms constitute a heart of contemporary wireless media access control technology. In last decades, various enhancements have been introduced to basic CSMA schemes, first of all, in order to support collision avoidance. At the same time, the performance analysis of the p-persistent CSMA has gained a renewed interest recently since the behavior of many CSMA protocols might be studied by the p-persistent model. The capacity of the p-CSMA is an important performance measure. It establishes the best-case channel utilization that may be obtained in the p-persistent CSMA with varying p. The goal of the paper is to compare the maximum channel utilization of the p-persistent CSMA with the corresponding measure for the predictive p-persistent CSMA implemented in MAC sublayer of LonTalk/EIA-709.1 protocol used for communication between intelligent sensors and actuators in LonWorks technology. A comparison of both CSMA schemes shows that the predictive p-persistent CSMA throughput is close to the capacity of the p-persistent CSMA only for small network sizes. If the number of contenders is greater, the throughput of the predictive p-CSMA is much smaller than p-CSMA capacity.