Miracle-dz/UniFAR-FTUs huggingface dataset:
Shortest path queries among weighted obstacles in the rectilinear plane

We study the problems of processing single-source and two-point shortest path queries among weighted polygonal obstacles in the rectilinear plane. For the single-source case, we construct a data structure in O(n log n) time and O(n logn) space, where n is the number of obstacle vertices; this data structure enables us to report the length of a shortest path between the source and any query point in O(logn) time, and an actual shortest path in O(logn+k) time, where k is the number of edges on the output path. For the two-point case, we construct a data structure in O(n2 log n) time and space; this data structure enables us to report the length of a shortest path between two arbitrary query points in O(log n) time, and an actual shortest path in O(log n+ k) time. Our work improves and generalizes the previously best-known results on computing rectilinear shortest paths among weighted polygonal obstacles. We also apply our techniques to processing twopoint L1 shortest obstacle-avoiding path queries among arbitrary (i.e., not necessarily rectilinear) polygonal obstacles in the plane. No algorithm for processing two-point shortest path queries among weighted obstacles was previously known.
Re-refinement of the spliceosomal U4 snRNP core-domain structure

The structure of the spliceosomal U4 snRNP core domain has been re-refined following molecular replacement using the minimal U1 snRNP as a search model. RNA-omit maps show that the U4 Sm-site nucleotides AAUUUUU are bound to the seven Sm proteins SmF–SmE–SmG–SmD3–SmB–SmD1–SmD2 in the same manner as the U1 Sm-site nucleotides AAUUUGU except at the U-to-G substitution in SmD1.
A distributed greedy algorithm for constraint-based scheduling of energy resources

The current upheaval in the electricity sector is leading to distributed generation schemes and new grid structures. At the same time, this change is heading for a paradigm shift in controlling energy resources within the grid. Proactive scheduling of active power within a (from a controlling perspective) loosely coupled group of distributed energy resources demands for distributed optimization methods that take into account the individual feasible region in local search spaces. We propose a method that uses support vector based black-box models for constructing feasible regions for automated, local solution repair during scheduling and combine it with a distributed greedy approach for finding an appropriate partition of a desired target schedule into operable schedules for each participating actor.
Gabor filters for document analysis in Indian bilingual documents

Reasonable success has been achieved at developing monolingual OCR systems in Indian scripts. Scientists, optimistically, have started to look beyond. Development of bilingual OCR systems and OCR systems with capability to identify the text areas are some of the pointers to future activities in Indian scenario. The separation of text and non-text regions before considering the document image for OCR is an important task. In this paper, we present a biologically inspired, multi-channel filtering scheme for page layout analysis. The same scheme has been used for script recognition as well. Parameter tuning is mostly done heuristically. It has also been seen to be computationally viable for commercial OCR system development.
The Raf-MEK-ERK Cascade Represents a Common Pathway for Alteration of Intracellular Calcium by Ras and Protein Kinase C in Cardiac Myocytes*

Ras and protein kinase C (PKC), which regulate the Raf-MEK-ERK cascade, may participate in the development of cardiac hypertrophy, a condition characterized by diminished and prolonged contractile calcium transients. To directly examine the influence of this pathway on intracellular calcium ([Ca2+] i ), cardiac myocytes were cotransfected with effectors of this pathway and with green fluorescent protein, which allowed the living transfected myocytes to be identified and examined for [Ca2+] i via indo-1. Transfection with constitutively active Ras (Ha-RasV12) increased cell size, decreased expression of the myofibrils and the calcium-regulatory enzyme SERCA2, and reduced the magnitude and prolonged the decay phase of the contractile [Ca2+] i transients. Similar effects on [Ca2+] i were obtained with Ha-RasV12S35, a Ras mutant that selectively couples to Raf, and with constitutively active Raf. In contrast, Ha-RasV12C40, a Ras mutant that activates the phosphatidylinositol 3-kinase pathway, had a lesser effect. The PKC-activating phorbol ester, phorbol 12-myristate 13-acetate, also prolonged the contractile [Ca2+] i transients. Cotransfection with dnMEK inhibited the effects of Ha-RasV12, Raf, and phorbol 12-myristate 13-acetate on [Ca2+] i . The effects of Ha-RasV12 and Raf on [Ca2+] i were also counteracted by SERCA2 overexpression. Both Ras and PKC may thus regulate cardiac [Ca2+] i via the Raf-MEK-ERK cascade, and this pathway may represent a critical determinant of cardiac physiological function.
Mediator Influences Schizosaccharomyces pombe RNA Polymerase II-dependent Transcription in Vitro*

