Miracle-dz/UniFAR-FTUs huggingface dataset:
Target image segmentation based on modified Otsu algorithm

In the modern war,recognizing and tracking the target rapidly and effectively is of vital importance for acquiring war initiative.For the sake,it is necessary to segment the target from the image accurately.An improved method derived from Otsu algorithm is put forward,which combines interclass distance with intra-class distance.It is then applied in target image segmentation.The experimental results showed that the new method can obtain a better impact of image segmentation than Otsu.
On Exact Multidimensional Solutions of a Nonlinear System of First Order Partial Differential Equations

This study is concerned with a system of two nonlinear first order partial differential equations. The right-hand sides of the system contain the squares of the gradients of the unknown functions. Such type of Hamilton-Jacobi like equations are considered in mechanics and control theory. In the paper, we propose to search a solution in the form of an ansatz, the latter containing a quadratic dependence on the spatial variables and arbitrary functions of time. The use of this ansatz allows us to decompose the search of the solution’s components depending on the spatial variables and time. In order to find the dependence on the spatial variables one needs to solve an algebraic system of some matrix and vector equations and of a scalar equation. A general solution of this system of equations is found in a parametric form. To find the time-dependent components of the solution of the original system, we are faced with a system of nonlinear differential equations. The existence of exact solutions of a certain kind for the original system is established. A number of examples of the constructed exact solutions, including periodic in time and anisotropic in the spatial variables ones, are given. The spatial structure of the solutions is analyzed revealing that it depends on the rank of the matrix of the quadratic form entering the solution.
Flexible multi-layer spoken dialogue corpora

This paper describes the construction of deeply annotated spoken dialogue corpora. To ensure a maximum of flexibility — in the degree of normalization, the types and formats of annotations, the possibilities for modifying and extending the corpus, or the use for research questions not originally anticipated — we propose a flexible multi-layer standoff architecture. We also take a closer look at the interoperability of tools and formats compatible with such an architecture. Free access to the corpus data through corpus queries, visualizations, and downloads — including documentation, metadata, and the original recordings — enables transparency, verifiability, and reproducibility of every step of interpretation throughout corpus construction and of any research findings obtained from this data.
$b\to ss{\bar d} $ decay in Randall-Sundrum models

The extremely small branching ratio of $b\to ss{\bar d}$ decay in the Standard Model makes it a suitable channel to explore new physics through various extensions of the Standard Model. We study this $\Delta S=2$ process in Randall-Sundrum models, including the custodially protected and the bulk-Higgs Randall-Sundrum models. Exploring the parameter space of these models constrained by $K^0-\bar K^0$ mixing and $B_s^0-\bar B_s^0$ mixing, it suggests a possible accessibility of this decay in future experiments.
Consensus-Based Data-Privacy Preserving Data Aggregation

Privacy-preserving data aggregation (DA) in ad hoc networks is a challenging problem, considering the distributed communication and control requirement, dynamic network topology, unreliable communication links, etc. Different from the widely used cryptographic approaches, in this paper, we address this challenging problem by exploiting the distributed consensus technique. We first propose a secure consensus-based DA algorithm that guarantees an accurate sum aggregation while preserving the privacy of sensitive data. Then, we prove that the proposed algorithm converges accurately and is <inline-formula><tex-math notation="LaTeX">$(\epsilon, \sigma)$</tex-math></inline-formula>-data privacy, and the mathematical relationship between <inline-formula><tex-math notation="LaTeX">$\epsilon$</tex-math></inline-formula> and <inline-formula><tex-math notation="LaTeX">$\sigma$</tex-math></inline-formula> is provided. Extensive simulations have shown that the proposed algorithm has high accuracy and low complexity, and they are robust against network dynamics.
On the application of turbo equalizers in GSM compatible receivers

We discuss the application of iterative, decoding algorithms (turbo equalizer) to GSM data channels (TCH/F9.6). Although the turbo equalizer under realistic time-variant channel scenarios has a high potential, we only get a minor performance gain when compared to conventional soft-decision algorithms. Certain constraints of the GSM coding scheme prevent better results. We discuss the transition from a very simple data transmission model to a full GSM-compatible system and compare the resulting bit error rates (BER). We introduce a modified turbo equalizer structure which adapts to the pipelining interleaver.
Development of Android Based Instructional Media of Algebraic Tiles for Quadratic Equation

This research and development aims to develop the android based instructional media of algebraic tiles for quadratic equation. The media created must meet the criteria of valid, practical, and effective to assist the student in understanding the factoring in quadratic equations. The research model used in this research is 4D model developed by Thiagarajan. This model is used and modified into 3 stages only, those are (1) define stage; (2) design stage; and (3) development stage. The resulting product is named FICTION (Factorization of Quadratic Equation) which has apk as it’s extension and can be deployed and installed on a minimum android-based smartphone on version 4.0 / 4.1 (Ice Cream Sandwich). After trials, it can be conclude that FICTION is valid with level of validity 3.83, practical with level of practicality 3.1, but ineffective because none of students could pass the score minimum criteria.
Electrical insulation properties of the perfluoronitrile C4F7N

