Готові списки джерел за темами / Code property graph

Зміст

Статті в журналах
Дисертації
Частини книг
Тези доповідей конференцій
Звіти організацій

Добірка наукової літератури з теми "Code property graph"

Автор: Grafiati

Опубліковано: 15 лютого 2025

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Code property graph".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Code property graph"

Saenpholphat, Varaporn, and Ping Zhang. "Conditional resolvability in graphs: a survey." International Journal of Mathematics and Mathematical Sciences 2004, no. 38 (2004): 1997–2017. http://dx.doi.org/10.1155/s0161171204311403.

Повний текст джерела

Анотація:

For an ordered setW={w1,w2,…,wk}of vertices and a vertexvin a connected graphG, the code ofvwith respect toWis thek-vectorcW(v)=(d(v,w1),d(v,w2),…,d(v,wk)), whered(x,y)represents the distance between the verticesxandy. The setWis a resolving set forGif distinct vertices ofGhave distinct codes with respect toW. The minimum cardinality of a resolving set forGis its dimensiondim(G). Many resolving parameters are formed by extending resolving sets to different subjects in graph theory, such as the partition of the vertex set, decomposition and coloring in graphs, or by combining resolving property with another graph-theoretic property such as being connected, independent, or acyclic. In this paper, we survey results and open questions on the resolving parameters defined by imposing an additional constraint on resolving sets, resolving partitions, or resolving decompositions in graphs.

Стилі APA, Harvard, Vancouver, ISO та ін.

Klavžar, Sandi, Uroš Milutinović, and Ciril Petr. "1-perfect codes in Sierpiński graphs." Bulletin of the Australian Mathematical Society 66, no. 3 (December 2002): 369–84. http://dx.doi.org/10.1017/s0004972700040235.

Повний текст джерела

Анотація:

Sierpiński graphs S (n, κ) generalise the Tower of Hanoi graphs—the graph S (n, 3) is isomorphic to the graph Hn of the Tower of Hanoi with n disks. A 1-perfect code (or an efficient dominating set) in a graph G is a vertex subset of G with the property that the closed neighbourhoods of its elements form a partition of V (G). It is proved that the graphs S (n, κ) possess unique 1-perfect codes, thus extending a previously known result for Hn. An efficient decoding algorithm is also presented. The present approach, in particular the proposed (de)coding, is intrinsically different from the approach to Hn.

Стилі APA, Harvard, Vancouver, ISO та ін.

Pilongo, Jupiter, Leonard Mijares Paleta, and Philip Lester P. Benjamin. "Vertex-weighted $(k_{1},k_{2})$ $E$-torsion Graph of Quasi Self-dual Codes." European Journal of Pure and Applied Mathematics 17, no. 2 (April 30, 2024): 1369–84. http://dx.doi.org/10.29020/nybg.ejpam.v17i2.4867.

Повний текст джерела

Анотація:

In this paper, we have introduced a graph $G_{EC}$ generated by type-$(k_{1},k_{2})$ $E$-codes which is $(k_{1},k_{2})$ $E$-torsion graph. The binary code words of the torsion code of $C$ are the set of vertices, and the edges are defined using the construction of $E$-codes. Also, we characterized the graph obtained when $k_{1}=0$ and $k_{2}=0$ and calculated the degrees of every vertex and the number of edges of $G_{EC}$. Moreover, we presented necessary and sufficient conditions for a vertex to be in the center of a graph given the property of the code word corresponding to the vertex. Finally, we represent every quasi-self dual codes of short length by defining the vertex-weighted $(k_{1},k_{2})$ $E$-torsion graph, where the weight of every vertex is the weight of the code word corresponding to the vertex.

Стилі APA, Harvard, Vancouver, ISO та ін.

Zhao, Chunhui, Tengfei Tu, Cheng Wang, and Sujuan Qin. "VulPathsFinder: A Static Method for Finding Vulnerable Paths in PHP Applications Based on CPG." Applied Sciences 13, no. 16 (August 14, 2023): 9240. http://dx.doi.org/10.3390/app13169240.

Повний текст джерела

Анотація:

Today, as PHP application technology is becoming increasingly mature, the functions of modern multi-layer web applications are becoming more and more complete, and the complexity is also gradually increasing. While providing developers with various business functions and interfaces, multi-tier Web applications also successfully cover the details of application development. This type of web application adopts a unified entrance, many object-oriented codes are used, and features such as encapsulation, inheritance, and polymorphism bring challenges to vulnerability mining from the perspective of static analysis. A large amount of object-oriented code makes it impossible for a simple function name-matching method to build a complete call graph (CG), resulting in the inability to perform a comprehensive interprocedural analysis. At the same time, the encapsulation feature of the class makes the data hidden in the object attribute, and the vulnerability path cannot be obtained through the general data-flow analysis. In response to the above issues, we propose a vulnerability detection method that supports vulnerability detection for multi-layer web applications based on MVC (Model-View-Control) architecture. First, we improve the construction of the call graph and Code Property Graph (CPG). Then, based on the enhanced Code Property Graph, we propose a technique to support vulnerability detection for multi-layer web applications. Based on this approach, we implemented a prototype of VulPathsFinder, a security analysis tool extended from the PHP security analyzer Joern-PHP. Then, we select ten MVC based and ten non-MVC-based applications to form a test dataset and validate the effectiveness of VulPathsFinder based on this dataset. Experimental results show that, compared with currently available tools, VulPathsFinder can handle framework applications more effectively, build a complete code property map, and detect vulnerabilities in framework applications that existing tools cannot detect.

Стилі APA, Harvard, Vancouver, ISO та ін.

Kunz, Immanuel, Konrad Weiss, Angelika Schneider, and Christian Banse. "Privacy Property Graph: Towards Automated Privacy Threat Modeling via Static Graph-based Analysis." Proceedings on Privacy Enhancing Technologies 2023, no. 2 (April 2023): 171–87. http://dx.doi.org/10.56553/popets-2023-0046.

Повний текст джерела

Анотація:

Privacy threat modeling should be done frequently throughout development and production to be able to quickly mitigate threats. Yet, it can also be a very time-consuming activity. In this paper, we use an enhanced code property graph to partly automate the privacy threat modeling process: It automatically generates a data flow diagram from source code which exhibits privacy properties of data flows, and which can be analyzed semi-automatically via queries. We provide a list of such reusable queries that can be used to detect various privacy threats. To enable this analysis, we integrate a taint-tracking mechanism into the graph using privacy-specific labels. Since no benchmark for such an approach exists, we also present a test suite for privacy threat implementations which comprises implementations for 22 privacy threats in multiple programming languages. We expect that our approach significantly reduces time consumption of threat modeling and show that it also has potential beyond the threat categories defined by LINDDUN, e.g. to detect privacy anti-patterns and verify compliance to privacy policies.

Стилі APA, Harvard, Vancouver, ISO та ін.

Paiva, José, José Leal, and Álvaro Figueira. "Comparing semantic graph representations of source code: The case of automatic feedback on programming assignments." Computer Science and Information Systems, no. 00 (2024): 4. http://dx.doi.org/10.2298/csis230615004p.

Повний текст джерела

Анотація:

Static source code analysis techniques are gaining relevance in automated assessment of programming assignments as they can provide less rigorous evaluation and more comprehensive and formative feedback. These techniques focus on source code aspects rather than requiring effective code execution. To this end, syntactic and semantic information encoded in textual data is typically represented internally as graphs, after parsing and other preprocessing stages. Static automated assessment techniques, therefore, draw inferences from intermediate representations to determine the correctness of a solution and derive feedback. Consequently, achieving the most effective semantic graph representation of source code for the specific task is critical, impacting both techniques? accuracy, outcome, and execution time. This paper aims to provide a thorough comparison of the most widespread semantic graph representations for the automated assessment of programming assignments, including usage examples, facets, and costs for each of these representations. A benchmark has been conducted to assess their cost using the Abstract Syntax Tree (AST) as a baseline. The results demonstrate that the Code Property Graph (CPG) is the most feature-rich representation, but also the largest and most space-consuming (about 33% more than AST).

Стилі APA, Harvard, Vancouver, ISO та ін.

Zhang, Ji, Baoming Bai, Xijin Mu, Hengzhou Xu, Zhen Liu, and Huaan Li. "Construction and Decoding of Rate-Compatible Globally Coupled LDPC Codes." Wireless Communications and Mobile Computing 2018 (2018): 1–14. http://dx.doi.org/10.1155/2018/4397671.

Повний текст джерела

Анотація:

This paper presents a family of rate-compatible (RC) globally coupled low-density parity-check (GC-LDPC) codes, which is constructed by combining algebraic construction method and graph extension. Specifically, the highest rate code is constructed using the algebraic method and the codes of lower rates are formed by successively extending the graph of the higher rate codes. The proposed rate-compatible codes provide more flexibility in code rate and guarantee the structural property of algebraic construction. It is confirmed, by numerical simulations over the AWGN channel, that the proposed codes have better performances than their counterpart GC-LDPC codes formed by the classical method and exhibit an approximately uniform gap to the capacity over a wide range of rates. Furthermore, a modified two-phase local/global iterative decoding scheme for GC-LDPC codes is proposed. Numerical results show that the proposed decoding scheme can reduce the unnecessary cost of local decoder at low and moderate SNRs, without any increase in the number of decoding iterations in the global decoder at high SNRs.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ma, Hehuan, Yatao Bian, Yu Rong, Wenbing Huang, Tingyang Xu, Weiyang Xie, Geyan Ye, and Junzhou Huang. "Cross-dependent graph neural networks for molecular property prediction." Bioinformatics 38, no. 7 (January 30, 2022): 2003–9. http://dx.doi.org/10.1093/bioinformatics/btac039.

Повний текст джерела

Анотація:

Abstract Motivation The crux of molecular property prediction is to generate meaningful representations of the molecules. One promising route is to exploit the molecular graph structure through graph neural networks (GNNs). Both atoms and bonds significantly affect the chemical properties of a molecule, so an expressive model ought to exploit both node (atom) and edge (bond) information simultaneously. Inspired by this observation, we explore the multi-view modeling with GNN (MVGNN) to form a novel paralleled framework, which considers both atoms and bonds equally important when learning molecular representations. In specific, one view is atom-central and the other view is bond-central, then the two views are circulated via specifically designed components to enable more accurate predictions. To further enhance the expressive power of MVGNN, we propose a cross-dependent message-passing scheme to enhance information communication of different views. The overall framework is termed as CD-MVGNN. Results We theoretically justify the expressiveness of the proposed model in terms of distinguishing non-isomorphism graphs. Extensive experiments demonstrate that CD-MVGNN achieves remarkably superior performance over the state-of-the-art models on various challenging benchmarks. Meanwhile, visualization results of the node importance are consistent with prior knowledge, which confirms the interpretability power of CD-MVGNN. Availability and implementation The code and data underlying this work are available in GitHub at https://github.com/uta-smile/CD-MVGNN. Supplementary information Supplementary data are available at Bioinformatics online.

Стилі APA, Harvard, Vancouver, ISO та ін.

Cao, Xiansheng, Junfeng Wang, Peng Wu, and Zhiyang Fang. "VulMPFF: A Vulnerability Detection Method for Fusing Code Features in Multiple Perspectives." IET Information Security 2024 (March 22, 2024): 1–15. http://dx.doi.org/10.1049/2024/4313185.

Повний текст джерела

Анотація:

Source code vulnerabilities are one of the significant threats to software security. Existing deep learning-based detection methods have proven their effectiveness. However, most of them extract code information on a single intermediate representation of code (IRC), which often fails to extract multiple information hidden in the code fully, significantly limiting their performance. To address this problem, we propose VulMPFF, a vulnerability detection method that fuses code features under multiple perspectives. It extracts IRC from three perspectives: code sequence, lexical and syntactic relations, and graph structure to capture the vulnerability information in the code, which effectively realizes the complementary information of multiple IRCs and improves vulnerability detection performance. Specifically, VulMPFF extracts serialized abstract syntax tree as IRC from code sequence, lexical and syntactic relation perspective, and code property graph as IRC from graph structure perspective, and uses Bi-LSTM model with attention mechanism and graph neural network with attention mechanism to learn the code features from multiple perspectives and fuse them to detect the vulnerabilities in the code, respectively. We design a dual-attention mechanism to highlight critical code information for vulnerability triggering and better accomplish the vulnerability detection task. We evaluate our approach on three datasets. Experiments show that VulMPFF outperforms existing state-of-the-art vulnerability detection methods (i.e., Rats, FlawFinder, VulDeePecker, SySeVR, Devign, and Reveal) in Acc and F1 score, with improvements ranging from 14.71% to 145.78% and 152.08% to 344.77%, respectively. Meanwhile, experiments in the open-source project demonstrate that VulMPFF has the potential to detect vulnerabilities in real-world environments.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ferreira, Mafalda, Miguel Monteiro, Tiago Brito, Miguel E. Coimbra, Nuno Santos, Limin Jia, and José Fragoso Santos. "Efficient Static Vulnerability Analysis for JavaScript with Multiversion Dependency Graphs." Proceedings of the ACM on Programming Languages 8, PLDI (June 20, 2024): 417–41. http://dx.doi.org/10.1145/3656394.

