Miracle-dz/UniFAR-FTUs huggingface dataset:
KareemNaaz Matrix Divide and Sorting Algorithm

Sorting is a process of arranging data in a specific order according to requirements of Application. Efficient sorting brings orderliness in the data. Many sorting algorithms are proposed. Each algorithm has its own advantages and disadvantages. In this paper an efficient matrix sorting algorithm called as KareemNaaz Matrix Divide and Sorting Algorithm is proposed. The proposed Matrix Sorting Algorithm takes a matrix of order (mxn) as input. It recursively divides the given matrix of order (mxn) into two groups of rows of matrix, based on the middle row. Each group of rows consists of m/2 rows of matrix. First group contains rows from first row to middle row of matrix and second group contains rows from middle+1 row to last row of matrix. Recursively groups of rows are selected and divided into sub groups of rows. If sub group of rows contains only one row, then it is divided into two groups of columns, based upon the middle column of row, each group of columns consists of n/2 columns. First group contains columns from first column to middle column of row, second group contains columns from middle+1 column to last column of row. Recursively groups of columns of row are selected and divided into sub groups of columns. If sub groups of columns contains single column then combine and sorting of those columns takes place. I followed the various stages of Software Development Life Cycle to demonstrate the proposed sorting algorithm. Section I will give introduction about proposed sorting algorithm. In section II, proposed Algorithm is Analyzed and Designed. In section III, proposed algorithm is Implemented using C programming Language. In section IV, I tested the implementation of proposed algorithm using different test cases. In section V, I concluded the proposed Algorithm.
Quantifying a Paper’s Academic Impact by Distinguishing the Unequal Intensities and Contributions of Citations

Citation count is a widely-used indicator for calculating the academic impact of scientific papers, but it is limited because it assumes all citations are of similar value and weights each equally. By examining the influence changes in papers’ citation distribution and the cited papers’ unequal contributions to the citing ones, this study aims to distinguish citations and, on this basis, evaluate the academic impact of the papers. Three indices of time-weighted citation count, citation width and citation depth are proposed to distinguish citations and perform the evaluation task. The experimental results show that papers exhibit different influence intensity characteristics in different periods of citation life. Those papers got larger citations in recent years are more influential and more active to gain new citations. The papers show the different scope of influence in their citing environment, although they were originally published in the same journal and the same year. In addition, the different frequency of mentions and the different subject similarities with the citing works suggest that the papers have different importance and usefulness for subsequent research. These results suggest that these three indices do help to distinguish citations and reveal the different intensity and contribution of influences in citations. Finally, the three indices are integrated into the overall evaluation of the academic impact of the paper, and the weight of each index is calculated by the entropy weight method. Quite different overall impacts in the paper are shown due to their different performances in the three indices, even though they have the same total number of citations.
Overcurrent Protection Control Design for DC-DC Buck Converter With Disturbances

This paper deals with the output voltage regulation problem for dc–dc buck converters. Overcurrent protection and disturbances are both taken into consideration. The main challenge of control design is how to ensure that the current constraints are not violated at any time in the presence of disturbances. At first, a high-gain disturbance observer is utilized to estimate the disturbances. Then, a novel punishment mechanism for the inductor current is designed in the control scheme. Finally, based on the novel current-constrained technique and the high-gain disturbance observer, a composite control approach is proposed. The new control method not only guarantees the current within the required range but also has a nice ability on the disturbance rejection. In the meantime, rigorous stability proof is also presented. The theoretical analysis also explains how disturbances affect the satisfaction of the current constraints. The experimental results on a buck converter system are illustrated to verify the feasibility and effectiveness of the proposed control scheme.
Numerical simulation of gear pumps

We present in this paper a complete numerical strategy for the study of two gear pumps. This work includes all the steps to follow from the treatment of the CAD geometry until the analysis of the simulation results. In particular we treat the CAD simplification, the meshing of the geometry, the numercial strategy and, finally, the analysis of simulation results.
Dependence of Switching Probability on Operation Conditions in GexSe1–x Ovonic Threshold Switching Selectors

Ovonic threshold switching (OTS) selector is a promising candidate to suppress the sneak current paths in resistive switching random access memory (RRAM) arrays. Variations in the threshold voltage (<inline-formula> <tex-math notation="LaTeX">${V} _{\text {th}}$ </tex-math></inline-formula>), and the hold voltage (<inline-formula> <tex-math notation="LaTeX">${V} _{\text {hd}}$ </tex-math></inline-formula>) have been reported, but a quantitative analysis of the switching probability dependence on the OTS operation conditions is still missing. A novel characterization method is developed in this letter, and the time-to-switch- ON/OFF (<inline-formula> <tex-math notation="LaTeX">$\text{t}_{ \mathrm{\scriptscriptstyle ON}}/\text{t}_{ \mathrm{\scriptscriptstyle OFF}}$ </tex-math></inline-formula>) at a constant <inline-formula> <tex-math notation="LaTeX">${V} _{\text {OTS}}$ </tex-math></inline-formula> is found following the Weibull distribution, based on which the dependence of switching probability on pulse bias and time can be extracted and extrapolated, and the switching probability can be ensured with appropriately chosen operation conditions. The difference between square and triangle switching pulses is also explained. This provides a practical guidance for predicting the switching probability under different operation conditions and for designing reliable one-selector-one-RRAM (1S1R) arrays.
TEAVAR: striking the right utilization-availability balance in WAN traffic engineering

To keep up with the continuous growth in demand, cloud providers spend millions of dollars augmenting the capacity of their wide-area backbones and devote significant effort to efficiently utilizing WAN capacity. A key challenge is striking a good balance between network utilization and availability, as these are inherently at odds; a highly utilized network might not be able to withstand unexpected traffic shifts resulting from link/node failures. We advocate a novel approach to this challenge that draws inspiration from financial risk theory: leverage empirical data to generate a probabilistic model of network failures and maximize bandwidth allocation to network users subject to an operator-specified availability target. Our approach enables network operators to strike the utilization-availability balance that best suits their goals and operational reality. We present TEAVAR (Traffic Engineering Applying Value at Risk), a system that realizes this risk management approach to traffic engineering (TE). We compare TEAVAR to state-of-the-art TE solutions through extensive simulations across many network topologies, failure scenarios, and traffic patterns, including benchmarks extrapolated from Microsoft's WAN. Our results show that with TEAVAR, operators can support up to twice as much throughput as state-of-the-art TE schemes, at the same level of availability.
1H‐31P magnetic resonance spectroscopy: effect of biotin in multiple sclerosis

Biotin is thought to improve functional impairment in progressive multiple sclerosis (MS) by upregulating bioenergetic metabolism. We enrolled 19 patients suffering from progressive MS (5 primary and 14 secondary Progressive‐MS). Using cerebral multinuclear magnetic resonance spectroscopy (MMRS) and clinical evaluation before and after 6 months of biotin cure, we showed significant modifications of: PME/PDE, ATP, and lactate resonances; an improvement of EDSS Neuroscore. Our results are consistent with metabolic pathways concerned with biotin action and could suggest the usefulness of MMRS for monitoring.
A Heuristic Algorithm for MPMGOOC

Maximum Pattern Matching with Gaps and the One-Off Condition(MPMGOOC) is an interesting and challenging pattern matching problem,which seeks to find the maximal number of occurrences of a pattern in a sequence.In this paper,a heuristic algorithm based on a new nonlinear data structure,Nettree,is proposed for this problem.A Nettree is different from a regular tree in that a node may have more than one parent.The algorithm is named Selecting Better Occurrence(SBO). SBO uses some special concepts and properties of the Nettree to solve the task.In the loop of finding an occurrence,SBO uses two strategies,Strategy of Greedy-Search Parent(SGSP) and Strategy of RightMost Parent(SRMP) to find two occurrences with the same leaf,and then selects a better occurrence from the results of SGSP and SRMP.The main ideas of SGSP and SRMP are to find an Approximately Optimal Parent(AOP) and the rightmost parent of the current node at each step in the process of searching for an occurrence,respectively.Extensive experimental results on real-world biological data demonstrate that SBO achieves the best performance among all competitive algorithms in terms of solution quality.This paper not only provides a heuristic solution for the MPMGOOC problem,but also shows that the Nettree can be used to solve other complex problems.
Quatification Methods of the Checks and Balances System Study

The article deals with the main quantification methods of the system of checks and balances. Taking into account the main historical stages of the development of ideas concerning the functioning of the checks and balances system, on the basis of the comparative method, the main features of understanding the functioning of different aspects of checks and balances system by using mathematical methods are emphasized. Having systematized mathematical techniques, the author of the article offers its own typology on the basis of highlighted criteria. The classification of quantification methods including methods of studying the level of presidentialism, methods to compare the powers of the president and parliament, methods related to the calculation of parliamentary powers, is proposed. The features and peculiarities of all these methods are critically considered in the article. Each quantification methods is analyzed in detail and special attention in the article is paid to the main the disadvantages of their use in the study of checks and balances system as a whole. The article provides a description of the technics and formulas used in the application of each of methods. It is emphasized that a part of the methods are used to rank the states in the form of government, while another part is used to index and create a common list of states by this or that index accordingly. But all of these methods are focused on a specific component of the checks and balances system and are aimed at the sphere of the influence of a separate political player indexing. A comprehensive mathematical method for the system of checks and balances as a basic guarantee of democratic functioning needs to be proposed.
Managing Schema Change in an Heterogeneous Environment

