ppxscal/embedding_network huggingface dataset:
Multifield Analysis Using Multiple Code Coupling of a MEMS Based Micropump with Biocompatible Membrane Materials for Biomedical Applications
Authors: Asim Nisar, Nitin Afzulpurkar, Banchong Mahaisavariya, Adisorn Tuantranont
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

We present multifield analysis of a MEMS based piezoelectrically actuated valveless micropump with biocompatible polymer membrane materials for drug delivery applications. A three dimensional model of the micropump is built and fluid-structure interface effects have been taken into account in finite element analys isusing multifield code coupling method. The dependency of the micropump characteristics on micro pump dimensions and membrane and actuator materials is investigated. The analysis predicts that there is a definite relationship between membrane and piezoelectric layer thickness to obtain maximum pumpflow. Diffuser geometrical dimensions such as diffuser length, diffuser neck width and diffuser angle play a critical to enhance the performance of the micropumpand need to be optimized before fabrication.
Asymmetric model for active measurements in the internet
Authors: J. William Atwood, J. W. Im, Y. C. Jung
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

We introduce a methodology to quantify the level of asymmetry on communication paths, which is inevitable in Internet active measurements. It is measured while the active host and the measured host are synchronized to the same real time. A new model is proposed for the reliable estimate of the accuracy of the one-way delay from general active measurements. The asymmetric model can predict the level of asymmetry in active measurements using only round trip times measured even though two hosts are not synchronized.
A New Machine Scheduling Problem with Temperature Loss
Authors: Danyu Bai, Lixin Tang, Meng Su
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

This paper considers a new problem of scheduling hot jobs with nonlinear Temperature Drop Curve which is more approximate to the real situation than linear Temperature Drop Curve to minimize the total temperature drop loss. In the problem, all jobs have the same Temperature Drop Curve and different processing times. In this paper, two cases of problems are studied. 1) For the case of jobs without release dates, we prove that the Shortest Processing Time first rule is optimal to the single-machine problem. And we extend the result to the parallel-machine problem. 2) For the case of jobs with release dates, the singlemachine problem is strongly NP-hard. And a heuristic, Modified Shortest Processing Time first, is proposed to deal with the problem. In order to verify the performance of the heuristic, a lower bound based on release times delaying is presented. Computational results show the effectiveness of the heuristic on a set of random test problems. Key words: Scheduling, Temperature Drop Curve, NP-hard, Total Temperature Drop Loss
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms
Authors: Hal Gabow
Venue: Proceedings In Applied Mathematics (2007)

Discrete mathematics and graph theory, including combinatorics, combinatorial optimization and networks. Preface Acknowledgments Region-Fault Tolerant Geometric Spanners, M. A. Abam, M. de Berg, M. Farshi, and J. Gudmundsson A PTAS for TSP with Neighborhoods among Fat Regions in the Plane, Joseph S. B. Mitchell Optimal Dynamic Vertical Ray Shooting in Rectilinear Planar Subdivisions, Yoav Giyora and Haim Kaplan Squarepants in a Tree: Sum of Subtree Clustering and Hyperbolic Pants Decomposition, David Eppstein A Near Linear Time Constant Factor Approximation for Euclidean Bichromatic Matching (Cost), Piotr Indyk Compacting Cuts: A New Linear Formulation for Minimum Cut, Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, and Ojas Parekh Linear Programming Relaxations of Maxcut, Wenceslas Fernandez de la Vega and Claire Kenyon-Mathieu Near-Optimal Algorithms for Maximum Constraint Satisfaction Problems, Moses Charikar, Konstantin Makarychev, and Yury Makarychev Improved Bounds for the Symmetric Rendezvous Value on the Line, Qiaoming Han, Donglei Du, Juan Vera, and Luis F. Zuluaga Efficient Solutions to Relaxations of Combinatorial Problems with Submodular Penalties via the Lovsz Extension and Non-smooth Convex Optimization, Fabin A. Chudak and Kiyohito Nagano Multiple Source Shortest Paths in a Genus g Graph, Sergio Cabello and Erin W. Chambers Obnoxious Centers in Graphs, Sergio Cabello and Gnter Rote Maximum Matching in Graphs with an Excluded Minor, Raphael Yuster and Uri Zwick Faster Dynamic Matchings and Vertex Connectivity, Piotr Sankowski Efficient Algorithms for Computing All Low s-t Edge Connectivities and Related Problems, Ramesh Hariharan, Telikepalli Kavitha, and Debmalya Panigrahi Analytic Combinatorics A Calculus of Discrete Structures, Philippe Flajolet Equilibria in Online Games,Roee Engelberg and Joseph (Seffi) Naor The Approximation Complexity of Win-Lose Games, Xi Chen, Shang-Hua Teng, and Paul Valiant Convergence to Approximat
On the power efficiency of cascode compensation over Miller compensation in two-stage operational amplifiers
Authors: Hamed Aminzadeh, Khalil Mafinezhad
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

