Miracle-dz/UniFAR-FTUs huggingface dataset:
Artificial Neural Networks: Applications in Nanotechnology

Artificial neural networks (ANNs), as techniques that mimic the processing way of information in human brain have emerged as promising methods in dealing with non-linear and complex relations. The ability to learn, tolerance to data noises and capability to model incomplete data have made them unique analyzing approaches in many scientific procedures. When employing neural nets, once the network has been trained, new data in similar domain may be analyzed and predicted avoiding the timeand moneyconsuming experiments. Taking into account that to solve problems, ANNs may combine the data from literature and experiments, the potential of this approach can be easily estimated in nanoscience and nanotechnology. Two types of training are commonly employed when using ANNs. While in unsupervised networks, the training procedure is not affected by the output(s) of the network; supervised networks attempt to modify the neurons weights so that the network output(s) becomes as close as possible to the desired output. As application in nanotechnology, supervised associating networks may be considered as alternatives to conventional response surface methodology (RSM). The unsupervised feature-extracting networks are alternatives to principal component analysis (PCA) and are able to map multidimensional data sets onto two-dimensional spaces. Therefore, ANNs not only have attracted the attention of many computer scientists, but also a huge number of successful applications of them is found in the literature, reporting problems solving in various areas of sciences, engineering and business. Although increasing number of ANNs applications are now observed in diverse scientific fields, nanotechnologists do not generally appear to be interested or fully aware of the potentials of such approaches. Here we have described principles of the ANNs in dealing with certain properties of nano-materials. To present the ‘state of the art’, available publications on nanotechnology and nanoscience which have used the advantages of ANNs have been evaluated. In this chapter, a brief description about importance of nanotechnology has been given. We then have summarized common applications of ANNs and tried to identify various areas in nanoscience and nanotechnology where the successful application of ANNs can be envisaged, followed by the areas of future developments.
Sample Size Tables for Clinical Studies

Preface to the Second Edition Preface to the First Edition 1. Basic Design Considerations 2. The Normal Distribution 3. Comparing Independent Groups for Binary, Ordered Categorical and Continuous Data 4. Comparing Paired Groups for Binary, Ordered Categorical and Continuous Outcomes 5. Demonstrating Equivalence 6. Confidence Intervals 7. Post-Marketing Surveillance 8. The Correlation Coefficient 9. Comparing Two Survival Curves 10. Phase II Trials 11. Observer Agreement Studies 12. Randomization Cumalative References Author Index Subject Index
Fine-grained analysis of array computations

As performance of memory systems becomes a greater bottleneck, compilers rely increasingly on memory hierarchy optimizations to achieve good performance. These optimizations are particularly helpful in codes that primarily manipulate arrays in for loops. In uniprocessor systems, data locality optimizations improve programs' use of the cache. In distributed memory systems, similar transformations can reduce message count and hide the latency of communication. For all of these techniques, array analyses are necessary to find legal and beneficial transformations. In analyzing loops that contain array statements, traditional analyses report information about large units of code: for example, that a loop carries a dependence. Traditional transformations also treat loops as indivisible units of code, so that each statement instance is treated identically. An unfortunate consequence of this approach is that dependences which involve only a few iterations of a loop can prevent the entire loop from being transformed for better performance. In order to overcome those limitations, we need to work at finer level of detail. Fine-grained transformations can treat each iteration of a statement separately. In some cases, by treating a small portion of the statement instances specially, we can apply performance-enhancing transformations to the bulk of the code which would otherwise be illegal. In other cases, fine-grained transformations can derive transformations from data dependences where traditional transformations would fail. In this thesis, I present several fine-grained transformations, and describe the underlying frameworks which allow us to work at this level of detail. I present iteration space slicing, a fine-grained extension of program slicing, which treats array elements as individual variables, and can compute slices which need to execute only a subset of a loop's iterations. I have developed new methods for removing synchronization from portions of an iteration space, enabling message aggregation, improving latency tolerance, and optimizing data locality.
On-line architecture for the S.Mallat algorithm

Wavelets have been a research matter in a variety of fields since they were created. They are developed in mathematics, algorithmic, architectures and physical applications. The S.MALLAT algorithm has been implemented in many ways and in different architectures by several research groups. In this paper we shall present an architecture for a circuit of reduced area, little cost and high speed, which combine serial and parallel calculation modes. Its design is based on on-line arithmetic. It realizes the S.Mallat decomposition scheme in which filtering is the basic operation. The paper consists of an introduction, a description of the wavelets functions, a description of the on-line arithmetic, a description of the developed circuit architecture and a conclusion.
A Classification Scheme for Characterizing Service Networks

