Miracle-dz/UniFAR-FTUs huggingface dataset:
Situasjonen til samer med funksjonsnedsettelse

Delrapporten ar ett viktigt bidrag till kunskapen om levnadsforhallanden och storre synlighet for samer med funktionsnedsattning och deras familjer. Rapporten beskriver hur det ar i Norge och beror .
Implementing Jalape~ No in Java

Jalape~ no is a virtual machine for Java servers written in Java. A running Java program involves four layers of functionality: the user code, the virtual-machine, the operating system, and the hardware. By drawing the Java / non-Java boundary below the virtual machine rather than above it, Jalape~ no reduces the boundary-crossing overhead and opens up more opportunities for optimization. To get Jalape~ no started, a boot image of a working Jalape~ no virtual machine is concocted and written to a le. Later, this le can be loaded into memory and executed. Because the boot image consists entirely of Java objects, it can be concocted by a Java program that runs in any JVM. This program uses re ection to convert the boot image into Jalape~ no's object format. A special Magic class allows unsafe casts and direct access to the hardware. Methods of this class are recognized by Jalape~ no's three compilers, which ignore their bytecodes and emit special-purpose machine code. User code will not be allowed to call Magic methods so Java's integrity is preserved. A small non-Java program is used to start up a boot image and as an interface to the operating system. Java's programming features | object orientation, type safety, automatic memory management | greatly facilitated development of Jalape~ no. However, we also discovered some of the langauge's limitations.
Shortest Average-Distance Query on Heterogeneous Neighboring Objects

Currently, most of the processing techniques for the conventional location-based queries focus only on a single type of objects. However, in real-life applications the user may be interested in obtaining information about different types of objects, in terms of their neighboring relationship. We term the different types of objects closer to each other the heterogeneous neighboring objects (HNOs for short). Efficient processing of the location-based queries on the HNOs is more complicated than that on a single data source, because the neighboring relationship between the HNOs inevitably affects the query result. In this paper, we present a novel and important query on the HNOs, namely the shortest average-distance query (SAvgDQ for short), which can provide useful object information by considering both the spatial closeness of objects to the query object and the neighboring relationship between objects. Given a query object q and a distance d, the SAvgDQ retrieves a set of HNOs, such that the distances between any two objects in this set are less than or equal to d and its average distance to q is the smallest among all HNOs sets. To efficiently process the SAvgDQ, we develop an algorithm, the SAvgDQ processing algorithm, which operates based on three devised heuristics, the HNOs-qualifying heuristic, the HNOs-pruning heuristic, and the SAvgD-pruning heuristic, to reduce the number of distance computations required for query processing. Comprehensive experiments are conducted to demonstrate the effectiveness of the heuristics and the efficiency of the proposed algorithm.
Localization and Signaling of GβSubunit Ste4p Are Controlled by a-Factor Receptor and thea-Specific Protein Asg7p

ABSTRACT Haploid yeast cells initiate pheromone signaling upon the binding of pheromone to its receptor and activation of the coupled G protein. A regulatory process termed receptor inhibition blocks pheromone signaling when the a-factor receptor is inappropriately expressed inMATa cells. Receptor inhibition blocks signaling by inhibiting the activity of the G protein β subunit, Ste4p. To investigate how Ste4p activity is inhibited, its subcellular location was examined. In wild-type cells, α-factor treatment resulted in localization of Ste4p to the plasma membrane of mating projections. In cells expressing the a-factor receptor, α-factor treatment resulted in localization of Ste4p away from the plasma membrane to an internal compartment. An altered version of Ste4p that is largely insensitive to receptor inhibition retained its association with the membrane in cells expressing the a-factor receptor. The inhibitory function of the a-factor receptor required ASG7, an a-specific gene of previously unknown function. ASG7 RNA was induced by pheromone, consistent with increased inhibition as the pheromone response progresses. The a-factor receptor inhibited signaling in its liganded state, demonstrating that the receptor can block the signal that it initiates. ASG7 was required for the altered localization of Ste4p that occurs during receptor inhibition, and the subcellular location of Asg7p was consistent with its having a direct effect on Ste4p localization. These results demonstrate that Asg7p mediates a regulatory process that blocks signaling from a G protein β subunit and causes its relocalization within the cell.
A vision-based walking posture analysis system without markers

