Miracle-dz/UniFAR-FTUs huggingface dataset:
Türkçe cümlelerin kural tabanlı bağlılık analizi

Bu makalede, Turkce cumlelerin kural tabanli baglilik analizi yontemi ile ayristirilmalari sonucunda elde edilen basarim sunulmaktadir. Calisma, test verisi olarak kullanilan ODTU-Sabanci Agac Yapili Derlemi'nin butunu uzerindeki ilk kural tabanli sonuclari icermektedir. Uygulanan ayristirma algoritmasi ve kural yapilari detayli olarak verilmistir. Sonuclar Turkce'nin Baglilik Analizi konusunda yapilacak calismalara temel olma niteligindedir.
OCL 2.0: Implementing the Standard

OCL 2.0 is the newest version of the OMGs constraint language to accompany their suit of Object Oriented modelling languages. The use of OCL as an accompanying constraint and query language for modelling with these languages is essential. As tools are built to support the modelling languages, it is also necessary to implement the OCL. This paper reports our experience of implementing OCL based on the latest version of the OMGs OCL standard, UML models and MDA [17] techniques supported by the Kent Modelling Framework (KMF) [12], developed at the University of Kent. We provide an efficient LALR grammar for parsing the language and describe an architecture that enables the language to be bridged to any other modelling framework or tool. We also provide both syntactic and semantic models, which were used as inputs for KMFStudio [12] in order to generate Java code. In addition we give feedback on problems and ambiguities discovered in the standard, with some suggested solutions.
cDNA Microarray Data Normalization

Normalization process is a set of operations whereby systematic biases are removed from microarray data. Therefore researcher can attain acceptable results and have more logic comparisons. This process considering the bias constructions and the effects on microarray is recognizable and applicable. Examples of this process are spatial correction, background correction, rescaling, dye effect and within slide normalization. Spot intensity standard deviation is decreased by that normalization processes, and confidence to the microarray data analysis outcomes is increased. This paper describes all of these methods. In addition it contains the examples of a real dual channel cDNA microarray experiment to illustrate normalization process.
Brain tumor segmentation in MR slices using improved GrowCut algorithm

The detection of brain tumor from MR images is very significant for medical diagnosis and treatment. However, the existing methods are mostly based on manual or semiautomatic segmentation which are awkward when dealing with a large amount of MR slices. In this paper, a new fully automatic method for the segmentation of brain tumors in MR slices is presented. Based on the hypothesis of the symmetric brain structure, the method improves the interactive GrowCut algorithm by further using the bounding box algorithm in the pre-processing step. More importantly, local reflectional symmetry is used to make up the deficiency of the bounding box method. After segmentation, 3D tumor image is reconstructed. We evaluate the accuracy of the proposed method on MR slices with synthetic tumors and actual clinical MR images. Result of the proposed method is compared with the actual position of simulated 3D tumor qualitatively and quantitatively. In addition, our automatic method produces equivalent performance as manual segmentation and the interactive GrowCut with manual interference while providing fully automatic segmentation.
FOR OBJECT CLASSIFICATION

21.0 Travel and transportation of persons 21 21 21 23.1 Rental payments 30 34 30 23.3 Communications, utilities, and 3 3 3 miscellaneous charges 24.0 Printing and Reproduction 25.1 Advisory and assistance services 169 169 169 25.2 Other services 28 28 28 25.3 Purchases of goods and services from 37 37 37 Government Accounts 25.4 Operation and maintenance of facilities 361 388 364 25.5 Research and development contracts 6 7 7 26.0 Operation and maintenance of equipment 4 4 26.0 Supplies and materials 4 4 4 31.0 Equipment 4 9 4 41.0 Grants, subsidies, and contributions 6,417 6,748 6,929 Total, Direct obligations $7,298 $7,680 $7,868 Totals may not add due to rounding. 1 Includes mandatory obligations, but excludes obligations for reimbursable accounts.
Literature Survey on Distributed Mutual Exclusion Algorithm for Mobile Ad-Hoc Network

