Miracle-dz/UniFAR-FTUs huggingface dataset:
Control for Coupled Process by Collaborative Set Points Movement over MIMO Systems

A control method that rejects disturbances affecting a declared critical dynamics in a MIMO-PID decentralized system is presented. Through coordinated set points displacement, some noncritical control loops are detuned. To avoid instability caused by the detuning, the selection of allowable set points is made through a collaborative optimization algorithm that provides robustness to control. The benefits and challenges of acting on set points to stabilize systems are discussed. Collaborative control concepts and definitions proposed by this scheme are explained. An analysis of the effects achieved on a single loop due detuning in the other loops is made. The proposed structure of collaborative control and results acting on a MIMO-PID process controlling the critical concentration on a CSTR type reactor are detailed.
Extended Collaborative Filtering Technique for Mitigating the Sparsity Problem

Many online shopping malls have implemented personalized recommendation systems to improve customer retention in the age of high competition and information overload. Sellers make use of these recommendation systems to survive high competition and buyers utilize them to find proper product information for their own needs. However, transaction data of most online shopping malls prevent us from using collaborative filtering (CF) technique to recommend products, for the following two reasons: 1) explicit rating information is rarely available in the transaction data; 2) the sparsity problem usually occurs in the data, which makes it difficult to identify reliable neighbors, resulting in less effective recommendations. Therefore, this paper first suggests a means to derive implicit rating information from the transaction data of an online shopping mall and then proposes a new user similarity function to mitigate the sparsity problem. The new user similarity function computes the user similarity of two users if they rated similar items, while the user similarity function of traditional CF technique computes it only if they rated common items. Results from several experiments using an online shopping mall dataset in Korea demonstrate that our approach significantly outperforms the traditional CF technique.
Active Compensation Method of Robot Visual Error Based on Vestibulo-ocular Reflex

To solve the problem of vision instability caused by attitude variation of the robot working under bumpy environment,a method of active compensation for robot visual error is proposed based on the principle of vestibulo-ocular reflex(VOR). According to oculomotor neural circuits,an adaptive control model of vestibulo-ocular reflex is established on the basis of physiology and anatomy.In order to verify the model's performance,some simulation experiments are performed in different environments.Simulation results show that the model can actively compensate the visual error caused by robot attitude variation and has better adaptability.Finally,physical robot experiments demonstrate the validity and accuracy of the control model.
Analysis on Present Situation of Library Information Service Research from 2000 to 2009——Based on Word-Frequency Analysis and Co-Word Analysis

This paper takes the"VIP-Chinese scientific and Technological Jounal Database" as statistical source.By using word-frequency analysis method in research of library information service,first of all,it studies these Keywords collected from different periods(2000-2004,2005-2009) not only from the whole but also the partial of some keywords.Then this paper compares first period with second period on the status quo and hotspot of the research,at last it describes the research topic and research trends recently by using co-word analysis method.
Weak System Models for Fault-Tolerant Distributed Agreement Problems ausgeführt zum Zwecke der Erlangung des akademischen Grades eines Doktors der technischen Wissenschaften

This thesis1 investigates various aspects of weak system models for agreement problems in fault-tolerant distributed computing. In Part I we provide an introduction to the context of this work, discuss related literature and describe the basic system assumptions. In Part II of this thesis, we introduce the Asynchronous Bounded-Cycle (ABC) model, which is entirely time-free. In contrast to existing system models, the ABC model does not require explicit time-based synchrony bounds, but rather stipulates a graph-theoretic synchrony condition on the relative lengths of certain causal chains of messages in the space-time graph of a run. We compare the ABC model to other models in literature, in particular to the classic models by Dwork, Lynch, and Stockmeyer. Despite Byzantine failures, we show how to simulate lock-step rounds, and therefore make consensus solvable, and prove the correctness of a clock synchronization algorithm in the ABC model. We then present the technically most involved result of this thesis: We prove that any algorithm working correctly in the partially synchronous Θ-Model by Le Lann and Schmid, also works correctly in the time-free ABC model. In the proof, we use a variant of Farkas’ Theorem of Linear Inequalities and develop a non-standard cycle space on directed graphs in order to guarantee the existence of a certain message delay transformation for finite prefixes of runs. This shows that any time-free safety property satisfied by an algorithm in the Θ-Model also holds in the ABC model. By employing methods from point-set topology, we can extend this result to liveness properties. In Part III, we shift our attention to the borderland between models where consensus is solvable and the purely asynchronous model. To this end, we look at the k-set agreement problem where processes need to decide on at most k distinct decision values. We introduce two very weak system models Manti and Msink and prove that consensus is impossible in these models. Nevertheless, we show that (n−1)-set agreement is solvable in Manti and Msink, by providing algorithms that implement the weakest failure detector L. We also discuss how models Manti and Msink relate to the f -source models by Aguilera et al. for solving consensus. In the subsequent chapter, we present a novel failure detector L(k) that generalizes L, and analyze an algorithm for solving k-set agreement with L(k), which works even in systems without unique process identifiers. Moreover, We explore the relationship between L(k) and existing failure detectors for k-set agreement. Some aspects of L(k) relating to anonymous systems are also discussed. This research has been supported by the Austrian Science Foundation (FWF) projects P17757 and P20529.
A Computational Model of Object-Based Attentionusing Multi-scale Analysis and Grouping