Повний текст джерела

Анотація:

While static analysis tools that rely on Code Property Graphs (CPGs) to detect security vulnerabilities have proven effective, deciding how much information to include in the graphs remains a challenge. Including less information can lead to a more scalable analysis but at the cost of reduced effectiveness in identifying vulnerability patterns, potentially resulting in classification errors. Conversely, more information in the graph allows for a more effective analysis but may affect scalability. For example, scalability issues have been recently highlighted in ODGen, the state-of-the-art CPG-based tool for detecting Node.js vulnerabilities. This paper examines a new point in the design space of CPGs for JavaScript vulnerability detection. We introduce the Multiversion Dependency Graph (MDG), a novel graph-based data structure that captures the state evolution of objects and their properties during program execution. Compared to the graphs used by ODGen, MDGs are significantly simpler without losing key information needed for vulnerability detection. We implemented Graph.js, a new MDG-based static vulnerability scanner specialized in analyzing npm packages and detecting taint-style and prototype pollution vulnerabilities. Our evaluation shows that Graph.js outperforms ODGen by significantly reducing both the false negatives and the analysis time. Additionally, we have identified 49 previously undiscovered vulnerabilities in npm packages.

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Code property graph"

Bertrand, Sébastien. "Modèle de maintenabilité logicielle par analyse statique du graphe de code du programme." Electronic Thesis or Diss., Bordeaux, 2024. http://www.theses.fr/2024BORD0414.

Повний текст джерела

Анотація:

Le coût élevé de la maintenance des logiciels exige de travailler sur leur maintenabilité. Bien qu’émergente de la structure du code source, son évaluation est subjective, car elle dépend des développeurs et du contexte. Les modèles de maintenabilité actuels tendent à réduire la maintenabilité à un score unidimensionnel basé sur des métriques, souvent mal définies, qui représentent mal la structure du code. Nos travaux se sont basés sur l’analyse statique des graphes de code pour évaluer la maintenabilité. Ils ont permis de développer Javanalyser, un outil libre qui génère automatiquement le graphe de code d’un programme Java. Ces graphes ont permis de formaliser 33 métriques statiques sous forme de requêtes déclarative et ont permis de reproduire avec succès une étude de Schnappinger et al. Notre extension de l’étude confirme l’importance de la taille du programme comme facteur influençant la maintenabilité, sans toutefois négliger l’impact des autres métriques. Ce travail ouvre la voie à une compréhension plus approfondie de la maintenabilité, grâce à une représentation multidimensionnelle permettant de tenir compte de la variabilité entre les développeurs
The high cost of software maintenance requires a focus on software maintainability. Although it emerges from the structure of the source code, its evaluation is subjective, as it depends on developers and the context. Current maintainability models tend to reduce maintainability to a one-dimensional score based on metrics, often poorly defined, which inadequately represent the structure of the code. Our work is based on the static analysis of code graphs to evaluate maintainability. It led to the development of Javanalyser, an open-source tool that automatically generates the code graph of a Java program. These graphs enabled the formalization of 33 static metrics as declarative queries, and allowed the successful replication of a study by Schnappinger et al. Our extension of the study confirmed the importance of size as a factor influencing maintainability, while also recognizing the impact of other metrics. This work opens the way to a deeper understanding of maintainability through a multidimensional representation that takes into account the variability between developers

Стилі APA, Harvard, Vancouver, ISO та ін.

Jiang, Wen. "Maximum Codes with the Identifiable Parent Property." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/14072.

Повний текст джерела

Анотація:

We study codes that have identifiable parent property. Such codes are called IPP codes. Research on IPP codes is motivated by design of schemes that protect against piracy of digital products. Construction and decoding of maximum IPP codes have been studied in rich literature. General bounds on F(n,q), the maximum size of IPP codes of length n over an alphabet with q elements, have been obtained through the use of techniques from graph theory and combinatorial design. Improved bounds on F(3,q) and F(4,q) are obtained. Probabilistic techniques are also used to prove the existence of certain IPP codes. We prove a precise formula for F(3,q), construct maximum IPP codes with size F(3,q), and give an efficient decoding algorithm for such codes. The main techniques used in this thesis are from graph theory and nonlinear optimization. Our approach may be used to improve bounds on F(2k+1, q). For example, we characterize the associated graphs of maximum IPP codes of length 5, and obtain bounds on F(5,q).

Стилі APA, Harvard, Vancouver, ISO та ін.

Частини книг з теми "Code property graph"

