Miracle-dz/UniFAR-FTUs huggingface dataset:
NONLINEAR ADAPTIVE SIGNAL PROCESSING

Deng, Shi-Wee. Ph.D., Purdue University, May 1992. Nonlinear Adaptive Signal Pr~~cessing. Major Professor: Okan K. Ersoy. Nonlinear techniques for signal processing and recognition have the promise of achieving systems which are superior to linear systems in a number of ways such as better performance in terms of accuracy, f a u l t tolerance, resolution, highly parallel architectures and cloker similarity to biological intelligent systems. The nonlinear techniques proposed are in the form of multistage neural networks in which each stage can be a particular neural network and all the stages operate in parallel. The specific approach focused upon is the parallel, self-organizing, hierarchical neural networks (PSHNN's). A new type of PSHNN is discussed such tha.t the outputs are allowed to be continuous-valued. The perfo:rmance of the resulting networks is tested in problems of prediction of speech and of chaotic tinieseries. Three types of networks in which the stages are learned by the delta rule, sequential least-squares, and the backpropagation (BP) algolrithm, respectively, are described. In all cases studied, the new networks achieve better performarnce than linear prediction. This is shown both theoretically and experimentally. A revised BP algorithm is discussed for learning input nonlinearities. The advantage of the revised BP algorithm is that the PSHNN with revised BP stages can be extended to use the sequential leastsquares (SLS) or the least mean absolule value rule (LMAV) in the last stage. A forward:backward training algorithm for parallel, self-organiizing hierarchiczcl neural networks is described. Using linear algebra, it is sllown that the fol-ward-backward training of an n-stage PSHNN until convergence is equivalent to the pseudo-inverse solution for a single, total network designed in the leastsquares sense with the total input vector consisting of the actual input vector and its additional nonlinear transformations. These results are also valid when a single long input vector is partitioned into smaller length vectors. A number of advantages achieved are small modules for easy and fast learning, parallel implementation of small modules during testing, faster convergence rate, better numerical e r r~ r~ reduc t ion , and suitability for learning input nonlinear transformations by the backpropagation algorithm. Better performance in terms of deeper minimum of the error function and faster convergence rate is achieved when a single BP network is replaced by a PSHNN of equal complexity in which each stage is a BP network of smaller complexity than the single BP network. CHAPTER
A Survey on Removal of Duplicate Records in Database

Deduplication is a task of identifying one or more records in repository that represents same object or entity. The problem is that the same data may be represented in different way in every database. While merging the databases, duplicates occur despite different schemas, writing styles or misspellings. They are called as replicas. Removing replicas from the repositories provides high quality information and saves processing time. This paper presents a thorough analysis of similarity metrics to identify similar fields in records and a set of algorithms and duplicate detection tools to detect and remove the replicas from the database.
Encryption based security for ISDN communication: technique and application

The current evolution of the public integrated services digital network (ISDN) with its complete end to end digital connectivity provides an excellent platform for networking and reliable data communications. The primary objective of the present work is to develop and implement methodologies for successful data encryption schemes which can be embedded into the ISDN customer premises equipment (CPE) and require no software upgrades of the switching equipment. This will make the public ISDN network look like a private network to the security conscious user. Furthermore, secure data communication is provided over circuit switched voice or data channels. Widely used encryption and keying schemes based upon the data encryption standard (DES), secret key cryptography, and Rivest-Shamir-Adleman (RSA) public key cryptography algorithms are being investigated for their applicability in the ISDN environment. Initial investigations show that a HYBRID cryptographic approach, RSA for authentication, and DES for encryption, may be most appropriate. Efforts are underway to develop a hardware and software implementation for the HYBRID approach. In the paper, the authors discuss possible standards for ISDN security that will allow data (including voice) transmitted over the ISDN basic rate interface (BRI) line to be encrypted so that only the intended receiver can decipher it. The ideas presented can easily be transported to the packet switched channels, primary rate interface (PRI) and possibly to broadband ISDN (BISDN). <<ETX>>
Enhancing qualitative relative orientation with qualitative distance for robot path planning

Humans reason about different aspects of space (such as relative orientation, cardinal directions, distance, size and shape of objects) quite easily. With the aim of simulating human behavior, several models for these spatial concepts have been developed. Cognitive considerations have made these frameworks qualitative because it seems to deal better with the imprecision that human perception provides. Unfortunately no operational model which allows to reason with all these spatial aspects in an integrated way has been developed up to now. The first aim of our research has been the integration of different spatial concepts which is accomplished by the definition of an operational model based on first order predicate logic. Constraint logic programming extended with constraint handling rules provides the level of abstraction suited for the integration of qualitative relative orientation and qualitative distance. The second aim of our work is to apply qualitative spatial reasoning to robot path planning.
A Database-Centric and Web-Automatic Hypertext Application Design Method

With the evolution of World Wide Web from the simple delivery mechanism to a platform for complex business applications, Web-based business computing is already seen as a new competitive business weapon. The potential commercial payoff of WWW application attracts more and more organizations to build their own web sites and develop business-to-business or business-to-consumer applications on the Internet. Designing Web applications has become a critical corporate strategic issue. However, current methods of modeling and designing hypertext applications are in chaotic and ad-hoc nature. These approaches lack the stringent and rigorous system analysis and design principles. Special efforts are needed to develop a formal method to support the modeling and design of hypertext applications. This research aims to tackle this important issue and propose an effective and efficient design alternative. We build a toolkit prototype that implements the design method we present. This toolkit is easy to use and to integrate with SQL compliant database systems. We develop a Web hypertext design method called the database-centric Web hypertext design method (DWHDM) to approach Web page requirements analysis, Web hypertext navigation design, Web page template generation, and hypertext information system maintenance. We adopt UML class diagram, state diagram, and sequence diagram to capture user requirements and application characteristics. We use a relational or object-relational database system to serve as the integrating design repository.
Coordination Avoidance in Database Systems (Extended Version)

Minimizing coordination, or blocking communication between concurrently executing operations, is key to maximizing scalability, availability, and high performance in database systems. However, uninhibited coordination-free execution can compromise application correctness, or consistency. When is coordination necessary for correctness? The classic use of serializable transactions is sufficient to maintain correctness but is not necessary for all applications, sacrificing potential scalability. In this paper, we develop a formal framework, invariant confluence, that determines whether an application requires coordination for correct execution. By operating on application-level invariants over database states (e.g., integrity constraints), invariant confluence analysis provides a necessary and sufficient condition for safe, coordination-free execution. When programmers specify their application invariants, this analysis allows databases to coordinate only when anomalies that might violate invariants are possible. We analyze the invariant confluence of common invariants and operations from real-world database systems (i.e., integrity constraints) and applications and show that many are invariant confluent and therefore achievable without coordination. We apply these results to a proof-of-concept coordination-avoiding database prototype and demonstrate sizable performance gains compared to serializable execution, notably a 25-fold improvement over prior TPC-C New-Order performance on a 200 server cluster.
Structured Parallel Programming: Patterns for Efficient Computation

Programming is now parallel programming. Much as structured programming revolutionized traditional serial programming decades ago, a new kind of structured programming, based on patterns, is relevant to parallel programming today. Parallel computing experts and industry insiders Michael McCool, Arch Robison, and James Reinders describe how to design and implement maintainable and efficient parallel algorithms using a pattern-based approach. They present both theory and practice, and give detailed concrete examples using multiple programming models. Examples are primarily given using two of the most popular and cutting edge programming models for parallel programming: Threading Building Blocks, and Cilk Plus. These architecture-independent models enable easy integration into existing applications, preserve investments in existing code, and speed the development of parallel applications. Examples from realistic contexts illustrate patterns and themes in parallel algorithm design that are widely applicable regardless of implementation technology. The patterns-based approach offers structure and insight that developers can apply to a variety of parallel programming models Develops a composable, structured, scalable, and machine-independent approach to parallel computing Includes detailed examples in both Cilk Plus and the latest Threading Building Blocks, which support a wide variety of computers Table of Contents 1. Introduction 2. Map 3. Collectives 4. Data reorganization 5. Fork-join 6. Examples 7. Further Reading
Absorptive Capacity as a Precondition for Business Process Improvement

Improving organizational performance by redesigning business processes and supporting them with a proper information system is a daunting challenge. We analyze the possibilities of business process management in general and in the healthcare sector in particular. The role of business process modeling as a way to increase an organization's absorptive capacity is analyzed. A longitudinal case study of a European public healthcare insurance company identifies the factors either increasing or hindering absorptive capacity. The case presents that the dilemma between radical and incremental approach to improve business processes is somehow artificial since the radicalness of changes depends on the difference between the absorptive capacity and the extent of the proposed changes. The paper shows that business process management projects should not merely focus on the development of methodologically correct models, but should be used as an opportunity to increase the absorptive capacity of an organization.
The Status Is Not Quo: Unraveling Music Videos

The Status Is Not Quo: Unraveling Music Videos Gary T. Hanby Department of Art, BYU Master of Arts The Utah State Standards for media arts are general and therefore give teachers a great deal of freedom in how they present the content for media arts courses. How the teacher engages students and project assignments are left to the teacher as they walk the students through the process of making films. This thesis explores how an art teacher might use music videos to teach filmmaking techniques and engage students in the process of meaning making. My research hypothesis is that, by educating students to understand and interpret the messages they consume through media, I can help them recognize the hidden texts in visual culture. My curriculum provides students with learning activities that foster the development of critical thinking skills and also techniques for analyzing images. An important part of the curriculum for this unit is a critical study of music videos wherein the students examine music videos using semiotics and qualitative film analysis. The students explore filmmaking techniques and the processes needed to create their own messages in a music video.
An Ant Colony Optimization Method for Fuzzy Vehicle Routing Problem

This paper deals with the vehicle routing problem involved with fuzzy /imprecise vehicle travel times and customer service times, these fuzzy /imprecise times are represented as fuzzy numbers and interpreted as possibility distributions. According to the same consideration as the stochastic programming with recourse, we treate the influence of the fuzziness of travel times and service times as recourse cost. and solve the fuzzy vehicle routing problem through twostage decisions. As the result, a two-stage possibilistic programming model is formulated. By choosing an appropriate definition of fuzzy mean, we can show that the proposed model is equivalent to an ordinary crisp programming problem. Furthermore, We propose a solution method based on Ant Colony System (ACS) to obttain the best solution of the problem. Finally, some examples are given to illustrate the two-stage model and the solution algorithm.
Specification and validation of a distributed transaction processing facility for the MMS applications

We introduce a specification of a distributed transaction processing facility for the Manufacturing Message Specification (MMS) which is an application service element of the Manufacturing Automation Protocol (MAP) standardized by the International Standard Organization (ISO) to support messaging communication to and from programmable devices in a computer integrated manufacturing (CIM) environment. The proposed facility permits the organization of a distributed transaction in terms of a set of MMS services encapsulated together to perform the manufacturing or the production tasks. The services provided by the transaction processing (TP) standard, presented by the ISO, are used as well as new services are defined to guarantee the coherent behavior of the MMS distributed transactions. This guarantee is based on the satisfaction of the Atomicity, Consistency, Isolation, and Durability (ACID) properties defined by the ISO. The distributed transaction processing facility is specified as finite state automata represented by Nutt evaluation networks notations. A validation technique based on the Calculus of Communicating Systems (CCS) introduced by Milner is used to prove the coherent behavior of the transactions.
Multiple additive regression trees: a methodology for predictive data mining for fraud detection

Abstract : The Defense Finance Accounting Service DFAS-Operation Mongoose (Internal Review - Seaside) is using new and innovative techniques for fraud detection. Their primary techniques for fraud detection are the data mining tools of classification trees and neural networks as well as methods for pooling the results of multiple model fits. In this thesis a new data mining methodology, Multiple Additive Regression Trees (MART) is applied to the problem of detecting potential fraudulent and suspect transactions (those with conditions needing improvement - CNI's). The new MART methodology is an automated method for pooling a "forest" of hundreds of classification trees. This study shows how MART can be applied to fraud data. In particular it shows how MART identified classes of important variables and that MART is as effective with iaw input variables as it is with the categorical variables currently constructed individually by DFAS. MART is also used to explore the effects of the substantial amount of missing data in the historical fraud database. In general MART is as accurate as existing methods, requires much less effort to implement saving many man days, handles missing values in a sensible and transparent way, and provides features such as identifying more important variables.
Effect of atmospheric-pressure helium plasma jet on cell culture medium

SUMMARY Atmospheric-pressure, nonthermal plasma jets produced by using helium gas have been studied for various applications. In particular, plasma applications for biological treatment have attracted attention and investigation all over the world. In this paper, various kinds of cell culture media were irradiated with a plasma jet, and its components were analyzed. The results showed that irradiating a cell culture medium with a plasma jet could cause changes in its pH, electrical conductivity, and so on. These results suggest that irradiating with a plasma jet might cause changes in the form of cells and produce cell death. Plasma jets also generate UV light, which may kill cells. It was found that the plasma jet irradiation time is a very important factor in the treatment of cells.
Optical Monitoring Of Excitation Patterns In Single Cardiomyocytes

We have developed an optical multisite recording system to monitor membrane excitationes in isolated or cultured cells using potential-sensitive fluorescent dyes. The system offers in its current configuration up to 24 out of 100 selectable myuring spots each with a pixel size at as low as 14 x 14 pm separated by 1 pm. Each spot is re resented by one element of a 10 x 10 photodyode array wkich, after individual amplification, is linked to one channel of a 24channel transient recorder (sample rate 200 kHz per channel). Simultaneous optical and electrical measurements on isolated cardiomyocytes of adult guinea pigs allow us to study the electrical behaviour of the cell membrane with subcellular spatial resolution.
A comparison of tetrahedral mesh improvement techniques

Automatic mesh generation and adaptive refinement methods for complex three-dimensional domains have proven to be very successful tools for the efficient solution of complex applications problems. These methods can, however, produce poorly shaped elements that cause the numerical solution to be less accurate and more difficult to compute. Fortunately, the shape of the elements can be improved through several mechanisms, including face-swapping techniques that change local connectivity and optimization-based mesh smoothing methods that adjust grid point location. The authors consider several criteria for each of these two methods and compare the quality of several meshes obtained by using different combinations of swapping and smoothing. Computational experiments show that swapping is critical to the improvement of general mesh quality and that optimization-based smoothing is highly effective in eliminating very small and very large angles. The highest quality meshes are obtained by using a combination of swapping and smoothing techniques.
A sequential dual method for the structured ramp loss minimization

The paper presents a sequential dual method for the non-convex structured ramp loss minimization. The method uses the concave-convex procedure which transforms a non-convex problem iterativelly into a series of convex ones. The sequential minimal optimization is used to deal with the convex optimization by sequentially traversing through the data and optimizing parameters associated with the incrementally built set of active structures inside each of the training examples. The paper includes the results on two sequence labeling problems, shallow parsing and part-of- speech tagging, and also presents the results on artificial data when the method is exposed to outlayers. The comparison with a primal sub-gradient method with the structured ramp and hinge loss is also presented.
Small signal stability for parallel connected inverters in stand-alone AC supply systems

This paper presents a small signal analysis for parallel connected inverters in stand-alone AC supply systems. The control technique of the inverters is based on frequency and voltage droop, which depends on the local variable measurements and do not need control interconnections. Simulation results show that the system is well represented by the small signal model, which makes stability studies easier. Preliminary experimental results are presented.
Audio representations for data compression and compressed domain processing

I certify that I have read this dissertation and that in my opinion it is fully adequate, in scope and in quality, as a dissertation for the degree of Doctor of Philosophy. I certify that I have read this dissertation and that in my opinion it is fully adequate, in scope and in quality, as a dissertation for the degree of Doctor of Philosophy. I certify that I have read this dissertation and that in my opinion it is fully adequate, in scope and in quality, as a dissertation for the degree of Doctor of Philosophy. In the world of digital audio processing, one usually has the choice of performing modiications on the raw audio signal or performing data compression on the audio signal. But, performing modiications on a data compressed audio signal has proved diicult in the past. This thesis provides new representations of audio signals that allow for both very low bit rate audio data compression and high quality compressed domain processing and modiications. In this system, two compressed domain processing algorithms are available: timescale and pitch-scale modiications. Timescale modiications alter the playback speed of audio without changing the pitch. Similarly, pitch-scale modiications alter the pitch of the audio without changing the playback speed. The algorithms presented in this thesis segment the input audio signal into separate sinusoidal, transients, and noise signals. During attack-transient regions of the audio signal, the audio is modeled by transform coding techniques. During the remaining non-transient regions, the audio is modeled by a mixture of multiresolution sinusoidal modeling and noise modeling. Careful phase matching techniques at the time boundaries between the sines and transients allow for seamless transitions between the two representations. By separating the audio into three individual representations, each can be eeciently and perceptually quantized. In addition, by segmenting the audio into transient and non-transient regions, high quality timescale modiications that stretch only the non-transient portions are possible. v vi Acknowledgements First I would like to thank my principal advisor, Prof. Julius O. Smith III. In addition to being a seemingly all-knowing audio guy, our weekly meetings during my last year in school helped me out immensely by keeping me and my research focused and on track. If it were not for the academic freedom he gives me and the other CCRMA grad students, I would not have stumbled across this thesis topic. My next thanks goes out to Tony Verma, …