Tarlac State University Library

Tarlac State University Library

Share

05/06/2026

M. Jubur, M. Shirvanian, S. Duraibi and N. Saxena, "๐‚๐จ๐ฆ๐ฉ๐š๐ซ๐ข๐ง๐  ๐š ๐’๐ญ๐จ๐ซ๐ž-๐‹๐ž๐ฌ๐ฌ ๐๐š๐ฌ๐ฌ๐ฐ๐จ๐ซ๐ ๐Œ๐š๐ง๐š๐ ๐ž๐ซ ๐–๐ข๐ญ๐ก ๐“๐ซ๐š๐๐ข๐ญ๐ข๐จ๐ง๐š๐ฅ ๐๐š๐ฌ๐ฌ๐ฐ๐จ๐ซ๐-๐Ž๐ง๐ฅ๐ฒ ๐€๐ฎ๐ญ๐ก๐ž๐ง๐ญ๐ข๐œ๐š๐ญ๐ข๐จ๐ง" in IEEE Internet Computing, vol. 30, no. 02, pp. 76-86, March-April 2026, doi: 10.1109/MIC.2026.3668165.

๐Š๐ž๐ฒ๐ฐ๐จ๐ซ๐๐ฌ: {Passwords; Usability; Authentication; Security; Browsers; Cryptography; Servers; Synchronization; Protocols; Standards; Data integrity; Authentication; Access control}

๐€๐›๐ฌ๐ญ๐ซ๐š๐œ๐ญ: This article presents a comprehensive usability evaluation of hidden-password online password (HIPPO), a novel store-less password manager, compared to traditional password-only authentication methods. In the digital age, robust password management solutions are essential to mitigate cognitive burdens and enhance security. Unlike conventional store-based password managers, HIPPO dynamically generates passwords without storing them, significantly reducing the risk of data breaches. Our study involved 25 participants who performed tasks such as installation, configuration, password updating, and login using both HIPPO and traditional methods. The findings reveal that HIPPO offers significant security advantages and is perceived as more secure and trustworthy by users. While HIPPO introduces additional steps for password generation and entry, participants reported higher satisfaction and ease of use compared to traditional password-only authentication. This study highlights the tradeoffs between security and usability in password management, providing valuable insights for developing more user-friendly and secure password management tools.
URL:

CSDL | IEEE Computer Society

04/06/2026

N. Kshetri and J. Voas, "๐‘๐ž๐ญ๐ซ๐š๐œ๐ญ๐ข๐ง๐  ๐’๐œ๐ข๐ž๐ง๐ญ๐ข๐Ÿ๐ข๐œ ๐๐š๐ฉ๐ž๐ซ๐ฌ ๐š๐ง๐ ๐€๐œ๐ค๐ง๐จ๐ฐ๐ฅ๐ž๐๐ ๐ข๐ง๐  ๐‚๐ซ๐ข๐ฆ๐ข๐ง๐š๐ฅ ๐‰๐ฎ๐ฌ๐ญ๐ข๐œ๐ž ๐…๐š๐ข๐ฅ๐ฎ๐ซ๐ž๐ฌ" in Computer, vol. 59, no. 06, pp. 16-20, June 2026, doi: 10.1109/MC.2026.3684130.

๐—ž๐—ฒ๐˜†๐˜„๐—ผ๐—ฟ๐—ฑ๐˜€: {Criminal Court, Scientific Papers, False Positive, Scalable, Use Of Imaging, Global South, Scientific Publications, Research Integrity, Risk Of False Positives, Scientific Misconduct, Duplicate Images, Hundreds Of Papers, Scientific Community, Rule Based, Flame Retardant, Non English Speaking, Paper Mill, Artificial Intelligence Tools, Non Native English}

๐—”๐—ฏ๐˜€๐˜๐—ฟ๐—ฎ๐—ฐ๐˜: Scientific misconduct, poses a growing threat to research integrity. This article examines how AI can detect such issues on a scale while emphasizing the need for human oversight to prevent false positives and protect researchers.
URL:

CSDL | IEEE Computer Society

03/06/2026