Using a simple method or instrument to realize our health condition not only reduces the cost of medical resources but also achieves the objective of self-health management. This study proposes a vision-based human walking posture analysis system without the need of markers. The system can be applied at home for self-health care or used in health-care institutions. This study analyzes the human walking posture based on side-view and front-view images of a subject. Four features are extracted from the images for walking posture evaluation, including body line, neck line, center of gravity (COG) and gait width. Tilting angles associated with body line and neck line and their periodic variation are adopted to evaluate upper body posture for any abnormality and its correction. The COG and gait width features are used to evaluate the posture condition of lower body parts. Since these two features show an inverse relationship for a normal posture, they can be used to evaluate the stability of a walking posture and see if any posture correction is needed. The experiment results show that this study successfully extracts all the four features mentioned above from the silhouette image of human body. In addition, the proposed system is compared to a traditional marker-based system by performing correlation analysis between their experimental results on the 8 standard decompositions of a full gait cycle, resulting in very high positive correlation. It shows that the proposed walking posture analyzer achieves the performance of a traditional marker-based system with lower cost and higher convenience.
Water Level Detection for River Surveillance utilizing JP2K Wavelet Transform

This report discusses how to detect water level of a river from video signal for the purpose of environmental surveillance. Video signal is assumed to be taken 24 hours a day with a Web camera installed to the river side. A DSP inside the video sensor is supposed to send the water level data regularly and video signal irregularly on demand. It is our purpose to utilize JPEG 2000 (JP2K) core technology for not only "compression" of video data but also "recognition" of river's water level so that redundancy of signal processing of the video sensor can be reduced
On the Exploration of Adaptive Mechanisms Providing Reliability in Clustered WSNs for Power Plant Monitoring

Wireless Sensor Networks (WSNs) are used in almost every sensing and detection environment instead of wired devices in the current world, all the more in power plant monitoring applications. In such a kind of environment, providing reliability is a challenging task, since WSN makes use of low powered sensors. There are many existing works that provide reliable transmission in WSN (predominantly via multipath routing). However, most of the existing works take additional delay, excessive packet loss, and energy consumption, and hence they provide less packet delivery and throughput. Adaptive Priority Routing (APR) is first proposed during the initial design to provide efficiency in next hop selection. APR computes the priority value for selecting the intermediate nodes during the data transmission in order to improve the packet delivery, throughput, and energy efficiency. In addition to this, APR is developed into QAPR protocol to provide reliability which can operate in two modes, D representing distance mode and Q representing quality of service (QoS) mode. The proposed work is simulated in both flat topology and hierarchical topologies and the simulation analysis shows that the reliability is increased significantly in comparison with existing works.
A composite score for predicting errors in protein structure models

Reliable prediction of model accuracy is an important unsolved problem in protein structure modeling. To address this problem, we studied 24 individual assessment scores, including physics‐based energy functions, statistical potentials, and machine learning–based scoring functions. Individual scores were also used to construct ∼85,000 composite scoring functions using support vector machine (SVM) regression. The scores were tested for their abilities to identify the most native‐like models from a set of 6000 comparative models of 20 representative protein structures. Each of the 20 targets was modeled using a template of <30% sequence identity, corresponding to challenging comparative modeling cases. The best SVM score outperformed all individual scores by decreasing the average RMSD difference between the model identified as the best of the set and the model with the lowest RMSD (ΔRMSD) from 0.63 Å to 0.45 Å, while having a higher Pearson correlation coefficient to RMSD (r = 0.87) than any other tested score. The most accurate score is based on a combination of the DOPE non‐hydrogen atom statistical potential; surface, contact, and combined statistical potentials from MODPIPE; and two PSIPRED/DSSP scores. It was implemented in the SVMod program, which can now be applied to select the final model in various modeling problems, including fold assignment, target–template alignment, and loop modeling.
Increased Neurotransmitter Release at the Neuromuscular Junction in a Mouse Model of Polyglutamine Disease

