Commun. Inf. Syst.最新文献

{"title":"Network Error Correction, II: Lower Bounds","authors":"N. Cai, R. Yeung","doi":"10.4310/CIS.2006.V6.N1.A3","DOIUrl":"https://doi.org/10.4310/CIS.2006.V6.N1.A3","url":null,"abstract":"","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116928289","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Finding minimal and maximal sets of spatial relationships in pictorial retrieval systems","authors":"Qing-Long Zhang, S. Yau","doi":"10.4310/CIS.2005.V5.N3.A3","DOIUrl":"https://doi.org/10.4310/CIS.2005.V5.N3.A3","url":null,"abstract":"Spatial reasoning is an important component in pictorial retrieval systems. There are two approaches to handling spatial relationships: the well-known one is to use algorithms on which most earlier work such as (13, 17, 21) is based, and the recent one (30) is to construct deductive rules that allow spatial relationships to be deduced. Sistla et al. (30) developed a system of rules R on reasoning about basic spatial relationships that are of common interest in pictorial databases. In this paper, we consider the following two problems with that system of rules R: the deduction problem (that is, to deduce new spatial relationships from a given set F of spatial relationships) and the reduction problem (that is, to eliminate redundant spatial relationships from F. We use the mathematically simple matrix representation approach to show that these two prob- lems can be solved by efficient (i.e., polynomial-time) algorithms. The time required by both of them is at most a constant multiple of the time to compute the transitive reduction of a directed graph with n vertices or to compute the transitive closure of a directed graph with n vertices or to perform n × n Boolean matrix multiplication, and thus is always bounded by time complexity O(n 3 ) (and space complexity O(n 2 )), where n is the number of all involved objects.","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116982391","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Properties of the graph topology for scalar transfer functions","authors":"T. Brinsmead, B. Anderson","doi":"10.4310/CIS.2002.V2.N3.A1","DOIUrl":"https://doi.org/10.4310/CIS.2002.V2.N3.A1","url":null,"abstract":"Necessary and sucient conditions for the existence of a scalar homotopy in the Vinnicombe metric between two given transfer functions are presented. Previous results show that for multivariable transfer functions, the existence of a homotopy is related to a winding number con- dition on the homotopy end-points. Here, it is shown that for scalar transfer functions the existence of a homotopy is also related to a Cauchy index condition. Extensive use is made of the relationship, previously noted by Brockett, between the Cauchy index of a real function and the argument of a particular related complex function.","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116037698","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Natural Resolution of Ill-Posedness of Inverse Kinematics for Redundant Robots Under Constraints","authors":"S. Arimoto, J. Bae, H. Hashiguchi, R. Ozawa","doi":"10.4310/CIS.2004.V4.N1.A1","DOIUrl":"https://doi.org/10.4310/CIS.2004.V4.N1.A1","url":null,"abstract":"In order to enhance dexterity in execution of robot tasks, a redundant number of degrees-of-freedom (DOF) is adopted for design of robotic mechanisms like robot arms and multi- fingered robot hands. Associated with such redundancy in DOFs relative to the number of physical variables necessary and sufficient for description of a given task, an extra performance index is in- troduced for controlling such a redundant robot in order to avoid arising of ill-posedness of inverse kinematics from the task space to the joint space. This paper shows that such an ill-posedness prob- lem of DOF redundancy can be resolved in a natural way on the basis of construction of sensory feedback signals from the task space and a novel concept named \"stability on a manifold\". To show this, two illustrative robot tasks are analyzed in details, which are 1) posture control of an object via rolling contact by a redundant multi-DOF finger and 2) stable pinching and object manipulation by a pair of multi-DOF robot fingers.","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"28 5 Suppl 16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123438023","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"On the transport capacity of a broadcast Gaussian channel","authors":"A. Reznik, S. Verdú","doi":"10.4310/CIS.2002.V2.N2.A5","DOIUrl":"https://doi.org/10.4310/CIS.2002.V2.N2.A5","url":null,"abstract":"The main question addressed in this paper is the problem of maximizing the \"trans- port capacity\" of a broadcast network in a Gaussian power-law channel, where by transport capacity we mean a generalization of the bandwidth-distance product as a means of assigning value to the information delivered by a communication network. This problem arises in areas such as cellular network coverage and ad-hoc network design, where the distance or area covered by a transmission is a critical consideration in the system design process. In the process of addressing this issue we also derive a transport-capacity maximizing resource allocation scheme for a general set of reward and channel penalty functions. The behavior of transport capacity for a very large network of receivers in a Gaussian power-law channel is also examined and a \"large-scale\" view of the optimal power allocation scheme for a given distance-payo function is provided. 1. Introduction and Problem Setup. In this paper we consider and general- ize the notion of transport capacity of a single-transmitter ad-hoc network. Transport capacity was originally defined in the work of Gupta and Kumar (5),(6) as the total bandwidth-distance product that a communication network is capable of supporting in a given area. In this paper we generalize this definition of the transport capacity to include more general payo functions and consider the resulting \"transport capacity\"","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123566694","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An approach to physical layer security in MIMO wireless via vector perturbation precoding","authors":"Liutong Du, Lihua Li, A. Paulraj","doi":"10.4310/cis.2020.v20.n2.a2","DOIUrl":"https://doi.org/10.4310/cis.2020.v20.n2.a2","url":null,"abstract":"","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122106665","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Hawkes processes: some key ideas, links to neuroscience and system identification","authors":"L. Gerencsér, György Perczel, L. Eröss, D. Fabó, Z. Vágó","doi":"10.4310/CIS.2021.V21.N3.A4","DOIUrl":"https://doi.org/10.4310/CIS.2021.V21.N3.A4","url":null,"abstract":"","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116905915","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Equidistant Rank Metric Codes: Construction and Properties","authors":"Jejaw Demamu, R. Selvaraj","doi":"10.4310/CIS.2010.V10.N3.A3","DOIUrl":"https://doi.org/10.4310/CIS.2010.V10.N3.A3","url":null,"abstract":"Abstract. This paper introduces a new construction for q-ary equidistant code C with rank metric where q is a power of 2. Investigations on structural properties of the proposed code are carried out. The highlight of the paper is that the kernel of the code C happens to be an equidistant constant-weight code of same size as C and is shown to be C+ C. The bounds on number of steps that are required to construct the equidistant code are also given. Moreover, our construction is independent of the choice of metric, though our investigation mainly focuses about rank metric.","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128594860","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A \"Small World\" Approach to Heterogeneous Networks","authors":"S. Kulkarni, A. Reznik, S. Verdú","doi":"10.4310/CIS.2003.V3.N4.A6","DOIUrl":"https://doi.org/10.4310/CIS.2003.V3.N4.A6","url":null,"abstract":"We consider a heterogeneous (also called \"hybrid\") ad-hoc network with wired and wireless links. This type of network was previously considered by Kulkarni and Viswanath in (9) where achievable transport capacity growth rates were demonstrated for a structured wired infrastructure. The present paper improves on this work by demonstrating that efficiency can be increased significantly if the wired links are introduced at random. 1. Introduction. In this paper we consider the effect of adding a wired in- frastructure to an unstructured (ad-hoc) wireless network. The impact of such a modification on the original wireless network can be tremendous. Unlike the wireless channel, which suffers both from interference issues as well as from path loss over large distances, the wired infrastructure can provide low-cost transport of a signifi- cant amount of data over large distances without interference with other simultaneous communications. However, the existence of such an infrastructure often carries a sig- nificant cost in and of itself. Thus, in particular, one would like to use as little wired infrastructure as necessary. A systematic study of scaling laws in ad-hoc wireless networks has been initiated in the work of Gupta, Kumar and Xie (6),(21) and (5). In particular, Xie and Kumar showed that for a large range of path loss models the transport capacity (the distance - bandwidth product) of a purely wireless network scales no better than Θ( √ n )w hen the network size is fixed. Furthermore, Gupta and Kumar demonstrated how such scaling laws are achievable for all path loss models using an interference-avoiding communication sp rotocol. The recent work by Kulkarni and Viswanath (10) gives a simple deterministic protocol that achieves the scaling laws of Gupta and Kumar (6) eliminating much of the complexity of the original routing protocol. The protocol in (10) is based on the related problem of packet routing on a square grid of parallel processors (7),(11). The protocol is straightforward and deterministic and thus provides a natural starting point to include a wired infrastructure into the ad-hoc wireless network. The reference","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"218 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128638851","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Prediction of molecular energy using deep tensor neural networks","authors":"Yan Li, Guohui Li, Hanyi Min, Zibing Dong, Tian Yuan, Xiaoqi Li, P. Xu","doi":"10.4310/CIS.2018.V18.N4.A2","DOIUrl":"https://doi.org/10.4310/CIS.2018.V18.N4.A2","url":null,"abstract":"In this paper, we propose a combined scheme called Quantum Mechanics and Deep Tensor Neural Network (QM-DTNN) to address the challenges related to the prompt and accurate calculation of the physicochemical properties of a protein. In QM-DTNN, a protein is decomposed into individual amino acid units that are treated with molecular caps. The physicochemical properties (molecular energy) of amino acid units are predicted using DTNNs, which are trained by QM ( ab Initio ) data. The training, validating, and testing data sets are made of conformations drawn through enhanced sampling in specific collective variable spaces. The inputs of DTNNs include pair-wise inter-distance and nuclear charges of an amino acid unit. The outputs of DTNNs, which are the physicochemical properties of amino acid units, are calculated using QM. The three typical amino acid units (i.e., Arginine, Lysine, and Tryptophan) are used to demonstrate the feasibility of QM-DTNN. The prediction results demonstrated good correlations to QM data. The proposed scheme reduces the computational time considerably compared to that of QM calculation with acceptable precision loss.","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128973762","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}