ppxscal/embedding_network huggingface dataset:
Maximum scan statistics and channel assignment problems in homogeneous wireless networks
Authors: Chih-Wei Yi
Venue: Theoretical Computer Science (2009)

In wireless networks, to avoid collisions of simultaneous transmissions over the same channel, adjacent nodes are assigned distinct channels, and the least number of channels used in an assignment is called the chromatic number. The determination of the chromatic number is NP-hard. In this paper, we introduce an analytic tool called maximum scan statistics. For a finite point set V and a convex compact set C, the maximum scan statistic of V with respect to the scanning set C is the largest number of points in V covered by a copy C. Based on the study of asymptotic maximum scan statistics, we obtain the asymptotics of the maximum degree and the clique number of homogeneous wireless networks. The results imply that the chromatic number is almost surely at most four times the clique number. We further prove that the approximation ratios of some vertex-ordering-based First-Fit channel assignment algorithms are almost surely bounded by 2. In the analysis, we also learn that the chromatic number is almost surely at most twice the clique number.
Research on Software Vulnerability Testing Based on Function-Call
Authors: Fanping Zeng, Minghui Chen, Kaitao Yin, Xufa Wang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

On the basis of analyzing the safety formulas for various types of vulnerabilities, this paper presents a novel method for software vulnerability testing, which uses source-code conversion and the state information of function-call to test the vulnerability of software. This method could cover a variety of vulnerabilities. The implementation shows that it can check the attack of buffer overflow accurately, on the occasions of no large losses in performance.
Technology-enhanced learning tools in European higher education
Authors: Radek Matušů, Jiří Vojtešek, Tomáš Dulík
Venue: Proceedings of the 8th WSEAS international conference on Distance learning and web engineering (2008)

The main aim of the contribution is to investigate which technology-enhanced learning tools are nowadays used in European higher education, to what specific purposes and how intensively they are employed, and what costs are associated to them. The source of presented information is based on responses of 100 universities from 27 European countries to a "Learning Tools Survey", which has been created in Vienna University of Economics and Business Administration and which was distributed under the terms of the European IST project iCamp.
Review: Investigation of pollution flashover on high voltage insulators using artificial neural network
Authors: M. T. Gençoğlu, M. Cebeci
Venue: Expert Systems with Applications: An International Journal (2009)

High voltage insulators form an essential part of the high voltage electric power transmission systems. Any failure in the satisfactory performance of high voltage insulators will result in considerable loss of capital, as there are numerous industries that depend upon the availability of an uninterrupted power supply. The importance of the research on insulator pollution has been increased considerably with the rise of the voltage of transmission lines. In order to determine the flashover behavior of polluted high voltage insulators and to identify to physical mechanisms that govern this phenomenon, the researchers have been brought to establish a modeling. Artificial neural networks (ANN) have been used by various researches for modeling and predictions in the field of energy engineering systems. In this study, model of V"C=f (H,D,L,@s,n,d) based on ANN which compute flashover voltage of the insulators were performed. This model consider height (H), diameter (D), total leakage length (L), surface conductivity (@s) and number of shed (d) of an insulator and number of chain (n) on the insulator.
Parallel Point Symmetry Based Clustering for Gene Microarray Data
Authors: Anasua Sarkar, Ujjwal Maulik
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

Point symmetry-based clustering is an important unsupervised learning tool for recognizing symmetrical convex or non-convex shaped clusters, even in the microarray datasets. To enable fast clustering of this large data, in this article, a distributed space and time-efficient scalable parallel approach for point symmetry-based K-means algorithm has been proposed. A natural basis for analyzing gene expression data using this symmetry-based algorithm, is to group together genes with similar symmetrical patterns of expression. This new parallel implementation satisfies the quadratic reduction in timing, as well as the space and communication overhead reduction without sacrificing the quality of clustering solution. The parallel point symmetry based K-means algorithm is compared with another newly implemented parallel symmetry-based K-means and existing parallel K-means over four artificial, real-life and benchmark microarray datasets, to demonstrate its superiority,both in timing and validity.
A New Approach for Security in MPLS Multicast Networks
Authors: Sahel Alouneh, Anjali Agarwal, Abdeslam En-Nouaary
Venue: Proceedings of the 5th International Conference on Distributed Computing and Internet Technology (2008)

