Miracle-dz/UniFAR-FTUs huggingface dataset:
Results of a Prospective Study of High-Dose or Conventional Anthracycline-Cyclophosphamide Regimen Plus Radiotherapy for Localized Adult Non-Hodgkin's Primary Bone Lymphoma

Background. Primary bone lymphoma (PBL) is a rare entity that has only been reviewed in one prospective and small retrospective studies, from which it is difficult to establish treatment guidelines. We prospectively evaluated high-dose or conventional anthracycline-cyclophosphamide dose and radiotherapy for PBL. Patients and Methods. The GOELAMS prospective multicenter study (1986–1998) enrolled adults with localized high-grade PBL according to age and performance status (PS). Patients <60 years received a high-dose CHOP regimen (VCAP) and those ≥60 years a conventional anthracycline-cyclophosphamide regimen (VCEP-bleomycin); all received intrathecal chemotherapy and local radiotherapy. Results. Among the 26 patients included (VCAP: 19; VCEP-bleomycin: 7), 39% had poor PS ≥2. With a median follow-up of 8 years, overall survival, event-free survival, and relapse-free survival were 64%, 62%, and 65%, respectively, with no significant difference between treatment groups. Poor PS was significantly associated with shorter OS and EFS. Conclusions. Our results confirm the efficacy of our age-based therapeutic strategy. High-doses anthracycline-cyclophosphamide did not improve the outcome. VCEP-bleomycin is effective and well tolerated for old patients. The intensification must be considered for patients with PS ≥2, a poor prognostic factor.
Antiferromagnetism with Ultracold Atoms

We use ultracold spin--1/2 atomic fermions ($^6$Li) to realize the Hubbard model on a three-dimensional (3D) optical lattice. At relatively high temperatures and at densities near half-filling, we show that the gas forms a Mott insulator with unordered spins. To observe antiferromagnetic order that is predicted to occur at lower temperatures, we developed the compensated optical lattice method to evaporatively cool atoms in the lattice. This cooling has enabled the detection of short-range magnetic order by spin-sensitive Bragg scattering of light.
Development of ladder-type laser scanning system for 3-D modeling of large-scale cultural heritages

In this paper, we propose a novel type of 3-D scanning system named Ladder-type laser scanning system. This system was designed for scanning narrow and vertically stalky spaces. The climbing sensor equips a platform with two line scanners on a lift, and they scan the whole target while the lift moves vertically. By using spatio-temporal range image we can accurately calculate the speed of the platform, with which correct 3-D models can be constructed. We applied this system to the Bayon Temple in Cambodia. The results proved that the system gives a sufficiently accurate 3-D model and the effectiveness of our proposed system and speed estimating process.
Canalization of Gene Expression and Domain Shifts in the Drosophila Blastoderm by Dynamical Attractors

The variation in the expression patterns of the gap genes in the blastoderm of the fruit fly Drosophila melanogaster reduces over time as a result of cross regulation between these genes, a fact that we have demonstrated in an accompanying article in PLoS Biology (see Manu et al., doi:10.1371/journal.pbio.1000049). This biologically essential process is an example of the phenomenon known as canalization. It has been suggested that the developmental trajectory of a wild-type organism is inherently stable, and that canalization is a manifestation of this property. Although the role of gap genes in the canalization process was established by correctly predicting the response of the system to particular perturbations, the stability of the developmental trajectory remains to be investigated. For many years, it has been speculated that stability against perturbations during development can be described by dynamical systems having attracting sets that drive reductions of volume in phase space. In this paper, we show that both the reduction in variability of gap gene expression as well as shifts in the position of posterior gap gene domains are the result of the actions of attractors in the gap gene dynamical system. Two biologically distinct dynamical regions exist in the early embryo, separated by a bifurcation at 53% egg length. In the anterior region, reduction in variation occurs because of stability induced by point attractors, while in the posterior, the stability of the developmental trajectory arises from a one-dimensional attracting manifold. This manifold also controls a previously characterized anterior shift of posterior region gap domains. Our analysis shows that the complex phenomena of canalization and pattern formation in the Drosophila blastoderm can be understood in terms of the qualitative features of the dynamical system. The result confirms the idea that attractors are important for developmental stability and shows a richer variety of dynamical attractors in developmental systems than has been previously recognized.
Some Geometry of Nodal Curves

We find a geometrical method of analysing the singularities of a plane nodal curve. The main results will be used in a forthcoming paper on geometric Plucker formulas for such curves. Plane nodal curves, that is plane curves having at most nodes as singularities, form an important class of curves, as any projective algebraic curve is birational to a plane nodal curve.
Map Matching based on Conditional Random Fields and Route Preference Mining for Uncertain Trajectories