The electrical insulation properties of pure C4F7N and of C4F7N/N2 and C4F7N/CO2 mixtures are investigated in a pulsed Townsend setup. The electron rate and transport coefficients and the density-reduced critical electric field of these mixtures are obtained, and a synergy effect is observed in C4F7N/N2 and C4F7N/CO2 mixtures. The total electron attachment cross section of C4F7N is estimated based on the attachment rate to C4F7N in diluted C4F7N/N2, C4F7N/CO2 and C4F7N/O2/CO2 mixtures. Measurements in pure C4F7N at pressures of a few hundred pascal show that ion kinetics play a major role in C4F7N discharges and that further modelling is required to assess the electric strength of C4F7N at high pressures.
Modeling controlled vocabularies using oodbs and multilevel area diagrams

A Controlled Vocabulary (CV) is a software system of domain knowledge that consolidates and unifies the terminology of a large application domain. With a common, centralized CV, costly and time-consuming translations can be eliminated between pairs of organizations and pairs of software systems. Unfortunately, the more knowledge we put into a CV, the harder it is to understand and maintain it. In this dissertation, a comprehensive theoretical methodology for modeling CVs using Object-Oriented Database (OODB) technology is presented. We present two methods for representing a semantic network CV as an equivalent OODB, which we call an Object-Oriented Vocabulary Repository (OOVR). The first method, based on a structural analysis and partitioning of the CV, yields an OODB with a very concise schema, referred to as the OOVR schema. Due to its compact size, the schema can be displayed on one or a few computer screens and serves as an aid for comprehending and maintaining the CV. A program called the Object-Oriented Vocabulary Repository Generator (OOVR Generator) has been built to automatically generate an OOVR for a given semantic network CV. Our second methodology results in a larger schema, which, however, serves as an important tool for browsing and navigation through a CV. The OODB schemas created by both methodologies provide important abstract views of CVs. We have also defined a new type of semantic relationships called IS-A ′ in the context of an OOVR representation. The IS-A ′ relationships are defined on OOVR schemas to reflect certain important IS-A relationships in the underlying CV. The two OOVR representations exhibit several interesting theoretical characteristics which are formally proven in this dissertation. To provide an environment with several abstract views of a CV, we also define a paradigm called Multilevel Area Diagrams (MLADs). A MLAD is a collection of different partitions of increasing detail and decreasing abstraction derived from a CV. Users can browse at one level and then switch to another level to continue their navigation. Examples of browsing sessions are presented to show that the MLAD paradigm provides processing capabilities beyond those of a traditional object-oriented representation of a vocabulary.
Fast subspace optimization method for nonlinear inverse problems in Banach spaces with uniformly convex penalty terms

In this paper, we consider the subspace optimization method for solving nonlinear inverse problems in Banach spaces, which is based on the sequential Bregman projections with uniformly convex penalty term. The penalty term is allowed to be non-smooth, including L1 and total variation like penalty functionals, to reconstruct the special features of solutions such as sparsity and discontinuities. Instead of just utilizing the current gradient like the Landweber iteration, the method uses multiple search directions in each iteration to accelerate the convergence. Moreover, their step lengths are calculated by the projection onto the subspace that contains the solution set of the unperturbed problem. Under certain assumptions, we present the detailed convergence analysis when the data is given exactly. For the data containing noise, we use the discrepancy principle as stopping rule and then obtain the regularization result of the method. Finally, some numerical simulations for parameter identification problems are provided to illustrate the effectiveness of capturing the property of exact solutions and the acceleration effect of the method.
Discovering Preferred Browsing Paths from Web Logs

Web logs contain a lot of user browsing information. How to mine user browsing interest patterns is a important research topic. On the analysis of the present algorithms for mining user broswing patterns, representing user broswing interest and intention accurately by comparing relatively access ratio and the average of relatively access ratio, support-preference can be used for mining user broswing paths. According to the conception, we proposed a User Access Matrix based preferred broswing paths algorithm. Firstly, An URL-URL matrix was set up from web logs according to Web site's broswing paths, where referer URL as rows, navigating URL as columns and path broswing frequency as matrix elements. This URL-URL matrix is a sparse matrix which can be represented by List of 3-tuples. Then, preferred broswing sub-paths could be discovered from the computation of this matrix. Finally, all the sub-paths were combined. Experiments showed that it was accurate and scalable. It's suitable for application in E-business, such as to optimize web site or to design personalized service.
Multimode-Coreless-Multimode Fiber-Based Sensors: Theoretical and Experimental Study

