Search
Author
- Osman, Ahmed I. (5)
- Daqing, Ma (3)
- Jorgensen, Ed (3)
- Li, Yan (3)
- next >
Subject
- kinh tế (26)
- Economics (12)
- programming (10)
- XRD (10)
- next >
Date issued
- 2020 - 2025 (2128)
- 2010 - 2019 (129)
- 2000 - 2009 (9)
- 1999 - 1999 (1)
Has File(s)
Search Results
Session types are a well-established framework for the specification of interactions between components of a distributed systems. An important issue is how to determine the type for an open system, i.e., obtained by assembling subcomponents, some of which could be missing. To this end, we introduce partial sessions and partial (multiparty) session types. Partial sessions can be composed, and the type of the resulting system is derived from those of its components without knowing any suitable global type nor the types of missing parts. To deal with this incomplete information, partial session types represent the subjective views of the interactions from participants’ perspectives; when sessions are composed, different partial views can be merged if compatible, yielding a unified view... |
We construct optimal flat functions in Carleman–Roumieu ultraholomorphic classes associated to general strongly nonquasianalytic weight sequences, and defined on sectors of suitably restricted opening. A general procedure is presented in order to obtain linear continuous extension operators, right inverses of the Borel map, for the case of regular weight sequences in the sense of Dyn’kin. Finally, we discuss some examples (including the well-known q-Gevrey case) where such optimal flat functions can be obtained in a more explicit way. |
We consider a two-dimensional determinantal point process arising in the random normal matrix model and which is a two-parameter generalization of the complex Ginibre point process. In this paper, we prove that the probability that no points lie on any number of annuli centered at 0 satisfies large n asymptotics of the form... |
Online social network datasets contain a large amount of various information about their users. Preserving users’ privacy while publishing or sharing datasets with third parties has become a challenging problem. The k-automorphism is the anonymization method that protects the social network dataset against any passive structural attack. It provides a higher level of protection than other k-anonymity methods, including k-degree or k-neighborhood techniques. In this paper, we propose a hybrid algorithm that effectively modifies the social network to the k-automorphism one. |
Modern SAT solvers can emit independently-checkable proof certificates to validate their results. The state-of-the-art proof system that allows for compact proof certificates is propagation redundancy (PR
). However, the only existing method to validate proofs in this system with a formally verified tool requires a transformation to a weaker proof system, which can result in a significant blowup in the size of the proof and increased proof validation time. This article describes the first approach to formally verify PR
proofs on a succinct representation. We present (i) a new Linear PR (LPR) proof format, (ii) an extension of the DPR-trim tool to efficiently convert PR
proofs into LPR format, and (iii) cake_lpr, a verified LPR proof checker developed in CakeML. |
Lung adenocarcinoma (LUAD) is characterized by high morbidity and mortality rates and poor prognosis. N7-methylguanosine play an increasingly vital role in lung adenocarcinoma. However, the prognostic value of N7-methylguanosine related-miRNAs in lung adenocarcinoma remains unclear. |
The continuous increase of electric vehicles is being facilitating the large-scale distributed charging-pile deployment. It is crucial to guarantee normal operation of charging piles, resulting in the importance of diagnosing charging-pile faults. The existing fault-diagnosis approaches were based on physical fault data like mechanical log data and sensor data streams. However, there are other types of fault data, which cannot be used for diagnosis by these existing approaches. This paper aims to fill this gap and consider 8 types of fault data for diagnosing, at least including physical installation error fault, charging-pile mechanical fault, charging-pile program fault, user personal fault, signal fault (offline), pile compatibility fault, charging platform fault, and other fault... |
Cluster algebras were introduced by Fomin and Zelevinsky as a tool in the study of Lusztig’s dual canonical bases. Since their inception they have found application in a variety of different areas in mathematics, nevertheless a fundamental problem in the theory remains constructing bases with “good” properties. |
Overview: This text covers the theory and application of discrete semiconductor devices including diodes, bipolar junction transistors, JFETs, MOSEFETs and IGBTs. It is appropriate for Associate and Bachelors degrees programs in Electrical and Electronic Engineering Technology, Electrical Engineering and similar areas of study. Applications include rectifying, clipping, clamping, switching, small signal amplifiers and followers, and class A, B and D power amplifiers. A companion laboratory manual is available. The text is also available in Open Document Text (.odt) format. |
Salient object detection (SOD) in RGB and depth images has attracted increasing research interest. Existing RGB-D SOD models usually adopt fusion strategies to learn a shared representation from RGB and depth modalities, while few methods explicitly consider how to preserve modality-specific characteristics. In this study, we propose a novel framework, the specificity-preserving network (SPNet), which improves SOD performance by exploring both the shared information and modality-specific properties. |
