Miracle-dz/UniFAR-FTUs huggingface dataset:
Data and Knowledge for Medical Decision Support

The EFMI Special Topic Conference Data and Knowledge for Medical Decision Support held in Prague, The Czech Republic, April 17-19, 2013 (www.stc2013.org) reflected opportunities, challenges and priorities of data and knowledge for medical decision support. The conference was organized by the European Federation for Medical Informatics (EFMI) in cooperation with the Society of Biomedical Engineering and Medical Informatics of the Czech Medical Society J. E. Purkyne. Nearly thirty years after the conference Computer-aided medical decision making held in Prague 1985 [1] this conference showed many new developments of methods and systems focused on medical decision support. Medical decision support is increasingly important. It has spawned research in the areas of standardization, semantic interoperability, formalization of knowledge, knowledge discovery and guidelines. It also led to the development of decision support systems that can be interfaced with clinical information systems. It is very important that the quality of these systems is carefully evaluated. Apart from being used by decision support systems the current medical knowledge also has to be managed so that it is easily accessible by physicians and nurses. Medical decision support is an important constituent in different eHealth applications. Most of the developed decision support systems can be more or less easily integrated into clinical information systems both as part of those systems connected through standardized interfaces or as services to be remotely accessed. As an outcome of the conference selected full papers in limited number of pages were published by IOS Press [2] and short abstracts of all submissions were published in the International Journal for Biomedicine and Healthcare (www.ijbh.org). In the year 2013 (Volume 9) European Journal for Biomedical Informatics is publishing selected reviewed papers of the conference without restriction on the number of pages. Authors are not paying an article processing fee for the immediate release of peer-reviewed articles, but a small financial support is required in case that the support of projects or sponsors is acknowledged (see Instruction to authors). Beginning in 2013 (Volume 9) European Journal for Biomedical Informatics will ask authors for translation of structured abstract of the paper to at least one European language. EJBI provides immediate open access to peerreviewed papers, which will be published in the running first issue of EJBI during each calendar year. The other issues of EJBI are special issues related to different biomedical informatics topics. Topics for special issues can be proposed to editor-inchief of EJBI using the form Proposal of EJBI special issue for further processing. Topic for special issue is specified by an open call or by a special event. We invite you to propose special topics that would help to accelerate needed changes in health care by easy transfer of a new information and knowledge for health care delivery.
Analytic Threshold Voltage Model of Recessed Channel MOSFETs

Threshold voltage is one of the most important factors in a device modeling. In this paper, analytical method to calculate threshold voltage for recessed channel (RC) MOSFETs is studied. If we know the fundamental parameter of device, such as radius, oxide thickness and doping concentration, threshold voltage can be obtained easily by using this model. The model predicts the threshold voltage which is the result of 2D numerical device simulation.
Graph Theory with Applications

When I first entered the world of Mathematics, I became aware of a strange and little-regarded sect of "Graph Theorists", inhabiting a shadowy borderland known to the rest of the community as the "slums of Topology". What changes there have been in a few short years! That shadowy borderland has become a thriving metropolis. International conferences on Graph Theory occur with almost embarrassing frequency. Journals on Graph Theory abound: I once counted the Editorial Offices of three of them in one of the mathematical departments of one of the Universities of one of the smaller cities of Canada. Any connection with Topology is likely to be firmly repudiated as soon as noted. I became aware of the burgeoning of Graph Theory when I studied the 1940 paper of Brooks, Smith, Stone and Tutte in the Duke Mathematical Journal, ostensibly on squared rectangles. They wrote of trees and Kirchhoffs Laws, of 3-connection and planarity, of duality and symmetry, of determinantal identities and coprime integers, ~ all in the Quest of the Perfect Square. I invariably recommend that paper to my students. "Go to it", I say, "you will
Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction

This paper introduces a line of research on capacity-constrained multi-stage production scheduling problems. The first section introduces the problem area as it arises from a failure of MRP systems. Then a review of the literature and an analysis of the type of problems that exist are presented in §2. Section 3 outlines linear and mixed integer-linear programming formulations. These formulations compute the required production lead times according to the demands on available capacity, thereby reducing in-process inventory compared to the usual practice in MRP. A discussion of how to use the LP version is included. However, the size of the problems in practice implies that more efficient solution techniques must be found. The final topic of this paper, Product Structure Compression, is introduced as a method to reduce the size of the problem without losing optimality.
Comparing and Measuring Network Event Dispatch Mechanisms in Virtual Hosts

