Miracle-dz/UniFAR-FTUs huggingface dataset:
Notice of Violation of IEEE Publication Principles The Anatomy of a Large-Scale Hyper Textual Web Search Engine

In this paper, we present Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext. Google is designed to crawl and index the Web efficiently and produce much more satisfying search results than existing systems. To engineer a search engine is a challenging task. Search engines index tens to hundreds of millions of web pages involving a comparable number of distinct terms. They answer tens of millions of queries every day. Despite the importance of large-scale search engines on the web, very little academic research has been done on them. Furthermore, due to rapid advance in technology and web proliferation, creating a web search engine today is very different from three years ago. This paper provides an in-depth description of our large-scale web search engine to define the values and traditional techniques of data in hypertext. Apart from the problems of scaling traditional search techniques to data of this magnitude, there are new technical challenges involved with using the additional information present in hypertext to produce better search results. This paper addresses this question of how to build a practical large-scale system which can exploit the additional information present in hypertext. Also we look at the problem of how to effectively deal with uncontrolled hypertext collections where anyone can publish anything they want.
BLUPF90 and related programs (BGF90)

COMPUTING METHODS BGF90 is a collection of software in Fortran 90 useful for breeding & genetics applications. The package consists of library modules and application programs. The modules are designed with overloading and optional parameters so that their use is simple. Whenever applicable, the modules use well-tested low-level software in Fortran 77 or Fortran 90. The application programs deliberately avoid low-level optimization for simplicity but support a wide range of models, including those with multiple-correlated effects, multiple animal models and dominance, and they can be modified to support new features. For general description of the package, see Misztal (1999).
Online Classifier Adaptation in Brain-Computer Interfaces

Brain-computer interfaces (BCIs) aim to provide a new channel of communication by enabling the subject to control an external systems by using purely mental commands. One method of doing this without invasive surgical procedures is by measuring the electrical activity of the brain on the scalp through electroencephalography (EEG). A major obstacle to developing complex EEG-based BCI systems that provide a number of intuitive mental commands is the high variability of EEG signals. EEG signals from the same subject vary considerably within a single session and between sessions on the same or different days. To deal with this we are investigating methods of adapting the classifier while it is being used by the subject. By keeping the classifier constantly tuned to the EEG signals of the current session we hope to improve the performance of the classifier and allow the subject to learn to use the BCI more effectively. This paper discusses preliminary offline and online experiments towards this goal, focusing on the initial training period when the task that the subject is trying to achieve is known and thus supervised adaptation methods can be used. In these experiments the subjects were asked to perform three mental commands (imagination of left and right hand movements, and a language task) and the EEG signals were classified with a Gaussian classifier.
Oracle DBA Guide to Data Warehousing and Star Schemas

From the Publisher: The definitive, real-world guide to Oracle data warehousing Maximizing performance, flexibility, and manageability in production environments Hardware/software architectures, star schema design, partitioning, and more Industrial strength data loading and query optimization techniques By the world-renowned architect of 7-Eleven's multi-terabyte datawarehouse Maximize Oracle data warehouse performance, flexibility, and manageability Oracle DBAs finally have a definitive guide to every aspect of designing, constructing, tuning, and maintaining star schema data warehouses with Oracle 8i and 9i. Bert Scalzo, one of the world's leading Oracle data warehousing experts, offers practical, hard-won lessons and breakthrough techniques for maximizing performance, flexibility, and manageability in any production environment. Coverage includes: Data warehousing fundamentals for DBAs--including what a data warehouse isn't Planning software architecture: business intelligence, user interfaces, Oracle versions, OS platforms, and more Planning hardware architecture: CPUs, memory, disk space, and configuration Radically different star schema design for radically improved performance Tuning ad-hoc queries for lightning speed Industrial-strength data loading techniques Aggregate tables: maximizing performance benefits, minimizing complexity tradeoffs Improving manageability: The right ways to partition Data warehouse administration: Backup/recovery, space and extent management, updates, patches, and more
Secured Workstation to Process the Data of Different Classification Levels

