检索结果-内蒙古大学图书馆

International Conference on Industrial Instrumentation and Control

作者： Gurav, Ruchi Manish Kadbe, Premanand K. VPCOE Dept Elect & Telecommun Engn Baramati India

ISBN: (纸本)9781479971657

Gestures are important for communicating information among the human. Nowadays new technologies of Human Computer Interaction (HCI) are being developed to deliver user's command to the robots. Users can interact with machines through hand, head, facial expressions, voice and touch. The objective of this paper is to use one of the important modes of interaction i.e. hand gestures to control the robot or for offices and household applications. Hand gesture detection algorithms are based on various machine learning methods such as neural networks, support vector machine, and Adaptive Boosting (AdaBoost). Among these methods, AdaBoost based hand-pose detectors are trained with a reduced Haar-like feature set to make the detector robust. The corresponding context-free grammar based proposed method gives effective real time performance with great accuracy and robustness for more than four hand gestures. Rectangles are creating some problem due to that we have also implement the alternate representation method for same gestures i.e. fingertip detection using convex hull algorithm.

关键词： Hand Gesture Neural networks Support vector machine Adaptive Boosting (AdaBoost) Reduced Haar-like feature set Fingertip as contour detection convex hull algorithm Human Computer Interaction (HCI) HSV (Hue, Saturation & Intensity Value)

来源：评论

学校读者我要写书评

暂无评论

A Behavior Observation Tool (BOT) for Mobile Device Network Connection Logs 23

A Behavior Observation Tool (BOT) for Mobile Device Network ...

引用

23rd International Conference on World Wide Web (WWW)

作者： Wang, Ting SAP Asia Pte Ltd 1 Create Way14-01 CREATE Bldg Singapore 138602 Singapore

ISBN: (纸本)9781450327459

With the advances of sensory, satellite and mobile communication technologies in recent decades, locational data become widely available. A lot of work has been developed to find useful information from these data, and various approaches have been proposed. In this work, we aim to use one specific type of locational data network connection logs of mobile devices, which is widely available and easily accessible to telecom companies, to identify and extract active areas of users. This is a challenging topic due to the existence of inaccurate location and fluctuating log time intervals of this kind of data. In order to observe user behavior from this kind of data set, we propose a new algorithm, namely Behavior Observation Tool (BOT), which uses convex hull algorithm with sliding time windows to model the user's movement, and thus knowledge about the user's lifestyle and habits can extracted from the mobile device network logs.

关键词： Spatial-Temporal Data Mining Loctional Data convex hull algorithm Network Connection Logs Active Area

来源：评论

学校读者我要写书评

暂无评论

AN EFFICIENT algorithm FOR THE convex hull OF PLANAR SCATTERED POINT SET 22

AN EFFICIENT ALGORITHM FOR THE CONVEX HULL OF PLANAR SCATTER...

引用

22nd Congress of the International-Society-for-Photogrammetry-and-Remote-Sensing

作者： Fu, Zhongliang Lu, Yuefeng Wuhan Univ Sch Remote Sensing & Informat Engn Wuhan 430079 Hubei Peoples R China

Computing the convex hull of a point set is requirement in the GIS applications. This paper studies on the problem of minimum convex hull and presents an improved algorithm for the minimum convex hull of planar scattered point set. It adopts approach that dividing the point set into several sub regions to get an initial convex hull boundary firstly. Then the points on the boundary, which cannot be vertices of the minimum convex hull, are removed one by one. Finally the concave points on the boundary, which cannot be vertices of the minimum convex hull, are withdrew. Experimental analysis shows the efficiency of the algorithm compared with other methods.

关键词： Scattered Point Set Minimum convex hull convex hull algorithm Initial Boundary of convex hull

来源：评论

学校读者我要写书评

暂无评论

A behavior observation tool (BOT) for mobile device network connection logs

A behavior observation tool (BOT) for mobile device network ...

引用

Proceedings of the 23rd International Conference on World Wide Web

作者： Ting Wang SAP Singapore Singapore

ISBN: (纸本)9781450327459

With the advances of sensory, satellite and mobile communication technologies in recent decades, locational data become widely available. A lot of work has been developed to find useful information from these data, and various approaches have been proposed. In this work, we aim to use one specific type of locational data -- network connection logs of mobile devices, which is widely available and easily accessible to telecom companies, to identify and extract active areas of users. This is a challenging topic due to the existence of inaccurate location and fluctuating log time intervals of this kind of data. In order to observe user behavior from this kind of data set, we propose a new algorithm, namely Behavior Observation Tool (BOT), which uses convex hull algorithm with sliding time windows to model the user's movement, and thus knowledge about the user's lifestyle and habits can extracted from the mobile device network logs.