In Huntington's disease (HD), the expansion of polyglutamine (polyQ) repeats at the N terminus of the ubiquitous protein huntingtin (htt) leads to neurodegeneration in specific brain areas. Neurons degenerating in HD develop synaptic dysfunctions. However, it is unknown whether mutant htt impacts synaptic function in general. To investigate that, we have focused on the nerve terminals of motor neurons that typically do not degenerate in HD. Here, we have studied synaptic transmission at the neuromuscular junction of transgenic mice expressing a mutant form of htt (R6/1 mice). We have found that the size and frequency of miniature endplate potentials are similar in R6/1 and control mice. In contrast, the amplitude of evoked endplate potentials in R6/1 mice is increased compared to controls. Consistent with a presynaptic increase of release probability, synaptic depression under high-frequency stimulation is higher in R6/1 mice. In addition, no changes were detected in the size and dynamics of the recycling synaptic vesicle pool. Moreover, we have found increased amounts of the synaptic vesicle proteins synaptobrevin 1,2/VAMP 1,2 and cysteine string protein-α, and the SNARE protein SNAP-25, concomitant with normal levels of other synaptic vesicle markers. Our results reveal that the transgenic expression of a mutant form of htt leads to an unexpected gain of synaptic function. That phenotype is likely not secondary to neurodegeneration and might be due to a primary deregulation in synaptic protein levels. Our findings could be relevant to understand synaptic toxic effects of proteins with abnormal polyQ repeats.
Heterologous Expression of Hepatitis C Virus Core Protein in Oil Seeds of Brassica napus L.

Background: Hepatitis c virus (HCV), prevalent among 3% of the world population, is a major worldwide public health concern and an effective vaccination could help to overcome this problem. Plant seeds as low-cost vaccine expression platforms are highly desirable to produce antigens. Objectives: The present study was aimed at investigating the possible expression of recombinant HCV core protein, as a leading HCV vaccine candidate, in canola (Brassica napus) plant seeds in order to be used as an effective immunogen for vaccine researches. Materials and Methods: A codon-optimized gene harboring the Kozak sequence, 6 × His-tag, HCVcp (1 - 122 residues) and KDEL (Lys-Asp-Glu-Leu) peptide in tandem was designed and expressed under the control of the seed specific promoter, fatty acid elongase 1 (FAE1), to accumulate the recombinant protein in canola (B. napus L.) seeds. Transgenic lines were screened and the presence of the transgene was confirmed in the T0 plants by polymerase chain reaction (PCR). The quantity and quality of the HCV core protein (HCVcp) in transgenic seeds were evaluated by enzyme-linked immunosorbent assay (ELISA) and western blot, respectively. Results: Western blot analysis using anti-His antibody confirmed the presence of a 15 kDa protein in the seeds of T1 transgenic lines. The amount of antigenic protein accumulated in the seeds of these transgenic lines was up to 0.05% of the total soluble protein (TSP). Conclusions: The canola oilseeds could provide a useful expression system to produce HCV core protein as a vaccine candidate.
Map1b Is Required for Axon Guidance and Is Involved in the Development of the Central and Peripheral Nervous System