“Nothing endures but change. ” –By Heractilus Change is inevitable even for persistent information. Effectively managing change of persistent information, which includes the specification, execution and the maintenance of any derived information, is critical and must be addressed by all database systems. Today, for every data model there exists a well-defined set of change primitives that can alter both the structure (the schema) and the data. Several proposals also exist for incrementally propagating a primitive change to any derived information (or view). However, existing support is lacking in two ways. First, change primitives as presented in literature are very limiting in terms of their capabilities allowing users to simply add or remove schema elements. More complex types of changes such the merging or splitting of schema elements are not supported in a principled manner. Second, algorithms for maintaining derived information often do not account for the potential heterogeneity between the source and the target. The goal of this dissertation is to provide solutions that address these two key issues. The first part of this dissertation addresses the challenge of expressing
Robustness of road network for assessing the resilience of the network

Road network infrastructures are important public assets that play crucial services in economic development like trade and community services like emergency services. The absence of road network connectivity by flooding, accident, strategic terrorist attack and traffic jam critically and strongly affects the operation of the entire road network [1]. Using a representative three km radius OSM sample data of Addis Abeba‟s city road network and by measuring the giant component size and diameter change caused by both strategic and random node removal, we assessed the robustness of the network. By simultaneously analyzing the robustness result with global efficiency measure, as an availability measure of the route, we finally assessed the resilience of the network. Our result shows that from giant component size measure, the road network was robust from randomly removing 24% pc value of nodes than strategically removing 4% pc value of nodes. The diameter measure increases from 39 to 51 paths and from 39 to 43 paths against random and strategic node removal respectively. From diameter measure, we conclude that a decreasing diameter measure in response to BC based strategic node removal does not always show a robust network. Rather, the physical structural connectivity determines the robustness measure. In conclusion, greater than 88% of the network was vulnerable for both strategic and random node removal and were not able to be robust and resilient as well. Thus, this finding gives an ample understanding of the cities road network robustness and resilience. Therefore, city planners and administrators can infer about the need of the cities road networks re-design and expansion activities. Additionally, this study helps them to see the city road network‟s vulnerability against betweenness centrality based strategic attack than randomly attacking the road network and this later helps to identify points of BC measures.
Espectroscopia por FTIR de variedades híbridas de bagaço de cana-de-açucar pré-tratados para produção de etanol celulósico

A energia e imprescindivel para a economia e para o desenvolvimento do pais. A iminente escassez de combustiveis fosseis e as atuais preocupacoes ambientais tem despertado uma nova corrida para as fontes de energia renovavel. No Brasil, o uso do etanol de primeira geracao e produzido por meio da fermentacao do caldo de cana e o etanol de segunda geracao ou etanol celulosico e produzido a partir do bagaco da cana-de-acucar. O bagaco e normalmente queimado no proprio ambiente onde e produzido para geracao de energia no processo de extracao do caldo, podendo ser aproveitado para aumentar a producao de etanol celulosico. Neste trabalho, sao apresentados resultados com base na utilizacao da espectroscopia no infravermelho por transformada de Fourier (FTIR) para caracterizar o processo de fragmentacao do bagaco, visando a producao de etanol celulosico, a otimizacao do processo e ao entendimento teorico e experimental da espectroscopia por FTIR. A tecnica de FTIR foi utilizada para caracterizar o bagaco pre-tratado de cinco variedades hibridas de cana-de-acucar e para detectar diferencas entre essas variedades para producao de etanol. As amostras foram dividas da seguinte maneira: (a) Bagaco in natura; (b) Bagaco Extraido; (c) Celulignina; (d) Polpa celulosica. Foram caracterizadas 20 amostras. Em (a), as amostras foram apenas moidas com o objetivo de identificar as caracteristicas opticas do bagaco sem tratamento. Em (b), o bagaco foi pre-tratado com agua e etanol para extracao dos compostos nao estruturais. Na etapa (c), o bagaco sofreu hidrolise acida com acido sulfurico para romper a estrutura lignocelulosica e para remover o conteudo de hemicelulose. Na etapa (d), o bagaco sofreu hidrolise alcalina com hidroxido de sodio para remover o maior conteudo possivel de lignina. Nas vibracoes moleculares do bagaco in natura, foram obtidas bandas entre 1000 e 890 cm-1 que identificam a celulose; entre 1200 e 1000 cm-1 para hemicelulose e celulose; 1247 cm-1 para hemicelulose e lignina; entre 1430-1300 cm-1 com sobreposicao para bandas de celulose, hemicelulose e lignina; entre 1610-1460 cm-1 para lignina; 1735 cm-1 para hemicelulose; entre 2920-2850 cm-1 para celulose; e entre 3800-3000 cm-1 para caracteristicas de celulose cristalina. No processo de extracao com agua e etanol, nao houve diferenca. A hidrolise acida foi efetiva na ruptura da estrutura lignocelulosica e na remocao de grande parte da hemicelulose, o que foi determinado pela diminuicao ou pelo desaparecimento de algumas bandas. A hidrolise alcalina removeu parte da lignina e foi responsavel pelas mudancas na estrutura lignocelulosica, comprovadas pelos deslocamentos de algumas bandas. Concluiu-se que o bagaco de cana pre-tratado com hidrolise acida e alcalina tem otimas condicoes de utilizacao para hidrolise enzimatica e para fermentacao a etanol e que as variedades de bagaco respondem de forma semelhante ao pre-tratamento.
Performance validation of an IEEE 802.11a receiver

