Miracle-dz/UniFAR-FTUs huggingface dataset:
Monitoring and control of polarization-related impairments in optical fiber systems

Polarization-related impairments have become a critical issue for high-data-rate optical systems, particularly when considering polarization-mode dispersion (PMD) and polarization-dependent loss (PDL). In general, polarization effects are stochastic processes and can occur on short or long time scales. Therefore, control and monitoring of these effects may be crucial in any systems-level mitigation. This tutorial will highlight the following key issues: PMD and PDL, monitoring schemes, emulation of proper statistics, interaction, and applications of polarization scrambling.
An ‘other-Race Effect’ for Categorizing Faces by Sex

It is well-known that people recognize faces of their own race more accurately than faces of other races—a phenomenon often referred to as the ‘other-race effect’. Using brief presentations of faces, we show a similar effect for the task of discriminating the sex of a face. Specifically, Caucasian observers discriminated male and female Caucasian faces more accurately/efficiently than did Oriental(1) observers, and Oriental observers discriminated male and female Japanese faces more accurately/efficiently than did Caucasian observers. This result indicates that, under suboptimal viewing conditions, the identification of even the most salient of facial characteristics—face sex—is impaired for other-race faces. This finding suggests, also, that the nature and diversity of our experience with faces may affect not only the quality of the face representation for later access by recognition processes, but also the efficiency of a perceptual discrimination process. Intriguingly, too, we found that female observers, for both races tested, were considerably more accurate at the sex classification task than were male observers.
Automatic Document Topic Identification using Wikipedia Hierarchical Ontology

The rapid growth in the number of documents available to end users from around the world has led to a greatly-increased need for machine understanding of their topics, as well as for automatic grouping of related documents. This constitutes one of the main current challenges in text mining. In this work, a novel technique is proposed, to automatically construct a background knowledge structure in the form of a hierarchical ontology, using one of the largest online knowledge repositories: Wikipedia. Then, a novel approach is presented to automatically identify the documents' topics based on the proposed Wikipedia Hierarchical Ontology (WHO). Results show that the proposed model is efficient in identifying documents' topics, and promising, as it outperforms the accuracy of the other conventional algorithms for document clustering.
Speeding up Training with Tree Kernels for Node Relation Labeling

We present a method for speeding up the calculation of tree kernels during training. The calculation of tree kernels is still heavy even with efficient dynamic programming (DP) procedures. Our method maps trees into a small feature space where the inner product, which can be calculated much faster, yields the same value as the tree kernel for most tree pairs. The training is sped up by using the DP procedure only for the exceptional pairs. We describe an algorithm that detects such exceptional pairs and converts trees into vectors in a feature space. We propose tree kernels on marked labeled ordered trees and show that the training of SVMs for semantic role labeling using these kernels can be sped up by a factor of several tens.
Project Joshua Blue : Common Sense via Common Experience

Our position related to ’Anchoring Symbols to Sensor Data in Single and Multiple Robot Systems’ is threefold. First, that conscious awareness of experience in humans is bootstrapped from sensory/motor interactions within the first 12 months following conception. Second, that human developmental physiology indicates the appropriate behavioral metalevel to focus work on connecting an artificial mind to its sensory/motor embodiment. Third, that this perspective leads to specific architectural and representational choices in the design of systems capable of acquiring human-like common sense.
A Temporal Proof System for General Game Playing

A general game player is a system that understands the rules of unknown games and learns to play these games well without human intervention. A major challenge for research in General Game Playing is to endow a player with the ability to extract and prove game-specific knowledge from the mere game rules. We define a formal language to express temporally extended — yet local — properties of games. We also develop a provably correct proof theory for this language using the paradigm of Answer Set Programming, and we report on experiments with a practical implementation of this proof system in combination with a successful general game player.
Robust Power Control with Distribution Uncertainty in Cognitive Radio Networks

In cognitive radio networks, it is often impossible to have regular information exchange between PUs and SUs. This implies that SUs are unable to obtain up-to-date channel information at the PU side, and will face technical challenges in accurately controlling their interference to PUs through power control. In this paper, we assume that SUs can estimate the channel information in the reciprocal channel, and study the channel uncertainty due to estimation errors and its impact on SUs' performance and PUs' protection. Specifically, we model the uncertain channel gain to be a random variable following a state-dependent distribution function, and propose a power control mechanism that is robust against the channel uncertainty. We study the robust power control in two cases. In the first case, all SU transmitters (e.g., secondary base stations) transmit with the same power, while in the second case each SU transmitter may choose distinct transmit power based on its own preference. In either case, we formulate the power control problem as a chance constrained robust optimization problem and design an iterative algorithm, respectively. Numerical results show that our robust power control mechanism can provide better protection for PUs than existing methods that overlook the uncertainty in channel measurement, and the second-case power control generally provides better Quality of Service (QoS) for SUs than that in the first case.
Serum concentration of S‐100 protein in assessment of cognitive dysfunction after general anesthesia in different types of surgery

