Miracle-dz/UniFAR-FTUs huggingface dataset:
Linear Control of Switching Valve in Vehicle Hydraulic Control Unit Based on Sensorless Solenoid Position Estimation

Accurate linear brake-pressure control in a hydraulic control unit (HCU) of the vehicle dynamics control system, such as the electronic-stability control (ESC) system, can improve the control performance while significantly reduce noise and brake paddle vibration during the transient high-frequency brake-pressure control process. To minimize system cost, only simple switching solenoid valves and a master cylinder pressure (MCP) sensor are used in the ESC, thus an accurate real-time sensorless spool-position estimation is the key to the linear pressure controller. In this paper, a new sliding-mode controller (SMC) integrated with a nonlinear sliding-mode observer (SMO) is proposed to achieve a real-time linear controller for the switching valve in the HCU. First, a nonlinear SMO is used to observe the spool position based on the voltage and current values of the solenoid coil, from which the flow rate of brake fluid in the HCU of the ESC and the wheel cylinder pressure (WCP) can be deduced based on a specific hydraulic model of the solenoid valve and the braking system. Then an SMC is employed to adjust the spool position for accurate linear pressure control, taking into consideration the nonlinear characteristics of the electromagnetic force, the dynamic flow force, and the flow rate of the solenoid valve at different openings. Simulations and experiments were conducted, and the results supported the tracking ability of the sensorless linear pressure controller in different conditions. This study may provide a useful method to realize real-time linear control of high-frequency switching valve comparable to a high-performance proportional valve.
Robust interference suppression using a new LMS-based adaptive beamforming algorithm

This paper introduces a robust variable step size NLMS algorithm to improve interference suppression in smart antenna system. This algorithm is able to resolve signals arriving from narrowband sources propagating plane waves close to the array endfire. The results of the fixed step size NLMS will result in a trade-off issue between convergence rate and steady-state MSE of NLMS algorithm. This issue is solved by changing the step size from constant to variable. The proposed VSSNLMS algorithm reduces the mean square error (MSE) and shows faster convergence rate when compared to the conventional NLMS. Moreover, the enhanced performance of the new VSSNLMS algorithm is validated from the output beam pattern which introduces deeper nulls to mitigate the effect of interfering signals.
Design and Power Performance Evaluation of On-Chip Memory Processor with Arithmetic Accelerators

In this paper, we design an on-chip memory processor with arithmetic accelerators, which are expected to improve power consumption. In addition, we evaluate the power performance of the processor. We propose implementing vector-type arithmetic accelerators and SIMD-type arithmetic accelerators in the on-chip memory processor. The evaluation results obtained using our simulator indicate that the performance of the 4FMAs SIMD-type accelerators is similar to that of the 4FMAs vector-type accelerators on DAXPY, Livermore kernel 1 and 3. However, the performance of the 4FMAs vector-type accelerator exceeds that of the 4FMAs SIMD-type accelerator with respect to matrix multiplication and QCD because of difference in element size of the registers. On Livermore kernel 7, the power performance of the 4FMAs SIMD-type accelerators exceeds that of the 4FMAs vector-type because of register reuse. However, the 16FMAs vector-type accelerators have an advantage in almost all simulations, excluding main memory bandwidth intensive benchmarks.
SPECTROSCOPY OF LUMINOUS z > 7 GALAXY CANDIDATES AND SOURCES OF CONTAMINATION IN z > 7 GALAXY SEARCHES

