Miracle-dz/UniFAR-FTUs huggingface dataset:
A Bayesian segmentation approach to 3-D tomographic reconstruction from few radiographs

A MAP (maximum a posteriori) 3-D reconstruction technique for estimating a solid object directly from sparse cone-beam data has been developed. In the present work, emphasis is placed on radiographic flaw detection in solid materials, which can be viewed as a segmentation of the object into a binary-valued reconstruction. Optimization is performed by iterated conditional modes, with deterministic convergence, but a solution dependent on the initial condition. To speed convergence and improve the estimate, an initial condition based on maximum-likelihood estimation of flaw location is used. This MAP tomographic estimation algorithm provides a simple, robust method for segmenting a 3-D object from digitized radiographs. Its output is appropriate for either automated decision-making or visual inspection, but avoids the necessity of making decisions independently on separate radiographs, as its currently typical in application. Although the estimation process is computationally costly in terms of cost per pixel at each iteration, its convergence is very rapid in terms of iteration counts. <<ETX>>
Nonlinear system identification with pseudorandom multilevel excitation sequences

The authors consider pseudorandom multilevel sequences (PRMS) for the identification of nonlinear systems modeled via a truncated Volterra series with a finite degree of nonlinearity and finite memory length. It is shown that PRMS are persistently exciting (PE) for a Volterra series model with nonlinearities of polynomial degree N if and only if the sequence takes on N+1 or more distinct levels. A computationally efficient least squares identification algorithm based on PRMS inputs is developed that avoids forming the inverse of the data matrix. Simulation results comparing identification accuracy using PRMS and Gaussian white noise are given. <<ETX>>
Recursive implementation of total least squares algorithm for image reconstruction from noisy, undersampled multiframes

It is shown how the total least squares recursive algorithm for the real data FIR (finite impulse response) adaptive filtering problem can be applied to reconstruct a high-resolution filtered image from undersampled, noisy multiframes, when the interframe displacements are not accurately known. This is done in the wavenumber domain after transforming the complex data problem to an equivalent real data problem, to which the algorithm developed by C.E. Davila (Proc. ICASSP 1991 p.1853-6 of 1991) applies. The procedure developed also applies when the multiframes are degraded by linear shift-invariant blurs. All the advantages of implementation via massively parallel computational architecture apply. The performance of the algorithm is verified by computer simulations. <<ETX>>
Evaluation of contrast sensitivity functions for the formulation of quality measures incorporated in halftoning algorithms

A comparative study of different CSFs (contrast sensitivity functions) as to their suitability for the formulation of quality measures in halftoning is presented. The evaluation of the different CSFs is implemented by weighting with each CSF the frequency-domain halftoning error of 44 halftone images, and then comparing the resulting weighted errors with the results of a psychovisual test. Comparison with psychovisual results indicates that the following factors significantly improve the performance of the CSF: incorporation of information about the printing device and the viewing conditions in the quantitative metric; incorporation of information about the angular sensitivity of the visual system: and utilization of a lowpass CSF instead of a bandpass one. <<ETX>>
Word spotting in scanned images using hidden Markov models

A hidden-Markov-model (HMM)-based system for font-independent spotting of user-specified keywords in a scanned image is described. Word bounding boxes of potential keywords are extracted from the image using a morphology-based preprocessor. Feature vectors based on the external shape and internal structure of the word are computed over vertical columns of pixels in a word bounding box. For each user-specified keyword, an HMM is created by concatenating appropriate context-dependent character HMMs. Nonkeywords are modeled using an HMM based on context-dependent subcharacter models. Keyword spotting is performed using a Viterbi search through the HMM network created by connecting the keyword and nonkeyword HMMs in parallel. Applications of word-image spotting include information filtering in images from facsimile and copy machines, and information retrieval from text image databases. <<ETX>>
Plant regeneration through tissue culture of pear millet (Pennisetum glaucum (L) R.)

