Miracle-dz/UniFAR-FTUs huggingface dataset:
Enabling Interoperability between Multimedia Resources : An Ontology Matching Perspective

The semantic annotation of images can benefit from representations of useful concepts and the links between them as ontologies. Recently, several multimedia ontologies have been proposed in the literature as suitable knowledge models to bridge the well known semantic gap between low level features of image content and its high level conceptual meaning. Nevertheless, these multimedia ontologies are often dedicated to (or initially built for) particular needs or a particular application. Ontology matching, defined as the process of relating different heterogeneous models, we will argue, is a suitable approach to solve interoperability issues in semantic image annotation and retrieval. We propose a generic instance-based ontology matching approach, applied to an important semantic image retrieval issue: the bridging of the semantic gap by matching a multimedia ontology against a common-sense knowledge resource.
Management of Genitourinary Injuries in Patients with Pelvic Fractures

Associated injuries frequently oeeur in patients who sustain fractures of the pelvis. Hemorrhage from intrapelvic vessels, rupture of the urinary bladder and avulsion of the membranous urethra in males are among the integral risks in this trauma. Non-operative methods of managing hemorrhage have gained favor in recent experience. The case records of 282 male patients with pelvic fractures were reviewed to evaluate experience with lower genitourinary injuries. Early recognition is important in bladder injuries, and surgical repair is advised, except in selected patients who may be managed by catheter drainage alone. Delayed complications of bladder injury are rare. Membranous urethral injuries entail a high risk of chronic stricture disease and sexual impotence. The rationale of early repair versus delayed repair of these injuries is discussed. The results in this series show advantage for delayed repair.
A class of FRM-based all-pass digital filters with applications in half-band filters and Hilbert transformers

In this paper, we consider the application of the frequency-response masking (FRM) technique in constructing the IIR approximately linear-phase half-band filters and Hilbert transformers. An efficient implementation structure, consisting of a FRM-based nearly all-pass filter and a pure delay term, has been derived. The FRM-based branch being composed of the recursive all-pass filter and the two polyphase components of FIR masking filters, exhibits nearly all-pass magnitude response and approximately linear phase. We are focused on the low-complexity implementation of the recursive all-pass filter. We propose a new simple approximation method, which we apply to design the approximately linear phase IIR filter with simple powers-of-two coefficients. The example half-band filters and Hilbert transformers show sharp magnitude responses and approximately linear phase.
Motes Sensor Networks in Dynamic Scenarios: An Experimental Study for Pervasive Applications in Urban Environments

Recent works have shown that using mobile elements (or data MULEs) to collect and carry data from sensor networks to a collection point may have significant advantages over traditional ad hoc sensor networks. Previous papers on the MULE architecture are mainly based on simulation and numerical analysis. In this paper we investigate the performance of the data MULE model and its ability to support sensorbased applications in a real urban environment by means of an experimental analysis. Specifically, we use a testbed based on Berkeley motes, and analyze the impact of several parameters (i.e., MULE’s speed, distance between the static node and the MULE, duty cycle) on the contact time and the total amount of data that a static node is able to transfer to the mobile MULE when they happen to get in contact. The results obtained are very promising and show that the MULE architecture is really suitable for a large set of sensor-based applications in urban environments, both in low and high mobility scenarios.
Highly Specific Contractions of a Single CAG/CTG Trinucleotide Repeat by TALEN in Yeast

Trinucleotide repeat expansions are responsible for more than two dozens severe neurological disorders in humans. A double-strand break between two short CAG/CTG trinucleotide repeats was formerly shown to induce a high frequency of repeat contractions in yeast. Here, using a dedicated TALEN, we show that induction of a double-strand break into a CAG/CTG trinucleotide repeat in heterozygous yeast diploid cells results in gene conversion of the repeat tract with near 100% efficacy, deleting the repeat tract. Induction of the same TALEN in homozygous yeast diploids leads to contractions of both repeats to a final length of 3–13 triplets, with 100% efficacy in cells that survived the double-strand breaks. Whole-genome sequencing of surviving yeast cells shows that the TALEN does not increase mutation rate. No other CAG/CTG repeat of the yeast genome showed any length alteration or mutation. No large genomic rearrangement such as aneuploidy, segmental duplication or translocation was detected. It is the first demonstration that induction of a TALEN in an eukaryotic cell leads to shortening of trinucleotide repeat tracts to lengths below pathological thresholds in humans, with 100% efficacy and very high specificity.
A unified performance analysis of wireless communications over η-λ-μ generalized fading channels