Background: S‐100 protein serum concentration (S‐100) serves as a marker of cerebral ischemia in cardiac surgery, head injury and stroke. In these circumstances S‐100 corresponds well with the results of neuropsychological tests. The aim of the present study was to investigate the value of S‐100 and neuron specific enolase (NSE) in reflecting postoperative cognitive deficit (POCD) after general surgical procedures.
Test–Retest Reliability in Infant Speech Perception Tasks

A long line of research investigates how infants learn the sounds and words in their ambient language over the first year of life, through behavioral tasks involving discrimination and recognition. More recently, individual performance in such tasks has been used to predict later language development. Does this mean that dependent measures in such tasks are reliable and can stably measure speech perception skills over short time spans? Our three laboratories independently tested infants with a given task and retested them within 0–18 days. Together, we can report data from 12 new experiments (total number of paired observations N = 409), ranging from vowel and consonant discrimination to recognition of phrasal units. Results reveal that reliability is extremely variable across experiments. We discuss possible causes and implications of this variability, as well as the main effects revealed by this work. Additionally, we offer suggestions for the field of infant speech perception to improve the reliability of its methodologies through data repositories and crowd sourcing.
Block of the cyclic GMP-gated channel of vertebrate rod and cone photoreceptors by l-cis-diltiazem

Inside-out patches were excised from catfish rod or cone outer segments. Single channel and macroscopic currents were recorded from GMP-gated channels activated by 1 mM cGMP in low divalent buffered saline. Currents were blocked by the application of micromolar concentrations of l-cis-diltiazem to the cytoplasmic side of the patch. The concentration dependence of block indicated that a single molecule was sufficient to block a channel and that all channels were susceptible to block. The dissociation constant for the rod channel was an order of magnitude smaller than for the cone channel, but the voltage dependence of block was nearly identical. The macroscopic current-voltage relation in the presence of blocker was inwardly rectifying and superficially resembled voltage-dependent block by an impermeant blocker occluding the ion-conducting pore of the channel. Block by diltiazem acting from the extracellular side of the channel was investigated by including 5 microM diltiazem in the recording pipette solution. The macroscopic current-voltage relation again showed inward rectification, inconsistent with the idea that diltiazem acts by occluding the pore at the external side. The kinetics of block by diltiazem applied to the intra- and extracellular side were measured in cone patches containing only a single channel. The unbinding rates were similar in both cases, suggesting a single binding site. Differences in the binding rate were consistent with greater accessibility to the binding site from the cytoplasmic side. Block from the cytoplasmic side was independent of pH, suggesting that the state of ionization of diltiazem was not related to its ability to block the channel in a voltage-dependent fashion. These observations are inconsistent with a pore-occluding blocker, but could be explained if the hydrophobic portion of diltiazem partitioned into the hydrophobic core of the channel protein, perhaps altering the gating of the channel.
Mining Sequence Patterns in Transactional Databases 8.3.1 Sequential Pattern Mining: Concepts and Primitives

A sequence database consists of sequences of ordered elements or events, recorded with or without a concrete notion of time. There are many applications involving sequence data. Typical examples include customer shopping sequences, Web clickstreams, biological sequences, sequences of events in science and engineering, and in natural and social developments. In this section, we study sequential pattern mining in transactional databases. In particular, we start with the basic concepts of sequential pattern mining in Section 8.3. 1. Section 8.3. 2 presents several scalable methods for such mining. Constraint-based sequential pattern mining is described in Section 8.3. 3. Periodicity analysis for sequence data is discussed in Section 8.3. 4. Specific methods for mining sequence patterns in biological data are addressed in Section 8.4. " What is sequential pattern mining? " Sequential pattern mining is the mining of frequently occurring ordered events or subsequences as patterns. An example of a sequential pattern is " Customers who buy a Canon digital camera are likely to buy an HP color printer within a month. " For retail data, sequential patterns are useful for shelf placement and promotions. This industry, as well as telecommunications and other businesses, may also use sequential patterns for targeted marketing, customer retention, and many other tasks. Other areas in which sequential patterns can be applied include Web access pattern analysis, weather prediction, production processes, and network intrusion detection. Notice that most studies of sequential pattern mining concentrate on categorical (or symbolic) patterns, whereas numerical curve analysis usually belongs to the scope of trend analysis and forecasting in statistical time-series analysis, as discussed in Section 8.2. The sequential pattern mining problem was first introduced by Agrawal and Srikant in 1995 [AS95] based on their study of customer purchase sequences, as follows: " Given a set of sequences, where each sequence consists of a list of events (or elements) and each event consists of a set of items, and given a user-specified minimum support threshold of min sup, sequential pattern mining finds all frequent subsequences, that is, the subsequences whose occurrence frequency in the set of sequences is no less than min sup. " Let's establish some vocabulary for our discussion of sequential pattern mining. Let } be the set of all items. An itemset is a nonempty set of items. A sequence is an ordered list of events. A sequence s is denoted e 1 e 2 e 3 · · · e l , …
Expanding the zebrafish embryo proteome using multiple fractionation approaches and tandem mass spectrometry

