Miracle-dz/UniFAR-FTUs huggingface dataset:
Effects of childhood hearing loss on the subcortical and cortical representation of speech

Little is known about the effects of childhood mild-to-moderate sensorineural hearing loss (MM HL) on the function of the auditory pathway. We aimed to examine the effect of childhood MM HL and the benefit of frequency-specific amplification on both subcortical and cortical auditory processing, and to relate it to speech-perceptual abilities. We recorded subcortical and cortical responses to speech syllables in nineteen children with congenital MM HL (unamplified and amplified), and sixteen children with normal hearing (unamplified sounds only). Speech perception was measured behaviourally. Congenital HL led to smaller subcortical and cortical responses to unamplified speech sounds. There was a significant benefit of amplification on subcortical and early, but not late, cortical responses, with some effects differing across age. No relationship was found between the neural and behavioural measures. Childhood MM HL affects both subcortical and cortical processing of speech. Amplification mostly benefits subcortical processing of speech in younger children. Childhood HL leads to functional changes in the processing of sounds, with amplification differentially affecting subcortical and cortical levels of the auditory pathway.
Role of PLK1 in the epigenetic maintenance of centromeres

The centromere, a chromosome locus defined by the histone H3-like protein CENP-A, seeds the kinetochore to bind microtubules during cell division. Centromere maintenance requires CENP-A to be actively replenished by dedicated protein machinery in the early G1 cell-cycle phase, compensating for its two-fold dilution following DNA replication. Cyclin-dependent kinases (CDKs) limit CENP-A deposition to once per cell cycle and function as negative regulators outside early G1. Antithetically, Polo-like kinase 1 (PLK1) promotes CENP-A deposition in early G1, but the molecular details are still unknown. We reveal a phosphorylation network that recruits PLK1 to the deposition machinery to control a conformational switch required for licensing the CENP-A deposition reaction. Our findings solve the long-standing question of how PLK1 contributes to the epigenetic maintenance of centromeres. One-Sentence Summary PLK1 licenses epigenetic maintenance of centromeres by regulating a conformational switch on the MIS18α protein.
Local desensitization to dopamine devalues recurring behavior

Goal achievement adjusts the relative importance of future behaviors. We use Drosophila to study this form of motivational control, finding that prior matings make males increasingly likely to abandon future copulations when challenged. Repetition-induced devaluation results from a reduction in dopamine reception by the Copulation Decision Neurons (CDNs), which mediate the decision to end matings. Dopamine signaling to the CDNs sustains matings in real time, but also triggers a lasting, β-arrestin-dependent desensitization of the D2R on the CDNs, leaving subsequent matings susceptible to disruption. When D2R desensitization is experimentally prevented, the male treats each mating as if it were his first. These findings provide a generalizable mechanism of motivational control and reveal a natural function for the long-studied susceptibility of the D2R to drug-induced inactivation.
Reduced Time Complexity for Detection of Copy-Move Forgery

: With the advancement of technology and availability of imaging tools, it’s not difficult now to manipulate digital images, to hide or create misleading images. Image forgery detection is currently one of the hot research fields of image processing. Copy-Move tampering is a common type of image synthesizing, where a part of an image is copied and pasted to another place to add or remove an object. In this paper, we present an improved algorithm based on Discrete Wavelet Transform (DWT) and Discrete Cosine Transform Quantization Coefficients Decomposition (DCT-QCD) to detect such cloning forgery. Our technique works by first applying DWT to the input image to yield a reduced dimensional representation. Then the compressed image is divided into n×n overlapping blocks. Using Singular Value Decomposition (SVD) on cosine coefficients, the size of blocks is reduced from n×n to 1×n . Hence instead of compare the n×n blocks only compare of 1×n vectors is need. Since complexity of related algorithms is concerned to number of blocks, this approach drastically reduces the time needed for the detection process. Experimental results show that the proposed scheme accurately detects such specific image manipulations as long as the copied region is not rotated or scaled.
Diseño mecánico y primer prototipo de un robot de rehabilitación de mano

