نتایج جستجو برای: tools

تعداد نتایج: 265828  

2004
Ulric J. Gelinas Elliott Levy Jay Thibodeau Catherine Usoff

Long-term success in their careers requires that accounting students are knowledgeable in the theory of accounting as well as the impact that information technology will have on the application of that theory. There is currently little guidance, however, for faculty to achieve effective integration of accounting and information technology in the classroom. One measure of effectiveness would be ...

1996

It is shown that a large CIMS of adaptive fecclfcmward coxltrc)llcrs having a sinusoicla,l regressor (i.e., a regressor comprised exclusively of sil,usoiclal sigl~als), can IJc writtcl] as the parallel cxmtmc.tion of a purwl y lincat time-invarial it (I,TI) subsystcm a,lld a lincmr ti]nc-vmyi] ig (LTV) subsystem. Unclcr certain statccl collditicnls tllc IJTV suhsystcm variishcs MIC1 the system ...

Journal: :Computer and Information Science 2008
Kevin Curran Joanne Mc Devitt

In recent years there has been a noticeable growth in the quantity of available Steganography tools on the World Wide Web. Steganography may be used to hide messages within images and it is widely believed that terrorist organizations may be communicating through the use of steganography. With this in mind there is a need to detect hidden data using Steganalysis – the art of detecting messages ...

2011
A. Vernerová

The term valency refers to the number, type and form of arguments that are bound to a word. Valency is specific to any given lexical unit and therefore is covered by lexicons. This is a preliminary survey conducted with the creation of a valency lexicon of Czech nouns in mind. The authors of such a lexicon have to decide who will be the intended users, how the material will be presented and whi...

2006
Arie Yeredor

System identification is concerned with the estimation of parameters characterizing an unknown system. The estimation is usually based on observations of the system’s (possibly noisy) input(s) and output(s). In the so-called “blind” system identification scenario, the estimation is based on the observed output(s) only, aided by some general knowledge about statistical properties of the input(s)...

2012
Thomas Raths Jens Otten

The Quantified Modal Logic Theorem Proving (QMLTP) library provides a platform for testing and evaluating automated theorem proving (ATP) systems for first-order modal logics. The main purpose of the library is to stimulate the development of new modal ATP systems and to put their comparison onto a firm basis. Version 1.1 of the QMLTP library includes 600 problems represented in a standardized ...

2013
Evgeny Stambulchik

A review is given of the first workshop dedicated to the detailed comparison of various approaches to the calculation of spectral line shapes in plasmas. A standardized set of case problems was specified in advance, together with the prescribed atomic data and assumptions to be used. In this brief review, motivations for the case problems chosen are outlined, followed by a discussion of selecte...

2008
Ankit Gupta Rahul Garg

In this paper, we present techniques to detect Least Significant Bit (LSB) steganography for images. Here, images can be hidden inside lower bits of the pixels of the cover image. We use image statistics to detect two cases when hidden image is stored as one big chunk (Simple Mode) or spread out(Shuffle Mode). The results are presented on a synthetically generated database of around 350 stegano...

2011
Judith Zimmermann Kay Henning Brodersen Jean-Philippe Pellet Elias August Joachim M. Buhmann

One of the principal concerns in graduate admissions is how future performance in graduate studies may be predicted from a candidate’s undergraduate achievements. In this study, we examined the statistical relationship between B.Sc. and M.Sc. achievements using a dataset that is not subject to an admission-induced selection bias. Our analysis yielded three insights. First, we were able to expla...

Journal: :J. Symb. Log. 2014
Itay Kaplan Saharon Shelah

In the first part we show a counterexample to a conjecture by Shelah regarding the existence of indiscernible sequences in dependent theories (up to the first inaccessible cardinal). In the second part we discuss generic pairs, and give an example where the pair is not dependent. Then we define the notion of directionality which deals with counting the number of coheirs of a type and we give ex...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید