Miracle-dz/UniFAR-FTUs huggingface dataset:
Evaluating Various Branch-Prediction Schemes for Biomedical-Implant Processors

This paper evaluates various branch-prediction schemes under different cache configurations in terms of performance, power, energy and area on suitably selected biomedical workloads. The benchmark suite used consists of compression, encryption and data-integrity algorithms as well as real implant applications, all executed on realistic biomedical input datasets. Results are used to drive the (micro)architectural design of a novel microprocessor targeting microelectronic implants. Our profiling study has revealed that, under strict or relaxed area constraints and regardless of cache size, the ALWAYS TAKEN and ALWAYS NOT-TAKEN static prediction schemes are, in almost all cases, the most suitable choices for the envisioned implant processor. It is further shown that bimodal predictors with small Branch-Target-Buffer (BTB) tables are suboptimal yet also attractive solutions when processor I/D-cache sizes are up to 1024KB/512KB, respectively.
Performance Evaluation using Various Models in Distributed Component based Systems

the years, several models were proposed to analyze the performance of distributed component based system with the view of improving system's performance. Traditional methods of prediction such as Petri nets and queuing networks exploit the benefits of component engineering paradigm, such as division of work and reuse. We have surveyed different approaches of performance prediction which have attained widespread industrial use. Each approach has different goals and context, at which phase of life cycle process which approach is appropriate is described, there benefits and drawbacks are also given. Based on the analysis we have found that the models are machine centric e.g. throughput, responsiveness, no. of processes CPU has to execute within limited processor speed. None of the model draws parameters from the contributions of the client organization and end users. We have proposed a solution in this paper for taking into consideration end users perspective. Software is developed in order to satisfy requirements of the end users. Therefore, involving users in evaluating performance should not be underestimated.
Implementing Implicit Self-Adjusting Computation

Computational problems that involve dynamic data have been an important subject of study in programming languages. Recent advances in self-adjusting computation have developed techniques that enable programs to respond automatically and efficiently to dynamic changes in their inputs. But these techniques have required an explicit programming style, where the programmer must use specific monadic types and primitives to identify, create and operate on data that can change over time. Our paper, “Implicit Self-Adjusting Computation for Purely Functional Programs” (ICFP ’11), describes the theory underlying implicit self-adjusting computation, where the programmer need only annotate the (top-level) input types of the programs to be translated. A type-directed translation rewrites the (purely functional) source program into an explicitly selfadjusting target program. The subject of this talk is a prototype implementation (an extension of MLton) and experimental results that are competitive with explicitly self-adjusting handwritten code.
Strong-principal bimodules of nest algebras

We shall show that B(H) can be represented by the strong closure of the linear span of the compounds of a fixed operator in B(H) and the rank one operators, composed only by the vectors of a certain orthonormal basis of H, in a nest algebra, even, under some assumption, in the radical of a nest algebra. 0. NOTATIONS, BASIC RELATIONSHIPS, AND INTRODUCTION Throughout, the nonzero Hilbert space H under consideration is complex and separable. Subspace means "closed subspace of H" and operator means "bounded linear operator from H into itself. " C is used for "is contained in," while c is reserved for "is properly contained in. " We write B(H) for the set of all operators and K(H) for the set of all compact operators. The symbol x X y denotes the rank-l operator (., x)y for x, y E H. If S C H and 5? C B(H), we write R1(S) for the set of all rank-l operators composed by vectors in S and R5' and R15 for R1(S)nSY and R1(H)n5 respectively. If M is a subspace, PM stands for the projection from H onto M. If 5 C B(H), [9i](s) ([5](n)) denotes the strong closure (norm closure) of the linear span of S. If Y, v C B(H), and if there exists G in B(H) such that Y= [_WG. ](s)(9 = [,VGW](n)), then we call 5 a strong-principal (normprincipal) bimodule of v with respect to G. A nest X is a family of subspaces totally ordered by inclusion. X is said to be complete if (i) it contains {O} and H and (ii) given any subfamily Ao of X, the subspaces A{L: L E Yo} and V{L: L E XlI} are both members of X. If N E X, we define N_ = V{L: L c N, L E X} and N+ = A{L: N c L, L E X}. Obviously, if X is complete, then N_, N+ E X for all N E X. Throughout, a nest is complete. The set {T: T E B(H), TN C N, N E X} is called the nest algebra (associated with X) and is denoted in this paper by AX. The space M E) N, with M, N E X and M D N, is called an X-interval. A finite X-partition is a finite set {E1, . , En } of mutually orthogonal X-intervals with E1 D . DEn = H. The Jacobson radical [5, p. 69] of AX is denoted by RAX. We can regard the following theorem as another Received by the editors December 5, 1990. 1980 Mathematics Subject Classification (1985 Revision). Primary 47A65, 47C65, 47D15.
RUNTIME MONITORING TECHNIQUE TO HANDLE TAUTOLOGY BASED SQL INJECTION ATTACKS