Recent biological experiments have presented increasing evidence for object-based attention.We propose a computational model of object-based attention to simulate biological perception.Two techniques are employed:multi-scale analysis and grouping.Differential geometry descriptor in multi-scale analysis extracted important edges from source images and subsequent contour grouping process organized the edge image into perceptual objects.The later process originated from Gestalt laws.Then focus of attention shifted among objects in order of conspicuousness,which was measured by edge saliency,region contrast and topological property of closure.The proposed model exhibits several advantages.It considers integrality of objects and thus gains higher searching accuracy than space-based attention.It uses multi-scale analysis to select candidates and thus improves efficiency of contour grouping.Experiments on different types of images show high efficiency and biological plausibility of our model.
A new concept of assistive virtual keyboards based on a systematic review of text entry optimization techniques

Abstract Introduction: Due to the increasing popularization of computers and the internet expansion, Alternative and Augmentative Communication technologies have been employed to restore the ability to communicate of people with aphasia and tetraplegia. Virtual keyboards are one of the most primitive mechanisms for alternatively entering text and play a very important role in accomplishing this task. However, the text entry for this kind of keyboard is much slower than entering information through their physical counterparts. Many techniques and layouts have been proposed to improve the typing performance of virtual keyboards, each one concerning a different issue or solving a specific problem. However, not all of them are suitable to assist seriously people with motor impairment. Methods: In order to develop an assistive virtual keyboard with improved typing performance, we performed a systematic review on scientific databases. Results: We found 250 related papers and 52 of them were selected to compose. After that, we identified eight essentials virtual keyboard features, five methods to optimize data entry performance and five metrics to assess typing performance. Conclusion: Based on this review, we introduce a concept of an assistive, optimized, compact and adaptive virtual keyboard that gathers a set of suitable techniques such as: a new ambiguous keyboard layout, disambiguation algorithms, dynamic scan techniques, static text prediction of letters and words and, finally, the use of phonetic and similarity algorithms to reduce the user's typing error rate.
Network model of medicinal properties of the traditional Chinese medicine prescriptions

The research on the laws of the traditional Chinese medicine prescriptions usually only focuses on herbs or herbs structure in the complex network.But the properties of herbs are of great importance,so the network model of herbs and their properties can break the limitations of the network model based on herbs.First,extract three aspects of properties," taste"," meridian tropism"," efficacy". Then,add these to the network model of herbs.Finally,a test was done using the overlapping community discovery algorithm,and the test data come from 211 herbs in lung impotent prescription database.And the communities found in the test verify that the new model are feasible.
Análise de conversor analógico-digital baseado em transformada wavelet

This project consists of the analysis of an analog-to-digital converter which presents a novel waveletbased sampling technique. First of all, the converter's algorithm was studied and some modi cations were suggested. Afterwards, the e ect of quantization in the conversion process, as well as the e ects of applying di erent input signals and of computing the wavelet transform for di erent bases and scales, were analyzed. In order to verify the converter's behavior under these di erent conditions, a digital-to-analog converter was developed. The results show how the quantization and the changes in the wavelet transform parameters a ect the outcome. In the end, the viability of applying the proposed converters for high resolution and low-power applications is discussed.
The Ethics of Super Intelligence

The future arrival of super intelligence and its impact in society raises numerous concerns. Grounded in the research hitherto elaborated by the field of machine ethics, this paper contemplates the challenge of formulating a code of ethics that regulates super intelligence’s behavior. The first section discusses the need for this code of conduct and contends why it should be centered on ethics. The second section examines the various complexities of this endeavor, and puts forth a theoretically plausible approach. Lastly, the final section further raises the question of whether human beings should truly have the final say given a disagreement between the ethics of man and machine.
Hybrid Distribution for Association Rules Extraction on Grid Computing

