ppxscal/embedding_network huggingface dataset:
A pilot study to evaluate self initiated computer patient education in children with acute asthma in pediatric emergency department
Authors: Ashish Joshi, Richard Lichenstein, Keyvan Rafei, Adnan Bakar, Mohit Arora
Venue: Technology and Health Care (2007)

Objective: The goal of the study was to investigate the feasibility and acceptance of an interactive computer assisted asthma education program in the pediatric emergency department (ED) for children with acute asthma exacerbations. Methods: A pre-post non- randomized study was designed for children age 3 to 18 years at the University of Maryland Hospital for Children, Baltimore. An interactive computer-assisted educational program, Patient Education and Motivation Tool (PEMT), was designed using learning theories, to teach children about asthma and its management. Sixty nine children were enrolled during an ED visit for acute asthma between May 2006 and November 2006. Socio-demographic and asthma knowledge information was gathered using questionnaires. An attitudinal survey was used to assess the acceptance of the program. Results: Eighty one percent (n=56) of the children found PEMT very easy to use, and seventy five percent (n=52) agreed to use it in near future. There was a significant thirteen percent improvement in knowledge of asthma after the completion of this computer assisted asthma education program (p=0.01). Conclusion: PEMT is highly acceptable and is an effective way to provide asthma education in an ED setting.
Adaptive Service Provisioning through Context-Aware SIP Proxy
Authors: Tang Tang, Zhengkun Mi, Rongqun Peng
Venue: Proceedings of the Fourth International Conference on Networking and Services (2008)

A novel idea is proposed to provide context-aware adaptive services by use of widely adopted Session Initiation Protocol (SIP) in NGN. As the key to the idea, a new context-aware SIP proxy is worked out. It will support environment adaptability through policy decision and exchange of context information using SIP and its sibling protocols. In this new proxy, we propose to deliver context according to specific environment characteristics. Network context sensing and control is another contribution in our work. This solution helps us to control QOS and realize network and service adaptation practically. Realization of context-aware adaptation within SIP-based sessions is explained with two application scenarios.
Implementation of Wave-Pipelined Interconnects in FPGAs
Authors: Terrence Mak, Crescenzo D'Alessandro, Pete Sedcole, Peter Y. K. Cheung, Alex Yakovlev, Wayne Luk
Venue: Proceedings of the Second ACM/IEEE International Symposium on Networks-on-Chip (2008)

Global interconnection and communication at high clock frequencies are becoming more problematic in FPGA. In this paper, we address this problem by presenting an interconnect wave-pipelining strategy, which utilizes the existing programmable interconnects fabrics to provide high-throughput communication in FPGA. Two design approaches for interconnect wave-pipelining, using simple clock phase shifting and asynchronous phase encoding, are presented in this paper. Experimental results from a Xilinx Virtex-5 FPGA device are also presented.
Power-Aware Node Deployment in Wireless Sensor Networks
Authors: Yunhuai Liu, Hoilun Ngan, Lionel M. Ni
Venue: International Journal of Distributed Sensor Networks (2007)

Wireless sensor networks (WSNs) have attracted intense interest due to their extensible capability. In this paper, we attempt to answer a fundamental but practical question: "how should we deploy these nodes?" In most current designs, sensor nodes are randomly or uniformly distributed because of their simplicity. However, the node deployment has a great impact on the performance of WSNs. Instead of maintaining the coverage for some snapshots of a WSN, it is essential that we can provide a continuous coverage in the whole lifecycle of the WSN. We will exhibit the weakness of the uniform distribution by disclosing the fatal sink routing-hole problem. To address this problem, we propose a non-uniform, power-aware distribution scheme. Our analysis and simulation results show that the power-aware deployment scheme can significantly improve the long-term network connectivity and service quality.
Improving IEEE 802.11 power saving mechanism
Authors: Eun-Sun Jung, Nitin H. Vaidya
Venue: Wireless Networks (2008)

