Miracle-dz/UniFAR-FTUs huggingface dataset:
Application of point distribution models to the automated analysis of echocardiograms

We have recently described how a Point Distribution Model (PDM) can be used to automatically detect structures in medical images. The method has two stages. Initially a statistical model of the shape variability is generated from a set of training images. Structures are located in experimental data by placing an instance of the model in the image and iteratively refining its shape and location to better fit the data. Whilst fitting to the image the model can only adopt shapes which are consistent with the training data. We call the combination of a PDM and the iterative refinement procedure an Active Shape Model (ASM). We have 'trained' models of the left ventricle and associated structures as seen in both long axis and short axis echocardiograms. We show that ASM search using these models is able to detect the structures of interest rapidly accurately and reliably. <<ETX>>
A programmable medical data acquisition system chip

A medical data acquisition system chip has been integrated using a BiMOS (bipolar metal-oxide semiconductor) process. This chip integrates a low-noise bipolar instrumentation amplifier, a programmable switched-capacitor notch filter, an 11-bit ADC (analog-to-digital converter), a 7-bit DAC, and an asynchronous serial interface. Biomedical signals such as ECG (electrocardiogram), EEG (electroencephalogram), invasive blood pressure, temperature, respiration, and cardiac output are picked up by transducers, probes, and electrodes. Typical signal levels are 50 mu Vp-p for the EEG and 1 mV p-p for the ECG. These low level biological signals are converted into voltages or currents. <<ETX>>
Interpretive analysis of team use of group technologies

Studies of the impacts of new computing technologies on organizations often lead to contradictory or equivocal findings. Studies showing negative or null effects of computing are as commonplace as those showing benefits. Moreover, outcomes are nonuniform across individuals, groups, or organizational units and sometimes vary within the same study. To explain the commonality as well as the variance in the results of new technology introduction, we propose adaptive structuration theory. The theory focuses on how technology structures are applied in interpersonal interaction and the specific nature of appropriation patterns. We illustrate the power of the theory through interpretative analysis of three teams as they adapt to use of a group decision support system over a period of eight months. The analyses highlight differences in technology impacts across the three teams and also explain some common outcomes. Our analytic approach appears to be useful in the study of organizational computing impacts in gener.
REDUCTION OF FALSE ALARMS IN FAULT DETECTION PROBLEMS

In this paper, we propose a new technique for enhancing the residual signal in a way that results in a reduced rate of false alarms. This is achieved by eliminating most of the noise from the residual signal through an autoregressive (AR) modeling. The AR model parameters are estimated in real time. Computer experiments using experimen- tal data from NASA Langley Research Center are used to demonstrate an implementation of the proposed technique.
Improvements in Transition Based Systems for Dependency Parsing

This thesis investigates transition based systems for parsing of natural language using dependency grammars. Dependency parsing provides a good and simple syntactic representation of the grammatical relations in a sentence. In the last years, this basic task has become a fundamental step in many applications that deal with natural language processing. Specifically, transition based systems have strong practical and psycholinguistic motivations. From a practical point of view, these systems are the only parsing systems that are fast enough to be used in web-scale applications. From a psycholinguistic point of view, they very closely resemble how humans incrementally process the language. However, these systems fall back in accuracy when compared with graph-based parsing, a family of parsing techniques that are based on a more traditional graph theoretic / dynamic programming approach, and that are more demanding on a computational perspective. Recently, some techniques have been developed in order to improve the accuracy of transition based systems. Most successful techniques are based on beam search or on the combination of the output of different parsing algorithms. However, all these techniques have a negative impact on parsing time. In this thesis, I will explore an alternative approach for transition based parsing, one that improves the accuracy without sacrificing computational efficiency. I will focus on greedy transition based systems and I will show how it is possible to improve the accuracy by using a dynamic oracle and a flexible parsing strategy. Dynamic oracles allow to reduce the error propagation at parsing time. Dynamic oracles may have some impact on training time, but there is no efficiency loss at parsing time. A flexible parsing strategy allows to reduce constraints over the parsing process and the time impact in both training and parsing time is almost negligible. Finally, these two techniques work really well when combined together, and they are orthogonal to previously explored proposals such as beam search or system combinations. As far as I know, the obtained experimental results are still state-of-the-art for greedy transition based parsing based on dependency grammars.
Dealing with the Safety-Performance Tradeoff in Robot Arms Design and Control

robot arm that is to interact with humans has a single design consideration at a premium—safety. Under no circumstances should the robot arm cause harm to people in its surroundings, directly or indirectly, in regular operation or in failures. Having stated this, the second most crucial requirement for robot manipulators is their accuracy and rapidity in performing tasks when required. This article reports on different possible approaches for dealing with the problem of achieving the best performance, under the condition that safety is guaranteed throughout task execution. Robot safety involves several different considerations and depends on many factors, ranging from software dependability, to possible mechanical failures, to human errors in interfacing with the machine, etc. A thorough hazard analysis and risk evaluation should be performed according to methodical procedures specifically for different domains of application: these methods are receiving growing attention from both the scientific community (e.g., [1]–[3]) and international standardization bodies (see, for instance, [4]). General hazard management considerations are very broad, of course, and fall beyond the scope of this article. Here, we will only consider a specific, if very important, type of risk: the situation in which, in an unspecified instant during execution of a preplanned robot arm movement, a collision between a link of the arm and a human occurs. The quantitative analysis of the trade-off between such risk and the performance obtainable is one of the objectives of our work. Such analysis has a strong impact on how robot mechanisms and controllers should be designed for humaninteractive applications, giving rise to a paradigm shift in robot design, which we will examine in detail.
An Architecture for Securing Heterogeneous Web Services

I. Introduction Web Services represents a new architectural paradigm for web application. Web services implement capabilities that are available to other applications via industry standard network and application interface and protocols. Access control policy is used to protecting resource not to be accessed by the illegal user, so as to specify the legal user operating resource, the access control policy determine which certificates are announced, and by which order are announced. An application can use the capabilities of Web Services by simply invoking it across a network with having to integrate it. Serviceoriented architecture (SOA) is a component model. The different functional units of applications (called services) were linked through well-defined interfaces and contracts. It is an independent of the implementation services, hardware platforms, operating systems and programming languages. Web services essentially involve the three roles of Service Oriented Architecture (SOA), are service broker, service requestor and service provider.
Designs & tools to augment collaborative learning in computerized conferencing systems

Consideration is given to the use of computer conferencing for knowledge building and networking, with specific attention to designs and tools to enhance group learning processes and tasks. Field trials of educational computer conferencing demonstrate that with careful attention to design, computer conferencing can support and augment important aspects of active and purposeful collaborative learning. Work to date indicates that the intentional structuring of computer conferences-such as in the definition of individual, paired and small group tasks, and in the definition of sub-group and whole-group discussion-facilitates and increases active student input and peer interaction. At the same time, experience and research suggest that the medium is incomplete: organization of the collaborative work is not contextualized within the operating system and teachers and learners find it necessary to provide information management outside the operating environment. Tools are needed to support specific teacher and learner activities, such as active reading and idea linking and organizing. The author reports on the use of intentional design and hypertextual tools to support and augment collaborative learning within current computer conferencing systems. <<ETX>>
An efficient digital architecture for character recognition

We introduce a new digital neural architecture designed for automatic hand-written characters recognition. The architecture implements a two-layer perceptron off-line trained by conjugate gradient descent algorithm and the final weights are quantized and stored in a RAM. The architecture was developed and tested using the VHDL Alliance 2.0 CAD System simulator: it is easy to implement using standard VLSI technologies and may be used to deal with multi-level inputs.
Development of L2 interactional resources for online collaborative task accomplishment

ABSTRACT Technology-mediated task environments have long been considered integral parts of L2 learning and teaching processes. However, the interactional resources that the learners deploy to complete tasks in these environments have remained largely unexplored due to an overall focus on task design and outcomes rather than task engagement processes. With this gap in mind, we set out to describe the emergence, development, and diversification of L2 (English) interactional resources oriented to task completion using conversation analysis for the examination of 13 hours of screen-recorded online task-oriented interactions collected over 18 weeks. The focal tasks in the study have been designed as emergent information-gap tasks that require the participants to maintain progressivity by both displaying their own and converging with their co-participants’ dynamic knowledgeability for task completion purposes. A longitudinal investigation into task engagement processes has demonstrated that the participants fail to display their knowledge congruently and they repeatedly disrupt the progressivity of task-oriented interaction in earlier weeks. However, an observable diversification of interactional resources for collaborative task accomplishment has been recorded in later weeks, which demonstrates the development of interactional competence over time. These findings bring insights into interactional competence, epistemics, and CALL with special reference to technology-mediated TBLT.
Conceptual design and comparative stiffness analysis of an Exechon-like parallel kinematic machine with lockable spherical joints

This article proposes two types of lockable spherical joints which can perform three different motion patters by locking or unlocking corresponding rotational axes. Based on the proposed lockable spherical joints, a general reconfigurable limb structure with two passive joints is designed with which the conceptual designs of two types of Exechon-like parallel kinematic machines are completed. To evaluate the stiffness of the proposed Exechon-like parallel kinematic machines, an expanded kinetostatic model is established by including the compliances of all joints and limb structures. The prediction accuracy of the expanded stiffness model is validated by numerical simulations. The comparative stiffness analyses prove that the Exe-Variant parallel kinematic machine claims competitive rigidity performance to the Exechon parallel kinematic machine. The present work can provide useful information for further investigations on structural enhancement, rigidity improvement, and dynamic analyses of other Exechon-like parallel kinematic machines.
Integrated Wireless Propagation Models

McGraw-Hill Education books are available at special quantity discounts to use as premiums and sales promotions or for use in corporate training programs. To contact a representative, please visit the Contact Us page at www.mhprofessional. com. Information contained in this work has been obtained by McGraw-Hill Education from sources believed to be reliable. However, neither McGraw-Hill Education nor its authors guarantee the accuracy or completeness of any information published herein, and neither McGraw-Hill Education nor its authors shall be responsible for any errors, omissions, or damages arising out of use of this information. This work is published with the understanding that McGraw-Hill Education and its authors are supplying information but are not attempting to render engineering or other professional services. If such services are required, the assistance of an appropriate professional should be sought. formerly chief scientist of Vodafone Plc, is one of the original pioneers who developed wireless technology, and the Lee propagation point-to-point model in 1978, at Bell Labs. World-renowned for his development of commercial CDMA technology, Dr. Lee is a technologist, innovator, teacher, and writer. He is an honorable written four prominent books and been granted more than 40 patents in the area of mobile communications. In 2014, he received the IEEE Vehicular Technology Society's Hall of Fame Award, the society's most prestigious award. is a senior software development manager at Cisco Systems. Before that, he was a mobile solutions manager at Cisco. Dr. Lee was previously the vice president of product marketing and operations at Exio Communications and the director of strategic technology at Vodafone. He was also the RF director for Vodafone Romania, responsible for the nationwide planning, deployment, and optimization of the GSM network. Dr. Lee participated in many network optimization and merger and acquisition activities while with Vodafone in the United States, Europe, and Asia. He has had 10+ patents granted and 50+ papers published. Dr. Lee also worked at Motorola and Bell Labs.
Navigation Dynamics in Recommendation Networks

[1] M. J. Bates. The design of browsing and berrypicking techniques for the online search interface. Online Information Review, 13(5):407–424, 1989. [2] J. Kleinberg. Complex networks and decentralized search algorithms. In Proceedings of the International Congress of Mathematicians (ICM), volume 3, pages 1019–1044, 2006. [3] P. Pirolli. Information Foraging Theory: Adaptive Interaction with Information. Oxford University Press, 2007.
Appears in the International Workshop on Assurance in Distributed Systems and Networks (ADSN) 2004, ICDCS'04 Workshop TDMA Service for Sensor Networks

Sensors networks are often constrained by limited power and limited communication range. If a sensor receives two messages simultaneously then they collide and both messages become incomprehensible. In this paper, we present a simple time division multiple access (TDMA) algorithm for assigning time slots to sensors and show that it provides a significant reduction in the number of collisions incurred during communication. We present TDMA algorithms customized for different communication patterns, namely, broadcast, convergecast and local gossip, that occur commonly in sensor networks. Our algorithms are self-stabilizing, i.e., TDMA is restored even if the system reaches an arbitrary state where the sensors are corrupted or improperly initialized.
INTRODUCTION TO FULLY HOMOMORPHIC ENCRYPTION

Fully homomorphic encryption schemes allow encrypted computations and have many applications including the cloud computing and multi-party computation. In 2009, Gentry constructed the first plausible fully homomorphic encryption scheme based on ideal lattices [1]. He first constructed a somewhat homomorphic encryption scheme which can evaluate some circuits of low degree homomorphically, and squashed it using the sparse subset sum assumption to make lower degree decryption circuit. Then, showed that it is bootstrappable, which means that it is possible to evaluate its own decryption circuit homomorphically. Assuming the circular security, a somewhat homomorphic encryption scheme is transformed into a fully homomorphic encryption which can evaluate arbitrary circuits. This blueprint is used in the follow-up works with many improvements. Mainly, efficiency is improved and new variants are introduced [2–8]. In this talk, I will explain Gentry’s blueprint with a simpler integer variant of van Dijk et al., so called the DGHV scheme [2] which is based on the approximate greatest common divisor problem.
An Improved Cosine Text Similarity Computing Method Based on Semantic Chunk Feature