The proteome of zebrafish, Danio rerio, embryos has not been studied in great detail mainly due to the presence of high abundance yolk proteins in embryos. Here we report the highest number of the zebrafish embryo proteins identified so far to our knowledge, through a combination of a protein‐level fractionation approach (1D SDS‐PAGE) and two different peptide‐level fractionation approaches (IEF and strong anion exchange (SAX)) of deyolked zebrafish embryos followed by LC‐MS/MS. We detected 5267 proteins in total of which 3464 proteins were identified with at least two peptides (less than 1% peptide false discovery rate). The analysis of proteome coverage from each method showed that 56% of detected proteins were common to all approaches and 95% of the detected proteome was obtained from 1D SDS‐PAGE approach alone. Bioinformatics analysis of the detected proteome demonstrated that nucleocytoplasmic transport (biological process) and ribosomal proteins (cellular component) were the most over‐represented proteins, whereas cell–cell signaling (biological process) and extracellular space proteins (cellular component) were the most under‐represented proteins in the identified proteome.
An Elliptic Curve based Signcryption Protocol using Java

a day's information technology is a part of day to day's life. Everybody wants to store data in soft format in a central place so that it can be accessed any point of time. When a remote user tries accessing it through an unreliable network then data may not be secure. There are many techniques to secure data or message. Signcryption is one of the booming issues in the field of security. In 1997 Zheng introduce signcryption scheme by combining the techniques of digital signature then encryption in one step which reduces the computational cost and communication overhead (1). Signcryption also verifies the sender without reading content of the message by third party (10). Many researchers have given their signcryption scheme to achieve security goals like forward secrecy, like confidentiality, unforgeability, integrity, forward secrecy and public verification non repudiation but many of them having their own limitations (2, 8, 16). In this paper a novel signcryption scheme proposed which is implemented using java and also achieves all the security goals.
Achievable DF rate for cascaded undirected wireless networks with TDD and hidden-terminal

This paper investigates general Z-hop cascaded undirected wireless relay network, where the source, the relays, and the destination form an undirected chain, and each node receives radio waves from its two neighboring upstream and downstream nodes in the chain. We focus on the effect of time-division duplex and hidden-terminal constraints from two aspects: 1) finding all feasible network states (FNS) and determining the amount; 2) scheduling among FNS to maximize the transmission rate of the whole network when the decode-and-forward (DF) relay strategy is used. Firstly we define a new S sequence, which is proved to exactly characterize the number of all FNS. We provide a simple recursive construction method to get all FNS and discuss its properties. Then we formulate the scheduling problem into linear program which can be efficiently solved, and find the maximum achievable DF rate is: r* = min {1/1/cj-1 + 1/cj + 1/cj+1 | ∀j =2, 3, . , K - 1}, where Ck, ∀k = 1, 2, . , K, denote thecapacity of component hops.
Textural and contextual land-cover classification using single and multiple classifier systems

The objective of this study was to improve the quality of the digital land-cover and land-use classification when using high-resolution (10 to 30 m) remote sensing data. Three classification techniques were compared, which can be divided into two groups: single classifiers (a five-nearest neighbor and the C4.5 decision tree classifier) and multiple classifier systems (BAGFS). Textural and contextual features (roads, hydrology, relief, etc.) were introduced during the classification process. Eleven land-cover categories, in a Belgian varied landscape, were analyzed and classified using Landsat Thematic Mapper data. The accuracy assessment increased with the introduction of textural features and contextual data, between 0.60 and 0.82 for the Kappa coefficient. The best kappa value was achieved using numerous textural and contextual features with the multiple
Locally Linear Denoising on Image Manifolds

We study the problem of image denoising where images are assumed to be samples from low dimensional (sub)manifolds. We propose the algorithm of locally linear denoising. The algorithm approximates manifolds with locally linear patches by constructing nearest neighbor graphs. Each image is then locally denoised within its neighborhoods. A global optimal denoising result is then identified by aligning those local estimates. The algorithm has a closed-form solution that is efficient to compute. We evaluated and compared the algorithm to alternative methods on two image data sets. We demonstrated the effectiveness of the proposed algorithm, which yields visually appealing denoising results, incurs smaller reconstruction errors and results in lower error rates when the denoised data are used in supervised learning tasks.
Power Negotiation between Japanese Females and Males