Featured eBookโœจ
๐…๐ข๐ง๐ž ๐€๐ซ๐ญ ๐ˆ๐ง๐ค๐ฃ๐ž๐ญ ๐๐ซ๐ข๐ง๐ญ๐ข๐ง๐ : ๐“๐ก๐ž ๐‚๐ซ๐š๐Ÿ๐ญ ๐š๐ง๐ ๐€๐ซ๐ญ ๐จ๐Ÿ ๐ญ๐ก๐ž ๐…๐ข๐ง๐ž ๐ƒ๐ข๐ ๐ข๐ญ๐š๐ฅ ๐๐ซ๐ข๐ง๐ญ

*How to Access Perlego (see guide)
https://www.facebook.com/share/p/1EKMvbdwfa/

02/06/2026

Y. Li, D. Wen, M. Xia, M. Chen and X. Fu,"๐‘๐จ๐›๐ฎ๐ฌ๐ญ ๐ƒ๐ž๐œ๐ž๐ง๐ญ๐ซ๐š๐ฅ๐ข๐ณ๐ž๐ ๐Ž๐ง๐ฅ๐ข๐ง๐ž ๐‹๐ž๐š๐ซ๐ง๐ข๐ง๐  ๐€๐ ๐š๐ข๐ง๐ฌ๐ญ ๐“๐š๐ซ๐ ๐ž๐ญ๐ž๐ ๐š๐ง๐ ๐”๐ง๐ญ๐š๐ซ๐ ๐ž๐ญ๐ž๐ ๐Œ๐š๐ฅ๐ข๐œ๐ข๐จ๐ฎ๐ฌ ๐ƒ๐š๐ญ๐š ๐…๐ž๐š๐ญ๐ฎ๐ซ๐ž ๐Œ๐š๐ง๐ข๐ฉ๐ฎ๐ฅ๐š๐ญ๐ข๐จ๐ง" in IEEE Transactions on Mobile Computing, vol. 25, no. 06, pp. 7611-7625, June 2026, doi: 10.1109/TMC.2025.3642873.

๐—ž๐—ฒ๐˜†๐˜„๐—ผ๐—ฟ๐—ฑ๐˜€: {Generators; Delays; Classification algorithms; Data models; Telecommunication traffic; Heuristic algorithms; Costs; Biological system modeling; Threat modeling; Quality of service}

๐—”๐—ฏ๐˜€๐˜๐—ฟ๐—ฎ๐—ฐ๐˜: Motivated by real-world applications, we study the problem of decentralized online learning with dynamic feedback delays in the presence of malicious data generators under different threat models. In this problem, multiple agents collaborate to classify the features of streaming data samples generated online and receive dynamically delayed feedback on the ground-truth labels. While some data generators are benign, othersโ€”due to internal motives or external factors such as cyberattacksโ€”may maliciously manipulate data features to compromise the classification performance. In this work, we first investigate the targeted attacks by malicious data generators, i.e., feature manipulation with aims to gain preferred classification outcomes from the agents. In response, we propose two robust algorithms, RDOC-TO and RDOC-TC, countering ordinary and clairvoyant adversaries that can access certain outdated and the latest classification models of the agents, respectively. Subsequently, we address the untargeted attacks by malicious data generators, which aim to disrupt the classification outcomes without targeting any particular class, by proposing another algorithm, RDOC-U. Our theoretical analysis establishes that all three proposed algorithms achieve sublinear regret bounds. The evaluations conducted in the application of network traffic classification with two real-world datasets demonstrate the competitiveness of the proposed algorithms compared to advanced baselines.
URL:

CSDL | IEEE Computer Society

30/05/2026

๐Ÿ“š Magandang Buhay, TSU!

Here's the library schedule for the coming week, June 1โ€“6, 2026. Plan your visit and make the most of our resources for your study, research, and learning needs.

See you at the library! ๐Ÿ˜Š

Want your organization to be the top-listed Government Service in Tarlac?
Click here to claim your Sponsored Listing.

Category

Address


Tarlac
2300

Opening Hours

Tuesday 7am - 6pm
Wednesday 7am - 6pm
Thursday 7am - 6pm
Friday 7am - 6pm