Over the recent years our dependence on web applications has increased drastically in our everyday routine activities. Therefore, we expect these web applications to be secure and reliable when we are paying bills, shopping online, making transactions etc. These web applications consist of underlying databases containing confidential user’s data like financial information records, medical information records, and personal information records, which are highly sensitive and valuable. This in turn makes web applications an ideal target for attacks. Some of the attacks targeted on web applications include SQL Injection Attacks (SQLIAs), Cross-Site Scripting (CSS), Cross-Site Request Forgery (CSRF), Path Traversal Attacks, etc.
Proposed relay selection scheme for physical layer security in Cognitive Radio networks

Cognitive Radio (CR) technology is one of the strong candidate technologies to solve the spectrum scarcity problems. In this paper, we tackle the problem of secure data transmission between a secondary user transmitter and receiver through a relay in the presence of an eavesdropper in a cognitive radio network. The proposed scheme selects the best Decode-and-Forward relay among different relays to assist the transmitter, and to maximize the achievable secrecy rate without harming the primary user. Simulation results show that the secrecy capacity of the network using this scheme will almost be double the capacity when selecting the conventional scheme of relay selection.
A System-Level Architecture for Fine-Grained Privacy Control in Location-Based Services

We introduce a system-level architecture providing fine-grained control over user privacy, in the context of location-based services accessed via mobile devices. In contrast with most mobile platforms today, users only have coarse-grained control over their privacy, either accepting to unconditionally stream their locations in order to use a service, or renouncing the service altogether. However, not all location-based services do require the same level of location accuracy and the same level of privacy renouncement. With this architecture, the user can adapt the tradeoff between location privacy and location accuracy. To achieve this, our architecture relies on three main elements: a trusted module extending the underlying mobile platform, a secure protocol between that module and untrusted applications offering location-based services, and a tree capturing user's zones of interest and organizing them in various accuracy levels. Untrusted mobile applications no longer receive user locations directly: the trusted module intercepts them to compute user's zones of interest and create the tree. The user can then decide what level of accuracy will be disclosed to what application. We evaluate this architecture from a privacy preserving point of view by comparing well-known blurring mechanisms and our tree.
GIScience for a driverless age

ABSTRACT A driverless or autonomous vehicle requires significant support from information technology, both from central databases and from local sensors. The requirements for route guidance are in many ways more demanding than those of current guidance technologies, especially in the ‘last mile’ of a route. Significant extensions are needed for both street-centerline and point-of-interest databases. How these should be captured and structured present significant research challenges for GIScience. The societal and longer term impacts of such extensions are perhaps even more in need of focused research by the GIScience community.
The F-BAR domains from srGAP1, srGAP2 and srGAP3 regulate membrane deformation differently

