Miracle-dz/UniFAR-FTUs huggingface dataset:
Stoners eat your broccoli: Folic acid enhances the effects of cannabinoids at behavioral, cellular, and transcriptional levels

Recent interest in cannabinoid receptors as therapeutic targets has spurred the investigation into the physiochemical responses to their activation. The cannabinoid pathways in mammalian systems of adult male CD1 mice were investigated using a combinatorial approach based on folic acid mediated response. Various tests of cannabimimetic activity of folic acid showed that the combination of folic acid with either AEA (N-arachidonoylethanolamine, ananamide) or THC (∆ 9 tetrahydrocannabinol) amplified the effects of the cannabinoid. Levels of cyclic AMP (cAMP) in brain tissue also show a marked reduction after the addition of folic acid to either AEA or THC at both 1 and 2.5 µM dose levels in comparison to the cannabinoid alone. Genetic studies using CB1 -/- knockout mice suggest the existence of a CB3 receptor localized in the brain tissue of mice that has yet to be cloned or characterized. In the CB1 knockout mice, addition of folic acid and THC resulted in a 129% increase of [ 3 H]THC binding in the cortex and significant increases in all other areas of the brain when compared to THC alone. This indicates that folic acid is indeed affecting the neurotransmitter pathways of the cannabinoids by potentially acting with a third cannabinoid receptor. Using serial analysis of gene expression, it was found that transcription levels of genes shown to be up-regulated by cannabinoids were further increased upon addition of folic acid. ©2002 Elsevier Science B.V. All rights reserved.
Face Detection Based on Template Matching and 2DPCA Algorithm

Human face recognition technology is a popular research topic in the biometrics identification area. Face detection is the most important pre-processing module of a face recognition system, and it plays an important role in applications such as video surveillance, human computer interface. The purpose of the face detection is to search and orient faces in images in complex background. In this paper, we propose a hierarchical face detection method by using the template matching algorithm and 2DPCA algorithm. The method includes two different classifiers. The first one is called rough classifier, which filtrates the most of the non-face. The second one is a core classifier, which uses 2DPCA algorithm to detect the face based on the result from the first classifier. The results of the experiment indicates that we implement hierarchical detection to face images not only improves the accurate rate of the face detection, but also shortens detection time greatly.
The Short and Long of It: Neural Correlates of Temporal-order Memory for Autobiographical Events

Previous functional neuroimaging studies of temporal-order memory have investigated memory for laboratory stimuli that are causally unrelated and poor in sensory detail. In contrast, the present functional magnetic resonance imaging (fMRI) study investigated temporal-order memory for autobiographical events that were causally interconnected and rich in sensory detail. Participants took photographs at many campus locations over a period of several hours, and the following day they were scanned while making temporal-order judgments to pairs of photographs from different locations. By manipulating the temporal lag between the two locations in each trial, we compared the neural correlates associated with reconstruction processes, which we hypothesized depended on recollection and contribute mainly to short lags, and distance processes, which we hypothesized to depend on familiarity and contribute mainly to longer lags. Consistent with our hypotheses, parametric fMRI analyses linked shorter lags to activations in regions previously associated with recollection (left prefrontal, parahippocampal, precuneus, and visual cortices), and longer lags with regions previously associated with familiarity (right prefrontal cortex). The hemispheric asymmetry in prefrontal cortex activity fits very well with evidence and theories regarding the contributions of the left versus right prefrontal cortex to memory (recollection vs. familiarity processes) and cognition (systematic vs. heuristic processes). In sum, using a novel photo-paradigm, this study provided the first evidence regarding the neural correlates of temporal-order for autobiographical events.
Performance Evaluation of CLIR and MLIR using Precision Metric Variants

The performance evaluation of information retrieval systems has achieved a high momentum in the last few years. Basic performance measures of information retrieval systems include precision and recall. While these measures work well in monolingual web retrieval, they are not suitable for CLIR (Cross-lingual Information Retrieval) and MLIR (Multilingual Information Retrieval) where two or more languages are involved respectively. Many measures were proposed to improve over the precision-recall measures but they are inadequate to exhibit the language wise performance evaluations. Precision metric variants for evaluating the performance over the retrieval of the documents in various languages have been proposed in this research. This paper also identifies the major strengths and shortcomings of some of the existing IR performance evaluation measures. This paper concentrates on the metric based performance evaluation on two variants of IR. Experiments are conducted in two phases (CLIR and MLIR). These two phases of experiments have been done on practical web search systems and proved that the proposed measures are necessary to reveal the importance of language wise comparisons.
Improved Blind Interference Alignment in a Cellular Environment Using Power Allocation and Cell-Based Clusters