This paper presents an optimization of the power saving mechanism in the Distributed Coordination Function (DCF) in an Independent Basic Service Set (IBSS) of the IEEE 802.11 standard. In the power saving mode specified for DCF, time is divided into so-called beacon intervals. At the start of each beacon interval, each node in the power saving mode periodically wakes up for a duration called the ATIM Window. Nodes are required to be synchronized to ensure that all nodes wake up at the same time. During the ATIM window, the nodes exchange control packets to determine whether they need to stay awake for the rest of the beacon interval. The size of the ATIM window has a significant impact on energy saving and throughput achieved by the nodes. This paper proposes an adaptive mechanism to dynamically choose a suitable ATIM window size. We also allow the nodes to stay awake for only a fraction of the beacon interval following the ATIM window. On the other hand, the IEEE 802.11 DCF mode requires nodes to stay awake either for the entire beacon interval following the ATIM window or not at all. Simulation results showthat the proposed approach outperforms the IEEE 802.11 power saving mechanism in terms of throughput and the amount of energy consumed.
A Dynamic Skip List-Based Overlay for On-Demand Media Streaming with VCR Interactions
Authors: Dan Wang, Jiangchuan Liu
Venue: IEEE Transactions on Parallel and Distributed Systems (2008)

Media distribution through application-layer overlay networks has received considerable attention recently, owing to its flexibility and readily deployable nature. On-demand streaming with asynchronous requests, and in general, with VCR-like interactions, nevertheless remains a challenging task in overlay networks. In this paper, we introduce the Dynamic Skip List (DSL), a novel randomized and distributed structure that inherently accommodates dynamic and asynchronous clients. We establish the theoretical foundations of the DSL and demonstrate a practical DSL-based streaming overlay. In this overlay, the costs for typical operations, including join, leave, fast-forward, rewind, and random-seek are all sub-linear to the client population. The model also seamlessly integrates a smart data scheduling algorithm using linear network coding, yielding fast and robust downloading from multiple suppliers. Our simulation results show that the DSL-based overlay is highly scalable. It delivers reasonably smooth playback with diverse client interactivities, while keeping the computation and bandwidth overheads low.
Optimization Techniques for Semi-Supervised Support Vector Machines
Authors: Olivier Chapelle, Vikas Sindhwani, Sathiya S. Keerthi
Venue: The Journal of Machine Learning Research (2008)

Due to its wide applicability, the problem of semi-supervised classification is attracting increasing attention in machine learning. Semi-Supervised Support Vector Machines (S3VMs) are based on applying the margin maximization principle to both labeled and unlabeled examples. Unlike SVMs, their formulation leads to a non-convex optimization problem. A suite of algorithms have recently been proposed for solving S3VMs. This paper reviews key ideas in this literature. The performance and behavior of various S3VMs algorithms is studied together, under a common experimental setting.
Paul Wilmott Introduces Quantitative Finance, 2 edition
Authors: Paul Wilmott
Venue:  (2007)

Paul Wilmott Introduces Quantitative Finance, Second Edition is an accessible introduction to the classical side of quantitative finance specifically for university students. Adapted from the comprehensive, even epic, works Derivatives and Paul Wilmott on Quantitative Finance, Second Edition, it includes carefully selected chapters to give the student a thorough understanding of futures, options and numerical methods. Software is included to help visualize the most important ideas and to show how techniques are implemented in practice. There are comprehensive end-of-chapter exercises to test students on their understanding.
Relevance judgments between TREC and Non-TREC assessors
Authors: Azzah Al-Maskari, Mark Sanderson, Paul Clough
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

This paper investigates the agreement of relevance assessments between official TREC judgments and those generated from an interactive IR experiment. Results show that 63% of documents judged relevant by our users matched official TREC judgments. Several factors contributed to differences in the agreements: the number of retrieved relevant documents; the number of relevant documents judged; system effectiveness per topic and the ranking of relevant documents.
A Digital Identity Management Service Model
Authors: Yeonjung Kang, Hearyong Park, Kilsoo Chun, Junghwan Song
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

