Miracle-dz/UniFAR-FTUs huggingface dataset:
GADL1 variant and medication adherence in predicting response to lithium maintenance treatment in bipolar I disorder

Background Genetic variants and medication adherence have been identified to be the main factors contributing to lithium treatment response in bipolar disorders. Aims To simultaneously examine effects of variant glutamate decarboxylase-like protein 1 (GADL1) and medication adherence on response to lithium maintenance treatment in Han Chinese patients with bipolar I (BPI) disorder. Method Frequencies of manic and depressive episodes between carriers and non-carriers of the effective GADL1 rs17026688 T allele during the cumulative periods of off-lithium, poor adherence to lithium treatment and good adherence to lithium treatment were compared in Han Chinese patients with BPI disorder (n = 215). Results GADL1 rs17026688 T carriers had significantly lower frequencies of recurrent affective episodes than non-T carriers during the cumulative period of good adherence, but not during those of poor adherence. Conclusions GADL1 rs17026688 and medication adherence jointly predict response to lithium maintenance treatment in Han Chinese BPI patients.
Optimal Radio Resource Allocation for Hybrid Traffic in Cellular Networks: Traffic Analysis and Implementation

In part I of this paper, a distributed and a centralized architecture for an optimal radio resource allocation aware of the traffic delay-tolerance nature, user subscription type, and application usage variations were developed. In the current article, a transmission overhead analysis of the aforementioned distributed and a centralized architectures is investigated and it is proved that the centralized scheme endures a significantly lower transmission overhead than does the distributed approach. Furthermore, the lower bounds of the transmission overhead for both the centralized and the distributed architectures are derived. Moreover, a sensitivity analysis of the resource allocation procedures of the aforesaid centralized and distributed architectures to the changes in the number of users in the system is presented. Besides, a sensitivity analysis of the centralized and distributed approaches to the temporal changes in application usages are investigated. Ultimately, the transmission overhead and sensitivity relevant statements are verified through appropriate simulations. And last but not the least, a real-world implementation of the resource allocation methods developed in Part I is provided.
The MIRACLE video search engine

This paper presents some of the searching and browsing features of the MIRACLE Video Search Engine. The rapid increase in the generation and dissemination of information and entertainment in video form has created a need for video search engines that facilitate finding and browsing relevant information. MIRACLE is an ongoing project at AT&T Labs aimed at addressing this need. This video search engine combines existing metadata with content-based information that is automatically extracted from the media components, or is obtained from other sources, to achieve this goal. A Web-based user interface provides browsing mechanisms that take advantage of the user’s perceptual abilities to refine the search results. The MIRACLE search engine currently operates on an archive of more than 32,000 hours of video that have been collected and automatically indexed over a ten year period.
Plant Cell Wall, a Challenge for Its Characterisation

The plant cell wall is a complex 3D network composed of polysaccharides, lignin and proteins. The knowledge of the structure and content of each cell wall polymer is a prerequisite to understand their functions during plant development and adaptation but also to optimise their industrial applications. The analysis of cell wall compounds is complicated by their multiple molecular interactions. In this review, we present numerous methods to purify, characterise and quantify proteins, polysaccharides and lignin from the wall. Two kinds of approaches are detailed: the first presents in vitro methods which involve the breakdown of the molecular linkages between polymers thanking to chemical, physical and/or enzymatic treatments. The second approach describes in situ methods that allow the cell wall polymer characterisation thanking to many analytical techniques coupled with microscopy. If microscopy is the common point of all of them, their development is associated with improvement of analytical techniques, increasing their power of resolution.
On the effects of locality in a permutation problem: The Sudoku Puzzle

We present an analysis of an application of Evolutionary Computation to the Sudoku Puzzle. In particular, we are interested in understanding the locality of the search operators employed, and the difficulty of the problem landscape. Treating the Sudoku puzzle as a permutation problem we analyse the locality of four permutation-based crossover operators, named One Cycle Crossover, Multi-Cycle Crossover, Partially Matched Crossover (PMX) and Uniform Swap Crossover. These were analysed using different crossover rates. Experimental evidence is found to support the hypothesis that PMX and Uniform Swap Crossover operators have better properties of locality relative to the other operators examined regardless of the crossover rates used. Fitness distance correlation, a well-known measure of hardness, is used to analyse problem difficulty and the results are consistent with the difficulty levels associated with the benchmark Sudoku puzzles analysed.
Policy Conflict Analysis in Distributed System Management 12 April 1993

