Pub Date : 2001-10-30DOI: 10.1109/ICCIMA.2001.970501
A. Filho, G. Mota, M. Vellasco, M. Pacheco
In this paper we propose a new model for query by image similarity. The model utilizes a fuzzy logic approach to cluster intrinsic image characteristics, which are extracted from subregions of the image. The clustering process provides a set of parameters that are used to compare a target image with a group of images. As a result, the system provides the images in the data set which are similar to the target image. We present as an example some queries by similarity on an image database composed of 20 types of animals. The main objective of this model is to develop an intelligent image query system that can be applied on the web and image databases.
{"title":"Query by image similarity using a fuzzy logic approach","authors":"A. Filho, G. Mota, M. Vellasco, M. Pacheco","doi":"10.1109/ICCIMA.2001.970501","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970501","url":null,"abstract":"In this paper we propose a new model for query by image similarity. The model utilizes a fuzzy logic approach to cluster intrinsic image characteristics, which are extracted from subregions of the image. The clustering process provides a set of parameters that are used to compare a target image with a group of images. As a result, the system provides the images in the data set which are similar to the target image. We present as an example some queries by similarity on an image database composed of 20 types of animals. The main objective of this model is to develop an intelligent image query system that can be applied on the web and image databases.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130723808","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970481
Runtong Zhang, Jian Ma
The basic objectives of future Internet are to increase the network capacity, to offer practically differentiated services for traffic with different requirements such as real-time and non-real-time services. These objectives introduce very strict requirements for traffic control systems and lead to the establishment of Differentiated Services (DS) concept. However, the new features of DS networks, where several classes of precedence are allowed, lead the inefficiency of the congestion control approaches for the existed best-effort Internet. In this paper, a new congestion control approach using fuzzy logic in the DS domain is presented. Simulation shows that the approach is efficient and promising.
{"title":"Congestion control using fuzzy logic in differentiated services networks","authors":"Runtong Zhang, Jian Ma","doi":"10.1109/ICCIMA.2001.970481","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970481","url":null,"abstract":"The basic objectives of future Internet are to increase the network capacity, to offer practically differentiated services for traffic with different requirements such as real-time and non-real-time services. These objectives introduce very strict requirements for traffic control systems and lead to the establishment of Differentiated Services (DS) concept. However, the new features of DS networks, where several classes of precedence are allowed, lead the inefficiency of the congestion control approaches for the existed best-effort Internet. In this paper, a new congestion control approach using fuzzy logic in the DS domain is presented. Simulation shows that the approach is efficient and promising.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123857874","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970453
Y. Tsujimura, T. Murata, T. Sugimoto
For cellular manufacturing, we consider a representation method for fuzzy numbers and fuzzy operations in cell formation method in which characteristic features of each part are given as fuzzy linguistic values. Then we propose a rule-based scheduling method that schedules the classified parts in the obtained formulated cell. We use a decision tree to acquire rules among the generated instance schedules. The acquired rules are used for flow-shop scheduling in a cell.
{"title":"Cell formation with fuzzy linguistic inputs and rule-based cell scheduling","authors":"Y. Tsujimura, T. Murata, T. Sugimoto","doi":"10.1109/ICCIMA.2001.970453","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970453","url":null,"abstract":"For cellular manufacturing, we consider a representation method for fuzzy numbers and fuzzy operations in cell formation method in which characteristic features of each part are given as fuzzy linguistic values. Then we propose a rule-based scheduling method that schedules the classified parts in the obtained formulated cell. We use a decision tree to acquire rules among the generated instance schedules. The acquired rules are used for flow-shop scheduling in a cell.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116642073","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970432
M. Tabata, A. Ide, N. Eshima, I. Takagi, Y. Takei
We consider an agent-based model consisting of a finite number of firms that move stochastically within a discrete bounded domain in order to obtain higher business profits. The desirability in business is expressed by a certain exogenous random variable and a linear integral operator called market potential. If the number of firms is extremely large and the domain is very wide, then it is almost impossible to fully investigate the model by only doing numerical simulations. In order to overcome the difficulty, we employ a deterministic continuous model that is derived from the stochastic agent-based model by taking the scaling limit. By making use of the continuous model thus derived, we can fully observe self-organization exhibited by the original agent-based model.
{"title":"Self-organization exhibited by a stochastic agent-based model of firms seeking higher desirability in business expressed by the market potential","authors":"M. Tabata, A. Ide, N. Eshima, I. Takagi, Y. Takei","doi":"10.1109/ICCIMA.2001.970432","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970432","url":null,"abstract":"We consider an agent-based model consisting of a finite number of firms that move stochastically within a discrete bounded domain in order to obtain higher business profits. The desirability in business is expressed by a certain exogenous random variable and a linear integral operator called market potential. If the number of firms is extremely large and the domain is very wide, then it is almost impossible to fully investigate the model by only doing numerical simulations. In order to overcome the difficulty, we employ a deterministic continuous model that is derived from the stochastic agent-based model by taking the scaling limit. By making use of the continuous model thus derived, we can fully observe self-organization exhibited by the original agent-based model.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123203120","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970436
T. Onozaki, T. Yanagita
A simple virtual market economy is simulated, and the emergence of monopoly or oligopoly as a result of competition is shown, which traditional microeconomics fails to explain because it essentially lacks a dynamical structure. The model contains many consumers and producers, who are boundedly rational in the sense that they face the information limit and cannot calculate the optimum consumption or production. Therefore, they behave habitually or adaptively. Only a single commodity is produced and purchased, but there is the product differentiation that is described in the form of a consumer's habituation. A consumer has her favorite product and she always compares its price with a price of another product. She purchases her favorite commodity unless its price is too much higher than another's. A producer produces and sets a price on commodities so as to chase higher profit, not to maximize them. This profit-chasing behavior is described with the aid of the hill-climbing method: a producer revises his production and price to the direction where profit becomes higher. Monopoly or oligopoly emerges according to two key parameters, i.e., the robustness of the consumer's habit and the inertia of the producer's revision.
{"title":"Monopoly and oligopoly led by an invisible hand","authors":"T. Onozaki, T. Yanagita","doi":"10.1109/ICCIMA.2001.970436","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970436","url":null,"abstract":"A simple virtual market economy is simulated, and the emergence of monopoly or oligopoly as a result of competition is shown, which traditional microeconomics fails to explain because it essentially lacks a dynamical structure. The model contains many consumers and producers, who are boundedly rational in the sense that they face the information limit and cannot calculate the optimum consumption or production. Therefore, they behave habitually or adaptively. Only a single commodity is produced and purchased, but there is the product differentiation that is described in the form of a consumer's habituation. A consumer has her favorite product and she always compares its price with a price of another product. She purchases her favorite commodity unless its price is too much higher than another's. A producer produces and sets a price on commodities so as to chase higher profit, not to maximize them. This profit-chasing behavior is described with the aid of the hill-climbing method: a producer revises his production and price to the direction where profit becomes higher. Monopoly or oligopoly emerges according to two key parameters, i.e., the robustness of the consumer's habit and the inertia of the producer's revision.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121718466","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970487
J. Segura-Salazar, J. Torres-Jiménez
Propositional satisfiability is the problem of determining, given a formula of propositional calculus in CNF (Conjunctive Normal Form), if there is an assignment of truth values for the variables in such a way that the whole formula is true. The SAT problem is one of the most important combinatorial optimization problems, in particular the 3-SAT problem is the,first NP-Complete problem. In order to test sat solving algorithms is necessary to generate hard sat instances, in this paper we address the construction and testing of HyperSAT a sat instance generator based on the concept of hypergraphs.
{"title":"HyperSAT a new generator for 3-SAT instances","authors":"J. Segura-Salazar, J. Torres-Jiménez","doi":"10.1109/ICCIMA.2001.970487","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970487","url":null,"abstract":"Propositional satisfiability is the problem of determining, given a formula of propositional calculus in CNF (Conjunctive Normal Form), if there is an assignment of truth values for the variables in such a way that the whole formula is true. The SAT problem is one of the most important combinatorial optimization problems, in particular the 3-SAT problem is the,first NP-Complete problem. In order to test sat solving algorithms is necessary to generate hard sat instances, in this paper we address the construction and testing of HyperSAT a sat instance generator based on the concept of hypergraphs.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126365741","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970463
Ding Lixin, Kang Lishan
Implicit parallelism in evolutionary algorithms is discussed. Under the condition of sampling populations with equal probability, an accurate expression of the expected number of different schemata processed by the evolutionary algorithms in each generation is obtained. Moreover, some kinds of the upper and lower bounds of the expected number are estimated.
{"title":"Analysis of implicit parallelism in evolutionary algorithms: a stochastic version","authors":"Ding Lixin, Kang Lishan","doi":"10.1109/ICCIMA.2001.970463","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970463","url":null,"abstract":"Implicit parallelism in evolutionary algorithms is discussed. Under the condition of sampling populations with equal probability, an accurate expression of the expected number of different schemata processed by the evolutionary algorithms in each generation is obtained. Moreover, some kinds of the upper and lower bounds of the expected number are estimated.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134378688","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970445
Jun-ichi Maskawa
A statistical physics model for the collective price changes of stock portfolios is propose; it is an analogue to the spin glass model for a disordered magnetic system. In this model the time series of price changes are coded into the sequences of up and down spins. The Hamiltonian of the system is expressed by long-range spin-spin interactions as in the Sherrington-Kirkpatrick model of spin glass (D. Sherrington and S. Kirkpatrick, 1975). The interaction coefficients between two stocks are determined by empirical data using fluctuation-response theorem. Our theory is applied to price changes of stocks in the Dow-Jones industrial portfolio. Monte Carlo simulations are performed based on the model. The resultant probability distributions of magnetization show good agreement with empirical data.
提出了股票投资组合总体价格变动的统计物理模型;它类似于无序磁系统的自旋玻璃模型。在这个模型中，价格变化的时间序列被编码成上下旋转的序列。系统的哈密顿量由自旋玻璃的Sherrington-Kirkpatrick模型中的远程自旋-自旋相互作用表示(D. Sherrington and S. Kirkpatrick, 1975)。利用波动响应定理，利用经验数据确定了两股之间的相互作用系数。我们的理论被应用于道琼斯工业投资组合中股票的价格变化。在此基础上进行了蒙特卡罗仿真。所得磁化率的概率分布与经验数据吻合较好。
{"title":"Statistical physics model for the collective price fluctuations of portfolios","authors":"Jun-ichi Maskawa","doi":"10.1109/ICCIMA.2001.970445","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970445","url":null,"abstract":"A statistical physics model for the collective price changes of stock portfolios is propose; it is an analogue to the spin glass model for a disordered magnetic system. In this model the time series of price changes are coded into the sequences of up and down spins. The Hamiltonian of the system is expressed by long-range spin-spin interactions as in the Sherrington-Kirkpatrick model of spin glass (D. Sherrington and S. Kirkpatrick, 1975). The interaction coefficients between two stocks are determined by empirical data using fluctuation-response theorem. Our theory is applied to price changes of stocks in the Dow-Jones industrial portfolio. Monte Carlo simulations are performed based on the model. The resultant probability distributions of magnetization show good agreement with empirical data.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122384871","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970504
H. Selvaraj, P. Sapiecha, N. Dhavlikar
The ASIC designs are growing larger everyday. It is very hard to simulate these designs because the simulation time has risen tremendously. An alternate solution is to partition the large design into modules and perform incremental simulation. Hardware Embedded Simulation (HES) is a technology that facilitates incremental design verification of large ASICs. On the other hand, since the introduction of FPGAs, they have been playing an important role in ASIC design cycle. But due to very large size of today's ASIC designs (millions of gates) compared to FPGAs, it is not possible to fit an entire ASIC design into a single FPGA device. This problem can be solved by partitioning the given design into multiple small size designs (modules) and fitting those modules into multiple FPGAs. This paper takes a large RTL design of an ASIC into consideration, analyzes the size of each module in terms of number of CLBs, I/Os, flip-flops, latches and applies the algorithm to partition it automatically into minimum number of FPGAs.
{"title":"Partitioning of large HDL ASIC designs into multiple FPGA devices for prototyping and verification","authors":"H. Selvaraj, P. Sapiecha, N. Dhavlikar","doi":"10.1109/ICCIMA.2001.970504","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970504","url":null,"abstract":"The ASIC designs are growing larger everyday. It is very hard to simulate these designs because the simulation time has risen tremendously. An alternate solution is to partition the large design into modules and perform incremental simulation. Hardware Embedded Simulation (HES) is a technology that facilitates incremental design verification of large ASICs. On the other hand, since the introduction of FPGAs, they have been playing an important role in ASIC design cycle. But due to very large size of today's ASIC designs (millions of gates) compared to FPGAs, it is not possible to fit an entire ASIC design into a single FPGA device. This problem can be solved by partitioning the given design into multiple small size designs (modules) and fitting those modules into multiple FPGAs. This paper takes a large RTL design of an ASIC into consideration, analyzes the size of each module in terms of number of CLBs, I/Os, flip-flops, latches and applies the algorithm to partition it automatically into minimum number of FPGAs.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133874649","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 : 2001-10-30DOI: 10.1109/ICCIMA.2001.970458
K. Yokoyama, T. Shiose, T. Taura
Recently, we have been attempting to solve environmental problems. However, the difficulty of predicting the behavior of a sustainable social system due to its very large size and complexity makes it difficult to realize effective methods of solving environmental problems. A hierarchical model which is composed of a logistics layer and a decision layer is proposed, and an indirect control method for focusing on tax is studied, based on this model. The purpose of the study is to investigate the efficiency of indirect control approaches in a resource circulation system. Finally, the paper discusses the effectiveness of the indirect control method.
{"title":"An indirect control method for sustainable society","authors":"K. Yokoyama, T. Shiose, T. Taura","doi":"10.1109/ICCIMA.2001.970458","DOIUrl":"https://doi.org/10.1109/ICCIMA.2001.970458","url":null,"abstract":"Recently, we have been attempting to solve environmental problems. However, the difficulty of predicting the behavior of a sustainable social system due to its very large size and complexity makes it difficult to realize effective methods of solving environmental problems. A hierarchical model which is composed of a logistics layer and a decision layer is proposed, and an indirect control method for focusing on tax is studied, based on this model. The purpose of the study is to investigate the efficiency of indirect control approaches in a resource circulation system. Finally, the paper discusses the effectiveness of the indirect control method.","PeriodicalId":232504,"journal":{"name":"Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132371404","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
扫码关注我们
求助内容：
应助结果提醒方式：