The paper presents some of the results obtained within the ongoing project related with functional requirements and design models of secure workstation for special applications (SWSA). SWSA project is directed toward the combination of the existing hardware and software virtualization with cryptography and identification technologies to ensure the security of multilevel classified data by means of some formal methods. In the paper the requirements for SWSA, its hardware and software architecture, selected security solution for data processing and utilized approach to designing secure software are presented. The novel method for secure software design employs dedicated tools to verify the confidentiality and the integrity of data using Unified Modeling Language (UML) models. In general, the UML security models are embedded in and simulated with the system architecture models, thus the security problems in SWSA can be detected early during the software design. The application of UML topology models enables also to verify the fundamental requirement for MLS systems, namely the hardware isolation of subjects from different security domains. Keywords—cryptographic protection, multilevel security, software design, UML, virtualization.
Kaynak Tabanlı Yönetim Modelinin Rekabetçi Üstünlükler Açısından İncelenmesi Ve Tusaş, Ford Otosan, Graham Ve Toprak Seramik İşletmelerinde Niteliksel Bir İnceleme

Kaynak tabanli yonetim modeli, rekabetci ustunlugun nasil elde edildigi ve bu ustunlugun nasil korunduguna dair guclu bir teorik yapi sunmaktadir. Kaynak tabanli yonetim modeli, rekabetci ustunlugun kaynaklarin essiz bilesiminden elde edilecegini ileri surmektedir. Rekabetci ustunluk yaratmaya olanak saglayan kaynaklarin sahip olmasi gereken ozelliklerle ilgili olarak bircok siniflandirma olmakla birlikte, bu kaynaklarin ozellikleri dort temel grupta toplamaktadir: (1) kaynak deger yaratabilmelidir, (2) kaynak nadir olmalidir, (3) rakipler tarafindan taklit edilmesi guc ya da olanaksiz olmalidir, (4) kaynak, diger kaynak turleriyle ikame edilememelidir. Isletmeler, rekabetci cevrede varliklarini surdurebilmek icin yeni stratejik kaynaklar ve yetenekler gelistirmek zorundadir. Bu calismada kaynak tabanli yonetim modelinin “rakip isletmelerinin ulasamadigi ozel kaynak ve yeteneklere sahip olan isletmeler, surdurulebilir rekabetci ustunluk elde etmektedir” seklinde ifade edilen temel gorusunun dogrulugu sinanmak amaci ile Ford Otosan, TUSAŞ, Graham Isletmesi ve Toprak Seramik Isletmelerinde niteliksel bir arastirma yapilmistir. Bunun sonucunda ise yuksek yenilikci kapasiteye sahip olan, degisime acik ve yalin orgut yapisina sahipolan isletmelerin surdurulebilir rekabetci ustunluk elde ettikleri saptanmistir.
A new algorithm for efficient software implementation of reed-solomon encoders for wireless sensor networks

With the recent introduction and development of ad-hoc wireless sensor networks, and other miniature or low-power communications systems, high performance at a low cost is a key critical factor. Reliable data transmission from these wireless sensors is necessary, especially if the sensor end-points are transmit-only type devices. Error correction codes may be used to improve reliability of the transmission, in many instances improving the operating margin by 6dB or more (depending on the correcting power of the code). However, in many instances, the limits of the microprocessor in the transmitter, such as ROM or RAM space, as well as the power or expense necessary for implementation in hardware might discourage a design engineering team from considering error correction. This dissertation details a highly efficient, compact Reed-Solomon error correction encoder, realized entirely in software. The original version of the encoder is written in C. It requires over 250 words of program memory (ROM), 10 temporary storage registers (RAM), and takes between 575 and 1168 cycles per symbol to execute. The improved encoding algorithm in this dissertation operates at more than 18 times this speed, taking between 31 and 62 cycles to encode each symbol, requires under 60 words of ROM and only a single RAM location. Able to encode data at over 50K symbols per second on a 4 MIPS processor, this algorithm is well suited for low cost wireless sensor applications.
Simplified design approach of rectangular spiral antenna for UHF RFID tag

In this paper we present a method to simplify the calculation of spiral antennas for RFID tag settings without resorting to numerical analysis methods. It saves up to 99% of the time required by the simulation based on the method of moments. Thus we present a theoretical and experimental study for the design of the spiral antennas for RFID label in the UHF band. We present in this study the S11 parameter that enables us to evaluate the evolution of current distribution and therefore the resonance frequency of the spiral antennas. This parameter is calculated theoretically by applying the method of moments to wired antenna formed by the rectangular copper spiral printed on a dielectric substrate. The experimental validation of our theoretical models is performed using a network analyzer. The confrontation theory-experience allows us to draw some interesting conclusions concerning the number of loops of the spiral and the choice of dielectric substrate.
Extracting collocations from text. An application: language generation