Tampere University of Technology Degree Program in Information Technology, Department of Communication Engineering Pasa Maharjan: Comparing and Measuring Network Event Dispatch Mechanisms in Virtual Hosts Master of Science Thesis, 50 pages. Examiners: Prof. Jarmo Harju, MSc Bilhanan Silverajan
A Scalable benchmark for motion control of mobile robots

Motion control is a key aspect for the performance of wheeled mobile robots (WMR). There are several well known motion control methods for WMR, but usually those methods are very dependent from the robot physical constraints. One of the most commonly employed platforms to propose and demonstrate motion control algorithms is the differential drive platform and its variants. Every time a new motion control algorithm is proposed, some comparisons with traditional algorithms are usually made, but there are no set of benchmarks globally accepted to assess the performance of motion control algorithms. This work tries to make some contributions in this area, analyzing the problem and proposing a set of benchmarks to be used in the evaluation of mobile robots' motion control algorithms.
Focus on your players : Psychophysiological player experience logging as a powerful tool for gameplay analysis

With a recently gained emphasis on new input devices and interaction techniques, like gestural movement, eye tracking and biofeedback, designers of tomorrow will have to think far beyond what we call games in a classical sense today. Gameplay becomes a more immersive experience, a space of fun decoupled from the experience of using a computer. The benefit of using these new devices is that they also enable a more precise and empirical measurement of gameplay. Thus, from an academic side it becomes more interesting to research the effect a game has on players than to focus on the game as an entity itself. By empirically understanding how players experience games, we can then reflect and use this gained knowledge to enhance specific design aspects of games.
Notice of Retraction Conceptual Framework and Key Issues of Project Management Based on Knowledge Management

The whole world has already embraced the age of knowledge economy, and knowledge management is naturally gradually playing a significant role in enterprise management. This paper proposes a framework of knowledge management in project management for those project-based companies. The framework consists of four essential parts, including project planning, organizational management, tools and techniques and operational management. It highlights the importance of organizational learning and human capital, and considers organizational culture and information system as two indispensable bases for knowledge sharing and innovation. Several key points which are quite essential for knowledge management are also listed: time pressure, impacts of organizational culture, differences between information management and knowledge management, and performance evaluation on knowledge management. Besides that, Specific analysis followed in order to clarify them distinctly.
Comparative study of statistical word sense discrimination

Word sense discrimination aims at automatically determining which instances of a n ambiguous word share the same sense. A fully unsupervised technique based on a vector representation of word senses w as proposed by Schutze [Schutze98]. While the original model was assumed to be Gaussian, practical results were only reported for an approximated model mak ing hard decisions between sense clusters. We show in the present study that a r eal Gaussian model provides a significant accuracy improvement while remaining f ully tractable. An alternative discrete naive Bayes model was presented in [Manning99]. We propose here a description of both models in a unified statistical formalism in order to stress the similarities and diffe rences between both approaches. Several practical experiments are conducted on t he New York Times News 1997 corpus. They illustrate the respective advantages of various approaches trading off discrimination accuracy and computation time. We also show the interest of a global selection of content words to characterize the context of an ambiguous instance in the nai ve Bayes model.
Corpus-based Parsing and Sublanguage Studies

There are two main topics in this thesis, a corpus-based parser and a study of sublanguage. A novel approach to corpus-based parsing is proposed. In this framework, a probabilistic grammar is constructed whose rules are partial trees from a syntactically-bracketed corpus. The distinctive feature is that the partial trees are multi-layered. In other words, only a small number of non-terminals are used to cut the initial trees; other grammatical nodes are embedded into the partial trees, and hence into the grammar rules. Good parsing performance was obtained, even with small training corpora. Several techniques were developed to improve the parser's accuracy, including in particular two methods for incorporating lexical information. One method uses probabilities of binary lexical dependencies; the other directly lexicalizes the grammar rules. Because the grammar rules are long, the number of rules is huge--more than thirty thousand from a corpus of one million words. A parsing algorithm which can efficiently handle such a large grammar is described. A Japanese parser based on the same idea was also developed. Corpus-based sublanguage studies were conducted to relate the notion of sublanguage to lexical and syntactic properties of a text. A statistical method based on word frequencies was developed to define sublanguages within a collection of documents; this method was evaluated by identifying the sublanguage of new documents. Relative frequencies of different syntactic structures were used to assess the domain dependency of syntactic structure in a multi-domain corpus. Cross-entropy measurements showed a clear distinction between fiction and non-fiction domains. Experiments were then performed in which grammars trained on individual domains, or sets of domains, were used to parse texts in the same or other domains. The results correlate with the measurements of syntactic variation across domains; in particular, the best performance is achieved using grammars trained on the same or similar domains. The parsing and sublanguage techniques were applied to speech recognition. Sublanguage techniques were able to increase recognition accuracy, and some promising cases were found where the parser was able to correct recognition errors.
Template Protection For 3D Face Recognition

