ppxscal/embedding_network huggingface dataset:
Precoloring Extension for 2-connected Graphs
Authors: Margit Voigt
Venue: SIAM Journal on Discrete Mathematics (2007)

Let $G=G(V,E)$ be a simple graph, L a list assignment with $|L(v)|=\Delta(G)$ for all $v\in V$, and $W \subseteq V$ an independent subset of the vertex set. Define $d(W):= {\rm min} \{ d(v,w) | v,w \in W \}$ to be the minimum distance between two vertices of $W$. In this paper it is shown that if $G$ is 2-connected with $\Delta(G) \geq 4$ and $G$ is not the complete graph $K_{\Delta(G)+1}$, then every precoloring of $W$ is extendable to a proper list coloring of $G$ provided that $d(W)\geq 4$. An example shows that the bound is sharp. This extends a result of Axenovich [Electron. J. Combin., 10 (2003), note 1] and Albertson, Kostochka, and West [SIAM J. Discrete Math., 18 (2004), pp. 542-553], who proved that $d(W)\geq 8$ guarantees such an extension for all $G$ with $\Delta(G)\geq 3$ not containing $K_{\Delta(G)+1}$.
Validation of the dependability of CAN-based networked systems
Authors: F. Corno, J. Perez, M. Ramasso, M. Reorda, M. Violante
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International (2004)

The validation of networked systems is mandatory to guarantee the dependability levels that international standards impose in many safety-critical applications. In this paper we present an environment to study how soft errors affecting the memory elements of network nodes in CAN-based systems may alter the dynamic behavior of a car. The experimental evidence of the effectiveness of the approach is reported on a case study.
A Survey of Fault Management in Wireless Sensor Networks
Authors: Lilia Paradis, Qi Han
Venue: Journal of Network and Systems Management (2007)

Wireless sensor networks are resource-constrained self-organizing systems that are often deployed in inaccessible and inhospitable environments in order to collect data about some outside world phenomenon. For most sensor network applications, point-to-point reliability is not the main objective; instead, reliable event-of-interest delivery to the server needs to be guaranteed (possibly with a certain probability). The nature of communication in sensor networks is unpredictable and failure-prone, even more so than in regular wireless ad hoc networks. Therefore, it is essential to provide fault tolerant techniques for distributed sensor applications. Many recent studies in this area take drastically different approaches to addressing the fault tolerance issue in routing, transport and/or application layers. In this paper, we summarize and compare existing fault tolerant techniques to support sensor applications. We also discuss several interesting open research directions.
NT-SwiFT: software implemented fault tolerance on windows NT
Authors: Yennun Huang, P. Emerald Chung, Chandra Kintala, Chung-Yih Wang, De-Ron Liang
Venue: Proceedings of the 2nd conference on USENIX Windows NT Symposium - Volume 2 (1998)

More and more high available applications are implemented on Windows NT. However, the current version of Windows NT (NT4) does not provide some facilities that are needed to implement these fault tolerant applications. In this paper, we describe a set of components collectively named NT-SwiFT (Software Implemented Fault Tolerance) which facilitates building fault-tolerant and highly available applications on Windows NT. NT-SwiFT provides components for automatic error detection and recovery, checkpointing, event logging and replay, communication error recovery, incremental data replications, IP packets re-routing, etc. SwiFT components were originally designed on UNIX. The UNIX version was first ported to NT to run on UWIN [Korn97]. Gradually a large portion of the software has been re-implemented to take advantage of native NT system services. This paper describes these components and compares the differences in the UNIX and NT implementations. We also describe some applications using these components and discuss how to leverage NT system services and cope with some missing features.
Advanced self-organizing polynomial neural network
Authors: Dongwon Kim, Gwi-Tae Park
Venue: Neural Computing and Applications (2007)

In this paper, we introduce a concept of advanced self-organizing polynomial neural network (Adv_SOPNN). The SOPNN is a flexible neural architecture whose structure is developed through a modeling process. But the SOPNN has a fatal drawback; it cannot be constructed for nonlinear systems with few input variables. To relax this limitation of the conventional SOPNN, we combine a fuzzy system and neural networks with the SOPNN. Input variables are partitioned into several subspaces by the fuzzy system or neural network, and these subspaces are utilized as new input variables to the SOPNN architecture. Two types of the advanced SOPNN are obtained by combining not only the fuzzy rules of a fuzzy system with SOPNN but also the nodes in a hidden layer of neural networks with SOPNN into one methodology. The proposed method is applied to the nonlinear system with two inputs, which cannot be identified by conventional SOPNN to show the performance of the advanced SOPNN. The results show that the proposed method is efficient for systems with limited data set and a few input variables and much more accurate than other modeling methods with respect to identification error.
Coupling Metrics for Predicting Maintainability in Service-Oriented Designs
Authors: Mikhail Perepletchikov, Caspar Ryan, Keith Frampton, Zahir Tari
Venue: Proceedings of the 2007 Australian Software Engineering Conference (2007)