This TFG proposes the mechanical design, manufacture and construction of a hand-held exoskeleton type mechatronic device for use in hand rehabilitation tasks, for people who have neuromotor disability, because they have suffered acquired brain damage. This mechatronic device will consist of: a mechanical part (external skeleton at the hand) capable of performing all its movements, and an electronic control part that gives that device movement. Both parts will work together to achieve opening and closing movements of the hand.
HIGH-THROUGHPUT MULTIPLE-INPUT MULTIPLE-OUTPUT SYSTEMS FOR IN-HOME MULTIMEDIA STREAMING

Wireless communication systems based on multiple-input multiple-output (MIMO) technology have the potential to achieve increased spectral efficiency with no additional transmit power or bandwidth requirements. This can be achieved by exploiting the spatial subchannels between the multiple transmit and receive elements. The enhanced performance of MIMO technology makes it a strong candidate for ad hoc systems requiring very high throughput, such as high-definition multimedia streaming in the home. In this article we compare the performance of conventional and newly proposed MIMO architectures for such applications. Specifically designed antenna arrays are proposed as a solution to significantly reduced MIMO performance in lineof-sight (LoS) conditions. To help in the design of such systems, the criterion for achieving maximum MIMO capacity in LoS is presented as a function of the transmitter-to-receiver separation distance, the array orientation and the element spacings. The performance of the LoS-enhanced proposal and the conventional system is quantified in terms of the channel capacity, the packet error rrate (PER) and the throughput by employing a MIMO-enabled WLAN physical layer simulator. The results from MIMO measurements performed inside an anechoic chamber and in an indoor environment are presented to validate the theoretic predictions. SARRIS LAYOUT 9/21/06 12:24 PM Page 2
Trojan ' Spy ' Shared ' Resource ' Modulate ' 5 ming ' Decode secret

As we increasingly rely on computers to process and manage our personal data, safeguarding sensitive information from malicious hackers is a fast growing concern. Among many forms of information leakage, covert timing channels operate by establishing an illegitimate communication channel between two processes and through transmitting information via timing modulation, thereby violating the underlying system’s security policy. Recent studies have shown the vulnerability of popular computing environments, such as cloud computing, to these covert timing channels. In this work, we propose a new microarchitecture-level framework, CC-Hunter, that detects the possible presence of covert timing channels on shared hardware. Our experiments demonstrate that CCHunter is able to successfully detect different types of covert timing channels at varying bandwidths and message patterns. Keywords-Covert timing channels; Detection; Shared hardware; Algorithms
A Survey of Critical Success Factors in e-Banking

The organisational factors, which are critical to the success of e-banking, are investigated. Different pieces of literature report different factors as key to success and generally based on subjective, perceptual data. A synthesis of existing literature is a basis for survey questions. The data was collected from UK based financial sector organisations who are offering their services on electronic channels, using postal questionnaires. The top factors found to be most critical for the success in e-banking are: quick responsive products/services, organisational flexibility, services expansion, systems integration and enhanced customer service. An important lesson from this research is that organisations need to view the e-banking initiative as a business critical area rather that just a technical issue. They need to give attention to internal integration, which may include channels, technology and business process integration, and improving the overall services to their customers.
SCORBOT-ER-V PLUS ROBOT MANIPULATOR

One of the most common requirements in robotics is to move the end-effector smoothly from initiallocation to goallocation. In this paper, two approaches to generating such trajectories: straight lines in joint space and straight lines in Cartesian space have been discussed. These are known respectively as jointspace and Cartesianspacetracking. Two user defined algorithms are developed for Joint space as well as Cartesian space trajectory tracking. The algorithm has been tested in simulation yielding fair results, which have also been compared with each otherto check the accuracy and results of both.
Proximity-driven Social Interactions and Their Impact on the Throughput Scaling of Wireless Networks