Microtubule-associated proteins such as MAP1B have long been suspected to play an important role in neuronal differentiation, but proof has been lacking. Previous MAP1B gene targeting studies yielded contradictory and inconclusive results and did not reveal MAP1B function. In contrast to two earlier efforts, we now describe generation of a complete MAP1B null allele. Mice heterozygous for this MAP1B deletion were not affected. Homozygous mutants were viable but displayed a striking developmental defect in the brain, the selective absence of the corpus callosum, and the concomitant formation of myelinated fiber bundles consisting of misguided cortical axons. In addition, peripheral nerves of MAP1B-deficient mice had a reduced number of large myelinated axons. The myelin sheaths of the remaining axons were of reduced thickness, resulting in a decrease of nerve conduction velocity in the adult sciatic nerve. On the other hand, the anticipated involvement of MAP1B in retinal development and γ-aminobutyric acid C receptor clustering was not substantiated. Our results demonstrate an essential role of MAP1B in development and function of the nervous system and resolve a previous controversy over its importance.
Enabling User-Policy-Confined VM Migration in Trusted Cloud Computing

The trusted cloud environment model, based on the trusted computing technology, provides cloud users the capabilities to remotely attest the trustworthiness of cloud service. But unlike physical machine, the virtual machine is migratory among cloud nodes constantly which makes it hard for cloud users to guarantee the Virtual Machine (VM) is running in a trusted cloud node and its migration is consistent with user's policy. Since the migration operation is entirely transparent to cloud users, it is hard for them to launch the remote attestation with the existing remote attestation scheme. To guarantee the migration of VMs is consistent with user's policy, we propose a User-Policy-Confined VM Migration Protocol (UVMP), which provides a new attestation scheme that addresses the limitation and enables VM migration to be controllable and verifiable by cloud users by introducing the Ciphertext-Policy AttributeBased Encryption(CP-ABE) into attestation field. To demonstrate that UVMP is practical, we incorporate it in the Xen opensource virtualization platform and implement UTVMS: UserPolicy-Confined Trusted VM Migration System. Our evaluation suggests that the attestation scheme cannot lead to the obvious performance on the VM migration by analyzing the migration latency. The attestation scheme can provide greater flexibility for cloud users to control their own VM migration.
New algorithms and lower bounds for sequential access data compression

This thesis concerns sequential-access data compression, i.e., by algorithms that read the input one or more times from beginning to end. In one chapter we consider adaptive prefix coding, for which we must read the input character by character, outputting each character's self-delimiting codeword before reading the next one. We show how to encode and decode each character in constant worst-case time while producing an encoding whose length is worst-case optimal. In another chapter we consider one-pass compression with memory bounded in terms of the alphabet size and context length, and prove a nearly tight tradeoff between the amount of memory we can use and the quality of the compression we can achieve. In a third chapter we consider compression in the read/write streams model, which allows us passes and memory both polylogarithmic in the size of the input. We first show how to achieve universal compression using only one pass over one stream. We then show that one stream is not sufficient for achieving good grammar-based compression. Finally, we show that two streams are necessary and sufficient for achieving entropy-only bounds.
Structure and Performance of Decision Support Algorithms on Active Disks

Growth and usage trends for large decision support databases indicate that there is a need for architectures that scale the processing power as the dataset grows. These trends indicate that the processing demand for large decision support databases is growing faster than the improvement in performance of commodity processors. To meet this need, several researchers have recently proposed Active Disk/IDISK architectures which integrate substantial processing power and memory into disk units. In this paper, we examine the utility of Active Disks for decision support databases. We try to answer the following questions. First, is it possible to restructure algorithms for common decision support tasks to utilize Active Disks? Second, how does the performance of Active Disks compare with that of traditional servers for these tasks? Finally, how would Active Disks be integrated into the software architecture of decision support databases?
Cooperative Update Exchange in the Youtopia System