Les difficultes liees a utilisation de l'embryon immature et des explants de tige dans les cultures de tissus sont nombreuses ; dont l'initiation de cal qui ne se fait que pendant la floraison, pour l'embryon immature, soit chaque 110 jours, et le faible pourcentage de l'embryogenese. Pour Pennisetum glaucum, de nouvelles sources de cals embryogenes ont ete explorees depuis l'initiation de cal jusqu'a l'obtention de plante fertile. Environ 90 % des meristemes apicaux, des germes et des grains ont developpe des cals. A partir des meristemes, seuls 6 mm de tige et 20 mm de racine ont developpe des cals avec un taux de 50 a 100 %. La racine n'a developpe aucun cal embryogene. Plus de 80 % des cals de meristemes apicaux etaient embryogenes. Les cals maintenus sur MS(1.1.2,5), MS(5) et N6(1.100.25), sont restes embryogenes et ont produit des plantes fertiles pendant au moins 12 mois. Les plantes regenerees ont des caracteristiques semblables aux plantes temoins. Il ressort que le meristeme apical est un nouveau materiel approprie pour la culture de tissus.
A multiple time scale minimum variance beamformer

Expressions for mean output power and mean squared error are derived for the multiple time scale minimum variance beamformer in terms of adaptive degrees of freedom (DOF) and adaptation time scale when the same input data block is used to update weights and output. Analysis reveals the necessity of placing constraints on adaptation time scales to ensure the beamformer output is not ill-defined. It is shown that a signal cancellation effect arises when the same input data block is used to compute beamformer weights and form the output. The applicability of a multiple time scale beamformer when measurements consist of signals which are stationary over different time periods was demonstrated by simulation. <<ETX>>
On stratifications for planar tensegrities with a small number of vertices

In this paper we discuss several results about the structure of the configuration space of two-dimensional tensegrities with a small number of points. We briefly describe the technique of surgeries that is used to find geometric conditions for tensegrities. Further we introduce a new surgery for three-dimensional tensegrities. Within this paper we formulate additional open problems related to the stratified space of tensegrities.
Relative edge betweenness centrality

We introduce a new edge centrality measure - relative edge betweenness γ ( u v ) = b ( u v ) / √ ( c ( u ) c ( v )) , where b ( u v ) is the standard edge betweenness and c ( u ) is the adjusted vertex betweenness. In this alternative definition, the importance of an edge is normalized with respect to the importance of its end-vertices. This gives a better presentation of the “local” importance of an edge, i.e. its importance in the near neighborhood. We present sharp upper and lower bounds on this invariant together with the characterization of graphs attaining these bounds. In addition, we discuss the bounds for various interesting graph families, and state several open problems.
A Fast Auto-Frequency Calibration Technique for Wideband PLL with Wide Reference Frequency Range

This paper proposes a fast auto frequency calibration (AFC) technique for wideband PLL with wide reference frequency range. The AFC circuit block adopts a proposed clock controller and a current-mode logic (CML) divider-by-2 divider to accelerate the AFC process without the penalty of AFC resolution. It also adopts the adjustable AFC counting period technique to speed up the AFC process at low reference frequency and to reduce AFC time variation within wide frequency range of reference clock. A 0.1~5 GHz ΔΣ fractional-N PLL with this AFC technique is designed and implemented in 65-nm CMOS process. The measurement results show that in the reference frequency range from 15 to 50 MHz, the AFC time varies only from 1.25 to 1.86 μs with AFC resolution range from 3 to 5 MHz.
Recovery of lost or erroneously received motion vectors

A technique using boundary matching to compensate for lost or erroneously received motion vectors in motion-compensated video coding is proposed. This technique, called the boundary matching algorithm, produces noticeably better results than those reported previously. It is first assumed that the displaced frame differences have no error. Then, this assumption is relaxed by proposing an algorithm (the extended boundary matching algorithm or EBMA) which can recover both the missing displaced frame differences and the missing motion vectors. The resulting images obtained using these methods and some other methods are compared. The images obtained clearly show that better image quality can be obtained by EBMA. <<ETX>>
A computation of the sliding window recursive QR decomposition