Summary Coordination of membrane deformation and cytoskeletal dynamics lies at the heart of many biological processes critical for cell polarity, motility and morphogenesis. We have recently shown that Slit-Robo GTPase-activating protein 2 (srGAP2) regulates neuronal morphogenesis through the ability of its F-BAR domain to regulate membrane deformation and induce filopodia formation. Here, we demonstrate that the F-BAR domains of two closely related family members, srGAP1 and srGAP3 [designated F-BAR(1) and F-BAR(3), respectively] display significantly different membrane deformation properties in non-neuronal COS7 cells and in cortical neurons. F-BAR(3) induces filopodia in both cell types, though less potently than F-BAR(2), whereas F-BAR(1) prevents filopodia formation in cortical neurons and reduces plasma membrane dynamics. These three F-BAR domains can heterodimerize, and they act synergistically towards filopodia induction in COS7 cells. As measured by fluorescence recovery after photobleaching, F-BAR(2) displays faster molecular dynamics than F-BAR(3) and F-BAR(1) at the plasma membrane, which correlates well with its increased potency to induce filopodia. We also show that the molecular dynamic properties of F-BAR(2) at the membrane are partially dependent on F-Actin. Interestingly, acute phosphatidylinositol 4,5-bisphosphate [PtdIns(4,5)P2] depletion in cells does not interfere with plasma membrane localization of F-BAR(2), which is compatible with our result showing that F-BAR(2) binds to a broad range of negatively-charged phospholipids present at the plasma membrane, including phosphatidylserine (PtdSer). Overall, our results provide novel insights into the functional diversity of the membrane deformation properties of this subclass of F-BAR-domains required for cell morphogenesis.
Focal Adhesion Kinase: Insight into Molecular Roles and Functions in Hepatocellular Carcinoma

Hepatocellular carcinoma (HCC) is the third leading cause of cancer-related death worldwide. Due to the high incidence of post-operative recurrence after current treatments, the identification of new and more effective drugs is required. In previous years, new targetable genes/pathways involved in HCC pathogenesis have been discovered through the help of high-throughput sequencing technologies. Mutations in TP53 and β-catenin genes are the most frequent aberrations in HCC. However, approaches able to reverse the effect of these mutations might be unpredictable. In fact, if the reactivation of proteins, such as p53 in tumours, holds great promise as anticancer therapy, there are studies arguing that chronic activation of these types of molecules may be deleterious. Thus, recently the efforts on potential targets have focused on actionable mutations, such as those occurring in the gene encoding for focal adhesion kinase (FAK). This tyrosine kinase, localized to cellular focal contacts, is over-expressed in a variety of human tumours, including HCC. Moreover, several lines of evidence demonstrated that FAK depletion or inhibition impair in vitro and in vivo HCC growth and metastasis. Here, we provide an overview of FAK expression and activity in the context of tumour biology, discussing the current evidence of its connection with HCC development and progression.
DNA Sequence Classification Using Compression-Based Induction

Inductive learning methods, such as neural networks and decision trees, have become a popular approach to developing DNA sequence identification tools. Such methods attempt to form models of a collection of training data that can be used to predict future data accurately. The common approach to using such methods on DNA sequence identification problems forms models that depend on the {\em absolute locations} of nucleotides and assume {\em independence} of consecutive nucleotide locations. This paper describes a new class of learning methods, called {\em compression-based induction} (CBI), that is geared towards sequence learning problems such as those that arise when learning DNA sequences. The central idea is to use text compression techniques on DNA sequences as the means for generalizing <from sample sequences. The resulting methods form models that are based on the more important {\em relative locations} of nucleotides and on the {\em dependence} of consecutive locations. They also provide a suitable framework into which biological domain knowledge can be injected into the learning process. We present initial explorations of a range of CBI methods that demonstrate the potential of our methods for DNA sequence identification tasks.
Prosody in second language speech production: the role of the native language : Mündliche Produktion in der Fremdsprache

This paper is concerned with prosodic aspects of the speech production of second language learners. In particular, rhythmical properties of L2 speech will be investigated that include temporal and metrical aspects of utterances. In the study, the speech of 14 learners of German with prosodically typologically different native languages will be analysed and compared to that of native speakers of German. Phonetic differences in their temporal and metrical organization of speech can be traced back to native language influence. However, this effect is more pronounced in less advanced learners. Implications for a model of second language speech production are discussed.
The I-2 project

