Commun. Inf. Syst.最新文献

筛选
英文 中文
Interactive mesh cutting with Laplace coordinates and gradient 基于拉普拉斯坐标和梯度的交互式网格切割
Commun. Inf. Syst. Pub Date : 1900-01-01 DOI: 10.4310/CIS.2017.V17.N2.A1
Bin Liu, Weiming M. Wang, Junjie Cao, Xiuping Liu
{"title":"Interactive mesh cutting with Laplace coordinates and gradient","authors":"Bin Liu, Weiming M. Wang, Junjie Cao, Xiuping Liu","doi":"10.4310/CIS.2017.V17.N2.A1","DOIUrl":"https://doi.org/10.4310/CIS.2017.V17.N2.A1","url":null,"abstract":"Sketch-based mesh cutting has been attended by researchers in Computer Graphics, mainly due to its success in dealing with semantic information of mesh with little user interaction. Although most existing approaches have gained great improvement, they depend on the predefined geometric features sensitive to shape and complex mathematical theory, and most methods can not generate a global unique solution for the segmentation problem. In this paper, we propose a novel sketch-based mesh segmentation model with Laplace Coordinates and gradient, which is independent of the complex geometric features and could perceive the differences of mesh parts. Furthermore, our algorithm is easy to implement, mathematically simple, and a global unique solution can be guaranteed because of our convex quadratic model. Benefiting from the Laplace Coordinates and gradient, our method holds an anisotropic behavior and can better fit the cutting boundary. Namely, triangular faces sharing similar attributes are kept closer to each other while big jumps naturally happen on the boundary between mesh parts when our method is applied. A large number of experiments illustrate the enhanced efficacy of our method compared with the state-of-the-art techniques.","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"17 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":"129118764","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}
引用次数: 1
Switched systems as models for dynamic clinical trials 切换系统作为动态临床试验的模型
Commun. Inf. Syst. Pub Date : 1900-01-01 DOI: 10.4310/CIS.2015.V15.N1.A3
Yining Du, C. Martin
{"title":"Switched systems as models for dynamic clinical trials","authors":"Yining Du, C. Martin","doi":"10.4310/CIS.2015.V15.N1.A3","DOIUrl":"https://doi.org/10.4310/CIS.2015.V15.N1.A3","url":null,"abstract":"The goal of the paper is to make a case for the use of switched systems as a model for the simulation of dynamic clinical trials. Dynamic clinical trials are characterized by the use of different treatments based on the response of a patient to the current treatment. We show that switched systems are, in fact, a suitable model for these trials.","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"14 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":"126944760","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}
引用次数: 1
State and event estimation for regime-switching systems under irregular and random sampling schemes 不规则和随机抽样下状态切换系统的状态和事件估计
Commun. Inf. Syst. Pub Date : 1900-01-01 DOI: 10.4310/CIS.2012.V12.N1.A2
W. Feng, L. Wang
{"title":"State and event estimation for regime-switching systems under irregular and random sampling schemes","authors":"W. Feng, L. Wang","doi":"10.4310/CIS.2012.V12.N1.A2","DOIUrl":"https://doi.org/10.4310/CIS.2012.V12.N1.A2","url":null,"abstract":"Estimation of states and events in randomly switching systems is studied under irregular and random sampling schemes. Probabilistic characterization of observability is presented under various sampling schemes and regime-switching processes. The characterization is derived on the basis of our recent results on sampling complexity for system observability. Observer design and algorithms are developed. 1. Introduction. This paper investigates estimation of states and events in ran- domly switching systems under various sampling schemes. The problems are typically studied under the names of regime-switching systems, hybrid systems, discrete-event systems, etc. Typically, such systems involve communication channels whose power and bandwidth limitations make it desirable to reduce resource consumption in sam- pling and quantization. It was shown in (29, 30) that traditional periodic sampling is inefficient in utility of such resources. More efficient sampling/quantiz ation schemes introduced in (29, 30) lead naturally to irregular sampling (also known as non-uniform or non-periodic sampling). Irregular and random sampling may occur also due to event triggered sampling (3, 22) or communication uncertainty and interruptions (9). When a system switches its dynamics, it introduces an event which is itself a dy- namic process whose state space is a finite set and its state also needs to be estimated. State estimation of linear dynamic systems is a traditional topic that has been well studied (14). Independently, observability of events has been studied extensively in discrete event systems (15, 18). References (25, 26) contain more recent studies on observability of sampled systems. Joint identification of states and events has been studied in hybrid systems (20, 25). Studies on fundamental properties of non-uniform sampling remain an active area of research, see (6) and the references therein for some recent work in this area. Some related results on identification, state estimation, and fault detection using binary or quantized outputs can be found in (13, 26, 31, 32, 35). This paper studies some fundamental issues in joint estimation of states and events when the events are stochastic processes. The main issues are: What are the conditions for observability? How many sampling points are needed to ensure","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"8 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132477866","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}
引用次数: 0
Throughput of Q-Ary Splitting Algorithms for Contention Resolution in Communication Networks 通信网络中用于争用解决的Q-Ary分割算法的吞吐量
Commun. Inf. Syst. Pub Date : 1900-01-01 DOI: 10.4310/CIS.2004.V4.N2.A2
C. Blondia, B. V. Houdt
{"title":"Throughput of Q-Ary Splitting Algorithms for Contention Resolution in Communication Networks","authors":"C. Blondia, B. V. Houdt","doi":"10.4310/CIS.2004.V4.N2.A2","DOIUrl":"https://doi.org/10.4310/CIS.2004.V4.N2.A2","url":null,"abstract":"The throughput characteristics of contention-based random access channels which use Q-ary splitting algorithms (where Q is the number of groups into which colliding users are split) are analyzed. The algorithms considered are of the Capetanakis-Tsybakov-Mikhailov-Vvedenskaya (CTMV) type and are studied for infinite populations of identical users generating packets according to a discrete time batch Markovian arrival process (D-BMAP). D-BMAPs are a class of tractable Markovian arrival processes, which, in general, are non-renewal. Free channel-access is assumed in combination with Q-ary collision resolution algorithms that exploit either binary or ternary feedback. For the resulting schemes, tree structured Quasi-Birth-Death (QBD) Markov chains are constructed and their stability is determined. The maximum achievable throughput is determined for a variety of arrival processes and splitting factors Q. It is concluded that binary (Q = 2) and ternary (Q = 3) algorithms should be preferred above other splitting factors Q as the throughput for Q > 3 quickly degrades when subject to bursty arrival streams. If packets arrivals are correlated and bursty, higher throughput rates can be achieved by making use of biased coins.","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"89 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":"132332070","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}
引用次数: 22
Mean field verification theorem 平均场验证定理
Commun. Inf. Syst. Pub Date : 1900-01-01 DOI: 10.4310/CIS.2021.V21.N2.A4
A. Bensoussan, S. Hoe, Joohyun Kim, Zhongfeng Yan
{"title":"Mean field verification theorem","authors":"A. Bensoussan, S. Hoe, Joohyun Kim, Zhongfeng Yan","doi":"10.4310/CIS.2021.V21.N2.A4","DOIUrl":"https://doi.org/10.4310/CIS.2021.V21.N2.A4","url":null,"abstract":"","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"23 2 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":"130865295","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}
引用次数: 0
Solid deformation by material point method 用物质点法计算固体变形
Commun. Inf. Syst. Pub Date : 1900-01-01 DOI: 10.4310/CIS.2016.V16.N3.A1
Yun-Tao Jiang, Tao Yang, Jian Chang
{"title":"Solid deformation by material point method","authors":"Yun-Tao Jiang, Tao Yang, Jian Chang","doi":"10.4310/CIS.2016.V16.N3.A1","DOIUrl":"https://doi.org/10.4310/CIS.2016.V16.N3.A1","url":null,"abstract":"Solid materials are responsible for many interesting phenomena. There are various types of them, such as deformable objects and granular materials. In this paper, we present an MPM based framework to simulate the wide range of solid materials. In this framework, solid mechanics is based on the elastoplastic model following small deformation theory. We use von Mises criterion for deformable objects, and the Drucker–Prager model with nonassociated plastic flow rules for granular materials. As a result, we can simulate different kinds of deformation of deformable objects and sloping failure for granular materials.","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"90 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":"130882612","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}
引用次数: 1
Necessary and sufficient conditions for adaptive stablizability of jump linear systems 跳变线性系统自适应稳定的充分必要条件
Commun. Inf. Syst. Pub Date : 1900-01-01 DOI: 10.4310/CIS.2001.V1.N2.A5
F. Xue, L. Guo
{"title":"Necessary and sufficient conditions for adaptive stablizability of jump linear systems","authors":"F. Xue, L. Guo","doi":"10.4310/CIS.2001.V1.N2.A5","DOIUrl":"https://doi.org/10.4310/CIS.2001.V1.N2.A5","url":null,"abstract":"","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"43 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":"123307057","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}
引用次数: 28
Control Theoretic Smoothing Splines are Approximate Linear Filters 控制理论平滑样条是近似线性滤波器
Commun. Inf. Syst. Pub Date : 1900-01-01 DOI: 10.4310/CIS.2004.V4.N3.A4
W. Dayawansa, C. Martin, Yiahao Zhou
{"title":"Control Theoretic Smoothing Splines are Approximate Linear Filters","authors":"W. Dayawansa, C. Martin, Yiahao Zhou","doi":"10.4310/CIS.2004.V4.N3.A4","DOIUrl":"https://doi.org/10.4310/CIS.2004.V4.N3.A4","url":null,"abstract":"The problem of constructing and approximating control theoretic smoothing splines is considered in this paper. It is shown that the optimal approximating function can be given as the solution of a forced Hamiltonian system, that can be explicitly solved using the Riccati transform, and an explicit linear filter can be constructed. We show that the bandwidth of the filter can be naturally controlled and thus for control theoretic smoothing splines the far past and the far future are unimportant. Hence smoothing splines are \"local\" in nature rather than \"global\". We conclude that while spline approximations are not causal the far future is not important.","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"13 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":"126431783","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}
引用次数: 16
Multi-Mode Multi-Dimensional Systems with Poissonian Sequencing 多模多维系统与泊松测序
Commun. Inf. Syst. Pub Date : 1900-01-01 DOI: 10.4310/CIS.2009.V9.N1.A4
Erik I. Verriest
{"title":"Multi-Mode Multi-Dimensional Systems with Poissonian Sequencing","authors":"Erik I. Verriest","doi":"10.4310/CIS.2009.V9.N1.A4","DOIUrl":"https://doi.org/10.4310/CIS.2009.V9.N1.A4","url":null,"abstract":"The dynamics of hybrid systems with mode dynamics of different dimensions is described. The first part gives some deterministic examples of such multi-mode multi-dimensional (M 3 D) systems. The second part considers such models under sequential switching at random times. More specifically, the backward Kolmogorov equation is derived, and Lie-algebraic methods are used in the case where the modes are linear. For Poissonian switched equi-dimensional modes, the dif- fusion limit and its implication in vibrational stability are studied. The motion of a pebble on an elevator belt is given as an example.","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"98 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":"123040915","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}
引用次数: 12
Prediction of Phenotype Information from Genotype Data 利用基因型数据预测表型信息
Commun. Inf. Syst. Pub Date : 1900-01-01 DOI: 10.4310/CIS.2010.V10.N2.A3
N. Yosef, J. Gramm, Qian-Fei Wang, William Stafford Noble, R. Karp, R. Sharan
{"title":"Prediction of Phenotype Information from Genotype Data","authors":"N. Yosef, J. Gramm, Qian-Fei Wang, William Stafford Noble, R. Karp, R. Sharan","doi":"10.4310/CIS.2010.V10.N2.A3","DOIUrl":"https://doi.org/10.4310/CIS.2010.V10.N2.A3","url":null,"abstract":"The dissection of complex diseases is one of the greatest challenges of human genetics with important clinical and scientific applications. Traditionally, associations were sought between single genetic markers and disease. The availability of large scale SNP data makes it possible, for the first time, to study the predictive power of genotypes and haplotypes with respect to phenotype data. Here we present a novel method for predicting phenotype information from genotype data. The method is based on a support vector machine that employs new kernel functions for the similarity between genotypes or their underlying haplotypes. We demonstrate our approach on SNP data for the apolipoprotein gene cluster in baboons, predicting plasma lipid levels with significant success rates, and identifying associations that were not detected using extant approaches.","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"13 4 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":"126285910","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}
引用次数: 9
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信