We can survey the study of language and gender for Japanese by dividing it into three distinct but interlinked areas; (1) the historical study of nyobo kotoba 'speech of court ladies' of the Muromachi period (2) the treatment of women in language, and (3) the actual speech of women. The first area of study investigates the historical transformation of gender ideologies and roles in society, the second area concerns the reality of language as a symbolic system, and the third questions the very existence of shared cultural gender ideologies found in the speech of individual women, which is what Sally McConnell-Ginet calls "production" and "meaning. " 1 The study of gender-differences in the Japanese language contrast with the one in the English language in 4 ways; (1) the lack of substantial natural speech data; (2) the lack of explanation; (3) the lack of a feminist perspective; and (4) the avoidance of the notion of "power" as a tool to interpret the gender differences in language. These last three issues come from the notion that women and men are created differently (but they are in a complementary relation), and that genderdifferences in language are "natural" (Jorden 1974). Because the differences are "natural" and language was considered a mere reflection of social realities and roles, many Japanese linguists did not see the connection between the treatment of women in language and women's oppression in society. This idea that the way women 2
Proactive Search Routing for Mobile Peer-to-Peer Networks : Zone-based P 2 P

Peer-to-Peer (P2P) networks without central entities, such as Gnutella or JXTA, generally suffer from a high signaling load resulting in poor efficiency. The main reason therefore is the flooding of search requests in the overlay, since in most P2P protocols the nodes are not aware of the P2P overlay network topology. Especially for resource constrained environments such as mobile communications this search overhead should be minimized. This paper addresses the application-layer routing problem, by proposing a new P2P search routing protocol, the Zone-based P2P protocol (ZP2P). ZP2P establishes a zone for every peer. In its zone the peer knows the complete P2P overlay network topology and the available content. If a requested content is not available in its zone, bordercast messages are used, to search for the content in neighboring zones. Employing these concepts, ZP2P achieves a notably improved signaling performance, compared to other unstructured P2P routing approaches such as Gnutella 0.4 or Gnutella 0.6. As a proof of concept, we analyze the signaling performance of ZP2P nodes and Gnutella nodes, with means of random graph theory and in
Segmentation of Lungs via Hybridization of CA and Level Set Algorithm

In this study, we present a fast and robust practical tool for segmentation of solid tumors with minimal user interaction. The lung image is segmented manually by the experts may includes risk and time consuming process. Hence, in this study, the lung image is segmented in order to identify the tumor sector. Initially, the input lung image is applied with the denoising process for removing noises with the aid of multi-wavelet transformation. After this process, the CA algorithm is applied for obtaining the background seeds and foreground seeds (tumor seeds) and then the level set algorithm is applied for acquiring the acute tumor tissues. As a result of the mentioned process, the tumor sector is segmented and the results are depicted. Studies on lung tumor datasets demonstrate 80- 85% overlap performance of the proposed algorithm with less sensitivity to seed initialization, robustness with respect to heterogeneous tumor types and its efficiency in terms of computation time.
Widespread Shortening of 3’ Untranslated Regions and Increased Exon Inclusion Are Evolutionarily Conserved Features of Innate Immune Responses to Infection

The contribution of pre-mRNA processing mechanisms to the regulation of immune responses remains poorly studied despite emerging examples of their role as regulators of immune defenses. Here, we used mRNA sequencing to quantify gene expression and isoform abundances in primary macrophages from 60 individuals, before and after infection with two live bacteria. In response to both bacteria we identified thousands of genes that significantly change isoform usage in response to infection, and found global shifts towards (i) the inclusion of cassette exons and (ii) shorter 3’ UTRs. Using complementary data collected in non-human primates, we show that these features are evolutionarily conserved among primates. Finally, our results suggest that the pervasive usage of shorter 3’ UTRs is a mechanism for particular genes to evade repression by immune-activated miRNAs. Collectively, our results show that dynamic changes in RNA processing play a key role in the regulation of innate immune responses.
Radial Response of Individual Bubbles Subjected to Shock Wave Lithotripsy Pulses In Vitro

Direct measurements of individual bubble oscillations in lithotripsy fields have been performed using light-scattering techniques. Studies were performed with bubble clouds in gassy water as well as single levitated bubbles in degassed water. There is direct evidence that the bubble survives the inertial collapse, rebounding several times before breaking up. Bubble dynamics calculations agree well with the observations, provided that vapor trapping (a reduction in condensation during bubble collapse) is included. Furthermore, the afterbounces are dominated by vapor diffusion, not gas diffusion. Vapor trapping is important in limiting the collapse strength of bubbles, and in sonochemical activity.