The fission yeast Schizosaccharomyces pombe has proved an important model system for cross-species comparative studies of many fundamental processes in the eukaryotic cell, such as cell cycle control and DNA replication. The RNA polymerase II transcription machinery is, however, still relatively poorly understood in S. pombe, partially due to the absence of a reconstituted in vitro transcription system. We have now purified S. pombe RNA polymerase II and its general initiation factors TFIIB, TFIIF, TFIIE, and TFIIH to near homogeneity. These factors enable RNA polymerase II to initiate transcription from the S. pombe alcohol dehydrogenase promoter (adh1p) when combined with Saccharomyces cerevisiae TATA-binding protein. We use our reconstituted system to examine effects of Mediator on basal transcription in vitro. S. pombe Mediator exists in two distinct forms, a free form, which contains the spSrb8, spTrap240, spSrb10, and spSrb11 subunits, and a smaller form, which lacks these four subunits and associates with RNA polymerase II to form a holoenzyme. We find that spSrb8/spTrap240/spSrb10/spSrb11 containing Mediator repress basal transcription, whereas Mediator lacking these subunits has a stimulatory effect on transcription. Our findings thus demonstrate that the spSrb8/spTrap240/spSrb10/spSrb11 subcomplex governs the ability of Mediator to stimulate or repress basal transcription in vitro.
Electrochemical Measurement of Electron Transfer Kinetics by Shewanella oneidensis MR-1*

Shewanella oneidensis strain MR-1 can respire using carbon electrodes and metal oxyhydroxides as electron acceptors, requiring mechanisms for transferring electrons from the cell interior to surfaces located beyond the cell. Although purified outer membrane cytochromes will reduce both electrodes and metals, S. oneidensis also secretes flavins, which accelerate electron transfer to metals and electrodes. We developed techniques for detecting direct electron transfer by intact cells, using turnover and single turnover voltammetry. Metabolically active cells attached to graphite electrodes produced thin (submonolayer) films that demonstrated both catalytic and reversible electron transfer in the presence and absence of flavins. In the absence of soluble flavins, electron transfer occurred in a broad potential window centered at ∼0 V (versus standard hydrogen electrode), and was altered in single (ΔomcA, ΔmtrC) and double deletion (ΔomcA/ΔmtrC) mutants of outer membrane cytochromes. The addition of soluble flavins at physiological concentrations significantly accelerated electron transfer and allowed catalytic electron transfer to occur at lower applied potentials (−0.2 V). Scan rate analysis indicated that rate constants for direct electron transfer were slower than those reported for pure cytochromes (∼1 s−1). These observations indicated that anodic current in the higher (>0 V) window is due to activation of a direct transfer mechanism, whereas electron transfer at lower potentials is enabled by flavins. The electrochemical dissection of these activities in living cells into two systems with characteristic midpoint potentials and kinetic behaviors explains prior observations and demonstrates the complementary nature of S. oneidensis electron transfer strategies.
Language Identification from Visual-Only Speech

