{"results":[{"id":"crossref_10.24843/cs.2025.v18.i03.p04","title":"DECONSTRUCTION OF LOCAL CULTURAL IDENTITY IN COMMERCIAL SPACE DESIGN AT SHOPPING CENTERS (MALLS) IN BALI","authors":[{"name":"Ni Komang Desita Rahayu1"},{"name":"Ni Made Emmi Nutrisia Dewi"},{"name":"Ngurah Gede Dwi Mahadipta"}],"abstract":"The influence of modernization and globalization has triggered a transformation in the representation of culture within the interior design of malls in Bali, where contemporary styles are prioritized over the application of local values. Field observations indicate that cultural elements employed in several Balinese malls function merely as decoration, failing to integrate deeper cultural philosophies. This study uses a qualitative methodology, with data gathered through direct observation, interviews, and a review of literature on Balinese cultural principles. The findings reveal that traditional ornaments, such as carvings and motifs, are treated solely as decorative features. Furthermore, these local elements are overshadowed by modern design components that dominate the space. This phenomenon represents a complex negotiation between the demands of globalization, commercialization, and the preservation of local culture. Consequently, the study recommends the integration of Balinese cultural values, specifically the principles of Tri Hita Karana and Tri Mandala, into mall interior design. This approach can transform malls into modern commercial spaces that simultaneously preserve the distinctive cultural identity of Bali. Keywords: design, commercial space, mall, Balinese culture, modernization, cultural identity, deconstruction","source":"CrossRef","year":2025,"language":"en","subjects":null,"doi":"10.24843/cs.2025.v18.i03.p04","url":"https://doi.org/10.24843/cs.2025.v18.i03.p04","pdf_url":"https://ejournal1.unud.ac.id/index.php/ecs/article/download/1402/1285","is_open_access":true,"published_at":"","score":69},{"id":"arxiv_2505.16821","title":"LLM-Based Emulation of the Radio Resource Control Layer: Towards AI-Native RAN Protocols","authors":[{"name":"Ziming Liu"},{"name":"Bryan Liu"},{"name":"Alvaro Valcarce"},{"name":"Xiaoli Chu"}],"abstract":"Integrating Large AI Models (LAMs) into 6G mobile networks is a key enabler of the AI-Native Air Interface (AI-AI), where protocol intelligence must scale beyond handcrafted logic. This paper presents, to our knowledge, the first standards-compliant emulation of the Radio Resource Control (RRC) layer using a decoder-only LAM (LLAMA-class) fine-tuned with Low-Rank Adaptation (LoRA) on a multi-vendor corpus of real-world traces spanning both 5G and 4G systems. We treat RRC as a domain-specific language and construct a segmentation-safe, question-answer (Question-and-Answer (QA)) dataset that preserves Abstract Syntax Notation (ASN.1) structure through linearization prior to Byte Pair Encoding (BPE) tokenization. The proposed approach combines parameter-efficient adaptation with schema-bounded prompting to ensure syntactic and procedural fidelity. Evaluation introduces a standards-aware triad -- ASN.1 conformance, field-level coverage analysis, and uplink-to-downlink state-machine checks -- alongside semantic similarity and latency profiling across 120 configurations. On 30k 5G request-response pairs plus an additional 4.8k QA turns from 4G sessions, our 8B model achieves a median cosine similarity of 0.97, a 61% relative gain over a zero-shot baseline, while sustaining high conformance rates. These results demonstrate that LAMs, when augmented with protocol-aware reasoning, can directly orchestrate control-plane procedures, laying the foundation for the future Artificial Intelligence (AI)-native Radio Access Network (RAN).","source":"arXiv","year":2025,"language":"en","subjects":["cs.NI","cs.LG","eess.SP"],"url":"https://arxiv.org/abs/2505.16821","pdf_url":"https://arxiv.org/pdf/2505.16821","is_open_access":true,"published_at":"2025-05-22T15:55:56Z","score":69},{"id":"arxiv_2405.05531","title":"Generative Model for Joint Resource Management in Multi-Cell Multi-Carrier NOMA Networks","authors":[{"name":"Elhadj Moustapha Diallo"}],"abstract":"In this work, we design a generative artificial intelligence (GAI) -based framework for joint resource allocation, beamforming, and power allocation in multi-cell multi-carrier non-orthogonal multiple access (NOMA) networks. We formulate the proposed problem as sum rate maximization problem. Next, we design a novel multi-task transformer (MTT) framework to handle the problem in real-time. To provide the necessary training set, we consider simplified but powerful mathematical techniques from the literature. Then, we train and test the proposed MTT. We perform simulation to evaluate the efficiency of the proposed MTT and compare its performance with the mathematical baseline.","source":"arXiv","year":2024,"language":"en","subjects":["cs.NI"],"url":"https://arxiv.org/abs/2405.05531","pdf_url":"https://arxiv.org/pdf/2405.05531","is_open_access":true,"published_at":"2024-05-09T04:05:37Z","score":68},{"id":"arxiv_2107.01003","title":"PI$^2$ Parameters","authors":[{"name":"Bob Briscoe"}],"abstract":"This report gives the reasoning for the setting of the target queue delay parameter in the reference Linux implementation of PI$^2$ Active Queue Management (AQM)","source":"arXiv","year":2021,"language":"en","subjects":["cs.NI"],"url":"https://arxiv.org/abs/2107.01003","pdf_url":"https://arxiv.org/pdf/2107.01003","is_open_access":true,"published_at":"2021-06-02T17:09:38Z","score":65},{"id":"crossref_10.1016/j.microc.2018.12.002","title":"Simultaneous determination of Co, Fe, Ni and K with HR CS GFAAS","authors":[{"name":"Nil Ozbek"}],"abstract":"","source":"CrossRef","year":2019,"language":"en","subjects":null,"doi":"10.1016/j.microc.2018.12.002","url":"https://doi.org/10.1016/j.microc.2018.12.002","is_open_access":true,"citations":9,"published_at":"","score":63.27},{"id":"crossref_10.6017/cs.v1i1.11765","title":"NI UTOPÍA, NI DISTOPÍA: VIAJE Y PREHISTORIA EN LA NARRATIVA GRÁFICA LA MUCHACHA SALVAJE, DE MIREIA PÉREZ","authors":[{"name":"Esther Raventós-Pons"}],"abstract":"Mireia Pérez, in La muchacha salvaje, imagines a mythical world, and goes back to the origins of our civilization to better understand the world in which she lives and women’s position in our society. Her graphic narrative focuses on the journey of the protagonist through different communities and modes of living that opens her eyes to other ways of thinking, being and seeing the world. This article examines the importance of the journey in shaping the identity of the main character. A protagonist who finds herself “out of place”, who lives displaced and in constant movement. Her travels through this imaginary world provide the arena to consider the female bildungsroman, the nomadic subject, the importance of silence in the narrative, as well as notions of subjectivity, deterritorialization, and the place of female authors in the comic world.\u0026#x0D; Resumen\u0026#x0D; Mireia Pérez, en La muchacha salvaje, inventa un mundo mítico y nos traslada a los orígenes de nuestra civilización para comprender mejor el mundo en que vive y la posición de la mujer en nuestra sociedad. La narrativa gráfica se centra en el viaje de la protagonista por diferentes comunidades y diferentes costumbres que le abren los ojos a otras formas de pensar, ser y ver el mundo. Este artículo examina el papel que cobra el viaje en la configuración de la identidad de un personaje que se encuentra “fuera de lugar”, que vive desplazado y en tránsito constante. El motivo temático del viaje por este mundo imaginario nos lleva a considerar varios aspectos, entre ellos, el bildungsroman femenino, el sujeto nómada, el silencio en esta narrativa gráfica así como nociones de subjetividad, desterritorialización y la situación de las autoras en el mundo del cómic.","source":"CrossRef","year":2019,"language":"en","subjects":null,"doi":"10.6017/cs.v1i1.11765","url":"https://doi.org/10.6017/cs.v1i1.11765","pdf_url":"https://ejournals.bc.edu/index.php/consecuencias/article/download/11765/9791","is_open_access":true,"published_at":"","score":63},{"id":"arxiv_1901.06337","title":"Start Making Sense: Semantic Plane Filtering and Control for Post-5G Connectivity","authors":[{"name":"Petar Popovski"},{"name":"Osvaldo Simeone"}],"abstract":"This is a short position paper that introduces the concepts of semantic plane filtering and control for post-5G connectivity.","source":"arXiv","year":2019,"language":"en","subjects":["cs.NI"],"url":"https://arxiv.org/abs/1901.06337","pdf_url":"https://arxiv.org/pdf/1901.06337","is_open_access":true,"published_at":"2019-01-18T16:49:49Z","score":63},{"id":"doaj_10.23638/DMTCS-19-3-14","title":"Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps","authors":[{"name":"Stéphane Devismes"},{"name":"David Ilcinkas"},{"name":"Colette Johnen"}],"abstract":"We deal with the problem of maintaining a shortest-path tree rooted at some process r in a network that may be disconnected after topological changes. The goal is then to maintain a shortest-path tree rooted at r in its connected component, V_r, and make all processes of other components detecting that r is not part of their connected component.  We propose, in the composite atomicity model, a silent self-stabilizing algorithm for this problem working in semi-anonymous networks, where edges have strictly positive weights. This algorithm does not require any a priori knowledge about global parameters of the network. We prove its correctness assuming the distributed unfair daemon, the most general daemon. Its stabilization time in rounds is at most 3nmax+D, where nmax is the maximum number of non-root processes in a connected component and D is the hop-diameter of V_r. Furthermore, if we additionally assume that edge weights are positive integers, then it stabilizes in a polynomial number of steps: namely, we exhibit a bound in O(maxi nmax^3 n), where maxi is the maximum weight of an edge and n is the number of processes.","source":"DOAJ","year":2017,"language":"","subjects":["Mathematics"],"doi":"10.23638/DMTCS-19-3-14","url":"https://dmtcs.episciences.org/3181/pdf","pdf_url":"https://dmtcs.episciences.org/3181/pdf","is_open_access":true,"published_at":"","score":61},{"id":"arxiv_1707.04832","title":"Metis CCNx 1.0 Forwarder","authors":[{"name":"Marc Mosko"}],"abstract":"Metis is the CCNx 1.0 forwarder that implements the CCNx 1.0 Semantics and Messages draft standards. This document describes how to use Metis and the internal software architecture.","source":"arXiv","year":2017,"language":"en","subjects":["cs.NI"],"url":"https://arxiv.org/abs/1707.04832","pdf_url":"https://arxiv.org/pdf/1707.04832","is_open_access":true,"published_at":"2017-07-16T06:56:51Z","score":61},{"id":"crossref_10.1038/srep26753","title":"Quasi-freestanding graphene on Ni(111) by Cs intercalation","authors":[{"name":"M. Alattas"},{"name":"U. Schwingenschlögl"}],"abstract":"AbstractA possible approach to achieve quasi-freestanding graphene on a substrate for technological purpose is the intercalation of alkali metal atoms. Cs intercalation between graphene and Ni(111) therefore is investigated using density functional theory, incorporating van der Waals corrections. It is known that direct contact between graphene and Ni(111) perturbs the Dirac states. We find that Cs intercalation restores the linear dispersion characteristic of Dirac fermions, which agrees with experiments, but the Dirac cone is shifted to lower energy, i.e., the graphene sheet is n-doped. Cs intercalation therefore decouples the graphene sheet from the substrate except for a charge transfer. On the other hand, the spin polarization of Ni(111) does not extend through the intercalated atoms to the graphene sheet, for which we find virtually spin-degeneracy.","source":"CrossRef","year":2016,"language":"en","subjects":null,"doi":"10.1038/srep26753","url":"https://doi.org/10.1038/srep26753","pdf_url":"https://www.nature.com/articles/srep26753.pdf","is_open_access":true,"citations":14,"published_at":"","score":60.42},{"id":"doaj_10.46298/dmtcs.1297","title":"Combinatorial optimization in networks with Shared Risk Link Groups","authors":[{"name":"David Coudert"},{"name":"Stéphane Pérennes"},{"name":"Hervé Rivano"},{"name":"Marie-Emilie Voge"}],"abstract":"The notion of Shared Risk Link Groups (SRLG) captures survivability issues when a set of links of a network may fail simultaneously. The theory of survivable network design relies on basic combinatorial objects that are rather easy to compute in the classical graph models: shortest paths, minimum cuts, or pairs of disjoint paths. In the SRLG context, the optimization criterion for these objects is no longer the number of edges they use, but the number of SRLGs involved. Unfortunately, computing these combinatorial objects is NP-hard and hard to approximate with this objective in general. Nevertheless some objects can be computed in polynomial time when the SRLGs satisfy certain structural properties of locality which correspond to practical ones, namely the star property (all links affected by a given SRLG are incident to a unique node) and the span 1 property (the links affected by a given SRLG form a connected component of the network). The star property is defined in a multi-colored model where a link can be affected by several SRLGs while the span property is defined only in a mono-colored model where a link can be affected by at most one SRLG. In this paper, we extend these notions to characterize new cases in which these optimization problems can be solved in polynomial time. We also investigate the computational impact of the transformation from the multi-colored model to the mono-colored one. Experimental results are presented to validate the proposed algorithms and principles.","source":"DOAJ","year":2016,"language":"","subjects":["Mathematics"],"doi":"10.46298/dmtcs.1297","url":"https://dmtcs.episciences.org/1297/pdf","pdf_url":"https://dmtcs.episciences.org/1297/pdf","is_open_access":true,"published_at":"","score":60},{"id":"doaj_10.46298/dmtcs.2163","title":"Robust Wireless Sensor Network Deployment","authors":[{"name":"Milan Erdelj"},{"name":"Nathalie Mitton"},{"name":"Tahiry Razafindralambo"}],"abstract":"In this work we present a decentralized deployment algorithm for wireless mobile sensor networks focused on deployment Efficiency, connectivity Maintenance and network Reparation (EMR). We assume that a group of mobile sensors is placed in the area of interest to be covered, without any prior knowledge of the environment.  The goal of the algorithm is to maximize the covered area and cope with sudden sensor failures. By relying on the locally available information regarding the environment and neighborhood, and without the need for any kind of synchronization in the network, each sensor iteratively chooses the next-step movement location so as to form a hexagonal lattice grid.  Relying on the graph of wireless mobile sensors, we are able to provide the properties regarding the quality of coverage, the connectivity of the graph and the termination of the algorithm. We run extensive simulations to provide compactness properties of the deployment and evaluate the robustness against sensor failures.  We show through the analysis and the simulations that EMR algorithm is robust to node failures and can restore the lattice grid.  We also show that even after a failure, EMR algorithm call still provide a compact deployment in a reasonable time.","source":"DOAJ","year":2016,"language":"","subjects":["Mathematics"],"doi":"10.46298/dmtcs.2163","url":"https://dmtcs.episciences.org/2163/pdf","pdf_url":"https://dmtcs.episciences.org/2163/pdf","is_open_access":true,"published_at":"","score":60},{"id":"arxiv_1508.01190","title":"Evaluation des Algorithmus DIBADAWN zum Detektieren von Bruecken und Gelenkpunkten in 802.11 Maschennetzen","authors":[{"name":"Robert Döring"}],"abstract":"The topic is the evaluation of the algorithm DIBADAWN to detect bridges and articulation points in an wireless mess network. Therefore this algorithm is implemented and evaluated per simulation.","source":"arXiv","year":2015,"language":"en","subjects":["cs.NI"],"url":"https://arxiv.org/abs/1508.01190","pdf_url":"https://arxiv.org/pdf/1508.01190","is_open_access":true,"published_at":"2015-08-05T19:41:59Z","score":59},{"id":"arxiv_1209.2635","title":"TCP/IP communication between two USRP-E110","authors":[{"name":"Luis Sanabria-Russo"}],"abstract":"This short report intends to provide an overview of the procedure and statistics of establishing a TCP/IP link between two USRP-E110. The testings are performed using an example GNURadio code and the networking protocol stack provided by the Linux operating system embedded in the USRP-E110.","source":"arXiv","year":2012,"language":"en","subjects":["cs.NI"],"url":"https://arxiv.org/abs/1209.2635","pdf_url":"https://arxiv.org/pdf/1209.2635","is_open_access":true,"published_at":"2012-09-12T15:05:57Z","score":56},{"id":"arxiv_1112.4339","title":"A Multipath Transport Protocol for Future Internet","authors":[{"name":"Bachir Chihani"},{"name":"Collange Denis"}],"abstract":"A Multipath Transport Protocol for Future Internet","source":"arXiv","year":2011,"language":"en","subjects":["cs.NI"],"url":"https://arxiv.org/abs/1112.4339","pdf_url":"https://arxiv.org/pdf/1112.4339","is_open_access":true,"published_at":"2011-12-19T13:54:23Z","score":55},{"id":"crossref_10.1145/1508865.1509051","title":"What makes CS teachers change?","authors":[{"name":"Lijun Ni"}],"abstract":"","source":"CrossRef","year":2009,"language":"en","subjects":null,"doi":"10.1145/1508865.1509051","url":"https://doi.org/10.1145/1508865.1509051","is_open_access":true,"citations":36,"published_at":"","score":54.08},{"id":"arxiv_1005.4018","title":"A grid environment consisting of heterogeneous compute resources for high performance computation","authors":[{"name":"Fred Viezens"}],"abstract":"This paper has been withdrawn.","source":"arXiv","year":2010,"language":"en","subjects":["cs.NI"],"url":"https://arxiv.org/abs/1005.4018","pdf_url":"https://arxiv.org/pdf/1005.4018","is_open_access":true,"published_at":"2010-05-21T17:27:30Z","score":54},{"id":"crossref_10.1145/1539024.1509051","title":"What makes CS teachers change?","authors":[{"name":"Lijun Ni"}],"abstract":"Computer Science (CS) education researchers hope their research has real impact on teaching practices. Developers of innovative curricula and tools for CS education want teachers to adopt their new approaches. What convinces a CS teacher to change and adopt something new--or not? This paper explores factors that influence CS teachers' adoption and change. We studied our workshop participants to determine factors influencing their decision on whether to adopt a new CS curriculum. The results from our study indicate that multiple factors, some surprising, influence CS teachers' adoption. Our findings suggest that teacher excitement in a new approach drives adoption, while more organizational or social issues inhibit adoption.","source":"CrossRef","year":2009,"language":"en","subjects":null,"doi":"10.1145/1539024.1509051","url":"https://doi.org/10.1145/1539024.1509051","is_open_access":true,"citations":15,"published_at":"","score":53.45},{"id":"doaj_10.46298/dmtcs.480","title":"Non Unitary Random Walks","authors":[{"name":"Philippe Jacquet"}],"abstract":"Motivated by the recent refutation of information loss paradox in black hole by Hawking, we investigate the new concept of {\\it non unitary random walks}. In a non unitary random walk, we consider that the state 0, called the {\\it black hole}, has a probability weight that decays exponentially in $e^{-\\lambda t}$ for some $\\lambda\u003e0$. This decaying probabilities affect the probability weight of the other states, so that the the apparent transition probabilities are affected by a repulsion factor that depends on the factors $\\lambda$ and black hole lifetime $t$. If $\\lambda$ is large enough, then the resulting transition probabilities correspond to a neutral random walk. We generalize to {\\it non unitary gravitational walks} where the transition probabilities are function of the distance to the black hole. We show the surprising result that the black hole remains attractive below a certain distance and becomes repulsive with an exactly reversed random walk beyond this distance. This effect has interesting analogy with so-called dark energy effect in astrophysics.","source":"DOAJ","year":2009,"language":"","subjects":["Mathematics"],"doi":"10.46298/dmtcs.480","url":"https://dmtcs.episciences.org/480/pdf","pdf_url":"https://dmtcs.episciences.org/480/pdf","is_open_access":true,"published_at":"","score":53},{"id":"doaj_10.46298/dmtcs.481","title":"Combinatorial Route to Algebra: The Art of Composition \u0026 Decomposition","authors":[{"name":"Pawel Blasiak"}],"abstract":"We consider a general concept of composition and decomposition of objects, and discuss a few natural properties one may expect from a reasonable choice thereof. It will be demonstrated how this leads to multiplication and co-multiplication laws, thereby providing a generic scheme furnishing combinatorial classes with an algebraic structure. The paper is meant as a gentle introduction to the concepts of composition and decomposition with the emphasis on combinatorial origin of the ensuing algebraic constructions.","source":"DOAJ","year":2009,"language":"","subjects":["Mathematics"],"doi":"10.46298/dmtcs.481","url":"https://dmtcs.episciences.org/481/pdf","pdf_url":"https://dmtcs.episciences.org/481/pdf","is_open_access":true,"published_at":"","score":53}],"total":502534,"page":1,"page_size":20,"sources":["CrossRef","DOAJ","arXiv"],"query":"cs.NI"}