Optimization of power consumption is one of the main design challenges in today's low-power high-speed analog integrated circuits. In this paper, two popular techniques to stabilize two-stage operational amplifiers, namely Miller and cascode compensations are compared from power point of view. To accomplish this, the cascode-compensated structure is basically analyzed to derive the required equations for comparison. The results show that for the same specifications, cascode compensation is more power efficient than Miller compensation especially for heavy capacitive loads. This has been confirmed by circuit-level simulations in 0.25μm CMOS technology.
Evaluation of Ku-band QuikSCAT scatterometer data for rice crop growth stage assessment
Authors: S. R. Oza, J. S. Parihar
Venue: International Journal of Remote Sensing (2007)

A study has been carried out to analyse the high temporal Ku-band scatterometer data from QuikSCAT with 4.45 km resolution for regional assessment of rice crop phenology. Four-day composite data were used covering the two predominant rice-growing states in India during the monsoon season of 2004. These data were registered with reference to a rice map derived from RADARSAT SAR data of the same season in order to select predominant rice sites. Analysis shows the dual peak backscatter profile of rice crop (at tillering stage and another at maturity). Minima of the backscatter profile were found to coincide with the heading. The derived heading stage using a lognormal curve fitting matched well with the observed dates. The slope of the second peak varied with crop variety, and shows the potential of correlation with the panicle characteristic.
Performance comparison between HMLP, MLP and recurrent networks with applications to carbon monoxide concentrations forecasting
Authors: Usharani Raji, M. Y. Mashor, A. H. Adom, A. N. Ali, A. F. Sadullah
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

This paper compares the performance of Hybrid Multilayered Perceptron (HMLP) network, Multilayered Perceptron (MLP) network and Recurrent network. These networks are used to model and forecast carbon monoxide (CO) concentration. Two data sets are used for the comparison, one data set from simulated environment and one real data set obtained from Malaysian Environmental Department (ASMA). The forecasting performances of these models are evaluated using index of coefficient (R2), one step ahead prediction (OSA) and multi step ahead prediction (MSA). The results obtained from both data sets indicate that HMLP network gives the best performance compared to MLP and Recurrent networks.
A flexible extension of XPath to improve XML querying
Authors: Ernesto Damiani, Stefania Marrara, Gabriella Pasi
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

This work presents a flexible XML selection language, FleXPath which allows the formulation of flexible constraints on both structure and content of XML documents. Some experimental results, obtained with a preliminary prototype, are described in order to show that the idea promises good results.
A structural model of end-user computing competency and user performance
Authors: Chui Young Yoon
Venue: Knowledge-Based Systems (2008)

The proliferation of end-user computing has necessitated the development of reliable and valid instruments that measure the end-user computing competency (EUCC) in a computing environment, which is related to improve user performance. A measurement instrument is developed to measure an end-user computing competency in this environment. Using an exploratory factor analysis of 348 respondents, four factor dimensions for the measurement of EUCC is first identified, and then structural equation modeling techniques are utilized to examine the relationship between EUCC and user performance. It is shown that the four factor dimensions of EUCC account for a significant portion of the variation in user performance.
Measurement-based characterization of IP VPNs
Authors: Satish Raghunath, K. K. Ramakrishnan, Shivkumar Kalyanaraman
Venue: IEEE/ACM Transactions on Networking (TON) (2007)

Virtual Private Networks (VPNs) provide secure and reliable communication between customer sites. With the increase in number and size of VPNs, providers need efficient provisioning techniques that adapt to customer demand by leveraging a good understanding of VPN properties. In this paper, we analyze two important properties of VPNs that impact provisioning: 1) structure of customer endpoint (CE) interactions and 2) temporal characteristics of CE-CE traffic. We deduce these properties by computing traffic matrices from SNMP measurements. We find that existing traffic matrix estimation techniques are not readily applicable to the VPN scenario due to the scale of the problem and limited measurement information. We begin by formulating a scalable technique that makes the most out of existing measurement information and provides good estimates for common VPN structures. We then use this technique to analyze SNMP measurement information from a large IP VPN service provider. We find that even with limited measurement information (no per-VPN data for the core) we can estimate traffic matrices for a significant fraction of VPNs, namely, those constituting the "Huband-Spoke" category. In addition, the ability to infer the structure of VPNs holds special significance for provisioning tasks arising from topology changes, link failures and maintenance. We are able to provide a classification of VPNs by structure and identify CEs that act as hubs of communication and hence require prioritized treatment during restoration and provisioning.
Knowledge communication in rate.ee, a web picture-rating community
Authors: Anni Oja, Jaak Simm
Venue: International Journal of Web Based Communities (2008)