The goal of the present investigation was to examine how observers identify English and Spanish from visual-only displays of speech. First, we replicated the recent findings of Soto-Faraco et al. (2007) with Spanish and English bilingual and monolingual observers using a different methodology. We found that prior linguistic experience affected response bias, but not sensitivity (Experiment 1). Additional experiments investigated the cues that observers used to carry out the language identification task. Participants were able to reliably identify languages when video clips were temporally-reversed, suggesting that prosody provides cues to language identity (Experiment 2). The contribution of lexical information to language identification was also investigated in Experiment 3. Participants’ ability to identify stimulus direction (i.e., forwards vs. backwards) confirmed their sensitivity to differences in naturalness (Experiment 4). Taken together, the results of these four experiments indicate that prior linguistic experience, prosody, and perceived naturalness influence visual-only language identification
Use of Spinel in Mineral Exploration: The Enigmatic Giant Mascot Ni-Cu-PGE Deposit - Possible Ties to Wrangellia and Metallogenic Significance

Numerous mineralogical and petrological studies over the last several decades have shown that spinel (chromite) is extremely sensitive to the ambient conditions of crystallization in magmatic environments and, as such, can be used as a petrogenetic indicator (Irvine, 1965, 1967). Whereas modern techniques in diamond exploration routinely rely on a suite of important indicator minerals (e.g. garnet, pyroxene, ilmenite), spinel is a sorely underutilized tool in the search for economic deposits of platinum-group elements (PGE) and Ni-Cu-PGE sulphides hosted by ultramafic and mafic rocks.
Trace Ratio Criterion-Based Kernel Discriminant Analysis for Fault Diagnosis of Rolling Element Bearings Using Binary Immune Genetic Algorithm

The rolling element bearing is a core component of many systems such as aircraft, train, steamboat, and machine tool, and their failure can lead to reduced capability, downtime, and even catastrophic breakdowns. Due to misoperation, manufacturing deficiencies, or the lack of monitoring and maintenance, it is often found to be the most unreliable component within these systems. Therefore, effective and efficient fault diagnosis of rolling element bearings has an important role in ensuring the continued safe and reliable operation of their host systems. This study presents a trace ratio criterion-based kernel discriminant analysis (TR-KDA) for fault diagnosis of rolling element bearings. The binary immune genetic algorithm (BIGA) is employed to solve the trace ratio problem in TR-KDA. The numerical results obtained using extensive simulation indicate that the proposed TR-KDA using BIGA (called TR-KDA-BIGA) can effectively and efficiently classify different classes of rolling element bearing data, while also providing the capability of real-time visualization that is very useful for the practitioners to monitor the health status of rolling element bearings. Empirical comparisons show that the proposed TR-KDA-BIGA performs better than existing methods in classifying different classes of rolling element bearing data. The proposed TR-KDA-BIGA may be a promising tool for fault diagnosis of rolling element bearings.
Introducing Thread Criticality awareness in Prefetcher Aggressiveness Control

A single parallel application running on a multi-core system shows sub-linear speedup because of slow progress of one or more threads known as critical threads. Some of the reasons for the slow progress of threads are (1) load imbalance, (2) frequent cache misses and (3) effect of synchronization primitives. Identifying critical threads and minimizing their cache miss latencies can improve the overall execution time of a program. One way to hide and tolerate the cache misses is through hardware prefetching. Hardware prefetching is one of the most commonly used memory latency hiding techniques. Previous studies have shown the effectiveness of hardware prefetchers for multiprogrammed workloads (multiple sequential applications running independently on different cores). In contrast to multiprogrammed workloads, the performance of a single parallel application depends on the progress of slow progress(critical) threads. This paper introduces a prefetcher aggressiveness control mechanism called Thread Criticality-aware Prefetcher Aggressiveness Control (TCPAC). TCPAC controls the aggressiveness of the prefetchers at the L2 prefetching controllers (known as TCPAC-P), DRAM controller (known as TCPAC-D) and at the Last Level Cache (LLC) controller (known as TCPAC-C) using prefetch accuracy and thread progress. Each TCPAC sub-technique outperforms the respective state-of-the-art techniques such as HPAC [2], PADC [4], and PACMan [3] and the combination of all the TCPAC sub-techniques named as TCPAC-PDC outperforms the combination of HPAC, PADC, and PACMan. On an average, on a 8 core system, in terms of improvement in execution time, TCPAC-PDC outperforms the combination of HPAC, PADC, and PACMan by 7.61%. For 12 and 16 cores, TCPAC-PDC beats the state-of-the-art combinations by 7.21% and 8.32% respectively.
Body, Subject and Power in China