The incredible progress of information and communication technology has allowed various information and communication services to emerge in the Web environment. Such a service is initiated when the user provides his/her personal information to the service provider and is then given an identifier and authentication data. With the introduction of different services, the need to efficiently manage ID has been raised. In this paper, a Digital Identity Management Service System that enables the control of the flow of the user’s personal information, which is used and stored for the Internet service, is proposed from the user's perspective.
Linked graphs with restricted lengths
Authors: Guantao Chen, Yuan Chen, Shuhong Gao, Zhiquan Hu
Venue: Journal of Combinatorial Theory Series B (2008)

A graph G is k-linked if G has at least 2k vertices, and for every sequence x"1,x"2,...,x"k,y"1,y"2,...,y"k of distinct vertices, G contains k vertex-disjoint paths P"1,P"2,...,P"k such that P"i joins x"i and y"i for i=1,2,...,k. Moreover, the above defined k-linked graph G is modulo(m"1,m"2,...,m"k)-linked if, in addition, for any k-tuple (d"1,d"2,...,d"k) of natural numbers, the paths P"1,P"2,...,P"k can be chosen such that P"i has length d"i modulo m"i for i=1,2,...,k. Thomassen showed that, for each k-tuple (m"1,m"2,...,m"k) of odd positive integers, there exists a natural number f(m"1,m"2,...,m"k) such that every f(m"1,m"2,...,m"k)-connected graph is modulo(m"1,m"2,...,m"k)-linked. For m"1=m"2=...=m"k=2, he showed in another article that there exists a natural number g(2,k) such that every g(2,k)-connected graph G is modulo(2,2,...,2)-linked or there is X@?V(G) such that |X|==2. Our results generalize several known results on parity-linked graphs.
A weighted even factor algorithm
Authors: Kenjiro Takazawa
Venue: Mathematical Programming: Series A and B (2008)