Distributed system management is concerned with the tasks needed to ensure that large distributed systems can function in accordance with the objectives of their users. These objectives are typically set out in the form of policies which are interpreted by the system managers. There are benefits to be gained by providing automated support for human managers, or actually automating routine management tasks. In order to do this, it is desirable to have a model of policies as objects which can be interpreted by the system itself. The model is summarised. It is clear that there is the potential for conflicts between policies. These conflicts may be resolved informally by human managers, but if an automated system is to recognise them and resolve them appropriately it is necessary first of all to analyse the types of conflict which may occur. We analyse the types of overlap which may occur between policies, and show that this analysis corresponds to several familiar types of policy conflict. Some possible approaches to the prevention and resolution of conflicts are suggested, and this work is put into the context of other work on policies and related areas, including deontic logic.
Referenced attribute Functional Dependency Database for visualizing web relational tables

Web structure mining is the process of using graph theory to analyse the node and connection structure of a web site. A large number of web pages contain data structure in the form of “lists”. Many such lists can be further split into multicolumn tables, which can then be used in more semantically meaningful tasks. Returning relational tables from such lists is a challenging task. The World-Wide Web consists of a huge number of unstructured documents, but it also contains structured data in the form of HTML tables. Because each relational table has its own “schema” of labelled and typed columns, each such table can be considered as a small structured database. This research paper first focus on the new techniques for keyword search over a mass of tables, and show that they can achieve substantially higher relevance than solutions based on a traditional search engine using Referenced attribute Functional Dependency Database (RFDDb). The Second objective is to introduce the data structure called BOOKSHELF that records corpus-wide statistics on co-occurrences of schema elements. In addition to improving search relevance in bookshelf data structure several novel applications such as: schema auto-complete, which helps a database designer to choose schema elements and attribute synonym finding, which automatically computes attribute synonym pairs for schema matching are incorporated. Referential Integrity requires that the columns of a foreign key must match in number and type the columns of the primary key in the referenced table. The values of the foreign key columns in each row of the referencing table must match the values of the corresponding primary key columns for a row in the referenced table. A functional dependency occurs when one attribute in a relation uniquely determines another attribute. This can be written A −> B which would be the same as stating “B is functionally dependent upon A. ” Finally, the search results are presented in visual mode, which allows a user to navigate between extracted schemas.
Evolutionary design of Fuzzy Logic Controllers with the techniques Artificial Neural Network and Genetic Algorithm for cart-pole problem

This paper focuses on the Genetic Algorithm learning paradigm applied to train the ANNs for balancing the cart-pole balancing system. The studied system is a classic control problem namely “cart-pole” problem. We will apply the unconventional techniques Artificial Neural Network, Genetic Algorithm and Fuzzy Logic to a classic control problem "cart-pole”. In this paper we have tried to train the Artificial Neural Network (ANN) with using Genetic Algorithms (program is written in MATLAB) which is compared with the output obtained using the Artificial Neural Network Toolbox provided in MATLAB. In proposed approach we have used both ANNs and Genetic Algorithm to get more optimal solution. Here we applied the approach for the Fuzzy logic technique to design a Fuzzy Logic Controllers (FLC) using ANNs and Genetic Algorithm (GA). The Fuzzy rules which are needed to control the problem will be framed with the combination of Artificial Neural Networks and Genetic Algorithm. It has been found that such a searching technique converges intelligently and much faster than conventional learning means. Performance of the presented neural network training using the genetic algorihtms is much better and providing more accurate results.
Automatic Surface Reconstruction from Point Sets in Space

In this paper an algorithm is proposed that takes as input a generic set of unorganized points, sampled on a real object, and returns a closed interpolating surface. Specifically, this method generates a closed 2‐manifold surface made of triangular faces, without limitations on the shape or genus of the original solid. The reconstruction method is based on generation of the Delaunay tetrahedralization of the point set, followed by a sculpturing process constrained to particular criteria. The main applications of this tool are in medical analysis and in reverse engineering areas. It is possible, for example, to reconstruct anatomical parts starting from surveys based on TACs or magnetic resonance.
The simulated mouse method based on dynamic hand gesture recognition

The existing simulated mouses are mostly based on the hand tracking technique, which depend on the data gloves, remote controllers or other equipment, leading to high costs and severe user limits. In this paper, we develop a new kind of simulated mouses by employing dynamic hand gesture recognition in which the palm node is detected by a Kinect camera. According to the movements of users in real world, we can realize the virtual control of the computer mouse. In the Kinect, since the palm node is defined as a skeleton one, those complicated operations, such as the motion detection, target classification and gesture tracking which are used in the hand tracking, are all omitted. Furthermore, our proposed simulated mouse does not rely on any other auxiliary equipment, relieving the limits on users. Experimental results show that under the same testing environment, the proposed simulated mouse can achieve the gesture recognition rate by 99.2%, 21.4% higher than that of the hand tracking one.
Identification of a residue critical for the excision of 3′-blocking ends in apurinic/apyrimidinic endonucleases of the Xth family