-In a distributed system several devices are connected to each other to share resources like software’s or hardware’s, which makes Mutual Exclusion essential for distributed system during the sharing process. The region where all the sharing takes place is the Critical region. Mutual Exclusion on Distributed system allows critical resource to be shared between different mobile nodes in a Mobile Ad-Hoc Network. In this the region is divided and in a logical way sharing is done. Critical section can be defined as a state when a node or device is actually sharing or using the resources which are required in the process of communicating with each other. A request is involved for making decision regarding that which node or device would enter critical section. This request can be made to neighboring nodes or by imposing any algorithm which can make it possible the sharing process to be fair for each node i.e. no node should wait for an infinite time for its turn or no node should get infinite access to resources. In this paper, several mutual exclusion algorithms are discussed by comparing their advantages and disadvantages. Section 1 includes the introduction of the Distributed Mutual Exclusion problem and its categories. In Section 2 the basic requirements for a system to attain mutual exclusion. In section 3 discussions of all the algorithms is covered.
Software for Arabic Machine Printed Optical Character Recognition (MACRS)

Machine printed Arabic Character Recognition System (MACRS) is concerned with recognition of machine printed alphanumeric Arabic characters. In the present work, characters have been represented (extracted) by using geometric moment invariant (3 order). The technique used in this research can be divided into three major steps. The first step is digitization and preprocessing to create connected component, detect the skew of a character image and correct it. The second is feature extraction, where
Network virtualization on the wireless edge

OF THE DISSERTATION Network virtualization on the wireless edge By Gautam Dilip Bhanage Dissertation Directors: Dr. Dipankar Raychaudhuri and Dr. Yanyong Zhang This thesis presents a comprehensive investigation of wireless network virtualization, a technique for creating multiple independent software-definable networks on a single set of hardware resources. Network virtualization has previously been applied to wired networking scenarios, but the general problems of wireless virtualization represents an important open problem that we address in this work. The main aspects include technical challenges, system concepts and architectures, as well as specific protocols and algorithms for implementing wireless network virtualization. In particular, this thesis addresses the following aspects of wireless network virtualization: (1) Basic mechanisms for link (spectrum) sharing with virtualized WiFi networks, (2) Virtualization techniques and traffic isolation algorithms for virtualized WiFi networks, (3) Virtualization of cellular basestations including an experimental evaluation for a prototype 4G/WiMAX virtual network, and finally, (4) an analytical evaluation of virtualization algorithms for more general multi-hop wireless topologies. The first part of the thesis presents an exploratory discussion on the co-existence of multiple virtual networks. A comparison is presented for understanding the tradeoffs between sharing the radio through spatial and temporal separation on the ORBIT wireless testbed. Experimental evaluations reveal that while virtual networks sharing channel resources by space separation achieve better efficiency than those relying on time, the isolation between experiments in both cases is comparable. Further, we propose and implement a policy manager to alleviate the
Secure Data Synchronization over a Mobile Peer-to-Peer Network

In previous work, we have proposed a service mechanism which automatically syncs the file resources among discrete mobile devices. The mechanism includes four modules. The role-based access control module (RBAC) defined an organization policy which constructs some rules for file resources accessing. The user identification module dispatches a user some specific role (s) with relevant permission (s) and constraint (s) to access organization file resources. The en-capsulation/de-capsulation module enforces the JXTA protocol to sync the file resource synchronization over a mobile peer-to-peer network. The knowledge base module stores various organization file resources in the proposed service mechanism. However, the service mechanism faces an important challenge about data security. How to securely sync organization file resources among discrete mobile devices is worth exploring. In this study, we enforces some cryptographic techniques, including advanced encryption standard (AES), Triple data encryption standards (Triple-DES), and data encryption standards (DES), to examine secure synchronization of organization file resources among discrete mobile devices. The experiment results show the proposed mechanism is secure to automatically sync file resources among discrete mobile devices. The contribution of this work is to solve data security issue in syncing organization file resources among discrete mobile devices. We also strengthen an organization mobility to acquire the file resources by a mobile device in anywhere.
Distributed Algorithms for Joint Routing, Scheduling, Rate and Power Control in Multi-Hop Wireless Sensor Networks

Distributed algorithms for joint routing, scheduling, rate and power control have been proposed previously for multi-hop wireless sensor networks. We propose proportionally fair rate control by optimizing a single network parameter in a distributed manner. We also include a version of the previous distributed greedy scheduling heuristic algorithm, which has same communication complexity but less computational complexity.
Speech segregation in background noise and competing speech