Natural languages are full of collocations, arbitrary and recurrent combinations of words that co-occur more often than chance. Such combinations correspond to arbitrary word usages and are termed collocations. Recent work in lexicography indicates that collocations are pervasive in English; apparently, they are common in all types of writing, including both technical and non-technical genres. In the dissertation, we describe a set of techniques for retrieving and identifying collocations from large textual corpora. These techniques are based on statistical methods, and identify a wide range of collocations. A statistical filtering technique is described for identifying word pairs involved in a syntactic relation. The words can appear in any order and can be separated by an arbitrary number of other words. Another technique describes how n word collocations (or n-grams) can be identified in a simpler and cheaper way than other methods. The techniques also feature an original method for syntactically labeling and filtering collocations. These techniques have been implemented in a lexicographic tool, Xtract that automatically acquires collocations. Xtract identifies collocations of arbitrary length as well as more flexible collocations. The techniques are described and some results are presented on a 10 million word corpus of stock market news reports. A lexicographic evaluation of Xtract as a collocation retrieval tool estimated the precision of Xtract to be 80%. The evaluation is presented in the dissertation. As a performance task, we demonstrate how such collocations enhance the task of lexical selection in language generation. Previous language generation works were not able to account for co-occurrence knowledge for two principal reasons. They did not have the compiled information and the lexicon formalisms available were not able to properly handle collocational knowledge. The knowledge problem is handled with the use of lexicographic tools such as Xtract, and the representation problem is handled with Functional Unification Grammars (FUGs). We show how the use of FUGs allows to properly handle the interactions of collocational and various other constraints. Finally, we consider several other applications of our work such as computer assisted lexicography, information retrieval, machine translation and spelling correction.
New methods for image registration and normalization using image feature points

In this dissertation, the development and performance evaluation of new techniques for image registration and image geometric normalization, which are based on feature points extracted from images are investigated. A feature point extraction method based on scale-interaction of Mexican-hat wavelets is proposed. This feature point extractor can handle images of different scales by using a range of scaling factors for the Mexican-hat wavelet leading to feature points for different scaling factors. Experimental results show that the extracted feature points are invariant to image rotation and translation, and are robust to image degradations such as blurring, noise contamination, brightness change, etc. Further, the proposed feature extractor can handle images with scale change efficiently.
Influence Diffusion Model in Text-Based Communication

Business people, especially marketing researchers, are keen to understand peoples’ potential sense of value to create fascinating topics stimulating peoples’ interest. In this paper, we aim at finding influential people, comments, and terms contributing the discovery of such topics. For this purpose, we propose an Influence Diffusion Model in text-based communication, where the influence of people, comments, and terms are defined as the degree of text-based relevance of messages. We apply this model to Bulletin Board Service(BBS) on the Internet, and present our discoveries on experimental evaluations.
Probabilistic modeling of argument structures including non-local dependencies

We propose a method of estimating a consistent probabilistic model of argument structures, which represent non-local dependencies such as unbounded dependencies and control relations. Non-local dependencies violate the independence assumption, which is assumed in traditional probabilistic models. Our solution is to apply feature forest models, which enable the probabilistic modeling of sentence structures without the independence assumption.
Competing Strategies for Planned Orthogonal Contrasts.

Two strategies, derived from J. P. Schaffer (1986), were compared as tests of significance for a complete set of planned orthogonal contrasts. The procedures both maintain an experimentwise error rate at or below alpha, but differ in the manner in which they test the contrast with the largest observed difference. One approach proceeds directly to the test of the contrast with the largest difference at a reduced'significance level. The other is a protected procedure, first evaluating the complete null hypothesis with an omnibus "F" test, and then proceeding to test the specific hypotheses at a more liberal significance level given that the complete null hypothesis has been rejected. Monte Carlo simulation results for three and four treatment groups indicate that the relative power of the two procedures depends on the configuration of the treatment effects contained in all contrasts. Specifically, the unpro;:ected test favors configurations with relatively small amounts of variability due to treatment effects, while the protected test has more power in cases with a relatively large amount of treatment variability. Five data tables and one figure are included. (Author/SLD) *********************************************************************** Reproductions supplied by EDRS are the best that can be made from the original document. *********************************************************************** U S DEPARTMENT OF EDUCATION Oerce or EduCatrOnal Research and Improvement EDUCATIONAL RESOURCES INFORMATION CENTER (ERIC) flyri<is document has been reproduced as received from the person or organrzation originating O Manor changes have been made to improve reproduction oushty Points of view or opinions stated In this dccu ment do not necessarily represent Oh ial OERI positron or coIrcy "PERMISSION TO REPRODUCE THIS MATERIAL HAS BEEN GRANTED BY ALAN T ki.CICKARS TO THE EDUCATIONAL RESOURCES INFORMATION CENTER (ERIC). Competing Strategies
Modeling and Analysis of Architectural Styles Based on Graph Transformation∗ A Case Study on Service-Oriented Architectures