This paper presents a complete study on the spectral behavior of a multimode-coreless-multimode fiber-optic structure, as well as its application as a refractometer and a liquid level sensor. The combination of two standard multimode fibers fused to a coreless fiber segment allows generating narrow interferometric bands in the optical spectrum, whose sensitivity can be improved by an adequate selection of the dimensions of the device (the coreless segment length and the diameter of the sensing area). A second way to improve the performance of the device is to deposit a thin film of SnO2, which allows increasing the sensitivity up to 314 nm/RIU. This widens the number of applications where this structure can be used. As an example, a liquid level sensor with 0.73 nm/mm sensitivity is presented.
Load Rebalancing for Distributed File Systems in Clouds

In distributed systems protecting the data is become more vulnerable and has to provide the secure to the digital applications. A novel load-balancing algorithm to deal with the load rebalancing problem in large-scale, dynamic, and distributed file systems in clouds. Distributed file systems are key building blocks for cloud computing applications based on the Map Reduce programming paradigm. In such file systems, nodes simultaneously serve computing and storage functions. Files can also be dynamically created, deleted, and appended. This results in load imbalance in a distributed file system; that is, the file chunks are not distributed as uniformly as possible among the nodes. Additionally.
An End-User Programming System for Constructing Massively Parallel Simulations

This dissertation presents Kedama, a programming system for end-users, in particular the children at the school students’ age, to enable construction of massively parallel simulations. Kedama allows the user to construct massively parallel simulations in a highly interactive graphical environment. A user-written program can be modified dynamically so that the user can explore the problem domain quickly yet it runs efficiently. In this dissertation, the system, the design goals, the trade offs such as language generality and performance, implementation, and the evaluation of it are discussed. We aim to satisfy three goals in the user experience of this system as an end-user programming system: 1) decent performance, 2) error-free programming, and 3) immediate feedback. With decent performance, the user can concentrate on building the model and write a straightforward program of the model without committing premature optimizations. With error-free programming, the user can again concentrate on the important part of programming, rather than typing correct keywords, remembering the number of arguments for a command, etc. With immediate feedback, the user can explore the problem domain quickly. Furthermore, it is often the case that the user doesn’t have the clear idea up-front how the code should look, and as the user interacts with the model and the program, he gains the understanding of the domain. If the program modification by the user is reflected immediately, the user can try many options quickly. To the author’s knowledge, there is no system that satisfies these three goals. We found that the goals 2 and 3 can be satisfied by taking advantage of an end-user programming system called Squeak eToys. However, for the performance goal, the eToys’ original design falls short; eToys cannot keep the interactive response to the user when the number of the user objects reaches a few dozen or more. Therefore, extending eToys in a way that can handle thousands of objects efficiently without losing its interactive programming nature becomes an interesting challenge. Also, we consider computers that will be used in the
A compact planar cylindrical resonant RF sensor for the characterization of dielectric samples

ABSTRACT A conventional cavity-based planar cylindrical resonant sensor for the RF characterization of dielectric materials is proposed in this work. The designed planar cylindrical sensor is about 22% more compact providing 25% higher sensitivity as compared to its rectangular counterpart working at the same frequency. The proposed sensor is designed for the fundamental TM010 mode at 1.5 GHz resonant frequency and is excited using the coaxial probe instead of conventional microstrip feeding, which aids in obtaining further compactness. The sensor is designed on low-cost FR4 substrate and experimentally validated using various dielectric samples like Teflon, polyethylene, PVC and plexiglass yielding a good match between the retrieved dielectric constants and data available in the literature. For characterization of dielectrics, a slot is drilled at the center of the sensor having the maximum electric field for inserting the test sample and later optimized for higher sensitivity. For determining the loss tangent in terms of the transmission coefficient at the resonant frequency, a numerical model is derived using the curve fitting technique.
Standards- based Education: Promoting Students' Learning by Applying the Marking Rule

Education should be the one based on the standard. We should have the performance criterion and scoring rubrics run through the process of education and instruction, and in so doing the educational objectives can be really achieved. The performance criterion and scoring rubrics play an important role in the education based on standard, so we should promote teaching and learning by applying the rules.
FEI Tecnai G2 F20

The FEI Titan Tecnai G2 F20 is a versatile transmission electron microscope which is equipped with a Gatan Tridiem 863P post column image filter (GIF) and a high angle energy dispersive X-ray (EDX) detector. This set up allows for a variety of experiments such as conventional imaging and diffraction, recording of bright- and dark-field scanning transmission electron microscopy (STEM) images, or acquiring elemental maps extracted from energy electron loss spectra (EELS) or EDX signals.
Local time extent of magnetopause reconnection using space–ground coordination

