Miracle-dz/UniFAR-FTUs huggingface dataset:
Integrated programmable neurostimulator to recuperate the bladder functions

Electrical neurostimulation has been used intensively to recuperate the bladder functions. Available techniques do not allow the adequate voiding due to the dyssynergia between the bladder and the sphincter. We proposed a new integrated stimulator designed to allow the recuperation of the bladder functions. The stimulation system, which is an integrated version of a previously proposed stimulator made by our research team, has been extended with some new functionalities. It performs flexible selective stimulations for bladder voiding, a continuous stimulation for suppression of the bladder hyperreflexia and includes a measurement technique to monitor the electrodes-nerve contact allowing the detection of any variation of the nerve impedance or breaking of the electrodes. The stimulation parameters (amplitude, width, frequency) are sent wirelessly by an external controller and are stored in a RAM. An on-chip calibration circuitry provides an efficient and reliable stimulation technique and a voltage regulator supplies the power for the digital core. The modular architecture of the design makes the device an expandable multichannel stimulation system. The stimulator has been designed in the CMOS 0.18 /spl mu/m technology and can supply up to 3 mA in a 1 k/spl Omega/ resistive load. It is a complete and efficient stimulation system using fully programmable parameters allowing the recuperation of the bladder functions.
On the Limits of Processor Specialisation by Mapping Dataflow Sections on Ad-hoc Functional Units

Many available systems-on-chip embedded processors can be specialised for a given applicationdomain by adding ad-hoc functional units. These functional units can be used to map clusters of elementary arithmetic or logic operations (sections of the dataflow graph); more complex hardware add-ons could attack the control flow (e.g., map loops onto sequential functional units). For automatic processor specialisation, the two strategies imply different methods and have a different complexity. Before incurring in the complexities of control flow, this paper attacks the question that appears so far unanswered: how much can one improve the performance of an embedded processor on specific algorithms by automatically mapping only dataflow sections of code on special functional units? The basic scope for performance improvement is assessed and broken out in different sources: hardware parallelism; avoided quantisation of instructions in an integral number of cycles; and simplification of the logic due to constants. The scope for speedup is increased through additional manual optimisations (amenable to automation): bit-width analysis and arithmetic optimisation. Finally, ILP techniques such as loop unrolling and predication are used to increase the size of the basic blocks and give more scope for the sources of improvement. The results show that significant improvements in speed (up to 6 times) can be targeted without necessarily mapping the control flow onto hardware.
Organoboranes in organic synthesis: IX. Carbonylation products of organoboranes derived from myrcene

Abstract Myrcene and thexylborane react in the ratio 2 3 to give a mixture of two boranes, only one of which is carbonylated with cyanide/trifluoroacetic anhydride, followed by oxidation, to give 3-hydroxymethyl-6-isopropyl-2-methylcyclohexanone (A). The positions of hydroboration are established by synthesis of the hydroboration/oxidation products. The cyanidation of the organoboranes derived from myrcene and diborane leads to a 2 3 mixture of A and 5-(2′-hydroxyethyl)-2-isopropylcyclohexanone, the structures of which are established by independent synthesis. The hydroboration of myrcene is shown to be relatively non-stereospecific.
Research on the Iterative Stopping Criterion Based on Linear Turbo Equalization

Although turbo equalization has superior performance, the data processing delay produced by large iterations has become its major drawback for real-time situations. Based on the MMSE criterion, the normal-probability-plot (NPP) of linear equalizer’s extrinsic information is studied in this paper, with the conclusion of the extrinsic information’s approximate Gaussian distribution obtained. In various conditions, the iterative number can be controlled dynamically based on the extrinsic information statistics. The simulation results approves that the technique is able to make delay dwindle largely with small performance degradation.
Design issues of optical IP routers for Internet backbone applications

The rapid increase of Internet traffic is pushing the deployment of WDM technology in the next-generation high-speed Internet backbone. Routers in the backbone could still be the potential bottleneck. In this article we consider some design issues of high-throughput optical routers which combine the advantages of WDM with the new optical switching technology. We first introduce a proposed Internet architecture based on the optical burst switching mechanism. Some important design issues in optical buffering and control function are addressed which are expected to have significant effects on router performance. Numerical results of a simulation study are also presented along with discussions.
Computation Platform of SPT Dynamic Characteristics Based on Simulink