In this paper, we present a unified performance analysis of wireless communication over fading channels in terms of the Average Symbol Error Rates (ASER), Average Channel Capacity (ACC) and Moment Generating Function (MGF). We derive a simple and accurate exact and approximate closed-form expression for ASER, encapsulating all types of coherent digital modulations schemes, and exact expressions for the ACC and MGF, for the new fading distribution that has not been studied before, the η-λ-μ generalized fading, which accurately characterizes, thanks to the remarkable flexibility of the named parameters, the non-homogeneous nature of the propagation medium, including the λ-μ, the η-μ, the Hoyt, the Rice, the Nakagami-m, the Rayleigh, the Gamma, the Exponential, and the One-sided Gaussian fading distributions as special cases. The derived expressions are analytically-traceable and convenient to handle both numerically and analytically. Monte Carlo simulations and existing solutions for the special cases of this fading have been used to validate the derived expressions, where an excellent match is achieved.
Learning character recognition by localized interpretation of character-images

Recognition algorithms encompass segmentation, feature extraction and classification, but these components might be difficult to isolate because of strong interactions between them, and the lack of crisp criteria telling where one stops and where the other begins. Extreme variability of text images, and of hand written texts in particular, makes it difficult to tune any of those three parts of a recognition algorithm to real data. Automatic parameter tuning (training or learning) requires parametrization of at least a part of the algorithm. As it is more convenient to parametrize classification than the rest of the recognition algorithm, machine learned recognition usually means that the recognition classifier has been trained or tuned automatically. We show that our box connectivity approach to feature extraction, and localized interpretation within the classifier, provide solutions to the outlined problems, and allow efficient implementation of direct learning.
Triangulation Embedding and Democratic Aggregation for Image Search

We consider the design of a single vector representation for an image that embeds and aggregates a set of local patch descriptors such as SIFT. More specifically we aim to construct a dense representation, like the Fisher Vector or VLAD, though of small or intermediate size. We make two contributions, both aimed at regularizing the individual contributions of the local descriptors in the final representation. The first is a novel embedding method that avoids the dependency on absolute distances by encoding directions. The second contribution is a "democratization" strategy that further limits the interaction of unrelated descriptors in the aggregation stage. These methods are complementary and give a substantial performance boost over the state of the art in image search with short or mid-size vectors, as demonstrated by our experiments on standard public image retrieval benchmarks.
Update-tolerant and Revocable Password Backup (Extended Version)

It is practically impossible for users to memorize a large portfolio of strong and individual passwords for their online accounts. A solution is to generate passwords randomly and store them. Yet, storing passwords instead of memorizing them bears the risk of loss, e.g., in situations where the device on which the passwords are stored is damaged, lost, or stolen. This makes the creation of backups of the passwords indispensable. However, placing such backups at secure locations to protect them as well from loss and unauthorized access and keeping them up-to-date at the same time is an unsolved problem in practice. We present PASCO, a backup solution for passwords that solves this challenge. PASCO backups need not to be updated, even when the user's password portfolio is changed. PASCO backups can be revoked without having physical access to them. This prevents password leakage, even when a user loses control over a backup. Additionally, we show how to extend PASCO to enable a fully controllable emergency access. It allows a user to give someone else access to his passwords in urgent situations. We also present a security evaluation and an implementation of PASCO.
A new computational model captures fundamental architectural features of diverse biological networks

Complex biological systems are often represented by network graphs; however, their structural features are not adequately captured by existing computational graph models, perhaps because the datasets used to assemble them are incomplete and contain elements that lack shared functions. Here, we analyze three large, near-complete networks that produce specific cellular or behavioral outputs: a molecular yeast mitochondrial regulatory protein network, and two anatomical networks of very different scale, the mouse brain mesoscale connectivity network, and the C. elegans neuronal network. Surprisingly, these networks share similar characteristics. All consist of large communities composed of modules with general functions, and topologically distinct subnetworks spanning modular boundaries responsible for their more specific phenotypical outputs. We created a new model, SBM-PS, which generates networks by combining communities, followed by adjustment of connections by a ‘path selection’ mechanism. This model captures fundamental architectural features that are common to the three networks.
Document perceptual quality ground truth creation

Perspective distortion always occurs while scanning thick, bound documents, resulting in two problems in the scanned grayscale image - (i) shade along the 'spine' of the book, and (ii) warping of words in the shade area. We proposed a restoration system to solve these two problems in our previous paper [1]. However the shape of the warped words was not fully restored, since we simply shifted and rotated the warped word. In this paper, we will propose a better method to straighten warped text line using polynomial regression. The implementation results comparing with those of the old system have shown a marked improvement in the image restoration.
Crossing Borders by "Walking around" Culture: Three Ethnographic Reflections on Teacher Preparation.

