In the study of oriented bounding boxes(OBB)object detection in high-resolution remote sensing images,the problem of missed and wrong detection of small targets occurs because the targets are too small and have differ...In the study of oriented bounding boxes(OBB)object detection in high-resolution remote sensing images,the problem of missed and wrong detection of small targets occurs because the targets are too small and have different orientations.Existing OBB object detection for remote sensing images,although making good progress,mainly focuses on directional modeling,while less consideration is given to the size of the object as well as the problem of missed detection.In this study,a method based on improved YOLOv8 was proposed for detecting oriented objects in remote sensing images,which can improve the detection precision of oriented objects in remote sensing images.Firstly,the ResCBAMG module was innovatively designed,which could better extract channel and spatial correlation information.Secondly,the innovative top-down feature fusion layer network structure was proposed in conjunction with the Efficient Channel Attention(ECA)attention module,which helped to capture inter-local cross-channel interaction information appropriately.Finally,we introduced an innovative ResCBAMG module between the different C2f modules and detection heads of the bottom-up feature fusion layer.This innovative structure helped the model to better focus on the target area.The precision and robustness of oriented target detection were also improved.Experimental results on the DOTA-v1.5 dataset showed that the detection Precision,mAP@0.5,and mAP@0.5:0.95 metrics of the improved model are better compared to the original model.This improvement is effective in detecting small targets and complex scenes.展开更多
Based on the TRMM dataset, this paper compares the applicability of the improved MCE(minimum circumscribed ellipse), MBR(minimum bounding rectangle), and DIA(direct indexing area) methods for rain cell fitting. These ...Based on the TRMM dataset, this paper compares the applicability of the improved MCE(minimum circumscribed ellipse), MBR(minimum bounding rectangle), and DIA(direct indexing area) methods for rain cell fitting. These three methods can reflect the geometric characteristics of clouds and apply geometric parameters to estimate the real dimensions of rain cells. The MCE method shows a major advantage in identifying the circumference of rain cells. The circumference of rain cells identified by MCE in most samples is smaller than that identified by DIA and MBR, and more similar to the observed rain cells. The area of rain cells identified by MBR is relatively robust. For rain cells composed of many pixels(N> 20), the overall performance is better than that of MCE, but the contribution of MBR to the best identification results,which have the shortest circumference and the smallest area, is less than that of MCE. The DIA method is best suited to small rain cells with a circumference of less than 100 km and an area of less than 120 km^(2), but the overall performance is mediocre. The MCE method tends to achieve the highest success at any angle, whereas there are fewer “best identification”results from DIA or MBR and more of the worst ones in the along-track direction and cross-track direction. Through this comprehensive comparison, we conclude that MCE can obtain the best fitting results with the shortest circumference and the smallest area on behalf of the high filling effect for all sizes of rain cells.展开更多
Helicopters are widely used in maritime Search and Rescue(SAR) missions. To ensure the success of SAR missions, search areas need to be carefully planned. With the development of computer technology and weather foreca...Helicopters are widely used in maritime Search and Rescue(SAR) missions. To ensure the success of SAR missions, search areas need to be carefully planned. With the development of computer technology and weather forecast technology, the survivors’ drift trajectories can be predicted more precisely, which strongly supports the planning of search areas for the rescue helicopter. However, the methods used to determine the search area based on the predicted drift trajectories are mainly derived from the continuous expansion of the area with the highest Probability of Containment(POC), which may lead to local optimal solutions and a decrease in the Probability of Success(POS), especially when there are several subareas with a high POC. To address this problem, this paper proposes a method based on a Minimum Bounding Rectangle and Kmeans clustering(MBRK). A silhouette coefficient is adopted to analyze the distribution of the survivors’ probable locations, which are divided into multiple clusters with K-means clustering. Then,probability maps are generated based on the minimum bounding rectangle of each cluster. By adding or subtracting one row or column of cells or shifting the planned search area, 12 search methods are used to generate the optimal search area starting from the cell with the highest POC in each probability map. Taking a real case as an example, the simulation experiment results show that the POS values obtained by the MBRK method are higher than those obtained by other methods,which proves that the MBRK method can effectively support the planning of search areas and that K-means clustering improves the POS of search plans.展开更多
Relay attack is one of the most threatening challenges against radio frequency identification（RFID） now. Distance bounding protocols have been introduced to thwart relay attacks. They form a family of challenge-resp...Relay attack is one of the most threatening challenges against radio frequency identification（RFID） now. Distance bounding protocols have been introduced to thwart relay attacks. They form a family of challenge-response authentication protocols and confirm the round-trip time at the Rapid Bit Exchange phase. They enable a reader to authenticate and to establish an upper bound on the physical distance to an entrusted tag. We design an effective attack against a family of such protocols to launch the spoofing attacks within effective distance successfully, which demonstrates that existing protocols cannot eliminate such attacks completely. The thesis proposes a new program with time- stamping verification to correct the defect and verify the effectiveness.展开更多
Visualization of simulated crop growth and development is of significant interest to crop research and production. This study aims to address the phenomenon of organs cross-drawing by developing a method of collision ...Visualization of simulated crop growth and development is of significant interest to crop research and production. This study aims to address the phenomenon of organs cross-drawing by developing a method of collision detection for improving vivid 3D visualizations of virtual wheat crops. First, the triangular data of leaves are generated with the tessellation of non-uniform rational B-splines surfaces. Second, the bounding volumes（BVs） and bounding volume hierarchies（BVHs） of leaves are constructed based on the leaf morphological characteristics and the collision detection of two leaves are performed using the Separating Axis Theorem. Third, the detecting effect of the above method is compared with the methods of traditional BVHs, Axis-Aligned Bounding Box（AABB） tree, and Oriented Bounding Box（OBB） tree. Finally, the BVs of other organs（ear, stem, and leaf sheath） in virtual wheat plant are constructed based on their geometric morphology, and the collision detections are conducted at the organ, individual and population scales. The results indicate that the collision detection method developed in this study can accurately detect collisions between organs, especially at the plant canopy level with high collision frequency. This collision detection-based virtual crop visualization method could reduce the phenomenon of organs cross-drawing effectively and enhance the reality of visualizations.展开更多
A shape hardening function is developed that improves the predictive capabilities of the generalized bounding surface model for cohesive soils, especially when applied to overconsolidated specimens. This improvement i...A shape hardening function is developed that improves the predictive capabilities of the generalized bounding surface model for cohesive soils, especially when applied to overconsolidated specimens. This improvement is realized without any changes to the simple elliptical shape of the bounding surface, and actually reduces the number of parameters associated with the model by one.展开更多
Ground-penetrating radar and trenching studies of a barrier spit on the north shore of Huangqihai Lake were made,that reveal important implications for the coastal washover barrier boundary hierarchy and interpretatio...Ground-penetrating radar and trenching studies of a barrier spit on the north shore of Huangqihai Lake were made,that reveal important implications for the coastal washover barrier boundary hierarchy and interpretations of this depositional record.A four-fold hierarchy bounding-surface model,representing different levels of impact and genesis,is defined.Each level of the hierarchy is enclosed by a distinct kind of surface characterized by different ground-penetrating radar reflection features,sedimentary characteristics(color,grain size,sorting,rounding and sedimentary structures) and origin.We suggest that this hierarchical model can be applied to any coastal washover barrier deposits.展开更多
Hierarchical adaptive bounding setting （HABS）, a novel algorithm to reduce potentially visible set, is designed to be Used for various geometry shape character in complex simulation scene to greatly improve geometry...Hierarchical adaptive bounding setting （HABS）, a novel algorithm to reduce potentially visible set, is designed to be Used for various geometry shape character in complex simulation scene to greatly improve geometry spatial storage precision. A spatial hierarchy tree is used to represent the topology of the model, and then the visibility geometry set from the viewpoint is determined by processing the hierarchy tree and frustum detection. In this process, HABS improves the viewpoint-to-region visibility detection efficiently. The algorithm is well-suited for complex models whose shape characters are various.展开更多
This paper presents the development of a mesoscale self-contained quadruped mobile robot that employs two pieces of piezocomposite actuators for the bounding locomotion.The design of the robot leg is inspired by legge...This paper presents the development of a mesoscale self-contained quadruped mobile robot that employs two pieces of piezocomposite actuators for the bounding locomotion.The design of the robot leg is inspired by legged insects and animals, and the biomimetic concept is implemented in the robot in a simplified form,such that each leg of the robot has only one degree of freedom.The lack of degree of freedom is compensated by a slope of the robot frame relative to the horizontal plane.For the implementation of the self-contained mobile robot,a small power supply circuit is designed and installed on the robot.Experimental results show that the robot can locomote at about 50 mm·s^(-1)with the circuit on board,which can be considered as a significant step toward the goal of building an autonomous legged robot actuated by piezoelectric actuators.展开更多
This paper proposes a pedestrian tracking approach using bounding box based on probability densities.It is generally a difficult task to track features like corner points in outdoor images due to complex environment.T...This paper proposes a pedestrian tracking approach using bounding box based on probability densities.It is generally a difficult task to track features like corner points in outdoor images due to complex environment.To solve this problem,the feature points are projected along X and Y direction separately,and a histogram is constructed for each projection,with horizontal axis as positions and vertical axis as the number of feature points that lie on each position.Finally,the vertical axis is normalized for expression as probability.After histogram is constructed,the probability of each feature point is checked with a threshold.A feature point will be ignored if its probability is lower than a threshold,while the remaining feature points are grouped,based on which a bounding box is made.Kanade-Lucas Tomasi(KLT)algorithm is adopted as the tracking algorithm because it is able to track local features in images robustly.The efficiency of the tracking results using this method is verified in real environment test.展开更多
Congestion is a dynamic phenomenon and hence efficiently computing alternate shortest route can only help expedite decongestion. This research is aimed to efficiently compute shortest path for road traffic network so ...Congestion is a dynamic phenomenon and hence efficiently computing alternate shortest route can only help expedite decongestion. This research is aimed to efficiently compute shortest path for road traffic network so that congestion can be eased resulting in reduced CO2 emission and improved economy. Congestion detection is achieved after evaluating road capacity and road occupancy. Congestion index, a ratio of road occupancy to road capacity is computed, congestion index higher than 0.6 necessitates computation of alternate shortest route. Various algorithms offer shortest alternate route. The paper discusses minimization of graph based by removing redundant nodes which don’t play a role in computation of shortest path. The proposal is based on continuous definition of a bounding box every time a next neighboring node is considered. This reduces maximum number of contentious nodes repeatedly and optimizes the network. The algorithm is deployed from both the ends sequentially to ensure zero error and validate the shortest path discovery. While discovering shortest path, the algorithm also offers an array of shortest path in ascending order of the path length. However, vehicular traffic exhibits network duality viz. static and dynamic network graphs. Shortest route for static distance graph is pre-computed and stored for look-up, alternate shortest path based on assignment of congestion levels to edge weights is triggered by congestion index. The research also supports directed graphs to address traffic rules for lanes having unidirectional and bidirectional traffic.展开更多
Ky Fan trace theorems and the interlacing theorems of Cauchy and Poincaré are important observations that characterize Hermitian matrices. In this note, we introduce a new type of inequalities which extend these ...Ky Fan trace theorems and the interlacing theorems of Cauchy and Poincaré are important observations that characterize Hermitian matrices. In this note, we introduce a new type of inequalities which extend these theorems. The new inequalities are obtained from the old ones by replacing eigenvalues and diagonal entries with their moduli. This modification yields effective bounding inequalities which are valid on a larger range of matrices.展开更多
A robust fault diagnosis approach is developed by incorporating a set-membership identification (SMI) method. A class of systems with linear models in the form of fault related parameters is investigated, with model u...A robust fault diagnosis approach is developed by incorporating a set-membership identification (SMI) method. A class of systems with linear models in the form of fault related parameters is investigated, with model uncertainties and parameter variations taken into account explicitly and treated as bounded errors. An ellipsoid bounding set-membership identification algorithm is proposed to propagate bounded uncertainties rigorously and the guaranteed feasible set of faults parameters enveloping true parameter values is given. Faults arised from abrupt parameter variations can be detected and isolated on-line by consistency check between predicted and observed parameter sets obtained in the identification procedure. The proposed approach provides the improved robustness with its ability to distinguish real faults from model uncertainties, which comes with the inherent guaranteed robustness of the set-membership framework. Efforts are also made in this work to balance between conservativeness and computation complexity of the overall algorithm. Simulation results for the mobile robot with several slipping faults scenarios demonstrate the correctness of the proposed approach for faults detection and isolation (FDI).展开更多
We study the scattering process of photons confined in a one-dimensional optical waveguide by a laser controlled atomic ensemble. The investigation leads to an alternative setup of quantum node controlling the coheren...We study the scattering process of photons confined in a one-dimensional optical waveguide by a laser controlled atomic ensemble. The investigation leads to an alternative setup of quantum node controlling the coherent transfer of single photon in such one dimensional continuum. To exactly solve the effective scattering equations by using the discrete coordinate approach, we simulate the linear waveguide as a coupled resonator array at the high energy limit. We generally calculate the transmission eoet^cients and its vanishing at resonance reflects the good controllability of our scheme. We also show that there exist two bound states to describe the localize photons around the cavity.展开更多
文摘In the study of oriented bounding boxes(OBB)object detection in high-resolution remote sensing images,the problem of missed and wrong detection of small targets occurs because the targets are too small and have different orientations.Existing OBB object detection for remote sensing images,although making good progress,mainly focuses on directional modeling,while less consideration is given to the size of the object as well as the problem of missed detection.In this study,a method based on improved YOLOv8 was proposed for detecting oriented objects in remote sensing images,which can improve the detection precision of oriented objects in remote sensing images.Firstly,the ResCBAMG module was innovatively designed,which could better extract channel and spatial correlation information.Secondly,the innovative top-down feature fusion layer network structure was proposed in conjunction with the Efficient Channel Attention(ECA)attention module,which helped to capture inter-local cross-channel interaction information appropriately.Finally,we introduced an innovative ResCBAMG module between the different C2f modules and detection heads of the bottom-up feature fusion layer.This innovative structure helped the model to better focus on the target area.The precision and robustness of oriented target detection were also improved.Experimental results on the DOTA-v1.5 dataset showed that the detection Precision,mAP@0.5,and mAP@0.5:0.95 metrics of the improved model are better compared to the original model.This improvement is effective in detecting small targets and complex scenes.
基金supported by the National Natural Science Foundation of China (Grant Nos. U20A2097,42075087, 91837310)the National Key Research and Development Program of China (Grant No. 2021YFC3000902)。
文摘Based on the TRMM dataset, this paper compares the applicability of the improved MCE(minimum circumscribed ellipse), MBR(minimum bounding rectangle), and DIA(direct indexing area) methods for rain cell fitting. These three methods can reflect the geometric characteristics of clouds and apply geometric parameters to estimate the real dimensions of rain cells. The MCE method shows a major advantage in identifying the circumference of rain cells. The circumference of rain cells identified by MCE in most samples is smaller than that identified by DIA and MBR, and more similar to the observed rain cells. The area of rain cells identified by MBR is relatively robust. For rain cells composed of many pixels(N> 20), the overall performance is better than that of MCE, but the contribution of MBR to the best identification results,which have the shortest circumference and the smallest area, is less than that of MCE. The DIA method is best suited to small rain cells with a circumference of less than 100 km and an area of less than 120 km^(2), but the overall performance is mediocre. The MCE method tends to achieve the highest success at any angle, whereas there are fewer “best identification”results from DIA or MBR and more of the worst ones in the along-track direction and cross-track direction. Through this comprehensive comparison, we conclude that MCE can obtain the best fitting results with the shortest circumference and the smallest area on behalf of the high filling effect for all sizes of rain cells.
文摘Helicopters are widely used in maritime Search and Rescue(SAR) missions. To ensure the success of SAR missions, search areas need to be carefully planned. With the development of computer technology and weather forecast technology, the survivors’ drift trajectories can be predicted more precisely, which strongly supports the planning of search areas for the rescue helicopter. However, the methods used to determine the search area based on the predicted drift trajectories are mainly derived from the continuous expansion of the area with the highest Probability of Containment(POC), which may lead to local optimal solutions and a decrease in the Probability of Success(POS), especially when there are several subareas with a high POC. To address this problem, this paper proposes a method based on a Minimum Bounding Rectangle and Kmeans clustering(MBRK). A silhouette coefficient is adopted to analyze the distribution of the survivors’ probable locations, which are divided into multiple clusters with K-means clustering. Then,probability maps are generated based on the minimum bounding rectangle of each cluster. By adding or subtracting one row or column of cells or shifting the planned search area, 12 search methods are used to generate the optimal search area starting from the cell with the highest POC in each probability map. Taking a real case as an example, the simulation experiment results show that the POS values obtained by the MBRK method are higher than those obtained by other methods,which proves that the MBRK method can effectively support the planning of search areas and that K-means clustering improves the POS of search plans.
基金Supported by the National Natural Science Foundation of China(61332019)
文摘Relay attack is one of the most threatening challenges against radio frequency identification（RFID） now. Distance bounding protocols have been introduced to thwart relay attacks. They form a family of challenge-response authentication protocols and confirm the round-trip time at the Rapid Bit Exchange phase. They enable a reader to authenticate and to establish an upper bound on the physical distance to an entrusted tag. We design an effective attack against a family of such protocols to launch the spoofing attacks within effective distance successfully, which demonstrates that existing protocols cannot eliminate such attacks completely. The thesis proposes a new program with time- stamping verification to correct the defect and verify the effectiveness.
基金supported by the National High-Tech Research and Development Program of China (2013AA102404)the National Science Fund for Distinguished Young Scholars, China (31725020)+1 种基金the Priority Academic Program Development of Jiangsu Higher Education Institutions (PAPD),Chinathe 111 Project, China (B16026)
文摘Visualization of simulated crop growth and development is of significant interest to crop research and production. This study aims to address the phenomenon of organs cross-drawing by developing a method of collision detection for improving vivid 3D visualizations of virtual wheat crops. First, the triangular data of leaves are generated with the tessellation of non-uniform rational B-splines surfaces. Second, the bounding volumes（BVs） and bounding volume hierarchies（BVHs） of leaves are constructed based on the leaf morphological characteristics and the collision detection of two leaves are performed using the Separating Axis Theorem. Third, the detecting effect of the above method is compared with the methods of traditional BVHs, Axis-Aligned Bounding Box（AABB） tree, and Oriented Bounding Box（OBB） tree. Finally, the BVs of other organs（ear, stem, and leaf sheath） in virtual wheat plant are constructed based on their geometric morphology, and the collision detections are conducted at the organ, individual and population scales. The results indicate that the collision detection method developed in this study can accurately detect collisions between organs, especially at the plant canopy level with high collision frequency. This collision detection-based virtual crop visualization method could reduce the phenomenon of organs cross-drawing effectively and enhance the reality of visualizations.
基金supported by the Fulbright Colombia-Colciencias Scholarship and Universidad Militar Nueva Granada
文摘A shape hardening function is developed that improves the predictive capabilities of the generalized bounding surface model for cohesive soils, especially when applied to overconsolidated specimens. This improvement is realized without any changes to the simple elliptical shape of the bounding surface, and actually reduces the number of parameters associated with the model by one.
基金Supported by the Specialized Research Fund for the Doctoral Program of Higher Education of China(No.20120022130002)the State Scholarship Fund from the China Scholarship Council(No.201406400030)
文摘Ground-penetrating radar and trenching studies of a barrier spit on the north shore of Huangqihai Lake were made,that reveal important implications for the coastal washover barrier boundary hierarchy and interpretations of this depositional record.A four-fold hierarchy bounding-surface model,representing different levels of impact and genesis,is defined.Each level of the hierarchy is enclosed by a distinct kind of surface characterized by different ground-penetrating radar reflection features,sedimentary characteristics(color,grain size,sorting,rounding and sedimentary structures) and origin.We suggest that this hierarchical model can be applied to any coastal washover barrier deposits.
文摘Hierarchical adaptive bounding setting （HABS）, a novel algorithm to reduce potentially visible set, is designed to be Used for various geometry shape character in complex simulation scene to greatly improve geometry spatial storage precision. A spatial hierarchy tree is used to represent the topology of the model, and then the visibility geometry set from the viewpoint is determined by processing the hierarchy tree and frustum detection. In this process, HABS improves the viewpoint-to-region visibility detection efficiently. The algorithm is well-suited for complex models whose shape characters are various.
基金supported by Korea Research Foundation grant(KRF-2006-005-J03303)and Seoul R&BD Program
文摘This paper presents the development of a mesoscale self-contained quadruped mobile robot that employs two pieces of piezocomposite actuators for the bounding locomotion.The design of the robot leg is inspired by legged insects and animals, and the biomimetic concept is implemented in the robot in a simplified form,such that each leg of the robot has only one degree of freedom.The lack of degree of freedom is compensated by a slope of the robot frame relative to the horizontal plane.For the implementation of the self-contained mobile robot,a small power supply circuit is designed and installed on the robot.Experimental results show that the robot can locomote at about 50 mm·s^(-1)with the circuit on board,which can be considered as a significant step toward the goal of building an autonomous legged robot actuated by piezoelectric actuators.
基金the MKE(The Ministry of Knowledge Economy),Korea,under the ITRC(Infor mation Technology Research Center)support program supervised by the NIPA(National IT Industry Promotion Agency)(NIPA-2012-H0301-12-2006)The Brain Korea 21 Project in 2012
文摘This paper proposes a pedestrian tracking approach using bounding box based on probability densities.It is generally a difficult task to track features like corner points in outdoor images due to complex environment.To solve this problem,the feature points are projected along X and Y direction separately,and a histogram is constructed for each projection,with horizontal axis as positions and vertical axis as the number of feature points that lie on each position.Finally,the vertical axis is normalized for expression as probability.After histogram is constructed,the probability of each feature point is checked with a threshold.A feature point will be ignored if its probability is lower than a threshold,while the remaining feature points are grouped,based on which a bounding box is made.Kanade-Lucas Tomasi(KLT)algorithm is adopted as the tracking algorithm because it is able to track local features in images robustly.The efficiency of the tracking results using this method is verified in real environment test.
文摘Congestion is a dynamic phenomenon and hence efficiently computing alternate shortest route can only help expedite decongestion. This research is aimed to efficiently compute shortest path for road traffic network so that congestion can be eased resulting in reduced CO2 emission and improved economy. Congestion detection is achieved after evaluating road capacity and road occupancy. Congestion index, a ratio of road occupancy to road capacity is computed, congestion index higher than 0.6 necessitates computation of alternate shortest route. Various algorithms offer shortest alternate route. The paper discusses minimization of graph based by removing redundant nodes which don’t play a role in computation of shortest path. The proposal is based on continuous definition of a bounding box every time a next neighboring node is considered. This reduces maximum number of contentious nodes repeatedly and optimizes the network. The algorithm is deployed from both the ends sequentially to ensure zero error and validate the shortest path discovery. While discovering shortest path, the algorithm also offers an array of shortest path in ascending order of the path length. However, vehicular traffic exhibits network duality viz. static and dynamic network graphs. Shortest route for static distance graph is pre-computed and stored for look-up, alternate shortest path based on assignment of congestion levels to edge weights is triggered by congestion index. The research also supports directed graphs to address traffic rules for lanes having unidirectional and bidirectional traffic.
文摘Ky Fan trace theorems and the interlacing theorems of Cauchy and Poincaré are important observations that characterize Hermitian matrices. In this note, we introduce a new type of inequalities which extend these theorems. The new inequalities are obtained from the old ones by replacing eigenvalues and diagonal entries with their moduli. This modification yields effective bounding inequalities which are valid on a larger range of matrices.
基金supported by the National Natural Science Foundation of China(616732546157310061573101)
文摘A robust fault diagnosis approach is developed by incorporating a set-membership identification (SMI) method. A class of systems with linear models in the form of fault related parameters is investigated, with model uncertainties and parameter variations taken into account explicitly and treated as bounded errors. An ellipsoid bounding set-membership identification algorithm is proposed to propagate bounded uncertainties rigorously and the guaranteed feasible set of faults parameters enveloping true parameter values is given. Faults arised from abrupt parameter variations can be detected and isolated on-line by consistency check between predicted and observed parameter sets obtained in the identification procedure. The proposed approach provides the improved robustness with its ability to distinguish real faults from model uncertainties, which comes with the inherent guaranteed robustness of the set-membership framework. Efforts are also made in this work to balance between conservativeness and computation complexity of the overall algorithm. Simulation results for the mobile robot with several slipping faults scenarios demonstrate the correctness of the proposed approach for faults detection and isolation (FDI).
基金Supported by the Natural Science Foundation of China under Grant Nos.10775048,10704023,10775048,and 10325523the National Fundamental Research Program of China under Grant No.2007CB925204the Scientific Research Fund of Hunan Provincial Education Department of China under Grant No.07C579
文摘We study the scattering process of photons confined in a one-dimensional optical waveguide by a laser controlled atomic ensemble. The investigation leads to an alternative setup of quantum node controlling the coherent transfer of single photon in such one dimensional continuum. To exactly solve the effective scattering equations by using the discrete coordinate approach, we simulate the linear waveguide as a coupled resonator array at the high energy limit. We generally calculate the transmission eoet^cients and its vanishing at resonance reflects the good controllability of our scheme. We also show that there exist two bound states to describe the localize photons around the cavity.