We present three bright z+-dropout candidates selected from deep near-infrared (NIR) imaging of the COSMOS 2 deg2 field. All three objects match the 0.8–8 μm colors of other published z > 7 candidates but are 3 mag brighter, facilitating further study. Deep spectroscopy of two of the candidates covering 0.64–1.02 μm with Keck-DEIMOS and all three covering 0.94–1.10 μm and 1.52–1.80 μm with Keck-NIRSPEC detects weak spectral features tentatively identified as Lyα at z = 6.95 and z = 7.69 in two of the objects. The third object is placed at z ∼ 1.6 based on a 24 μm and weak optical detection. A comparison with the spectral energy distributions of known z < 7 galaxies, including objects with strong spectral lines, large extinction, and large systematic uncertainties in the photometry, yields no objects with similar colors. However, the λ > 1 μm properties of all three objects can be matched to optically detected sources with photometric redshifts at z ∼ 1.8, so the non-detection in the i+ and z+ bands is the primary factor which favors a z > 7 solution. If any of these objects are at z ∼ 7, the bright end of the luminosity function is significantly higher at z > 7 than suggested by previous studies, but consistent within the statistical uncertainty and the dark matter halo distribution. If these objects are at low redshift, the Lyman break selection must be contaminated by a previously unknown population of low-redshift objects with very strong breaks in their broadband spectral energy distributions and blue NIR colors. The implications of this result on luminosity function evolution at high redshift are discussed. We show that the primary limitation of z > 7 galaxy searches with broad filters is the depth of the available optical data.
Peak bitrate reduction for multi-party video conferencing using SHVC

Real-time video applications, such as multi party video conferencing, involve the simultaneous transport of multiple and potentially multi-layered video sources to participating or interested parties. It is desirable to mix these multiple source videos into a single video stream at intermediary nodes in the network, e.g. at Multipoint Control Units (MCU). This has the advantage of reduced application and transport complexity on the client device while allowing single hardware decoder devices to consume the content. This paper proposes a solution, which uses the scalable extension of H.265/HEVC (SHVC), and that generates a single bitstream out of several sources by a low-complexity operation. In addition, the presented technique drastically reduces the peak bitrate at layout change events in comparison to state-of-the-art solutions.
ELECTROPLATING MECHANISM OF NANOSTRUCTURED BLACK Ni FILMS

Nanocrystalline black nickel film has been obtained from a modified Watt bath by using DC (direct current) electroplating method, and characterized by using SEM and XRD. Meanwhile, the initial electroplating behavior of the nanocrystalline black Ni film was investigated using cyclic voltammetry (CV) and electrochemical impedance spectroscopy (EIS). The results showed that the black Ni film is substantially smooth and bright, and consists of particles with the mean size 51.4 nm. The deposition of black Ni film followed the mechanism of three-dimensional (3D) nucleation and subsequent grain growth. With the increase of the negative potential bias, the main deposition process of black Ni film onto brass changed from the under-potential deposition (UPD) through heterogeneous finally to homogeneous nucleation/growth, which consequently resulted in the initial increase and sub- sequently decrease of charge-transfer-resistance (R_t). At the high negative bias, the occurrence of the low and the ultra-low frequency inductive loops on EIS plots, can be attributed to the adsorptions of hydrogen atoms and the nickel hydroxyl compound onto cathode surface, which retarded the nucleation/growth process of nickel.
Common rate maximization in cooperative multiple access channels

In this paper, we study the optimal power allocations in cooperative multiple access channels (CMACs), where we aim at maximizing the rate achievable by both sources simultaneously rather than the sum of achievable rates. Separating our study between the coherent and non-coherent case, we obtain closed-form expressions for the optimal power allocations w.r. t. the outer bounds of the capacity region, as well as decode-and-forward and non-cooperative inner bounds.We point out during our resolution that the general CMAC model behaves as a multiple access relay channel (MARC), where a “virtual” relay node is introduced to represent the cooperation between the sources. This equivalent model simplifies the original power allocation problem. We finally show that the general cut-set outer bound on the capacity region of the equivalent MARC matches exactly the tightest known outer bound on the capacity region of the original CMAC.
A view-based deformation tool-kit, Master's Thesis, August 2006