Abstract. Magnetic reconnection can vary considerably in spatial extent. At the Earth's magnetopause, the extent generally corresponds to the extent in local time. The extent has been probed by multiple spacecraft crossing the magnetopause, but the estimates have large uncertainties because of the assumption of spatially continuous reconnection activity between spacecraft and the lack of information beyond areas of spacecraft coverage. The limitations can be overcome by using radars examining ionospheric flows moving anti-sunward across the open–closed field line boundary. We therefore infer the extents of reconnection using coordinated observations of multiple spacecraft and radars for three conjunction events. We find that when reconnection jets occur at only one spacecraft, only the ionosphere conjugate to this spacecraft shows a channel of fast anti-sunward flow. When reconnection jets occur at two spacecraft and the spacecraft are separated by < 1 Re, the ionosphere conjugate to both spacecraft shows a channel of fast anti-sunward flow. The consistency allows us to determine the reconnection jet extent by measuring the ionospheric flows. The full-width-at-half-maximum flow extent is 200, 432, and 1320 km, corresponding to a reconnection jet extent of 2, 4, and 11 Re. Considering that reconnection jets emanate from reconnections with a high reconnection rate, the result indicates that both spatially patchy (a few Re) and spatially continuous and extended reconnections (> 10 Re) are possible forms of active reconnection at the magnetopause. Interestingly, the extended reconnection develops from a localized patch via spreading across local time. Potential effects of IMF Bx and By on the reconnection extent are discussed.
Transformation Characteristics of High-Current Vacuum Arcs With Still-Spaced Contacts Under TMF–AMF Combined Magnetic Fields

A novel double-type contact system with still-spaced contacts was proposed to offer a better arc control and a electric field shielding effect to the eroded inner contacts, especially during the capacitive interrupting process. The experimental double-type contact system consisted of the inner moving transverse magnetic field (TMF) contacts and the outer still-spaced axial magnetic field (AMF) contacts, which was called as TMF–AMF contacts. The objective of this paper is to determine the transformation characteristics of high-current vacuum arcs with still-spaced contacts under TMF–AMF combined magnetic fields. The experimental investigation includes the vacuum arcing behaviors, the arc voltage, and the arc current transformation characteristics. The arc current in the tests varied over a range from 0 to 30 kA at 50 Hz. The contacts material was CuCr25 (25% Cr). A high-speed charge-coupled device video camera was used to record the vacuum arc appearance. The experiments indicate that the vacuum arc current can transform successfully from the inner TMF contacts to the outer still-spaced AMF contacts for the novel TMF–AMF double-type contacts. The partial arc current flowed through the outer still-spaced contacts was mainly at the latter half of the vacuum arc duration and less than 50% of the total arc current. The value and polarity of the arc current also play a significant role in the arc current transformation characteristics of the TMF–AMF contacts with still-spaced contacts. Moreover, with the vacuum arc expanding to the still-spaced contacts, the variation of the Lorentz force of the arc column would weaken the rotation of the arc column and strengthen the transformation characteristics of the vacuum arc column to the still-space AMF contacts significantly.
Fast Intra-frame Prediction Algorithm Based on Characteristic of Macro-block for H.264/AVC Standard

To reduce the encoding time for H.264 and apply it to the real-time practice,on the basis of the research on the block size prediction of intra frame and according to the histogram algorithm,an intra 4×4 mode or intra 16×16 mode for every macro-block are selected before coding.If the intra 4×4 prediction mode is chosen,then the fast algorithm based on the characteristic of macro-block itself is used to reduce the choices for predicted directions.Experimental results show that without the variety of PSNR,the compression time is 32.8% less than that of the original and it increases 3.2% bits rate.
Bipartite Consensus of High-Order Edge Dynamics on Coopetition Multiagent Systems

The bipartite consensus of high-order edge dynamics is investigated for coopetition multiagent systems, in which the cooperative and competitive relationships among agents are characterized by positive weight and negative weight, respectively. By mapping the initial graph to a line graph, the distributed control protocol is proposed for the strongly connected, digon sign-symmetric structurally balanced line graph; and then we give sufficient conditions for the third-order multi-gent system to achieve both the bipartite consensus of edge dynamics and the final value of bipartite consensus. By transforming the coefficients of characteristic polynomial from complex domain to real number domain, the sufficient conditions for the bipartite consensus of high-order edge dynamics are also proposed, and the final values of the high-order edge dynamics on multiagent systems are obtained.
Some remarks on well-posedness of the higher-dimensional chemorepulsion system

Such a system can be considered as a version of repulsive action of a substance v on cells u, describing an opposite phenomenon to the well-known aggregation mechanism described by the Keller–Segel system. The only difference from the Keller–Segel model is the sign in the first equation of (1.1). Due to the difference in sign, one expects a completely different behaviour of solutions. Namely, instead of collapsing, the density of cells u is