Miracle-dz/UniFAR-FTUs huggingface dataset:
Experimental comparison of substrate noise coupling using different wafer types

Measurements of substrate coupled noise in a mixed-signal test IC are presented. This IC was manufactured with different types of wafers, and noise levels measured in heavily-doped epi wafers are about three times larger than those obtained in lightly doped ones. It is determined that, due to package parasitics, noise at the supply lines will easily be the major contributor to substrate-coupled disturbances, both at the digital and at the analog ends. Supply lines interact with the substrate mainly through the substrate contacts of both of the circuit core and the ring of pads. The measurements contribute to establishing a list of priorities in the actions to reduce the noise that reaches the analog section.
Testosterone dose dependently prevents bone and muscle loss in rodents after spinal cord injury.

Abstract Androgen administration protects against musculoskeletal deficits in models of sex-steroid deficiency and injury/disuse. It remains unknown, however, whether testosterone prevents bone loss accompanying spinal cord injury (SCI), a condition that results in a near universal occurrence of osteoporosis. Our primary purpose was to determine whether testosterone-enanthate (TE) attenuates hindlimb bone loss in a rodent moderate/severe contusion SCI model. Forty (n=10/group), 14 week old male Sprague-Dawley rats were randomized to receive: (1) Sham surgery (T9 laminectomy), (2) moderate/severe (250 kdyne) SCI, (3) SCI+Low-dose TE (2.0 mg/week), or (4) SCI+High-dose TE (7.0 mg/week). Twenty-one days post-injury, SCI animals exhibited a 77–85% reduction in hindlimb cancellous bone volume at the distal femur (measured via μCT) and proximal tibia (measured via histomorphometry), characterized by a >70% reduction in trabecular number, 13–27% reduction in trabecular thickness, and increased trabecular separat.
Multi-clock driven system: a novel VLSI architecture

This paper presents an asynchronous solution for VLSI system design. A Clock Generator, which generates a series of clock signals to drive all parts of the whole system respectively, is regarded as a control center of the architecture. This kind of structure has several advantages such as low fan-out of clock signals, low power dissipation, and flexibility for different delay times. An application of this architecture is also presented in this paper.
An Algorithm for Solving Non-Linear Equations Based on the Secant Method

This paper describes a variant of the generalized secant method for solving simultaneous nonlinear equations. The method is of particular value in cases where the evaluation of the residuals for imputed values of the unknowns is tedious, or a good approximation to the solution and the Jacobian at the solution are available. Experiments are described comparing the method with the Newton-Raphson process. It is shown that for suitable problems the method is considerably superior.
Research on Semantic Processing for Internet of Things Based on Cloud Computing

Heterogeneous data produced by Internet of Things increased continually. Inconsistent semantics of data became obstacle of sharing data. To handle them effectively and intelligently, a semantic model for Internet of Things was proposed, which was based on semantic technology and cloud computing. Scalable distributed file system was the basis of storing mass data. Distributed inference engine, which was based on Map/Reduce operation model, had solved the problem of reasoning on mass ontology. Hierarchical semantic provided the basis of intelligent processing, which had reached consistent understanding between heterogeneous data. Global ontology laid emphasis on solving interoperation, local ontologies laid emphasis on personalized knowledge.
A new WDM protocol: architecture and performance analysis

In this paper we study a single-hop network for a passive star topology and suggest a multichannel control architecture (MCA). The proposed WDM network with an appropriate network interface unit (NIU) at each station gives the solution to the problem of the electronic processing bottleneck that the single common shared control channel for pretransmission coordination introduces (Pountourakis 19990. The novel concept of MCA and the distribution of control information over a number of control channels, in conjunction with a suitable NIU minimize the header processing requirement at each station (Pountourakis 1996). An analytic model is developed and analyzed for performance measures for a finite population. The effect of receiver collision is analyzed and the average rejection probabilities at the destination estimated.
The research and realization of full redundancy technology in LON monitoring and control network

The paper briefly describes the reliability measure of control network, and discusses the common methods of redundancy technology. The paper conducts the research of full redundancy architecture according to the features of LON system, gives the detailed redundancy realization method in each level. Finally, the paper analyses the usability of the method discussed in the context.
The investigation of the elliptic curve cryptology applies to the new generation protocol

We face threats from virus, hacker, electronic eavesdropper, and electronic deceiver in the network environment. The safety issue is truly important. The growth of the computer and network system make the organizations and personal users to depend on the information that circulate in these systems more and more. For the reason, we must protect the data and resources from leak and insure the reliability of data and information. Besides, the system can be protected well when it is suffered any attacks from networks. Not only people start to care about the network security level where they use credit cards to order they want but also they have the idea about the network security. [1] The most well-known and the most extensive applied public key cryptosystem RSA is submitted by Rivet, Shamir and Adelman [2]. Its safety is based on the difficulty of the factorization of big integer. The problem of factorization of big integer is a well-known difficult mathematical question. Up to now, less valid system is mentioned to solve the problem. Therefore, the algorithm of RSA can insure the safety. For the sake of the security of RSA, the bit of key is always in the advance. The more key length will cause the speed of encryption and decryption to decline. Besides, the hardware will become more and more difficult to be accepted. This phenomenon brings very heavy load for RSA applications. For proceeding the large number of safe transactions on E-Commerce also will encounter the same problems. In Elliptic Curve Cryptology, its bytes are less than RSA (Rivest-Shamir-Adleman). It can let computer performance and network transmission become good and fast. Although the next generation protocol modifies from IPv4 and applies to IPSEC, it is not perfect in network security. The unit of IP Security Protocol can't coexist with the unit of IPv6 protocol service when IPv6 packets pass IPv4 protocol and Network Address Transfer's field. For those weaknesses, one will discuss Elliptic Curve Cryptology how to translate in IPv6 protocol and compare the performance of Elliptic Curve Cryptology and RSA in IPv6 protocol.
A Review on the Various Recent Steganography A Review on the Various Recent Steganography A Review on the Various Recent Steganography A Review on the Various Recent Steganography Techniques

Security of the secret information has been a challenge when the large amount of data is exchanged on the internet. A secure transfer of information can be very much achieved by steganography and Cryptography. Steganography is a tool for hiding information inside an image. Cryptography is a tool which provides encryption techniques for secure communication. This paper presents a survey on various steganograpgy techniques along with other techniques used in the literature from 2003-2013. Several different techniques are mentioned with their benefits, limitations, year of publication and their authors. 65 papers were selected after content filtering out of more than 150 papers. LSB (least significant bits) technique was mostly used, while MSB (most significant bits) technique was very less used. There were also several other techniques used such as SSHDT, RSTEG, DCT, DWT, LWT etc. in various papers. Combined techniques of steganography and cryptography were also used in some papers. The survey results show that the steganogarph has played a very beneficial role in various applications. It increased the level of information security with a wide use of its techniques. It would be very useful and provide a better platform for the beginners who want to work in steganography. By analyzing the existing techniques more new techniques can be developed.
Classes of self-stabilizing protocols

Self-stabilization is an abstraction of fault tolerance for transient malfunctions. Intuitively, a self-stabilizing system is a system which can be started from any possible state. The authors here explore the possibility of transforming an arbitrary distributed protocol into a self-stabilizing one. It is proved that some conditions are sufficient for this transformation to be feasible. These conditions lead to a classification of distributed protocols according to the complexity for performing their transformation. <<ETX>>
Horizontal Well Placement Optimization in Gas Reservoirs Using Genetic Algorithms

Horizontal Well Placement Optimization in Gas Reservoirs Using Genetic Algorithms. (May 2010) Trevor Howard Gibbs, B.S., Stephen F. Austin State University Co-Chairs of Advisory Committee, Dr. Ding Zhu Dr. Hadi Nasrabadi Horizontal well placement determination within a reservoir is a significant and difficult step in the reservoir development process. Determining the optimal well location is a complex problem involving many factors including geological considerations, reservoir and fluid properties, economic costs, lateral direction, and technical ability. The most thorough approach to this problem is that of an exhaustive search, in which a simulation is run for every conceivable well position in the reservoir. Although thorough and accurate, this approach is typically not used in real world applications due to the time constraints from the excessive number of simulations. This project suggests the use of a genetic algorithm applied to the horizontal well placement problem in a gas reservoir to reduce the required number of simulations. This research aims to first determine if well placement optimization is even necessary in a gas reservoir, and if so, to determine the benefit of optimization. Performance of the genetic algorithm was analyzed through five different case scenarios, one involving a vertical iv well and four involving horizontal wells. The genetic algorithm approach is used to evaluate the effect of well placement in heterogeneous and anisotropic reservoirs on reservoir recovery. The wells are constrained by surface gas rate and bottom-hole pressure for each case. This project’s main new contribution is its application of using genetic algorithms to study the effect of well placement optimization in gas reservoirs. Two fundamental questions have been answered in this research. First, does well placement in a gas reservoir affect the reservoir performance? If so, what is an efficient method to find the optimal well location based on reservoir performance? The research provides evidence that well placement optimization is an important criterion during the reservoir development phase of a horizontal-well project in gas reservoirs, but it is less significant to vertical wells in a homogeneous reservoir. It is also shown that genetic algorithms are an extremely efficient and robust tool to find the optimal location.
Genetic analysis of mitochondrial protein targeting in Saccharomyces cerevisiae

Most proteins which are located in the mitochondria of eukaryotic cells are synthesized as precursors on cytoplasmic ribosomes, and are posttranslationally translocated across one or both mitochondrial membranes. The process of mitochondrial protein targeting is known to involve specific sequences which are usually located at the amino terminus of the mitochondrial precursor polypeptide. These presequences are thought to interact with cytoplasmic or mitochondrial components of the targeting machinery. The research presented in this thesis describes approaches to identify such targeting components. Intially, the precursor of the matrix-located flsubunit of the F 1 ATPase from the yeast Saccharomyces cerevisiae was expressed in Escherichia co/i and S. cerevisiae in an attempt to generate sufficient precursor protein for biochemical studies to allow the interaction between the precursor and components of the targeting machinery to be examined. In order to characterize a mitochondrial presequence, deletion mutations in the presequence of fl-subunit were constructed and their effect on targeting was examined. The deletion of amino acids 2 to 35 resulted in a reduction in targeting both in vitro and in vivo, whereas the deletion of amino acids 2 to 15 or 16 to 35 resulted in partial defects in either targeting or processing. The targeting defect caused by one of these smaller deletions (215) resulted in an unique phentoype when the yeast strain with this mutant protein was grown on glycerol as sole carbon source. In an attempt to identify components which interact with mitochondrial presequences, extragenic suppressor mutants were isolated which could suppress the growth defect of the 2-15 deletion. One mutation (mtsl) was isolated as a temperature-sensitive mutation in a nuclear gene. The cloning and sequencing of the wild-type MTS1 gene has revealed that it s a novel gene, and an open reading frame of 1250 nucleotides has been identified. The MTS1 gene is proposed to encode a protein of 48 kDa. Similarities between the MTS1 protein and known RNA-binding proteins suggest that it is an RNA-binding protein, and its possible role in the targeting pathway is discussed.
Dynamic voltage stability analysis of a single machine constant power load system

A dynamic voltage stability analysis of a single-machine constant-power-load system is presented. The system model includes only the machine voltage variables. A key factor in the analysis is the variation of the conditioning of the network Jacobian matrix with respect to the constant power load demand and the machine voltage source. It is shown that a dynamic instability phenomenon arises when the Jacobian matrix is ill-conditioned. The results presented include eigenvalue analysis, control parameter sensitivity analysis, and nonlinear voltage collapse simulations. <<ETX>>
Transfer report for Craig Eldershaw Motion Planning

Motion planning is a field of growing importance as more and more computer controlled vehicles are being used daily. While some work has been done in this area, much remains, especially in terms of practical efficiency. Complete algorithms exist which will solve virtually any motion planning problem—given sufficient time. Unfortunately the time required by these is often so large as to be quite impractical. This report discusses: what motion planning is about; what algorithms already exist; and what new ideas the author is planning to investigate over the next two years. These new ideas involve a number of quite new algorithms, both heuristic and exact. In some cases, the fine details of how the algorithms will eventually work have not yet been determined. For those, a broad outline of how they work and what advantages they might offer over existing methods has been given. While only touched upon in this report, future work fore-shadowed includes parallelisation of both these new algorithms and some existing ones. Throughout, the emphasis is placed upon the practical effectiveness of the algorithms when applied to real problems. Completeness, fully autonomous operation and the ability to work in highdimensional spaces is emphasised.
P2P Incentive Mechanism Based on Static Game of Incomplete Information

P2P network is autonomous of sharing file quickly and easily. In recent years, a large number of free-riding nodes and malicious nodes emerge in P2P network, which can’t provide services and have malicious damage to the network system, the result is significant declines of system performance and user satisfaction. In order to solve the problems, a P2P incentive mechanism based on static game of incomplete information is proposed in this paper. The new proposed mechanism has been analyzed and simulated with a series of tests. Experimental results show that the proposed P2P incentive mechanism can solve problem simply and effectively.
A new method of channel shortening with applications to discrete multi-tone (DMT) systems

A new procedure is proposed for solving the problem of channel shortening (a.k.a. the TEQ problem) for discrete multi tone (DMT) systems. Channel shortening is accomplished by using an multi-input-single-output (MISO) adaptive filter bank at the receiver. Each input represents a "logical path" from the transmitter to the receiver The "paths" are derived either via oversampling, or by using multiple analog to digital converters (A/Ds) with different sampling delays, or from A/Ds connected to different receive antennas (as may be the case in a wireless system). It is shown that for a finite order linear time invariant channel, it is always possible (provided certain conditions are met) to find a FIR filter bank combiner such that the effective length of the channel is no more than the cyclic prefix.
Analysis of Windows memory for forensic investigations

Containing most recently accessed data and information about the status of a computer system, physical memory is one of the best sources of digital evidence. This thesis presents new methods to analyze Windows physical memory of compromised computers for cyber forensics. The thesis includes three distinct contributions to cyber forensics investigation. Firstly, by digging into details of Windows memory management, forensically important information and data structures are identified. Secondly, we proposed different methods to find files and extract them out of memory in order to rebuild executable and data files. This helps investigators obtain valuable information available in executable or data files that have been in use at incident time. Thirdly, we presented two methods for extraction of forensically sensitive information such as usernames or passwords from memory. The first method is based on fingerprints of applications in memory. In the second method, we have been able to locate and extract arguments used in function calls. This method, leads to the acquisition of important and forensically sensitive information from the memory stack. Finally, to bring these contributions to application level, a framework for cyber forensics investigations has been developed that helps finding sensitive information
My Technique is 20% Faster: Problems with Reports of Speed Improvements in HCI

In human-computer interaction (HCI), speed improvements are often used as an informal measure of effect size, with statements such as "technique A was about 20% faster than technique B". Such statements are however surrounded by confusion. A quick analysis of the literature reveals that half of the time, the term "% faster" actually refers to a percent change in task completion time, while one third of the time it correctly refers to a percent change in speed. The rest of the time, the meaning is unknown or the calculation is wrong. We explain why percent changes are inherently confusing, and propose to focus effect size discussions on ratios, or on measures of percent difference where the normalizer is the mean of the compared values. When percent changes need to be reported, it is suggested to focus the discussion on improvements in task completion times rather than speed.
Defense against SYN-flooding Attacks by Using Game Theory

Connection Management phase of TCP is susceptible to a classic attack that is called SYN-flooding. In this attack, source sends many SYN packets to the victim computer, but does not complete three-way handshaking algorithms. This quickly consumes the resources allocated for communication in the under attack system and hence prevents it from serving other connection requests. This attack causes the victim host to populate its backlog queue with forged TCP connections. In other words it increases the number of legal connections rejected due to limited buffer space. In this paper, the under attack system are modeled by using queuing theory and then a game theoretic approach is employed to defend against SYNflooding attacks. The simulation results show that the proposed defense mechanism improves performance of the under attack system in terms of the ration of blocked connections and the buffer space occupied by attack requests.
Big Data Analysis using R and Hadoop

The way Big data - heavy volume, highly volatile, vast variety and complex data - has entered our lives, it is becoming day by day difficult to manage and gain business advantages out of it. This paper describes as what big data is, how to process it by applying some tools and techniques so as to analyze, visualize and predict the future trend of the market. The tools and techniques described in this paper using the best of R language which is the future of the statistics and the Hadoop which is a parallel processing for the data so as to get a blend of best data model being processed over Big data parallelly. The integration of R and Hadoop give us the brand new environment where in R code can be written and deployed in Hadoop without any data movement. Using R and Hadoop helps organization to resolve the scalability, issues and solve their predictive analysis with high performance. You can have a much better deep dive over the big data when combined R and Hadoop.
Exposing Forgeries and IPT Construction using Faces from Image

Images are powerful tool for communication, after images are posted on internet, other users can copy resize and re-encode them and then repost their version by generating similar but not identical copies due to availability of powerful digital image editing software. The main task is to find out original image between near duplicate image is difficult. It is difficult to adjust the illumination condition when Image composition or splicing operation performed on image to create composite image. Due to these illumination inconsistencies gives clue to detect forgery. But method that operate on illuminant color affected by material in the scene so further improvement can be achieved by advanced illuminant estimator as skin color of the faces automatically detected in the image. Machine learning approach is used for forgery detection and technique is applicable to images containing two or more people. Physics and statistical based illuminant estimators are applied on image. For all face region texture and gradient based feature are extracted and provided to machine learning approach for automated decision making. After classification of image whether it is forensic or normal, relationship within faces of image is shown by Image Phylogeny Tree (IPT) which is constructed by calculating paired distance feature of faces from image.