It sounds good when knowing the body subject and power in china in this website. This is one of the books that many people looking for. In the past, many people ask about this book as their favourite book to read and collect. And now, we present hat you need quickly. It seems to be so happy to offer you this famous book. It will not become a unity of the way for you to get amazing benefits at all. But, it will serve something that will let you get the best time and moment to spend for reading the book.
Random selection false source-based algorithm for protecting source-location privacy in WSNs

In order to improve the issue that the existing source location privacy protection algorithms have lower safety periods, the random selection fake source-based algorithm for protecting source-location privacy is put forward. The algorithm selects phantom source node with random walk. The intermediate node is selected from the nodes on the shortest phantom source-sink path with the random number and information about hops to sink. Fake source node is selected by intermediate node through random walk. Analytical results demonstrate that the algorithm can select intermediate node during the process of each packet transmission. The simulation results show that the algorithm can enhance safety period and improve the level of source-location privacy against local adversary.
Multi-class linear dimension reduction by generalized Fisher criteria

Linear Disciminant Analysis is in general unable to ﬁnd the lower-dimensional feature space which maximizes the class discrimination, even if the class distributions can be assumed to be very simple, e.g. Gaussians with identical covariance matrices. In this paper we reformulate the K -class Fisher criterion as a sum of K(K (cid:0) 1)=2 2 -class Fisher criteria. This formulation allows to weigh class pair contributions according to their relevance for classiﬁcation. Further it offers an obvious way how to cope with heteroscedastic models. We propose a particular weighting scheme which attempts to approximate the pairwise Bayes error. Moderate improvements are obtained on the TIMIT phoneme classiﬁcation task.
Can Systems Requiring Unbounded Memory Further Work

reach by simulating the execution of the graph by a dynamic dataflow machine. This type of search suffices, for the system in this figure, to show that the subsystem consisting of actors 2, 3, and 4 never need have more than one token on any arc. Furthermore , it behaves as a whole like a synchronous actor, reading one token from actor 1 and writing one token to actor 5. An alternative approach is to construct a preamble, which is a sequence of actor executions that eliminates any delays on bool-ean arcs. In this case, executing actors 1 and 2 in the preamble will suffice; this transforms the system to a system that has bounded cycle length. If the graph cannot be scheduled in bounded memory, the state enumeration procedure described above will not terminate. One possible solution to this difficulty is to impose an upper bound to the number of tokens that may appear on each arc, according to some heuristic, and to assume that there is a problem if this bound is exceeded. A technique similar to this is used in Ptole-my's dynamic dataflow scheduler [5]. It is also possible to terminate the state enumeration algorithm " in the other direction " , with an indication that unbounded memory is definitely required, by a type of mathematical induction. In graphs such as Gao's example discussed earlier, it is possible to show that, by starting in a state with tokens on a particular arc, we must always reach a state that has tokens on that same arc but is otherwise the same, for any value of , given certain boolean outcomes. Researchers pursuing this problem have used the label " well-behaved " to describe systems with bounded memory requirements , but perfectly valid problems may require unbounded memory; consider a parser for a context-free programming language , for example. The traditional solution to such problems has been to use dynamic scheduling with dynamic memory allocation. However, in any such problem there are usually subsystems that each require bounded memory, so it is still advantageous to cluster the graph so as to be able to use static memory allocation for arcs that can be demonstrated to require bounded memory. The clustering algorithm described in this paper accomplishes this task readily. Some complex and irregular graphs will not be successfully clustered by our algorithm, and state enumeration requires a heuristic to …
Does Child Labour Have a Negative Impact on Child Education and Health? A Case Study in Rural Cambodia