Camera manipulation is a hard problem since a graphics camera is defined by specifying 11 independent parameters. Manipulating such a high-dimensional space to accomplish specific tasks is difficult and requires a certain amount of expertise. We present an intuitive interface that allows novice users to perform camera operations in terms of the change they want see in the image. In addition to developing a natural means for camera interaction, our system also includes a novel interface for viewing and organizing previously saved views. When exploring complex 3D data-sets a single view is not sufficient. Instead, a composite view built from multiple views may be more useful. While changing a single camera is hard enough, manipulating several cameras in a single scene is still harder. In this thesis, we also present a framework for creating composite views and an interface that allows users to manipulate such views in real-time. Type of Report: Other Department of Computer Science & Engineering Washington University in St. Louis Campus Box 1045 St. Louis, MO 63130 ph: (314) 935-6160 WASHINGTON UNIVERSITY THE HENRY EDWIN SEVER GRADUATE SCHOOL DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING A THESIS ON A VIEW-BASED DEFORMATION TOOL-KIT by Nisha Sudarsanam , Bachelor Of Engineering, Computer Engineering Prepared under the direction of Professor Cindy M Grimm A thesis presented to the Henry Edwin Sever Graduate School of Washington University in partial fulfillment of the requirements for the degree of MASTER OF SCIENCE August 2006 Saint Louis, Missouri WASHINGTON UNIVERSITY THE HENRY EDWIN SEVER GRADUATE SCHOOL DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
An Algorithm for Detecting Noise on Supervised Classification

this paper, we introduce, a new algorithm, QcleanNoise, for detecting noisy instances. The effects of the algorithm in three supervised classifiers: LDA, KNN and RPART, a decision tree classifier, are discussed. Comparison with other procedures is carry out on four well known Machine Learning datasets. The experimental results shows that our algorithm performs better than current procedures detecting efficiently noisy instances using less computational time.
Fast Manifold-Ranking for Content-Based Image Retrieval

Manifold-Ranking (MR) has been successfully used in Content-Based Image Retrieval (CBIR) in recent years. However, the straightforward implementations of MR do not scale for large image database, requiring either quadratic space and cubic pre-computation time, or slow response time on queries. We propose fast solutions to this problem, which exploit two important properties shared by many real graphs, i.e. linear correlations and block-wise community-like structure. We exploit the linearity by using low-rank matrix approximation and the community structure by graph partitioning, which is followed by the Sherman-Morrison lemma for matrix inversion. Experimental results on the Corel image demonstrate that our proposed methods achieve significant savings over the straightforward implementations, which show the effectiveness of our approach.
Discriminative Semi-Supervised Feature Selection Via Manifold Regularization

Feature selection has attracted a huge amount of interest in both research and application communities of data mining. We consider the problem of semi-supervised feature selection, where we are given a small amount of labeled examples and a large amount of unlabeled examples. Since a small number of labeled samples are usually insufficient for identifying the relevant features, the critical problem arising from semi-supervised feature selection is how to take advantage of the information underneath the unlabeled data. To address this problem, we propose a novel discriminative semi-supervised feature selection method based on the idea of manifold regularization. The proposed approach selects features through maximizing the classification margin between different classes and simultaneously exploiting the geometry of the probability distribution that generates both labeled and unlabeled data. In comparison with previous semi-supervised feature selection algorithms, our proposed semi-supervised feature selection method is an embedded feature selection method and is able to find more discriminative features. We formulate the proposed feature selection method into a convex-concave optimization problem, where the saddle point corresponds to the optimal solution. To find the optimal solution, the level method, a fairly recent optimization method, is employed. We also present a theoretic proof of the convergence rate for the application of the level method to our problem. Empirical evaluation on several benchmark data sets demonstrates the effectiveness of the proposed semi-supervised feature selection method.
Illumination morphing: smooth transition of luminance distributions between two images

The paper proposes a method for generating a sequence of images with smooth transition of luminance distributions from two input images with different lighting conditions. The idea of the proposed method is based on image morphing. A conventional image morphing changes object shapes between two input images. We focus on changing the illumination between two images. The proposed method uses isoluminance curves as a feature primitive. Isoluminance curves acquired from images are warped based on the correspondence of the curves between two images, and transformed luminance distributions are generated from the warped isoluminance curves. The proposed method called "illumination morphing" is able to generate smooth transition of luminance between two images, and is a promising technique for many applications requiring a scene with variety of lighting effects, such as movies, TV games, and so on.
Unsupervised region of intrest detection using fast and surf

