... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing最新文献
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.
{"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}
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.
{"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}
Pub Date : 2013-03-01DOI: 10.2201/NIIPI.2013.10.10
H. Ban, K. Nguyen, Man Cuong Ngô, Duc-Nghia Nguyen
The Minimum Latency Problem (MLP) is a class of combinational optimization problems that has many practical applications. In the general case, the MLP is proved to be NPhard. One of the approaches to solve the problem is using exact algorithms. However, the algorithms which were recently proposed are applied only to the problems with small size, i.e., 26 vertices. In this paper, we present a new exact algorithm to solve the MLPs with a larger size. Our algorithm is based on the branch and bound method and it has two new rules that improve the pruning technique. We have evaluated the algorithm on several data sets. The results show that the problems up to 40 vertices can be solved exactly.
{"title":"An efficient exact algorithm for the Minimum Latency Problem","authors":"H. Ban, K. Nguyen, Man Cuong Ngô, Duc-Nghia Nguyen","doi":"10.2201/NIIPI.2013.10.10","DOIUrl":"https://doi.org/10.2201/NIIPI.2013.10.10","url":null,"abstract":"The Minimum Latency Problem (MLP) is a class of combinational optimization problems that has many practical applications. In the general case, the MLP is proved to be NPhard. One of the approaches to solve the problem is using exact algorithms. However, the algorithms which were recently proposed are applied only to the problems with small size, i.e., 26 vertices. In this paper, we present a new exact algorithm to solve the MLPs with a larger size. Our algorithm is based on the branch and bound method and it has two new rules that improve the pruning technique. We have evaluated the algorithm on several data sets. The results show that the problems up to 40 vertices can be solved exactly.","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":"72 1","pages":"167-174"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84077921","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":"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)","authors":"Garrin Kimmell, Aaron Stump, H. Eades","doi":"10.2201/NIIPI.2013.10.3","DOIUrl":"https://doi.org/10.2201/NIIPI.2013.10.3","url":null,"abstract":"","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":"4 1","pages":"19-46"},"PeriodicalIF":0.0,"publicationDate":"2013-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90048139","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}
Lot-sizing problem has been extensively researched in many aspects. In this manuscript, we give a dynamic programming algorithm scheme for lot-sizing problems with outsourcing.
批量问题在许多方面得到了广泛的研究。在本文中，我们给出了一个动态规划算法方案，用于批量问题的外包。
{"title":"A dynamic programming algorithm for lot-sizing problem with outsourcing","authors":"Ping Zhan","doi":"10.2201/NIIPI.2012.9.6","DOIUrl":"https://doi.org/10.2201/NIIPI.2012.9.6","url":null,"abstract":"Lot-sizing problem has been extensively researched in many aspects. In this manuscript, we give a dynamic programming algorithm scheme for lot-sizing problems with outsourcing.","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":"92 5-6","pages":"31"},"PeriodicalIF":0.0,"publicationDate":"2012-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91497549","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}
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
{"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}
A clique is a subgraph in which any two vertices are connected. Clique represents a densely connected structure in the graph, thus used to capture the local related elements such as clustering, frequent patterns, community mining, and so on. In these applications, enumeration of cliques rather than optimization is frequently used. Recent applications have large scale very sparse graphs, thus efficient implementations for clique enumeration is necessary. In this paper, we describe the algorithm techniques (not coding techniques) for obtaining efficient clique enumeration implementations.
{"title":"Implementation issues of clique enumeration algorithm","authors":"T. Uno","doi":"10.2201/NIIPI.2012.9.5","DOIUrl":"https://doi.org/10.2201/NIIPI.2012.9.5","url":null,"abstract":"A clique is a subgraph in which any two vertices are connected. Clique represents a densely connected structure in the graph, thus used to capture the local related elements such as clustering, frequent patterns, community mining, and so on. In these applications, enumeration of cliques rather than optimization is frequently used. Recent applications have large scale very sparse graphs, thus efficient implementations for clique enumeration is necessary. In this paper, we describe the algorithm techniques (not coding techniques) for obtaining efficient clique enumeration implementations.","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":"23 1","pages":"25"},"PeriodicalIF":0.0,"publicationDate":"2012-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84352311","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}
In this paper we give an algorithmfor estimatingthe entropyofa string using the suffix array. Our algorithm is based on a new combinatorial property of the longest common prefix array of a string.
{"title":"Entropy estimation with suffix arrays","authors":"K. Sadakane","doi":"10.2201/NIIPI.2012.9.4","DOIUrl":"https://doi.org/10.2201/NIIPI.2012.9.4","url":null,"abstract":"In this paper we give an algorithmfor estimatingthe entropyofa string using the suffix array. Our algorithm is based on a new combinatorial property of the longest common prefix array of a string.","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":"156 3","pages":"19"},"PeriodicalIF":0.0,"publicationDate":"2012-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72579292","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}
For an undirected graph G and its four distinct vertices v1, v2, v3, v4, an immersion of (v1, v2, v3, v4) is a subgraph of G that consists of four edge-disjoint paths P1, P2, P3, P4 such that Pi connects vi and vi+1 for i = 1, 2, 3, 4, where v5 = v1. We show that every 4-edgeconnected graph G = (V, E) has an immersion of (v1, v2, v3, v4) for any v1, v2, v3, v4 ∈ V, and it can be found in linear time.
{"title":"An immersion of a square in 4-edge-connected graphs","authors":"K. Kawarabayashi, Yusuke Kobayashi","doi":"10.2201/NIIPI.2012.9.7","DOIUrl":"https://doi.org/10.2201/NIIPI.2012.9.7","url":null,"abstract":"For an undirected graph G and its four distinct vertices v1, v2, v3, v4, an immersion of (v1, v2, v3, v4) is a subgraph of G that consists of four edge-disjoint paths P1, P2, P3, P4 such that Pi connects vi and vi+1 for i = 1, 2, 3, 4, where v5 = v1. We show that every 4-edgeconnected graph G = (V, E) has an immersion of (v1, v2, v3, v4) for any v1, v2, v3, v4 ∈ V, and it can be found in linear time.","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":"11 1","pages":"35"},"PeriodicalIF":0.0,"publicationDate":"2012-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74144010","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}
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.
本文提出了一种针对软管模型的IP负载均衡路由优化方法。提出了一种基于两阶段最短路径路由的IP负载均衡路由方案。它被称为精细两相路由(F-TPR)方案。在F-TPR中，与原始TPR相比，流量从源节点到中间节点的分配更加精细。F-TPR引入节点m的分配比，该分配比是为(p, q)， k m的每个源-目的对确定的。为了确定k - pq - m的最优集合，首先导出了线性规划(LP)公式。然而，该公式很难作为一个简单的LP问题来求解。这是因为流量矩阵的每个元素都是不确定的，因为软管模型，有太多可能的参数需要我们考虑。通过引入对偶定理，我们成功地将问题化为一个二次约束规划(QCP)公式，该公式可以用数学规划求解器求解来确定分割比。我们比较了F-TPR与TPR和多协议标签交换(MPLS)-流量工程(TE)。数值结果表明，与TPR相比，F-TPR降低了网络拥塞率。数值结果表明，与TPR相比，F-TPR大大降低了网络拥塞率，并提供了与MPLS-TE相当的路由性能。
{"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}
... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：