This paper examines whether child labour affects the acquisition of a child's human capital. For this purpose, a behavioural model in which child labour is itself a choice and simultaneous equation models with limited dependent variables are employed to examine the determinants of human capital formation and its relationship with child labour. No trade-off relationship could be found between child labour and child schooling attainment. However, it was found that child labour is not detrimental to a child's health and nutritional status; rather, it improves these if children work within a critical threshold level.
Homozygosity Mapping and Targeted Sanger Sequencing Identifies Three Novel CRB1 (Crumbs homologue 1) Mutations in Iranian Retinal Degeneration Families

Background: Inherited retinal diseases (IRDs) are a group of genetic disorders with high degrees of clinical, genetic and allelic heterogeneity. IRDs generally show progressive retinal cell death resulting in gradual vision loss. IRDs constitute a broad spectrum of disorders including retinitis pigmentosa and Leber congenital amaurosis. In this study, we performed genotyping studies to identify the underlying mutations in three Iranian families. Methods: Having employed homozygosity mapping and Sanger sequencing, we identified the underlying mutations in the crumbs homologue 1 gene. The CRB1 protein is a part of a macromolecular complex with a vital role in retinal cell polarity, morphogenesis, and maintenance. Results: We identified a novel homozygous variant (c.1053_1061del; p.Gly352_Cys354del) in one family, a combination of a novel (c.2086T>C; p.Cys696Arg) and a known variant (c.2234C>T, p.Thr745Met) in another family and a homozygous novel variant (c.3090T>A; p.Asn1030Lys) in a third family. Conclusion: This study shows that mutations in CRB1 are relatively common in Iranian non-syndromic IRD patients.
Differences in White Privilege Attitudes and Religious Beliefs Across Racial Affect Types

This study extends research on the psychosocial costs of racism to Whites (PCRW) cluster types. We examined differences in White privilege attitudes across different PCRW cluster types in a sample of White Christian students (N = 437). We also examined differences in religious beliefs, specifically religious liberalism and sanctification of social justice, across students in different PCRW cluster types. This provides an initial intersection of PCRW cluster types, White privilege attitudes, and religious beliefs. We found that, compared with students in all other types, students in the Antiracist cluster type reported (a) higher levels of White privilege attitudes conducive to working for racial justice (i.e., willingness to confront White privilege, White privilege awareness, and White privilege remorse) and (b) higher levels of religious liberalism. We also found differences for sanctification of social justice. We discuss additional findings and implications for counseling psychologists and diversity educators working with White Christian students.
Web2Peer: A Peer-to-Peer Infrastructure for Publishing/Locating/Replicating Web Pages on Internet

This paper presents a decentralized infrastructure, called Web2Peer, which makes Web pages available on Internet through P2P networks. Different from the conventional Web, the proposed approach does not need, for instance, a HTTP address or a central Web Server. Web2Peer provides a set of functions for publishing, locating, and replicating Web pages on Internet ensuring high availability and fault tolerance. Our infrastructure allows anyone who has a computer connected to the Internet, even through a domestic ADSL connection, to publish Web pages through their own machines without any additional cost
Living on the edge: A geometric theory of phase transitions in convex optimization

Recent empirical research indicates that many convex optimization problems with random constraints exhibit a phase transition as the number of constraints increases. For example, this phenomenon emerges in the $\ell_1$ minimization method for identifying a sparse vector from random linear samples. Indeed, this approach succeeds with high probability when the number of samples exceeds a threshold that depends on the sparsity level; otherwise, it fails with high probability. This paper provides the first rigorous analysis that explains why phase transitions are ubiquitous in random convex optimization problems. It also describes tools for making reliable predictions about the quantitative aspects of the transition, including the location and the width of the transition region. These techniques apply to regularized linear inverse problems with random measurements, to demixing problems under a random incoherence model, and also to cone programs with random affine constraints. These applications depend on foundational research in conic geometry. This paper introduces a new summary parameter, called the statistical dimension, that canonically extends the dimension of a linear subspace to the class of convex cones. The main technical result demonstrates that the sequence of conic intrinsic volumes of a convex cone concentrates sharply near the statistical dimension. This fact leads to an approximate version of the conic kinematic formula that gives bounds on the probability that a randomly oriented cone shares a ray with a fixed cone.