Mining for Uncertain Trajectories Xu Ming1 Du Yi-man2 Wu Jian-ping2 Yang Zhou2 (School of Computer Science, Beijing University of Posts and Telecommunications, Beijing, 100876, china) 2 (School of Civil Engineering, Tsinghua University, Beijing, 100084, china) Abstract: In order to improve offline map matching accuracy of low-sampling-rate GPS, a map matching algorithm based on conditional random fields (CRF) and route preference mining is proposed. In this algorithm, road offset distance and the temporal-spatial relationship between the sampling points are used as features of GPS trajectory in CRF model, which can utilize the advantages of integrating the context information into features flexibly. When the sampling rate is too low, it is difficult to guarantee the effectiveness using temporal-spatial context modeled in CRF, and route preference of a driver is used as replenishment to be superposed on the temporal-spatial transition features. The experimental results show that this method can improve the accuracy of the matching, especially in the case of low sampling rate.
A Recommender Agent for Software Libraries: An Evaluation of Memory-Based and Model-Based Collaborative Filtering

Software agents can conveniently facilitate knowledge discovery and knowledge sharing across an organisation. We contend that programming tasks are often mimicked, that knowledge concerning reusable libraries can be extracted automatically from source code repositories, and that this knowledge can then be filtered and presented to a developer in a manner that will encourage and support future software reuse. We describe RASCAL, a recommender agent that continually recommends a set of task-relevant library methods to a developer. RASCAL learns information regarding how a particular reusable library is used and then employs this insight to make task-relevant recommendations to a developer. In this paper we detail our RASCAL agent and compare two recommendation techniques, namely memory-based and model-based collaborative filtering. We are interested in producing a scalable and efficient real-time recommender and thus ideally would favour a model-based approach. However, each scheme is evaluated against both runtime performance and recommendation accuracy. We present results and discuss the merits and limitations of each technique.
On a subclass of analytic functions with negative coe-cient associated with convolution structure 1

The main object of this paper is to study the subclass SC(∞;‚;fl) of analytic univalent functions with negative coe‐cients in unit disc U = fz : jzj < 1g. Further coe‐cient estimates, distortion theorem and integral operators for this class are also obtained. We also discuss radii of convexity and closure properties for functions belonging to the class SC(∞;‚;fl).
Effect of exponential correlation model on channel estimation for massive MIMO

In this paper the impact of exponential correlation model on massive multiple input multiple output (MIMO) channel estimation is analyzed using a large number of antennas in the base station (BS) and a user terminal. We consider pilot-based channel estimation in the UL channel. The Linear minimum mean square error (LMMSE) estimator is used to investigate the effect of correlation factor on the average mean square error (MSE). Different number of antennas and several signal to noise ratio (SNR) values are implemented to see the estimation accuracy in each case. The effect of pilot length on the LMMSE channel estimator and its relationship with the exponential correlation model is investigated. It is shown that for low SNR values, the exponential correlation model has high impact on channel estimation.
The Discovery of Agile Service Networks through the Use of Social Network Analysis

There is a need to address the significant gap in our ability to measure and monitor the Key Performance Indicators (KPIs) across service networks. The unprecedented growth in service-based business processes over a short period of time has underscored the need for understanding the mechanisms and theorising the business models and business process management adopted across many organisations today. This research presents a survey of the literature and argues that the inability of current Business Process Management (BPM) techniques to visualise and monitor web-enabled business processes prevents us from transforming information on network activity and infrastructures. This inhibits managers in anticipating change and adapting to more agile business practices in service science. Thus, this research-in-progress sets out to propose the need to develop a framework to enhance a manager’s ability to monitor key performance indicators (KPIs) while improving business process restructuring practices through social network analysis (SNA).
An O ( log 2 k )-approximation algorithm for the k-vertex connected subgraph problem

We present an O(log n · log k)-approximation algorithm for the problem of finding k-vertex connected spanning subgraph of minimum cost, where n is the number of vertices in the input graph, and k is the connectivity requirement. Our algorithm works for both directed and undirected graphs. The best known approximation guarantees for this problems are O(ln k · min{ √ k, n n−k ln k}) by Kortsarz and Nutov, and O(ln k) in case of undirected graphs with n ≥ 6k by Cheriyan, Vempala, and Vetta. Our algorithm is the first that has a polylogarithmic guarantee for all values of k. Combining our algorithm with the algorithm of Kortsarz and Nutov in case of small k, e.g., k < n/2, we have an O(log k)-approximation algorithm. As in previous work, we use the Frank-Tardos algorithm for finding k-outconnected subgraphs as a subroutine. However, using structural lemmas that we proved, we are able to show that we need only partial solutions returned by the Frank-Tardos algortihm; thus, we can avoid paying the whole cost of the optimal solution every time the algorithm is applied.
Revising buffering in multihop CSMA/CA wireless networks

We look at a multihop wireless path with relay nodes running some CSMA/CA protocol. We show that current buffering schemes with a drop-tail policy lead to low throughput, independently of any other MAC layer issues. We propose a simple alternative buffering policy, where relay nodes are essentially bufferless. We show that even without buffering, the network can be stabilized in a regime where the link utilization is optimal, through very simple amendments to the MAC layer. Furthermore, the network operation stays self-organized and resilient to mild interference and transmission failures. Exploiting a packet/hole duality property of the system, we suggest extensions for handling bidirectional traffic along the path, and more general mesh network configurations.
PdhR (Pyruvate Dehydrogenase Complex Regulator) Controls the Respiratory Electron Transport System in Escherichia coli

ABSTRACT The pyruvate dehydrogenase (PDH) multienzyme complex plays a key role in the metabolic interconnection between glycolysis and the citric acid cycle. Transcription of the Escherichia coli genes for all three components of the PDH complex in the pdhR-aceEF-lpdA operon is repressed by the pyruvate-sensing PdhR, a GntR family transcription regulator, and derepressed by pyruvate. After a systematic search for the regulation targets of PdhR using genomic systematic evolution of ligands by exponential enrichment (SELEX), we have identified two novel targets, ndh, encoding NADH dehydrogenase II, and cyoABCDE, encoding the cytochrome bo-type oxidase, both together forming the pathway of respiratory electron transport downstream from the PDH cycle. PDH generates NADH, while Ndh and CyoABCDE together transport electrons from NADH to oxygen. Using gel shift and DNase I footprinting assays, the PdhR-binding site (PdhR box) was defined, which includes a palindromic consensus sequence, ATTGGTNNNACCAAT. The binding in vitro of PdhR to the PdhR box decreased in the presence of pyruvate. Promoter assays in vivo using a two-fluorescent-protein vector also indicated that the newly identified operons are repressed by PdhR and derepressed by the addition of pyruvate. Taken together, we propose that PdhR is a master regulator for controlling the formation of not only the PDH complex but also the respiratory electron transport system.
Toying with time: considering temporal themes in interactive artifacts

This paper argues that there is a value in deliberately and systematically exploring potential temporal behaviors of an interactive artifact, either as a means to add new functions, or to change the interaction with it. An improved version of Temporal Themes [23] - a vocabulary describing how software can "use" time or sequences of events - will be presented, alongside a series of design cases. These exemplify how adding or changing temporal themes in existing applications can enhance functionality and/or interaction. Moreover, the cases also serve as a basis for a discussion of the issues coupled to temporality, control and interaction strategies. Finally, a design approach with focus on temporal aspects is outlined. As a result, the paper opens up for a more conscious use of time and temporality in interaction design.
Hemodynamic Modeling in a Stenosed Internal Carotid Artery

This paper deals with patient-specific blood flow modeling in a stenosed internal carotid artery (ICA). An ICA stenosis has an impact on hemodynamic behavior. It can hamper the brain irrigation and even cause a stroke. Our aim is to predict the blood flow behavior through computational fluid dynamic (CFD) study. The proposed approach realizes a hemodynamic modeling within a geometric carotid model build from a 3D computed tomography angiography image with blood considered as a Newtonian and incompressible fluid, and the wall as rigid. The blood flow modeling is based on the Navier-Stokes equation. A Womersley velocity profile is used as a boundary condition in the common carotid artery. Main results of this study are the following: (1) velocity is maximum in stenosis and minimum in the sinus, (2) pressure is negative on the most of carotid artery bifurcation unless the post-stenotic site.
Practice patterns in the management of threatened preterm labor in Korea: A multicenter retrospective study

Objective This study aimed to examine clinical practice patterns in the management of pregnant women admitted with threatened preterm labor (TPL) in Korea. Methods Data from women admitted with a diagnosis of TPL were collected from 22 hospitals. TPL was defined as regular uterine contractions with or without other symptoms such as pelvic pressure, backache, increased vaginal discharge, menstrual-like cramps, bleeding/show and cervical changes. Data on general patient information, clinical characteristics at admission, use of tocolytics, antibiotics, and corticosteroids, and pregnancy outcomes were collected using an online data collections system. Results A total of 947 women with TPL were enrolled. First-line tocolysis was administered to 822 (86.8%) patients. As a first-line tocolysis, beta-agonists were used most frequently (510/822, 62.0%), followed by magnesium sulfate (183/822, 22.3%), calcium channel blockers (91/822, 11.1%), and atosiban (38/822, 4.6%). Of the 822 women with first-line tocolysis, second-line tocolysis were required in 364 (44.3%). Of 364 with second-line, 199 had third-line tocolysis (37.4%). Antibiotics were administered to 29.9% of patients (284/947) with single (215, 22.7%), dual (26, 2.7%), and triple combinations (43, 4.5%). Corticosteroids were administered to 420 (44.4%) patients. Betamethasone was administered to 298 patients (71.0%), and dexamethasone was administered to 122 patients (29.0%). Conclusion Practice patterns in the management of TPL in Korea were quite various. It is needed to develop standardized practice guidelines for TPL management.
Quantum emulation of query extension in information retrieval