Fundamentally, benefits of Multiple Input Multiple Output (MIMO) in wireless systems rest on increasing the number of Degrees of Freedom (DoFs) that can be exploited for transmission. DoFs can be used to increase spectral efficiency and/or provide increased diversity. However, exploiting DoFs in MIMO often requires knowledge of Channel State Information (CSI) at the transmitter and/or receiver. Obtaining CSI creates overheads due to the required use of wireless resources for CSI-estimation pilots and/or CSI feedback. This can create a fundamental "dimensionality bottleneck" that limits the growth in spectral efficiency for some conventional MIMO systems. Recently a new class of techniques known as "Blind Interference Alignment" (BIA) has demonstrated the possibility to grow DoFs without many of the CSI overheads of conventional systems. BIA therefore has the potential to relieve the "dimensionality bottleneck". However, BIA can have limited applicability to many users in a cellular environment given that it requires a high Signal to Noise Ratio (SNR) to operate efficiently. By examining BIA, we present a method to reduce the SNR requirements and improve the application of BIA through power allocation and cluster-based transmission. We show that BIA can be applied successfully in cellular without the need for joint processing between base-stations, and can improve performance over conventional MIMO for even cell-edge users in some scenarios.
A Review - Anomaly Based Network Security Using Response Recovery Engine

The security of the network reduces due to increase in the size of the network, there are many intrusion detection and intrusion response strategies which are carried on the basis to find and stop the intruders in the network such as local and global. Preserving the availability and integrity of networked computing systems in the face of fast-spreading intrusions requires advances not only in detection techniques and also in automated response techniques. Preserving the availability and integrity of networked computing systems in the face of fast-spreading intrusions requires advances not only in detection algorithms, but also in automated response techniques. In this paper, we propose a new approach to automated response called the response and recovery engine (RRE). Our engine employs a game-theoretic response strategy against adversaries modeled as opponents in a two-player Stackelberg stochastic game. The RRE applies attack-response trees(ART) to analyze undesired system-level security events within host computers and their countermeasures using Boolean logic to combine lower level attack consequences. In addition, the RRE accounts for uncertainties in intrusion detection alert notifications. The RRE then chooses optimal response actions by solving a partially observable competitive Markov decision process that is automatically derived from attack-response trees. To support network-level multiobjective response selection and consider possibly conflicting network security properties, we employ fuzzy logic theory to calculate the network-level security metric values, i.e., security levels of the system’s current and potentially future states in each stage of the game. In particular, inputs to the networklevelgame-theoretic response selection engine, are first fed into the fuzzy system that is in charge of a nonlinear inference and quantitative ranking of the possible actions using its previously defined fuzzy rule set. Consequently, the optimal network-levelresponse actions are chosen through a game-theoretic optimization process. Experimental results show that the RRE, using Snort’s alerts, can protect large networks for which attack-response trees have more than 500 nodes.
Misregulation of rhodopsin phosphorylation and dephosphorylation found in P23H rat retinal degeneration

To examine rhodopsin (Rho) functions in P23H rat, kinetics of Rho regeneration and dephosphorylation were investigated by spectrophotometric analysis and immunofluorescence labeling method using specific antibodies toward phosphorylated 334Ser or 338Ser site. Rho dephosphorylation at both sites was extremely delayed in P23H retina as compared to normal ones. Kinetics of Rho regeneration was not altered between normal and P23H rats under dark adaptation. Next, to study the effects of several Ca2+channel blockers on this model, retinal function and morphology were evaluated. Among them, nilvadipine showed a significant protective effect against P23H retinal degeneration. Neurotrophic factor, fibroblast growth factor-2 and Arc, known to suppress the apoptosis in the central nervous system, were significantly upregulated upon administration of nilvadipine. The present study indicates that misregulation of Rho phosphorylation may be involved as an important step in retinal degeneration of P23H and administration of nilvadipine may be a potential therapeutic agent for the retinal degenerations.
Quotients of Hypersurfaces in Weighted Projective Space

In [1] some quotients of one-parameter families of Calabi-Yau varieties are related to the family of Mirror Quintics by using a construction due to Shioda. In this paper, we generalize this construction to a wider class of varieties. More specifically, let $A$ be an invertible matrix with non-negative integer entries. We introduce varieties $X_A$ and $\overline{M}_A$ in weighted projective space and in ${\mathbb P}^n$, respectively. The variety $\overline{M}_A$ turns out to be a quotient of a Fermat variety by a finite group. As a by-product, $X_A$ is a quotient of a Fermat variety and $\overline{M}_A$ is a quotient of $X_A$ by a finite group. We apply this construction to some families of Calabi-Yau manifolds in order to show their birationality.
Standard Deviation of Mean and Variance of Rows and Columns of Images for CBIR

