-
Notifications
You must be signed in to change notification settings - Fork 756
/
IEEE Xplore.js
1223 lines (1192 loc) · 34.1 KB
/
IEEE Xplore.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
{
"translatorID": "92d4ed84-8d0-4d3c-941f-d4b9124cfbb",
"label": "IEEE Xplore",
"creator": "Simon Kornblith, Michael Berkowitz, Bastian Koenings, and Avram Lyon",
"target": "^https?://([^/]+\\.)?ieeexplore\\.ieee\\.org/([^#]+[&?]arnumber=\\d+|(abstract/)?document/|search/(searchresult|selected)\\.jsp|xpl/(mostRecentIssue|tocresult)\\.jsp\\?|xpl/conhome/\\d+/proceeding)",
"minVersion": "4.0",
"maxVersion": "",
"priority": 100,
"inRepository": true,
"translatorType": 4,
"browserSupport": "gcsibv",
"lastUpdated": "2024-09-30 13:40:38"
}
/*
***** BEGIN LICENSE BLOCK *****
Copyright © 2023 Simon Kornblith, Michael Berkowitz, Bastian Koenings, and Avram Lyon
This file is part of Zotero.
Zotero is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
Zotero is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with Zotero. If not, see <http://www.gnu.org/licenses/>.
***** END LICENSE BLOCK *****
*/
function detectWeb(doc, url) {
var wrapper = doc.querySelector('.global-content-wrapper');
if (wrapper) {
Zotero.monitorDOMChanges(wrapper);
}
if (/[?&]arnumber=(\d+)/i.test(url) || /\/document\/\d+/i.test(url)) {
var firstBreadcrumb = ZU.xpathText(doc, '(//div[contains(@class, "breadcrumbs")]//a)[1]');
if (firstBreadcrumb == "Conferences") {
return "conferencePaper";
}
return "journalArticle";
}
// Issue page
if ((url.includes("xpl/tocresult.jsp") || url.includes("xpl/mostRecentIssue.jsp")) && getSearchResults(doc, true)) {
return getSearchResults(doc, true) ? "multiple" : false;
}
// Search results
if (url.includes("/search/searchresult.jsp") && getSearchResults(doc, true)) {
return "multiple";
}
// conference list results
if (url.includes("xpl/conhome") && url.includes("proceeding") && getSearchResults(doc, true)) {
return "multiple";
}
// more generic method for other cases (is this still needed?)
/*
var scope = ZU.xpath(doc, '//div[contains(@class, "ng-scope")]')[0];
if (!scope) {
Zotero.debug("No scope");
return;
}
Z.monitorDOMChanges(scope, {childList: true});
if (getSearchResults(doc, true)) {
return "multiple";
}
*/
return false;
}
function getSearchResults(doc, checkOnly) {
var items = {};
var found = false;
var rows = ZU.xpath(doc, '//*[contains(@class, "article-list") or contains(@class, "List-results-items")]//a[parent::h2|parent::h3]|//*[@id="results-blk"]//*[@class="art-abs-url"]');
for (var i = 0; i < rows.length; i++) {
var href = rows[i].href;
var title = ZU.trimInternal(rows[i].textContent);
if (!href || !title) continue;
if (checkOnly) return true;
found = true;
items[fixUrl(href)] = title;
}
return found ? items : false;
}
// Some pages don't show the metadata we need (http://forums.zotero.org/discussion/16283)
// No data: http://ieeexplore.ieee.org/search/srchabstract.jsp?tp=&arnumber=1397982
// No data: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1397982
// Data: http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1397982
// Also address issue of saving from PDF itself, I hope
// URL like http://ieeexplore.ieee.org/ielx4/78/2655/00080767.pdf?tp=&arnumber=80767&isnumber=2655
// Or: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1575188&tag=1
function fixUrl(url) {
var arnumber = url.match(/arnumber=(\d+)/);
if (arnumber) {
return url.replace(/\/(?:search|stamp|ielx[45])\/.*$/, "/xpls/abs_all.jsp?arnumber=" + arnumber[1]);
}
else {
return url;
}
}
async function doWeb(doc, url) {
if (detectWeb(doc, url) == 'multiple') {
let items = await Zotero.selectItems(getSearchResults(doc, false));
if (!items) return;
for (let url of Object.keys(items)) {
await scrape(await requestDocument(url));
}
}
else if (url.includes("/search/") || url.includes("/stamp/") || url.includes("/ielx4/") || url.includes("/ielx5/")) {
await scrape(await requestDocument(fixUrl(url)));
}
else {
await scrape(doc, url);
}
}
async function scrape(doc, url = doc.location.href) {
var arnumber = (url.match(/arnumber=(\d+)/) || url.match(/\/document\/(\d+)/))[1];
// Z.debug("arNumber = " + arnumber);
var script = ZU.xpathText(doc, '//script[@type="text/javascript" and contains(., "global.document.metadata")]');
if (script) {
var dataRaw = script.split("global.document.metadata")[1]
.replace(/^=/, '').replace(/};[\s\S]*$/m, '}');
try {
var data = JSON.parse(dataRaw);
}
catch (e) {
Z.debug("Error parsing JSON data:");
Z.debug(e);
}
}
let bibtexURL = "/rest/search/citation/format?recordIds=" + arnumber + "&fromPage=&citations-format=citation-abstract&download-format=download-bibtex";
Z.debug(bibtexURL);
// metadata is downloaded in a JSON data field
let bibtex = await requestJSON(bibtexURL, { headers: { Referer: url} });
bibtex = bibtex.data;
bibtex = ZU.unescapeHTML(bibtex.replace(/(&[^\s;]+) and/g, '$1;'));
// remove empty tag - we can take this out once empty tags are ignored
bibtex = bibtex.replace(/(keywords=\{.+);\}/, "$1}");
var earlyaccess = false;
if (/^@null/.test(bibtex)) {
earlyaccess = true;
bibtex = text.replace(/^@null/, "@article");
}
let pdfGatewayURL = "/stamp/stamp.jsp?tp=&arnumber=" + arnumber;
let pdfURL;
try {
let src = await requestDocument(pdfGatewayURL);
// Either the PDF is embedded in the page, or (e.g. for iOS)
// the page has a redirect to the full-page PDF
//
// As of 3/2020, embedded PDFs via a web-based proxy are
// being served as getPDF.jsp, so support that in addition
// to direct .pdf URLs.
let m = /<i?frame src="([^"]+\.pdf\b[^"]*|[^"]+\/getPDF\.jsp\b[^"]*)"|<meta HTTP-EQUIV="REFRESH" content="0; url=([^\s"]+\.pdf\b[^\s"]*)"/.exec(src);
pdfURL = m && (m[1] || m[2]);
}
catch (e) {
}
if (!pdfURL) {
pdfURL = "/stampPDF/getPDF.jsp?tp=&arnumber=" + arnumber + "&ref=";
}
var translator = Zotero.loadTranslator("import");
// Calling the BibTeX translator
translator.setTranslator("9cb70025-a888-4a29-a210-93ec52da40d4");
translator.setString(bibtex);
translator.setHandler("itemDone", function (obj, item) {
item.notes = [];
var res;
// Rearrange titles, per http://forums.zotero.org/discussion/8056
// If something has a comma or a period, and the text after comma ends with
// "of", "IEEE", or the like, then we switch the parts. Prefer periods.
if (item.publicationTitle.includes(".")) {
res = item.publicationTitle.trim().match(/^(.*)\.(.*(?:of|on|IEE|IEEE|IET|IRE))$/);
}
else {
res = item.publicationTitle.trim().match(/^(.*),(.*(?:of|on|IEE|IEEE|IET|IRE))$/);
}
if (res) {
item.publicationTitle = res[2] + " " + res[1];
}
item.proceedingsTitle = item.conferenceName = item.publicationTitle;
if (earlyaccess) {
item.volume = "Early Access Online";
item.issue = "";
item.pages = "";
}
if (data && data.authors && data.authors.length == item.creators.length) {
item.creators = [];
for (let author of data.authors) {
item.creators.push({
firstName: author.firstName,
lastName: author.lastName,
creatorType: "author"
});
}
}
if (!item.ISSN && data && data.issn) {
item.ISSN = data.issn.map(el => el.value).join(", ");
}
if (item.ISSN && !ZU.fieldIsValidForType('ISSN', item.itemType)) {
item.extra = "ISSN: " + item.ISSN;
}
item.url = url
// Strip session ids
.replace(/;jsessionid.+/, '');
item.attachments.push({
document: doc,
title: "IEEE Xplore Abstract Record"
});
item.attachments.push({
url: pdfURL,
title: "Full Text PDF",
mimeType: "application/pdf"
});
item.complete();
});
translator.getTranslatorObject(function (trans) {
trans.setKeywordSplitOnSpace(false);
trans.setKeywordDelimRe('\\s*;\\s*', '');
trans.doImport();
});
}
/** BEGIN TEST CASES **/
var testCases = [
{
"type": "web",
"url": "https://ieeexplore.ieee.org/document/4607247/?tp=&arnumber=4607247&refinements%3D4294967131%26openedRefinements%3D*%26filter%3DAND%28NOT%284283010803%29%29%26searchField%3DSearch+All%26queryText%3Dturing",
"items": [
{
"itemType": "journalArticle",
"title": "Fuzzy Turing Machines: Variants and Universality",
"creators": [
{
"firstName": "Yongming",
"lastName": "Li",
"creatorType": "author"
}
],
"date": "December 2008",
"DOI": "10.1109/TFUZZ.2008.2004990",
"ISSN": "1063-6706, 1941-0034",
"abstractNote": "In this paper, we study some variants of fuzzy Turing machines (FTMs) and universal FTM. First, we give several formulations of FTMs, including, in particular, deterministic FTMs (DFTMs) and nondeterministic FTMs (NFTMs). We then show that DFTMs and NFTMs are not equivalent as far as the power of recognizing fuzzy languages is concerned. This contrasts sharply with classical TMs. Second, we show that there is no universal FTM that can exactly simulate any FTM on it. But if the membership degrees of fuzzy sets are restricted to a fixed finite subset A of [0,1], such a universal machine exists. We also show that a universal FTM exists in some approximate sense. This means, for any prescribed accuracy, that we can construct a universal machine that simulates any FTM with the given accuracy. Finally, we introduce the notions of fuzzy polynomial time-bounded computation and nondeterministic fuzzy polynomial time-bounded computation, and investigate their connections with polynomial time-bounded computation and nondeterministic polynomial time-bounded computation.",
"issue": "6",
"itemID": "4607247",
"libraryCatalog": "IEEE Xplore",
"pages": "1491-1502",
"publicationTitle": "IEEE Transactions on Fuzzy Systems",
"shortTitle": "Fuzzy Turing Machines",
"volume": "16",
"attachments": [
{
"title": "IEEE Xplore Abstract Record"
}
],
"tags": [
{
"tag": "Computational complexity"
},
{
"tag": "Computational modeling"
},
{
"tag": "Computer science"
},
{
"tag": "Deterministic fuzzy Turing machine (DFTM)"
},
{
"tag": "Fuzzy sets"
},
{
"tag": "Hardware"
},
{
"tag": "Intelligent control"
},
{
"tag": "Microcomputers"
},
{
"tag": "Polynomials"
},
{
"tag": "Turing machines"
},
{
"tag": "Turing machines"
},
{
"tag": "computational complexity"
},
{
"tag": "deterministic automata"
},
{
"tag": "deterministic fuzzy Turing machines"
},
{
"tag": "fixed finite subset"
},
{
"tag": "fuzzy computational complexity"
},
{
"tag": "fuzzy grammar"
},
{
"tag": "fuzzy languages"
},
{
"tag": "fuzzy polynomial time-bounded computation"
},
{
"tag": "fuzzy recursive language"
},
{
"tag": "fuzzy recursively enumerable (f.r.e.) language"
},
{
"tag": "fuzzy set theory"
},
{
"tag": "fuzzy sets"
},
{
"tag": "nondeterministic fuzzy Turing machine (NFTM)"
},
{
"tag": "nondeterministic fuzzy Turing machines"
},
{
"tag": "nondeterministic polynomial time-bounded computation"
},
{
"tag": "universal fuzzy Turing machine (FTM)"
}
],
"notes": [],
"seeAlso": []
}
]
},
{
"type": "web",
"url": "https://ieeexplore.ieee.org/document/6221978/?arnumber=6221978",
"items": [
{
"itemType": "journalArticle",
"title": "Graph Matching for Adaptation in Remote Sensing",
"creators": [
{
"firstName": "Devis",
"lastName": "Tuia",
"creatorType": "author"
},
{
"firstName": "Jordi",
"lastName": "Munoz-Mari",
"creatorType": "author"
},
{
"firstName": "Luis",
"lastName": "Gomez-Chova",
"creatorType": "author"
},
{
"firstName": "Jesus",
"lastName": "Malo",
"creatorType": "author"
}
],
"date": "January 2013",
"DOI": "10.1109/TGRS.2012.2200045",
"ISSN": "0196-2892, 1558-0644",
"abstractNote": "We present an adaptation algorithm focused on the description of the data changes under different acquisition conditions. When considering a source and a destination domain, the adaptation is carried out by transforming one data set to the other using an appropriate nonlinear deformation. The eventually nonlinear transform is based on vector quantization and graph matching. The transfer learning mapping is defined in an unsupervised manner. Once this mapping has been defined, the samples in one domain are projected onto the other, thus allowing the application of any classifier or regressor in the transformed domain. Experiments on challenging remote sensing scenarios, such as multitemporal very high resolution image classification and angular effects compensation, show the validity of the proposed method to match-related domains and enhance the application of cross-domains image processing techniques.",
"issue": "1",
"itemID": "6221978",
"libraryCatalog": "IEEE Xplore",
"pages": "329-341",
"publicationTitle": "IEEE Transactions on Geoscience and Remote Sensing",
"volume": "51",
"attachments": [
{
"title": "IEEE Xplore Full Text PDF",
"mimeType": "application/pdf"
},
{
"title": "IEEE Xplore Abstract Record"
}
],
"tags": [
{
"tag": "Adaptation models"
},
{
"tag": "Domain adaptation"
},
{
"tag": "Entropy"
},
{
"tag": "Manifolds"
},
{
"tag": "Remote sensing"
},
{
"tag": "Support vector machines"
},
{
"tag": "Transforms"
},
{
"tag": "Vector quantization"
},
{
"tag": "adaptation algorithm"
},
{
"tag": "angular effects"
},
{
"tag": "cross-domain image processing techniques"
},
{
"tag": "data acquisition conditions"
},
{
"tag": "destination domain"
},
{
"tag": "geophysical image processing"
},
{
"tag": "geophysical techniques"
},
{
"tag": "graph matching method"
},
{
"tag": "image classification"
},
{
"tag": "image matching"
},
{
"tag": "image resolution"
},
{
"tag": "model portability"
},
{
"tag": "multitemporal classification"
},
{
"tag": "multitemporal very high resolution image classification"
},
{
"tag": "nonlinear deformation"
},
{
"tag": "nonlinear transform"
},
{
"tag": "remote sensing"
},
{
"tag": "remote sensing"
},
{
"tag": "source domain"
},
{
"tag": "support vector machine (SVM)"
},
{
"tag": "transfer learning"
},
{
"tag": "transfer learning mapping"
},
{
"tag": "vector quantization"
}
],
"notes": [],
"seeAlso": []
}
]
},
{
"type": "web",
"url": "http://ieeexplore.ieee.org/search/searchresult.jsp?queryText%3Dlabor&refinements=4291944246&pageNumber=1&resultAction=REFINE",
"defer": true,
"items": "multiple"
},
{
"type": "web",
"url": "https://ieeexplore.ieee.org/xpl/conhome/7048058/proceeding",
"defer": true,
"items": "multiple"
},
{
"type": "web",
"url": "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6221021",
"defer": true,
"items": "multiple"
},
{
"type": "web",
"url": "http://ieeexplore.ieee.org/search/searchresult.jsp?queryText=Wind%20Farms&newsearch=true",
"defer": true,
"items": "multiple"
},
{
"type": "web",
"url": "https://ieeexplore.ieee.org/document/1397982/?tp=&arnumber=1397982",
"items": [
{
"itemType": "journalArticle",
"title": "Analysis and circuit modeling of waveguide-separated absorption charge multiplication-avalanche photodetector (WG-SACM-APD)",
"creators": [
{
"firstName": "Y.M.",
"lastName": "El-Batawy",
"creatorType": "author"
},
{
"firstName": "M.J.",
"lastName": "Deen",
"creatorType": "author"
}
],
"date": "March 2005",
"DOI": "10.1109/TED.2005.843884",
"ISSN": "0018-9383, 1557-9646",
"abstractNote": "Waveguide photodetectors are considered leading candidates to overcome the bandwidth efficiency tradeoff of conventional photodetectors. In this paper, a theoretical physics-based model of the waveguide separated absorption charge multiplication avalanche photodetector (WG-SACM-APD) is presented. Both time and frequency modeling for this photodetector are developed and simulated results for different thicknesses of the absorption and multiplication layers and for different areas of the photodetector are presented. These simulations provide guidelines for the design of these high-performance photodiodes. In addition, a circuit model of the photodetector is presented in which the photodetector is a lumped circuit element so that circuit simulation of the entire photoreceiver is now feasible. The parasitics of the photodetector are included in the circuit model and it is shown how these parasitics degrade the photodetectors performance and how they can be partially compensated by an external inductor in series with the load resistor. The results obtained from the circuit model of the WG-SACM-APD are compared with published experimental results and good agreement is obtained. This circuit modeling can easily be applied to any WG-APD structure. The gain-bandwidth characteristic of WG-SACM-APD is studied for different areas and thicknesses of both the absorption and the multiplication layers. The dependence of the performance of the photodetector on the dimensions, the material parameters and the multiplication gain are also investigated.",
"issue": "3",
"itemID": "1397982",
"libraryCatalog": "IEEE Xplore",
"pages": "335-344",
"publicationTitle": "IEEE Transactions on Electron Devices",
"volume": "52",
"attachments": [
{
"title": "IEEE Xplore Full Text PDF",
"mimeType": "application/pdf"
},
{
"title": "IEEE Xplore Abstract Record"
}
],
"tags": [
{
"tag": "Avalanche photodetectors"
},
{
"tag": "Avalanche photodiodes"
},
{
"tag": "Linear circuits"
},
{
"tag": "Optical receivers"
},
{
"tag": "Photodetectors"
},
{
"tag": "SACM photodetectors"
},
{
"tag": "SACM photodetectors"
},
{
"tag": "Semiconductor device modeling"
},
{
"tag": "WG-SACM-APD circuit modeling"
},
{
"tag": "absorption layers"
},
{
"tag": "avalanche photodiodes"
},
{
"tag": "circuit model of photodetectors"
},
{
"tag": "circuit modeling"
},
{
"tag": "circuit simulation"
},
{
"tag": "circuit simulation"
},
{
"tag": "external inductor"
},
{
"tag": "frequency modeling"
},
{
"tag": "high-performance photodiodes"
},
{
"tag": "high-speed photodetectors"
},
{
"tag": "high-speed photodetectors"
},
{
"tag": "load resistor"
},
{
"tag": "lumped circuit element"
},
{
"tag": "lumped parameter networks"
},
{
"tag": "multiplication layers"
},
{
"tag": "optical receivers"
},
{
"tag": "parasitics effects"
},
{
"tag": "photodetector analysis"
},
{
"tag": "photodetectors"
},
{
"tag": "photodetectors"
},
{
"tag": "photoreceiver"
},
{
"tag": "physics-based modeling"
},
{
"tag": "semiconductor device models"
},
{
"tag": "theoretical physics-based model"
},
{
"tag": "time modeling"
},
{
"tag": "waveguide photodetectors"
},
{
"tag": "waveguide photodetectors"
},
{
"tag": "waveguide separated absorption charge multiplication avalanche photodetector"
}
],
"notes": [],
"seeAlso": []
}
]
},
{
"type": "web",
"url": "https://ieeexplore.ieee.org/document/6919256/?arnumber=6919256&punumber%3D6287639",
"items": [
{
"itemType": "journalArticle",
"title": "Information Security in Big Data: Privacy and Data Mining",
"creators": [
{
"firstName": "Lei",
"lastName": "Xu",
"creatorType": "author"
},
{
"firstName": "Chunxiao",
"lastName": "Jiang",
"creatorType": "author"
},
{
"firstName": "Jian",
"lastName": "Wang",
"creatorType": "author"
},
{
"firstName": "Jian",
"lastName": "Yuan",
"creatorType": "author"
},
{
"firstName": "Yong",
"lastName": "Ren",
"creatorType": "author"
}
],
"date": "2014",
"DOI": "10.1109/ACCESS.2014.2362522",
"ISSN": "2169-3536",
"abstractNote": "The growing popularity and development of data mining technologies bring serious threat to the security of individual,'s sensitive information. An emerging research topic in data mining, known as privacy-preserving data mining (PPDM), has been extensively studied in recent years. The basic idea of PPDM is to modify the data in such a way so as to perform data mining algorithms effectively without compromising the security of sensitive information contained in the data. Current studies of PPDM mainly focus on how to reduce the privacy risk brought by data mining operations, while in fact, unwanted disclosure of sensitive information may also happen in the process of data collecting, data publishing, and information (i.e., the data mining results) delivering. In this paper, we view the privacy issues related to data mining from a wider perspective and investigate various approaches that can help to protect sensitive information. In particular, we identify four different types of users involved in data mining applications, namely, data provider, data collector, data miner, and decision maker. For each type of user, we discuss his privacy concerns and the methods that can be adopted to protect sensitive information. We briefly introduce the basics of related research topics, review state-of-the-art approaches, and present some preliminary thoughts on future research directions. Besides exploring the privacy-preserving approaches for each type of user, we also review the game theoretical approaches, which are proposed for analyzing the interactions among different users in a data mining scenario, each of whom has his own valuation on the sensitive information. By differentiating the responsibilities of different users with respect to security of sensitive information, we would like to provide some useful insights into the study of PPDM.",
"itemID": "6919256",
"libraryCatalog": "IEEE Xplore",
"pages": "1149-1176",
"publicationTitle": "IEEE Access",
"shortTitle": "Information Security in Big Data",
"volume": "2",
"attachments": [
{
"title": "IEEE Xplore Full Text PDF",
"mimeType": "application/pdf"
},
{
"title": "IEEE Xplore Abstract Record"
}
],
"tags": [
{
"tag": "Algorithm design and analysis"
},
{
"tag": "Big Data"
},
{
"tag": "Big Data"
},
{
"tag": "Computer security"
},
{
"tag": "Data mining"
},
{
"tag": "Data mining"
},
{
"tag": "Data privacy"
},
{
"tag": "Game theory"
},
{
"tag": "PPDM"
},
{
"tag": "Privacy"
},
{
"tag": "Tracking"
},
{
"tag": "anonymization"
},
{
"tag": "anonymization"
},
{
"tag": "anti-tracking"
},
{
"tag": "anti-tracking"
},
{
"tag": "data acquisition"
},
{
"tag": "data collector"
},
{
"tag": "data miner"
},
{
"tag": "data mining"
},
{
"tag": "data mining"
},
{
"tag": "data protection"
},
{
"tag": "data provider"
},
{
"tag": "data publishing"
},
{
"tag": "decision maker"
},
{
"tag": "game theory"
},
{
"tag": "game theory"
},
{
"tag": "game theory"
},
{
"tag": "game theory"
},
{
"tag": "information protection"
},
{
"tag": "information security"
},
{
"tag": "privacy auction"
},
{
"tag": "privacy auction"
},
{
"tag": "privacy preserving data mining"
},
{
"tag": "privacy-preserving data mining"
},
{
"tag": "privacypreserving data mining"
},
{
"tag": "provenance"
},
{
"tag": "provenance"
},
{
"tag": "security of data"
},
{
"tag": "sensitive information"
},
{
"tag": "sensitive information"
}
],
"notes": [],
"seeAlso": []
}
]
},
{
"type": "web",
"url": "https://ieeexplore.ieee.org/document/80767/",
"items": [
{
"itemType": "journalArticle",
"title": "An eigenanalysis interference canceler",
"creators": [
{
"firstName": "A.M.",
"lastName": "Haimovich",
"creatorType": "author"
},
{
"firstName": "Y.",
"lastName": "Bar-Ness",
"creatorType": "author"
}
],
"date": "January 1991",
"DOI": "10.1109/78.80767",
"ISSN": "1053-587X, 1941-0476",
"abstractNote": "Eigenanalysis methods are applied to interference cancellation problems. While with common array processing methods the cancellation is effected by global optimization procedures that include the interferences and the background noise, the proposed technique focuses on the interferences only, resulting in superior cancellation performance. Furthermore, the method achieves full effectiveness even for short observation times, when the number of samples used for processing is of the the order of the number of interferences. Adaptive implementation is obtained with a simple, fast converging algorithm.<>",
"issue": "1",
"itemID": "80767",
"libraryCatalog": "IEEE Xplore",
"pages": "76-84",
"publicationTitle": "IEEE Transactions on Signal Processing",
"volume": "39",
"attachments": [
{
"title": "IEEE Xplore Full Text PDF",
"mimeType": "application/pdf"
},
{
"title": "IEEE Xplore Abstract Record"
}
],
"tags": [
{
"tag": "Array signal processing"
},
{
"tag": "Background noise"
},
{
"tag": "Direction of arrival estimation"
},
{
"tag": "Interference cancellation"
},
{
"tag": "Jamming"
},
{
"tag": "Noise cancellation"
},
{
"tag": "Optimization methods"
},
{
"tag": "Sensor arrays"
},
{
"tag": "Signal to noise ratio"
},
{
"tag": "Steady-state"
},
{
"tag": "adaptive filters"
},
{
"tag": "adaptive implementation"
},
{
"tag": "array processing"
},
{
"tag": "eigenanalysis methods"
},
{
"tag": "eigenvalues and eigenfunctions"
},
{
"tag": "fast converging algorithm"
},
{
"tag": "filtering and prediction theory"
},
{
"tag": "interference cancellation"
},
{
"tag": "interference suppression"
},
{
"tag": "signal processing"
}
],
"notes": [],
"seeAlso": []
}
]
},
{
"type": "web",
"url": "https://ieeexplore.ieee.org/abstract/document/7696113/?reload=true",
"items": [
{
"itemType": "conferencePaper",
"title": "3D flexible antenna realization process using liquid metal and additive technology",
"creators": [
{
"firstName": "Mathieu",
"lastName": "Cosker",
"creatorType": "author"
},
{
"firstName": "Fabien",
"lastName": "Ferrero",
"creatorType": "author"