DNA single-strand breaks containing 3′-blocking groups are generated from attack of the sugar backbone by reactive oxygen species or after base excision by DNA glycosylase/apurinic/apyrimidinic (AP) lyases. In human cells, APE1 excises sugar fragments that block the 3′-ends thus facilitating DNA repair synthesis. In Leishmania major, the causal agent of leishmaniasis, the APE1 homolog is the class II AP endonuclease LMAP. Expression of LMAP but not of APE1 reverts the hypersensitivity of a xth nfo repair-deficient Escherichia coli strain to the oxidative compound hydrogen peroxide (H2O2). To identify the residues specifically involved in the repair of oxidative DNA damage, we generated random mutations in the ape1 gene and selected those variants that conferred protection against H2O2. Among the resistant clones, we isolated a mutant in the nuclease domain of APE1 (D70A) with an increased capacity to remove 3′-blocking ends in vitro. D70 of APE1 aligns with A138 of LMAP and mutation of the latter to aspartate significantly reduces its 3′-phosphodiesterase activity. Kinetic analysis shows a novel role of residue D70 in the excision rate of 3′-blocking ends. The functional and structural differences between the parasite and human enzymes probably reflect a divergent molecular evolution of their DNA repair responses to oxidative damage.
Effect of superior cervical ganglionectomy on the ultrastructure of pinealocytes in the Djungarian hamster (Phodopus sungorus): quantitative study.

OBJECTIVES Superior cervical ganglia are of crucial importance in regulating the secretion of the pineal hormone melatonin. Changes in pineal morphology have been observed in many mammalian species after sympathectomy. Therefore, we decided to investigate the ultrastructure of Djungarian hamster pinealocytes following superior cervical ganglionectomy. MATERIAL AND METHODS Eight adult female Djungarian hamsters (Phodopus sungorus) were used in this study. The superior cervical ganglia were removed bilaterally in four animals, whereas the other four animals served as sham-operated controls. The pineal glands were removed four weeks after the operation and processed for electron microscopic study. The cross-sectional areas of pinealocyte and its nucleus, and relative volume of mitochondria, Golgi apparatus, lysosomes, granular endoplasmic reticulum, and glycogen particles as well as the numbers of dense-core vesicles and "synaptic" ribbons were estimated using a digital analyzer connected on-line to IBM-PC computer. Statistical analysis of the data was performed using Student's t test and Snedecor F test. RESULTS Significant reduction in the cross-sectional areas of the pinealocyte and its nucleus as well as in the relative volumes of mitochondria and glycogen particles was observed after superior cervical ganglionectomy in comparison with sham-operated controls. Sympathectomy resulted also in reduction of the number of dense-core vesicles. On the contrary 2,5 fold increase in the number of "synaptic" ribbons was observed in ganglionectomized animals in comparison to sham-operated controls. CONCLUSION Deprivation of sympathetic innervation leads in Djungarian hamsters not only to suppression of melatonin synthesis and secretions but, as appears from our studies, induces also morphological changes suggesting lower metabolic and secretory activity of pinealocytes.
Resident phenotypically modulated vascular smooth muscle cells in healthy human arteries

Vascular interstitial cells (VICs) are non‐contractile cells with filopodia previously described in healthy blood vessels of rodents and their function remains unknown. The objective of this study was to identify VICs in human arteries and to ascertain their role. VICs were identified in the wall of human gastro‐omental arteries using transmission electron microscopy. Isolated VICs showed ability to form new and elongate existing filopodia and actively change body shape. Most importantly sprouting VICs were also observed in cell dispersal. RT‐PCR performed on separately collected contractile vascular smooth muscle cells (VSMCs) and VICs showed that both cell types expressed the gene for smooth muscle myosin heavy chain (SM‐MHC). Immunofluorescent labelling showed that both VSMCs and VICs had similar fluorescence for SM‐MHC and αSM‐actin, VICs, however, had significantly lower fluorescence for smoothelin, myosin light chain kinase, h‐calponin and SM22α. It was also found that VICs do not have cytoskeleton as rigid as in contractile VSMCs. VICs express number of VSMC‐specific proteins and display features of phenotypically modulated VSMCs with increased migratory abilities. VICs, therefore represent resident phenotypically modulated VSMCs that are present in human arteries under normal physiological conditions.
3D Localization of Quadratic Surfaces via Optimization on a Manifold

