Filters








310,401 Hits in 4.9 sec

Suffixes of addressable data graphs

Arnold L. Rosenberg
1973 Information and Control  
For addressable data graphs, addressing schemes yield a useful alternative definition of suffix, which also suggests a generalized version of suffix.  ...  Thus a suffix can be viewed as a highly structured type of substructure of a data graph. Necessary and sufficient conditions for a suffix of an addressable data graph to be addressable are derived.  ...  An addressing scheme for the data graph F = (C, A) is a total function a : C -+ A T such that /" is addressable if it admits an addressing scheme.  ... 
doi:10.1016/s0019-9958(73)90619-0 fatcat:kietkt5ap5hybmgkzlf6z5a5h4

An extrinsic characterization of addressable data graphs

Arnold L. Rosenberg
1974 Discrete Mathematics  
addressing scheme.  ...  Theorem 3.1.1. fir is an addressable data graph, then rCJ is a transitive monoid system. Proof. Say that r = (C, A) admits the addressing scheme a.  ... 
doi:10.1016/0012-365x(74)90071-5 fatcat:jmmmz4ccqjcvlbtompqowz5r34

Data graphs and addressing schemes

Arnold L. Rosenberg
1971 Journal of computer and system sciences (Print)  
This paper presents a model for data graphs which can be used to study such uniformities.  ...  The main results reported algebraically characterize, in terms of structural uniformities, those classes of data graphs which can be implemented by "relative addressing" and by "relocatable realizations  ...  Winograd for insightful criticisms of the manuscript.  ... 
doi:10.1016/s0022-0000(71)80034-x fatcat:x3q3bid255gfhjglcmcja6omnu

An Efficient FFT Engine With Reduced Addressing Logic

Xin Xiao, Erdal Oruklu, Jafar Saniie
2008 IEEE Transactions on Circuits and Systems - II - Express Briefs  
A general methodology for radix-2 -point transforms is derived and the signal flow graph for a 16-point FFT is presented.  ...  In this study, an improved butterfly structure and an address generation method for fast Fourier transform (FFT) are presented.  ...  In order to reduce the delay of the address generation, Ma [9] proposed an alternative addressing scheme that avoids using parity check. The signal flow graph of Ma's scheme is shown in Fig. 4 .  ... 
doi:10.1109/tcsii.2008.2004540 fatcat:imwor2qz7fa7he7ngnwhrj3hd4

An efficient code update scheme for DSP applications in mobile embedded systems

Weijia Li, Youtao Zhang
2010 Proceedings of the ACM SIGPLAN/SIGBED 2010 conference on Languages, compilers, and tools for embedded systems - LCTES '10  
DSP processors usually provide dedicated address generation units (AGUs) to assist address computation.  ...  In this paper, we propose an update-conscious code update scheme to effectively reduce patch size.  ...  The authors thank anonymous reviewers for their constructive comments.The authors thank Dr. Jiang Zheng for the early discussion of the idea, and anonymous reviewers for their constructive comments.  ... 
doi:10.1145/1755888.1755904 dblp:conf/lctrts/LiZ10 fatcat:6j4ew2hl7rg3nczjtrttoxvtzm

An efficient code update scheme for DSP applications in mobile embedded systems

Weijia Li, Youtao Zhang
2010 SIGPLAN notices  
DSP processors usually provide dedicated address generation units (AGUs) to assist address computation.  ...  In this paper, we propose an update-conscious code update scheme to effectively reduce patch size.  ...  The authors thank anonymous reviewers for their constructive comments.The authors thank Dr. Jiang Zheng for the early discussion of the idea, and anonymous reviewers for their constructive comments.  ... 
doi:10.1145/1755951.1755904 fatcat:zjly5arefbg7bnyrdcjfxhznxa

Compact and localized distributed data structures

Cyril Gavoille, David Peleg
2003 Distributed computing  
, focusing on compact localized schemes for message routing in communication networks.  ...  This survey concerns the role of data structures for compactly storing and representing various types of information in a localized and distributed fashion.  ...  This implies a (2 log n, 0)-approximate scheme with O(log 2 n) bit labels for general unweighted graphs.  ... 
doi:10.1007/s00446-002-0073-5 fatcat:bqydpls23ncnnm57nnhmctnz3m

Performance of mobile IPv6 with different route optimization scheme

Manoj Mathur, Sunita Malik, Prince Arora
2012 International Journal of Smart Sensor and Adhoc Network.  
Packet delivery fraction (PDF) is the ratio of the data packets delivered to the destinations to those generated by the CBR sources.  ...  Round-trip time is the time required for a signal pulse or packet to travel from a specific source to a specific destination and back again.  ...  Correspondent Binding Update message include the MN1's address, the MN2's address and the MAG1's address information The MAG2 sends Corresponding Binding Acknowledgment (CBA) message to the MAG1 for Corresponding  ... 
doi:10.47893/ijssan.2012.1075 fatcat:2dr3v6ejkzahjkgssfjiqh6zq4