The determination of Region-of-Interest has been recognised as an important means by which unimportant image content can be identified and excluded during image compression or image modelling, however existing Region-of-Interest detection methods are computationally expensive thus are mostly unsuitable for managing large number of images and the compression of images especially for real-time video applications. This paper therefore proposes an unsupervised algorithm that takes advantage of the high computation speed being offered by Speeded-Up Robust Features (SURF) and Features from Accelerated Segment Test (FAST) to achieve fast and efficient Region-of-Interest detection.
Monolithic-integrated silicon bulk-micromachined accelerometer and pressure-sensor for tire-pressure-monitoring-system (TPMS) application

A single-sided micromachined TPMS sensor is proposed and fabricated for automobiles, which is with a piezoresistive pressure sensor and a cantilever-mass piezoresistive accelerometer monolithically integrated in a 1.6mm×1.5mm sized (111) silicon chip. Single-wafer-based front-side silicon micromachining and metal electroplating technologies are employed to fabricate the device. Specially designed releasing trenches along &#60;111> orientation are constructed to form the hexagonal pressure-sensitive diaphragm and the post-sealed vacuum reference-cavity. The fabrication of the accelerometer is also based on a hexagonal diaphragm that is latterly cut into suspended cantilevers and seismic-mass. Fabricated with the low-cost front-side micromachining technique, the small-sized TPMS sensors are promising in practical applications and volume production.
Non-Cooperative Transmission Game in Wireless Networks with Multipacket Reception and Packet Priority

We consider the uplink of random access multipacket reception wireless sensor networks where packets may have different priorities. Each sensor aims to optimize its transmission policy, which maps instantaneous channel states and packet priorities to transmit probabilities, to maximize its individual reward. The problem is formulated as a non-cooperative game. We show that the optimal transmission policies have a special structure: given a packet priority, it is optimal for a sensor to transmit with certainty if its channel state is beyond a certain threshold and not to transmit otherwise. We prove that there exists a Nash equilibrium profile at which every sensor deploys a transmission policy of this structure. A convergent stochastic approximation algorithm is proposed for estimating the best response transmission policy for any sensor. The theoretical results and the performance of the proposed algorithm are illustrated via numerical examples.
Tricodes: A Barcode-Like Fiducial Design for Augmented Reality Media

Visual markers, or fiducials, have become one of the most common methods of camera pose estimation in augmented reality (AR) media. Many present day fiducial-based AR systems use arbitrary patterns, such as simple line drawings or alpha-numeric characters, and require that an application be "trained" to recognize its pattern set. These techniques work well on a small scale, but as the number of fiducials grows, accuracy and performance degrade. We describe a new fiducial design called TriCodes that, like a barcode, provides a systematic way of printing and identifying a vast library of patterns. We compare TriCodes to the popular ARToolkit package, demonstrating its advantages in the presence of large numbers of fiducials
Adenosine 3 ' , 5 '-Cyclic-Monophosphate-Dependent Regulation of « i-Adrenergic Receptor Number in Rabbit Aortic Smooth Muscle Cells