In real-world listening environments, speech reaching our ear is often accompanied by acoustic interference such as environmental sounds, music or another voice. Noise distorts speech and poses a substantial difficulty to many applications including hearing aid design and automatic speech recognition. Monaural speech segregation refers to the problem of separating speech based on only one recording and is a widely regarded challenge. In the last decades, significant progress has been made on this problem but the challenge remains. This dissertation addresses monaural speech segregation from different interference. First, we research the problem of unvoiced speech segregation which is less studied compared to voiced speech segregation probably due to its difficulty. We propose to utilize segregated voiced speech to assist unvoiced speech segregation. Specifically, we remove all periodic signals including voiced speech from the noisy input and then estimate noise energy in unvoiced intervals using noise-dominant time-frequency units in neighboring voiced intervals. The estimated interference is used by a subtraction stage to extract unvoiced segments, which are then grouped by either simple
Formal Verification and Synthesis for Quality-of- Service in On-Chip Networks

Quality-of-service (QoS) in on-chip communication networks has a tremendous impact on overall system performance in today's era of ever-increasing core counts. Yet, Networks-on-Chip (NoCs) are still designed and analyzed using RTL simulation, or analysis of highly abstracted models. The formal techniques that are used in core components do not find use in QoS verification due to the scale of the problems of interest, such as verifying latency bounds of hundreds of cycles.This dissertation presents my recent work toward leveraging formal methods for NoC design and QoS verification. In particular, it addresses the problems of (1) verifying end-to-end latency bounds in a mesh network using abstraction; (2) scalable latency verification using compositional inductive proofs; and (3) optimal buffer sizing based on bounded model checking.
Question answering systems: a partial answer

(Maybury 2004) “Aims to provide natural language responses to natural language queries” (Maybury 2004) “Interactive human computer process that encompasses understanding a user information need, typically expresssed in a natural language query; retrieving relevant documents, data or knowledge from selected sources; extracting, qualifying and prioritizing available answers from these sources; and presenting and explaining responses in an effective manner. ” (Jijkoun & Rijke 2005) : “One of several recent attempts to provide highly focused access to textual information. ” Wikipedia : “Type of information retrieval. Given a collection of documents (such as the World Wide Web or a local collection) the system should be able to retrieve answers to questions posed in natural language. QA is regarded as requiring more complex natural language processing (NLP) techniques than other types of information retrieval such as document retrieval, and it is sometimes regarded as the next step beyond search engines. ” (Luis 2007): System that gives a precise feedback to a precisely expressed information need. (Diana 2007): System that answers a natural language question, that is, a question in natural language, in a natural way for humans.
Libraries and Public Perception: A Comparative Analysis of the European Press

Next, the author undertook a form of text-mining of references to ‘library’ or ‘libraries’. Database queries uncovered articles from the eight newspapers, and a secondary selection process was needed to take into account any ‘false positives’ to exclude such things as figures of speech or book titles. After selection, the articles underwent text and content analysis, which was performed manually, as Galluzi believes ‘that no software can replace human reasoning’. However, the author doesn’t give an indication of how long this work took.
Toward a Unified Approach to Software Reliability Modeling under Imperfect Debugging

Many software reliability growth models (SRGMs) have been developed to estimate some useful measures such as the mean value function, number of remaining faults, and failure detection rate. Most of these models have focused on the failure detection process and not given equal priority to modeling the fault correction process. But, most latent software errors may remain uncorrected for a long time even after they are detected, which increases their impact. The remaining software faults are often one of the most unreliable reasons for software quality. Therefore, we develop a general framework of the modeling of the failure detection and fault correction processes. Furthermore, it is assumed that a detected fault is immediately removed and is perfectly repaired with no new faults being introduced for the traditional SRGMs. In reality, it is impossible to remove all faults from the fault correction process and have a fault-free effect on the software development environment. In order to relax this perfect debugging assumption, we introduce the possibility of imperfect debugging phenomenon. Finally, numerical examples are shown to illustrate the results of the unified approach for integration of the detection and correction process under imperfect debugging.
Reciprocal Recommendation Algorithm for the Field of Recruitment