Ervin F. Sparapani is a professor in the Department of Middle School and Secondary Teacher Education at Saginaw Valley State University, Saginaw, Michigan. Byung-In Seo is an assistant professor in the Department of Doctoral Studies at Chicago State University, Chicago, Illinois. Deborah L. Smith is an assistant professor in the Department of Middle School and Secondary Teacher Education at Saginaw Valley State College, Saginaw, Michigan. Their e-mail addresses are ervin-f-sparapani@svsu.edu, bseo@csu.edu, and deborah-l-smith@svsu.edu Introduction
Laser stripe model for sub-pixel peak detection in real-time 3D scanning

Estimator algorithms rely on assumed laser stripe image profile to determine its peek with sub-pixel accuracy. They depend on light intensity readings around the peak and are susceptible to noise and saturation. Noise and stripe intensity models are commonly used to synthesize and feed test data to estimator algorithms in order to evaluate their accuracy and robustness. For real-time 3D scanning applications estimator algorithms are expected to prefer less computationally demanding estimation techniques. Simple and accurate models of empirical noise and laser stripe profile could be used to improve testing and algorithms accuracy. Modular test setup for 3D scanning is utilized to project a laser stripe on the target with patterned surface. Laser stripe image is captured and processed to extract noise and surface pattern interference. Laser power modulation is used to generate series of captures with various stripe intensities. Captures are partitioned, analyzed and presented according to target surface properties and color channels. Image noise interfering with sub-pixel peak detection is analyzed and noise model based on empirical data is proposed. Empirical laser stripe images are analyzed and novel simple laser stripe intensity profile model conforming to empirical data is proposed.
Atomic collisions with relativistic heavy ions. VIII. Charge-state studies of relativistic uranium ions.

Charge-state distributions were measured for incident 105-, 220-, 430-, and 955-MeV/amu U ions on thin and thick solid targets. Initial bare, one-, two-, three-, nine-, and 24-electron ions were used, so that single and multiple ionization of K-, L-, and M-shell electrons and electron capture into bare ions and into ions having initially full or partially full K and L shells could be observed. Multiple-ionization effects in two-electron U ions and in ions having many electrons in the K, L, and M shells are calculated by using the semiclassical approximation and assuming binomial statistics. Binding effects on K-shell ionization are compared with previous measurements using relativistic Xe ions, and with the Glauber theory. For 430- and 955-MeV/amu U ions, good agreement is obtained between measured capture cross sections and calculated radiative and nonradiative (eikonal-approximation) cross sections. Some disagreement is found at lower energies. An approximate model is proposed for multiple-capture cross sections. Finally, the measured equilibrium charge states are compared to ground-state models and to models including excited-state effects. Excited-state effects are less important for relativistic U ions than for any other ion in matter. Differences between the excited- and ground-state models are found to be too small to bemore » observed. « less
What happened to remote usability testing?: an empirical study of three methods

The idea of conducting usability tests remotely emerged ten years ago. Since then, it has been studied empirically, and some software organizations employ remote methods. Yet there are still few comparisons involving more than one remote method. This paper presents results from a systematic empirical comparison of three methods for remote usability testing and a conventional laboratory-based think-aloud method. The three remote methods are a remote synchronous condition, where testing is conducted in real time but the test monitor is separated spatially from the test subjects, and two remote asynchronous conditions, where the test monitor and the test subjects are separated both spatially and temporally. The results show that the remote synchronous method is virtually equivalent to the conventional method. Thereby, it has the potential to conveniently involve broader user groups in usability testing and support new development approaches. The asynchronous methods are considerably more time-consuming for the test subjects and identify fewer usability problems, yet they may still be worthwhile.
Optimal path planning for surveillance with temporal-logic constraints*

In this paper we present a method for automatically generating optimal robot paths satisfying high-level mission specifications. The motion of the robot in the environment is modeled as a weighted transition system. The mission is specified by an arbitrary linear temporal-logic (LTL) formula over propositions satisfied at the regions of a partitioned environment. The mission specification contains an optimizing proposition, which must be repeatedly satisfied. The cost function that we seek to minimize is the maximum time between satisfying instances of the optimizing proposition. For every environment model, and for every formula, our method computes a robot path that minimizes the cost function. The problem is motivated by applications in robotic monitoring and data-gathering. In this setting, the optimizing proposition is satisfied at all locations where data can be uploaded, and the LTL formula specifies a complex data-collection mission. Our method utilizes Büchi automata to produce an automaton (which can be thought of as a graph) whose runs satisfy the temporal-logic specification. We then present a graph algorithm that computes a run corresponding to the optimal robot path. We present an implementation for a robot performing data collection in a road-network platform.
Translation of the open reading frame encoded by comS, a gene of the srf operon, is necessary for the development of genetic competence, but not surfactin biosynthesis, in Bacillus subtilis