A set of recursions for sequential updating of QR based algorithms in finite (or sliding) windows using orthonormal Givens plane rotations is presented. These recursions can be used for (1) sliding window spatial QR-RLS adaptive filtering including implicit error computation and/or (2) sliding window tracking of orthonormal database for array processing applications. The proposed sliding window QR algorithms have approximately twice the computational complexity when compared with the classical exponentially weighted growing window QR algorithms. They are based on very elementary computation structures which are familiar from the well-known Gentleman and Kung array. <<ETX>>
Selection of Best Smartphone Using Revised ELECTRE-III Method

Since smartphones have become the most prevalent communication tool in the world, a wide variety of low-end to high-end smartphone products are currently available on the market. Choosing a suitable product becomes a challenge due to the problem of feature fatigue. This study developed a smartphone selection procedure for prospective users by incorporating ELECTRE-III method with Kano two-dimensional quality model. An empirical example of 15 smartphones from three different categories, namely, flagship, screen size and price, demonstrated that the credibility matrix of the revised ELECTRE-III had fewer extreme values (0 and 1) than its original counterpart. It was able to clearly distinguish the relative satisfaction of each option in the respective group, particularly for the tied products which could not be discerned by the original ELECTRE-III.
A 0.46-2.1 GHz Spurious and Oscillator-Pulling Free LO Generator for Cellular NB-IoT Transmitter with 23 dBm Integrated PAs in 28nm CMOS

This paper presents a spurious and oscillator pulling free LO generator (LOG) using reconfigurable of integer divider-by-2, 4 and 6 (Div2, Div4 and Div6) and mixed-mode fractional divider-by-2.5 (Div2.5) to mitigate the DCO pulling from the integrated power amplifier for a 0.46-2.1GHz cellular narrowband Internet of Things (NB-IoT) applications. The divider ratio in the designed LOG is determined by TX output power level to achieve both the mitigation of pulling and effective power consumption. An adaptive voltage bias (ADB) circuit is added to compensate PVT variation for the fractional divider. A proposed reconfigurable LOG is implemented in 28nm CMOS process and it consumes 40mA including ADPLL, DCO, and dividers. The measured phase noise of the 2GHz carrier LOG with Div2.5 is −146.3dBc/Hz at 10MHz offset Fractional spurs are below than −90 dBc without pulling for the 1.6~2.1GHz output frequency.
The Discourse Markers in President Joko Widodo’s Speeches in KTT APEC China in 2015

Schriffin (1987) states that “Discourse markers are part of the more general analysis of discourse, coherence-how speaker and hearers jointly integrate forms, meaning, and actions to make overall sense out of what is said. It means DMs contribute to the message that conveys by the speaker, it helps to make debate to be cohesive and coherent [1]. The purpose of this study is to find the type of discourse markers and to elaborate the reasons of occurrence of discourse markers used the speech. This study is descriptive qualitative. According to Bogdan and Biklen (1992) Qualitative research is aimed at gaining a deep understanding of a specific organization or event, rather than surface description of a large sample of a population [2]. The data that collected simplified and analyzed in the type of discourse markers and the reason why it was used. Based on the data analysis cognitive category was the most dominantly used was about 43 percent and the reasons of occurrence that dominantly used mode was about 46 percent. This means types of discourse markers are used to identify the speaker condition and situation when they spoke in front of the audiences.
6-REXOS: Upper Limb Exoskeleton Robot with Improved pHRI