This paper describes a novel and effective approach to content-based image retrieval (CBIR) that represents each image in the database by a vector of feature values called "Standard deviation of mean vectors of color distribution of rows and columns of images for CBIR". In many areas of commerce, government, academia, and hospitals, large collections of digital images are being created. This paper describes the approach that uses contents as feature vector for retrieval of similar images. There are several classes of features that are used to specify queries: colour, texture, shape, spatial layout. Colour features are often easily obtained directly from the pixel intensities. In this paper feature extraction is done for the texture descriptor that is 'variance' and 'Variance of Variances'. First standard deviation of each row and column mean is calculated for R, G, and B planes. These six values are obtained for one image which acts as a feature vector. Secondly we calculate variance of the row and column of R, G and B planes of an image. Then six standard deviations of these variance sequences are calculated to form a feature vector of dimension six. We applied our approach to a database of 300 BMP images. We have determined the capability of automatic indexing by analyzing image content: color and texture as features and by applying a similarity measure Euclidean distance. Keywords—Standard deviation Image retrieval, color distribution, Variance, Variance of Variance, Euclidean distance. I. INTRODUCTION
Efficient Offline Algorithmic Techniques for Several Packet Routing Problems in Distributed Systems

In this paper we consider several problems concerning packet routing in distributed systems. Each problem is formulated using terms from Graph Theory and for each problem we present eﬃcient, novel, algorithmic techniques for computing optimal solutions. We address topics like: bottleneck paths (trees), optimal paths with non-linear costs, optimal paths with multiple optimization objectives, maintaining aggregate connectivity information under a sequence of network link failures, and several others.
Percept-switch nucleation in binocular rivalry reveals local adaptation characteristics of early visual processing.

When the two eyes view incompatible images that subtend the entire visual field, perception alternates between the two images unpredictably: at seemingly random times and locations, observers experience sudden changes in the awareness of the unchanging visual stimulation. Here we focus on the very first spontaneous breakout from the very first suppression phase after onset of the two eyes' competing whole-field stimuli. We call such spontaneous local breakout an "initial percept-switch nucleation. " We employed homogeneous visual input to examine where, and how, spontaneous local initial percept-switch nucleations originate, demonstrating that their spatial distribution contains locally random inhomogeneities, which are eye- and observer-dependent. We were able to predict the occurrence probability of the percept nucleations by adaptation buildup of the neurons associated with the representation of one eye's image. Intriguingly, the neuronal processes related to both cross-inhibition and local eye dominance could not predict nucleation probability; this is because nucleation inhomogeneity appeared to be different from another previously reported local inhomogeneity known as "onset bias" signifying the local first dominance-choice inhomogeneity upon stimulus onset. Collectively, we reveal a governing role of local adaptation in the neurons associated with early visual processing of one eye's image, in the origination of new phases in awareness.
Answering at INEX 03

The Extensible Markup Language (XML) is becoming the most popular format for information representation and data exchange. Much research has been investigated on providing flexible query facilities while aiming at efficient techniques to extract data from XML documents. However, most of them are focused on only the exact matching of query conditions. In this paper, we describe a cooperative XML query answering system, CoXML, which cooperates with the users by extending query relaxation techniques and provides approximate matching of query conditions. We also present our participation effort in the Initiative for the Evaluation of XML Retrieval (INEX) with CoXML.
Local quadrature formulas on the sphere , II

Let q ≥ 1 be an integer, K be a compact subset of the unit sphere S embedded in the Euclidean space IR, and K have a nonempty interior relative to S. Let C be a set of points in a cap containing K, and m ≥ 1 be an integer. We explore conditions on C and K which guarantee the existence of nonnegative numbers wξ , ξ ∈ C, such that ∫ K P (x)dμq(x) = ∑ ξ∈C wξP (ξ) for all spherical polynomials P of degree at most m, where μq is the area measure on S. §
Landmarks, Critical Paths and Abstractions: What's the Difference Anyway?

Current heuristic estimators for classical domain-independent planning are usually based on one of four ideas: delete relaxations, critical paths, abstractions, and, most recently, landmarks. Previously, these different ideas for deriving heuristic functions were largely unconnected.We prove that admissible heuristics based on these ideas are in fact very closely related. Exploiting this relationship, we introduce a new admissible heuristic called the landmark cut heuristic, which compares favourably with the state of the art in terms of heuristic accuracy and overall performance.
A fast approximation strategy for summarizing a set of streaming time series