The human face is one of the most important biometric modalities for automatic authentication. Three-dimensional face recognition exploits facial surface information. In comparison to illumination based 2D face recognition, it has good robustness and high fake resistance, so that it can be used in high security areas. Nevertheless, as in other common biometric systems, potential risks of identity theft, cross matching and exposure of privacy information threaten the security of the authentication system as well as the user’s privacy. As a crucial supplementary of biometrics, the template protection technique can prevent security leakages and protect privacy. In this chapter, we show security leakages in common biometric systems and give a detailed introduction on template protection techniques. Then the latest results of template protection techniques in 3D face recognition systems are presented. The recognition performances as well as the security gains are analyzed.
Clustering websites using a MapReduce programming model

In this paper, we describe an effective method of using Self-Organizing Map (SOM) to group websites so as to eliminate or at least ease up slow speed, one of the fundamental problems, by using a MapReduce programming model. The proposed MapReduce SOM algorithm has been successfully applied to cluB, which is a typical SOM tool. Performance evaluation shows the proposed SOM algorithm took less time to complete computational processing (i.e. distributed computing) on large data sets in comparison with conventional algorithms, and performance improved by up to 20 percent with increasing nodes (computers).
Microelectrofluidic Systems: Modeling and Simulation

INTRODUCTION Modeling and Simulation Issues Modeling and Simulation Needs Overview HIERARCHICAL MODELING MEFS Dynamic Modeling and Simulation at Circuit Level MEFS System-Level Modeling and Simulation Conclusion SYSTEMC-BASED HIERARCHICAL DESIGN ENVIRONMENT Suitability of Modeling Languages for Hierarchical Design Building Design Environment with SystemC Conclusion SYSTEM-LEVEL SIMULATION AND PERFORMANCE EVALUATION MEFS Computing and Architecture Hierarchical Modeling and Simulation Methodology Micro-Chemical Handling System System Performance Analysis and Design Optimization Conclusion CIRCUIT-LEVEL OPTIMIZATION Simulation Design Methodology Optimization Verification On-Target Design Optimization Robust Design Optimization Application Flexibility Optimization Conclusion PERFORMANCE EVALUATION Introduction Continuous-Flow PCR System Droplet-Based PCR System Comparison Between Continuous-Flow PCR and Droplet PCR Scheduling of Microfluidic Operations for Reconfigurable Two-Dimensional Electrowetting Arrays CONCLUSION APPENDICES VHDL Queuing Model Hierarchical Environment with SystemC Keywords: Nanoscience, Nanotechnology
How to Design Programs: An Introduction to Computing and Programming

This introduction to programming places computer science in the core of a liberal arts education. Unlike other introductory books, it focuses on the program design process. This approach fosters a variety of skills -- critical reading, analytical thinking, creative synthesis, and attention to detail -- that are important for everyone, not just future computer programmers.The book exposes readers to two fundamentally new ideas. First, it presents program design guidelines that show the reader how to analyze a problem statement; how to formulate concise goals; how to make up examples; how to develop an outline of the solution, based on the analysis; how to finish the program; and how to test. Each step produces a well-defined intermediate product. Second, the book comes with a novel programming environment, the first one explicitly designed for beginners. The environment grows with the readers as they master the material in the book until it supports a full-fledged language for the whole spectrum of programming tasks.All the book's support materials are available for free on the Web. The Web site includes the environment, teacher guides, exercises for all levels, solutions, and additional projects.
Wideband Multi-User Cooperative Networks: Theory and Measurements