Wireless Local Area Networks (WLANs) were developed as a replacement for wired networks. They found their application in large data driven (TCP/IP) environments such as airports, conferencecenters, and offices. By now wireless products are more and more used in an in-home environment, e.g. for streamingaudio and video applications. However the WLAN standard was never intended for in-home operation and often these systems suffer from a lack robustness. To improve this robustness and to enhance the quality of service (QOS), diversity techniques are being developed. The most commonly used diversity method is selection diversity. The receiver (and/or transmitter) here selects from a set of antennas the one that results in the best performance. Delay diversity is a second method. It can also be used by either the transmitter or the receiver or both. Delay diversity in principle creates frequency-selectivity in the transmission band and this improves the robustness (diversity) of a system. Recently a real-time concept validator (RT-CV) for delay-diversity for IEEE 802.11a was developed and tested at Philips Research Laboratories. This RT-CV did not show any diversity gain however. The objective of this master’s thesis project was to find out why the delay-diversity concept did not perform as well as was to be expected. In the first part of this thesis-project we focussed on the expected performance of an IEEE 802.11a system under different transmission scenarios. This performance was obtained from Monte-Carlo simulation with a floating-point model of the system. All functional blocks of the transmitter were already validated earlier and we therefore could assume throughout our investigations that the transmitter did not suffer from unacceptable performance degradation. The next step was to validate the receiver. The first hardware block in the receiver that was tested was the analog digital (AD)-converter. From the measurements we could conclude that the converter suffered from severe performance degradation. Therefore the rest of the receivervalidation was done using an external AD-converter. Problems with this external AD-converter related to IQ-imbalance were solved using a delay element in one of the demodulator branches. Finally the performance of the entire receiver-chain was measured. This resulted in the hypothesis that the receiver equalizer causes a significant performance degradation. This hypothesis was verified by simulations, by which we compare the implemented equalizer to two newly proposed implementations. We also suggest a modification of the de-mapper. As a result we could conclude that the performance degradation of the proposed implementations were acceptable for all the measurement scenarios, including delay diversity.
High-accuracy 3D indoor Positioning Algorithm Based on P440 Ultra-wideband Ranging and Communication Module

Many indoor mobile robotic applications require knowledge of the exact robot location within the work environment, for completing typical tasks. However, the accuracies of the existing indoor location-tracking systems are quite unsatisfactory. Therefore, this paper introduces a high-accuracy 3D indoor positioning approach that uses a weighted nonlinear least-squares (WNLS) method. The method is tested with a set of indoor wireless sensor networks (WSNs) that employ ultra-wideband (UWB) sensors. The P440 UWB ranging and communication modules (RCMs) are utilized in this study, and both the NLS and WNLS methods are investigated. The results indicate that the WNLS method provides better positional accuracy than the NLS method, in 3D indoor positioning for a WSN employing uniform UWB sensors. Furthermore, the WNLS method can attain the reliability and robustness of the NLS method, irrespective of the configuration of WSNs. The WNLS method can be expected to improve the overall performance of 3D indoor positioning with UWB technologies. From our research, it can be concluded that WNLS can achieve more accurate positioning than NLS for a system that uses heterogeneous sensors for positioning, as long as the ranging errors between the sensors can be estimated.
Investigating Factors of Twitter Use among Municipal Governments

ABSTRACT This study investigates predictors of Twitter adoption and use by municipalities for citizen communication, considering both the level of municipal Twitter presence and the level of Twitter activity. Possible predictors included municipal characteristics as well as citizenry characteristics. Participants included 100 Pennsylvania municipalities drawn from a disproportionate stratified sample, evenly split between municipalities with and without a Twitter presence. No significant correlation was found between the level of municipal Twitter presence and active use of Twitter. Regression results suggest that the likelihood of adopting a Twitter account increases with greater population size and a younger population, though only population size significantly predicts the number of Twitter accounts. Regression results also suggest that a greater population size, lesser median citizen income, and a higher number of county-level Twitter accounts influence the level of Twitter activity among these municipalities.