Modern architectural styles, like the service-oriented style underlying web services, are highly dynamic. This complicates not only their practical application, but also the modeling and prediction of their behavior. To account for this problem, we propose to model architectures as graphs, represented as instances of UML class diagrams, and to describe their reconfigurations by graph transformation rules. Based on a sample model for service-oriented architectures, we discuss what properties are interesting to be analyzed and how such analysis could be performed.
Smooth Surfaces For Video Game Development

The video game graphics pipeline has traditionally rendered the scene using a polygonal approach. Advances in modern graphics hardware now allow the rendering of parametric methods. This thesis explores various smooth surface rendering methods that can be integrated into the video game graphics engine. Moving over to parametric or smooth surfaces from the polygonal domain has its share of issues and there is an inherent need to address various rendering bottlenecks that could hamper such a move. The game engine needs to choose an appropriate method based on in-game characteristics of the objects; character and animated objects need more sophisticated methods whereas static objects could use simpler techniques. Scaling the polygon count over various hardware platforms becomes an important factor. Much control is needed over the tessellation levels, either imposed by the hardware limitations or by the application, to be able to adaptively render the mesh without significant loss in performance. This thesis explores several methods that would help game engine developers in making correct design choices by optimally balancing the trade-offs while rendering the scene using smooth surfaces. It proposes a novel technique for adaptive tessellation of triangular meshes that vastly improves speed and tessellation count. It develops an approximate method for rendering Loop subdivision surfaces on tessellation enabled hardware. A taxonomy and evaluation of the methods is provided and a unified rendering system that provides automatic level of detail by switching between the methods is proposed.
Rippling Broadcast (RIP-cast) for Wireless Ad Hoc Networks

Broadcasting service is an important application in wireless networks. The goal is to distribute data packets from one source node to all other nodes in the network. Delivery ratio and reception delay are the two primary measures for broadcasting performance. Due to the wireless channel fluctuations, packet loss is often seen in wireless transmissions. However, the existing broadcast schemes have difficulty achieving good performance under severe packet loss. In this paper, we propose the rippling broadcast (RIP-cast) scheme which is able to achieve reliable and efficient transmissions in wireless ad hoc networks. The nodes in the network are designed to distribute data packets cooperatively in a special manner. The broadcast scheme also adopts the use of fountain codes to further enhance the reliability as well as the diversity of data transmissions. It is observed from the numerical experiments that the proposed scheme significantly enhances the delivery ratio and reduces the reception delay under packet loss compared to the existing broadcast schemes. The results suggest that RIP-cast is highly suitable for broadcasting service in wireless networks.
Parallel Simulation of Oil Extraction on Heterogeneous Networks of Computers

Progress in network technologies has led to the situation when not only specialized parallel computers but also local networks of computers and even global ones could be used as parallel computer systems for high performance parallel computing The main peculiarity of such networks di ering them from supercomputers is their heterogeneity While a typical distributed memory multiprocessor MPP consists of identical proces sor nodes interconnected via special equipment providing fast communications between the nodes networks of computers are inherently heterogeneous and comprise diverse workstations PCs servers and sometimes specialized parallel computers intercon nected via mixed network equipment In particular it causes the heterogeneity of both performances of computing processor nodes and communication speeds bandwidths of links having an essential impact on e ciency of parallel applications The paper addresses the problem and presents experience of development of portable parallel application e ciently simulating oil extraction process on heterogeneous networks of computers
The testing of index language devices

The evaluation of information retrieval systems has recently become an important matter. In the past, however, most reports or proposals on this type of work appear largely to have ignored the efficiency of operation of the central core of an IR system, namely those operations concerned in the compilation and use of the index. The only aspects to receive consideration are the physical form of the index and the design of thesauri or classifications. The former activity has been slanted towards the use of computers and has tended to assume that this type of equipment will, ipso facto, give an improved performance but has made no attempt to justify cost factors which may be one hundred times that of conventional techniques. Work on thesauri and classifications, where it has been practical in nature, appears to consist of compiling lists of terms which go out of favour as quickly as any list of subject headings in the past; the more popular theoretical approach is the setting up of models or the use of increasingly abstruse and complex algebras. From the results and conclusions of the experimental work at Cranfield, it would seem that many of these investigations are comparatively trivial.