This paper describes the design of a humanoid robot built in Politecnico di Torino by a group of students. Mechanical architecture and control algorithms are based on a preliminary research on human biped locomotion, adapted and tested using computer simulation; the result is an unusual design that should maximize performances. We designed dedicated electronic components and the software runs under a real time operative system to use the 100% of the on-board computer. The motors and the power supply are chosen to give a torque larger than needed in common walking.
MODELING AND SEMANTIC CLASSIFICATION OF ARCHAEOLOGICAL FINDS FOR MANAGEMENT AND VISUALIZATION IN 3 D ARCHAEOLOGICAL DATABASES

The generation of digital 3D models of archaeological finds can be followed by further products, applications and studies such as a semantic classification in order to organize the digitally documented finds and provide connections between 3D models and databases. In this contribution we present a methodology developed to assist the superintendence of archaeological excavations or sites in the digital classification, management and visualization of finds inside advanced database/repository. Our approach, divided in three mutually connected steps (modeling, segmentation and visualization), has been realized as general as possible and tested on different types of archaeological objects. Firstly a reality-based 3D model of a find is produced, using photogrammetry or active sensors. Secondly the geometric model is semi-automatically segmented and classified according to archaeological and architectural rules. The semantic classification of the finds is afterwards linked to an archaeological database to e.g. decide whether the object is constituted by original pieces or some of them belong to other finds and should be re-located. Finally the modeled and classified find is visualized in 3D open-source systems linked to an archaeological database. The visualization of the achieved results (3D models and thematic layers) is thus very useful for monitoring and updating intervention policies within the archaeological area. * Corresponding author.
Color Correction Method Using Luminance and Chromaticity of Seven Colors in PDP-TV

The displayed colors on PDP-TV screen are not exactly the same as the colors of the transmitted signal from broadcast HDTV because of color reproduction characteristics in PDP-TV. An efficient color correction method is proposed for displaying the digital HDTV-based video signal in PDP-TV by minimizing color reproduction error. It is composed of three correction matrices calculated by using luminance and chromaticity of seven colors. Experimental results show that the average color difference is reduced from 0.0299 to 0.0042 by using the proposed method. The average difference of the proposed method is 0.0021 lower in (u′, v′) chromaticities than that of the conventional method.
Intelligent routing protocol for Multimedia Sensor networks

The increase in the usefulness of WSNs, have lead to the transmission of multimedia content over these networks. This has escorted to the concept of Wireless Multimedia Sensor networks (WMSNs). Due to resource constrained structure of WSNs, special attention is required to route data in these networks. In this paper, we propose a novel routing protocol for WMSNs which establishes paths on the basis of traffic load, hop count and node energy. The protocol aims to find completely or partially disjoint paths for routing multimedia traffic with relatively minimum distance. Simulation results have shown that the proposed protocol is capable of finding intelligent path such that it increases throughput and avoid creation of network holes near the sink.
Phosphoinositide 3-kinase γ required for lipopolysaccharide-induced transepithelial neutrophil trafficking in the lung

