In this paper, we propose an algorithm based on Fletcher’s Sl1QP method and the trust region technique for solving Nonlinear Second-Order Cone Programming (NSOCP) problems. The Sl1QP method was originally developed for nonlinear optimization problems with inequality constraints. It converts a constrained optimization problem into an unconstrained problem by using the l1 exact penalty function, and then finds an optimum by solving approximate quadratic programming subproblems successively. In order to apply the Sl1QP method to the NSOCP problem, we introduce an exact penalty function with respect to second-order cone constraints and reformulate the NSOCP problem as an unconstrained optimization problem. However, since each subproblem generated by the Sl1QP method is not differentiable, we reformulate it as a second-order cone programming problem whose objective function is quadratic and constraint functions are affine. We analyze the convergence property of the proposed algorithm, and show that the generated sequence converge to a stationary point of the NSOCP problem under mild assumptions. We also confirm the efficiency of the algorithm by means of numerical experiments.
{"title":"Sl1QP Based Algorithm with Trust Region Technique for Solving Nonlinear Second-Order Cone Programming Problems","authors":"Takayuki Okuno, Kohei Yasuda, S. Hayashi","doi":"10.4036/IIS.2015.97","DOIUrl":"https://doi.org/10.4036/IIS.2015.97","url":null,"abstract":"In this paper, we propose an algorithm based on Fletcher’s Sl1QP method and the trust region technique for solving Nonlinear Second-Order Cone Programming (NSOCP) problems. The Sl1QP method was originally developed for nonlinear optimization problems with inequality constraints. It converts a constrained optimization problem into an unconstrained problem by using the l1 exact penalty function, and then finds an optimum by solving approximate quadratic programming subproblems successively. In order to apply the Sl1QP method to the NSOCP problem, we introduce an exact penalty function with respect to second-order cone constraints and reformulate the NSOCP problem as an unconstrained optimization problem. However, since each subproblem generated by the Sl1QP method is not differentiable, we reformulate it as a second-order cone programming problem whose objective function is quadratic and constraint functions are affine. We analyze the convergence property of the proposed algorithm, and show that the generated sequence converge to a stationary point of the NSOCP problem under mild assumptions. We also confirm the efficiency of the algorithm by means of numerical experiments.","PeriodicalId":91087,"journal":{"name":"Interdisciplinary information sciences","volume":"21 1","pages":"97-107"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70250787","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}
Adding a sound to a certain environment is likely to be effective for design of impression there in acoustical point of view. However, until now, little is known about the effectiveness of additional sound on the change in impression. In order to investigate the effect of additional sound, an experiment was conducted by using three kinds of audio-visual materials offering three environments and five kinds of additional sounds. The audio-visual materials were respectively recorded at ‘‘forest,’’ ‘‘park,’’ and ‘‘shopping street.’’ They represent ‘‘natural,’’ ‘‘artificial green,’’ and ‘‘urban’’ environments, respectively. Five kinds of sound stimuli were respectively chosen as: ‘‘bird singing,’’ ‘‘sound of stream,’’ ‘‘roaring of waves,’’ ‘‘traffic noise,’’ and ‘‘hum of voices.’’ The former three stimuli are regarded as sounds in nature, while the latter two are regarded as artificial ones. The experiment was based on the method of paired comparison, consisting of the unprocessed original audio-visual material and that with one of the additional sounds. The subjects evaluated relative comfortableness and naturalness of each pair. Sound pressure level of the additional sound was controlled in order to discuss the influence of the loudness of the additional sound to the evaluation. The experimental results showed that the comfortableness was improved when the additional sound was ‘bird singing’ or ‘sound of stream’ categorized in the nature sound and its sound pressure level was a little lower than that at the original environment. Moreover, it was found out that the naturalness is degraded gradually for almost of the additional sound stimuli, as their sound pressure level is increased.
{"title":"Investigation on Influence of Additional Sound on Comfortableness of Living Environment","authors":"Koji Abe, S. Takane, Sojun Sato","doi":"10.4036/IIS.2015.A.06","DOIUrl":"https://doi.org/10.4036/IIS.2015.A.06","url":null,"abstract":"Adding a sound to a certain environment is likely to be effective for design of impression there in acoustical point of view. However, until now, little is known about the effectiveness of additional sound on the change in impression. In order to investigate the effect of additional sound, an experiment was conducted by using three kinds of audio-visual materials offering three environments and five kinds of additional sounds. The audio-visual materials were respectively recorded at ‘‘forest,’’ ‘‘park,’’ and ‘‘shopping street.’’ They represent ‘‘natural,’’ ‘‘artificial green,’’ and ‘‘urban’’ environments, respectively. Five kinds of sound stimuli were respectively chosen as: ‘‘bird singing,’’ ‘‘sound of stream,’’ ‘‘roaring of waves,’’ ‘‘traffic noise,’’ and ‘‘hum of voices.’’ The former three stimuli are regarded as sounds in nature, while the latter two are regarded as artificial ones. The experiment was based on the method of paired comparison, consisting of the unprocessed original audio-visual material and that with one of the additional sounds. The subjects evaluated relative comfortableness and naturalness of each pair. Sound pressure level of the additional sound was controlled in order to discuss the influence of the loudness of the additional sound to the evaluation. The experimental results showed that the comfortableness was improved when the additional sound was ‘bird singing’ or ‘sound of stream’ categorized in the nature sound and its sound pressure level was a little lower than that at the original environment. Moreover, it was found out that the naturalness is degraded gradually for almost of the additional sound stimuli, as their sound pressure level is increased.","PeriodicalId":91087,"journal":{"name":"Interdisciplinary information sciences","volume":"21 1","pages":"151-157"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70251358","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}
Proof complexity, a measure to estimate the sizes of proofs in propositional logics, is studied as one of the fundamental approaches to the P versus NP problem, and has some practical applications such as automated theorem proving. It is a very hard task to prove lower bounds on strong proof systems such as Frege systems, for which no non-trivial lower bound is known yet. On the other hand, we have some rich success stories on weaker proof systems such as resolution proof systems. In this paper, we focus on resolution proof systems and review some of the existing techniques for proving lower bounds.
{"title":"An Introduction to Lower Bounds on Resolution Proof Systems","authors":"Kazuhisa Seto","doi":"10.4036/IIS.2015.L.02","DOIUrl":"https://doi.org/10.4036/IIS.2015.L.02","url":null,"abstract":"Proof complexity, a measure to estimate the sizes of proofs in propositional logics, is studied as one of the fundamental approaches to the P versus NP problem, and has some practical applications such as automated theorem proving. It is a very hard task to prove lower bounds on strong proof systems such as Frege systems, for which no non-trivial lower bound is known yet. On the other hand, we have some rich success stories on weaker proof systems such as resolution proof systems. In this paper, we focus on resolution proof systems and review some of the existing techniques for proving lower bounds.","PeriodicalId":91087,"journal":{"name":"Interdisciplinary information sciences","volume":"21 1","pages":"307-328"},"PeriodicalIF":0.0,"publicationDate":"2015-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70251901","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 review subadditive approaches which arise in the theory of mathematical programming and computational complexity. In particular, we explain the duality theorem of integer programming and techniques to prove formula-size lower bounds as fundamental subjects in mathematical programming and computational complexity, respectively. We discuss parallel visions of these two different areas by showing some connections between them.
{"title":"Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory","authors":"Kenya Ueno","doi":"10.4036/IIS.2015.L.03","DOIUrl":"https://doi.org/10.4036/IIS.2015.L.03","url":null,"abstract":"In this paper, we review subadditive approaches which arise in the theory of mathematical programming and computational complexity. In particular, we explain the duality theorem of integer programming and techniques to prove formula-size lower bounds as fundamental subjects in mathematical programming and computational complexity, respectively. We discuss parallel visions of these two different areas by showing some connections between them.","PeriodicalId":91087,"journal":{"name":"Interdisciplinary information sciences","volume":"21 1","pages":"329-349"},"PeriodicalIF":0.0,"publicationDate":"2015-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.4036/IIS.2015.L.03","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70252014","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}
Distributed graph algorithms are the methods for solving graph problems defined over networks of computers, where each vertex is a computing entity (i.e., process) and an edge is a communication link between two processes. This introductory survey presents a brief outline, several important concepts, and the fundamental complexity study of distributed graph algorithms. For a number of standard problems such as the shortest path and the coloring, we spotlight their inherent difficulties and challenges.
{"title":"Distributed Graph Algorithms and their Complexity: An Introduction","authors":"Taisuke Izumi","doi":"10.4036/IIS.2015.L.04","DOIUrl":"https://doi.org/10.4036/IIS.2015.L.04","url":null,"abstract":"Distributed graph algorithms are the methods for solving graph problems defined over networks of computers, where each vertex is a computing entity (i.e., process) and an edge is a communication link between two processes. This introductory survey presents a brief outline, several important concepts, and the fundamental complexity study of distributed graph algorithms. For a number of standard problems such as the shortest path and the coloring, we spotlight their inherent difficulties and challenges.","PeriodicalId":91087,"journal":{"name":"Interdisciplinary information sciences","volume":"21 1","pages":"351-370"},"PeriodicalIF":0.0,"publicationDate":"2015-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.4036/IIS.2015.L.04","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70252087","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 floorplan is a partition (dissection) of a rectangle into smaller rectangles by horizontal and vertical line segments such that no four rectangles meet at the same point. Floorplans are used to design the layout of verylarge-scale integration (VLSI) circuits. Since modern VLSI circuits are extremely large, it is necessary to design compact floorplans (VLSI layouts). In 2004, Feng et al. [8] surveyed ways of representing floorplans. However, over the past decade, various new methods have been developed, and in this paper, we survey these recent developments in floorplan representations.
{"title":"Recent Developments in Floorplan Representations","authors":"Katsuhisa Yamanaka","doi":"10.4036/IIS.2015.L.05","DOIUrl":"https://doi.org/10.4036/IIS.2015.L.05","url":null,"abstract":"A floorplan is a partition (dissection) of a rectangle into smaller rectangles by horizontal and vertical line segments such that no four rectangles meet at the same point. Floorplans are used to design the layout of verylarge-scale integration (VLSI) circuits. Since modern VLSI circuits are extremely large, it is necessary to design compact floorplans (VLSI layouts). In 2004, Feng et al. [8] surveyed ways of representing floorplans. However, over the past decade, various new methods have been developed, and in this paper, we survey these recent developments in floorplan representations.","PeriodicalId":91087,"journal":{"name":"Interdisciplinary information sciences","volume":"21 1","pages":"371-399"},"PeriodicalIF":0.0,"publicationDate":"2015-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70251647","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 two-prover one-round game is a fundamental combinatorial optimization problem arising from such areas as interactive proof systems, hardness of approximation, cryptography and quantum mechanics. The parallel repetition theorem states that for any two-prover one-round game with value smaller than 1, k-fold parallel repetition reduces the value of the game exponentially in k. The theorem was originally proved by Raz (SICOMP 1998) and later simplified and improved by Holenstein (Theory of Computing 2009) and Rao (SICOMP 2011). All the known proofs are based on information theoretic arguments. Very recently, Dinur and Steurer (STOC 2014) obtained a new proof of the parallel repetition theorem based on a matrix analysis argument. In this paper, we describe a special case of Dinur and Steurer’s proof. We also describe an application of the parallel repetition theorem to inapproximability results of two-prover one-round games. Our presentation is almost self-contained in the sense that we only assume the PCP theorem. To do so, we also present proofs for the necessary results related to algebraic graph theory and hardness of approximation.
{"title":"Parallel Repetition of Two-Prover One-Round Games: An Exposition","authors":"Suguru Tamaki","doi":"10.4036/IIS.2015.L.01","DOIUrl":"https://doi.org/10.4036/IIS.2015.L.01","url":null,"abstract":"A two-prover one-round game is a fundamental combinatorial optimization problem arising from such areas as interactive proof systems, hardness of approximation, cryptography and quantum mechanics. The parallel repetition theorem states that for any two-prover one-round game with value smaller than 1, k-fold parallel repetition reduces the value of the game exponentially in k. The theorem was originally proved by Raz (SICOMP 1998) and later simplified and improved by Holenstein (Theory of Computing 2009) and Rao (SICOMP 2011). All the known proofs are based on information theoretic arguments. Very recently, Dinur and Steurer (STOC 2014) obtained a new proof of the parallel repetition theorem based on a matrix analysis argument. In this paper, we describe a special case of Dinur and Steurer’s proof. We also describe an application of the parallel repetition theorem to inapproximability results of two-prover one-round games. Our presentation is almost self-contained in the sense that we only assume the PCP theorem. To do so, we also present proofs for the necessary results related to algebraic graph theory and hardness of approximation.","PeriodicalId":91087,"journal":{"name":"Interdisciplinary information sciences","volume":"21 1","pages":"289-306"},"PeriodicalIF":0.0,"publicationDate":"2015-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70251885","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 study first summarizes the Kinematic Wave Theory which has been used to describe vehicle motions and the Variational Theory which is an efficient solution method to estimate vehicle trajectories based on the Kinematic Wave Theory. Then, several demonstrative applications on a signalized arterial and on an intercity motorway are presented by a data fusion technique using probe vehicle data and conventional traffic detector data.
{"title":"Theory, Solution Method and Applications of Kinematic Wave","authors":"M. Kuwahara","doi":"10.4036/IIS.2015.63","DOIUrl":"https://doi.org/10.4036/IIS.2015.63","url":null,"abstract":"This study first summarizes the Kinematic Wave Theory which has been used to describe vehicle motions and the Variational Theory which is an efficient solution method to estimate vehicle trajectories based on the Kinematic Wave Theory. Then, several demonstrative applications on a signalized arterial and on an intercity motorway are presented by a data fusion technique using probe vehicle data and conventional traffic detector data.","PeriodicalId":91087,"journal":{"name":"Interdisciplinary information sciences","volume":"21 1","pages":"63-75"},"PeriodicalIF":0.0,"publicationDate":"2015-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.4036/IIS.2015.63","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70250226","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 study investigated the effect of aging on the dual task interference when an auditory task of answering to questions was combined with a visual search task. The study focused on the effect of unilateral auditory input, which is usually the case when we use cellular phone by applying it to one ear while driving. Participant’s task was to detect a probe from among distracters. In the dual task condition, participant detected the probe, while listening to a simple open-ended question. Both younger and older participants showed comparable dual task interference in detection RT. In the older participants, however, the auditory task interfered with the probe detection more when they heard the questions with their left ear than when they did so with their right ear, suggesting that the dual task cost was especially large when they answered to question heard from their left ear.
{"title":"Asymmetric Dual-Task Interference of Auditory Message in Change Detection in Older Adults","authors":"M. Sakurai, Syoichi Iwasaki","doi":"10.4036/IIS.2015.1","DOIUrl":"https://doi.org/10.4036/IIS.2015.1","url":null,"abstract":"This study investigated the effect of aging on the dual task interference when an auditory task of answering to questions was combined with a visual search task. The study focused on the effect of unilateral auditory input, which is usually the case when we use cellular phone by applying it to one ear while driving. Participant’s task was to detect a probe from among distracters. In the dual task condition, participant detected the probe, while listening to a simple open-ended question. Both younger and older participants showed comparable dual task interference in detection RT. In the older participants, however, the auditory task interfered with the probe detection more when they heard the questions with their left ear than when they did so with their right ear, suggesting that the dual task cost was especially large when they answered to question heard from their left ear.","PeriodicalId":91087,"journal":{"name":"Interdisciplinary information sciences","volume":"21 1","pages":"1-10"},"PeriodicalIF":0.0,"publicationDate":"2015-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70250463","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}
Kentaro Wada, T. Ohata, Keiko Kobayashi, M. Kuwahara
Probe data provide rich information of vehicle trajectories which include driving modes (e.g., acceleration/ deceleration) and reflect traffic conditions. However, most of the applications only use probe data to measure travel times. This paper presents two alternative applications of vehicle trajectories on signalized arterials: one is a traffic signal timing estimation and the other is a traffic volume estimation. Both applications are based on a simple methodology that combines vehicle trajectories and traffic engineering concept shock wave . By testing the methodology using real world data, we demonstrate that probe data have more potential for traffic measurements.
{"title":"Traffic Measurements on Signalized Arterials from Vehicle Trajectories","authors":"Kentaro Wada, T. Ohata, Keiko Kobayashi, M. Kuwahara","doi":"10.4036/IIS.2015.77","DOIUrl":"https://doi.org/10.4036/IIS.2015.77","url":null,"abstract":"Probe data provide rich information of vehicle trajectories which include driving modes (e.g., acceleration/ deceleration) and reflect traffic conditions. However, most of the applications only use probe data to measure travel times. This paper presents two alternative applications of vehicle trajectories on signalized arterials: one is a traffic signal timing estimation and the other is a traffic volume estimation. Both applications are based on a simple methodology that combines vehicle trajectories and traffic engineering concept shock wave . By testing the methodology using real world data, we demonstrate that probe data have more potential for traffic measurements.","PeriodicalId":91087,"journal":{"name":"Interdisciplinary information sciences","volume":"21 1","pages":"77-85"},"PeriodicalIF":0.0,"publicationDate":"2015-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.4036/IIS.2015.77","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70250316","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：