This paper proposes a new approach to provide security for MPLS multicast networks. The proposed work is based on the (k, k) Threshold Sharing Scheme (TSS) where it can protect the confidentiality of IP multicast packets transmitted though the MPLS networks. The receivers for a multicast session can reconstruct the original traffic from the k trees available. Therefore, the attacker must tap all k trees to be able to reconstruct the original IP multicast packets that are being transmitted, while attacking k&thinsp;&minus;&thinsp;1 or less of these trees makes it hard or even impossible to reconstruct the original IP multicast packets. Our proposed work can also provide protection against IP spoofing attacks. Moreover, our objective is also to minimize bandwidth overhead.
Data fusion and topology control in wireless sensor networks
Authors: Vrinda Gupta, Rajoo Pandey
Venue: Proceedings of the 5th conference on Applied electromagnetics, wireless and optical communications (2007)

The design of large-scale sensor networks interconnecting various sensor nodes has spurred a great deal of interest due to its wide variety of applications. Wireless sensor networks allow distributed sensing and signal processing while collaborating during energy efficient operations. Wireless sensor networks are battery powered; therefore prolonging the network lifetime through an energy aware node organization is highly desirable. This paper highlights the advantages of data fusion and topology control in wireless sensor networks. Our aim is to provide a better understanding of the current research issues in this field. The paper provides a more detailed look at some existing data fusion and topology management algorithms.
A direct integration formulation for exponentially damped structural systems
Authors: Fernando Cortés, Modesto Mateos, María Jesús Elejabarrieta
Venue: Computers and Structures (2009)

This paper presents a direct integration formulation for damped structural systems in which damping is characterised by exponential law models. In effect, for non-viscously damped systems the damping forces appearing in the equation of motion are represented by convolution integrals, which take into account the complete history of the load. The proposed formulation employs the Laplace transformation of the motion equation to transform it into a differential equation with time derivative orders higher than two, in contrast to the classical M-C-K-F equation of structural dynamics. Due to the difficulty to manipulate these high order derivatives, the particular case of a damping model with only two kernel functions is taken into account. Then, an implicit direct integration scheme is proposed to discretize the motion equation, which becomes an equivalent second-order M"e"q-C"e"q-K"e"q-F"e"q equation. In contrast with other methods revised in the literature, the proposed formulation does not employ internal variables, which normally enlarge the size of the system. Besides, standard direct integration schemes such as those of Newmark's family can be employed. In the last part of the paper two numerical examples are presented: one for a three degrees-of-freedom system, and another one for a finite element application.
Empirical Effective Bandwidth Estimation for IPTV Admission Control
Authors: Alan Davy, Dmitri Botvich, Brendan Jennings
Venue: Proceedings of the 10th IFIP/IEEE International Conference on Management of Multimedia and Mobile Networks and Services: Real-Time Mobile Multimedia Services (2008)

We propose an admission control approach for IPTV in which decisions to admit new flows are based on effective bandwidth estimates calculated using empirical traffic measurement. We describe our approach to estimate the effective bandwidth required to satisfy given Quality-of-Service constraints on traffic and specify a simple admission control algorithm which uses this estimation to manage flow admissions. We present the results of a simulation study, employing real traffic traces for long-lived flows, which indicate that our algorithm ensures that an adequate, but not overly generous, amount of bandwidth is allocated to ensure that Quality-of-Service targets for accepted flows will be met. We also compare our algorithm with alternative approaches based on analytical estimation of effective bandwidth; we demonstrate that these approaches are weak at taking into account related Quality of Service constraints and thus reserve inappropriate amounts of bandwidth, leading to either increased QoS target violations, or underutilisation of resources.
Primary care physicians' experience with electronic medical records: barriers to implementation in a fee-for-service environment
Authors: D. A. Ludwick, John Doucette
Venue: International Journal of Telemedicine and Applications (2009)

Our aging population has exacerbated strong and divergent trends between health human resource supply and demand. One way to mitigate future inequities is through the adoption of health information technology (HIT). Our previous research showed a number of risks and mitigating factors which affected HIT implementation success. We confirmed these findings through semistructured interviews with nine Alberta clinics. Sociotechnical factors significantly affected physicians' implementation success. Physicians reported that the time constraints limited their willingness to investigate, procure, and implement an EMR. The combination of antiquated exam room design, complex HIT user interfaces, insufficient physician computer skills, and the urgency in patient encounters precipitated by a fee-for-service remuneration model and long waitlists compromised the quantity, if not the quality, of the information exchange. Alternative remuneration and access to services plans might be considered to drive prudent behavior during physician office system implementation.
Improving Usability of HTA Charts
Authors: Raja Jamilah Raja Yusof, Khairuddin Hashim
Venue: Proceedings of the 2009 Second International Conferences on Advances in Computer-Human Interactions (2009)

This paper proposes improving the usability of HTA (Hierarchical Task Analysis) chart through redefinition. The plans in the existing HTA chart (HTAe) are replaced with symbols giving a proposed representation of HTA chart (HTAs). An empirical experiment was done on both types of chart, the HTAe and the HTAs, to see whether there is an improvement on the usability of HTA chart. An analysis was done on the score given for each task done correctly in interpreting the chart. An improvement was recorded. Lastly, a further redefinition of HTA chart was done based on results of the experiment carried out.
Departure from normality of increasing-dimension martingales
Authors: Ignacio Arbués
Venue: Journal of Multivariate Analysis (2009)

In this paper, we consider sequences of vector martingale differences of increasing dimension. We show that the Kantorovich distance from the distribution of the k(n)-dimensional average of n martingale differences to the corresponding Gaussian distribution satisfies certain inequalities. As a consequence, if the growth of k(n) is not too fast, then the Kantorovich distance converges to zero. Two applications of this result are presented. The first is a precise proof of the asymptotic distribution of the multivariate portmanteau statistic applied to the residuals of an autoregressive model and the second is a proof of the asymptotic normality of the estimates of a finite autoregressive model when the process is an AR(~) and the order of the model grows with the length of the series.
Morphically primitive words
Authors: Daniel Reidenbach, Johannes C. Schneider
Venue: Theoretical Computer Science (2009)

In the present paper, we introduce an alternative notion of the primitivity of words, that-unlike the standard understanding of this term-is not based on the power (and, hence, the concatenation) of words, but on morphisms. For any alphabet @S, we call a word w@?@S^*morphically imprimitive provided that there are a shorter word v and morphisms h,h^':@S^*->@S^* satisfying h(v)=w and h^'(w)=v, and we say that w is morphically primitive otherwise. We explain why this is a well-chosen terminology, we demonstrate that morphic (im-) primitivity of words is a vital attribute in many combinatorial domains based on finite words and morphisms, and we study a number of fundamental properties of the concepts under consideration.
Behavioral Fault Model for Neural Networks
Authors: A. Ahmadi, S. M. Fakhraie, C. Lucas
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

The term neural network (NN) originally referred to a network of interconnected neurons which are basic building blocks of the nervous system. Fault tolerance is known as an inherent feature of artificial neural networks (ANNs). Wide attention has been given to the problem of fault-tolerance in VLSI implementation domain and not enough attention has been paid to intrinsic capacity of survival to faults. In this work we focus on the impact of faults on the neural computation in order to show neural paradigms cannot be considered intrinsically fault-tolerant. A high abstraction level (corresponding to the neural graph) error model is introduced in this paper. We propose fault model and present an analysis of the usability of our method for fault masking. Simulation results show with this new fault model, the fault with less significant contribution is masked in output.
Decision fusion based on voting scheme for IR and visible face recognition
Authors: M. D. Shahbe, S. Hati
Venue: Machine Graphics Vision International Journal (2008)

In this paper we present an evaluation study of decision fusion strategies for infrared (IR) and visible face recognition. Several decision fusion methods based on a voting scheme (minimization, product and averaging) are discussed, and experiments for various conditions of probe and gallery sets are performed on two databases with paired IR and visible face imageries. The Eigenfaees and Fisherface classification techniques are used to extract the face features, and the performance of fusion methods on both classification approaches is discnssed.
Advanced WiMAX Adapter to Serve Adaptive Applications/Processes in Convergenced Manner
Authors: Tuomas Nissilä, Kostas Pentikousis, Ilkka Harjula, Jyrki Huusko, Marcos Katz
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

This research presents an advanced model of WiMAX Adapter. The proposed Adapter architecture can serve multiple adaptive applications and processes by utilising a convergence mechanism to differentiate the conversations with each utilised vendor equipment. This paper presents the Adapter architecture, and experiments for the efficient use of the system bandwidth for the management purposes. The experiments are focused on the aggregation of SNMP monitoring requests on WiMAX link. The derived aggregation results point a radical gain that can be achieved in SNMP monitoring when requesting more data at once. For WiMAX link the maximum goodput increase due to applied aggregation was 45-folds and for Ethernet link 6-folds. Even the lower aggregation levels lead to good results for both. This research motivates the use of a general Adapter solution for WiMAX technology, but also supports the vendor specific management approach. The WiMAX Adapter solution also supports both the user-end (UE) and the network controlled management approaches in the limits of the user privileges.
SPETA: Social pervasive e-Tourism advisor
Authors: Angel García-Crespo, Javier Chamizo, Ismael Rivera, Myriam Mencke, Ricardo Colomo-Palacios, Juan Miguel Gómez-Berbís
Venue: Telematics and Informatics (2009)

Tourism is one of the major sources of income for many countries. Therefore, providing efficient, real-time service for tourists is a crucial competitive asset which needs to be enhanced using major technological advances. The current research has the objective of integrating technological innovation into an information system, in order to build a better user experience for the tourist. The principal strength of the approach is the fusion of context-aware pervasive systems, GIS systems, social networks and semantics. This paper presents the SPETA system, which uses knowledge of the user's current location, preferences, as well as a history of past locations, in order to provide the type of recommender services that tourists expect from a real tour guide.
SAL-Based Symbolic Scheduling in Time-Triggered Networks
Authors: Sebastian Voss, Maria Sorea, Klaus Echtle
Venue: Proceedings of the 7th International Conference on Integrated Formal Methods (2009)

This paper presents a novel approach for combined task and message scheduling for TDM-based avionics applications that allows to automatically compute schedules with minimal end-to-end latency. Our approach relies on a symbolic encoding of the scheduling problem. The symbolic encoding is done by constructing gradually a schedule beginning in a state where no task has started and no messages have been sent on the bus yet, and proceeding one step at a time assigning starting times to tasks and slot positions to messages. We use the SAL toolset from SRI for our experiments. Experimental results demonstrate how the latest generation of model-checking tools meet the challenges of providing both a convenient modeling language and the performance to solve given scheduling problems.
Fundamentals of Signals and Systems
Authors: M.J. Roberts
Venue:  (2007)

Fundamentals Signals Systems captures the mathematical beauty of signals and systems and offers a student-centered, pedagogically driven approach. The author has a clear understanding of the issues students face in learning the material and does a superior job of addressing these issues. The book is intended to cover a one-semester sequence in Signals and Systems for juniors in engineering. This text is created in modular format, so instructors can select chapters within the framework that they teach this course. In addition, this text offers ARIS, McGraw-Hill's Homework Management System, which includes 100 static problems from which students can use for practice.
Advanced Studies on Reproducibility of Biometric Hashes
Authors: Tobias Scheidat, Claus Vielhauer, Jana Dittmann
Venue: Biometrics and Identity Management: First European Workshop, BIOID 2008, Roskilde, Denmark, May 7-9, 2008. Revised Selected Papers (2008)

The determination of hashes based on biometric data is a recent topic in biometrics as it allows to handle biometric templates in a privacy manner. Two main applications are the generation of secure biometric templates and cryptographic keys. Depending on these applications, there are different requirements with regard to possible errors. On one side, authentication performance based on biometric hashes as feature representation can be measured by common biometric error rates such as EER. Thus, generated hashes for each single person have to be only similar in a certain degree. On the other side, biometric hashes for cryptographic issues have to be identical and unique for each individual, although measured data from same person differs or data from different people may be similar. Therefore, we suggest three measures to estimate the reproducibility performance of biometric hash algorithms for cryptographic applications. To prove the concept of the measures, we provide an experimental evaluation of an online handwriting based hash generation algorithm using a database of 84 users and different evaluation scenarios.
On the Robustness and Imperceptibility of Digital Fingerprints
Authors: Jonathan K. Su, Bernd Girod
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

For the majority of digital watermarking applications, two of the most desirable properties are robustness and imperceptibility. This paper presents a theoretical analysis of watermarking, in which an attacker estimates the watermark with the Wiener filter. A watermark's robustness and imperceptibility can then be expressed in terms of its L_2-efficiency---the amount of watermark energy that an attacker can remove. It is demonstrated that a power-spectrum condition (PSC) must be satisfied for maximum L_2-efficiency: the watermark's power spectrum should be a scaled version of the original document's power spectrum. Among watermarks that are independent of the original document, a PSC-compliant watermark is maximally L_2-efficient. Analysis of 1-D and 2-D signal models and experiments with real images further encourage the use of PSC-compliant watermarks.
A new approach for face recognition by sketches in photos
Authors: Bing Xiao, Xinbo Gao, Dacheng Tao, Xuelong Li
Venue: Signal Processing (2009)

Face recognition by sketches in photos remains a challenging task. Unlike the existing sketch-photo recognition methods, which convert a photo into sketch and then perform the sketch-photo recognition through sketch-sketch recognition, this paper devotes to synthesizing a photo from the sketch and transforming the sketch-photo recognition to photo-photo recognition to achieve better performance in mixture pattern recognition. The contribution of this paper mainly focuses on two aspects: (1) in view of that there are no many research findings of sketch-photo recognition based on the pseudo-photo synthesis and the existing methods require a large set of training samples, which is nearly impossible to achieve for the high cost of sketch acquisition, we make use of embedded hidden Markov model (EHMM), which can learn the nonlinearity of sketch-photo pair with less training samples, to produce pseudo-photos in terms of sketches; and (2) photos and sketches are divided into patches and pseudo-photo is generated by combining pseudo-photo patches, which makes pseudo-photo more recognizable. Experimental results demonstrate that the newly proposed method is effective to identify face sketches in photo set.