: [ Objective ] This paper aims to improve the performance of Cosine text similarity computing method with the help of text semantic chunk feature. [ Methods ] First, we retrieved the project data of carbon nanotubes studies, which were pre-processed with stemming and POS techniques. Then, we identified the semantic chunk of text contents with the conditional random field model. Third, we calculated the similarity of texts based on semantic chunk feature. Finally, we compared our results with those generated by the unlabeled data. [ Results ] The proposed method improved the performance of Cosine similarity calculation by up to 26%. [ Limitations ] Our study relies on semantic chunks to annotate the computing performance. [ Conclusions ] The proposed method could effectively identify similar texts, and reduce the dimensions of vector space model, which improves the computing efficiency. The new method is robust and could be transferred to other fields.
Design and Implementation of ANFIS Model for Software Development Time Estimation Using Ensemble Learning

To develop a project successfully, it is important for any organization that the project should be completed within budget, on time and the project should have requisite quality. This paper presents an Adaptive Neuro-Fuzzy Approach for Software Development Time Estimation using Ensemble Learning. The main idea behind ensemble learning is to combine multiple models into one. At every step, the ensemble fits a new learner to the difference between the observed response and the aggregated prediction of all learners grown previously. The ensemble fits to minimize mean-squared error . As in ANFIS; we are providing only one model, it was not possible to combine an arbitrary number of models into one.
VHDL Implementation of nor Flash Controller

Flash memory is an electronic non-volatile storage medium that is developed from EEPROM, which is electrically erased and reprogrammed. NOR flash memories are mainly used in code storage, booting and executable in place codes. Flash memory controller is bridge between user and flash memory as it converts commands by user to required timing specification of flash memory. Operations such as program and erase are controlled by flash memory. Flash memory controller is developed in reconfigured FPGA environment. This paper focuses mainly on design and timing response of flash memory controller inVHDL.
Finite-difierence Time-domain Grid Truncation with Squeeze-transform Layers

We devise squeeze-transform layers (STLs) proposed recently to emulate endless space surrounding computation domain, and test them in 1D, 2D and 3D flnite-difierence time- domain (FDTD) simulations on staggered grid. With unprecedented ease of their time-domain implementation, STLs yield comparable accuracy or even outperform standard PMLs of the same width in short-time broadband simulations. Emerging applications for pure STLs as well as strategies to improve their late-time performance are discussed. The perfectly matched layer (PML) concept (1,2) underpins much of recent progress in applied computational electrodynamics, standing as \one of the most signiflcant advances in the historical development of the FDTD method. " (2) The PMLs are normally so e-cient that undesired re- ∞ections from computational domain boundaries are not considered as an accuracy limiting factor anymore, at least for linear Maxwell simulations. This e-ciency comes at a price, however. First, the PMLs are lossy which means increased memory consumption, whether one introduces the loss through electric and magnetic conductivity terms | an approach customary for the time domain simulations; or through complexity of † and " tensors as is commonly done in the frequency domain modeling. Second, PMLs are dispersive and hence are not so readily implementable in FDTD codes but require, as any real-world dispersive media does, additional fleld or auxiliary variables stored in computer memory, and more computations per circle performed.
Aircraft image recognition using back-propagation

The back-propagation neural network (BNN) is presented to recognize the aircraft images. Different training algorithms were used with different number of hidden neurons. The presented training algorithms satisfied the high recognition performance when the number of hidden neurons was less than or equal to ten times the number of classes. The effect of the activation function on the recognition performance and error convergence were studied and it was concluded that the log sigmoid function is better than the tanch sigmoid function. It was found that the network recognizes the test images correctly even the noisy and the incomplete images.
The Tracking Machine Learning Challenge

The HL-LHC will see ATLAS and CMS see proton bunch collisions reaching track multiplicity up to 10.000 charged tracks per event. Algorithms need to be developed to harness the increased combinatorial complexity. To engage the Computer Science community to contribute new ideas, we have organized a Tracking Machine Learning challenge (TrackML). Participants were provided events with 100k 3D points, and are asked to group the points into tracks; they are also given a 100GB training dataset including the ground truth. The challenge is run in two phases. The first “Accuracy” phase has run on Kaggle platform from May to August 2018; algorithms were judged judged only on a score related to the fraction of correctly assigned hits. The second “Throughput” phase ran Sep 2018 to March 2019 on Codalab, required code submission; algorithms were then ranked by combining accuracy and speed. The first phase has seen 653 participants, with top performers with innovative approaches. The second phase has just finished and featured some astonishingly fast solution. The talk will report on the first lessons from the challenge.