Summarizing a set of streaming time series is an important issue that reliably allows information to be monitored and stored in domains such as finance [12], networks [2, 1], etc. To date, most of existing algorithms have focused on this problem by summarizing the time series separately [12, 4]. Moreover, the same amount of memory has been allocated to each time series. Yet, memory management is an important subject in the data stream field, but a framework allocating equal amount of memory to each sequence is not appropriate. We introduce an effective and efficient method which succeeds to respond to both challenges: (1) a memory optimized framework along with (2) a fast novel sequence merging method. Experiments with real data show that this method is effective and efficient.
¡ ects of masker frequency and duration in forward masking : further evidence for the in £ uence of peripheral nonlinearity

Forward masking has often been thought of in terms of neural adaptation, with nonlinearities in the growth and decay of forward masking being accounted for by the nonlinearities inherent in adaptation. In contrast, this study presents further evidence for the hypothesis that forward masking can be described as a linear process, once peripheral, mechanical nonlinearities are taken into account. The first experiment compares the growth of masking for onand off-frequency maskers. Signal thresholds were measured as a function of masker level for three masker-signal intervals of 0, 10, and 30 ms. The brief 4-kHz sinusoidal signal was masked by a 200-ms sinusoidal forward masker which had a frequency of either 2.4 kHz (off-frequency) or 4 kHz (on-frequency). As in previous studies, for the on-frequency condition, the slope of the function relating signal threshold to masker level became shallower as the delay between the masker and signal was increased. In contrast, the slopes for the off-frequency condition were independent of masker-signal delay and had a value of around unity, indicating linear growth of masking for all masker-signal delays. In the second experiment, a broadband Gaussian noise forward masker was used to mask a brief 6-kHz sinusoidal signal. The spectrum level of the masker was either 0 or 40 dB (re: 20 WPa). The gap between the masker and signal was either 0 or 20 ms. Signal thresholds were measured for masker durations from 5 to 200 ms. The effect of masker duration was found to depend more on signal level than on gap duration or masker level. Overall, the results support the idea that forward masking can be modeled as a linear process, preceded by a static nonlinearity resembling that found on the basilar membrane. ß 2000 Elsevier Science B.V. All rights reserved.
A glimpse of expert programmers' mental imagery

There is widespread anecdotal evidence that expert programmers make use of visual mental images when they are designing programs. In this study, expert programmers were directly questioned regarding the nature of their mental representations while they were engaged in a design task. This investigative technique was used with the explicit intention of eliciting introspective reports of mental imagery. The resulting transcripts displayed a considerable number of common elements. These suggest that software design shares many characteristics of more concrete design disciplines. They also provide promising areas for further investigation of software development support tools and design strategies.
Video Multicast over the Internet

Multicast (multipoint) distribution of video is an important component of many existing and future networked services. Today's Internet lacks support for quality of service (QoS) assurance, which makes the transmission of real-time traffic (such as video) challengin. In addition, the hetero eneity of the Internet's transmission resources and enLystems makes it extreme& difficult, if not impossible, to agree on acceptable traffic characteristics among multiple receivers of the same video stream. In this article we survey techni ues that have been proposed for transmit-tin video in this environment. These teJniques generally involve adaptation of the conditions. In addition to their applicability to the near-term capabilities of the Inter-net, they also are o f relevance to a future, QoS-aware Internet environment because of the inevitable inaccuracies in traffic and resource reservation specifications. W e first consider source-based techniques in which the source adjusts the video stream traffic to match some consensus among the receivers about its desired characteristics. These techniques can result in an unfair treatment for receivers, especially those whose capability is significantly above or below the group consensus. W e then consider techniques that aim to improve the fairness among the receivers by sending the video in multiple (layered or replicated) streams. W e also discuss several error control mechanisms, using timely retransmission of missing data to further improve the quality of the received video. Finally, we discuss some of the issues that remain to be resolved in the development of Internet video multi-cast protocols. vi 8 eo traffic carried over the network to match receiver requirements and network he multicast (multipoint) distribution of real-time video is an important component of many current and emerging Internet applications, such as video confer-encing, distance learning, remote presentation, and media-on-demand. Improvements in network delivery infrastructure and increases in end-system processing power have made these applications feasible. Multicast video distribution over the Internet requires Support mechanisms for multicast data delivery. The ability to accommodate the real-time requirements of digital video. The provision of multicast data delivery within the Internet has been the subject of significant research and deployment efforts recently [l, 21. We later summarize the features of this support relevant to our discussion here. Our focus in this article is on how the real-time requirements of multicast digital video can be accommodated over the Internet. There are two general approaches that can be used: Incorporating quality-of-service support within the Internet to allow video …