Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,251,953 papers from all fields of science
Search
Sign In
Create Free Account
Directory information tree
Known as:
DIT
A directory information tree (DIT) is data represented in a hierarchical tree-like structure consisting of the Distinguished Names (DNs) of directory…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Active Directory
Common Indexing Protocol
Directory service
ISO 3166
Expand
Broader (1)
Identity management
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Si-cap-free SiGe p-channel FinFETs and gate-all-around transistors in a replacement metal gate process: Interface trap density reduction and performance improvement by high-pressure deuterium anneal
H. Mertens
,
R. Ritzenthaler
,
+18 authors
A. Thean
Symposium on VLSI Technology
2015
Corpus ID: 29888230
We demonstrate Si-cap-free SiGe p-channel FinFETs and gate-all-around (GAA) FETs in a replacement metal gate (RMG) process, for…
Expand
2012
2012
Effective Science Instruction: Impact on High-Stakes Assessment Performance
Carla C. Johnson
,
Danhui Zhang
,
J. B. Kahle
2012
Corpus ID: 44477706
Abstract This longitudinal prospective cohort study was conducted to determine the impact of effective science instruction on…
Expand
2011
2011
Bimodal biometric person authentication using speech and face under degraded condition
S. K. Sahoo
,
S. Prasanna
National Conference on Communications
2011
Corpus ID: 37150518
In this work, we present a bimodal biometric system using speech and face features and tested its performance under degraded…
Expand
Review
2010
Review
2010
Revitalizing Accounting Ethics Research in the Neo-Kohlbergian Framework : Putting the DIT into Perspective
C. Bailey
,
Irana J. Scott
2010
Corpus ID: 45039049
The authors briefly review neo-Kohlbergian theory and provide an updated, contemporary view of the DIT. With this background…
Expand
2010
2010
Radix-2 Decimation in Time (DIT) FFT implementation based on a Matrix-Multiple Constant multiplication approach
S. Ghissoni
,
E. Costa
,
C. Lazzari
,
J. Monteiro
,
Levent Aksoy
,
R. Reis
17th IEEE International Conference on Electronics…
2010
Corpus ID: 33271051
This paper proposes the implementation of fully-parallel radix-2 Decimation in Time (DIT) Fast Fourier Transform - FFT, using the…
Expand
2009
2009
The distinction between moral judgment development and verbal ability: some relevant data using socio‐political outcome variables
S. Thoma
,
P. Derryberry
,
D. Narvaez
2009
Corpus ID: 648582
Critics of moral judgment measures question whether the obtained pattern of relationships between moral judgment scores and…
Expand
2004
2004
The wind-sensitive cercal receptor/giant interneurone system of the locust,Locusta migratoria
G. Boyan
,
J. L. Williams
,
E. Ball
Journal of Comparative Physiology
2004
Corpus ID: 20198127
Summary1.The cerci of locusts are paired, unsegmented, cone-shaped structures arising from a depression on either side of the tip…
Expand
Review
2003
Review
2003
The potential of distance e-learning in the Spatial information sciences – an evaluation of a pilot programme at the dublin institute of Technology
K. Mooney
,
Audrey Martin
2003
Corpus ID: 55633752
The authors describe a pilot course in ‘Co-ordinate and reference systems for spatial information’, delivered via the Internet…
Expand
Highly Cited
1995
Highly Cited
1995
Implementation of a FFT radix 2 butterfly using serial RSFQ multiplier-adders
O. Mukhanov
,
A. Kirichenko
IEEE transactions on applied superconductivity
1995
Corpus ID: 18748543
We have designed a Decimation-in-Time (DIT) radix 2 butterfly integrated circuit. This circuit will be used to implement the 32…
Expand
Highly Cited
1992
Highly Cited
1992
The efficient memory-based VLSI array designs for DFT and DCT
Jiun-In Guo
,
Christine M. Liu
,
C. Jen
1992
Corpus ID: 15142051
Efficient memory-based VLSI arrays and a new design approach for the discrete Fourier transform (DFT) and discrete cosine…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE