... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing最新文献_第2页

An expressive bidirectional transformation language for XQuery view update (Special issue : Advanced Programming Techniques for Construction of Robust, Generic and Evolutionary Programs) 用于XQuery视图更新的表达性双向转换语言(特刊:构建健壮、泛型和进化程序的高级编程技术)

... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing Pub Date : 2013-03-01 DOI: 10.2201/NIIPI.2013.10.6

Dongxi Liu, Zhenjiang Hu, M. Takeichi

{"title":"An expressive bidirectional transformation language for XQuery view update (Special issue : Advanced Programming Techniques for Construction of Robust, Generic and Evolutionary Programs)","authors":"Dongxi Liu, Zhenjiang Hu, M. Takeichi","doi":"10.2201/NIIPI.2013.10.6","DOIUrl":"https://doi.org/10.2201/NIIPI.2013.10.6","url":null,"abstract":"This paper presents an expressive bidirectional XML transformation language and uses it to address the problem of updating XML data through materialized XQuery views. The transformations of this bidirectional language can be executed in two directions: in the forward direction, they generate materialized views from XML source, while in the backward direction, they update the source by reflecting back the updates on views. When XQuery is interpreted with this bidirectional language, it can query XML in its forward execution, and update XML source after its backward execution. We propose the extended round-tripping property for characterizing the good behavior of bidirectional transformations. This property is more flexible for an expressive bidirectional transformation language. The difficulties of updating view insertions are analyzed with detailed examples, and the type information is novelly used to guide backward transformation when views include insertions. A type system with recursive regular expression types for XML is designed for this bidirectional language. Well-typed programs preserve the source type after backward executions. A prototype of our approach is implemented and tested on a number of XQuery use cases.","PeriodicalId":91638,"journal":{"name":"... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing","volume":"137 1","pages":"89-129"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79682163","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

Wander types : A formalization of coinduction-recursion 漫游类型:共归纳递归的形式化

... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing Pub Date : 2013-03-01 DOI: 10.2201/NIIPI.2013.10.4

Venanzio Capretta

{"title":"Wander types : A formalization of coinduction-recursion","authors":"Venanzio Capretta","doi":"10.2201/NIIPI.2013.10.4","DOIUrl":"https://doi.org/10.2201/NIIPI.2013.10.4","url":null,"abstract":"Wander types are a coinductive version of inductive-recursive definitions. They are defined by simultaneously specifying the constructors of the type and a function on the type itself. The types of the constructors can refer to the function component and the function itself is given by pattern matching on the constructors. Wander types are different from inductive-recursive types in two ways: the structure of the elements is not required to be well-founded, so infinite applications of the constructors are allowed; and the recursive calls in the definition of the function are not required to be on structurally smaller arguments. Wander types generalize several known type formers. We can use the functional component to control the way the data branch. This allows not only the implementation of coinduction, but also of induction, by imposing well-foundedness through an appropriate function definition. Special instances of wander types are: plain inductive and coinductive types, inductive-recursive types, mixed inductive-coinductive types, continuous stream processors.","PeriodicalId":91638,"journal":{"name":"... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing","volume":"56 1","pages":"47"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90053062","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

An efficient exact algorithm for the Minimum Latency Problem 最小延迟问题的一种高效精确算法

... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing Pub Date : 2013-03-01 DOI: 10.2201/NIIPI.2013.10.10

H. Ban, K. Nguyen, Man Cuong Ngô, Duc-Nghia Nguyen

引用次数: 16

Equational reasoning about programs with general recursion and call-by-value semantics (Special issue : Advanced Programming Techniques for Construction of Robust, Generic and Evolutionary Programs) 具有一般递归和按值调用语义的程序的方程推理(特刊:构建鲁棒、泛型和进化程序的高级编程技术)

... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing Pub Date : 2013-03-01 DOI: 10.2201/NIIPI.2013.10.3

Garrin Kimmell, Aaron Stump, H. Eades

引用次数: 2

A dynamic programming algorithm for lot-sizing problem with outsourcing 外包批量问题的动态规划算法

... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing Pub Date : 2012-03-01 DOI: 10.2201/NIIPI.2012.9.6

Ping Zhan

引用次数: 0

Theoretical Computer Science and Discrete Mathematics 理论计算机科学与离散数学

... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing Pub Date : 2012-03-01 DOI: 10.2201/NIIPI.2012.9.1

K. Kawarabayashi, K. Sadakane, T. Uno

{"title":"Theoretical Computer Science and Discrete Mathematics","authors":"K. Kawarabayashi, K. Sadakane, T. Uno","doi":"10.2201/NIIPI.2012.9.1","DOIUrl":"https://doi.org/10.2201/NIIPI.2012.9.1","url":null,"abstract":"Recent informatics such as large scale data analysis needs efficient computation. The developments in theoretical computer science give much advance in this task. These divisions and subsets include analysis of algorithms and formal semantics of programming languages. In order to deal with large scale data analysis, we need some mathematical tools from Discrete Mathematics. Theoretical Computer Science is one of the most vibrant and active areas of scientific study today. Starting half a century ago, even before computers existed, theoretical computer scientists set out to define mathematically the concept of “computation”, and to study its power and limits. It is a division or subset of general computer science and mathematics which focuses on more abstract or mathematical aspects of computing. These divisions and subsets include analysis of algorithms and formal semantics of programming languages. Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than continuous. In contrast to real numbers that have the property of varying “smoothly”, the objects studied in discrete mathematics such as integers and graphs do not vary smoothly in this way, but have distinct, separated values. It has been characterized as the branch of mathematics. Dealing with discrete objects, questions from theoretical computer science inspired much interest in the combinatorics community, and for many of its leaders became a primary scientific goal. A typical goal is the P versus NP problem, which characterizes difficulties of various problems, and much research has been devoted to analyze complexities of the problems. This collaboration has been extremely beneficial to both the discrete math and theoretical computer science communities, with wealthy exchange of ideas, problems and","PeriodicalId":91638,"journal":{"name":"... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing","volume":"30 1","pages":"1"},"PeriodicalIF":0.0,"publicationDate":"2012-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84982601","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

Implementation issues of clique enumeration algorithm 团枚举算法的实现问题

... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing Pub Date : 2012-03-01 DOI: 10.2201/NIIPI.2012.9.5

T. Uno

引用次数: 5

Entropy estimation with suffix arrays 后缀数组的熵估计

... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing Pub Date : 2012-03-01 DOI: 10.2201/NIIPI.2012.9.4

K. Sadakane

引用次数: 0

An immersion of a square in 4-edge-connected graphs 将正方形浸入四边连通图中

... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing Pub Date : 2012-03-01 DOI: 10.2201/NIIPI.2012.9.7

K. Kawarabayashi, Yusuke Kobayashi

引用次数: 0

On optimization of load-balanced IP routing for hose model 软管型号负载均衡IP路由优化研究

... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing Pub Date : 2011-03-01 DOI: 10.2201/NIIPI.2011.8.12

E. Oki

{"title":"On optimization of load-balanced IP routing for hose model","authors":"E. Oki","doi":"10.2201/NIIPI.2011.8.12","DOIUrl":"https://doi.org/10.2201/NIIPI.2011.8.12","url":null,"abstract":"This paper presents an optimization of IP load-balanced routing for the hose model. We present an IP load-balanced routing scheme based on the two-phase routing over shortest paths. It is called a fine two-phase routing (F-TPR) scheme. In F-TPR, traffic is distributed from a source node to intermediate nodes more finely, compared to the original TPR. F-TPR introduces the distribution ratio to node m that is determined for each source-destination pair of (p, q), k m . To determine an optimum set of k pq m , an linear programming (LP) formulation is first derived. However, the formulation is difficult to solve as a simple LP problem. This is because each element of the traffic matrix is not determined because of the hose model and there are too many possible parameters for us to consider. By introducing a duality theorem , we successfully formulate our problem a quadratic constraint programming (QCP) formulation that can be solved to determine the split ratios by using a mathematical programming solver. We compare F-TPR with TPR and the Multi-Protocol Label Switching (MPLS)-Traffic Engineering (TE). Numerical results show that F-TPR reduces the network congestion ratio compared to TPR. Numerical results show that F-TPR greatly reduces the network congestion ratio compared to TPR, and provides comparable routing performances to that of MPLS-TE.","PeriodicalId":91638,"journal":{"name":"... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing","volume":"348 1","pages":"115"},"PeriodicalIF":0.0,"publicationDate":"2011-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82585360","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}

引用次数: 2