Miracle-dz/UniFAR-FTUs huggingface dataset:
Monitoring and Controlling Locker System Using Skull Identification

: Banks provide locker system for their customers for safekeeping. In the current locker system, there is no separate banker to take care and attend to people wishing to access lockers. Every time a customer wishes to access his locker, he must wait until a banker becomes free so that he can authenticate access to the locker. This results in waste of time for both the banker as well as the customer, as the customer has to wait until the banker becomes free and the banker has to stop his work and attend to the customer. The bank security systems are getting more awareness and importance. The Bank Security System is a system for validating, monitoring and controlling the security at bank locker rooms. Today, there are many banks using authorize access control approach to prevent the locker room from unauthorized access. In this paper highly reliable, multi level and most efficient locker room security system has been designed. The system includes a biometric system, i.e. Skull Recognition, which are responsible for the security of the main door of the locker room and the system also includes a RFID system to provide access of the locker room area to only authorize people. To monitor the unauthorized people in the locker room area a passive infrared sensor is fixed. In case of any unauthorized motion the picture from the camera will be mailed to security officials and the alarms will be on to inform the local security. The system proposed in this paper is a better security system in terms of number of level of security. The project aims to change the system and automate the locker system using RFID tags for customer identification. Every customer is given a unique RFID card with a unique number so that the customer can be identified and access can be granted to the customer’s locker. The RFID card is activated in the Micro controller, created the pin number,the image capture the Camera verification of customer by matching the distance of the top, left, right, bottom of the human Face. The image can be applying active appearance model algorithm, it is converted the mesh. The proposed a method is AAM using the canonical correlation analysis (CCA), which has modeled the relation between differences of the image and the model parameter for improving the convergence speed of algorithm. The skull of the CT scan be store in database, CT image converted in 3D images for mesh for applying marching cub algorithm.human face is captured by the pseudo 3D image capture at the camera. The feature points are calculated and encrypted and sent to the server via a secure channel. The encryption is based on bio keys. If the value matches with the encoded value in the database, it allows locker open.
Analysis of cerebrospinal fluid flow waveforms with gated phase-contrast MR velocity measurements.

PURPOSE To analyze the characteristics of normal cerebrospinal fluid (CSF) flow waveforms and to relate them to the arterial input and venous output flow waveforms in healthy volunteers. METHODS Cine phase-contrast MR was obtained in 17 volunteers. The temporal velocity information from the cervical pericord CSF spaces, basal cisterns, and aqueduct, as well as the internal carotid and vertebral arteries and internal jugular veins, were plotted as waveforms. The waveforms were analyzed for configurations, amplitudes, and temporal patterns. In four volunteers the reproducibility of the precord CSF flow waveforms was examined on different days. In three volunteers the effect of jugular venous compression on the precord and aqueductal CSF flow waveforms was also evaluated. RESULTS (a) Distinct and reproducible configurational features were observed in the CSF flow waveforms. Jugular venous compression produced elevation of the disatolic slope of the precord waveforms. (b) The amplitudes were variable. Jugular venous compression reduced the precord CSF velocities. (c) The systolic temporal parameters were less variable and more reproducible than the diastolic temporal parameters. Jugular venous compression resulted in delay in the systolic parameters of the precord waveforms. (d) Craniocaudal and caudocranial postcord CSF flow occurred either simultaneous with or earlier than the precord CSF flow. Pericord CSF flow in either direction preceded that in the cisterns and in the aqueduct. (e) A significant temporal relationship was noted in the precord space between the time of the R wave to the maximum velocities and the arterial flow. CONCLUSION CSF flow waveform analysis seems to be a reliable, reproducible, and sensitive method for assessing the CSF dynamics.
Special prime numbers and discrete logs in finite prime fields

A set A of primes p involving numbers such as abt + c, where |a|, |b|, |c| = O(1) and t → ∞, is defined. An algorithm for computing discrete logs in the finite field of order p with p ∈ A is suggested. Its heuristic expected running time is Lp[1/3; (32/9)1/3] for (32/9)1/3 = 1.526. , where Lp[α; β] = exp((β + o(1))lnα p(ln ln p)1-α) as p → ∞, 0 < α < l, and 0 < β. At present, the most efficient algorithm for computing discrete logs in the finite field of order p for general p is Schirokauer's adaptation of the Number Field Sieve. Its heuristic expected running time is LP[1/3 (64/9)1/3] for (64/9)1/3 = 1.9229. Using p ∈ A rather than general p does not enhance the performance of Schirokauer's algorithm. The definition of the set A and the algorithm suggested in this paper are based on a more general congruence than that of the Number Field Sieve. The congruence is related to the resultant of integer polynomials. We also give a number of useful identities for resultants that allow us to specify this congruence for some p.
Speeding Up Speaker Diarization by Using Prosodic Features

In this article we present a method to speed up agglomerative clustering used in speaker diarization by using long-term prosodic features. A set of these features is used to decide which clusters should be merged. This strategy reduces the number of decisions that have to be performed using the more calculation-intensive method based on the Bayesian Information Criterion (BIC). We show a speedup of 30 % to a state-of-the-art diarization system
The cosmic X-ray background-IRAS galaxy correlation and the local X-ray volume emissivity

We have cross-correlated the galaxies from the IRAS 2 Jy redshift survey sample and the 0.7 Jy projected sample with the all-sky cosmic X-ray background (CXB) map obtained from the HEAO 1 A-2 experiment. We have detected a significant correlation signal between surface density of IRAS galaxies and the X-ray background intensity, with W(xg) = {deltaIdeltaN}/{I}{N} of several times 10(-3). While this correlation signal has a significant implication for the contribution of the local universe to the hard (E > 2 keV) X-ray background, its interpretation is model-dependent.We have developed a formulation to model the cross-correlation between CXB surface brightness and galaxy counts. This includes the effects of source clustering and the X-ray-far-infrared luminosity correlation. Using an X-ray flux-limited sample of AGNs, which has IRAS 60 mum measurements, we have estimated the contribution of the AGN component to the observed CXB-IRAS galaxy count correlations in order to see whether there is an excess component, i.e., contribution from low X-ray luminosity sources. We have applied both the analytical approach and Monte Carlo simulations for the estimations.Our estimate of the local X-ray volume emissivity in the 2-10 keV band is rho(x) almost-equal-to (4.3 +/- 1.2) x 10(38) h50 ergs s-1 Mpc-3, consistent with the value expected from the luminosity function of AGNs alone. This sets a limit to the local volume emissivity from lower luminosity sources (e.g., star-forming galaxies, LINERs) to rho(x) less-than-or-similar-to 2 X 10(38) h50 ergs s-1 Mpc-3.
Efficacy of biofeedback therapy via a mini wireless device on sleep bruxism contrasted with occlusal splint: a pilot study

Abstract The putative causes of bruxism are multifactorial and there are no definite measures for bruxism management. The aim of this study was to evaluate the efficacy of biofeedback therapy on sleep bruxism, compared with occlusal splint. Twenty-four volunteers with sleep bruxism were divided into two groups: the GTB group that were treated with biofeedback therapy (n = 12) and the GTO group that were treated with occlusal splint (n = 12). A mini pressure sensor integrated with a monitoring circuit by use of a maxillary biofeedback splint was fabricated. To foster the relaxation of the masticatory muscles and the nervous system, the wireless device received signals from bruxism events and vibrations alerted the bruxer when the threshold was exceeded. Total episodes and average duration of bruxism events during 8 hours of sleep were analyzed with the monitoring program (TRMY1.0). After 6 and 12 weeks, the episodes (P = 0.001) and duration (P < 0.05) in the GTB group declined dramatically. In contrast, there were no significant differences in the GTO group after the treatment (P > 0.05). Furthermore, the episodes had significant differences between the GTB group and the GTO group after the same period of treatment (P = 0.000). The results suggest that biofeedback therapy may be an effective and convenient measure for mild bruxers, when compared with occlusal splint therapy. The mini wireless biofeedback method may be of value for the diagnosis and management of bruxism in the future.
AII amacrine cells in the distal inner nuclear layer of the mouse retina

