Propositional satisfiability problem (SAT) is a well-known NP-complete problem. It can be categorized as NP-complete because it has a phase transition point between satisfiable or unsatisfiable. Instances within the p...
详细信息
Propositional satisfiability problem (SAT) is a well-known NP-complete problem. It can be categorized as NP-complete because it has a phase transition point between satisfiable or unsatisfiable. Instances within the phase transition region are hard to solve. To reduce computation time in this region, we designed and implemented a Fail Detection (FD) technique in solving 3-SAT. To simplify implementation procedure, constraint programming is used as the core of the solver because a set of utility is already well developed. As we concern about the robustness of our technique, a large-scale experiment with wide spectrum of random generated 3-SAT instances as test cases is run. To figure out the efficiency of our technique, existing approaches such as Davis-Putnam procedure (DP) and Jeroslow-Wang heuristic used in Davis-Putnam procedure (DP+JW) are tested together with Fail Detection technique (i.e., DP+FD and DP+JW+FD) using the same set of random generated uniform 3-SAT instances. Statistical results show that our DP+JW+FD approach is able to gain up to 63% reduction in computation complexity compare with DP and the effect of hard problem in phase transition region is also significantly reduced.
Most edge detection algorithms include three main stages: smoothing, differentiation, and labeling. In this paper, we evaluate the performance of algorithms in which competitive learning is applied first to enhance ed...
详细信息
ISBN:
(纸本)1604238216
Most edge detection algorithms include three main stages: smoothing, differentiation, and labeling. In this paper, we evaluate the performance of algorithms in which competitive learning is applied first to enhance edges, followed by an edge detector to locate the edges. In this way, more detailed and relatively more unbroken edges can be found as compared to the results when an edge detector is applied alone. The algorithms compared are K-Means, SOM and SOGR for clustering, and Canny and GED for edge detection. Perceptionally, best results were obtained with the GED-SOGR algorithm. The SOGR is also considerably simpler and faster than the SOM algorithm.
In this paper, we discuss edge detection by first using a clustering algorithm followed by a known edge detection filter such as Canny or Generalized Edge Detector (GED). We developed a new clustering method called Se...
详细信息
The design and development of survey scheme for teaching diversity skills to students in the technological sector and promote diversity was discussed. The survey began with a positive statement about diversity and cre...
详细信息
The design and development of survey scheme for teaching diversity skills to students in the technological sector and promote diversity was discussed. The survey began with a positive statement about diversity and created a scenario in which the respondents drew on a statement to make a hypothetical decision concerning hiring. A single survey question was run for two different groups of people mainly the ASEE conference and the second group being well versed with diversity issues. In both the cases the resulting discussion was useful in sparking comments.
Most edge detection algorithms include three main stages: smoothing, differentiation, and labeling. In this paper, we evaluate the performance of algorithms in which competitive learning is applied first to enhance ed...
详细信息
Most edge detection algorithms include three main stages: smoothing, differentiation, and labeling. In this paper, we evaluate the performance of algorithms in which competitive learning is applied first to enhance edges, followed by an edge detector to locate the edges. In this way, more detailed and relatively more unbroken edges can be found as compared to the results when an edge detector is applied alone. The algorithms compared are K-Means, SOM and SOGR for clustering, and Canny and GED for edge detection. Perceptionally, best results were obtained with the GED-SOGR algorithm. The SOGR is also considerably simpler and faster than the SOM algorithm.
MC-CDMA is currently being investigated by many researchers as a promising candidate for future generations of wireless systems due to robustness to frequency selective fading, high spectral efficiency, and higher fle...
详细信息
MC-CDMA is currently being investigated by many researchers as a promising candidate for future generations of wireless systems due to robustness to frequency selective fading, high spectral efficiency, and higher flexibility. However, the main drawback is the high peak to average power ratio (PAPR). In this paper, a method has been proposed to reduce PAPR in synchronous downlink MC-CDMA through signal mapping and code selection. Simulation results show that PAPR can be reduced significantly proportional to an increase of the number of different phase sequences.
A novel microwave nondestructive testing technique is presented for breast cancer detection. A method utilizing the reflection coefficient at the aperture of a waveguide sensor radiating into a breast is described res...
详细信息
A novel microwave nondestructive testing technique is presented for breast cancer detection. A method utilizing the reflection coefficient at the aperture of a waveguide sensor radiating into a breast is described resulting in theoretical microwave images that clearly indicate the presence of a tumor. These images demonstrate the feasibility of detecting breast tumors using this approach
A cache replacement policy which takes the transcoding time into account in making replacement decisions, for the emerging transcoding proxy servers is proposed. Simulation results show the proposed policy outperforms...
详细信息
A cache replacement policy which takes the transcoding time into account in making replacement decisions, for the emerging transcoding proxy servers is proposed. Simulation results show the proposed policy outperforms the conventional LRU in both the cache hit rate and the average object transcoding time.
Intelligence Preparation of the Battlespace (IPB) is a predominantly "gray matter-based" fusion and information synthesis process conducted to predict possible future adversary courses of action. The purpose...
详细信息
暂无评论