The extraction of association rules in distributed systems is capable of greatly reducing the time of extraction and exploitation of large data sets, however, these benefits are forced to emerging issues related on the one hand the nature of distributed systems and the sharp increase in volumes of data and its geographic dispersion. The trend towards grid computing that enables applications to handle distributed heterogeneous computing resources as a single virtual machine is justified by these last two points. Globus_HyDAR, our service developed under Globus grid, falls within the framework of grids Data mining; has proposed a hybrid intelligent distribution (horizontal and vertical) data. The results clearly show gains execution time compared to the horizontal and vertical distributions.
An application-driven approach to evaluation of a lightweight multithreaded architecture

“Many interesting applications have arisen whose computational demands for scaling and timeliness stress even our current supercomputers” [42, page 67]. These applications arise from a variety of sources including physics, engineering, biology, sociology, and national defense, to name just a few, and many of them have characteristics that make them ill-suited to conventional high performance architectures. As conventional parallel architectures reach the limits of their scalability, revolutionary new architectures are needed to achieve the performance demanded by these increasingly large and complex applications. This dissertation evaluates one such architecture, a lightweight multithreaded architecture, and explores how multithreaded applications can be organized to take advantage of the architecture’s key features. The lightweight multithreaded architecture is composed of a network of lightweight processors and memories. The lightweight processors utilize large numbers of lightweight threads of execution to tolerate latencies that conventional architectures cannot avoid. When a given thread of execution is stalled waiting on a long latency event, such as a memory access, the processor can switch to a different thread rather than sitting idle. If there are enough threads available, the processor remains fully utilized, effectively hiding the latency involved in a memory access. Direct architectural support for lightweight threads with minimal state and low-overhead, memory-based synchronization enable threads to be started, stopped, suspended, and synchronized in only a few cycles. This enables applications to utilize fine grain parallelism with large numbers of dynamic threads and intense synchronization that would restrict performance on traditional parallel architectures. This dissertation addresses two main questions: (1) How should the architecture be configured to be effective with applications? (2) How should the applications be organized to effectively use the architecture? In order to answer these questions, experiments and analysis focused on understanding how key factors at the architectural and application level interact to affect performance. It uses an organized approach to evaluation that targets the modeling, simulation, and evaluation tools to the issue under investigation, avoiding the need to simulate and build the entire machine. It then integrates these results to propose an architectural configuration and application programming model. This work comprises the first attempt to code and compare real applications using the architecture’s unique architectural features.
Synthesis, characterization, and biological evaluation of poly(glycoamidoamine)s as DNA delivery vectors.

Synthetic polycations readily bind to the negatively charged phosphate groups in nucleic acids and can serve as carriers to deliver genetic materials into cells. Simplicity of use, ease of large-scale production, and lack of an immune response in vivo are the main merits of polymeric delivery. However, the lack of knowledge of the structure-biological property relationships of polymeric vectors has hampered further efforts to invent highly efficient non-viral gene delivery agents through a systematic, rational approach. In an effort to understand such structurebioactivity relationships, a library of 20 poly(glycoamidoamine)s have been constructed by polycondensation of esterified D-glucaric acid (D), dimethyl-meso-galactarate (G), D-mannaro1,4:6,3-dilactone (M), and dimethyl-L-tartarate (T) with diethylenetriamine (1), triethylenetetramine (2), tetraethylenepentamine (3), pentaethylenehexamine (4), and spermine (S). These polymers are of similar degrees of polymerization (11 14), but with varied amine stoichiometry (1 to 4), amine spacer (ethylene or butylene), hydroxyl stereochemistry (D, G, and M), and hydroxyl number (2 or 4) within the repeat units, serving as a platform for investigation of how structural variations affect their gene delivery efficiencies. Furthermore, two noncarbohydrate-containing analogous polymers have also been synthesized to elucidate the biological functions of the carbohydrate moieties. The biological properties of these polymers as delivery vectors have been evaluated and correlated to their detailed chemical structures. Examination of amine stoichiometry showed that the polymers with four amines in the repeat unit exhibited the best transfection efficiency without eliciting cytotoxicity. Examination of amine spacer showed that polymers with an ethylene spacer conveyed higher cell viability than those with a butylene spacer. Examination of carbohydrate hydroxyl stereochemistry showed that polymers with meso-galactrate (G) as the carbohydrate moiety possessed higher transfection efficiency than polymers containing Dglucarate (D) and D-mannarate (M). Examination of the effect of hydroxyl number showed that L-tartarate (T, 2 hydroxyls per carbohydrate) polymers formed smaller complexes and had higher DNase protection capability than D, G, and M polymers (4 hydroxyls per carbohydrate). Elucidation of these structure-biological property relationships clarified what structures were most promising to generate the desired properties in further exploration and rational design of glycopolyamines for gene therapy.
Research on control strategy of a hovering-type AUV