In order to solve the problem that the traditional recommendation algorithm can not carry out the twoway recommendation between users and items, by introducing the concept of reciprocal recommendation to extend the traditional recommendation algorithm, a reciprocal recommendation algorithm based on bi-directional matching is proposed. First of all, depending on the specific basis of the resume delivery on recruitment system and mining the potential preference information of users, an implicit preference function calculation method is proposed. Then, based on the consideration that different effects for the users explicit and implicit preference information in computing similarity, a similarity calculation method based on the integration of these two preference information is proposed. At last, the reciprocal recommendation is achieved according to the reciprocal value from high to low. The experimental results show that the proposed algorithm can not only solve the problem of two-way recommendation between job seekers and jobs, but also improve the accuracy of recommendation.
Rate-distortion optimized media streaming with adaptive rate control

Communication over a network bottleneck link is a commonplace in the Internet today. The loss and delay experienced by packets travelling along the network path between the sender and the receiver are mainly governed by the characteristics of the bottleneck link, such as available data rate and queue size. In this work, we propose a framework for rate-distortion optimized packet scheduling with adaptive rate control for media streaming over network bottleneck links. The framework computes optimal packet schedules, while adaptively controlling its data rate as a response to the effect that its transmitted packets will have on the delay experienced on the link. This results into a closed-loop control system which dynamically adjusts its packet schedules according to its transmission rate. Experimental results demonstrate that our framework maintains significantly smaller packet delay and smoother transmission rate when streaming over a bottleneck link relative to rate-distortion optimized packet scheduling without rate control with only a minor loss in rate-distortion performance.
Question Answering System in a Business Intelligence Context

The amount and complexity of data generated by information systems keep increasing in Warehouses. The domain of Business Intelligence (BI) aims at providing methods and tools to better help users in retrieving those data. Data sources are distributed over distinct locations and are usually accessible through various applications. Looking for new information could be a tedious task, because business users try to reduce their work overload. To tackle this problem, Enterprise Search is a field that has emerged in the last few years, and that takes into consideration the different corporate data sources as well as sources available to the public (e.g. World Wide Web pages). However, corporate retrieval systems nowadays still suffer from information overload. We believe that such systems would benefit from Natural Language (NL) approaches combined with QA secondly, a constraint-matching-based translation approach, which replaces a pivot language with a conceptual model and leads to more personalized multidimensional queries; thirdly, a set of NL patterns for translating BI questions in structured queries that can be easily configured in specific settings. In addition, we have implemented an iPhone/iPad™ application and an HTML front-end that demonstrate the feasibility of the various approaches developed through a series of evaluation metrics for the core component and scenario of the Q&A framework. To this end, we elaborate on a range of gold-standard queries that can be used as a basis for evaluating retrieval systems in this area, and show that our system behave similarly as the well-known WolframAlpha™ system, depending on the evaluation settings.
Paper 205-2009 Simulating Time Series Testing Using SAS ® - Part I The Augmented Dickey-Fuller (ADF) Test

The purpose of this series of articles is to present simple discussion and to present SAS programming techniques specifically designed to simulate the steps involved in time series data analysis. Part I of this series will cover the Augmented Dickey-Fuller (ADF) test of time series variables (stationarity test). Part II will continue the discussion on how to move further beyond the ADF testing and will focus discussion on examining time series variables long-run relationships (cointegration). A third part of this series is intended and will discuss how to develop an error correction model (ECM), a mechanism and concept discussed by many authors including Granger (1983), and Banergee et al 1993, that is utilized by many to determine time series short-run deviations from long-run equilibrium. The simplified SAS techniques covered in all 3 parts of this series can be used with the more complex SAS routines such as PROC ARIMA , which require high level of research and analysis expertise (Bails & Peppers, 1982).
Support Vector Machines for Business Applications

This chapter discusses the usage of Support Vector Machines (SVM) for business applications. It provides a brief historical background on inductive learning and pattern recognition, and then an intuitive motivation for SVM methods. The method is compared to other approaches, and the tools and background theory required to successfully apply SVMs to business applications are introduced. The authors hope that the chapter will help practitioners to understand when the SVM should be the method of choice, as well as how to achieve good results in minimal time.