Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 4,199 papers for “Serialization”

Predictable Serialization in Java

Daniel Tejera, A. Alonso, Miguel Á. de Miguel · 2007

RTSJ (Real-Time Specification for Java) extends and adapts the Java technology in order to allow the development of real time systems. In RTSJ the requirements of distributed systems were not considered. The serialization in Java is an example of a basic operation that needs to be reviewed to make distributed Java fully predictable and suitable for hard-real time systems. However, the most recent works in the application of Java in distributed real-time systems do not specify how a serialization process must be used in order to obtain a deterministic behavior. This paper describes a new serialization process focused on hard real-time systems which provide full time and space predictability

Cited by 9

Energy-efficient Transaction Serialization

Daniel Evans · Pace Digital Repository (Pace University) · 2020

This dissertation presents two designs, the Transaction Serial Format (TSF) and the Transaction Array Model (TAM). Together, they provide full, efficient, transaction serialization facilities for devices with limited onboard energy, such as those in an Internet of Things (IoT) network. TSF provides a compact, non-parsed, format that requires minimal processing for transaction deserialization. TAM provides an internal data structure that needs minimal dynamic storage and directly uses the elements of TSF. The simple lexical units of TSF do not require parsing. The lexical units contain enough information to allocate the internal TAM data structure efficiently. TSF generality is equivalent to XML and JSON. TSF represents any XML document or JSON object without loss of information, including whitespace. The XML equivalence provides a foundation for the performance comparisons. A performance comparison of a C reference implementation of TSF and TAM to the popular Expat XML library, also written in C, shows that TSF reduces deserialization processor time by more than 80%.

Cited by 0

The PROV-JSON serialization

Huynh, Trung Dong, Jewell, Michael O., Sezavar Keshavarz, Amir et al. · ePrints Soton (University of Southampton) · 2013

This document specifies a JSON representation for the PROV Data Model, called PROV-JSON. It provides a compact and faithful representation of PROV that supports fast data look-up and is particularly suitable for interchanging PROV documents between web services and clients.

Cited by 0

Serialization #3 [Wordsong] Spark

Simon Ewins · Bulletin of Miscellaneous Information (Royal Gardens Kew) · 2007

Experimental piece using the word spark to generate a twelve tone seed for a serialized composition.

Cited by 0

RApiSerialize: R API Serialization

Dirk Eddelbuettel, R Core, Ei-ji Nakama et al. · 2014

Access to the internal R serialization code is provided for use by other packages at the C function level by using the registration of native function mechanism. Client packages simply include a single header file RApiSerializeAPI.h provided by this package. This packages builds on the Rhpc package by Ei-ji Nakama and Junji Nakano which also includes a (partial) copy of the file src/main/serialize.c from R itself. The R Core group is the original author of the serialization code made available by this package.

Cited by 0Open access

Key/Encoded-Value Serialization

NISO Committee AX, OpenURL Standard Committee · 2004

The KEV Serialization resembles the query component of an HTTP GET request.Often, HTTP GET requests are constructed to transmit information from a user agent to a processing agent.The user agent builds an HTTP URI query component from an HTML form data set on a GET method request and appends this component to an HTTP URI with a question-mark character ('?') as a separator.The processing agent residing at this HTTP URI interprets and processes the query component.The syntax of the query component is a list of key/value pairs delimited by ampersand characters ('&'), such as: key1=value1&key2=value2The key/value pairs are delimited by an equals character ('=') and concatenated with an ampersand character ('&').Keys may occur multiple times in order to associate multiple values with each key.IETF RFC 2396 [6] reserves the following characters for special use within the query component: ';', '/', '?', ':', '@', '&', '=', '+', '$', and ','.These characters must be escaped by URL-encoding.The key/value syntax is also used on hyperlinks embedded in HTML documents to send parameters to a processing agent.Similarly, on a request that uses the POST method, user agents use the same syntax to include the form data set within an HTTP entity body.Keys must be constructed from characters that remain invariant under URL-encoding (also known as safe characters).Values may be constructed from both safe and unsafe characters and must be URL-encoded.This explains the name Key/Encoded-Value or KEV for this Serialization.To simplify the descriptions that follow, we include a leading ampersand character ('&') with each KEV pair, as in &key=value.By doing this, the complete KEV Serialization is a simple concatenation of KEV pairs.

Cited by 0Open access

Serialization in Goethe's morphology

Geulen, Eva · Publication Server of Goethe University Frankfurt am Main (Goethe University Frankfurt) · 2016

Before turning to the essay on the experiment from 1793, which is unavoidable when discussing series, but does not exhaust the varied functions of seriality in Goethe’s morphology, a few words about the purpose of reconstructing Goethe’s practice of seriality are necessary. I want to argue that Goethe’s morphology is the site of a massive transformation of the notion of form, the scope and implications of which resurface after long latency at the beginning of the 20th century, for example, with Georg Simmel’s sociological notion of form-processes and the related idea of "reciprocity" ('Wechselwirkung') (cf. 265). My interest lies in interpreting what looks like a theory of organisms and nature as a more general theory of formation and transformation.

Cited by 0Open access

APIS CIDOC CRM serialization

Matthias Schlögl, Maximilian Kaiser, Ágoston Zénó Bernád et al. · Zenodo (CERN European Organization for Nuclear Research) · 2021

This is a trig serialisation of the enriched version of the Austrian Biographical Dictionary. The data was enriched during the Austrian Prosopographical Information System (APIS) project. It contains data on ~19.000 persons who had an impact on Austrian soil and died between 1815 and 1955. This version of the APIS data uses CIDOC CRM and is less complete than the also available JSON version of the data (using a custom data model). Please refer to Matthias Schlögl for any inquiries.

Cited by 0Open access