In this thesis we study communication schemes and channel mo deling for a pervasive wireless access network (PWAN). Such a network is formed by n odes equipped with heterogeneous antenna arrangements and placed up to 10 m apart from each other. Nodes can be static when they belong to the infrastructure or have limi ted mobility when they are carried by a person. This scenario is extremely promising for re lay-based applications and fills the gap between the body area network (BAN) that has a coverag e up to 1m and the wireless local area network (WLAN) that has a coverage up to 100 m. When a PWAN is jointly considered with high node density, it allows for node cooper ations, and idle or infrastructure nodes can support the communication of source-destination pairs. With an adequate signaling scheme, the PWAN can operate as a virtual antenna array ( VAA) and ultimately achieve multiple-input multiple-output (MIMO) gains in a distribu ted way. Until now these networks have been studied using oversimplified channel models that w ere frequency flat and designed for cellular low node density networks. The novelty of this t hesis and its main contribution is the study of a PWAN under realistic channel conditions and har ware constraints. First we consider a PWAN in a multi-path propagation environ me t. Multiple user pairs communicate, supported by coherent relay nodes that have th e capability of filtering with a finite impulse response (FIR) filter the incoming signal from the sources before forwarding it (filter-and-forward (FF) relays) to the destinations. The m ain result of this part is a multi-user zero-forcing (MUZF) relay filter gain allocation that perfo rms a distributed MIMO channel orthogonalization independently of the sources modulatio n alphabet and ideally suppresses multi-user interferences (MUI). This scheme has a lower com plexity than the existing orthogonal frequency-division multiplexing (OFDM) -based appr oach where the MUI are treated on a sub-carrier basis. Afterwards we set our focus to a real-world implementation o f a PWAN available at the Wireless Communication Group (WCG) at ETH Zurich and provide a s a main result a novel non-collocated MIMO baseband channel model that takes the s patial-temporal correlations between the channels, and the nodes nomadic and behavioral m bility into account. The proposed baseband channel encloses the propagation channe l, the receiver and transmitter
A New Morphology Algorithm for Microcalcifications Detection in Fuzzy Mammograms Images

The main concerns of this paper is to illustrate how morphology Mathematics operations are applied in the domain of digital image processing. In the sequel we present and discuss how a new algorithm based on mathematical morphology operators is able to detect well the microcalcifications in mammograms images. We apply some of these operators to build an algorithm applied on digital images. We use the erosion operator by reconstruction with isotropic structuring element, flowed by the Segmentation based by contrast enhancement to find our new powerful algorithm. This algorithm is very efficient to detect well the microcalcifications malignant or benign in mammography images. We use also another algorithm to extract the minima regions from original image. We focus our zoom in this region that we have the more probability to find the microcalcifications. The application of our algorithm on a very fuzzy image leads us to deduce that our method is very powerful to detect well the microcalcification. Keyword: Mammogram image, Morphology Matimatics Operator, Fuzzy image, Microcalcifications.
Harris Corner Detection Algorithm at Sub-pixel Level and Its Application

The corner is one of the most important features of image and the corner detection plays an important role in digital image processing technology. The performance of Harris corner detection algorithm is stable and it is widely applied, but the corner location is pixel level which affects the subsequent image processing. In order to improve the performance of corner detection, the harris algorithm is improved. On the basis of analyzing the principle of Harris corner detection algorithm, the sub-pixel level corner position based on the Gauss surface method is extracted. The extracted corners is applied in images matching. The experimental results show that the Harris corner detection algorithm can extract high accurate corners. At the same time, the image matching based on this algorithm has higher precision.
Adaptive time-delay neural control in space structural platforms

The design of control algorithms for large space structures, possessing nonlinear dynamics which are often time-varying and likely ill-modeled, presents great challenges for all current methodologies. These limitations have led to the pursuit of a robust and fault tolerant structural controller. In the present paper, we propose the use of adaptive time-delay radial basis function (ATDRBF) networks as a learning controller in system identification and dynamic control of flexible structures. The ATDRBF network, which incorporates adaptive time-delays and interconnection weights, provides a feasible and flexible modeling technique to effectively capture all of the spatiotemporal interactions among the structure members. In the spirit of model reference adaptive control, we utilize the ATDRBF network as a building block to allow the neural network to function as an indirect closed-loop controller. The horizon-of-one controller regulates the dynamics of the nonlinear plant to follow a prespecified reference model asymptotically. This paper addresses the theoretical foundation of the architecture and demonstrates its applicability via specific examples. <<ETX>>
Carrier recovery for 16 level QAM in mobile radio

Carrier recovery for quadrature amplitude modulation (QAM) has proved to be considerably more difficult than for binary modulation. One of the simplest effective solutions is the use of phase locked loops (PLLs) but with the phase detector replaced by a circuit capable of producing phase error signals from a received QAM phasor with varying phase and amplitude. Circuits to do this have been suggested but do not operate on all received signals. A circuit which can operate on all incoming signals thus increasing the stability of clock recovery is presented. >
Computing efficiently floats of all activities in a series-parallel network with duration intervals

The paper deals with the problem of computing intervals of possible values of floats for all activities in a series-parallel network with duration intervals. We present an O(n) time algorithm, using graph reductions, for computing the interval of possible values of floats for a single activity and an algorithm for computing the intervals for all activities in the network that runsO(n log n) time and requires a linear space for a data structure.