This paper introduces an extended definition of service networks. The service network definition, which can be used for classifying service networks, comprises two parts: the service network declaration and the service network specification. The service network specification consists of the specification of the network characteristics, the node characteristics, and the link characteristics. Each of these three characteristics comprises a set of criteria. One fraction of the criteria has been identified through literature research on services, networked organizations, and service network concepts. The remaining fraction of criteria is the result of a case study analysis. The service network case study has been taken from the information technology sector (i.e., the network of Cloud computing services). The analysis of the case study identified characteristics that are important for describing IT service networks but cannot be captured with the existing definitions of service networks.
Implementation of IIR Notch Filter on FPGA

: This paper proposes the implementation of IIR notch filter onto FPGA (Field Programmable Gate Array), which is an integrated circuit that allows user to reprogram it after manufacturing. The advantages of FPGA notch filter, compared to software filter, are stability, speed, precision and ability of narrowed bandwidth filter implementation. The IIR notch filter algorithm using in this research is the modified least square estimation that places Pole-zero on z-plane and assigns the amplification level of pass-band gain. The 32-bit floating point is also used in this implementation to maximize the precision of FPGA calculation. By experiments, this FPGA notch filter is able to produce very high precision frequency response between 1 Hz - 5 MHz and is able to function in very narrowed bandwidth ( (cid:149) 1 Hz).
Nondenominational digital test programming for functional test

Writing functional digital tests has always been a taxing process. Traditionally, every digital test hardware manufacturer provided software tools that operated similarly yet different than the competing product. This is particularly true of the proprietary test systems prevalent circa 1970s and 1980s. This caused a proliferation of different test languages and test programming tools throughout the test industry. This paper describes software that was designed to provide a test program application bridge between legacy digital test hardware and modern digital test automatic test equipment (ATE). Furthermore, the software provides contemporary users with a common language and operating framework for supporting digital test programs over competing digital test hardware. Description of the application is augmented by design discussion and implementation details.
Biomimetic Impedance Control of an EMG-Based Robotic Hand

The number of extremity amputations resulting from workplace mishaps, traffic accidents and other incidents has shown an increasing trend over time, although the importance of safety management and the prevention of such accidents is fully recognized. Since precise and complex motion may be very difficult in the daily activities of amputees, the development of prosthetic systems is necessary to support their lives and enable social integration. In particular, there is a mandatory requirement for the development of externally powered prosthetic hands with a natural feeling of control, since the role played by this part of the body is very important. However, the control of such hands is problematic, and they must be carefully designed in line with the amputee’s remaining functions. Many researchers have designed prosthetic limbs for amputees since the concept was proposed by N. Wiener in Cybernetics [1]. In previous research, electromyograms (EMGs) have been widely used as an interface tool for prosthetic hands because EMG signals contain information about the operator’s intended motion [2] – [8]. For example, an EMGprosthetic hand made in the USSR [2], the Waseda hand developed by Kato et al. [3], the Boston arm by MIT [4] and the Utha artificial arm by Jacobson et al. [5] were all pioneering steps in the field. Since EMG signals also include information on the force level and mechanical impedance properties of limb motion, Akazawa et al. [6] estimated the force of flexors and extensors from these signals and proposed a scheme to use them in controlling a prosthetic hand. Abul-haj and Hogan [8] also proposed prosthetic control based on an impedance model and analyzed its control characteristics. Most previous research, however, dealt only with on/off control for prosthetic arms depending on the results of EMG pattern discrimination [2], [3], [7], or controlled only a particular joint depending on the torque estimated from EMG signals [4], [5], [6], [8]. Multijoint control of prosthetic arms considering the variable viscoelasticity of flexors and extensors has not yet been realized. This chapter introduces a biomimetic control for an externally powered multi-joint prosthetic hand that considers the muscular contraction levels of flexors and extensors using 9
Usability support security patterns

The main feature of secure software lies in the nature of processes and practices used to specify, design, develop and implement software. Security patterns applied the concept of pattern in the security realm. Its description helps to capture immediately the essence: what is the problem to which attends and what the proposed solution is. The different formats that exist for its description and the multiplicity of sources make its discovery demand effort that discourages the systematic use by potential recipients. This paper presents the prototype of a catalogue that seeks to establish a bridge between the knowledge and experience security experts and the needs of knowledge of software development teams.
A New Methodology to Teach Numerical Methods With MS Excel