Küchler, Alexander, and Christian Banse. "Representing LLVM-IR in a Code Property Graph." In Lecture Notes in Computer Science, 360–80. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-22390-7_21.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Li, Wei, Xiang Li, Wanzheng Feng, Guanglu Jin, Zhihan Liu, and Jing Jia. "Vulnerability Detection Based on Unified Code Property Graph." In Web Information Systems and Applications, 359–70. Singapore: Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-99-6222-8_30.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Guan, Zhibin, Xiaomeng Wang, Wei Xin, and Jiajie Wang. "Code Property Graph-Based Vulnerability Dataset Generation for Source Code Detection." In Communications in Computer and Information Science, 584–91. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-9739-8_43.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Xiao, Na, Jing Zeng, Qigui Yao, and Xiuli Huang. "A Method of Firmware Vulnerability Mining and Verification Based on Code Property Graph." In Advances in Artificial Intelligence and Security, 543–56. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-06764-8_42.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Samy, Ahmed E., Zekarias T. Kefato, and Šarūnas Girdzijauskas. "Data-Driven Self-Supervised Graph Representation Learning." In Frontiers in Artificial Intelligence and Applications. IOS Press, 2023. http://dx.doi.org/10.3233/faia230325.

Повний текст джерела

Анотація:

Self-supervised graph representation learning (SSGRL) is a representation learning paradigm used to reduce or avoid manual labeling. An essential part of SSGRL is graph data augmentation. Existing methods usually rely on heuristics commonly identified through trial and error and are effective only within some application domains. Also, it is not clear why one heuristic is better than another. Moreover, recent studies have argued against some techniques (e.g., dropout: that can change the properties of molecular graphs or destroy relevant signals for graph-based document classification tasks). In this study, we propose a novel data-driven SSGRL approach that automatically learns a suitable graph augmentation from the signal encoded in the graph (i.e., the nodes’ predictive feature and topological information). We propose two complementary approaches that produce learnable feature and topological augmentations. The former learns multi-view augmentation of node features, and the latter learns a high-order view of the topology. Moreover, the augmentations are jointly learned with the representation. Our approach is general that it can be applied to homogeneous and heterogeneous graphs. We perform extensive experiments on node classification (using nine homogeneous and heterogeneous datasets) and graph property prediction (using another eight datasets). The results show that the proposed method matches or outperforms the SOTA SSGRL baselines and performs similarly to semi-supervised methods. The anonymised source code is available at https://github.com/AhmedESamy/dsgrl/

Стилі APA, Harvard, Vancouver, ISO та ін.

"A property of the number six." In Designs, Graphs, Codes and their Links, 81–90. Cambridge University Press, 1991. http://dx.doi.org/10.1017/cbo9780511623714.008.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Beynier, Aurélie, Jean-Guy Mailly, Nicolas Maudet, and Anaëlle Wilczynski. "Explaining the Lack of Locally Envy-Free Allocations." In Frontiers in Artificial Intelligence and Applications. IOS Press, 2024. http://dx.doi.org/10.3233/faia240900.

Повний текст джерела

Анотація:

In fair division, local envy-freeness is a desirable property which has been thoroughly studied in recent years. In this paper, we study explanations which can be given to explain that no allocation of items can satisfy this criterion, in the house allocation setting where agents receive a single item. While Minimal Unsatisfiable Subsets (MUSes) are key concepts to extract explanations, they cannot be used as such: (i) they highly depend on the initial encoding of the problem; (ii) they are flat structures which fall short of capturing the dynamics of explanations; (iii) they typically come in large number and exhibit great diversity. In this paper we provide two SAT encodings of the problem which allow us to extract MUS when instances are unsatisfiable. We build a dynamic graph structure which allows to follow step-by-step the explanation. Finally, we propose several criteria to select MUSes, some of them being based on the MUS structure, while others rely on this original graphical explanation structure. We give theoretical bounds on these metrics, showing that they can vary significantly for some instances. Experimental results on synthetic data complement these results and illustrate the impact of the encodings and the relevance of our metrics to select among the many MUSes.

Стилі APA, Harvard, Vancouver, ISO та ін.

Franses, Philip Hans. "Periodic Autoregressive Time Series Models." In Periodicity and Stochastic Trends In Economic Time Series, 92–125. Oxford University PressOxford, 1996. http://dx.doi.org/10.1093/oso/9780198774532.003.0007.

Повний текст джерела

Анотація:

Abstract In this chapter I consider periodic autoregressive models for univariate and multivariate time series processes. A periodic autoregression (PAR) extends a nonperiodic AR model by allowing the autoregressive parameters to vary with the seasons. In other words, the PAR model assumes that the observations in each of the seasons can be described using a different model. Such a property may be useful to describe some economic time series, since in several economic situations one may expect that economic agents behave differently in different seasons. This may lead to a belief that the memory structure (which can be reflected by autoregressive components) can vary with the season. For ex ample, technological advances throughout the years have now made it possible to buy certain vegetables in almost all seasons, whereas these products were available in, say, only the summer season several years ago; hence one may observe an increasing trend in the consumption of these vegetables in one or more seasons and no trend in the summer season (see e.g. the graphs in Kuiper, et al. 1993). As another example, some recent tax measures which became effective in the first part of the year may lead to seasonal variation in inflation: as a result, economic agents may come increasingly to anticipate this inflation peak. Yet another example is that. as a result of increasing personal disposable income and increasing leisure time in developed countries, consumer spending on holidays has changed over the years. Gersovitz and MacKinnon (1978), Osborn(] 988), and Todd (1990) give more concrete economic examples which concern seasonally varying utility functions and optimization schemes.

Стилі APA, Harvard, Vancouver, ISO та ін.

Dalton, David R. "General Comments." In The Chemistry of Wine. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780190687199.003.0026.

Повний текст джерела

Анотація:

Viticulture, it will be recalled, is the art and science of vine-growing and grape-harvesting, and it was the subject of Sections I–IV (Chapters 1–14). Enology, the subject of this Section (Chapters 15– 20), is the art and science of winemaking. Much of what follows in this brief Chapter on General Comments is expanded upon in other Chapters in this Section. In making the wine, it appears to be generally agreed that where possible it is best to follow the traditional methods to produce the best results. However, it should be clearly understood that work is underway to engineer yeast to make it more alcohol tolerant and to use the yeast to produce specific compounds recognized as being particularly flavorful. Additionally, as the number of vintners has grown, finding the proper oak for casks is becoming ever harder. Therefore, the art of reworking old oak casks or even avoiding them altogether (e.g., by aging wine in the presence of oak chips) may be used. In the same vein, it is widely recognized that stoppers other than cork may be used, so that the day may come when the cork stopper will be a thing of the past. Traditionally, grapes are taken directly from the vineyard to be crushed, and it is still the case in many of the oldest and most respected vineyards that this practice will continue. However, as the use of pesticides and fungicides has increased, methods for rapid washing and then drying of grapes before crushing may be employed. The arguments against these extra steps are mainly two. First, lingering water would dilute the grape juice. Second, the adventitious yeasts that might be removed by washing or deactivated by drying are often desired for the production of the vintage. Indeed, it has been argued that unique fungi, which might be exclusive to the most prestigious vineyards, are important to the production of the best wines. The issue of washing versus not washing has been investigated, and it was concluded for the case examined that only minor changes are effected by washing.

Стилі APA, Harvard, Vancouver, ISO та ін.

Greenlaw, Raymond, H. James Hoover, and Walter L. Ruzzo. "P-Complete Algorithms." In Limits to Parallel Computation. Oxford University Press, 1995. http://dx.doi.org/10.1093/oso/9780195085914.003.0012.

Повний текст джерела

Анотація:

Our focus up to this point has been primarily on problems — either decision, search, or function. In this chapter we shift directions and apply P-completeness theory to the study of algorithms. The theory when extended properly will allow us to make statements about whether or not certain sequential algorithms will parallelize well. The phrase "inherently sequential algorithm" is one that appears frequently in the research literature. The general intent of the phrase is obvious. However, if pressed for details one might come up with several different possible formal meanings. In this chapter we describe one approach that gives the phrase a precise interpretation. The work on P-complete algorithms began with Anderson [12] and was continued by Greenlaw [133, 135]. Much of the discussion contained in this chapter is taken from these references. That a problem is P-complete is evidence it is unlikely to have small space sequential solutions, or unlikely to have fast parallel solutions using a polynomial amount of hardware. Of course, being P-complete also means that the problem does have a polynomial time algorithm. For many P-complete decision problems, this algorithm appears explicitly or implicitly in the statement of the problem. For example, asking whether a vertex is in the lexicographically first maximal clique is essentially asking whether the vertex is in the maximal clique found by the obvious greedy algorithm — the same greedy algorithm that shows the problem is in P. This specification of a particular polynomial time algorithm in addition to the nonalgorithmic properties desired of a solution occurs in most of the search problems in Section A.3, many of the problems of a greedy or lexicographically first nature, and numerous graph problems in Section A.2. These P-completeness results say more about the difficulty of parallelizing the associated sequential algorithm than they do about the intrinsic difficulty of the decision problem. In many cases the particular sequential algorithm does not seem to adapt well to parallelism. Yet it may be the case that a modified version of the problem that avoids mentioning a sequential algorithm does have a highly parallel solution.

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Code property graph"