A small open reading frame, comS of the srf operon, is the site of mutations that impair competence development in Bacillus subtilis. comS open reading frame translation was required for competence, as was confirmed by the suppression of a comS amber mutation [comS(Am)] by the nonsense suppressor sup-3. comS(Am), when introduced into the srf operon, eliminated late competence gene expression but had no significant effect on surfactin production.
Effects of HMG-CoA Reductase Inhibition by Simvastatin on Vascular Dysfunction Induced by Lipopolysaccharide in Rats

Aims: Statins have been identified as a potentially interesting treatment against sepsis. Here, we study the vascular reactivity of aortae from rats treated with lipopolysaccharide (LPS), 4 mg · kg–1, following chronic administration of simvastatin (SV) 10 mg · kg–1. Methods: The rats were treated with either vehicle or SV for 4 weeks before administration of LPS. After 18 h, the systolic blood pressure (SBP) was measured using a tail cuff and vascular and endothelial responses of aortic rings to several agonists were studied in an organ bath. Results: LPS injection decreased the SBP by 38 mm Hg and vascular response to phenylephrine (Phe) by 60%. Plasma nitrates and nitrites (NOx) were 3-fold higher after LPS. This attenuated response to Phe was prevented by incubation with either the inducible-nitric-oxide-synthase (iNOS)-selective inhibitor 1400W or the endothelial nitric oxide synthase (eNOS)/iNOS nonselective blocker L-NAME. The presence of endothelium did not alter these findings. Administering LPS to SV-treated rats also decreased the SBP and increased the NOx concentration. The impaired response to Phe was restored by blocking NO synthesis in endothelium-denuded but not in intact aortic rings. The response to acetylcholine demonstrated an enhanced reduction in arteries from the SV + LPS group compared with the LPS group. The inhibition of iNOS prevented acetylcholine-induced relaxation in rings from LPS-treated rats but not in those from the SV + LPS group. Conclusion: These results suggest that statins may reduce iNOS-mediated NO production in endothelial but not in vascular smooth-muscle cells.
The Benefits of Similarity between Tourist and Destination Personality

When people choose they often prefer similarity, rather than complementarity. This paper argues that the evaluation of a holiday destination is no exception to this tendency. The study introduces tourist–destination personality similarity (TDPS) as a concept that is distinct from perceived overall fit (POF) between tourist and destination, and examines the effects of these two concepts of congruence on vacationers’ satisfaction and recommendation behavior. Examining a sample of actual vacationers (N = 308) in a holiday resort, TDPS and POF emerged as two related, but distinct concepts: TDPS was a driver of POF, which in turn increased tourists’ satisfaction and actual recommendations of the destination. Our results confirm TDPS as a valuable tool for tourism brand managers and tourism research.
ON THE MATTER OF MEMORY: NEURAL COMPUTATION AND THE MECHANISMS OF INTENTIONAL AGENCY

OF THE DISSERTATION On the Matter of Memory: Neural Computation and the Mechanisms of Intentional Agency by ALEXANDER D. MORGAN Dissertation Directors: Frances Egan & Robert Matthews Humans and other animals are intentional agents ; they are capable of acting in ways that are caused and explained by their reasons. Reasons are widely held to be mediated by mental representations, but it is notoriously difficult to understand how the intentional content of mental representations could causally explain action. Thus there is a puzzle about how to ‘naturalize’ intentional agency. The present work is motivated by the conviction that this puzzle will be solved by elucidating the neural mechanisms that mediate the cognitive capacities that are distinctive of intentional agency. Two main obstacles stand in the way of developing such a project, which are both manifestations of a widespread sentiment that, as Jerry Fodor once put it, “notions like computational state and representation aren’t accessible in the language of neuroscience”. First, C. Randy Gallistel has argued extensively that the mechanisms posited by neuroscientists cannot function as representations in an engineering sense, since they allegedly cannot be manipulated by the computational operations required to generate structurally complex representations. Second, William Ramsey has argued that neural mechanisms in fact do not function as representations in an explanatory sense, since the explanatory role they play is more like that of a causal relay rather than an internal ‘stand-in’ for external entities.