A control architecture based on behaviors is designed for the hovering-type AUV test bed "MM-01". Three basic behaviors,including Wander,Cruise and Obstacle-Avoid,realized by fuzzy logic control,are defined.AUV′s predefined mission can be performed by the sequential coordination of those behaviors based on priority.Besides,this paper proposes to introduce inner-loop velocity feedback into motion control to realize AUV′s hovering function and defines a new kind of interface between high-level autonomous control block and low-level motion control block.Finally the simulation of the whole system is executed in Simulink and the results validate the efficiency of the designed control strategy.
Aerosol Processing Of Materials

Thank you very much for reading aerosol processing of materials. As you may know, people have search numerous times for their favorite books like this aerosol processing of materials, but end up in infectious downloads. Rather than enjoying a good book with a cup of tea in the afternoon, instead they are facing with some harmful virus inside their desktop computer. aerosol processing of materials is available in our book collection an online access to it is set as public so you can get it instantly. Our digital library spans in multiple countries, allowing you to get the most less latency time to download any of our books like this one. Kindly say, the aerosol processing of materials is universally compatible with any devices to read.
Separating Electronic from Steric Effects in Ethene/α-Olefin Copolymerization: A Case Study on Octahedral [ONNO] Zr-Catalysts

Four Cl/Me substituted [ONNO] Zr-catalysts have been tested in ethene/α-olefin polymerization. Replacing electron-donating methyl with isosteric but electron-withdrawing chlorine substituents results in a significant increase of comonomer incorporation. Exploration of steric and electronic properties of the ancillary ligand by DFT confirm that relative reactivity ratios are mainly determined by the electrophilicity of the metal center. Furthermore, quantitative DFT modeling of propagation barriers that determine polymerization kinetics reveals that electronic effects observed in these catalysts affect relative barriers for insertion and a capture-like transition state (TS).
Modelling Analysis And Design Of Hybrid Systems

modelling analysis and design of hybrid systems is available in our digital library an online access to it is set as public so you can get it instantly. Our book servers hosts in multiple locations, allowing you to get the most less latency time to download any of our books like this one. Kindly say, the modelling analysis and design of hybrid systems is universally compatible with any devices to read.
Isolating Wormhole Attack in Wireless Sensor Networks

Short Retraction Notice Circuits and Systems (CS) does not meet author’s publication requirements. This article has been retracted to straighten the academic record. In making this decision the Editorial Board follows COPE's Retraction Guidelines. Aim is to promote the circulation of scientific research by offering an ideal research publication platform with due consideration of internationally accepted standards on publication ethics. The Editorial Board would like to extend its sincere apologies for any inconvenience this retraction may have caused. Please see the article page for more details. The full retraction notice in PDF is preceding the original paper which is marked "RETRACTED".
Delay-Constrained and Energy-Efficient Cross-Layer Routing in Wireless Sensor Networks

It is essential for wireless sensor networks(WSNs)to forward information collected by sensors to the sink quickly and efficiently through multi-hop relay.It is found that both duty cycle in the media access control(MAC)layer and the radio irregularity affect the efficiency of routing protocol greatly.Though traditional layered protocol has been proven to have the advantage of modularity,its whole performance cannot achieve its optimal performance since each layer works independently.Furthermore,most existing protocols that sacrifice time to improve energy-efficiency will bring unacceptable end-to-end delays to time-sensitive systems.This paper proposes a delay-constrained and energy-efficient cross-layer routing protocol(DECR),which takes into account related information of MAC and link layers when making routing decisions where the objective is to maximize the energy-efficiency of a node on the premise that end-to-end delay is restricted to the predefined upper bound.Both analysis and simulation results show that DECR performs well.
Cross-Computer Malware Detection in Digital Forensics

Malware poses a huge threat to society, which is heavily dependent on computer technology. Traces of malicious activity can be identified through digital forensics techniques. Digital forensics is performed in a semi-automatic manner. Forensic personnel have to administrate the forensic tools and the process of searching for digital evidence on suspect, confiscated computers. This becomes a daunting task when multiple machines are to be analyzed and the data volumes increase. Analysis of common characteristics in a set of multiple computers can be used to improve knowledge and to detect anomalies and thereby malware. This Master thesis proposes a correlation method for the automatic identification of malware traces across multiple computers. Through the use of existing digital forensics methods and data mining techniques, correlations between multiple machines are used to improve the efficiency and effectiveness of detecting traces of malware.