Int Conf Research Articles

First in Human Subjects Testing of the UroMonitor: A Catheter-free Wireless Ambulatory Bladder Pressure Monitor.

Urodynamics is the standard method of diagnosing bladder dysfunction, but involves catheters and retrograde bladder filling. With these artificial conditions, urodynamics cannot always reproduce patient complaints. We have developed a wireless, catheter-free intravesical pressure sensor, the UroMonitor, which enables catheter-free telemetric ambulatory bladder monitoring. The purpose of this study was twofold: to evaluate accuracy of UroMonitor pressure data, and assess safety and feasibility of use in humans. Eleven adult female patients undergoing urodynamics for overactive bladder symptoms were enrolled. After baseline urodynamics, the UroMonitor was transurethrally inserted into the bladder and position was confirmed cystoscopically. A second urodynamics was then performed with the UroMonitor simultaneously transmitting bladder pressure. Following removal of urodynamics catheters, the UroMonitor transmitted bladder pressure during ambulation and voiding in private. Visual analogue pain scales (0-5) were used to assess patient discomfort. The UroMonitor did not significantly alter capacity, sensation, or flow during urodynamics. The UroMonitor was also easily inserted and removed in all subjects. The UroMonitor reproduced bladder pressure, capturing 98% (85/87) of voiding and nonvoiding urodynamic events. All subjects voided with only the UroMonitor in place with low post-void residual volume. Median ambulatory pain score with the UroMonitor was rated 0 (0-2). There were no post-procedural infections or changes to voiding behavior. The UroMonitor is the first device to enable catheter-free telemetric ambulatory bladder pressure monitoring in humans. The UroMonitor appears safe and well tolerated, does not impede lower urinary tract function, and can reliably identify bladder events compared to urodynamics.

HEART-TO-ANKLE PULSE WAVE VELOCITY AS USED IN CARDIO-ANKLE VASCULAR INDEX (CAVI) AND CAVI_0 IS A NEARLY DIASTOLIC WAVE SPEED METRIC

Objective: Cardio-ankle vascular index (CAVI) and CAVI_0 are arterial stiffness indices based on the heart-to-ankle pulse wave velocity (haPWV). haPWV is derived from the heart-to-ankle transit time (haTT = tb+tba) as haPWV = L/haTT, with L an estimated transit distance. tb is the time difference between aortic valve closure (causing the aortic dicrotic notch) and the dicrotic notch in the brachial pressure waveform; tba is the time difference between the diastolic feet in the brachial and ankle pressure waveforms. CAVI and CAVI_0 aim to normalise haPWV for blood pressure at the time of measurement. As tb and tba are determined at different pressures — tb at dicrotic notch pressure (P_notch); tba at diastolic blood pressure (DBP; Fig. C) — determining the pressure that governs haPWV (P_haPWV) and hence should ideally be used for normalisation of haPWV is not trivial. CAVI uses P_m = (SBP+DBP)/2 to normalise haPWV, whereas CAVI_0 uses DBP (SBP: brachial systolic blood pressure). We aim to analytically estimate P_haPWV and compare this to the normalisation pressures used in CAVI and CAVI_0. Design and method: Consistent with CAVI/CAVI_0 assumptions, the arterial tree was assumed to consist of tubes with exponential pressure-diameter relationship and uniform stiffness index beta_0, allowing us to calculate PWV at P_notch (PWV_notch) and at DBP (PWV_DBP; Fig. A). P_notch was calculated as 0.55DBP+0.45SBP [Adji et al.,J Hypertens 2012;30:1540–1551]. The resulting PWVs, together with heart-to-ankle (L_ha=170 cm) and heart-to-brachial (L_hb=38 cm) path lengths [Alastruey et al.,11th Int Conf Press Surges 2012;401–442] (Fig. B), allowed analytically estimating tb and tba: tb=L_hb/PWV_notch and tba=(L_ha-L_hb)/PWV_DBP. P_haPWV was finally estimated as the weighted average of P_notch and DBP using tb and tba as weights. Results: Choosing SBP/DBP=120/80 mmHg (and hence P_m=100 mmHg) and beta_0 = 10 yielded tb = 0.048 s and tba = 0.187 s, giving P_haPWV = 84 mmHg. This implies that P_haPWV was much closer to DBP (as used in CAVI_0) than to P_m (as used in CAVI). This result was only marginally influenced by blood pressure: e.g., SBP/DBP = 160/90 mmHg (P_m = 125 mmHg) yielded P_haPWV = 96 mmHg. Conclusions: DBP offers a more accurate estimate of P_haPWV than Pm, supporting the utility of CAVI_0 as an enhancement of CAVI.

Distribution of race and Fitzpatrick skin types in data sets for deep learning in dermatology: A systematic review

Distribution of race and Fitzpatrick skin types in data sets for deep learning in dermatology: A systematic review

Quick-response protection system against electric shock in distributed generation systems

2. Ramesh MV, Mohan N, Devidas AR. Micro grid architecture for line fault detection and isolation. SMARTGREENS 2015 - 4th Int Conf Smart Cities Green ICT Syst Proc. 2015;250–5. Google Scholar

On Integrals Over a Convex Set of the Wigner Distribution

We provide an example of a normalized $$L^{2}({\mathbb {R}})$$ function u such that its Wigner distribution $${\mathcal {W}}(u,u)$$ has an integral $$>1$$ on the square $$[0,a]\times [0,a]$$ for a suitable choice of a. This provides a negative answer to a question raised by Flandrin (Proc IEEE Int Conf Acoustics 4(1):2176–2179, 1988). Our arguments are based upon the study of the Weyl quantization of the characteristic function of $${{\mathbb {R}}_{+}\times {\mathbb {R}}_{+}}$$ along with a precise numerical analysis of its discretization.

Iteratively reweighted $$\ell _1$$ ℓ 1 algorithms with extrapolation

Iteratively reweighted $$\ell _1$$ algorithm is a popular algorithm for solving a large class of optimization problems whose objective is the sum of a Lipschitz differentiable loss function and a possibly nonconvex sparsity inducing regularizer. In this paper, motivated by the success of extrapolation techniques in accelerating first-order methods, we study how widely used extrapolation techniques such as those in Auslender and Teboulle (SIAM J Optim 16:697–725, 2006), Beck and Teboulle (SIAM J Imaging Sci 2:183–202, 2009), Lan et al. (Math Program 126:1–29, 2011) and Nesterov (Math Program 140:125–161, 2013) can be incorporated to possibly accelerate the iteratively reweighted $$\ell _1$$ algorithm. We consider three versions of such algorithms. For each version, we exhibit an explicitly checkable condition on the extrapolation parameters so that the sequence generated provably clusters at a stationary point of the optimization problem. We also investigate global convergence under additional Kurdyka–Łojasiewicz assumptions on certain potential functions. Our numerical experiments show that our algorithms usually outperform the general iterative shrinkage and thresholding algorithm in Gong et al. (Proc Int Conf Mach Learn 28:37–45, 2013) and an adaptation of the iteratively reweighted $$\ell _1$$ algorithm in Lu (Math Program 147:277–307, 2014, Algorithm 7) with nonmonotone line-search for solving random instances of log penalty regularized least squares problems in terms of both CPU time and solution quality.

Ceramics from Municipal Waste Incinerator Bottom Ash and Wasted Clay for Sensible Heat Storage at High Temperature

Although work has been done to understand the sintering behavior and properties of Municipal Waste Incinerator Bottom Ashes to produce sintered (Bethanis et al. in Ceram Int 28:881–886, 2002; Cheeseman et al. in Resour Conserv Recycl 43:147–162, 2005; Bourtsalas et al. in Waste Manag 45:217–225, 2014; Taurino et al. in J Eur. Ceram Soc 37:323–331, 2017) or sinter-crystallized (Schabbach et al. in J Non Cryst Solids 357:10–17, 2011; Barbieri et al. in J Non Cryst Solids 354:521–528, 2008) ceramics, most of the trials reported in the literature focuses on the use of extensively milled bottom ashes powders (particle size around 1–50 µm), using processes that might not be easily transferable to industrial production at reasonable cost, and producing small cylinders with uniaxial compression technique on powders. This paper summarizes the development process of an extruded ceramic material made of gross-milled bottom ashes and waste clay, designed to be easily mass-produced using production capacities available in the building bricks industry, to be used as a high-temperature thermal energy storage material, which represents an alternative to the petrurgic ceramic previously developed for this application (Py et al. in J Sol Energy Eng 133:031008, 2011; Kere et al. in Int Conf Eng Waste Biomass Valoris, Porto, 2012; Py et al. in Stockage de l’ energie: energie thermique, stockage thermique haute temperature). Post-treated incinerator bottom ashes from a commercial incinerator has been collected, characterized and processed to form ceramic materials, using clay as a binder. Ashes were milled, dried, and mixed with various amounts of an illitic clay (produced as washing mud by a quartz quarry) prior to extrusion (cylindrical pellet) and firing at different temperatures, ranging from 1100 to 1120 °C. The sintered samples have been characterized in terms of density, mechanical strength, thermal capacity and thermal conductivity. Their mineral structure has also been studied. This work follows a study on the feasibility about the production of MWIBA based slabs with uniaxial compaction, and can be seen as an improvement regarding the shaping of the green bodies, more compatible with thermocline thermal energy storage process. The resulting sintered ceramics exhibit interesting properties such as relatively high mechanical resistance and low thermal conductivity, along with moderate density. These properties allow envisioning the use as filler material for thermocline thermal storage systems, especially considering the simplicity of the production process, relying on dry gross milling (jaw-mill), and firing at a temperature reachable within the building bricks and tiles industry. Production of adequate pieces to be used as thermal storage media seems however more relevant, the small size limiting the impact of sintering heterogeneities (formation of black bodies due to high content in fluxing agents like sodium and potassium).

A Method of Generating 8 × 8 Substitution Boxes Based on Elliptic Curves

Elliptic curve cryptography provides better security and is more efficient as compared to other public key cryptosystems with identical key size. In this article, we present a new method for the construction of substitution boxes(S-boxes) based on points on elliptic curve over prime field. The resistance of the newly generated S-box against common attacks such as linear, differential and algebraic attacks is analyzed by calculating their non-linearity, linear approximation, strict avalanche, bit independence, differential approximation and algebraic complexity. The experimental results are further compared with some of the prevailing S-boxes presented in Shi et al. (Int Conf Inf Netw Appl 2:689–693, 1997), Jakimoski and Kocarev (IEEE Trans Circuits Syst I 48:163–170, 2001), Guoping et al. (Chaos, Solitons Fractals 23:413–419, 2005), Guo (Chaos, Solitons Fractals 36:1028–1036, 2008), Kim and Phan (Cryptologia 33: 246–270, 2009), Neural et al. (2010 sixth international conference on natural computation (ICNC 2010), 2010), Hussain et al. (Neural Comput Appl. https://doi.org/10.1007/s00521-012-0914-5 , 2012). Comparison reveals that the proposed algorithm generates cryptographically strong S-boxes as compared to some of the other exiting techniques.

Extenuating Whip-Lash Effect in Multi-Echelon SCM in Steel Processing Industry Using Optimization Model

AbstractForecasting of inventory is an enigma to various firms at different echelon levels of supply chain. Abnormality in forecasting an inventory may leads to fluctuations in upstream supply chain. On upswing it can be uneconomical in terms of stock-out cost, while on the down trend it can be expensive in terms of stock holding costs. To amend the firms efficiency, in this paper the model developed by (Akhtar Tanveer et al. An Optimization model for Mitigating Bullwhip-Effect in a Two-Echelon Supply chain. Int conf Traf Transp Stud 2014;138:289-97) is successfully applied to steel processing firm to mitigate the Bull-whip or Whip-lash effect in the supply chain. The objective function is to minimize the variation between the actual order quantity and demand forecast of multiple products at various echelons and the simple exponential smoothing is compiled to forecast the demand of products. The model is furthermore validated by an illustration of seven products and it depicts that the model emanates an optimal set of smoothing parameters to attenuate the whip-lash effect.

Single-molecule dataset (SMD): a generalized storage format for raw and processed single-molecule data.

BackgroundSingle-molecule techniques have emerged as incisive approaches for addressing a wide range of questions arising in contemporary biological research [Trends Biochem Sci 38:30–37, 2013; Nat Rev Genet 14:9–22, 2013; Curr Opin Struct Biol 2014, 28C:112–121; Annu Rev Biophys 43:19–39, 2014]. The analysis and interpretation of raw single-molecule data benefits greatly from the ongoing development of sophisticated statistical analysis tools that enable accurate inference at the low signal-to-noise ratios frequently associated with these measurements. While a number of groups have released analysis toolkits as open source software [J Phys Chem B 114:5386–5403, 2010; Biophys J 79:1915–1927, 2000; Biophys J 91:1941–1951, 2006; Biophys J 79:1928–1944, 2000; Biophys J 86:4015–4029, 2004; Biophys J 97:3196–3205, 2009; PLoS One 7:e30024, 2012; BMC Bioinformatics 288 11(8):S2, 2010; Biophys J 106:1327–1337, 2014; Proc Int Conf Mach Learn 28:361–369, 2013], it remains difficult to compare analysis for experiments performed in different labs due to a lack of standardization.ResultsHere we propose a standardized single-molecule dataset (SMD) file format. SMD is designed to accommodate a wide variety of computer programming languages, single-molecule techniques, and analysis strategies. To facilitate adoption of this format we have made two existing data analysis packages that are used for single-molecule analysis compatible with this format.ConclusionAdoption of a common, standard data file format for sharing raw single-molecule data and analysis outcomes is a critical step for the emerging and powerful single-molecule field, which will benefit both sophisticated users and non-specialists by allowing standardized, transparent, and reproducible analysis practices.Electronic supplementary materialThe online version of this article (doi:10.1186/s12859-014-0429-4) contains supplementary material, which is available to authorized users.

On the theoretical link between LLL-reduction and Lambda-decorrelation

The LLL algorithm, introduced by Lenstra et al. (Math Ann 261:515–534, 1982), plays a key role in many fields of applied mathematics. In particular, it is used as an effective numerical tool for preconditioning the integer least-squares problems arising in high-precision geodetic positioning and Global Navigation Satellite Systems (GNSS). In 1992, Teunissen developed a method for solving these nearest-lattice point (NLP) problems. This method is referred to as Lambda (for Least-squares AMBiguity Decorrelation Adjustment). The preconditioning stage of Lambda corresponds to its decorrelation algorithm. From an epistemological point of view, the latter was devised through an innovative statistical approach completely independent of the LLL algorithm. Recent papers pointed out some similarities between the LLL algorithm and the Lambda-decorrelation algorithm. We try to clarify this point in the paper. We first introduce a parameter measuring the orthogonality defect of the integer basis in which the NLP problem is solved, the LLL-reduced basis of the LLL algorithm, or the $$\Lambda $$ -basis of the Lambda method. With regard to this problem, the potential qualities of these bases can then be compared. The $$\Lambda $$ -basis is built by working at the level of the variance-covariance matrix of the float solution, while the LLL-reduced basis is built by working at the level of its inverse. As a general rule, the orthogonality defect of the $$\Lambda $$ -basis is greater than that of the corresponding LLL-reduced basis; these bases are however very close to one another. To specify this tight relationship, we present a method that provides the dual LLL-reduced basis of a given $$\Lambda $$ -basis. As a consequence of this basic link, all the recent developments made on the LLL algorithm can be applied to the Lambda-decorrelation algorithm. This point is illustrated in a concrete manner: we present a parallel $$\Lambda $$ -type decorrelation algorithm derived from the parallel LLL algorithm of Luo and Qiao (Proceedings of the fourth international C $$^*$$ conference on computer science and software engineering. ACM Int Conf P Series. ACM Press, pp 93–101, 2012).

Linearly many faults in arrangement graphs

AbstractThe star graph proposed by Akers et al. (Proc Int Conf Parallel Process, University Park, PA, 1987, pp. 393–400) has many advantages over the n‐cube. However, it suffers from having large gaps in the possible number of vertices. The arrangement graph was proposed by Day and Tripathi (Inf Process Lett 42 (1992), 235–241) to address this issue. Since it is a generalization of the star graph, it retains many of the nice properties of the star graph. In fact, it also generalizes the alternating group graph (Jwo et al., Networks 23 (1993), 315–326). There are many different measures of structural integrity of interconnection networks. In this article, we prove results of the following type for the arrangement graph: If h(r,n,k) vertices are deleted from the arrangement graph An,k, the resulting graph will either be connected or have a large component and small components having at most r − 1 vertices in total. Our result is tight for r ≤ 3, and it is asymptotically tight for r ≥ 4. Moreover, we also determine the cyclic vertex‐connectivity of the arrangement graph. © 2012 Wiley Periodicals, Inc. NETWORKS, 2013

Prevalence of hepatitis C virus infection and human immunodeficiency virus in a cohort of Egyptian hemophiliac children

BACKGROUND AND OBJECTIVEThe risk of blood-borne infections, especially hepatitis C virus (HCV) and human immunodeficiency virus (HIV) infection still remains in developing countries among children receiving blood products as hemophiliacs, but the risk is not known in Egypt. The objective of this study was to detect the prevalence of HCV and HIV infection among hemophiliac children to know the magnitude of the problem and determine potential risk factors.PATIENTS AND METHODSThis was a cross-sectional study conducted on 100 hemophiliac children that assessed the liver clinically and by laboratory tests. All children were screened for HCV and HIV antibodies by enzyme-linked immunosorbent assay. Those with positive HCV antibody titre were tested by polymerase chain reaction (HCV-PCR).RESULTSForty were positive for HCV antibodies with 19 children (47.5%) HCV-PCR positive as well. The mean age, average frequency of bleeds/year, dose of replacement therapy/year and alanine aminotransferase (ALT) levels were significantly high in HCV-antibody and PCR positive patients as compared to HCV antibody and PCR negative ones. None of our patients had clinical evidence of hepatic involvement or was co-infected with HIV.CONCLUSIONHIV infection does not appear to be a current health problem in Egyptian hemophiliac children though the prevalence of HCV infection is still high.

A mathematical analysis of the R‐MAT random graph generator

AbstractThe R‐MAT graph generator introduced by Chakrabarti et al (Int Conf Data Mining, 2004) offers a simple, fast method for generating very large directed graphs. These properties have made it a popular choice as a method of generating graphs for objects of study in a variety of disciplines, from social network analysis to high performance computing. We analyze the graphs generated by R‐MAT and model the generator in terms of occupancy problems to prove results about the degree distributions of these graphs. We prove that the limiting degree distributions can be expressed as a mixture of normal distributions with means and variances that can be easily calculated from the R‐MAT parameters. Additionally, this article offers an efficient computational technique for computing the exact degree distribution and concise expressions for a number of properties of R‐MAT graphs. ©2011 Wiley Periodicals, Inc.*. NETWORKS, 2011

Calculating a near time-optimal jerk-constrained trajectory along a specified smooth path

This article presents a near time-optimal and jerk-constrained trajectory planner. The presented work is an extension to the “proximate time-optimal algorithm” (Pardo-Castellote and Cannon, IEEE Int Conf Robot Autom 2:1539–1546, 1996), which is used to determine smooth and near time-optimal path-constrained trajectories, to problems where not only the velocity and the acceleration but also the jerk are explicitly constrained. It is shown that the constraint on the jerk translates into limits for the curvature of the phase-space velocity. As high-speed motion systems become more and more accurate, the trend goes clearly towards jerk-constrained trajectory calculation to avoid large deviations from the planned trajectory during the complete move. The proposed algorithm is nonperturbative and its calculation time is linear with respect to the length of the path.

Robotic execution of everyday tasks by means of external vision/force control

In this article, we present an integrated manipulation framework for a service robot, that allows to interact with articulated objects at home environments through the coupling of vision and force modalities. We consider a robot which is observing simultaneously his hand and the object to manipulate, by using an external camera (i.e. robot head). Task-oriented grasping algorithms (Proc of IEEE Int Conf on robotics and automation, pp 1794–1799, 2007) are used in order to plan a suitable grasp on the object according to the task to perform. A new vision/force coupling approach (Int Conf on advanced robotics, 2007), based on external control, is used in order to, first, guide the robot hand towards the grasp position and, second, perform the task taking into account external forces. The coupling between these two complementary sensor modalities provides the robot with robustness against uncertainties in models and positioning. A position-based visual servoing control law has been designed in order to continuously align the robot hand with respect to the object that is being manipulated, independently of camera position. This allows to freely move the camera while the task is being executed and makes this approach amenable to be integrated in current humanoid robots without the need of hand-eye calibration. Experimental results on a real robot interacting with different kind of doors are presented.

PHASED MULTI-JOINT MOVEMENT OF THE INDEX FINGER DURING A FULL FLEXION CYCLE

Flexion of the index finger is a fairly complex process requiring the coordination of different joints. This study is the first attempt to investigate how the angular velocity profile of the three right index joints (DIP, PIP, and MCP) varies with respect to time during the course of flexion. Ten right-handed subjects (healthy college students between 21 and 23 years old) were recruited to participate in the experiment. Each of these human subjects was instructed to perform a flexion task with his/her right hand. Five miniaturized (5-mm diameter) reflective markers were applied to each human subject: three placed at the DIP, PIP, and MCP joints of the index finger on the side close to thumb, and the rest at the predetermined landmarks on dorsum of thumb. A high-speed camera was used to record the motion of the index finger during a paced flexion, and the instantaneous angular velocity of each joint was determined by relating the marker displacement to the frame frequency (~5 ms between two consecutive frames). Opposite to the general belief that the speed is constant throughout a flexion cycle, to our best knowledge, this study, for the first time, has revealed that the speed of multi-joint movement actually varies with time. It has been identified that during one full flexion cycle, the angular velocity of the three joints of interest undergoes five distinguishable phases, referred as phases P1 (slow), P2 (fast), P3 (slow), P4 (fast), and P5 (slow), respectively. It has also been observed that duration of each of phases P1, P2, P4, or P5 accounts for approximately 10–15% of the whole flexion cycle, while P3 lasts for nearly half a cycle. Furthermore, although the flexions of DIP, PIP, and MCP joints cycle through the same five phases, the starts of their respective phases tend to vary. In P2 and P5, flexion of MCP takes place considerably later than those of PIP and DIP, whereas DIP flexes earlier than PIP in P2. The angular velocity of each joint reaches its peaks in P2 and P4; the peak velocity of DIP occurs earlier than that of PIP or MCP in P2, whereas peak of MCP is reached later than that of PIP. Moreover, the three joints of index finger flex with different angular velocities in each of the five phases: PIP moves significantly faster than MCP in P2, whereas DIP moves faster than MCP in P4. The results from our study indicate that the multi-joint motion of index finger is an uneven course, i.e. different joints flex with different angular velocities during the flexion. The temporal features of the velocity due to a single joint or multi-joint motion provide useful information to further clarify the dexterity of finger movement.

Translating accelerometer counts into energy expenditure: advancing the quest

Research that uses accelerometers to measure physical activity has expanded exponentially over the past decade. There were approximately 90 papers per year published in 2003 and 2004 compared with fewer than 10 per year in 1993 and 1994 ([6][1]). Since the beginning of the development and

A multiple-layer σ-coordinate model for simulation of wave–structure interaction

A 3D multiple-layer σ-coordinate model has been developed to simulate surface wave interaction with various types of structures including submerged structures, immersed structures, and floating structures. This model is the extension of the earlier model [Lin P, Li CW. A σ-coordinate three-dimensional numerical model for surface wave propagation. Int J Numer Methods Fluid 2002;38(11):1045–68] that solves Navier–Stokes equations in the transformed σ-coordinate, which is especially efficient for simulation of wave propagation over varying topography. By introducing the layered σ-coordinates, the present model overcomes the difficulty encountered by the earlier model in calculating waves past a depth discontinuity, e.g., a submerged rectangular breakwater. Furthermore, with the employment of 3-layer σ-coordinate the present model is able to simulate flow interaction with an immersed body or a floating body. The new model is validated against an established Volume-Of-Fluid (VOF) model [Lin P, Liu PL-F. A numerical study of breaking waves in the surf zone. J Fluid Mech 1998;359:239–64] for the 2D solitary wave interaction with a submerged, immersed, or floating rectangular obstacle. For the solitary wave interaction with a submerged breakwater, the numerical results are also compared to the experimental data by Zhuang and Lee [A viscous rotational model for wave overtopping over marine structure. In Proc 25th Int Conf Coast Eng, ASCE, 1996. p. 2178–91] and very good agreements have been obtained for velocities in the vortex behind the structure. Finally, the present model is used to simulate 3D wave interaction with a Very Large Floating Structure (VLFS) above a submerged shoal. It is proved that the model is an accurate and efficient numerical tool to investigate different wave–structure interactions problems.

Wave parameters and functions in wavelet analysis

A preliminary study of wave parameters and functions in wavelet analysis is conducted in this paper. The Morlet wavelet transform is used to calculate the time–frequency wavelet energy density function, its volume (i.e. the total energy), its frequency-integral (i.e. the wavelet smoothed instantaneous wave energy history), its time-integral (i.e. the wavelet spectral density function), and two non-dimensional wave indices ( NIF, NIT). The processing of the measured wave data obtained from the Chi-Gu coastal observation tower during the period August 2000 to July 2001 indicates that the inter-comparison of wavelet smoothed instantaneous wave energy history and smoothed instantaneous wave energy history ( SIWEH) as defined by Funke and Mansard (Proc 17th Int Conf on Ocean Eng, 1980) can reveal the noise structure of the wave signal. The wave data with index NIF greater than 2 is always accompanied with noise, therefore NIF can be used as one of the data quality criteria. The index NIT is linearly correlated with the significant wave period and with the significant wave height, therefore NIT can be used to study the wave growth and decaying phenomena.