Reading notes for Graduate Operating Systems at UCSD. The notes are based on the readings and discussions from the course.
Hello, I’m Xiyan. Thanks for stopping by. This site shares some personal projects that I have worked on, and occasionally I upload notes on things I have learned.
Boosting Large Language Models (LLMs) applications with tools to interact with third-party services enables LLMs to retrieve updated knowledge and perform actions on behalf of users. However, the added capability brings security and privacy risks. In the current paradigm, users delegate potentially sensitive resources to LLM Apps, which makes the platforms overprivileged. For instance, malicious platforms or rogue models can exploit shared email-sending or TAP platform tokens stealthily. We propose LLMacaroon, a practical and secure architecture that distrusts applications for sharing sensitive resources and shifts control back to users. LLMacaroon achieves flexible, controlled sharing via macaroons and improves transparency and control via a local action proxy with optionally human in the loop. We demonstrate that LLMacaroon requires minimal changes to existing LLM apps and is compatible with major platforms like ChatGPT for various use cases.
Introduction The inherently dynamic nature of human communication entails adaptability in both spoken and written discourse, as individuals navigate diverse contexts and audiences. This linguistic malleability, commonly referred to as style, encompasses many of textual attributes including but not limited to formality, politeness, diction, and emotional tenor. Text style transfer (TST), a long-standing endeavor within the field of natural language processing (NLP), seeks to transform specific stylistic attributes while preserving the fundamental meaning of the text.
Personal final notes for CSE 105 Theory of Computability. Not comprehensive – only like a final exam cheat sheet. Regular Expression Precedence: \((R)\) → \(R^{*}\) → \(R_{1} R_{2}\) → \(R_{1} \cup R_{2}\) \(\emptyset\) represents empty set; \(\epsilon\) represents empty string; \(R^+ \equiv RR^*\) Proving closure Given: What does it mean for L to be in class? e.g. \(L\)* a regular language, so given a DFA/NFA* \(M_L\) WTS: The result of applying the operation to \(L\) is still in this class.
Differential Equations Classification Ordinary/Partial involving only ordinary derivatives with respect to a single independent variable is called an ordinary differential equation. involving partial derivatives with respect to more than one independent variable is a partial differential equation. Linear/Non-linear Linear: One in which the dependent variable \(y\) and its derivatives appear in additive combinations of their first powers. May be written in the form \[ a_{n}(x) \frac{d^{n} y}{d x^{n}}+a_{n-1}(x) \frac{d^{n-1} y}{d x^{n-1}}+\ldots+a_{1}(x) \frac{d y}{d x}+a_{0}(x) y=F(x) \]