Existence of u‐Representation of Graphs

Recently, Jones et al. (Electron J Comb 22(2) (2015), #P2.53) introduced the study of u‐representable graphs, where u is a word over containing at least one 1. The notion of a u‐representable graph is a far‐reaching generalization of the notion of a word‐representable graph studied in the literature in a series of papers. Jones et al. have shown that any graph is 11???1‐representable assuming that the number of 1s is at least three, while the class of 12‐representable graphs is properly contained in the class of comparability graphs, which, in turn, is properly contained in the class of word‐representable graphs corresponding to 11‐representable graphs. Further studies in this direction were conducted by Nabawanda (M.Sc. thesis, 2015), who has shown, in particular, that the class of 112‐representable graphs is not included in the class of word‐representable graphs. Jones et al. raised a question on classification of u‐representable graphs at least for small values of u . In this article, we show that if u is of length at least 3 then any graph is u‐representable. This rather unexpected result shows that from existence of representation point of view there are only two interesting nonequivalent cases in the theory of u‐representable graphs, namely, those of and .     

新型综合船桥系统

综合船桥系统是实施船舶导航和控制的集成系统,它通过相互连接以集中使用来自工作站的传感器信息、命令或控制以提高操作人员管理船舶的安全性和效率.文中分析了综合船桥系统设备配置,研究了综合船桥系统的关键技术,基于综合船桥系统的体系结构和信息流程开发了综合船桥系统,并进行了系统测试与联调.试验结果表明,综合船桥系统具有导航、驾驶、航行监测、避碰和报警等功能,通过系统集成对船舶周围的航行态势进行监控,保证了船舶的航行安全.     

一种基于Dijkstra算法的机器人避障问题路径规划

移动机器人的避障问题是移动机器人控制领域的研究热点.针对给定的移动机器人避障问题,探讨了最短路径及最短时间路径的路径规划问题.对于最短路径问题,建立了简化的路径网格模型,将其抽象为由节点及边构成的两维图,再使用经典的Dijkstra算法获得可行的最短路径.对于最短时间路径问题,通过分析移动机器人弯道运行的速度曲线,基于几何方法得出了移动时间与过渡圆弧圆心之间严格的数学关系,此后借助MATLAB优化函数获得最佳的移动路径.算法可为类似机器人避障问题的解决提供借鉴.     

Inversion polynomials for 321-avoiding permutations

We prove a generalization of a conjecture of Dokos, Dwyer, Johnson, Sagan, and Selsor giving a recursion for the inversion polynomial of 321-avoiding permutations. We also answer a question they posed about finding a recursive formula for the major index polynomial of 321-avoiding permutations. Other properties of these polynomials are investigated as well. Our tools include Dyck and 2-Motzkin paths, polyominoes, and continued fractions.     

Ultra-low power anti-crosstalk collision avoidance light detection and ranging using chaotic pulse position modulation approach

A novel concept of collision avoidance single-photon light detection and ranging(LIDAR) for vehicles has been demonstrated, in which chaotic pulse position modulation is applied on the transmitted laser pulses for robust anti-crosstalk purposes. Besides, single-photon detectors(SPD) and time correlated single photon counting techniques are adapted, to sense the ultra-low power used for the consideration of compact structure and eye safety. Parameters including pulse rate, discrimination threshold, and number of accumulated pulses have been thoroughly analyzed based on the detection requirements, resulting in specified receiver operating characteristics curves. Both simulation and indoor experiments were performed to verify the excellent anti-crosstalk capability of the presented collision avoidance LIDAR despite ultra-low transmitting power.     

振动驱动移动系统平面避障运动分析

近年来,工业机器人的应用领域日益广泛,可移动机器人的发展备受关注,为了在一些复杂环境中准确地完成作业,学者们提出并研究了振动驱动移动系统.本文研究了在各向异性黏性摩擦环境中一类有两个在平行轨道内做正弦运动的内部质量块的振动驱动移动系统的运动规律,提出了使系统完成包括避障等规定作业的驱动设计方法.首先利用第二类拉格朗日方程,建立了系统的动力学方程;然后,利用速度Verlet积分法分析了系统的运动规律,得到了内部驱动参数与系统运动轨迹、运动速度的关系;最后,结合振动驱动移动系统的运动规律,提出了使系统沿预设路径运动和实现避障运动的驱动设计方法.通过曲线离散得到了系统沿预设路径运动的移动轨迹,进而通过改变内部质量块的驱动参数,使系统沿预设路径运动.为了使移动系统在障碍物环境中达到目标位置,提出了结合栅格法,Floyd算法及最小顶点圆法的优化的路径规划计算方法,得到了振动驱动移动系统在障碍物环境中运动的最优路径,并通过改变内部质量块的驱动参数实现了移动系统的避障运动.     

关于七元统计量模式避免Fishburn排列的计数

Fishburn 排列与许多重要组合结构包括区间序存在双射. 在这篇论文中, 我们利用生成树的方法, 得到两类模式避免Fishburn排列的关于7元经典统计量的生成函数.我们考虑的类别是避免 (321,312) 和 (321,4123) 模式的 Fishburn 排列.我们关注的统计量包括升序数、降序数、逆序数、从右到左的极大值、从右到左的极小值、从左到右的极大值和从左到右的极小值。我们的结果推广了 Egge 的一个结论.     

ON AVOIDANCE ACTIVITIES IN FISHERY ENFORCEMENT MODELS

Compliance and enforcement in fisheries are important issues from an economic point of view since management measures are useless without a certain level of enforcement. These conclusions come from the well‐established theoretical literature on compliance and enforcement problems within fisheries and a common result is that, it is efficient to set fines as high as possible and monitoring as low as possible, when fines are costless and offenders are risk neutral. However, this result is sensitive to the assumption that fishermen cannot engage in avoidance activities, e.g., activities to reduce the likelihood of being detected when noncomplying. The paper presents a model of fisheries that allows the fishermen to engage in avoidance activities. The conclusions from the model are that, under certain circumstances, fines are costly transfers to society since they not only have a direct positive effect on the level of deterrence, but also an indirect negative effect in the form of increased avoidance activities to reduce the probability of detection. The paper contributes to the literature on avoidance activities by introducing the externality from the illegal behavior as an endogenous effect on other offenders. For an externality, that has an exogenous effect on other actors, Malik shows that fines are only costly transfers for conditional deterrence (when one actor is deterred while another actor is not). For fisheries, we show that fines are also costly transfers under no deterrence (when no agents are deterred).     

Self-intersections and smoothness of general offset surfaces

A convex body N moves such that it touches a closed surface M. While doing this, it is undergoing a purely translational motion. A fixed point of N traces out the general offset surface during this motion. We study the connection between singularities and self-intersections of and the possible collisions of M with N during this motion and obtain some global results. Received 27 January 1999.