Numerical methods are one of the principal tools employed by engineers to solve typical problems that commonly arise at work. These methods are generally only useful when implemented with a computer programming language. Despite this, typical mathematical resources for numerical analysis present an unfriendly environment that prevents a student from acquiring a deeper knowledge of the theory employed to solve each equation and to distinguish between each of the numerical methods in parameters like time and number of iterations. To counter this, the University of A Coruna, in its IV contract program proposed that marine engineering professors define a new educational methodology to implement the learning of numerical methods. Results showed that the principal numerical methods resolution could be solved with Microsoft Excel, where students can attain a higher level of understanding, especially when implemented with graphical representation. Finally, the feasibility of implementing this teaching methodology needs to be analyzed with programming languages like Visual Basic for Applications that when introduced in Microsoft Excel, will allow for better developing the methodology in the future.
Machine learning, EWSL-91 : European Working Session on Learning, Porto, Portugal, March 6-8, 1991, proceedings

Abstracting background knowledge for concept learning. - A multistrategy learning approach to domain modeling and knowledge acquisition. - Using plausible explanations to bias empirical generalization in weak theory domains. - The replication problem: A constructive induction approach. - Integrating an explanation-based learning mechanism into a general problem-solver. - Analytical negative generalization and empirical negative generalization are not cumulative: A case study. - Evaluating and changing representation in concept acquisition. - Application of empirical discovery in knowledge acquisition. - Using accuracy in scientific discovery. - KBG : A generator of knowledge bases. - On estimating probabilities in tree pruning. - Rule induction with CN2: Some recent improvements. - On changing continuous attributes into ordered discrete attributes. - A method for inductive cost optimization. - When does overfitting decrease prediction accuracy in induced decision trees and rule sets? - Semi-naive bayesian classifier. - Description contrasting in incremental concept formation. - System FLORA: Learning from time-varying training sets. - Message-based bucket brigade: An algorithm for the apportionment of credit problem. - Acquiring object-knowledge for learning systems. - Learning nonrecursive definitions of relations with linus. - Extending explanation-based generalization by abstraction operators. - Static learning for an adaptative theorem prover. - Explanation-based generalization and constraint propagation with interval labels. - Learning by explanation of failures. - PANEL : Logic and learnability. - Panel on : Causality and learning. - Seed space and version space: Generalizing from approximations. - Integrating EBL with automatic text analysis. - Abduction for explanation-based learning. - Consistent term mappings, term partitions, and inverse resolution. - Learning by analogical replay in prodigy: First results. - Analogical reasoning for logic programming. - Case-based learning of strategic knowledge. - Learning in distributed systems and multi-agent environments. - Learning to relate terms in a multiple agent environment. - Extending learning to multiple agents: Issues and a model for multi-agent machine learning (MA-ML). - Applications of machine learning: Notes from the panel members. - Evaluation of learning systems : An artificial data-based approach. - Shift of bias in learning from drug compounds: The fleming project. - Learning features by experimentation in chess. - Representation and induction of musical structures for computer assisted composition. - IPSA: Inductive protein structure analysis. - Four stances on knowledge acquisition and machine learning. - Programme of EWSL-91.
Linked: The New Science of Networks

An ink jet comprises an elastic tubular member (14) characterized by piezoelectric properties. The tubular member (14) is terminated in an orifice (26) adapted to pass droplets of ink when the chamber formed within the tubular member (14) is reduced in size. The piezoelectric properties are provided by a substantially homogeneous mixture of piezoelectric material and an elastic binder.
Saliency from the decision perspective

There are several cognitive and neuro-scientific models of early, pre-attentive visual processing, with saliency map models being the particular dominant ones. Although they are very specific about how feature contrast and salience are being computed (including stimulusand observer-driven influences), there usually is a theoretical gap between models dealing with visual analysis (such as the dimension weighting account, Muller, Heller, & Ziegler, 1995; Found & Muller, 1996) and models describing decision and response selection processes (e.g. the Ratcliff Diffusion Model, Ratcliff, 1978). Consequently, I propose that investigating saliency from a decision perspective that is by applying mathematical theories of decisions to several tasks that can be performed supposedly based on a salience map (e.g. detection, localization, attentional selection), explanatory power is increased and new hypothesis can be generated. Further, several issues of visual pre-attentive processing are currently still under debate. Specifically, the exact nature of the pre-attentive architecture is disputed with regard to trial sequence, intention, and redundancy effects. The present study targets at shedding new light on the question of pre-attentive processing architecture (serial, parallel independent or interactive, co-active), top-down penetrability of pre-attentive vision, and pre-attentive vs. post-selective locus of dimensional inter-trial effects. In summary, the findings presented in this thesis support the predictions of the dimension weighting account that is that dimension-specific feature contrast signals are computed in parallel and are dimensionally weighted before being pooled on the master saliency map. They further support the view that dimensional weighting operates at a pre-attentive processing stage and is modulated by trial history (i.e. bottomup) as well as by intention (i.e. top-down). Further, the present results suggests that different tasks such as detection, localization, and compound tasks act upon
The role of predictive inferences in situation model construction