Portable serialization of CORBA objects

Marc‐Olivier Killijian, Juan–Carlos Ruiz, Jean-Charles Fabre · ACM SIGPLAN Notices · 2002

The objective of this work is to define, implement and illustrate a portable serialization technique for CORBA objects. We propose an approach based on reflection: through open compilers facilities the internal state of CORBA objects is obtained and transformed into a language independent format using CORBA mechanisms. This state can be restored and used by objects developed using different languages and running on different software platforms. A tool was developed and applied to a Chat application as a case study. The proposed technique is used to exchange state information between a C++ and a Java incarnation of this CORBA service. An observer tool enables the object state to be displayed and analyzed by the user. The applicability of this technique to various domains is discussed. Beyond the interest of language reflection, we finally advocate that operating system and middleware reflection would also be powerful concepts to extend the work presented in this paper.

Cited by 2

Verbal Serialization in Biblical Aramaic

Alexander Andrason, Bonsam Koo · Altorientalische Forschungen · 2020

Abstract The present paper discusses the issue of Serial Verb Constructions (SVCs) in Biblical Aramaic within the dynamic grammaticalization-based model of verbal serialization – a recent modification of a prototype-driven approach to SVCs used in linguistic typology. Having analyzed the entire corpus of Biblical Aramaic, the authors conclude the following: (a) verbal serialization constitutes an integral part of the verbal system of Biblical Aramaic; (b) pre-canonical SVCs are more common that canonical SVCs, and no cases of post-canonicity are attested; (c) Biblical Aramaic is a semi-advanced serializing language. Overall, the research corroborates the tendency of Semitic languages to gradually increase their serializing profile; a tendency that is often – albeit not without exception – correlated with the languages’ relative chronology.

Cited by 10

Seselwa Serialization and its Significance

Derek Bickerton · Journal of Pidgin and Creole Languages · 1989

Hitherto it has been believed that serial verb constructions were not found in the French Creoles of the Indian Ocean. In fact, there exists a wide variety of such constructions in both Morisyen and Seselwa; extensive examples from Seselwa are provided. However, for less basilectal speakers, such constructions must carry on each verb a tense marker which is identical to that on the matrix verb. This fact, together with the misanalysis of Seselwa i as a reprise pronoun, served to disguise the nature of Seselwa serials. The data surveyed has significant consequences for future studies of creoles and for theories of creole origins.

Cited by 33

Serialization-aware call graph construction

Joanna C. S. Santos, Reese A. Jones, Chinomso Ashiogwu et al. · 2021

Although call graphs are crucial for inter-procedural analyses, it is challenging to statically compute them for programs with dynamic features. Prior work focused on supporting certain kinds of dynamic features, but serialization-related features are still not very well supported. Therefore, we introduce Salsa, an approach to complement existing points-to analysis with respect to serialization-related features to enhance the call graph’s soundness while not greatly affecting its precision. We evaluate Salsa’s soundness, precision, and performance using 9 programs from the Java Call graph Assessment & Test Suite (CATS) and 4 programs from the XCorpus dataset. We compared Salsa against off-the-shelf call graph construction algorithms available on Soot, Doop, WALA, and OPAL. Our experiments showed that Salsa improved call graphs’ soundness while not greatly affecting their precision. We also observed that Salsa did not incur an extra overhead on the underlying pointer analysis method.

Cited by 11

6. Valency, Transitivity and Serialization

Chikelu I. Ezenwafor-Afuecheta · Open Book Publishers · 2025

This chapter offers an in-depth analysis of the argument structure of the Etulo verb, exploring how verbs differ in the number, the types of participants (arguments) they require and how those arguments are realised grammatically. Etulo verbs are classified into transitive, intransitive, ambitransitive, and ditransitive types, and further distinguished according to whether they belong to the class of “obligatory-complement verbs” (OCVs) or non-obligatory-complement verbs (NCVs). A central point is the distinction between noun complements that function merely as meaning specifiers versus those that qualify as true direct objects; this distinction is supported by features such as word order and pronominalization. The language’s rigid subject-verb-object (SVO) ordering is shown to play a key role in marking grammatical relations, especially since Etulo has limited morphological marking for objects. In addition, the chapter describes how Etulo manipulates verb valence, adding or removing arguments through operations such as causativization and applicativization, and examines reflexive, reciprocal, and anticausative constructions. There is a particular focus on serial verb constructions: how they are formed, what semantic functions they encode (e.g. direction, benefactivity, comparison), and how they interact with transitivity and argument structure. A contrast is drawn between consecutive multi-verb constructions, where events are simply placed in sequence, and serial verb constructions, where verbs combine to form a unified predicate. Altogether, the data reveal that Etulo relies on syntax and predicate combinations rather than extensive morphological marking to encode complex events and argument relations.

Cited by 0Open access

Verb serialization and object position

Tonjes Veenstra · Linguistics · 2000

This paper discusses the phrase-structure configuration of resultative serial-verb constructions and the position of the object in these constructions. It is argued that the analysis involves a VP-shell configuration in which the second VP is an adjunct to the first VP (cf. Larson 1991). As such, serial-verb constructions are instances of pseudo-complementation, as defined in Seuren (1991). The object is part of the first predicate, and the argument-sharing effect is obtained through operator movement inside the second predicate. The evidence is based on a careful examination of sandhi phenomena, case-licensing mechanisms, extraction patterns (argument as well as adjunct), placement of ideophones, and the (un)availability of parasitic gaps. If serial-verb constructions do reduce to secondary-predication constructions, then the study of verb serialization can shed some new light on an old controversy of linguistic theory, namely the syntactic structure of secondary predication. It is argued that the analysis proposed in this paper can be extended to secondary-predication constructions in nonserializing languages.

Cited by 10