In order to study the low frequency oscillations in a stationary plasma thruster (SPT), a two-dimensional hydrodynamic model of the atom and ion dynamics in an SPT is constructed. At the same time, a new simulation technic using Matlab Simulink is developed to simulate the performance both in space and time dimension. The dynamic simulation of SPT can be made by establishing the dynamic model in Simulink using difference scheme. The scheme is continuous in time and discrete in space. Initializing the parameters of the system, using the stiff arithmetic ode23t with alterative time steps which can accelerate the simulation speed, ultimately the dynamic simulation can be implemented. This process of simulation provides reasonable estimates of the plasma properties and is able to give a clear picture of the low frequency oscillations, qualitatively close to the experimental observations. The simulation results show that the Simulink method is an effective way to simulate the dynamic characteristics of SPT.Copyright © 2004 by ASME
An expert neural network system for dynamic job shop scheduling

The objective of this research is to apply the neural network approach to the dynamic job shop scheduling problem. A feed-forward back propagation neural network is designed and trained to recognize the individual contributions of traditional dispatch rules. The network is incorporated into an expert system which activates the network according to the prevailing shop environment. The effectiveness of the approach is compared with the traditional dispatch rule approach as well as a composite rule expert system. Results of scheduling with a neural network show that the network is able to perform well against its component factors for job lots with varying arrival rates.
Fast Low Voltage Analog Four-Quadrant Multipliers Based on CMOS Inverters

—The paper presents quarter-square analog four-quadrant multipliers, based on proprietary architecture using four CMOS inverters. The most important upgrade on already published own circuit implementation is the use of the same inverter ”core” of the circuit with completely redesigned auxiliary and steering blocks. Two variants of new driving peripherals are considered: one with differential pair, the second with CMOS inverters. The proposed circuit solutions are suitable for RF applications in communication systems due to simple architecture comprising building blocks with RF CMOS transistors having sufﬁciently large biasing currents. Postlayout simulation results done on the basis of 180nm CMOS UMC Foundry Design Kit are also presented.
Design Considerations for Reliable Data Transmission and Network Separation

To tackle such problems as low security, inefficiency and high cost in traditional data transmission between different security domains, this paper discussed the basic design decisions that form the first step one should consider, especially for creating a design with the advantage of high-efficiency and low-cost optical devices. It first explored the design issues of software and hardware systems with the application of various network separation systems. It then described the reliability features with regard to error detection and data integration, and the mechanism of the newly defined protocol structure. At last, it outlined the key design points for the system implement and measurement.
Robot Path Optimization Based on a Reference Model and Sigmoid Functions

The purpose of this study is to minimize the arc length for the path described by the model of a robot platform when the path is constrained to have smooth transitions given by sigmoid functions. The optimization required a proof of stability for the resulting control law, the selection of the best sigmoid function among ten functions, and the definition of two gains necessary to parameterize the control law. The optimization was carried out by simulating the system under several kinematic and dynamical conditions, and the best sigmoid function was a hyperbolic tangent. Thus, the motion control first implied the simulation of a reference model to define an optimal path, and later the control of an actual robot platform, which followed the optimal path. The use of the optimized path reduced the complexity of the controller while allowing natural and intuitive paths for the robot platform.
Scene classification using low-level feature and intermediate feature

This paper presents a novel scene classification method using low-level feature and intermediate feature. The purpose of the proposed method is to improve the performance of scene classification and reduce the labeled data required using the complementary information between low-level and intermediate feature. The proposed method uses the co-training algorithm to classify scenes, in which the low-level feature and intermediate feature are two views of co-training algorithm. For low-level feature, Block Based Gabor Texture (BBGT) feature is extracted to describe the texture property of images incorporating the spatial layout information. For intermediate feature, Bag Of Word (BOW) feature is extracted to describe the distribution of local semantic concepts in images based on quantized local descriptors. Experiment results show that this proposed method has satisfactory classification performances on a large set of 13 categories of complex scenes.
The non-topographical uses of photogrammetry

While the simplest method of measurement is always to be preferred, under special circumstances the very indirect method of photogrammetry may have advantages outweighing its difficulties; ever since the invention of photography there have been attempts to make use of these advantages. The difficulties of non-topographical photogrammetry are chiefly photographic. An Appendix sets out the principal photographic equipment at present manufactured for non-topographical work. In view of the inflexibility and extreme expense of some of this equipment an argument is made for the use of both “ordinary” cameras and numerical methods. This argument presupposes a suitable means of camera calibration. The paper attempts to give a general, descriptive introduction to a subject which has had little practice in Australia. It is hoped that an extensive, but by no means exhaustive, Bibliography will assist the interested reader.
Simulation Controlled Seamless Phase II/III Clinical Trials