Service-Oriented Computing (SOC) is emerging as a promising paradigm for developing distributed enterprise applications. Although some initial concepts of SOC have been investigated in the research literature, and related technologies are in the process of adoption by an increasing number of enterprises, the ability to measure the structural attributes of service-oriented designs thus predicting the quality of the final software product does not currently exist. Therefore, this paper proposes a set of metrics for quantifying the structural coupling of design artefacts in service-oriented systems. The metrics, which are validated against previously established properties of coupling, are intended to predict the quality characteristic of maintainability of service-oriented software. This is expected to benefit both research and industrial communities as existing object-oriented and procedural metrics are not readily applicable to the implementation of service-oriented systems.
Assessing Module Reusability
Authors: Chris Luer
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

We propose a conceptual framework for assessing the reusability of modules. To do so, we define reusability of a module as the product of its functionality and its applicability. We then generalize the framework to the assessment of modularization techniques.
Relative validity of peer and self-evaluations in self-directed interdependent work teams
Authors: R. S. Thompson
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

Peer and self-evaluations were conducted on interdependent multidisciplinary self-directed work teams. Teams worked on two projects during the semester with membership changing between the two projects. Generalizability theory was used to partition the peer ratings into three variance components; rater effect, ratee effect, and the variance unaccounted for by the rater and ratee effects (rater by ratee interaction). The correspondence between the ratee effect and criterion measures for "effort applied to the task" and "technical knowledge applied to the task" was used as a measure of the peer evaluation validity. Self-evaluations were compared to the same criterion measures. The Fisher's average correlation coefficient between the criterion measure and the ratee effect from the peer evaluations was 0.69. In contrast, Fisher's average correlation coefficient between the criterion measure and self-evaluations was 0.25. Peer evaluations had greater validity than self-evaluations in the context of interdependent teamwork. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Application of a brightness-adapted edge detector for real-time railroad tie detection in video images
Authors: J. Velten
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

Due to the increasing calculation power of dedicated hardware, real-time image processing becomes practicable at reasonable expense. Nevertheless the algorithms concerned have to be adapted to real-time requirements. The subject treated in this paper is tie detection for automated railway inspection. An edge detector is proposed in which the sensitivity is adaptable to the local brightness of the processed image. The required effort is the performance of a convolution operation with subsequent decision concerning the sign of the values obtained.
Improving host security with system call policies
Authors: Niels Provos
Venue: Proceedings of the 12th conference on USENIX Security Symposium - Volume 12 (2003)

Many operating system services require special privilege to execute their tasks. A programming error in a privileged service opens the door to system compromise in the form of unauthorized acquisition of privileges. In the worst case, a remote attacker may obtain superuser privileges. In this paper, we discuss the methodology and design of privilege separation, a generic approach that lets parts of an application run with different levels of privilege. Programming errors occurring in the unprivileged parts can no longer be abused to gain unauthorized privileges. Privilege separation is orthogonal to capability systems or application confinement and enhances the security of such systems even further. Privilege separation is especially useful for system services that authenticate users. These services execute privileged operations depending on internal state not known to an application confinement mechanism. As a concrete example, the concept of privilege separation has been implemented in OpenSSH. However, privilege separation is equally useful for other authenticating services. We illustrate how separation of privileges reduces the amount of OpenSSH code that is executed with special privilege. Privilege separation prevents known security vulnerabilities in prior OpenSSH versions including some that were unknown at the time of its implementation.
FSM State Assignment Methods for Low-Power Design
Authors: Valery Salauyou, Tomasz Grzes
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

In this paper we deal with the problem of the finite states machine's (FSM) state assignment. CMOS-based digital circuits dissipate a power only during a transition at the output. Therefore one of the methods of the power minimization is to reassign the FSM states. We discuss the methods such as column-based and annealing-based as well as propose the new method called sequential method. Experimental results showed that the proposed method is approximately 10% better than the other discussed algorithms.
Energy and delay trade-off of the GTS allocation mechanism in IEEE 802.15.4 for wireless sensor networks: Research Articles
Authors: Anis Koubaa, Mário Alves, Eduardo Tovar
Venue: International Journal of Communication Systems (2007)