We serendipitously found a distal Disabled‐1 (Dab1)‐immunoreactive cell in retina of the C57BL/6J black mouse. The somata of these cells are located in the outermost part of the inner nuclear layer (INL). Their processes extend toward the outer plexiform layer (OPL), receiving synaptic inputs from horizontal and interplexiform cells. In the current study, we name this cell the “distal Dab1‐immunoreactive cell. ” Double‐labeling experiments demonstrate that the distal Dab1‐immunoreactive cell is not a horizontal cell. Rather, the distal Dab1 cell appears to be a misplaced AII cell, by being glycine transporter‐1‐immunoreactive and by resembling the latter cell in an electron microscopic analysis. A distal Dab1 cell had been reported in the FVB/N mouse retina, a model of retinitis pigmentosa (Park et al. [2004] Cell Tissue Res 315:407–412). However, here, we found this distal Dab1‐immunoreactive cell in the adult and normal developing mouse retinas. Hence, we show that such cells do not require the loss of photoreceptors as suggested previously (Park et al. [2004] Cell Tissue Res 315:407–412). Instead, two other pieces of data suggest an alternative explanation sources for distal Dab1 cells. First, we find a correlation between the number of these cells in the left and right eyes Second, developmental analysis shows that the distal Dab1‐immunoreactive cell is first observed shortly after birth. At the same time, AII cells emerge, extending their neurites into the inner retina. These data suggest that distal Dab1‐immunoreactive cells are misplaced AII amacrine cells, resulting from genetically modulated anomalies owing to migration errors. J. Comp. Neurol. 494:651–662, 2006. © 2005 Wiley‐Liss, Inc.
Affine phylogeny constraints

We systematically study the computational complexity of a broad class of computational problems in phylogenetic reconstruction. This class of problems can be described as the class of constraint satisfaction problems for all constraint languages with a first-order definition over the rooted triple relation (known in model theory as the universal homogeneous C-relation); in the following we call such problems phylogeny problems. The class contains for example the rooted triple consistency problem, forbidden subtree problems, the quartet consistency problem, and many other problems studied in the literature. We show that every phylogeny problem can be solved in polynomial time, or is NPcomplete. On the algorithmic side, we generalize and extend a well-known polynomial-time algorithm of Aho, Sagiv, Szymanski, and Ullman for the rooted triple consistency problem. Our algorithm repeatedly solves linear equation systems to construct a tree solution in polynomial time. Every phylogeny problem that cannot be solved by our algorithm is NP-complete. Our proof combines results from various research areas: a result in model theory (about infinite primitive Jordan groups with a primitive Jordan set [31]); a special case of Milliken’s theorem, which is a Ramsey-type theorem for rooted trees [15,32]; techniques from constraint satisfaction, developed in [6, 11,26].
Policy narratives on applied baccalaureate degrees: implications for student access to and progression through college in the United States

Abstract This study analyses the perspectives of four stakeholder groups towards Applied Baccalaureate (AB) degrees in the United States. Perspectives towards AB degrees that are held by community college personnel, university personnel, employers and student participants are analysed using the Policy Narrative Framework. Findings show the stakeholder groups hold common as well as contrasting perspectives on the contributions of AB degrees to college access, completion and progression to employment. Community college AB degree participants, the preponderance of whom represents historically underserved student groups, appreciate the flexible scheduling, applied learning and workforce relevance of these degrees, and they perceive that community colleges are advocates, or heroes, in helping them obtain AB degrees that will get them a good job. However, community college and university personnel view AB degrees differently, with community college personnel seeing them as having reasonable costs and wide benefits and universities seeing them as having high costs and narrow benefits. Employers have limited understanding of AB degrees yet tend to view them favourably, including the benefit of encouraging local economic and community development. Despite these perceived benefits, the authors conclude that AB degrees remain a contested second-order change to higher education that is yet to demonstrate results to improving the educational attainment and social mobility of undeserved students.
Sensory Attenuation for Jointly Produced Action Effects