Our task is to locate surfaces from noisy laser scanning data, this being important in machine vision and industrial robotics. our focus is the location of quadratic surfaces which are of special importance since they are commonly occurring shapes in man made objects, or can be used in patches to approximate other shapes. We seek to achieve insensitive to noise and occlusion, and achieve quadratic convergence rates. We address the task as minimizing a smooth cost function over the constraint manifold of the Special Euclidean group SE 3 . This leads us to a novel geometric optimization framework which combines ideas from optimization theory and diﬀerential geometry. The proposed method involves successive parameterization of the constraint manifold, carrying out optimization of the local cost function in parameter space and subsequently projecting the optimal vector back to the manifold. Newton-like algorithm on manifolds based on this method are devised. A rigorous proof establishes the local quadratic convergent of the algorithm. Simulation results demonstrate the robustness of the method against measurement noise and occlusions.
A decentralized software bus based on IP multicasting

We describe a decentralized reconfigurable implementation of a conference management system based on the low-level Internet Protocol (IP) multicasting protocol. Each conference is structured as a software bus-a messaging system that provides a run-time interconnection model that acts as a separate agent (i.e., the bus) for routing, queuing, and delivering messages between distributed programs. Current software bus implementations like, however, rely on a centralized bus process and point-to-point protocols (i.e., TCP/IP) to route, queue, and deliver messages. We implement a software bus called the MULTIBUS that relies on a separate process only for routing and uses a reliable IP multicasting protocol for delivery of messages. The multicasting approach is scalable to large numbers of participants and allows for bus reconfigurations during system execution without notifying other participants of new IP addresses. <<ETX>>
A Quantitative Analysis of Performance of Shared Service Systems with Multiple Resource Contention

IT service providers employ server virtualization as a basic building block of their platforms to increase the cost effectiveness. The economic benefits from server virtualization come from higher resource utilization, reduced maintenance and operational costs including energy consumption. However, those benefits require efficient assignments of virtual servers or jobs to a limited number of physical hosts. The primary measures of evaluating efficiency of an assignment are that all the system resources are utilized effectively and the performance of each virtual machine is consistent with the desired performance bounds. While satisfying such SLA/performance bounds is essential for many classes of applications, the interference among the virtual machines makes such assurance admittedly difficult. This is primarily due to the complexity of estimating the completion time of jobs on assigned virtual servers. In this paper, we present a mathematical model for estimating the processing time of jobs in shared virtual servers by treating it as a conventional job scheduling problem. Given a job set, its total processing time is the fundamental objective function for a class of optimization problems, commonly known as job scheduling problems. The classical model that assumes the total processing time as the sum of individual processing times, unfortunately does not capture the multiple-resource contention to process a job. A job needs several resources such as processing cores and memory on the physical platform, hence the resource contention does not exhibit the simple classical behavior. In this work, we establish a general quantitative model for the total processing time for machines with multiple resources. A job is characterized by vector valued loading statistics and the total processing time of a job set is given by a quadratic function of those loading vectors. We validate the model with actual measurements of applications running times on a Xen-based virtualized infrastructure. The experimental results indicate that the proposed model is effective in capturing the resource contention in a virtualized platform. The average error rate of the estimated running time with synthetic workloads is 10.7% for identical jobs and 6.0% for heterogeneous jobs, and is within 6% with realistic workloads.
Current Accounts, Net Foreign Assets and the Implications of Cyclical Factors

Intertemporal models of the current account suggest that temporary income shocks are fully reflected in a country's net foreign asset position, so that agents invest abroad any savings generated by a positive income shock. On the other hand, a stylized fact in international economics is that there is a disproportionately large share of domestic assets in investors' portfolios. If investment risk is high and diminishing returns are weak, then savings from temporary income shocks may, in fact, be invested according to the existing portfolio composition. This implies that any bias in portfolios persists after a temporary shock. We estimate a model that explicitly allows for the possibility that the impact of initial portfolio allocation, proxied using net foreign assets, may differ, depending on whether shocks are permanent or temporary. Our results, from a panel of 18 OECD countries, suggest that initial portfolio allocation affects current account behavior following temporary, but not permanent, shocks. These results are therefore compatible with the "new rule".
Hybrid Digital-Analog Transmission for the Gaussian One-Helper Problem

The one-helper joint source-channel coding problem, in which a main source is to be reconstructed with minimum distortion with the help of a correlated helper source, is studied. Focusing on the case of Gaussian sources and a Gaussian multiple access channel (MAC), a generalized hybrid digital-analog scheme is proposed, in which each user allocates its available power among the analog and digital signals and transmits a superposition of the two. It is shown that this generalized hybrid scheme reduces to pure analog or pure digital transmission depending on the system parameters. Finally, the optimal hybrid transmission strategy is identified analytically in certain special scenarios modeling legacy systems.