The IEEE 802.15.4 protocol proposes a flexible communication solution for low-rate wireless personal area networks (LR-WPAN) including wireless sensor networks (WSNs). It presents the advantage to fit different requirements of potential applications by adequately setting its parameters. When in beacon-enabled mode, the protocol can provide timeliness guarantees by using its Guaranteed Time Slot (GTS) mechanism. However, power-efficiency and timeliness guarantees are often two antagonistic requirements in wireless sensor networks. The purpose of this paper is to analyze and propose a methodology for setting the relevant parameters of IEEE 802.15.4-compliant WSNs that takes into account a proper trade-off between power-efficiency and delay bound guarantees. First, we propose two accurate models of service curves for a GTS allocation as a function of the IEEE 802.15.4 parameters, using Network Calculus formalism. We then evaluate the delay bound guaranteed by a GTS allocation and express it as a function of the duty cycle. Based on the relation between the delay requirement and the duty cycle, we propose a power-efficient superframe selection method that simultaneously reduces power consumption and enables meeting the delay requirements of real-time flows allocating GTSs. The results of this work may pave the way for a power-efficient management of the GTS mechanism in an IEEE 802.15.4 cluster. Copyright &copy; 2006 John Wiley & Sons, Ltd.
An Empirical Analysis of Fraud Detection in Online Auctions: Credit Card Phantom Transaction
Authors: Myungsin Chae, Seonyoung Shim, Hyungjun Cho, Byungtae Lee
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The online auction is a well-known business model that shows how business can be changed with the aid of new technologies. On the other hand, although the online auction allows buyers to find a wider variety of items and helps sellers to extend to literally millions of buyers, it is also accompanying by a great deal of online auction fraud through the information asymmetry and anonymity problems. As serious online fraud, we deal with the online credit card phantom transaction, which is a fake transaction by the collusion of the seller and buyer using credit card. Basically it is illegal online loan sharking which incurs various social and economic costs: tax evasion, the development of a black-market for the loan service, destruction of debtor's (buyer) financial condition due to the excessively high interest rate. In this paper, we investigated the factors necessary to detect phantom transaction. Based on the studies that have explored the behaviors of buyers and sellers in online auctions, we used the followings as the independent variables: starting bid, auction length, bid count, bid increment, and seller credit. Through empirical bidding data analysis, our logistic regression model suggests the use of "starting bid', "auction length' and "seller credit' as important factors for detection of phantom transaction.
A privacy preserving assertion based policy language for federation systems
Authors: Anna C. Squicciarini, Ayca Azgin Hintoglu, Elisa Bertino, Yucel Saygin
Venue: Proceedings of the 12th ACM symposium on Access control models and technologies (2007)

Identity federation systems enable participating organizations to provide services to qualified individuals and manage their identity attributes at an inter-organizational level. Most importantly, they empower individuals with control over the usage of their attributes within the federation via enforcement of various policies. Among such policies, one of the most important yet immature one is the privacy policy. Existing frameworks proposed for privacy-preserving federations lack the capability to support complex data-usage preferences in the form of obligations, i.e. the privacy related actions that must be performed upon certain actions on a specific piece of information. Moreover, they do not account for the history of events resulting from the interactions among federation entities. To address these deficiencies we propose an extension to an existing assertion based policy language. More specifically, we provide a new set of assertions to define the privacy related properties of a federation system. We extend the com-mon definition of privacy preference policies with obligation preferences. Finally, we illustrate how the proposed framework is realized among service providers to ensure proper enforcement of privacy policies and obligations.
Multifractal analysis and /spl alpha/-stable processes: a methodological contribution
Authors: P. Chainais
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

This work is a contribution to the analysis of the procedure, based on wavelet coefficient partition functions, commonly used to estimate the Legendre multifractal spectrum. The procedure is applied to two examples, a fractional Brownian motion in multifractal time and a self-similar /spl alpha/-stable process, whose sample paths exhibit irregularities that by eye appear very close. We observe that, for the second example, this analysis results in a qualitatively inaccurate estimation of its multifractal spectrum, and a related masking of the /spl alpha/-stable nature of the process. We explain the origin of this error through a detailed analysis of the partition functions of the self-similar /spl alpha/-stable process. Such a study is made possible by the specific properties of the wavelet coefficients of such processes. We indicate how the estimation procedure might be modified to avoid such errors.
An audio virtual DSP for multimedia frameworks
Authors: G. Zoia
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

The new MPEG-4 audio standard provides two toolsets for synthetic audio generation, audio processing and multimedia content description called Structured Audio (SA) and Binary Format for Scenes (BIFS). Moving from a systematic analysis of SA and from the implementation of an efficient SA decoder, this paper describes the design of a virtual DSP architecture able to exploit the data level parallelism contained in many typical audio processing algorithms. The proposed virtual DSP architecture shows good performance on general purpose platforms and can be easily adapted and optimized for parallel superscalar devices. The porting and results on a V-LIW DSP device confirm the effectiveness and flexibility of the approach, which is particularly suitable for standalone embedded solutions.
The role of human factors in stereotyping behavior and perception of digital library users: a robust clustering approach
Authors: Enrique Frias-Martinez, Sherry Y. Chen, Robert D. Macredie, Xiaohui Liu
Venue: User Modeling and User-Adapted Interaction (2007)

To deliver effective personalization for digital library users, it is necessary to identify which human factors are most relevant in determining the behavior and perception of these users. This paper examines three key human factors: cognitive styles, levels of expertise and gender differences, and utilizes three individual clustering techniques: k-means, hierarchical clustering and fuzzy clustering to understand user behavior and perception. Moreover, robust clustering, capable of correcting the bias of individual clustering techniques, is used to obtain a deeper understanding. The robust clustering approach produced results that highlighted the relevance of cognitive style for user behavior, i.e., cognitive style dominates and justifies each of the robust clusters created. We also found that perception was mainly determined by the level of expertise of a user. We conclude that robust clustering is an effective technique to analyze user behavior and perception.
Local bases yielding arbitrary tilings of the time-frequency plane
Authors: R. Bernardini
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

We show how to obtain arbitrary tilings of the time-frequency plane using local orthogonal bases. These bases were constructed as a generalization of the cosine-modulated filter banks in discrete time, and local trigonometric bases in continuous time. Due to the fact that they use a single prototype window, these bases also lead to time-varying tilings. Moreover, they have a fast implementation algorithm, and allow for multidimensional irreducible basis functions. We show examples of design, in particular, that of a critical-band system for use in audio coding.
A filter bank method to construct rotationally invariant moments for pattern recognition
Authors: Annupan Rodtook, Stanislav S. Makhanov
Venue: Pattern Recognition Letters (2007)

We propose multiresolution filter bank techniques to construct rotationally invariant moments. The multiresolution pyramid motivates a simple but efficient feature selection procedure based on a combination of a pruning algorithm, a new version of the Apriori mining techniques and the partially supervised fuzzy C-mean clustering. The recognition accuracy of the proposed techniques has been tested with the reference to conventional methods. The numerical experiments, with more than 50,000 images taken from standard image datasets, demonstrate an accuracy increase ranging from 5% to 27% depending on the noise level.
Tree Structure for Specific-Source Multicast with Feedback Aggregation
Authors: Dan Komosny, Vit Novotny
Venue: Proceedings of the Sixth International Conference on Networking (2007)

The Real Time Protocol (RTP) and its accompanying Real Time Control Protocol (RTCP) are employed in multicast applications. The RTCP protocol is used to distributed feedback on multimedia transmission among session members. The feedback is reported by sending, among others, RR (Receiver Report) and SR (Sender Report) packets. With the specific-source multicast, the hierarchical aggregation is used as a method of feedback distribution. The hierarchical aggregation allows a significant reduction of the feedback transmission delay in case of large-scale sessions such as IPTV broadcasting. This paper deals with a tree structure of session members for the feedback distribution with the hierarchical aggregation used. The tree concerned consists of end nodes and summarization nodes. A summarization node aggregates feedback produced from end nodes, which are situated on the lowest tree level only. The tree is applied to an IPTV broadcasting multicast session. The video format used is SD-DVB (Standard Definition-Digital Video Broadcasting) with the MPEG02 standard. Also, bandwidth requirements for the feedback distribution in case of the IPTV application described are discussed.
Variable frame rate parameter encoding via adaptive frame selection using dynamic programming
Authors: E. B. George, A. V. McCree, V. R. Viswanathan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

This paper presents a block-coded VFR strategy that removes the familiar "anchor frame" constraint in favor of a generalized delayed decision analysis. This approach is referred to as adaptive frame selection using dynamic programming (AFS/DP). The AFS/DP algorithm determines optimal breakpoint locations using a perceptually-based performance measure, accommodates fixed bit-rate operation, and operates with fixed delay and low complexity. The AFS/DP algorithm has been implemented in the context of the MELP vocoder at 2400 bits/sec, and has demonstrated comparable performance to block VFR methods, with lower coder delay.
Robust spatial image watermarking using progressive detection
Authors: A. Tefas
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

A novel method for image watermarking robust to geometric distortions is proposed. A binary watermark is embedded in a grayscale or a color host image. The ability of progressive watermark detection enables fast and robust watermark detection even after several geometric distortions of the watermarked image. Simulation results indicate the ability of the proposed method to deal with the aforementioned attacks. Experiments conducted using the Stirmark benchmarking tests, indicate the superiority of the proposed method.