Xiaomeng, Wang, Zhang Tao, Wu Runpu, Xin Wei, and Hou Changyu. "CPGVA: Code Property Graph based Vulnerability Analysis by Deep Learning." In 2018 10th International Conference on Advanced Infocomm Technology (ICAIT). IEEE, 2018. http://dx.doi.org/10.1109/icait.2018.8686548.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Zhu, Chenguang, Tongshuai Wu, Ningning Cui, Xiong Zheng, Liwei Chen, and Gang Shi. "Code Property Graph based Vulnerability Type Identification with Fusion Representation." In 2023 26th International Conference on Computer Supported Cooperative Work in Design (CSCWD). IEEE, 2023. http://dx.doi.org/10.1109/cscwd57460.2023.10152662.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Felix, Juliana P., and Márcia R. Cappelle. "Bounds on Identifying Codes in the Cartesian Product of a Star and a Path Graph." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2023. http://dx.doi.org/10.5753/etc.2023.230607.

Повний текст джерела

Анотація:

In a graph, an identifying code (or ID code, for short) is a dominating set with the property that the closed neighborhood of each vertex in the graph has a distinct intersection with the set. Thus every vertex can be uniquely identified by this intersection. The ID code number of a graph G is the minimum cardinality of an ID code of G and is denoted by γID(G). We present lower and upper bounds for γID in the Cartesian product of star and path graphs.

Стилі APA, Harvard, Vancouver, ISO та ін.

Haojie, Zhang, Li Yujun, Liu Yiwei, and Zhou Nanxin. "Vulmg: A Static Detection Solution For Source Code Vulnerabilities Based On Code Property Graph and Graph Attention Network." In 2021 18th International Computer Conference on Wavelet Active Media Technology and Information Processing (ICCWAMTIP). IEEE, 2021. http://dx.doi.org/10.1109/iccwamtip53232.2021.9674145.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Banse, Christian, Immanuel Kunz, Angelika Schneider, and Konrad Weiss. "Cloud Property Graph: Connecting Cloud Security Assessments with Static Code Analysis." In 2021 IEEE 14th International Conference on Cloud Computing (CLOUD). IEEE, 2021. http://dx.doi.org/10.1109/cloud53861.2021.00014.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Li, Xiaoyu, Jingzheng Wu, Xiang Ling, Tianyue Luo, and Yanjun Wu. "Automatic Program Repair via Learning Edits on Sequence Code Property Graph." In 2023 IEEE 29th International Conference on Parallel and Distributed Systems (ICPADS). IEEE, 2023. http://dx.doi.org/10.1109/icpads60453.2023.00089.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Deaton, Sean. "What Makefile? Detecting Compiler Information Without Source Using The Code Property Graph." In 2022 IEEE 4th International Conference on Trust, Privacy and Security in Intelligent Systems, and Applications (TPS-ISA). IEEE, 2022. http://dx.doi.org/10.1109/tps-isa56441.2022.00039.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Du, Gewangzi, Liwei Chen, Tongshuai Wu, Xiong Zheng, and Gang Shi. "Code Property Graph based Cross-Domain Vulnerability Detection via Deep Fused Feature." In 2024 IEEE International Symposium on Circuits and Systems (ISCAS). IEEE, 2024. http://dx.doi.org/10.1109/iscas58744.2024.10558497.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Shezan, Faysal Hossain, Zihao Su, Mingqing Kang, Nicholas Phair, Patrick William Thomas, Michelangelo van Dam, Yinzhi Cao, and Yuan Tian. "CHKPLUG: Checking GDPR Compliance of WordPress Plugins via Cross-language Code Property Graph." In Network and Distributed System Security Symposium. Reston, VA: Internet Society, 2023. http://dx.doi.org/10.14722/ndss.2023.24610.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Cui, Di, Qiangqiang Wang, Siqi Wang, Jianlei Chi, Jianan Li, Lu Wang, and Qingshan Li. "REMS: Recommending Extract Method Refactoring Opportunities via Multi-view Representation of Code Property Graph." In 2023 IEEE/ACM 31st International Conference on Program Comprehension (ICPC). IEEE, 2023. http://dx.doi.org/10.1109/icpc58990.2023.00034.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Code property graph"