Phosphoinositide 3-kinase γ(PI3Kγ) is a critical mediator of directional cell movement. Here, we sought to characterise the role of PI3Kγ in mediating the different steps of polymorphonuclear leukocyte (PMN) trafficking in the lung. In a murine model of lipopolysaccharide (LPS)-induced lung injury, PMN migration into the different lung compartments was determined in PI3Kγ gene-deficient (PI3Kγ-/-) and wild-type mice. Bone marrow chimeras were created to characterise the role of PI3Kγ on haematopoietic versus nonhaematopoietic cells. A small-molecule PI3Kγ inhibitor was tested in vitro and in vivo. PMN adhesion to the pulmonary endothelium and transendothelial migration into the lung interstitium was enhanced in PI3Kγ-/- mice. However, transepithelial migration into the alveolar space was reduced in these mice. When irradiated PI3Kγ-/- mice were reconstituted with bone marrow from wild-type mice, migratory activity into the alveolar space was restored partially. A small-molecule PI3Kγ inhibitor reduced chemokine-induced PMN migration in vitro when PMNs or epithelial cells, but not when endothelial cells, were treated. The inhibitor also reduced LPS-induced PMN migration in vivo. We conclude that PI3Kγ is required for transepithelial but not for transendothelial migration in LPS-induced lung injury. Inhibition of PI3Kγ activity may be effective at curbing excessive PMN infiltration in lung injury.
Atmospheric illumination and shadows

The shadow volume algorithm of Frank Crow was reorganized to provide information on the regions of illuminated space in front of each visible surface. This information is used to calculate the extra intensity due to atmospheric scattering, so when the atmosphere is partly in shadow, columns of scattered light will be visible. For efficiency in sorting the shadow edges, the image is computed in polar coordinates.
Correct Bluetooth EDR FEC performance with SEC-DAEC decoding

By selecting from Bluetooth's enhanced data rate (EDR) packet types according to channel conditions, optimal data-rates are approached, especially if forward error control (FEC) is extended to EDR. Correct calculation of these packet types is presented, which also accounts for double adjacent error correction (DAEC) in addition to conventional single error correction (SEC).
An Examination of Specific Situation and Person Factors in Online Video Game Sexual Harassment

ii Acknowledgments. iii Vita . iv List of Tables . vi Chapter 1: Literature Review . 1 Chapter 2: Current Study . 22 Chapter 3: Method . 28 Chapter 4: Results . 37 Chapter 5: Discussion . 41 References . 51 Appendix A: Tables . 76 Appendix B: Survey Measurement Items . 86 Appendix C: Experiment material . 103
Semantic Instrumentation of Virtual Environments for Training

Interactive virtual environments are useful tools for hands-on learning or rehearsing of procedural tasks. However, task training applications typically provide a constrained course of action for the learner, forcing them down a single specific solution path. We discuss an approach in which the virtual environment is semantically instrumented in order to allow for the tracking of and reasoning about open-ended learner activity therein. Our approach leverages ontology-based knowledge representation which allows for a structured and meaningful description of virtual objects and of the learner actions that may be performed upon them. This is facilitated by the association of specific ontological classes with geometric components of the objects which populate a training exercise. These classes, together with their attributes, relationships and rules, characterize the environment and user actions in a readily understandable manner. As a result, a training system is able to observe the learner activity, render an assessment of that activity, and provide meaningful feedback to the learner. We also present an authoring tool which allows content developers to semantically annotate three-dimensional models for such an environment. ABOUT THE AUTHORS Christian Greuel is a Senior Research Artist in the Computer Science Laboratory at SRI International, with a focus on visual computing. His areas of applied research include design of tools, techniques, and processes for representation of and interaction with virtual environments; web-based training applications; geographic visualization; geometric modeling; multi-modal data representation; and immersive audio. He earned an MFA in Performing Arts Design and Technology from the California Institute of the Arts. Grit Denker is a Program Director in the Computer Science Laboratory at SRI International. Her expertise is in automated reasoning applications using semantic technologies, ontologies, and rules; cognitive and policy-based systems; specification and verification of security, network and privacy policies in distributed systems; and novel human-machine interface technology. She has a Ph.D. in Computer Science from the Technical University of Braunschweig, Germany. Karen Myers is a Principal Scientist in the Artificial Intelligence Center at SRI International, where she conducts basic and applied research in intelligent systems. Her specific areas of expertise include autonomy, intelligent assistants, mixed-initiative planning and control, and programming by demonstration. In addition to being widely published, she has overseen several successful transitions of her research into use both by the U.S. Government and within commercial settings. She has a Ph.D. in Computer Science from Stanford University.