Clinical trials have become a standard part of modern medicine, creating great interest in the field of adaptive clinical trials. The goal of adaptive trials is greater efficiency in the use of patients and time, higher probability of demonstrating treatment effect, and more informative trials. This paper focuses on seamless phase II/III trials, an adaptive trial consisting of two stages: the first stage compares multiple treatment arms to a control and determines the appropriate arm, and the second stage undertakes a more traditional comparison of this arm to a control arm. The data from both stages is used in analysis of the treatment, with the goal of more power than two separate trials where data is not shared. This paper begins with a discussion of an established method of analyzing seamless trials, referred to as the Posch method. Proofs are presented that conclude that the Posch method has analytical control over type one error. This paper also introduces a new method of analyzing seamless trials called the simulation method. This simulation method relies on simulation of clinical trials under the null hypothesis to find critical values that control type one error. This paper includes a model of the simulation method as a first step in a potential proof that the simulation method has analytical control over type one error. Power comparisons between the Posch method, the simulation method, and two separate trials conclude that seamless trials are more powerful than
Teaching Techniques and Computerized Simulation in Early Childhood Classrooms

In this study we investigated whether the “Teaching Techniques” component of a computerized simulation influenced choice of anticipated strategies for implementation before four weeks of field experience; and what methods appeared to have sustaining effects for future use. Chi-square, Somers'd, Gamma, Correlation, and Regression were used to analyze the data. As a result, significant differences were found with Somers'd test (d = .343, p < .071), Gamma (.509, p < .071), Pearson's R (.501, p < .018), Spearman (.399. p < .066), and regression analysis (b = .468, p < .018). The regression model explained 25.1% of overall variation in the dependent variable (R2 = .251). Results indicate that preservice early childhood teachers who were exposed to a computerized simulation about teaching techniques before field experience tend to have a more positive perception relative to choice of appropriate techniques within actual classroom settings; and make decisions for potential techniques appropriate to employ in their future teaching practice. Qualitative analysis showed how these subjects used the computer simulation to change their self-perceptions and how the field experience influenced their perceptions on teaching techniques.
Multi-Threshold Algorithm Based on Havrda and Charvat Entropy for Edge Detection in Satellite Grayscale Images

Automatic edge detection of an image is considered a type of crucial information that can be extracted by applying detectors with different techniques. It is a main tool in pattern recognition, image segmentation, and scene analysis. This paper introduces an edge-detection algorithm, which generates multi-threshold values. It is based on non-Shannon measures such as Havrda & Charvat’s entropy, which is commonly used in gray level image analysis in many types of images such as satellite grayscale images. The proposed edge detection performance is compared to the previous classic methods, such as Roberts, Prewitt, and Sobel methods. Numerical results underline the robustness of the presented approach and different applications are shown.
An Error Estimates for Convection Dominated Diffusion Problems

In classical mixed finite element method, the choice of the finite element approximating spaces is restricted by the imposition of the LBB consistency condition. The method of H1- Galerkin mixed finite element method avoids completely the imposition of such a condition on the approximating spaces. In this article, we discuss and analyze error estimates for Convection- dominated diffusion problems using H1-Galerkin mixed finite element method, along with the method of characteristics. Optimal order of convergence has been achieved for the error estimates of a single-step Euler backward difference scheme. Keywords. H1- Galerkin mixed finite element method, Characteristics method, LBB condition, optimal error estimates, and Euler backward difference scheme.
Heuristic Synthesis of Reversible Logic – A Comparative Study

Reversible logic circuits have been historically motivated by theoretical research in low-power, and recently attracted interest as components of the quantum algorithm, optical computing and nanotechnology. However due to the intrinsic property of reversible logic, traditional irreversible logic design and synthesis methods cannot be carried out. Thus a new set of algorithms are developed correctly to synthesize reversible logic circuit. This paper presents a comprehensive literature review with comparative study on heuristic based reversible logic synthesis. It reviews a range of heuristic based reversible logic synthesis techniques reported by researchers (BDD-based, cycle-based, search-based, non-search-based, rule-based, transformation-based, and ESOP-based). All techniques are described in detail and summarized in a table based on their features, limitation, library used and their consideration metric. Benchmark comparison of gate count and quantum cost are analysed for each synthesis technique. Comparing the synthesis algorithm outputs over the years, it can be observed that different approach has been used for the synthesis of reversible circuit. However, the improvements are not significant. Quantum cost and gate count has improved over the years, but arguments and debates are still on certain issues such as the issue of garbage outputs that remain the same. This paper provides the information of all heuristic based synthesis of reversible logic method proposed over the years. All techniques are explained in detail and thus informative for new reversible logic researchers and bridging the knowledge gap in this area.
Intermediate grouping on remotely sensed data using Gestalt algebra