—We present an analytical framework to investigate the interplay between a communication graph and an overlay of social relationships. We focus on geographical distance as the key element that interrelates the concept of routing in a communication network with the dynamics of interpersonal relations on the corresponding social graph. We identify classes of social relationships that let the ensuing system scale— i.e. , accommodate a large number of users given only ﬁnite amount of resources. We establish that geographically concentrated communication patterns are indispensable to network scalability. We further examine the impact of such proximity-driven interaction patterns on the throughput scaling of wireless networks, and show that, when social communications are geographically localized, the maximum per-node throughput scales approximately as 1 / log n , which is signiﬁcantly better than the well-known bound of 1 / √ n log n for the uniform communication model.
greedy algorithms for maximum weighted independent

weight $ \geq\sum_{v\inV(}G)^{\frac{W(v)^{2}}{\mathrm{L}_{u\in(}^{\urcorner}N_{G}^{+}v\rangleW(u)}}$ . This can be also thought as an extension of Tur \’an’s theorem. In section 4, we present two parallel algorithms PWMIN and PWMAX, which are parallelization of $MIN$ and $MAX$ respectively.
Data in Action: Data-Driven Decision-Making in U.S. Manufacturing PRELIMINARY– DO NOT CITE OR DISTRIBUTE

We investigate the adoption and performance effects of data-driven decision-making (DDD) in U.S. firms. Our study relies on a novel survey of managerial practices conducted by the U.S. Census Bureau combined with other detailed data on information technology (IT) investment and firm performance in the manufacturing sector. Using a differences-in-differences approach, we find that plants adopting DDD exhibit an average increase of 3% in value-added between 2005 and 2010. For the average plant in our sample, this increase is on par with the productivity benefit from investing an additional $5 million in IT capital, or $60 thousand per employee over the five-year period. Because IT use is managerially and statistically distinct from IT investment, we take this as evidence that it can be just as important for firm performance. Moreover, DDD displays important complementarities with other organizational choices such as employee education and the allocation of decision rights. Furthermore, the variation in the timing and distribution of DDD effects suggests there are complex and costly organizational adjustments as firms adapt to new technological possibilities. * Any opinions and conclusions expressed herein are those of the author(s) and do not necessarily represent the views of the U.S. Census Bureau. All results have been reviewed to ensure that no confidential information is disclosed. All errors are our own. We think the MIT Initiative on the Digital Economy for generous funding for this research.
Visualising Concurrent Programs with Dynamic Dependence Graphs

Atropos is a software tool for visualising concurrent program executions intended to help students debug concurrent programs and learn how concurrency works. Atropos supports a slicing debugging strategy by providing a visualisation of dynamic dependence graphs that can be explored to trace the chain of events backwards from a symptom to its cause. In this paper, we present the reasoning behind the design of Atropos and summarise how we evaluated it with students. Keywords-Visual debugging; Program visualization; Dynamic dependence graph; Atropos; Slicing;
Efficient Almost Wait-free Parallel Accessible Dynamic

In multiprogrammed systems, synchronization often turns out to be a performance bottleneck and the source of poor fault-tolerance. Wait-free and lock-free algorithms can do without locking mechanisms, and therefore do not suffer from these problems. We present an efficient almost wait-free algorithm for parallel accessible hashtables, which promises more robust performance and reliability than conventional lock-based implementations. Our solution is as efficient as sequential hashtables. It can easily be implemented using C-like languages and requires on average only constant time for insertion, deletion or accessing of elements. Apart from that, our new algorithm allows the hashtables to grow and shrink dynamically when needed. A true problem of lock-free algorithms is that they are hard to design correctly, even when apparently straightforward. Ensuring the correct-ness of the design at the earliest possible stage is a major challenge in any responsible system development. Our algorithm contains 81 atomic statements. In view of the complexity of the algorithm and its correctness properties, we turned to the interactive theorem prover PVS for mechanical support. We employ standard deductive verification techniques to prove around 200 invariance properties of our almost wait-free algorithm, and describe how this is achieved using the theorem prover PVS.
Paper Title (use style: paper title)

This paper is aimed at the multi-agent systems (MAS) with disturbances, especially explores consensus of MAS, and proposes a Detection-Interval-Varying EventTriggering Mechanism. At every trigger moment, by gradually increasing the frequency of event detection, system resources can be saved. The Zeno behavior is avoided, and neighboring agents comm-unicate only at the instant of triggering. Based on the hybrid MAS framework, Lyapunov stability analysis is carried out, and some sufficient conditions for achieving finite gain 2 L stability in a MAS with Detection-Interval-Varying Event-Triggering Mechanism are derived. Finally, the theoretical analysis is verified by simulation examples. Keywords—Multi-agent systems, consensus, disturbance, Zeno behavior, event-triggering
ON PREDICTING RARE CLASSES WITH SVM ENSEMBLES IN SCENE CLASSIFICATION

Scene classification is an important technique to infer high-level semantic scene categories from low-level visual features. However, in the real world the positive data for many scenes may be rare, which degrades the performance of many classifiers. In this paper, we propose SVM ensembles to address the rare class problem. Various classifier combination strategies are investigated, including majority voting, sum rule, neural network gater and hierarchical SVMs. We also compare our method with two other common approaches for dealing with the rare class problem. Our experimental results show that hierarchical SVMs can achieve significantly better and more stable performance than other strategies, as well as high computational efficiency.
Lipschitz-Certifiable Training with a Tight Outer Bound

Veriﬁable training is a promising research direction for training a robust network. However, most veriﬁable training methods are slow or lack scalability. In this study, we propose a fast and scalable certiﬁable training algorithm based on Lipschitz analysis and interval arithmetic. Our certiﬁable training algorithm provides a tight propagated outer bound by introducing the box constraint propagation (BCP), and it efﬁciently computes the worst logit over the outer bound. In the experiments, we show that BCP achieves a tighter outer bound than the global Lipschitz-based outer bound. Moreover, our certiﬁable training algorithm is over 12 times faster than the state-of-the-art dual relaxation-based method; however, it achieves comparable or better veriﬁcation performance, improving natural accuracy. Our fast certiﬁable training algorithm with the tight outer bound can scale to Tiny ImageNet with veriﬁcation accuracy of 20.1% ( (cid:96) 2 -perturbation of (cid:15) = 36 / 255 ). Our code is available at https://github.com/sungyoon-lee/bcp .
Finding Equilibrium in Transport Networks by Simulation and Investigation of Behaviors

The goal of this paper is to find Wardrop equilibrium in transport networks at case of uncertainty situations, where the uncertainty comes from lack of information. We use simulation tool to find the equilibrium, which gives only approximate solution, but this is sufficient for large networks as well. In order to take the uncertainty into account we have developed an interval-based procedure for finding the paths with minimal cost using the Dempster-Shafer theory. Furthermore we have investigated the users’ behaviors using game theory approach, because their path choices influence the costs of the other users’ paths. Keywords—Dempster-Shafer theory, S-O and U-O transportation network, uncertainty of information, Wardrop equilibrium.
Reshef Detecting Novel Associations in Large Data Sets

clicking here. colleagues, clients, or customers by , you can order high-quality copies for your If you wish to distribute this article to others here. following the guidelines can be obtained by Permission to republish or repurpose articles or portions of articles ): January 17, 2012 www.sciencemag. org (this infomation is current as of The following resources related to this article are available online at http://www.sciencemag. org/content/334/6062/1518.full. html version of this article at: including high-resolution figures, can be found in the online Updated information and services, http://www.sciencemag. org/content/suppl/2011/12/15/334.6062. 1518.DC2. html http://www.sciencemag. org/content/suppl/2011/12/14/334.6062. 1518.DC1. html can be found at: Supporting Online Material http://www.sciencemag. org/content/334/6062/1518.full. html#related found at: can be related to this article A list of selected additional articles on the Science Web sites http://www.sciencemag. org/content/334/6062/1518.full. html#ref-list-1 , 6 of which can be accessed free: cites 35 articles This article http://www.sciencemag. org/content/334/6062/1518.full. html#related-urls 1 articles hosted by HighWire Press; see: cited by This article has been
Reshef Detecting Novel Associations in Large Data Sets

clicking here. colleagues, clients, or customers by , you can order high-quality copies for your If you wish to distribute this article to others here. following the guidelines can be obtained by Permission to republish or repurpose articles or portions of articles ): December 15, 2011 www.sciencemag. org (this infomation is current as of The following resources related to this article are available online at http://www.sciencemag. org/content/334/6062/1518.full. html version of this article at: including high-resolution figures, can be found in the online Updated information and services, http://www.sciencemag. org/content/suppl/2011/12/15/334.6062. 1518.DC2. html http://www.sciencemag. org/content/suppl/2011/12/14/334.6062. 1518.DC1. html can be found at: Supporting Online Material http://www.sciencemag. org/content/334/6062/1518.full. html#ref-list-1 , 6 of which can be accessed free: cites 35 articles This article http://www.sciencemag. org/content/334/6062/1518.full. html#related-urls 1 articles hosted by HighWire Press; see: cited by This article has been
Technology for Extracting Effective Components from Fish Scale

The research of the category and extraction methods of effective ingredients of fish scale was reviewed at home and abroad. The extraction process of fish scale was studied, including collagen, hydroxyapatite, lecithin, guanine etc. The different extraction methods and the components were analyzed. The research of effective ingredients of fish scales was reviewed as theory basis to further research and comprehensive development.
Modeling Criminal Careers as Departures from a Unimodal Population Age-Crime Curve : The Case of Marijuana Use 1

A major aim of longitudinal analyses of life course data is to describe the withinand betweenindividual variability in a behavioral outcome, such as crime. Statistical analyses of such data typically draw on mixture and mixed-effects growth models. In this work, we present a functional analytic point of view and develop an alternative method that models individual crime trajectories as departures from a population age-crime curve. Drawing on empirical and theoretical claims in criminology, we assume a unimodal population age-crime curve and allow individual expected crime trajectories to differ by their levels of offending and patterns of temporal misalignment. We extend Bayesian hierarchical curve registration methods to accommodate count data and to incorporate influence of baseline covariates on individual behavioral trajectories. Analyzing selfreported counts of yearly marijuana use from the Denver Youth Survey, we examine the influence of race and gender categories on differences in levels and timing of marijuana smoking. We find that our approach offers a flexible and realistic model for longitudinal crime trajectories that fits individual observations well and allows for a rich array of inferences of interest to criminologists and drug abuse researchers.
Reduction of Overheads with Dynamic Caching in Fixed AODV based MANETs

In this paper we show that adjusting ART in accordance with static network scenario can substantially improve the performance of AODV by reducing control overheads. We explain the relationship of control overheads with network size and request patterns of the users. Through simulation we show that making ART proportionate to network static time reduces the amount of control overheads independent of network size and user request patterns. Keywords—AODV, ART, MANET, Route Cache, TTL.
Uniform Interpolation for 퓐퓛퓒 Revisited ★

The notion of uniform interpolation for description logic 𝒜ℒ𝒞 has been introduced in [9]. In this paper, we reformulate the uniform interpolation for 𝒜ℒ𝒞 from the angle of forgetting and show that it satisﬁes all desired properties of forgetting. Then we introduce an algorithm for computing the result of forgetting in concept descriptions. We present a detailed proof for the correctness of our algorithm using the Tableau for 𝒜ℒ𝒞 . Our results have been used to compute forgetting for 𝒜ℒ𝒞 knowledge bases.
Ontology-based corpus generation for web comment analysis

In the study of technology acceptance the survey and analysis of user opinions is crucial to identify acceptance-relevant factors. In addition to topic-related surveys, which require a high user willingness, the World Wide Web poses a huge collection of user discussions and comments to serve as a basis for further analysis. An ontology-based corpus generation tool is proposed, which serves to evaluate and extract particular web comments.