关键词： active area convex hull algorithm loctional data network connection logs spatial-temporal data mining

来源：评论

学校读者我要写书评

暂无评论

A rapid path-length searching procedure for multi-axial fatigue cycle counting

引用

FATIGUE & FRACTURE OF ENGINEERING MATERIALS & STRUCTURES 2012年第6期35卷 556-571页

作者： Wei, Z. Dong, P. Tenneco Oil Co Inc Emiss Control Struct Anal Team Grass Lake MI 49240 USA Univ New Orleans Sch Naval Architecture & Marine Engn New Orleans LA 70148 USA

In this paper, a series of advanced searching algorithms have been examined and implemented for accelerating multi-axial fatigue cycle counting efforts when dealing with large time histories. In a computerized calculation of the path-length dependent cycle counting method, most of the central processor unit's (CPU) time is spent on searching for the maximum range or distance in a stress or strain space. A brute-force search is the simplest to implement, and will always find a solution if it exists. However, its cost, in many practical problems, tends to grow exponentially as the size of the loading spectrum increases with a search time measured in the order of O(n2), where n is the number of spectrum data points. In contrast, a form of Andrew's monotone chain algorithm, as demonstrated in this paper, can remarkably reduce the solution time to the order of O(n log n). The effectiveness of the new path-length searching procedure is demonstrated by a series of worked examples with a varying degree of non-proportionality in multi-axial loading history.

关键词： convex hull algorithm cycle counting multi-axial fatigue variable amplitude loading out-of-phase loading path-dependent fatigue damage

来源：评论

学校读者我要写书评

暂无评论

Short-Term Congestion Forecasting in Wholesale Power Markets

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 2011年第4期26卷 2185-2196页

作者： Zhou, Qun Tesfatsion, Leigh Liu, Chen-Ching Iowa State Univ Dept Elect & Comp Engn Ames IA 50010 USA Iowa State Univ Dept Econ Ames IA 50010 USA Univ Coll Dublin Sch Elect Elect & Mech Engn Dublin 2 Ireland

Short-term congestion forecasting is highly important for market participants in wholesale power markets that use locational marginal prices (LMPs) to manage congestion. Accurate congestion forecasting facilitates market traders in bidding and trading activities and assists market operators in system planning. This study proposes a new short-term forecasting algorithm for congestion, LMPs, and other power system variables based on the concept of system patterns-combinations of status flags for generating units and transmission lines. The advantage of this algorithm relative to standard statistical forecasting methods is that structural aspects underlying power market operations are exploited to reduce forecast error. The advantage relative to previously proposed structural forecasting methods is that data requirements are substantially reduced. Forecasting results based on a NYISO case study demonstrate the feasibility and accuracy of the proposed algorithm.

关键词： Congestion forecasting convex hull algorithm load partitioning locational marginal price price forecasting system patterns wholesale power market

来源：评论

学校读者我要写书评

暂无评论

REACHABLE GRASPS ON A POLYGON OF A ROBOT ARM: FINDING convex ROPES WITHOUT TRIANGULATION

引用

INTERNATIONAL JOURNAL OF ROBOTICS & AUTOMATION 2010年第4期25卷 304-310页

作者： Phan Thanh An Inst Super Tecn CEMAT P-1049001 Lisbon Portugal Inst Math Hanoi 10307 Vietnam

The convex rope problem, posed by Peshkin and Sanderson in IEEE Journal of Robotics & Automation, 2, 1986 53-58, is to find the counterclockwise and clockwise convex ropes starting at the vertex a and ending at the vertex 6 of a simple polygon, where a is on the boundary of the convex hull of the polygon and b is visible from infinity (i.e., there exists a ray m beginning at b. which does not intersect P anywhere else). Computation of these convex ropes is required to plan reachable grasps of a simple polygon by a simple robot arm. In this paper, we present a linear-time algorithm for solving this problem without, resorting to a linear-time triangulation algorithm and without resorting to a convex hull algorithm for the polygon. The counterclockwise (clockwise, respectively) convex rope consists of two polylines obtained in a basic incremental strategy described in convex hull algorithms for the polylines forming the polygon from a to b. The key idea is the use of Melkman's linear-time convex algorithm for a polyline which loses its simplicity on the ray (m) over bar, beginning at b and in the opposite direction to m (such polyline is constructed by vertices inside the last convex hull in the incremental strategy and being left or on (m) over bar). Some advantages of the algorithm and numerical examples are presented.

关键词： Geometric computing shortest paths the convex rope convex hull algorithm convex hull robotics

来源：评论

学校读者我要写书评

暂无评论

Range-Spread Target Detection Based on Cross Time-Frequency Distribution Features of Two Adjacent Received Signals

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2009年第10期57卷 3733-3745页

作者： Shui, Peng-Lang Liu, Hong-Wei Bao, Zheng Xidian Univ Natl Lab Radar Signal Proc Xian 710071 Peoples R China

High resolution radars (HRRs) transmit a wideband signal to achieve a high range resolution. A target is considered as composed of multiple scatterers, which occupy or spread in multiple radar range cells with several scatterers in each cell. Therefore, the refection of a target spreads in multiple range cells in the received signal, which contains more information of target than that obtained from low resolution radars. The target in high resolution radar systems is a range-spread target. The range-spreading or echo features of target are utilized for target detection and identification. The echoes of target are convolutions of transmitted signals with target range-scattering functions dependent on the gesture of target to the line of radar sight. A single echo is used in the conventional detection. It is difficult for target detection and identification in low signal-to-noise ratio (SNR) condition. In this paper, we propose a new range-spread target detection scheme exploiting the image features of cross time-frequency distribution (TFD) of a pair of adjacent received signals. After dechirping, the received signal reflected from target consists of multiple sinusoidal components due to its multiple scatterers when a linear frequency modulated (LFM) signal is transmitted from radar. Some regular image patterns or features of target appear in the cross TFD of two adjacent received signals, while the cross TFD of two independent Gaussian noises does not show such patterns. The cross TFD features are exploited in the proposed scheme. Three steps are composed in the proposed scheme. Firstly, a cross smoothed-pseudo Wigner-Ville distribution (CSPWVD) is made for two adjacent received signals to generate a two-dimensional (2-D) TF image. Then, some regular geometric patterns are detected and extracted from the image. At last, two features of the extracted geometric patterns are jointly utilized to detect target. The proposed algorithm is verified by using raw radar data.

关键词： convex hull algorithm CSPWVD high resolution radar high resolution range profile (HRRP) morphological filtering range-spread target detection

来源：评论

学校读者我要写书评

暂无评论

convex hulls, oracles, and homology

引用

JOURNAL OF SYMBOLIC COMPUTATION 2004年第4期38卷 1247-1259页

作者： Joswig, M Ziegler, GA Univ Magdeburg Fak Math Inst Algebra & Geometrie D-39106 Magdeburg Germany Tech Univ Berlin Math Inst D-10623 Berlin Germany

This paper presents a new algorithm for the convex hull problem, which is based on a reduction to a combinatorial decision problem COMPLETENESSC, which in turn can be solved by a simplicial homology computation. Like other convex hull algorithms, our algorithm is polynomial (in the size of input plus output) for simplicial or simple input. We show that the "no"-case Of COMPLETENESSC has a certificate that can be checked in polynomial time (if integrity of the input is guaranteed). (C) 2004 Elsevier Ltd. All rights reserved.

关键词： convex hull algorithm simplicial homology computation

来源：评论

学校读者我要写书评

暂无评论

Quantitative techniques for analysis of large data sets in renewable distributed generation

Quantitative techniques for analysis of large data sets in r...

引用

IEEE PES Power Systems Conference and Exposition

作者： Pregelj, A Begovic, M Rohatgi, A Georgia Inst Technol Atlanta GA 30332 USA

ISBN: (纸本)078038718X

Summary form only given. Distributed generation (DG) reduces losses and eliminates some of the transmission and distribution costs. It may also reduce fossil fuel emissions, defer capital costs, and improve the distribution feeder voltage conditions. The calculation of the effects of small residential photovoltaic (PV) and wind DG systems on various feeder operating variables is complicated by both the probabilistic nature of their output and the variety of their possible spatial allocations. A method based on a combination of clustering techniques and a convex hull algorithm is proposed that may reduce the computational burden by an order of magnitude, while still allowing accurate estimation of DG-enhanced feeder operation.

关键词： distributed power generation power distribution economics power transmission economics wind power plants photovoltaic power systems fossil fuels convex programming statistical analysis air pollution control cost reduction renewable distributed generation DG loss reduction transmission cost elimination distribution cost elimination fossil fuel emission reduction capital cost distribution feeder voltage condition residential photovoltaic system wind DG system clustering technique convex hull algorithm feeder operation large data set quantitative technique

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：