Human observers often achieve striking recognition performance on remotely sensed data unmatched by machine vision algorithms. This holds even for thermal images (IR) or synthetic aperture radar (SAR). Psychologists refer to these capabilities as Gestalt perceptive skills. Gestalt Algebra is a mathematical structure recently proposed for such laws of perceptual grouping. It gives operations for mirror symmetry, continuation in rows and rotational symmetric patterns. Each of these operations forms an aggregate-Gestalt of a tuple of part-Gestalten. Each Gestalt is attributed with a position, an orientation, a rotational frequency, a scale, and an assessment respectively. Any Gestalt can be combined with any other Gestalt using any of the three operations. Most often the assessment of the new aggregate-Gestalt will be close to zero. Only if the part-Gestalten perfectly fit into the desired pattern the new aggregate-Gestalt will be assessed with value one. The algebra is suitable in both directions: It may render an organized symmetric mandala using random numbers. Or it may recognize deep hidden visual relationships between meaningful parts of a picture. For the latter primitives must be obtained from the image by some key-point detector and a threshold. Intelligent search strategies are required for this search in the combinatorial space of possible Gestalt Algebra terms. Exemplarily, maximal assessed Gestalten found in selected aerial images as well as in IR and SAR images are presented.
Improved Collaborative Filtering Recommendation Algorithm Based on Weighted Association Rules

In this paper the collaborative filtering recommendation and association rules are introduced firstly. Aiming at the shortcomings of basic collaborative filtering recommendation, this paper proposes an improved collaborative filtering recommendation algorithm based on weighted association rules (CFRA-WAR). Finally the simulation experiments are carried out to verify the validity of the improved recommendation algorithm. The results of simulation experiments show that the recommendation accuracy of CFRA-WAR is superior to basic collaborative filtering recommendation algorithm, although the algorithm time of CFRA-WAR is a little longer.
YouSlow

Adaptive bitrate (ABR) technologies are being widely used in today's popular HTTP-based video streaming such as YouTube and Netflix. Such a rate-switching algorithm embedded in a video player is designed to improve video quality-of-experience (QoE) by selecting an appropriate resolution based on the analysis of network conditions while the video is playing. However, a bad viewing experience is often caused by the video player having difficulty estimating transit or client-side network conditions accurately. In order to analyze the ABR streaming performance, we developed YouSlow, a web browser plug-in that can detect and report live buffer stalling events to our analysis tool. Currently, YouSlow has collected more than 20,000 of YouTube video stalling events over 40 countries.
Significant source of secondary aerosol : formation from gasoline 1 evaporative emissions in the presence of SO 2 and NH 3 2

Changgeng Liu, Jun Liu , Hong He 3, 4, * 4 1 State Key Joint Laboratory of Environment Simulation and Pollution Control, Research Center for 5 Eco-Environmental Sciences, Chinese Academy of Sciences, Beijing 100085, China 6 2 Beijing Advanced Innovation center for Soft Matter Science and Engineering, Beijing University 7 of Chemical Technology, Beijing 100029, China 8 3 University of Chinese Academy of Sciences, Beijing 100049, China 9 4 Center for Excellence in Regional Atmospheric Environment, Institute of Urban Environment, 10 Chinese Academy of Sciences, Xiamen 361021, China 11 a These authors contributed equally to this work and should be considered as co-first authors 12
On the identification of the inertial parameters of robots

An algorithm is presented for the identification of the inertial parameters and friction coefficients of robots. The algorithm is not required to measure or calculate the joint accelerations. The identification model is based on the energy theorem, is linear in the robot parameters, and is easy to calculate. An example of a two-degree-of-freedom robot is presented. <<ETX>>
Optimized knowledge-based motion correction of fMRI time series using parallel algorithms

The structure of an fMRI time series coregistration algorithm can be divided into modules (preprocessing, minimization procedure, interpolation method, cost function), for each of which there are many different approaches. In our study we implemented some of the most recent techniques and compared their combinations with regard to both registration accuracy and runtime performance. Bidirectional inconsistency and difference image analysis served as quality measures. The result shows that with an appropriate choice of methods realignment results can be improved by far compared with standard solutions. Finally, an automatic parameter adaptation method was incorporated. Additionally, the algorithm was implemented to run on a distributed 48 processor PC cluster, surpassing the performance of conventional applications running on high end workstations.
Ray-based creation of photo-realistic virtual world

Introduces the concept of ray-based representation of spatial data and proposes a new method for creating a photo-realistic virtual world. In this method, the complete set of ray data of the world is treated as a set of orthogonal views of scene objects. The advantage of this approach is to allow the synthesis of any perspective view by gathering appropriate ray data from the set of orthogonal views, independent of any geometric representation. First, several perspective views of the real world are taken as a set of real ray data, and orthogonal views of the world are synthesized from the captured real ray data. Then, structural models corresponding to each perspective view are estimated locally and are adaptively joined to each other in order to interpolate the "cracks" in the orthogonal views. This approach can avoid the difficulties of estimating a unique structural model of the world.