Close interaction can be observed between an exoskeleton robot and its wearer. Therefore, appropriate physical human-robot interaction (pHRI) should be considered when designing an exoskeleton robot to provide safe and comfortable motion assistance. Different features have been used in recent studies to enhance the pHRI in upper-limb exoskeleton robots. However, less attention has been given to integrating kinematic redundancy into upper-limb exoskeleton robots to improve the pHRI. In this context, this paper proposes a six-degrees-of-freedom (DoF) upper-limb exoskeleton robot (6-REXOS) for the motion assistance of physically weak individuals. The 6-REXOS uses a kinematically different structure to that of the human lower arm, where the exoskeleton robot is worn. The 6-REXOS has four active DoFs to generate the motion of the human lower arm. Furthermore, two flexible bellow couplings are attached to the wrist and elbow joints to generate two passive DoFs. These couplings not only allow translational motion in wrist and elbow joints but also a redundancy in the robot. Furthermore, the compliance of the flexible coupling contributes to avoiding misalignments between human and robot joint axes. The redundancy in the 6-REXOS is verified based on manipulability index, minimum singular value, condition number and manipulability ellipsoids. The 6-REXOS and a four-DoF exoskeleton robot are compared to verify the manipulation advantage due to the redundancy. The four-DoF exoskeleton robot is designed by excluding the two passive DoFs of the 6-REXOS. In addition, a kinematic model is proposed for the human lower arm to validate the performance of the 6-REXOS. Kinematic analysis and simulations are carried out to validate the 6-REXOS and human-lower-arm model.
Divination and Sovereignty: The Late Bronze Age Shrines at Gegharot, Armenia

The advent of the Late Bronze Age (ca. 1500–1250 B.C.E.) on the Tsaghkahovit Plain in central Armenia witnessed the establishment of a series of hilltop fortresses following a 900-year hiatus in regional occupation. These new settlements testify to the emergence of a South Caucasian political tradition founded on the regularization of radical inequality, centralizing practices of economic redistribution, and new institutions of rule. However, the discovery of three shrines and associated assemblages at Gegharot, one of the primary fortress sites, also suggests that divinatory practices were critical to the emergent principles of regional sovereignty. In this article, we present the evidence for esoteric rituals—particularly osteomancy, lithomancy, and aleuromancy—within the shrines at Gegharot, situating them within the available comparanda from the Caucasus and adjacent Near East. We further examine how divination—a technique for mitigating risks posed by unsettled presents and uncertain futures—provided a key source of power vital to sovereignty.
Ascend : an architecture for performing secure computation on encrypted data

This thesis considers encrypted computation where the user specifies encrypted inputs to an untrusted batch program controlled by an untrusted server. In batch computation, all data that the program might need is known at program start time. Encrypted computation on untrusted batch programs can be realized through fully homomorphic encryption (FHE) techniques, but FHE's current overheads limit its applicability. Secure processors (e.g., Aegis), coprocessors (e.g., TPM) or hardware extensions (e.g., TXT) typically require trust in the entire processor, the host operating system and the program that computes on the inputs. In this thesis, we design a secure processor architecture, called Ascend, that guarantees privacy of data given untrusted batch programs. The key idea in Ascend to guarantee privacy is parameterizable, obfuscated program execution. From the perspective of the Ascend chip's input/output and power pins, an untrusted server cannot learn anything about private user data regardless of the program run. Ascend uses Oblivious RAM (ORAM) techniques to hide memory access patterns and differential-power analysis (DPA) resistance techniques to hide data-dependent power draw. For each of the input/output and power channels, an Ascend chip exposes a set of public knobs that fully specify the observable behavior of the chip given any batch program and any input to that batch program. These knobs (e.g., specifying strict intervals for when external memory should be accessed) are controlled by the server and can be tuned, based on the server's apriori knowledge of the program, to trade-off performance and power without impacting security. Experimental results when running Ascend on SPEC benchmarks show an average 3.6x /6.6x and 5.2x /4.7x performance/power overhead-when hiding memory access pattern and power draw-using two schemes that capture the server's apriori knowledge in different ways. Furthermore-when hiding memory access pattern only-performance/power overheads drop to only 2.6x/2.2x. These surprising results mean that it is viable to only trust hardware and not software in some security-conscious applications. Thesis Supervisor: Srinivas Devadas Title: Professor of Electrical Engineering and Computer Science
Migrating group communication protocols to networks with mobile hosts