Visualizing big network traffic data using frequent pattern mining and hypergraphs

Eduard Glatz, Stelios Mavromatidis, Bernhard Ager, Xenofontas Dimitropoulos
2013 Computing  
schemes based on parallelcoordinate plots or graphs.  ...  Communication logs, however, can be massive, which necessitates designing effective visualization techniques for large data sets.  ...  Next, we describe the modular architecture of our software and point out the generality of our scheme. Our software creates graphs from transaction data in five distinct steps.  ... 
doi:10.1007/s00607-013-0282-8 fatcat:rf6hb5owpvb57eooecdfd2lhne

Privacy-Guarding Optimal Route Finding with Support for Semantic Search on Encrypted Graph in Cloud Computing Scenario

Bin Wu, Xianyi Chen, Zongda Wu, Zhiqiang Zhao, Zhuolin Mei, Caicai Zhang, Jun Cai
2021 Wireless Communications and Mobile Computing  
Due to encrypting the outsourcing graph data before they are sent to CCP, it is not easy for data customers to manipulate and further use the encrypted graph data.  ...  We give formal security analysis for our scheme. We also analyze the efficiency of our scheme through the experimental evaluation.  ...  For the encrypted graph query, we need to encrypt the graph data and build the encrypted index. As a result, the time of index generation is more than that on the plaintext graph.  ... 
doi:10.1155/2021/6617959 fatcat:bgt72mdc5vbdfowzp37v5hczim

Energy efficient address assignment through minimized memory row switching

Sambuddhi Hettiaratchi, Peter Y. K. Cheung, Thomas J. W. Clarke
2002 Computer-Aided Design (ICCAD), IEEE International Conference on  
The problem of energy efficient address assignment has been formulated as a multi-way graph partitioning problem and solved with a heuristic.  ...  spatially and temporally local data items to the same row.  ...  We could simply sequentially assign row and column addresses to mapped data variables. However, this sequential assignment could be further optimized for a given address generator architecture.  ... 
doi:10.1145/774572.774657 dblp:conf/iccad/HettiaratchiCC02 fatcat:kmh2bmfmrfcevm6kbijdk37sxa

Page 1523 of Mathematical Reviews Vol. 43, Issue 6 [page]

1972 Mathematical Reviews  
Mordvek (Prague) Rosenberg, Arnold L. 8457 Data graphs and addressing schemes. J. Comput. System Sci. 5 (1971), 193-238.  ...  But Tellegen was the first to appreciate its generality and research value.  ... 

A Flexible Approach to Intrusion Alert Anonymization and Correlation

Dingbang Xu, Peng Ning
2006 2006 Securecomm and Workshops  
In Scheme I, we generate artificial alerts and mix them with original alerts to help hide original attribute values.  ...  Intrusion alert data sets are critical for security research such as alert correlation.  ...  Acknowledgment The authors would like to thank the anonymous reviewers for their valuable comments.  ... 
doi:10.1109/seccomw.2006.359544 dblp:conf/securecomm/XuN06 fatcat:m45uqyslrbbvnj4byejdys455i

Refining Evidence Containers for Provenance and Accurate Data Representation [chapter]

Bradley Schatz, Michael Cohen
2010 IFIP Advances in Information and Communication Technology  
This paper describes refinements to the representation schemes embodied in AFF4 that address the accurate representation of discontiguous data and the description of the provenance of data and information  ...  It is well acknowledged that there is a pressing need for a general solution to the problem of storing digital evidence, both in terms of copied bitstream images and general information that describes  ...  Data Content: Multiple streams (HPA, DCO); hierarchical data relationships (logical imaging); addressing windows (RAM holes, bad sectors); addressing schemes (block size, CHS/LBA); SMART status.  ... 
doi:10.1007/978-3-642-15506-2_16 fatcat:cr73rgmkcfhuxgojprajf7q5he

On the Memory Requirement of Hop-by-Hop Routing: Tight Bounds and Optimal Address Spaces

Attila Korosi, Andras Gulyas, Zalan Heszberger, Jozsef Biro, Gabor Retvari
2020 IEEE/ACM Transactions on Networking  
We derive tight space bounds for many well-known graph families and we propose a simple heuristic to find optimal address spaces for general graphs.  ...  address spaces.  ...  Heuristics on General Graphs Next, we discuss optimal address space design for general graphs under the name dependent model.  ... 
doi:10.1109/tnet.2020.2984761 fatcat:jqo5bqnfezaf7mjncesn56ddfe
« Previous Showing results 1 — 15 out of 310,401 results