ppxscal/embedding_network huggingface dataset:
WINTeR: Architecture and Applications of a Wireless Industrial Sensor Network Testbed for Radio-Harsh Environments
Authors: Jeff Slipp, Changning Ma, Nagesh Polu, James Nicholson, Martin Murillo, Sajid Hussain
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

The present work relates to WINTeR, an open access, multi-user experimental facility, currently under development, to support implementation and evaluation of wireless sensor networks for industrial applications in radio-harsh environments. A brief review of existing testbeds is provided and the unique requirements of WINTeR are defined. The resulting WINTeR architecture provides remote accessibility to a full-scale industrial setting including a network of programmable motes each with a programmable attenuator and power monitor, a complex multipath environment, an EMI generator, and a data generator. Experimental analysis tools provide for data logging and graphing as experiments proceed. The resulting testbed will support development and evaluation of emerging physical layer technologies, propagation models, routing protocols, security protocols, power consumption models, the validation of wireless solutions for industrial processes, and most importantly cross-layer optimization. Some examples of how the testbed can be used are briefly presented.
Projection-Based Piecewise-Linear Response Surface Modeling for Strongly Nonlinear VLSI Performance Variations
Authors: Xin Li, Yu Cao
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

Large-scale process fluctuations (particularly random device mismatches) at nanoscale technologies bring about high-dimensional strongly nonlinear performance variations that cannot be accurately captured by linear or quadratic response surface models. In this paper, we propose a novel projection-based piecewise linear modeling technique, P2M, to address such a modeling challenge with affordable computational cost. P2M borrows the projection pursuit idea from mathematics to convert a high-dimensional modeling problem to a low-dimensional one. In addition, a new piecewise-linear model template is proposed and tuned for strongly nonlinear performance variations. By exploiting the unique piecewise-linear nature of the model template, a robust numerical algorithm is further developed to determine all model coefficients by solving a sequence of over-determined linear equations. Several circuit examples designed in a commercial 65nm CMOS process demonstrate that compared with the traditional quadratic modeling, P2M achieves 2x error reduction with negligible computational overhead.
Film cooling analysis using LES turbulence model
Authors: M. Subhash, C. B. Majumder
Venue: International Journal of Computational Fluid Dynamics (2007)

Film cooling is a process that is used to protect turbine vanes in a gas turbine engine from exposure to hot combustion gases. In this paper, we have conducted the time-dependent analysis of film cooling by the large-eddy-simulation (LES) model. We have obtained static-temperature contours, pressure contours, velocity vectors and temperature plot at y = 12.7 mm iso-surface at different time intervals such as 10, 20.37 and 40.74 s. Significant results have been obtained.
Application of self organizing maps to user authentication using combination of key stroke timings and pen calligraphy
Authors: Hiroshi Dozono, Masanori Nakakuni, Hisao Tokushima, Yoshio Noguchi
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

Recently, security of the computer systems becomes an important problem. Almost all computers use the password mechanism for the user authentication. But password mechanism has many issues. In this paper, we propose a kind of biometrics authentication method using the combinations of key stroke timings and pen calligraphy. For this method, selection of the phrase is important. We analyzed the key stroke timings and pen calligraphy using Self Organizing Map (SOM) and proposed the improved SOM (Pareto learning SOM) for this purpose. We examined the effectiveness of this method with the authentication experiments using the map organized by SOM.
An experimental approach to the measurement of the effects of water depth and substrate on optical and near infra-red reflectance: a field-based assessment of the feasibility of mapping submerged instream habitat
Authors: D. Gilvear, P. Hunter, T. Higgins
Venue: International Journal of Remote Sensing (2007)

This study represent an assessment of the feasibility of using optical and near infra-red wavelengths to map water depth and substrate type which are two of the primary components of river physical habitat. The objective was met by measuring reflectance using field spectroscopy of exposed and then progressively submerged (0-1 m) artificial substrates during rising tides on a tidal reach of the River Forth; this approach provided absolute control for substrate type. The field data were used to simulate multi-spectral response as measured using Airborne Thematic Mapper (bands 1 to 7; 420nm to 900nm) since airborne remote sensing provides the way forward for synoptic mapping of small streams (
Towards a Model for Inferring Trust in Heterogeneous Social Networks
Authors: Masoud Akhoondi, Jafar Habibi, Mohsen Sayyadi
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

People usually use trust and reputation to cope with uncertainty which exists in the nature and routines. The existing approaches for inferring trust rely on homogeneous relations. In other words, trust is just inferred by a homogeneous relation. In this paper, we present a new model for inferring trust using heterogeneous social networks; we use relation extraction to make a trust relation from the other relation such as friendship and the college relation and then introduced an algorithm to infer trust using extracted relation. In order to get higher performance, we extend relation extraction problem by proposing a genetic algorithm. This algorithm is more scalable, interpretable and extensible in comparison with prior ones. We also present a new algorithm for inferring trust in a social network. Using these methods, we conclude higher accuracy for trust values. Our claims are evaluated by experimental results.
An object-based comparative methodology for motion detection based on the F-Measure
Authors: N. Lazarevic-McManus, J. R. Renno, D. Makris, G. A. Jones
Venue: Computer Vision and Image Understanding (2008)

The majority of visual surveillance algorithms rely on effective and accurate motion detection. However, most evaluation techniques described in literature do not address the complexity and range of the issues which underpin the design of a good evaluation methodology. In this paper, we explore the problems associated with both the optimising the operating point of any motion detection algorithms and the objective performance comparison of competing algorithms. In particular, we develop an object-based approach based on the F-Measure-a single-valued ROC-like measure which enables a straight-forward mechanism for both optimising and comparing motion detection algorithms. Despite the advantages over pixel-based ROC approaches, a number of important issues associated with parameterising the evaluation algorithm need to be addressed. The approach is illustrated by a comparison of three motion detection algorithms including the well-known Stauffer and Grimson algorithm, based on results obtained on two datasets.
Bilateral Bargaining Game and Fuzzy Logic in the System Handling SLA-Based Workflow
Authors: Dang Minh Quan, Jorn Altmann
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

In the business Grid, the owner of a workflow is assumed to ask an SLA Workflow broker to execute the workflow for him. The price for executing a workflow on the Grid is negotiated between the user and the broker. Determining a price that satisfies both, the user and the SLA workflow broker, is a difficult task. This paper proposes a method using bilateral bargaining game model based on fuzzy logic to determine the price that the user and the broker could accept after the first negotiation round. We also analyze many parameters affecting the price determination process. The validation results show that the approach is suitable with business rules.
Care Policy for Patients with Dementia: Family's Decision and Its Impact
Authors: Michihiko Koeda, Takeo Shibata, Kunihiko Asai, Yoshiro Okubo, Hiroshi Tanaka
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

We developed a method using the Analytic Hierarchy Process (AHP) to evaluate the psychological factors of family caregivers of patients with dementia. Further, the family caregivers were questioned on their policy pertaining to the living place of the patients: at their home, nursing home, or hospital. We made inquiries of sixty-two families, resulting in twenty-eight desiring care at home, twenty desiring a nursing home, and fourteen desiring care at a hospital. The more the quality of life was valued, the more the family preferred care at home (r = 0.42). In contrast, the higher the concern regarding the burden of care was, the more the family preferred hospitalization (r = 0.49). This approach was useful in formulating decisions regarding a care policy for older people. Assessment of the psychological factors of family caregivers may provide clues for solving problems in decisions regarding care policy.
A New Approach for Touching Cells Segmentation
Authors: Shirin Nasr-Isfahani, Atefeh Mirsafian, Ali Masoudi-Nejad
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Automatic cell segmentation has various applications in different parts of science. The development of automated methods for cell segmentation, remains challenging in situations where there are touching cells. In this paper we propose a new method for separating touching cells. As the first step, we use a combination of graph segmentation algorithm and thresholding for segmenting foreground objects and producing a binary image. Next, boundary points of separation zone are selected by using a corner detection algorithm. Finally, the marker controller watershed transform is applied to separate touching cells at selected points.
Modified theories of laminar and turbulent rotating jets
Authors: Siavash H. Sohrab
Venue: Proceedings of the 7th WSEAS International Conference on Applied Mathematics (2005)

Scale-invariant forms of mass, energy, and linear momentum conservation equations in chemically reactive fields are described. The modified equation of motion is then solved for the classical problem of axisymmetric laminar rotating free jet. The results are shown to be in agreement with the classical theories of Loitsianskii and Görtler. The problem of turbulent axisymmetric rotating jet is shown to have solutions identical to those of laminar jet. Temperature distributions of axisymmetric and two-dimensional turbulent jets are determined and the latter results are found to be in agreement with the observations of Reichardt.
SCAR - Scattering, Concealing and Recovering Data within a DHT
Authors: Bryan N. Mills, Taieb F. Znati
Venue: Proceedings of the 41st Annual Simulation Symposium (anss-41 2008) (2008)

This paper describes a secure and reliable method for storing data in a distributed hash table (DHT) leveraging the inherent properties of the DHT to provide a secure storage substrate. The framework presented is referred toas “Scatter, Conceal, and Recover” (SCAR). The standard method of securing data in a DHT is to encrypt the data using symmetrical encryption before storing it in the network. SCAR provides this level of security, but also prevents any known cryptoanalysis from being performed. It does this by breaking the data into smaller blocks and scattering these blocks throughout the DHT. Hence, SCAR prevents any unauthorized user from obtaining the entire encrypted data block. SCAR uses hash chains to determine the storagelocations for these blocks within the DHT. To ensure storage availability, SCAR uses an erasure coding scheme to provide full data recovery given only partial block recovery. This paper first presents the SCAR framework and its associated protocols and mechanisms. The paper then discusses a prototype implementation of SCAR, and presents a simulation-based experimental study. The results show that in order for the erasure coding techniques used by SCAR to be effective, P2P nodes must sufficiently available.
HOS-based variable step adaptive equalizer
Authors: Kamal Meghriche, Mourad Haddadi
Venue: Proceedings of the 4th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision (2004)

In this paper, we are to develop a second-order LMS-type adaptive equalizer to reduce distortions of data transmission over analog telephone channels due the channel impulse response and inter-symbol interference (ISI). A novel approach for updating the linear and quadratic coefficients vectors of a second-order Volterra filter is presented. The innovative features of this algorithm provide distinct convergence treatment of the linear and quadratic Volterra filter kernels, hence providing a unique platform for both linear and nonlinear adaptive equalization. Simulations are carried in an equalization set-up to compare the performance of this algorithm with conventional and variable step LMS algorithms. The obtained results show that this algorithm brings substantial increase in the convergence speed while keeping, to some extent, the simplicity of the conventional LMS algorithm. Considering the performance of the formulated algorithm, it could be a useful tool for adaptive equalization applications.
Balanced outcomes in social exchange networks
Authors: Jon Kleinberg, Éva Tardos
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

The study of bargaining has a long history, but many basic settings are still rich with unresolved questions. In particular, consider a set of agents who engage in bargaining with one another,but instead of pairs of agents interacting in isolation,agents have the opportunity to choose whom they want to negotiate with, along the edges of a graph representing social-network relations. The area of network exchange theory in sociology has developed a large body of experimental evidence for the way in which people behave in such network-constrained bargaining situations, and it is a challenging problem to develop models that are both mathematically tractable and in general agreement with the results of these experiments. We analyze a natural theoretical model arising in network exchange theory, which can be viewed as a direct extension of the well-known Nash bargaining solution to the case of multiple agents interacting on a graph. While this generalized Nash bargaining solution is surprisingly effective at picking up even subtle differences in bargaining power that have been observed experimentally on small examples, it has remained an open question to characterize the values taken by this solution on general graphs, or to find an efficient means to compute it. Here we resolve these questions, characterizing the possible values of this bargaining solution, and giving an efficient algorithm to compute the set of possible values. Our result exploits connections to the structure of matchings in graphs, including decomposition theorems for graphs with perfect matchings, and also involves the development of new techniques. In particular, the values we are seeking turn out to correspond to a novel combinatorially defined point in the interior of a fractional relaxation of the matching problem.
Modelling the risk of cyclone wave damage to coral reefs using GIS: a case study of the Great Barrier Reef, 1969-2003
Authors: M. L. Puotinen
Venue: International Journal of Geographical Information Science (2007)

Tropical cyclones (hurricanes and typhoons) produce high winds that can generate waves capable of damaging coral reefs. As cyclones frequently pass through northeast Australia's Great Barrier Reef (GBR), it is important to understand how the spatial distribution of reef damage changes over time. However, direct measurements of wave damage, or even wave heights or wind speeds, are rare within the GBR. An important factor in estimating whether cyclone damage was possible is the magnitude and duration of high-energy wind and waves. Thus, before the spatio-temporal dynamics of past cyclone damage can be modelled, it is necessary to reconstruct the spread, intensity, and duration of high-energy conditions during individual cyclones. This was done every hour along the track taken by each of 85 cyclones that passed near the GBR from 1969 to 2003, by implementing a cyclone wind hindcasting model directly within a raster GIS using cyclone data available from the Australian Bureau of Meteorology. Three measures of cyclone energy (maximum wind speed-MAX, duration of gales-GALES, and continuous duration of gales-CGALES) were derived from these data. For three cyclones, where field data documenting actual reef damage from cyclone-generated waves were available, the predictive ability of each measure was assessed statistically. All three performed better in predicting reef damage at sites surveyed along the high-energy reef front than those surveyed along the more protected reef back. MAX performed best for cyclone Joy (r 2 = 0.5), while CGALES performed best for cyclones Ivor (r 2 = 0.23) and Justin (r 2 = 0.48). Using thresholds for MAX and GALES obtained via comparison with field data of damage, it was possible to produce a preliminary prediction of the risk of wave damage across the GBR from each of the 85 cyclones. The results suggest that while up to two-thirds of the GBR was at risk from some damage for 30-50% of the time series (∼18 out of 35 years), only scattered areas of the region were at risk more frequently than that.
An improved assignment algorithm based rotational angular sorting methods
Authors: Qiang Hua, Bin Wu, Liang Chen
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

The data assignment problem occurs for multiple targets tracking application. It is crucial for the overall performance. In this paper, two observations of date assignment are considered, and then a new rotational sorting algorithm based on maximum likelihood principle was presented. The given algorithm of O(logN) and O(N2) complexity developed is faster than the more popularly used Hungarian type O(N3) algorithm.
New optimization approach in the design of E-shaped patch antenna
Authors: Abbas Lotfi Neyestanak, Farrokh Hojjat Kashani, Masood Khosroshahy
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

In this paper, the bandwidth of the E-shaped microstrip antenna is optimized using the genetic algorithm (GA) based on fuzzy decision-making. The method of moments is employed for analysis at the frequency band of 1.8GHz - 2.6GHz by the optimization parameters of supply locations and slot dimensions. In the implemented fuzzy system, inputs are parameters like population, and outputs are parameters such as recombination to produce the next generation. Fuzzy inference system is used for the controlling of the genetic algorithm parameters. Simulation results show the high capability of genetic optimization based on fuzzy system and hence reaching a bandwidth of about 33.4%. The measured results of the optimized antenna validate a high compatibility between the simulation and the measurements.
Computing in solvable matrix groups
Authors: E. M. Luks
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The author announces methods for efficient management of solvable matrix groups over finite fields. He shows that solvability and nilpotence can be tested in polynomial-time. Such efficiency seems unlikely for membership-testing, which subsumes the discrete-log problem. However, assuming that the primes in mod G mod (other than the field characteristic) are polynomially-bounded, membership-testing and many other computational problems are in polynomial time. These problems include finding stabilizers of vectors and of subspaces and finding centralizers and intersections of subgroups. An application to solvable permutation groups puts the problem of finding normalizers of subgroups into polynomial time. Some of the results carry over directly to finite matrix groups over algebraic number fields; thus, testing solvability is in polynomial time, as is testing membership and finding Sylow subgroups.
Correlation of Amino Acid Physicochemical Properties with Protein Secondary Structure Conformation
Authors: Gouchol Pok, Cheng Hao Jin, Keun Ho Ryu
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Eight representative physicochemical properties of amino acids are considered to encode each residue and correlative information is examined in relation to the formation of protein secondary structure. Features salient at the coarse level are first gleaned through vector quantization technique and then more refined class-specific features are identified based on the vector element-wise analysis. Effectiveness of the method has been validated in experiments to predict secondary structure using the widely used protein sequence sets. Heuristic rationale for advantage of using physicochemical properties of amino acids over the conventional statistics-based method relying on the frequency of residue occurrence is also presented.
Game chromatic number of outerplanar graphs
Authors: D. J. Guan, Xuding Zhu
Venue: Journal of Graph Theory (1999)

This note proves that the game chromatic number of an outerplanar graph is at most 7. This improves the previous known upper bound of the game chromatic number of outerplanar graphs. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 30: 67&ndash;70, 1999
Economic and Security Aspects of Applying a Threshold Scheme in e-Health
Authors: Bernhard Riedl, Veronika Grascher, Mathias Kolb, Thomas Neubauer
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Today, the healthcare sector is driven by the need to reduce costs while simultaneously increasing the service quality for patients. This goal can be reached by the implementation of Electronic Health Records. Although several architectures have been proposed, these approaches lack appropriate security mechanisms to protect the patients' privacy. This paper outlines our approach called PIPE, which is applicable for the primary and secondary usage of health data, and gives insights on the security of our technique. Furthermore, we state the economic constraints of using a threshold scheme to secure the tokens needed for accessing the system.