The purpose of this study was to determine whether a cyclic adenosine 3',5'monophosphate-dependent process can be involved in the regulation of vascular smooth muscle ai-adrenergic receptor responsiveness. Experiments were performed in cultured rabbit aortic smooth muscle cells which were characterized previously according to a-adrenergic receptorbinding characteristics and receptor-coupled norepinephrine-stimulated Ca efflux. The addition of dibutyryl-cyclic adenosine monophosphate to the cell culture medium for 24 hours resulted in a concentration-related decrease in maximal [H]prazosin-binding capacity (41 ± 4% decrease with 1 mM dibutyryl-cyclic adenosine monophosphate) without an effect on [H]prazosin-binding affinity. Prostaglandin Ei (10 HM) and forskolin (10 /IM) caused similar decreases in maximal [H]prazosin-binding capacity, whereas butyrate (1 ITIM) and dibutyryl-guanosine-3',5' cyclicmonophosphate (1 ITIM) had no effect. Dibutyryl-cyclic adenosine monophosphate (1 ITIM) caused significant potentiation of the decrease in [H]prazosin-binding caused by a submaximal (10 riM) but not a maximal (10 MM) concentration of norepinephrine, suggesting that cyclic adenosine monophosphate may act at a distal step in common with norepinephrine to reduce a-adrenergic receptor number. Despite the approximately 41% reduction in a-adrenergic receptor number following 24-hour incubation of cells with dibutvryl-cyclic adenosine monophosphate, maximal norepinephrine-stimulated Ca efflux was not reduced, consistent with the markedly nonlinear relationship between a-adrenergic receptor occupancy and maximal norepinephrine-stimulated Ca efflux in this cell system. These data provide evidence for a novel mechanism by which hormones or drugs which increase cyclic adenosine monophosphate levels can modulate aadrenergk responsiveness in vascular smooth muscle. (Circ Res 58: 292-297, 1986)
Analysis of Web Usage Patterns in Consideration of Various Contextual Factors

It is important to analyze user's Web usage logs for developing personalized Web services. However, there are several inherent difficulties in analyzing usage logs because the kinds of available logs are very limited and the logs show uncertain patterns due to the influences of various contextual factors. Therefore, speculating that it is necessary to find what contextual factors exert influences on the usage logs prior to designing personalized services, we conducted several experiments in-series not only in situations of performing designed tasks during short time periods but also in users' natural Web environments during a period of several days. From the results of our experiments, we found that interest levels, credibility levels, page types, task types, and languages are influential contextual factors in a natural Web environment. Moreover, some historical and experiential patterns that could not be observed in short time analysis were discovered in the results of long time analysis. These findings will be useful for other researchers, practitioners, and especially for developers of adaptive personalization services.
PersonalRAID: Mobile Storage for Distributed and Disconnected Computers

This paper presents the design and implementation of a mobile storage system called a Personal-RAID. PersonalRAID manages a number of disconnected storage devices. At the heart of a Personal-RAID system is a mobile storage device that transparently propagates data to ensure eventual consistency. Using this mobile device, a PersonalRAID provides the abstraction of a single coherent storage name space that is available everywhere, and it ensures reliability by maintaining data redundancy on a number of storage devices. One central aspect of the PersonalRAID design is that the entire storage system consists solely of a collection of storage logs; the log-structured design not only provides an efficient means for update propagation, but also allows efficient direct I/O accesses to the logs without incurring unnecessary log replay delays. The PersonalRAID prototype demonstrates that the system provides the desired transparency and reliability functionalities without imposing any serious performance penalty on a mobile storage user.
Anticancer patent landscape and technology assessment of Indian public-funded research institutes and organizations

Introduction: This review discusses the various drug therapeutic targets and latest technologies of anticancer patents from 10 Indian public-funded research organizations covering more than 150 esteemed institutes. We have identified and reported the leading assignee and inventors along with their collaboration network and, thereby, have analyzed the various patent trends, geographical distributions, citation maps, Derwent World Patents Index, international patent classification analysis and the like. Areas covered: This article provides the insights of 1905 patent documents from 191 families and discusses in-depth anticancer technology through categorization studies at the level of drug discovery, drug development and treatment and diagnosis. In addition, various cancer targets were correlated with recent technologies so as to identify the white spaces for upcoming technologies. Expert opinion: Over a period of 13 years (1990 – 2013) the main focus of Indian cancer research was in the field of synthetic chemistry and natural extracts followed by the pharmaceutical compositions and combinations, whereas, the white spaces for future cancer remedy were identified from research in the areas of cancer stem cell lines, vaccines, gene therapy, nano formulations with targeted drug delivery systems as core and latest technologies.