Miracle-dz/UniFAR-FTUs huggingface dataset:
Probabilistic load flow by a multilinear simulation algorithm

Load flow analysis is undoubtedly the most useful method of designing and operating power systems. The input data necessary for these studies are best described by random variables, considering the probabilistic nature of loads, generation and networks. The effects of uncertainties on the steady-state behaviour of power systems can be evaluated by a stochastic or probabilistic load flow (PLF) analysis. The authors present a new method for obtaining the PLF solution, by combining Monte Carlo simulation techniques and linearised power flow equations for different system load levels. The performance of the proposed algorithm is illustrated through the IEEE 14-busbar test system, and also through its application in part of the Brazilian network. >
Distributed video coding complexity balancing method by phase motion estimation algorithm

Distributed video coding is a coding paradigm that allows complexity to be shared between encoder and decoder, in contrast with conventional video coding. We propose that complexity balancing method of encoder/decoder by phase motion estimation algorithm. The encoder performs partial motion estimation. The result of the partial motion estimation is transferred to the decoder, and the decoder performs motion estimation within the narrow range. When the encoder can afford some complexity, complexity balancing is possible. The method proposed is able to know relativity between complexity balancing and coding efficiency. The coding efficiency increase rate by the encoder complexity increases is higher than that by the decoder complexity increases. The proposed method can control the complexity and coding efficiency according to devices' resources and channel conditions.
Incremental Regressive Learning Algorithm of Support Vector Machine and its Application

There is no incremental learning ability for the traditional support vector machine (SVM) and there are all kind of merits and flaws for usually used incremental learning method. Normal SVM is unable to train in large-scale samples, while the computer’s memory is limited. In order to resolve this problem and improve training speed of the SVM, we analyze essential characteristic of SVM and bring up the incremental learning algorithm of SVM based on regression of SVM related to SV (support vectors). The algorithm increases the speed of training and can be able to learning with large-scale samples while its regressive precision loses fewer. The experiments show that SVM performs effectively and practically. Its application to prediction of the transition temperature (Tg) for high molecular polymers show that this model (R2=0.9427) proved to be considerably more accurate compared to a ANNs regression model (R2=0.9269).
Measuring the Appropriateness of Automatically Generated Phrasal Paraphrases

The most critical issue in generating and recognizing paraphrases is developing a wide-coverage paraphrase knowledge base. To attain the coverage of paraphrases that should not necessarily be represented at surface level, researchers have attempted to represent them with general transformation patterns. However, this approach does not prevent spurious paraphrases because there is no practical method to assess whether or not each instance of those patterns properly represents a pair of paraphrases. This paper argues on the measurement of the appropriateness of such automatically generated paraphrases, particularly targeting at morpho-syntactic paraphrases of predicate phrases. We first specify the criteria that a pair of expressions must satisfy to be regarded as paraphrases. On the basis of the criteria, we then examine several measures for quantifying the appropriateness of a given pair of expressions as paraphrases of each other. In addition to existing measures, a probabilistic model consisting of two distinct components is examined. The first component of the probabilistic model is a structured N-gram language model that quantifies the grammaticality of automatically generated expressions. The second component approximates the semantic equivalence and substitutability of the given pair of expressions on the basis of the distributional hypothesis. Through an empirical experiment, we found (i) the effectiveness of contextual similarity in combination with the constituent similarity of morpho-syntactic paraphrases and (ii) the versatility of the Web for representing the characteristics of predicate phrases.
Research on Data Mining Optimization and Security Based on MapReduce

The paper addressed the issues of limited resource for data optimization for efficiency, reliability, scalability and security of data in distributed, cluster systems with huge datasets. The study’s experimental results predicted that the MapReduce tool developed improved data optimization. The system exhibits undesired speedup with smaller datasets, but reasonable speedup is achieved with a larger enough datasets that complements the number of computing nodes reducing the execution time by 30% as compared to normal data mining and processing. The MapReduce tool is able to handle data growth trendily, especially with larger number of computing nodes. Scaleup gracefully grows as data and number of computing nodes increases. Security of data is guaranteed at all computing nodes since data is replicated at various nodes on the cluster system hence reliable. Our implementation of the MapReduce runs on distributed cluster computing environment of a national education web portal and is highly scalable.
Comment on “A Model for Studying Display Methods of Statistical Graphics”

