Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jian-Wei Lin

dblp:12/8226 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
1since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 2 · 1 since 2021Artificial intelligence and machine learning · 1Computer networks · 1Human-computer interaction and ubiquitous computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Internet of things and sensor networks · 75% Physical-layer communications · 25%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks › RFID systems
anti-collision protocol
0.212013
A Novel Query Tree Protocol with Bit Tracking in RFID Tag Identification · IEEE Trans. Mob. Comput. 2013
Physical-layer communications › synchronization › timing recovery
bit tracking loop
0.212013
A Novel Query Tree Protocol with Bit Tracking in RFID Tag Identification · IEEE Trans. Mob. Comput. 2013
Internet of things and sensor networks
RFID systems
0.212013
A Novel Query Tree Protocol with Bit Tracking in RFID Tag Identification · IEEE Trans. Mob. Comput. 2013
Internet of things and sensor networks › RFID systems
tag identification
0.212013
A Novel Query Tree Protocol with Bit Tracking in RFID Tag Identification · IEEE Trans. Mob. Comput. 2013
Algorithms and data structures › data structure design › search structures
search trees
0.012013
A Novel Query Tree Protocol with Bit Tracking in RFID Tag Identification · IEEE Trans. Mob. Comput. 2013

Methods — techniques the papers use, named apart from their topics

query tracking tree · 0.3optimal partition · 0.3bit tracking · 0.3
YearPublicationVenuePosition
2024 Inconsistencies Between Information Security Policy Compliance and Shadow IT Usage
abstract
This study investigates the effects of self-efficacy on intentions toward information security policy compliance and behaviors in shadow information technology, with self-efficacy being divided into information technology self-efficacy and information security self-efficacy. An experiment was conducted and a total of 83 valid subjects were recruited in this study. Data were collected on the subjects’ behaviors during the experiment, and quantitative data were also collected using a posttest questionnaire. The findings indicated that ITSE and ISSE positively correlated with information security policy (ISP) compliance, suggesting that improving self-efficacy in either aspect will improve ISP compliance intention. However, ISP compliance did not correlate significantly with shadow IT usage, as subjects with high ISP compliance still used shadow IT. Therefore, there was a discrepancy between intention and actual behavior. In practical terms, organizations can use training and education to improve their employees’ self-efficacy in the technically challenging or unfamiliar aspects of IT and ISP compliance, improve their ISP compliance intention, and reduce the possibility of ISP violations, such as shadow IT usage.
Hsieh-Hong Huang, Jian-Wei Lin
J. Comput. Inf. Syst.2
2018 Effects of an online team project-based learning environment with group awareness and peer evaluation on socially shared regulation of learning and self-regulated learning
abstract
Recently, some studies proposed methods to promote socially shared regulation of learning (SSRL) level within a team because high SSRL levels enable an effective collaboration. Meanwhile, several studies also proposed methods in online collaboration to enhance individual self-regulated learning (SRL). Notably, most existing studies focused on proposing methods and tools either for enhancing SSRL level within a team or for enhancing individual SRL. A computer-supported collaborative learning (CSCL) environment with proper supports is promising for simultaneously enhancing the SSRL level within a team and individual SRL because SSRL and SRL have an inseparable relation and mutually influence during collaborative process. Based on the existing principles and theories, this work adopts the supports of group awareness and peer evaluation in CSCL with project-based learning. Group awareness (GA) can reveal collaborative behaviour of group members and regulate their participation while peer assessment (PE), which can appraise member’s contribution, can encourage individual responsibility and refine regulatory strategies. This study finds that the proposed group awareness and peer assessment (GAPE) (i.e. the experimental class) moderately reduces the free-rider effect and enhanced SSRL level and individual SRL, compared with NO-GAPE (i.e. the control group). Furthermore, this study also confirms that the perceived SSRL level can effectively predict individual SRL.
Jian-Wei Lin
Behav. Inf. Technol.1
2014 A Study of Shift Workers for Role Conflict Effect: Quality of Life-Emotional Exhaustion as Mediator
Yuh-Shy Chuang, Jian-Wei Lin, Jhih-Yu Chin, Ying-Tong Lin
ACIIDS (2)2
2013 A Novel Query Tree Protocol with Bit Tracking in RFID Tag Identification
abstract
Tag anticollision has long been an important issue in RFID systems. To accelerate tag identification, some researchers have recently adopted bit tracking technology that allows the reader to detect the locations of collided bits in a collision slot. However, these methods still encounter the problem of too many collisions occurring at the beginning of identification. This paper proposes an optimal query tracking tree protocol (OQTT) that tries to separate all of the tags into smaller sets to reduce collisions at the beginning of identification. Using bit tracking technology, OQTT mainly adopts three proposed approaches, bit estimation, optimal partition, and query tracking tree. Bit estimation first estimates the number of tags based on the locations of collided bits. Optimal partition then determines the optimal number of the initial sets based on this estimation. Query tracking tree splits a set of collided tags into two subsets using the first collided bit in the tag IDs. This paper analyzes the efficiency of OQTT, which represents how many tags can be identified in a slot. Results show that its efficiency is close to 0.614, the highest efficiency published to date. The simulation results further show that OQTT outperforms other existing algorithms.
Yuan-Cheng Lai, Ling-Yen Hsiao, Hong-Jie Chen, Ching-Neng Lai, Jian-Wei Lin
IEEE Trans. Mob. Comput.5