Successful joint action often requires people to distinguish between their own and others’ contributions to a shared goal. One mechanism that is thought to underlie a self-other distinction is sensory attenuation, whereby the sensory consequences of one’s own actions are reduced compared to other sensory events. Previous research has shown that the auditory N1 event-related potential (ERP) response is reduced for self-generated compared to externally generated tones. The current study examined whether attenuation also occurs for jointly generated tones, which require two people to coordinate their actions to produce a single tone. ERP responses were measured when participants generated tones alone (tone onset immediately followed the participant’s button press) or with a partner (tone onset immediately followed the participant’s or the partner’s button press, whichever occurred second). N1 attenuation was smaller for jointly generated tones compared to self-generated tones. For jointly generated tones, greater delays between the participant’s and the partner’s button presses were associated with reduced attenuation; moreover, only trials in which there was no delay between the participant’s press and tone onset showed attenuation, whereas trials in which there were delays did not show attenuation. These findings indicate that people differentiate between their own and another person’s contributions to a joint action at the sensorimotor level, even when they must act together to produce a single, shared effect.
Vectorized LU Decomposition Algorithms for Large-Scale Circuit Simulation

Proposed here are two kinds of vectorized LU decomposition algorithms for an unstructured sparse matrix arising from large scale circuit simulation. Either algorithm implemented on our supercomputer S810 improves efficiency 11 to 82 times for LU decomposition and 2.1 to 8.9 times in total simulation, as compared with a conventional algorithm. Both algorithms detect operational parallelism in the irregularity of a matrix. While one of them limits the scope of parallelism detection to each set of consecutive columns so as to take advantage of the dense matrix method applicable to the lower right corner, the other tries to locate parallelism all over the matrix in every step without switching to a faster linear-index vector.
On organic interfaces

For over four decades, our research community has taken remarkable strides in advancing human language technologies. This has resulted in the emergence of spoken dialogue interfaces that can communicate with humans on their own terms. For the most part, however, we have assumed that these interfaces are static; it knows what it knows and doesn’t know what it doesn’t. In my opinion, we are not likely to succeed until we can build interfaces that behave more like organisms that can learn, grow, reconfigure, and repair themselves, much like humans. In this paper, I will argue my case and outline some new research challenges.
Beliefs and Consumer Choice

Consumerschoices depend on preferences over outcomes and beliefs about how their choices map into these outcomes. While economic models typically assume some form of rational expectations or "perfect beliefs, in reality consumers are often ill-informed or confused. In this paper, I elicit beliefs over the nancial bene ts and costs of higher or lower fuel economy using the Vehicle Ownership and Alternatives Survey, a new nationally-representative study of vehicle owners designed speci cally for this project. Results show that beliefs are both highly noisy, consistent with imperfect information and bounded computational capacity, and systematically biased in a manner symptomatic of "MPG Illusion" (Larrick and Soll 2008). Conditional on these beliefs, I then estimate preferences in a discrete choice demand system for the US automobile market. In a counterfactual world with perfect beliefs, consumers would demand fewer vehicles at the extremes of the fuel economy distribution and welfare would increase by about $0.8 billion per year, about $3.60 per potential vehicle consumer. JEL Codes: D03, D12, D83, D84, L91, Q41. Keywords: Beliefs, bounded computational capacity, MPG Illusion, discrete choice models, automobile demand, energy e¢ ciency.                             I thank Stefano DellaVigna, Kenny Gillingham, John Hauser, Aprajit Mahajan, Charles Manski, Sendhil Mullainathan, Drazen Prelec, Alan Sorensen, Rich Sweeney, and seminar participants at the BECC conference, Harvard, MIT, and Northeastern for thoughtful comments. This idea originally grew out of joint work with Nathan Wozny and has bene tted substantially from our collaboration. Thanks to Patrick DeHaan at GasBuddy for providing gasoline and diesel price data. Thanks also to Jeremy Freese, Penny Visser, and three anonymous referees at Time-Sharing Experiments for the Social Sciences. Hard work by Yelena Kruse, Poom Nukulkij, and others at Knowledge Networks in elding the survey was essential to the project. Funding for this work and related projects was provided by the Sloan Foundation.
Ammonia Reductions and Costs Implied By the Three Ambition Levels Proposed in the Draft Annex IX to the Gothenburg Protocol

The Convention on Long-range Transboundary Air Pollution has started negotiations on the revision of its Gothenburg multi-pollutant/multi-effect protocol. Among other topics, emissions of ammonia have been subject of specific scrutiny. To inform negotiations, the Task Force on Reactive Nitrogen (TFRN) has compiled a list of potential ammonia emission control measures that could form an annex to the protocol. This "Draft Annex IX" defines three ambition levels, ranging from the most stringent level "A" to the least ambitious level "C". This report presents estimates of the ammonia emission reductions and costs of the measures that are included in the Draft Annex IX prepared for the revision of the Gothenburg Protocol. The estimates for the three different ambition levels have been derived with the GAINS model, and it is assumed that these measures are equally implemented for all countries, even if they are not cost-effective. The specific assumptions in translating the specifications provided in the Draft Annex IX into GAINS input data are described in this paper. Costs for implementing the ambition levels vary across countries. Taking into account recent information on ammonia emission control costs that has been compiled by the Task Force on Reactive Nitrogen it is found that overall costs of the proposed measures are generally low. Per unit of emissions abated, costs are typically only up to 1 Euro per kg NH3-N abated with a few outliers which, however, stay below 5 Euro per kg NH3-N abated. Total abatement costs are modest, for the most ambitious scenario A they amount to 8/1000 of 1% of the GDP in 2020. In relative terms (e.g., expressed as percentage of GDP) costs are higher in the non-EU countries than in the EU-27. It is found that the specific measures, if uniformly implemented in all countries, would be less cost-effective than the (country-specific) least-cost set of measures that are derived from the GAINS optimization, e.g., for the MID and LOW cases in CIAM 4/2011 report, where the model can choose from a wider set of options.
Viscosity Dependence of the Folding Rates of Proteins

The viscosity shd dependence of the folding rates for four sequences (the native state of three sequences is a b sheet, while the fourth forms an a helix) is calculated for off-lattice models of proteins. Assuming that the dynamics is given by the Langevin equation, we show that the folding rates increase linearly at low viscosities h, decrease as 1yh at large h, and have a maximum at intermediate values. The Kramers’ theory of barrier crossing provides a quantitative fit of the numerical results. By mapping the simulation results to real proteins we estimate that for optimized sequences the time scale for forming a four turn a-helix topology is about 500 ns, whereas for b sheet it is about 10 ms. [S0031-9007(97)03573-4]
LDPC based error resilient audio signal processing for wireless communication

The increasing growth of communication has fostered research on various methods to obviate noise from affecting the data transmitted over the link. Low Density Parity Check (LDPC) has gained popularity because of its property of exhibiting near Shannon limit performance when interpreted via iterative probabilistic algorithm. This paper presents a high performance and an enhanced LDPC based algorithm, for channel coding audio signals. The algorithm is designed so as to facilitate adaptive feature as a function of input audio size. It generates an encoded stream of data by arranging bits into data vectors and processing it with the designed LDPC matrix. The modulation scheme considered for transmitting the audio signal is Binary Phase Shift Keying (BPSK). The audio signal recovered at various Signal to Noise ratios (SNRs) is illustrated. The performance analysis of the algorithm delineates improved results for AWGN noise. The Bit Error Rate (BER) is estimated at different SNRs and BER Vs SNR graph is plotted to determine the efficacy of the algorithm.
FRAGILE BANKS, GOVERNMENT BAILOUTS AND THE COLLAPSE OF THE THAI BAHT

The focus of this paper is two fold. Relevant aspects of the Thai crisis are evaluated. This provides the motivation for the incorporation of a fragile banking sector within a Krugman (1979)-type framework. This in turn allows for a consideration of the effects of banking sector vulnerabilities on the speed and timing of a currency collapse.