In his opening section Cleveland writes provocatively: "It is not true that the selection of statistical information is the only critical part and that virtually any method of display suffices. " This is so aptly demonstrated that even a reader who only browses the article benefits from looking at the sample graphs. The "good/bad" examples show how important properties of time curves are disclosed by selecting the right aspect ratio, and how grid lines can greatly facilitate comparisons between displays. Another example shows how data from an experimental design with as many as three factors can be shown in a simple two-dimensional display so that one sees the main effects and interactions at work before turning to abstract p values and F ratios based on often doubtful assumptions. Why do some graphs work and others do not? There are scientific reasons for it that have to do with the properties of the human visual system, and these reasons are the focus of the article. However, the goal is not to contribute to the science of visual information processing, but rather, as the author states, it is "an engineering one": It is to derive rationales for the design of better display methods. 1. PARALLEL AND SERIAL VISUAL PROCESSES As many authors in vision research, Cleveland feels that there are two profoundly different modes of visual processing. He calls them "pattern perception" and "table lookup. " Pattern perception consists of detection of graphical elements, grouping them so to detect structure and compare quantitative physical aspects of different elements. Table look-up means to actually decode quantitative or categorical information in the data, mainly by relating them to the scales given in the display. This distinction is reminiscent of, but not identical to, a common distinction in vision research: There is much empirical evidence to support a primary, fast, parallel visual process that instantaneously integrates information over the whole visual field that has been called preattentive vision (Julesz 1981; 1984). There is also evidence that supports a secondary visual process that can only process a small part of the visual field at a time, and that therefore scans the field in a slow and serial way. This process has been called
Feature weighting and instance selection for collaborative filtering

Collaborative filtering uses a database about consumers' preferences to make personal product recommendations and is achieving widespread success in e-commerce nowadays. In this paper we present several feature-weighting methods to improve the accuracy of collaborative filtering algorithms. Furthermore, we propose a method to reduce the training data set by selecting only highly relevant instances. We evaluate various methods on the well-known EachMovie data set. Our experimental results show that mutual information achieves the largest accuracy gain among all feature-weighting methods. The most interesting fact is that our data reduction method even achieves an improvement of the accuracy of about 6% while speeding up the collaborative filtering algorithm by a factor of 15.
SDAI: a key piece of software to manage the new wideband backend at Robledo

A joint collaborative project was recently developed to provide the Madrid Deep Space Communications Complex with a state-of-the-art wideband backend. This new backend provides from 100MHz to 6 GHz of instantaneous bandwidth, and spectral resolutions from 6 to 200 kHz. The backend includes a new intermediate-frequency processor, as well as a FPGA-based FFT spectrometer, which manage thousands of spectroscopic channels in real time. All these equipment need to be controlled and operated by a common software, which has to synchronize activities among affected devices, and also with the observing program. The final output should be a calibrated spectrum, readable by standard radio astronomical tools for further processing. The developed software at this end is named "Spectroscopic Data Acquisition Interface" (SDAI). SDAI is written in python 2.5, using PyQt4 for the User Interface. By an ethernet socket connection, SDAI receives astronomical information (source, frequencies, Doppler correction, etc.) and the antenna status from the observing program. Then it synchronizes the observations at the required frequency by tuning the synthesizers through their USB ports; finally SDAI controls the FFT spectrometers through UDP commands sent by sockets. Data are transmitted from the FFT spectrometers by TCP sockets, and written as standard FITS files. In this paper we describe the modules built, depict a typical observing session, and show some astronomical results using SDAI.
Multi-reflection algorithm for timed statistical coupled noise checking

An algorithm has been formulated to predict the composite coupled noise signature at the receiver input for impedance mismatches associated with the package/chip interface. The formulation results in an efficient vectorized format for the reflected waves such that execution time is reduced while noise prediction approaches circuit simulation accuracy. A test case is presented to show the improvement in accuracy by accounting for reflections, when compared to circuit simulation as a benchmark. A brief discussion of execution time is also included.
Law and Morals: Warnock, Gillick and Beyond

doctrinal words does not necessarily mean that they are always understood in the same way. One would not guess that the development of the sciences has led to new ways of handling data from the past, from which sacred books could not be exempt, so that a flood of new light has been shed on the Bible. (Officially Islam has not yet come to terms with the same procedures with respect to the Koran, but sooner or later it will have to.) As instances of what is lacking in this book let us take the work of three major British scholars of our time, James Barr on the Bible, Michael Polanyi on the philosophy of science, and Owen Chadwick on The Secularisation of the European Mind in the Nineteenth Century: none of them has influenced it. Mary Hesse is indeed quoted, but one would not get much idea of the depth ofher contribution from what is quoted. Russell's theological comments on the contemporary scene therefore seem somewhat jejune, and his efforts to be fair are taxed at this point. He makes valid criticisms of the simplistic type of scientific positivism, which is by no means dead, but he needs subtler weapons and a greater sense of the reciprocity of the relationship between natural science and Christian theology to do full justice to his theme.
Evaluation of Gore-Tex Graft Patency in Hemodialysis Access