Current theories of discourse comprehension assert that understanding entails the construction of a multilevel representation of text, which would include a surface structure code, a propositional textbase, and a situation model. The component processes used to generate the surface code and the propositional representation have been specified, yet the processes used in the generation of the situation model have not been identified. These experiments investigated the hypothesis that one of the processes used in situation model development is an inferential process in which the reader strategically employs knowledge to form expectations when highly predictive text opportunities arise. Data from a word recognition task demonstrated that predictions are not encoded into a reader's propositional representation during reading. However, the results from word prediction and lexical decision experiments suggested that predictions are available to the reader at a more abstract level of representation—the situation .
Perlindungan Web pada Login Sistem Menggunakan Algoritma Rijndael

Pengguna internet, biasanya menggunakan fasilitas internet untuk melakukan proses pengubahan informasi. Sehingga keamanan data sangatlah penting. Kebutuhan akan informasi menjadikan para pengembang website menyajikan berbagai macam layanan bagi para pengguna. Namun kebanyakan dari para pengembang website mengabaikan keamanan sistem pada website tersebut. Serangan yang paling banyak digunakan oleh para penyerang tersebut adalah serangan SQL Injection. Penelitian ini difokuskan pada pengamanan sistem menggunakan algoritma Rijndael untuk mengenkripsi data. Algoritma Rijndael terpilih sebagai algoritma kriptografi yang dapat melindungi informasi dengan baik serta efisien dalam implementasinya dan dinobatkan sebagai Advanced Encryption Standard (AES). Algoritma ini akan ditanamkan pada login sistem untuk melindungi akses yang tidak sah dari penyerang. Hasil dari penggunaan algoritma Rinjdael dapat melindungi sistem login dengan baik sehingga sistem dinyatakan aman dari para penyerang website. Kata Kunci—Rijndael, Website, Database, SQL Inject
Implementation of a parallel XTS encryption mode of operation

Security of data stored inside storage devices is becoming one of the main issues in computer security now. It is known that the most efficient techniques to protect storage devices are using cryptography. Developing newer and more secure encryption algorithms and modes of operation might be critically important to protect these devices since conventional disk encryption algorithms, such as CBC mode, have shown serious security flaws. In this paper, the IEEE XTS encryption mode of operation for storage encryption (P1619 standard) has been implemented using parallel design. A performance comparison between the sequential and parallel algorithms of XTS mode is presented here. Parallel overheads that prevented from achieving perfect linear speedup are measured and minimized. The parallel XTS algorithm has shown a speedup of 1.80, with 90% efficiency, faster than the sequential algorithm. In these simulations, AES is used as encryption algorithm with 256-bit encryption key.
Exploratory database analysis via self-organization

A new numerical technique, most easily classified as a kind of statistical clustering algorithm, is introduced. This technique, based on principles of collective processing and self-organization, supports the dynamic visualization and manipulation of emergent structures present in multidimensional data sets. The algorithm works by first placing database elements randomly in a grid and then aggregating them in a particular way so that statistical regularities are mapped into spatially structured clusters. The grid is displayed to the human analyst who can probe the contents and alter the characteristics of the clusters as they are formed. It is shown how this technique provides a mean of exploration in complex information spaces, such as in a document corpus or in a relational database, effectively supporting an alternative approach to information access based on exploration from multiple perspectives rather than search.
Adding support for user-defined sorts and sorted function symbols to Tamarin

A security protocol is an exchange of messages between multiple parties with the intent of achieving certain security properties, such as confidentiality of message contents or authentication. Security protocol verification tools are used to formally verify the properties these protocols claim. These tools are often limited by the type of protocols they can model appropriately. Recently, a new tool called Tamarin was developed which allows for the modeling of security protocols that make use of Diffie-Hellman exponentiation, as well as allowing for advanced security properties, such as compromising adversaries. We extend the theory behind Tamarin to allow for the modeling of protocols which could not be properly modeled before. Our changes include support for user-defined sorts and function symbols, built-in natural numbers, and iterated function application. We argue how our changes fit with the original theory behind Tamarin. We implement our modifications and show examples of protocols modeled with the new capabilities. We present an improvement in the modeling of existing protocols in the Tamarin security protocol verification tool. We exemplify part of our improvements by a protocol working with a simple encrypted counter value, called the Counter protocol. We also show a protocol which could not be properly modeled in Tamarin before: we present a protocol based on a minimal hash chain based on our iterated function application extension.