An operationalistic scheme, called Melucci metaphor, is suggested representing Information Retrieval as physical measurements with beam of particles playing the role of the flow of retrieved documents. The possibilities of query expansion by extra term are studied from this perspective, when the particles-`docuscles' are assumed to be of classical or quantum nature. It is shown that in both cases the choice of an extra term based on Bayesian belief revision is still valid on the qualitative level for boosting the relevance of the retrieved documents.
A Service Oriented Security Reference Architecture

Nowadays, service-oriented architecture (SOA) is used as an efficient solution to integrate distributed applications in an enterprise. In a SOA-based environment, security is one of the most important issues that must be considered on account of loosely coupled nature of SOA. However, there are several approaches and technologies for securing services such as WS-Security, SAML, and etc. SOA brings additional security problems on the level of architecture. Therefore, providing comprehensive security reference architecture for Enterprise SOA (ESOA) becomes a critical issue. In this paper, we propose a Service Oriented Security Reference Architecture (SOSRA) for Service Oriented Reference Architecture (S3) based enterprise applying our previously proposed Conceptual SOA Security Framework.
An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky Factorization

Let an undirected graph $G$ be given, along with a specified depth-first spanning tree $T$. Almost-linear-time algorithms are given to solve the following two problems. First, for every vertex $v$, compute the number of descendants $w$ of $v$ for which some descendant of $w$ is adjacent (in $G$) to $v$. Second, for every vertex $v$, compute the number of ancestors of $v$ that are adjacent (in $G$) to at least one descendant of $v$. These problems arise in Cholesky and $QR$ factorizations of sparse matrices. The authors' algorithms can be used to determine the number of nonzero entries in each row and column of the triangular factor of a matrix from the zero/nonzero structure of the matrix. Such a prediction makes storage allocation for sparse matrix factorizations more efficient. The authors' algorithms run in time linear in the size of the input times a slowly growing inverse of Ackermann's function. The best previously known algorithms for these problems ran in time linear in the sum of the nonzero counts, which is usually much larger. Experimental results are given demonstrating the practical efficiency of the new algorithms.
Throughput-based incentives for residential femtocells

In this paper, a) we investigate a simple throughput based incentive mechanism that could convince home users to install residential femtocells (by offering them a rate which is α > 1 times higher than the average rate received by a user associated with the macro base station), avoid most of the curse of free riders (i.e., selfish users who gets improved service just because others are investing in femto technology) and, at the end, be beneficial to both the users and the operator, and b) we propose a heuristic to compute the resource allocation supporting this incentive scheme. We show that it is cost-effective for a network operator to allocate a pool K of its licensed channels to a certain number of femto cells, even under our incentive mechanism. We first study a static scenario with fixed numbers of macro and femto users. We identify the range of values of the incentive parameter α that can be supported to reward femto users without harming macro users and we quantify the throughput gains for both macro and femto users in different situations. Then, we consider a dynamic scenario, where the number of users and the number of active femtocells change continuously, and we propose a simple and very accurate heuristic for computing K with a minimal amount of information to be collected at the macro base station. Our numerical results show that by using our proposed approach both macro and femto users are better off than in a pure macrocellular scenario.
Preserving Privacy by De-identifying Facial Images

In the context of sharing video surveillance data, a significant threat to privacy is face recognition software, which can automatically identify known people, such as from a database of drivers’ license photos, and thereby track people regardless of suspicion. This paper introduces an algorithm to protect the privacy of individuals in video surveillance data by de-identifying faces such that many facial characteristics remain but the face cannot be reliably recognized. A trivial solution to de-identifying faces involves blacking out each face. This thwarts any possible face recognition, but because all facial details are obscured, the result is of limited use. Many ad hoc attempts, such as covering eyes or randomly perturbing image pixels, fail to thwart face recognition because of the robustness of face recognition methods. This paper presents a new privacy-enabling algorithm, named k -Same, that scientifically limits the ability of face recognition software to reliably recognize faces while maintaining facial details in the images. The algorithm determines similarity between faces based on a distance metric and creates new faces by averaging image components, which may be the original image pixels ( k - Same-Pixel) or eigenvectors ( k -Same-Eigen). Results are presented on a standard collection of real face images with varying k .