Aim The purpose of this retrospective study was to analyze the patency and complications of Gore-Tex grafts used in hemodialysis (HD) access. Methods In the last 16 years, 1649 surgical procedures were performed on 655 patients to ensure and maintain permanent HD access. The study group consisted of 64 HD patients on whom 81 vascular synthetic PTFE Goretex grafts were performed. There were 28 males and 36 females, 3 of them were children (4.7%). Mean age was 54.2 years (range 15–77). Two types of Gore-Tex prosthesis were used: Diastat and Stretch. All grafts were implanted in the upper extremities. Kaplan-Meier survival curves were calculated to determine primary and secondary patency. Log-rank analysis was used to determine differences between curves. Results Primary and secondary patency at 12 months was 52.5% and 67.5%, and at 18 months respectively 41.5% and 58.2%. The Diastat graft had a lower primary and secondary patency compared with the Stretch graft (respectively p = 0.02 and p = 0.008). Factors such as gender, coexisting diabetes and hypertension did not determine graft patency. Thrombosis was one of the most frequent complications. The remaining complications included stenosis, pseudoaneurysms, infection, steal syndrome and seroma. Conclusion On the basis of our experience Stretch grafts appear a better option for creating vascular access for HD than Diastat grafts.
Models for networks: a cross‐disciplinary science

This article is an incomplete review of the rapidly growing research on network models. It focuses chiefly upon contributions to network science that have been made by sociologists, physicists, and statisticians. It addresses several topics in the area of dynamic network modeling, which is perhaps the most challenging area of current active research. Several issues in dynamic network modeling are discussed in the context of two applications: baboon grooming networks and growth in the Wikipedia. WIREs Comp Stat 2012, 4:13–27. doi: 10.1002/wics.184
A density-based approach to node clustering in decentralized peer-to- peer networks

Efficient organization of the nodes in decentralized peer-to-peer (P2P) networks is a challenging problem, especially in the absence of a global schema. Node clustering is an available way to optimize infrastructure and decrease traffic cost in P2P networks. This paper proposes a Density-based Distributed Node Clustering (DDNC) approach to discovering clusters in P2P networks. This approach is completely distributed, in which each node only depends on the knowledge of its neighbors for node clustering. Unlike other graph based algorithms, the DDNC approach utilizes density of node's neighbor for discovering clusters. For a given node, the DDNC determines its neighbor density by computing the link time with its neighbors, which not only considers the node connectivity but also connection quality. The DDNC scheme can also dynamically adapt its clusters according to the participation and departure of nodes. Experimental results have shown ours scheme's feasibility and efficiency.
CELP coding at 6.55 kbit/s for digital mobile radio communications

The work carried out in designing a speech codec suitable for the half-rate channel of the pan-European digital mobile radio (DMR) system is described. A set of CELP (code-excited linear prediction) schemes was selected with bit-rates around 7 kb/s, on the basis of performance without channel errors and complexity. Then the selection of a single scheme was made, taking into account performance with channel errors. The effect of transmission errors was evaluated by measuring the spectral distortion and the segmental signal-to-noise ratio (SNR) for each corrupted bit of the encoded parameters. These data, combined with informal listening tests, resulted in the definition of classes of importance for the bits. The bit error rate (BER) thresholds at which the distortion, due to errors, is perceived were determined for each class. This information was used to optimize the design of a channel coder for the selected speech coder. <<ETX>>
Application of rough set for medical images data mining

To study the application of Rough set algorithm for diagnosis breast cancer, attribute reduction strategies of rough set are applied to the data mining of the mammography classification, proposes a medical images classifier based on association rules. Attribute reduction strategies of rough set for medical image data mining are realized. The experiment results are given. The experimental results show that the system performs well in accuracy, verified the great potential of rough set in assistant medical treatment.
Distribution and stability of charges in porous polypropylene films

The porous polypropylene films have an interesting morphology and peculiar charge distribution. Electric breakdown, which takes place in the voids during high voltage corona charging, is responsible for their internal distribution. The heterocharges created during this process are trapped around the voids. The homocharges injected into the outer layers during the corona charging initially outweigh the heterocharges. However, the homocharges are dissipated more rapidly during heating, and so the surface potential changes sign during charge-TSD. The complex charge distribution within porous propylene was calculated from the pyrocurrent spectra using an approximation suggested by Ploss (1994). This method is rarely used despite its simplicity.
Product design enhancement by integration of virtual design and assembly analysis tools