There is a compelling need to include mobile hosts in many of today's computing applications especially in distributed applications. This paper introduces a new model, called Mobile Group Communication Model or MGCM, for implementing Process Groups and Group Communication as one tool for building reliable and fault-tolerant distributed applications on networks with mobile hosts. The model is based on a simple layered architecture that guarantees virtual synchrony and atomicity in addition to ordering requirements. A two-tier principle approach is used in designing the model that off-loads the work from mobile hosts to the set of mobile support stations. Simulation is conducted to test the model using the "Ptolemy" simulation tool.
Intelligent picocells for adaptive indoor coverage and capacity

This dissertation presents and develops the Intelligent Picocell as a solution for high bit rate, efficient bandwidth indoor wireless communication. The research has examined different aspects of the indoor radio propagation environment and system implementation in order to highlight key benefits of the proposed architecture. Explosive growth in demand for indoor wireless communications motivates research into this novel radio architecture. The architecture should be capable of tailoring capacity and coverage to the needs of the specific indoor environment, while maximising spectral efficiency. The Intelligent Picocell is based on an evolution of the distributed antenna concept to provide macrodiversity, microdiversity and interference cancellation. The architecture is fully scalable to large numbers of users and can provide plug-and-play operation, with no need for detailed system planning beyond the antenna locations. The research examines different aspects of picocell system performance and design, including: Investigation on the indoor radio environment. Through measurements, the effects of building features on path loss and shadowing are analysed and propagation models are proposed for simulating picocell systems. Analysis of the Intelligent Picocell architecture, two algorithms are proposed for interference reduction, one based on a distributed narrowband optimum combiner and the other on a dynamic channel assignment and allocation scheme. Through simulation, it was demonstrated that the mobile transmitted power for an Intelligent Picocell is lower than the power required in a distributed antennas system. It was also shown that the capacity of the system depends on the number of antennas distributed in the building. Key words: Intelligent picocell, adaptive antennas, diversity, distributed antennas, dynamic channel allocation, propagation measurements.
Text Segmentation from Images with Various Light Conditions Based on Gaussian Mixture Model

Standard Gaussian Mixture Model (GMM) is a well-known method for image segmentation. However, one of its problems is that we consider the pixel as independent to each other, which can cause the segmentation results sensitive to noise. It explains why some of existing algorithms still cannot segment texts from the background clearly. Therefore, we present a new method in which we incorporate the spatial relationship between a pixel and its neighbors inside 3x3 windows to segment the text. Our approach works well with images containing texts, which has different sizes, shapes or colors in case of light changes or complex background. Experimental results demonstrate the robustness, accuracy and effectiveness of the proposed model in image segmentation compared to other methods.
The Silent Backdrop: Colonial Anxiety at the Border

Through the categorization of movers, states determine and fix the belonging of migrants and thereby reproduce the nation‐state system as a global reality. Some movers, however, are deemed illegible and must be identified, labelled and thus brought within the system. This paper unpicks the legal consequences of a “coloniality of power” (Quijano, 2000) embedded within the border system as a whole. The paper demonstrates this process through a post‐colonial examination of Somali migration and the application of the 1951 Refugee Convention at the UK border. The Somali migrant, like his colonized predecessor, is constructed as an unreliable informant of him/herself; a “lying native” (Bhabha, 1994) whose identity can be ‘discovered’ by the tools of the enlightened West.
Evaluation of essays using incremental training for Maximizing Human-Machine agreement

Massive Open On-line Courses(MOOCs) have large number of submissions which make automatic evaluation an appropriate choice for assessments. Project aims to Maximize Human-Machine agreement for automatic evaluation of textual summaries or essays in MOOCs leading to near-human accuracy by Incorporating missing features (in specific cases). It also involves study of techniques for automatic evaluation of textual summaries using Machine learning,Natural Language processing & Making use of varied data of MOOCs for incremental training purposes. Propose a method for improving training & evaluation process for greater Human-Machine agreement. Chapter