Broadcasting is an information dissemination process in communication networks whereby a message,... more Broadcasting is an information dissemination process in communication networks whereby a message, originated at any node of a network, is transmitted to all other nodes of the network. In c-broadcasting, each node having the message completes up to c transmissions to its neighbors over the communication lines in one time unit. In a kfault tolerant c-broadcast network, the broadcasting process can be accomplished even if k communication lines fail. This paper presents innovative binary linear programming formulations to construct c-broadcast graphs, k-fault-tolerant c-broadcast graphs, and their time-relaxed versions. The proposed mathematical models are used to generate eight previously unknown minimum c-broadcast graphs, new upper bounds for eleven other instances of the c-broadcast problem, and over 30 minimum k-fault-tolerant c-broadcast graphs. The paper also provides a construction method to produce an upper bound for an infinite family of k-fault-tolerant c-broadcast graphs.
This paper describes an automated vision system for detecting and classifying surface defects on ... more This paper describes an automated vision system for detecting and classifying surface defects on leather fabric. In the defect inspection process, visual defects are located and reported through a two-step segmentation procedure based on thresholding and morphological processing. In the defect classification process, the system utilizes both geometric and statistical features as its feature sets; that is, a new normalized compactness measure, and first-and second-order statistical features. In an effort to maximize the classification efficiency, a three-stage sequential decision-tree classifier is adopted for the classification of five types of defects: lines, holes, stains, wears, and knots. If line defects are identified as a result of classification, they are checked by a line combination algorithm to determine if they are parts of larger line defects and, in such a case, are reported as combined line defects. Satisfactory results were achieved in the classification test with an overall accuracy of 91.25%.
Scheduling of resources and tasks has been a key focus of manufacturing-related problems for many... more Scheduling of resources and tasks has been a key focus of manufacturing-related problems for many years. The research presented here focuses on production routing and scheduling of jobs within a flexible manufacturing cell. The major objective is to develop a two-stage heuristic methodology that minimizes the manufacturing makespan. For the routing phase (Stage I), a modified earliest completion time heuristic is utilized to construct initial feasible sequences. Then, during the sequencing phase (Stage II), a common heuristic is used to determine the makespan value. An illustrative example is given to show that the proposed heuristic methodology is effective in acquiring good solutions for small-to-medium size multi-machine FMC problems.
This study develops the methodology that determines the continuous interval of the potential loca... more This study develops the methodology that determines the continuous interval of the potential locations for a single alternative-fuel refueling station on a tree network, with an objective of maximizing the amount of traffic flows in round trips per time unit captured by the station, if the assumption that positive traffic flows are required is relaxed. The set consisting of all intersection vertices is constructed to check the feasible locations of the network, and the properties of the intersection vertex are discussed. Based on these properties, the finite dominating set that guarantees the optimal locations either on the intersection vertex or the endpoint of the segment that identifies all feasible candidate sites of a single refueling station is derived. Then it goes through the computational complexity of the methodology and extends the optimal solution to some interior line segment
Broadcasting is an information dissemination process in communication networks whereby a message,... more Broadcasting is an information dissemination process in communication networks whereby a message, originated at any node of a network, is transmitted to all other nodes of the network. In c-broadcasting, each node having the message completes up to c transmissions to its neighbors over the communication lines in one time unit. In a kfault tolerant c-broadcast network, the broadcasting process can be accomplished even if k communication lines fail. This paper presents innovative binary linear programming formulations to construct c-broadcast graphs, k-fault-tolerant c-broadcast graphs, and their time-relaxed versions. The proposed mathematical models are used to generate eight previously unknown minimum c-broadcast graphs, new upper bounds for eleven other instances of the c-broadcast problem, and over 30 minimum k-fault-tolerant c-broadcast graphs. The paper also provides a construction method to produce an upper bound for an infinite family of k-fault-tolerant c-broadcast graphs.
This paper describes an automated vision system for detecting and classifying surface defects on ... more This paper describes an automated vision system for detecting and classifying surface defects on leather fabric. In the defect inspection process, visual defects are located and reported through a two-step segmentation procedure based on thresholding and morphological processing. In the defect classification process, the system utilizes both geometric and statistical features as its feature sets; that is, a new normalized compactness measure, and first-and second-order statistical features. In an effort to maximize the classification efficiency, a three-stage sequential decision-tree classifier is adopted for the classification of five types of defects: lines, holes, stains, wears, and knots. If line defects are identified as a result of classification, they are checked by a line combination algorithm to determine if they are parts of larger line defects and, in such a case, are reported as combined line defects. Satisfactory results were achieved in the classification test with an overall accuracy of 91.25%.
Scheduling of resources and tasks has been a key focus of manufacturing-related problems for many... more Scheduling of resources and tasks has been a key focus of manufacturing-related problems for many years. The research presented here focuses on production routing and scheduling of jobs within a flexible manufacturing cell. The major objective is to develop a two-stage heuristic methodology that minimizes the manufacturing makespan. For the routing phase (Stage I), a modified earliest completion time heuristic is utilized to construct initial feasible sequences. Then, during the sequencing phase (Stage II), a common heuristic is used to determine the makespan value. An illustrative example is given to show that the proposed heuristic methodology is effective in acquiring good solutions for small-to-medium size multi-machine FMC problems.
This study develops the methodology that determines the continuous interval of the potential loca... more This study develops the methodology that determines the continuous interval of the potential locations for a single alternative-fuel refueling station on a tree network, with an objective of maximizing the amount of traffic flows in round trips per time unit captured by the station, if the assumption that positive traffic flows are required is relaxed. The set consisting of all intersection vertices is constructed to check the feasible locations of the network, and the properties of the intersection vertex are discussed. Based on these properties, the finite dominating set that guarantees the optimal locations either on the intersection vertex or the endpoint of the segment that identifies all feasible candidate sites of a single refueling station is derived. Then it goes through the computational complexity of the methodology and extends the optimal solution to some interior line segment
Uploads
Papers by Jose Ventura