Assembly is a necessary and important part of any manufacturing process. Computer aided production engineering allows production engineers to create an on‐screen virtual manufacturing environment which graphically displays and simulates actual manufacturing processes. This is an attempt to analyse the assembly process for a computer mouse, using both the Boothroyd and Dewhurst design for assembly (DFA) and Tecnomatix’s Dynamo software package. A mouse designed in Unigraphics has been the product considered and the assembly process has been analysed. Some of the steps involved in the analysis are explained in detail and the observations and results are discussed along with redesign suggestions. These software systems can help identify some of the technical problems that can possibly be encountered in real life production and can effectively be used to guide the design process. Product assembly, analysis and visualization, which are the prime features of the software in use, enable us to improve the design and enhance the features of products at the conception and design stage itself. This can be a critical factor for maintaining a competitive edge in the fast growing industry today.
Direct Execution of Esterel Using Reactive Microprocessors

This paper proposes a new reactive multiprocessor for direct execution of Esterel programs. While Esterel programs have been compiled to both hardware and software, each has its own limitations. Hardware compilers, while being e‐cient, are quite in∞exible. Software compilers, on the other hand, are ∞exible, but produce both bulky and ine‐cient code. This is because of the generation of generic code independent of the underlying architecture. This paper proposes an intermediate approach, using architecture speciflc compilation. Firstly, a suitable multiprocessor (called EMPEROR) is designed where each individual processor has native Esterellike instructions. These processors are synchronised exactly like Esterel using a Thread Control Unit (TCU) that generates the Esterel tick event using barrier synchronisation. Subsequently, a compiler is developed that takes advantage of the features available on EMPEROR to generate direct machine code from the Esterel source. Benchmarking results using the proposed approach reveals signiflcant improvement in code quality compared to conventional compilation, both in terms of code size and execution time.
Self-protected long-reach 10 Gbits/s EPONs based on a ring architecture

We describe and study the feasibility of a novel network architecture for self-protected long-reach 10 Gbits/s Ethernet passive optical networks (EPONs) aiming for a scenario based on a converged access and metro infrastructure. The network relies on an amplified ring feeder to properly interconnect several EPONs to a single optical line terminal. The network performance is evaluated using computer simulations at both physical and logical layers, taking into account the service and protection operational states. The study developed in the optical layer assesses the impact of several physical impairments in the upstream and downstream transmission, while the logical analysis evaluates the performance of different dynamic bandwidth allocation algorithms operating in the medium access control layer of the upstream channel. The results obtained prove the feasibility of the proposed network considering a ring extension of 100 km, supporting four EPONs of 32 optical network units each and operating at 10 Gbits/s.
A Study on the Analyzing International Cooperation Using Bibliometrics : Focused on LED

【This study is intended for international cooperation in the field of LED were analyzed. The results, LED wide coverage areas, and a promising future is expected to grow fast enough to occupancy for a major national technology is a competitive situation. Chip Scale Package, including our country, such as LED manufacturing technology that might be competitive in parts, but new technologies such as renal substrate R&D and technology development still active preemption is not the situation. Renal substrate, particularly, large-diameter sapphire, large size/large LED manufacturers, such as a promising area for future research and development support will be needed. To do this, previous research in this area and the U.S., Japan cooperation in such studies also will need to expand. Bibliometrics way through this study, analytical techniques and analytical tools used in the integrated analysis of the usefulness and necessity of the system development were found. 】
Do parallel lines meet? How can pathway participation metrics and eigenvalue analysis produce similar results?

The search for tools and techniques aimed at model analysis has gained momentum in the system dynamics community during the last decade. A variety of approaches have been developed, modified and applied to replace or enhance the traditional intuitive-based schemes for understanding the behavior of dynamic models according to their feedback structure. In spite of the diversity of the methods developed for model analysis, recent studies suggest that there is considerable convergence in the results they produce. This paper explores the metrics used by the pathway participation approach and eigenvalue elasticity analysis in order to explain how, despite the significant differences in the process of model analysis, they can produce similar and comparable results. The paper discusses the application of pathway participation metrics in four well-known models that have been previously analyzed using the eigenvalue elasticity method. The case studies highlight some of the similarities and differences between the two approaches in detecting the dominant structure. Copyright © 2009 John Wiley & Sons, Ltd.
The Research of the Semi-Generative CAPP System Design Based on Rough Set

The current CAPP system has complicated operation, not high degree of intelligence, can not meet the needs of many varieties of small batch production. This paper combines the method of parts surface elements describing and method of parts coding. Formed by the 20-bit code to establish a hybrid coding system, used rough set to extract the parts feature, used the information system method to reduce the rule of processing, and from match the feature and the expert knowledge base, Automatic selection processing methods to generate process routes; use database technology to build parts diagrams and other databases, semi-automatic process documentation.