This study analyses the knowledge communication processes in the rate.ee web portal in the contexts of knowledge communication and cultural communication. The primary domains where the members of rate.ee participate in knowledge communication are technical and social communication skills, cultural knowledge (like language, norms, values) and specific domains of interest. The users are highly motivated not only to exchange knowledge, but mainly to promote themselves, develop relations with others, develop social networks and design their identities. The knowledge communication processes in such a situation are more complex and less conventional than in task-oriented groups. In the case of this large social community, the communicators and their background, the cultural reality and the technical possibilities of the environment may play an even more important role than the knowledge itself.
U-City User Authentication Methods and Encryption Techniques Based on Biometric Technology
Authors: Youngjun Kim, Jason Kim
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

This paper proposes user authentication methods and encryption techniques that support reliable u-City user authentication services, based on biometric technology, (the use of face, vein, fingerprint, and iris recognition). Even in an advanced wire/wireless network environment, there remain the possibilities that personal confidential information may be exposed. Therefore, this paper proposes a method that prevents damage and effectively copes with security vulnerabilities, using an encryption method that applies to characteristics information twice, in addition to an authentication method based on biometric technology. The proposed user authentication technique randomly selects several biometric information items at the time of authentication, and applies more than two items of biometric information. In addition, the proposed encryption technique uses double encryption, utilizing the user's biometric characteristics information. This paper aims to guarantee an efficient and reliable user authentication service in a u-City environment, based on this methodology.
Using quantum-behaved particle swarm optimization algorithm to solve non-linear programming problems
Authors: Jun Sun, Jing Liu, Wenbo Xu
Venue: International Journal of Computer Mathematics (2007)

In this paper, we focus on solving non-linear programming (NLP) problems using quantum-behaved particle swarm optimization (QPSO). After a brief introduction to the original particle swarm optimization (PSO), we describe the origin and development of QPSO, and the penalty function method for constrained NLP problems. The performance of QPSO is tested on some unconstrained and constrained benchmark functions and compared with PSO with inertia weight (PSO-In) and PSO with constriction factor (PSO-Co). The experimental results show that QPSO outperforms the traditional PSOs and is a promising optimization algorithm.
On k-ordered graphs
Authors: Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda Lesniak
Venue: Journal of Graph Theory (2000)

Ng and Schultz [J Graph Theory 1 (1997), 45&ndash;57] introduced the idea of cycle orderability. For a positive integer k, a graph G is k-ordered if for every ordered sequence of k vertices, there is a cycle that encounters the vertices of the sequence in the given order. If the cycle is also a Hamiltonian cycle, then G is said to be k-ordered Hamiltonian. We give sum of degree conditions for nonadjacent vertices and neighborhood union conditions that imply a graph is k-ordered Hamiltonian. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 35: 69&ndash;82, 2000 The first author was supported by the fund for the promotion of research at the Technion. The second author was supported by NSERC.
Electric Circuits, 6 edition
Authors: David A. Bell
Venue:  (2007)

This basic book on electricity, magnetism, and dc and ac circuits combines understandable explanations with clear illustrations to make the theory interesting and easy to understand. As a result, it is the perfect introduction to the field for readers with no previous exposure to electrical studies, and an excellent refresher for those with electrical knowledge. Beginning with fundamental concepts, the full spectrum of electric circuit topics is covered in non-intimidating fashion, from simple dc circuits to complex ac network analysis, including resonance, transformers, and three-phase ac circuits. Excellent, informatively-captioned illustrations help students understand each new concept or analysis method. Early coverage includes how to use electrical instruments and a later chapter treats the application of an oscilloscope for ac waveform study. The final chapters introduce computer analysis methods, showing PSpice and BASIC programs for analysis of problems given in examples throughout the text.
Measuring and guaranteeing quality of barrier-coverage in wireless sensor networks
Authors: Ai Chen, Ten H. Lai, Dong Xuan
Venue: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing (2008)

Sensors may fail due to various reasons such as heat, malicious activity, environmental hazards, extended use, and lack of power. As more and more sensors fail, certain desired properties such as barrier coverage will diminish and eventually fall below a desired level. In such a case, the network will have to be repaired. It is therefore desirable to have mechanisms to monitor network properties. In this paper, we are interested in measuring the quality of barrier coverage. In the literature, researchers only consider whether or not a sensor network provides barrier coverage. This is equivalent to measuring its quality as either 0 or 1. We believe quality of barrier coverage is not binary and propose a metric for measuring it. If the measured quality is short of a desired value, we further identify all local regions that need to be repaired. The identified regions are minimum in the sense that if one of them is not repaired then the resulting network will still be short of quality. We also discuss how to actually repair a region.
Efficiently solving convex relaxations for MAP estimation
Authors: M. Pawan Kumar, P. H. S. Torr
Venue: Proceedings of the 25th international conference on Machine learning (2008)

The problem of obtaining the maximum a posteriori (MAP) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build on the tree reweighted message passing (TRW) framework of (Kolmogorov, 2006; Wainwright et al., 2005). TRW iteratively optimizes the Lagrangian dual of a linear programming relaxation for MAP estimation. We show how the dual formulation of TRW can be extended to include cycle inequalities (Barahona & Mahjoub, 1986) and some recently proposed second order cone (SOC) constraints (Kumar et al., 2007). We propose efficient iterative algorithms for solving the resulting duals. Similar to the method described in (Kolmogorov, 2006), these algorithms are guaranteed to converge. We test our approach on a large set of synthetic data, as well as real data. Our experiments show that the additional constraints (i.e. cycle inequalities and SOC constraints) provide better results in cases where the TRW framework fails (namely MAP estimation for non-submodular energy functions).
Adaptive spike detection for resilient data stream mining
Authors: Clifton Phua, Kate Smith-Miles, Vincent Lee, Ross Gayler
Venue: Proceedings of the sixth Australasian conference on Data mining and analytics - Volume 70 (2007)

Automated adversarial detection systems can fail when under attack by adversaries. As part of a resilient data stream mining system to reduce the possibility of such failure, adaptive spike detection is attribute ranking and selection without class-labels. The first part of adaptive spike detection requires weighing all attributes for spiky-ness to rank them. The second part involves filtering some attributes with extreme weights to choose the best ones for computing each example's suspicion score. Within an identity crime detection domain, adaptive spike detection is validated on a few million real credit applications with adversarial activity. The results are F-measure curves on eleven experiments and relative weights discussion on the best experiment. The results reinforce adaptive spike detection's effectiveness for class-label-free attribute ranking and selection.
A Stochastic Availability Prediction Model for Head Nodes in the HA Cluster
Authors: Yong-Ju Lee, Hag-Young Kim, Cheol-Hoon Lee
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

In this paper, we propose a stochastic availability prediction model for head nodes in a high-availability (HA) cluster. Our model considers basic components (such as the head node and switch) in HA cluster and suggests simple node failure prediction through the survival probability of a node and the steady-state prediction of a two-component redundant system.
The Differential Performance Effects of Healthcare Information Technology Adoption
Authors: Anol Bhattacherjee, Neset Hikmet, Nir Menachemi, Varol O. Kayhan, Robert G. Brooks
Venue: Information Systems Management (2007)

This article examines the relationship between the adoption of healthcare information technology (HIT) and a hospital's operational performance. Combining primary survey data from Florida hospitals and secondary data from two government agencies responsible for hospital certification and licensing, the authors find differential performance effects for different clusters of HIT: administrative, clinical, and strategic. Only clinical HIT investments were found to have a statistically significant positive effect on operational performance.
Doppler spectrum analysis for the hyperbolic macrocell channel model
Authors: Seedahmed S. Mahmoud, Zahir M. Hussain, Peter O'Shea
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

In this paper we investigate the statistical properties of the Doppler spectrum for the recently-proposed hyperbolic macrocell channel model. Doppler spectrum accounts for the distribution of power at each direction-of-arrival (DOA). It is well-known that the Doppler spectrum is dependent on the probability density function of the DOA of the multipath components at the mobile station and the direction of motion of the mobile. We derive and simulate the joint probability density functions (pdfs) of the power-Doppler shift, and the Doppler spectrum pdf.
A new cryptography algorithm using cab curves an LDPC for wireless communication systems
Authors: B. Ontiveros, I. Soto, R. Carrasco
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

In this paper we propose a new public key cryptographic system using Cab curves and Low Density Parity Check (LDPC) codes for mobile communication. This algorithm uses the Jacobian group of the Cab curves as a mathematical group to perform the encoder and space time operations. This paper offers an improved performance of 17.27 dB for BER = 10-5 against BPSK over a Fading channel.
ISEDS: An Information Security Engineering Database System Based on ISO Standards
Authors: Daisuke Horie, Shoichi Morimoto, Noor Azimah, Yuichi Goto, Jingde Cheng
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Security facilities of information systems with high security requirements should be consistently and continuously developed, used, and maintained based on some common standards of information security. However, there is no engineering environment that can support all tasks in security engineering consistently and continuously. To construct a security engineering environment, a database that can manage all data concerning all tasks in security engineering is indispensable.This paper presents an Information Security Engineering Database System, named "ISEDS," that we are developing based on ISO standards, and shows its some possible applications. ISEDS manages data of ISO standards of information security and various cases of system development and maintenance. We adopted the international standard ISO/IEC 15408 (Common Criteria) for information security evaluation as one of ISO standards to underlie ISEDS, and implemented major functions of ISEDS and its application tools to manage and use data of ISO/IEC 15408.Developers, users, and maintainers can create, correct, and verify specification documents of security facilities with the application tools.