Zhai, Liangliang, and Xuanlong Ma. Perfect Codes in Proper Order Divisor Graphs of Finite Groups. "Prof. Marin Drinov" Publishing House of Bulgarian Academy of Sciences, December 2020. http://dx.doi.org/10.7546/crabs.2020.12.04.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Financial Stability Report - Second Semester of 2020. Banco de la República de Colombia, March 2021. http://dx.doi.org/10.32468/rept-estab-fin.sem2.eng-2020.

Повний текст джерела

Анотація:

The Colombian financial system has not suffered major structural disruptions during these months of deep economic contraction and has continued to carry out its basic functions as usual, thus facilitating the economy's response to extreme conditions. This is the result of the soundness of financial institutions at the beginning of the crisis, which was reflected in high liquidity and capital adequacy indicators as well as in the timely response of various authorities. Banco de la República lowered its policy interest rates 250 points to 1.75%, the lowest level since the creation of the new independent bank in 1991, and provided ample temporary and permanent liquidity in both pesos and foreign currency. The Office of the Financial Superintendent of Colombia, in turn, adopted prudential measures to facilitate changes in the conditions for loans in effect and temporary rules for rating and loan-loss provisions. Finally, the national government expanded the transfers as well as the guaranteed credit programs for the economy. The supply of real credit (i.e. discounting inflation) in the economy is 4% higher today than it was 12 months ago with especially marked growth in the housing (5.6%) and commercial (4.7%) loan portfolios (2.3% in consumer and -0.1% in microloans), but there have been significant changes over time. During the first few months of the quarantine, firms increased their demands for liquidity sharply while consumers reduced theirs. Since then, the growth of credit to firms has tended to slow down, while consumer and housing credit has grown. The financial system has responded satisfactorily to the changes in the respective demands of each group or sector and loans may grow at high rates in 2021 if GDP grows at rates close to 4.6% as the technical staff at the Bank expects; but the forecasts are highly uncertain. After the strict quarantine implemented by authorities in Colombia, the turmoil seen in March and early April, which was evident in the sudden reddening of macroeconomic variables on the risk heatmap in Graph A,[1] and the drop in crude oil and coal prices (note the high volatility registered in market risk for the region on Graph A) the local financial markets stabilized relatively quickly. Banco de la República’s credible and sustained policy response played a decisive role in this stabilization in terms of liquidity provision through a sharp expansion of repo operations (and changes in amounts, terms, counterparties, and eligible instruments), the purchases of public and private debt, and the reduction in bank reserve requirements. In this respect, there is now abundant aggregate liquidity and significant improvements in the liquidity position of investment funds. In this context, the main vulnerability factor for financial stability in the short term is still the high degree of uncertainty surrounding loan quality. First, the future trajectory of the number of people infected and deceased by the virus and the possible need for additional health measures is uncertain. For that reason, there is also uncertainty about the path for economic recovery in the short and medium term. Second, the degree to which the current shock will be reflected in loan quality once the risk materializes in banks’ financial statements is uncertain. For the time being, the credit risk heatmap (Graph B) indicates that non-performing and risky loans have not shown major deterioration, but past experience indicates that periods of sharp economic slowdown eventually tend to coincide with rises in non-performing loans: the calculations included in this report suggest that the impact of the recession on credit quality could be significant in the short term. This is particularly worrying since the profitability of credit establishments has been declining in recent months, and this could affect their ability to provide credit to the real sector of the economy. In order to adopt a forward-looking approach to this vulnerability, this Report presents several stress tests that evaluate the resilience of the liquidity and capital adequacy of credit institutions and investment funds in the event of a hypothetical scenario that seeks to simulate an extreme version of current macroeconomic conditions. The results suggest that even though there could be strong impacts on the credit institutions’ volume of credit and profitability under such scenarios, aggregate indicators of total and core capital adequacy will probably remain at levels that are above the regulatory limits over the horizon of a year. At the same time, the exercises highlight the high capacity of the system's liquidity to face adverse scenarios. In compliance with its constitutional objectives and in coordination with the financial system's security network, Banco de la República will continue to closely monitor the outlook for financial stability at this juncture and will make the decisions that are necessary to ensure the proper functioning of the economy, facilitate the flow of sufficient credit and liquidity resources, and further the smooth operation of the payment systems. Juan José Echavarría Governor

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!