Youtopia is a platform for collaborative management and integration of relational data. At the heart of Youtopia is an update exchange abstraction: changes to the data propagate through the system to satisfy user-specified mappings. We present a novel change propagation model that combines a deterministic chase with human intervention. The process is fundamentally cooperative and gives users significant control over how mappings are repaired. An additional advantage of our model is that mapping cycles can be permitted without compromising correctness. We investigate potential harmful interference between updates in our model; we introduce two appropriate notions of serializability that avoid such interference if enforced. The first is very general and related to classical final-state serializability; the second is more restrictive but highly practical and related to conflict-serializability. We present an algorithm to enforce the latter notion. Our algorithm is an optimistic one, and as such may sometimes require updates to be aborted. We develop techniques for reducing the number of aborts and we test these experimentally.
Cancer esearch cular and Cellular Pathobiology ruitment of Phosphorylated NPM 1 to Sites of DNA R age through RNF 8-Dependent Ubiquitin Conjugates

nloaded tein accumulation at DNA double-strand breaks (DSB) is essential for genome stability; however, the nisms governing these events are not fully understood. Here, we report a new role for the nucleophosrotein NPM1 in these mechanisms. Thr199-phosphorylated NPM1 (pT199-NPM1) is recruited to nuclear amage foci induced by ionizing radiation (IR). Foci formation is impaired by depletion of the E3 ubiligases RNF8 and RNF168 or the E2 Ubc13, and pT199-NPM1 binds to Lys63-linked ubiquitin polymers o. Thus, phosphorylated NPM1 may interact with RNF8-dependent ubiquitin conjugates at sites of DNA e. The interaction was found to rely on T199 phosphorylation, an acidic tract, and an adjacent ubiquitincting motif–like domain. Depletion of the breast cancer suppressor BRCA1 or its partner, RAP80, ced IR-induced NPM1 foci and prolonged persistence of the foci, possibly implicating BRCA1 in -NPM1 action and dynamics. Replacement of endogenous NPM1 with its nonphosphorylable mutant prolonged persistence of IR-induced RAD51 foci accompanied by unrepaired DNA damage. T199A Collectively, our findings suggest that phosphorylated NPM1 is a novel component in DSB repair that is recruited by ubiquitin conjugates downstream of RNF8 and RNF168. Cancer Res; 70(17); 6746–56. ©2010 AACR.
Snakes: a technique for line smoothing and displacement in map generalisation

Abstract: Line smoothing in map generalisation is commonly seen as a comparatively simple operation. In this paper, however, the snakes model will be examined as a basic technique with respect to combined operations of displacement and smoothing. For line smoothing, two different snake models and their parametrisation with curvature controlled and constant parameters are examined. Further the snakes model for smoothing will be combined with the already known displacement model. Two combined methods will be proposed, the alternation of algorithms and a linear combination of the snakes equation systems, of which the former shows more flexibility. Selected test examples are illustrated and discussed, followed by an assessment of the models.
Robust stochastic parsing using the inside-outside algorithm

The paper describes a parser of sequences of (English) part-of-speech labels which utilises a probabilistic grammar trained using the inside-outside algorithm. The initial (meta)grammar is defined by a linguist and further rules compatible with metagrammatical constraints are automatically generated. During training, rules with very low probability are rejected yielding a wide-coverage parser capable of ranking alternative analyses. A series of corpus-based experiments describe the parser's performance.
Economy driven real-time scheduling for cloud

Real-time scheduling of Virtual Machines (VMs) has always been challenging for service providers, when economics of renting services on cloud need to be considered together with the deadline constraints. The diversity among VMs and price based urgent demands makes scheduling more complex when aim of service provider is to maximize the revenue. For maximization of revenue the schedule should have high success rate but at the same time preference should be given to higher paying clients. The work compares, proposed Urgency Factor Prioritized (UFP) scheduling policy, which is a greedy approach wherein urgent tasks are charged more and promoted, with Earliest Deadline First (EDF), which is yet optimal solution to maximize success rate. The observations suggest that selection and preference of the scheduling policy should depend on urgency and workload of VMs. Finally, for maximization of revenue, an economy driven real-time scheduling policy is suggested which takes best of UFP and EDF. The work implemented UFP and EDF in credit allocation strategy of Xen hypervisor. Strategies for deadline a nd cost calculations are derived considering the urgency, workload associated and real-time requirements of a VM.