An even factor in a digraph, introduced by Cunningham and Geelen (Vertex-disjoint dipaths and even dicircuits. manuscript, 2001), is a collection of vertex-disjoint dipaths and even dicycles, which generalizes a path-matching of Cunningham and Geelen (Combinatorica 17, 315&#x2013;337, 1997). In a restricted class of digraphs, called odd-cycle-symmetric, Pap (Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, 3509, pp. 66&#x2013;80, Springer, Heidelberg, 2005) presented a combinatorial algorithm to find a maximum even factor. For odd-cycle-symmetric weighted digraphs, which are odd-cycle-symmetric digraphs accompanied by a weight vector satisfying a certain property, Kir&#x00e1;ly and Makai (Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, 3064, pp. 416&#x2013;430, Springer, Heidelberg, 2004) provided a linear program that describes the maximum weight even factor problem, and proved the dual integrality. In this paper, we present a primal-dual algorithm to find a maximum weight even factor for an odd-cycle-symmetric weighted digraph. This algorithm is based on the weighted matching algorithm of Edmonds and the maximum even factor algorithm of Pap. The running time of the algorithm is O(n 3 m), where n and m are the numbers of the vertices and arcs, respectively, which is better than that of the existing algorithms for the special cases. The algorithm also gives a constructive proof for the dual integrality.
Forging connections between life and class using reading assignments: a case study
Authors: Leigh Ann Sudol
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

This paper describes an experiment involving incorporating reading assignments into an introductory programming class at the university level. Results indicate that assignments of this type help students make connections between the concepts they are studying, and computer science in general, with their everyday lives.
Combination of Local Invariants with an Active Shape Model
Authors: Jianhua Zhang, S. Y. Chen
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

In this paper, a novel local invariant model based on Scale Invariant Feature Transform (SIFT) features is presented to accurately obtain and locate the local features of an image. After the local features of each image in the training set are extracted by the SIFT, we eliminate the unsteady factors in term of statistical results of all the SIFT features to establish the local invariant model. The experiments to evaluate the performance of the model are carried out, which prove that the method has the quality of high-repeatability and accuracy and achieves the power of accurately locating the similar objects in different scenes despite the rigid or non-rigid deformation on them. For further investigation, we combine the local invariant model with an Active Shape Model for automatically initialization. Results show that the combined model achieves satisfactory performance.
Integrating onland lineaments with offshore data using a GIS approach-a case study from the Kutch Basin, India
Authors: H. D. Dave, D. S. Mitra
Venue: International Journal of Remote Sensing (2007)

The offshore Kutch Basin is a southwestern extension of the onland Kutch Basin, which is located on the west-northwest margin of the Indian Shield. The objective of this technical note is to map lineaments over the land portion of the Kutch Basin, identify major lineament zones, and provide evidence for the extension of these zones into the offshore portion of the Kutch basin. Lineaments in the onland part have been identified on Landsat TM and IRS-1D WiFS data and three dominant lineament trends, ENE-WSW, NW-SE, and NE-SW, have been identified. In this part of the Kutch Basin, analysis of the lineament map in concert with supporting data (gravity, bathymetry, tectonic) has led to the identification of six major lineament zones, and a number of these zones appear to continue offshore, based on inspection of the supporting data. It appears that these lineament zones have divided the offshore basin into a number of tectonic blocks and this apparent pattern map helps to understand the architecture of the offshore basin.
Examination of image fusion using synthetic variable ratio (SVR) technique
Authors: M. M. Rahman, E. Csaplovics
Venue: International Journal of Remote Sensing (2007)

The current study examines different approaches of computing synthetic variable ratio (SVR) technique of image fusion using Landsat ETM+ and IRS-pan image. The study area is located on a tropical landscape of southeastern Bangladesh. The research work explores an optimal SVR fusion method. The technique functions well in image colour and radiometry if all necessary assumptions are followed. Complications arise due to violation of those assumptions which are also being discussed in the article.
OnD-CRF
Authors: Lixiao Wang, Uwe H. Sauer
Venue: Bioinformatics (2008)

Motivation: Order and Disorder prediction using Conditional Random Fields (OnD-CRF) is a new method for accurately predicting the transition between structured and mobile or disordered regions in proteins. OnD-CRF applies CRFs relying on features which are generated from the amino acids sequence and from secondary structure prediction. Benchmarking results based on CASP7 targets, and evaluation with respect to several CASP criteria, rank the OnD-CRF model highest among the fully automatic server group. Availability: http://babel.ucmp.umu.se/ond-crf/ Contact: Uwe.Sauer@ucmp.umu.se
Multiattribute analysis of the offshore outsourcing location decision using a decision support system framework
Authors: P. D. D. Dominic, Ahmad Kamil Mahmood, V. Murugesh, P. Sridevi
Venue: International Journal of Business Information Systems (2008)

Today's global business environment, characterised by unprecedented competitive pressures and sophisticated customers that demand speedy solutions, creates a large set of potential suppliers to evaluate and select from. The business landscape is currently witnessing widespread migration of services and functions from developed nations like the USA to destinations like India, China, the Philippines, Malaysia, Singapore, Hungary, Poland, New Zealand and other countries. Several factors influence the outsourcers to offshore effectively and efficiently. This paper presents a structured framework with subjective and objective factors for guiding the outsourcers in making the decision on the proper outsourcing location. Based on this, a Decision Support System (DSS) framework was developed to provide a way for outsourcers and practitioners to have a more comprehensive approach to the outsourcing location decision. The process illustrates the way the system aids management in the offshore outsourcing decision through knowledge support.
Optimization of MLP/BP for character recognition using a modified alopex algorithm
Authors: Hirohito Shintani, Masatake Akutagawa, Hirofumi Nagashino, Abhijit S. Pandya, Yohsuke Kinouchi
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2007)

It is difficult to determine the recognition mechanism in the neurons of a neural network trained for pattern recognition due to the non-linear nature of neural networks. This paper describes a recognition mechanism of a four-layer back propagation neural network using Alopex algorithm. We have developed a small-scale, four-layered neural network model for simple character recognition, which can recognize the patterns transformed by affined conversion. Alopex algorithm is an iterative and stochastic processing method, which was proposed for optimization of a given cost function. In this case the receptive fields of the neurons in the output layers are obtained using the Alopex algorithm.
An empirical study on knowledge integration, technology innovation and experimental practice
Authors: Hsu-Fang Hung, Hsing-Pei Kao, Yee-Yeen Chu
Venue: Expert Systems with Applications: An International Journal (2008)

In the global market, inter-firm collaborative product development has become an increasingly significant business strategy for enhanced product competitiveness. Engineering knowledge is a key asset for technology-based enterprises to successfully develop new products and processes. Experimental practice is a crucial process for knowledge integration and technology innovation. This research explores this in inter-firm collaborative product development through experimental practice. We conducted a series of in-depth case studies to investigate the patterns of knowledge integration in the collaborative development of system-on-a-chip (SoC) by semiconductor firms. Our studies focused on the central interactive process for engineering applications and experimental practice to enhance knowledge integration and technology innovation for rapid development. Furthermore, we identified factors critical for experimental practice in effective engineering knowledge integration and innovation.
An Improved Particle Swarm Optimization with New Select Mechanism
Authors: Yi Jiang, Qingling Yue
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

The particle swarm optimization is a stochastic, population-based optimization technique. A modified PSO algorithm is proposed in this paper to avoid premature convergence with the new select mechanism. This mechanism is simulating the principle of molecular dynamics, which attempts to active all particles as the most possible along with their population evolving. Two stopping criteria of the algorithm are derived from the principle of energy minimization and the law of entropy increasing. The performance of this algorithm is compared to the standard PSO algorithm and experiments indicate that it has better performance.
Personalized E-learning System by Using Intelligent Algorithm
Authors: Mingmin Gong
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Nowadays, Network and multimedia are the trend of the development of the modern education technology. With the rapid development of the network technique and the prevalence of the Internet, Elearning has become the major trend of the development of international education since 1980's, and the important access for the internationalization and the information of education. To meet the personalized needs of learners in E-learning, a new intelligent algorithm is proposed in the paper by using personality, association rules mining and collaborative filtering technologies. The Intelligent algorithm is composed of two phases: association rules algorithm and collaborative filtering.
A general approach to securely querying XML
Authors: Ernesto Damiani, Majirus Fansi, Alban Gabillon, Stefania Marrara
Venue: Computer Standards Interfaces (2008)

XML access control requires the enforcement of highly expressive access control policies to support schema-, document and object-specific protection requirements. Access control models for XML data can be classified in two major categories: node filtering and query rewriting systems. The first category includes approaches that use access policies to compute secure user views on XML data sets. User queries are then evaluated on those views. In the second category of approaches, authorization rules are used to transform user queries to be evaluated against the original XML data set. The pros and cons for these approaches have been widely discussed in the framework of XML access control standardization activities. The aim of this paper is to describe a model combining the advantages of these approaches and overcoming their limitations, suitable as the basis of a standard technique for XML access control enforcement. The model specification is given using a Finite State Automata, ensuring generality w.r.t. specific implementation techniques.
Without a reference clock wide tuning range clock and data recovery circuit
Authors: Si-Young Choi, Hang-Geun Jeong
Venue: Proceedings of the 2nd WSEAS International Conference on Circuits, Systems, Signal and Telecommunications (2008)

This paper describes the design and fabrication of a clock and data recovery circuit (CDR). This clock and data recovery circuit utilizes a linear phase detector (PD) and full-rate frequency detector (FD), a self-biased ring voltage controlled oscillator (VCO). The proposed CDR can also remove virtually all of the process technology and environmental variability by using a self-biasing method. The proposed CDR circuit can achieve a wide acquisition range without using the reference clock. A ring VCO used in this CDR circuit has a wide operating frequency range of 250 MHz to 2.0 GHz. The CDR circuit has been fabricated in a standard 0.18µm CMOS technology. It occupies an active area of 1 x 1mm2 and consumes 120 mW from a single 1.8V supply.