ppxscal/embedding_network huggingface dataset:
A QoS routing and admission control scheme for 802.11 ad hoc networks
Authors: Lin Luo, Marco Gruteser, Hang Liu, Dipankar Raychaudhuri, King Huang, Shiwen Chen
Venue: Proceedings of the 2006 workshop on Dependability issues in wireless ad hoc networks and sensor networks (2006)

This paper presents an admission control mechanism for multirate wireless ad hoc networks. Admission control depends on precise estimates of bandwidth available in the network and the bandwidth required by a new flow. Estimating these parameters in wireless ad hoc networks is challenging due to the shared and open nature of the wireless channel. Available bandwidth can only be determined by also considering interference at neighboring nodes. Also, due to self-interference of flows the required bandwidth of a flow varies for each link of a route. The proposed admission control mechanisms is integrated with a hop-by-hop ad hoc routing protocol, thus enabling it to identify alternate routes if the shortest path is congested. Each node measures available channel bandwidth through passive monitoring of the channel. The mechanism improves estimation accuracy by using a formula that considers possible spatial reuse from parallel transmissions. The protocol also uses temporal accounting to enable bandwidth estimation across links using different bit-rates. Simulation results support that the admission control mechanism can effectively control the traffic load and that considering parallel transmission leads to improved bandwidth estimation accuracy. The admission control mechanism can admit more traffic while maintaining QoS.
A Subjective Evaluation Method for Human-computer Interaction Interface Design Based on Grey Theory
Authors: Yan Shengyuan, Zhang Zhijian, Peng Minjun, Yang Ming
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

Subjective evaluation of human-computer interaction has the properties of multiple factors influenced, and unknown or uncertain information involved, which leads to the difficulties in the evaluation of human-computer interactive design. In this paper, a novel subjective evaluation method based on grey relational analysis is proposed. By judging the correlative degree between the evaluation criterion and the design schemes, the best scheme can be found. The proposed method only uses few comprehensive evaluation indexes, and the detailed factors that would affect the comprehensive evaluation indexes are not taken into account. Therefore, the proposed method is more appropriate to the comprehensive evaluation of complex humancomputer system. The proposed method is simple, convenient and universal. It not only could be used to guide the practical evaluation of human-computer interactive interaction design scheme, but also provide a new means for optimizing human-machine interface design.
Developing a composite trust model for multi-agent systems
Authors: Xiaoqing Zheng, Zhaohui Wu, Huajun Chen, Yuxin Mao
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

The Semantic Web, conceived as a collection of agents, brings new opportunities and challenges to trust research. Enabling trust to ensure more effective and efficient interaction is at the heart of the Semantic Web vision. We propose a composite trust model based on statistical decision theory and Bayesian sequential analysis to balance the costs and benefits during the process of trust evaluating and combine a variety of sources of information to assist users with making the correct decisions in selecting the appropriate service providers according to their preferences. The model proposed by this paper gives trust a strict mathematical interpretation in terms of probability theory.
Ontological Approach Towards E-business Process Automation
Authors: Baolin Wu, Li Li, Yun Yang
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

This paper discusses the interoperability of e-business processes by using an ontology approach with description logic and agent systems to achieve e-business automation. An innovative e-business process modeling framework is proposed that outlines the building blocks required for Internet-based e-business in order to enable e-business process automation. The framework helps in understanding the role of many proposed standards with respect to the building blocks and in identifying both overlaps and gaps among them. The domain knowledge of e-business processes is conceptualised as an e-business process ontology that enables agents' communication in e-business application sharing and reusing. Several agent-based automation mechanisms are discussed based on the ontology that provides implementation guidelines to e-business process automation.
Building Scalable Failure-proneness Models Using Complexity Metrics for Large Scale Software Systems
Authors: Thirumalesh Bhat, Nachiappan Nagappan
Venue: Proceedings of the XIII Asia Pacific Software Engineering Conference (2006)

Building statistical models for estimating failureproneness of systems can help software organizations make early decisions on the quality of their systems. Such early estimates can be used to help inform decisions on testing, refactoring, code inspections, design rework etc. This paper demonstrates the efficacy of building scalable failure-proneness models based on code complexity metrics across the Microsoft Windows operating system code base. We show the ability of such models to estimate failure-proneness and provide feedback on the complexity metrics to help guide refactoring and the design rework effort.
Jylab: A System for Portable Scientific Computing over Distributed Platforms
Authors: Giorgos Kollias, Efstratios Gallopoulos
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

Jylab is a portable and flexible scientific computing system favoring extensibility. It provides users with a scripting language and a core set of libraries implementing numerical linear algebra routines, communication models, interactive visualization and computer algebra system capabilities. It thus enables the development of scientific applications involving numerics, graphics and symbolics over distributed computing platforms. It is enhanced with a collection of extension packages that support Grid computing and implement Web search engine and Web graph analysis frameworks. Building a multithreaded Internet algorithmics application in Jylab is fully presented.
Improving fault prediction using Bayesian networks for the development of embedded software applications: Research Articles
Authors: Elena Pérez-Miñana, Jean-Jacques Gras
Venue: Software Testing, Verification Reliability (2006)

Bayesian network (BN) models can be used to predict the level of fault injection in the different phases of the software development process. This paper describes the techniques used by Motorola to develop BN fault prediction models using product, usage and process information. It also includes a procedure created to validate and calibrate the BN models. Statistical techniques are applied that provide a measurement of the quality of the predictions made by the models, and directions on how the models could be improved. The validation method described in this paper considers two alternative ways to produce an improved network. The first is based mainly on modifying the ranges of the existing nodes, adding interdependencies between them, and varying the weight values associated with each of the nodes that are used as inputs to the intermediate nodes of the BN model. The second possibility uses linear regression and principal component analysis to build the intermediate and output nodes of the network. The paper closes with some encouraging results, and outlines a number of unresolved questions. Copyright &copy; 2006 John Wiley & Sons, Ltd.A version of this paper was originally presented at UKTest 2005: The Third U.K. Workshop on Software Testing Research, held at the University of Sheffield, U.K., 5&ndash;6 September 2005. It is reproduced here in revised and extended form with the permission of the Workshop organizers
Signal estimation using the discrete polynominal transform
Authors: S. Peleg, B. Friedlander
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

The authors develop an iterative procedure for estimating the parameters of a signal consisting of multiple polynomial-phase components with time-varying amplitudes. The proposed algorithm is based on the discrete polynomial transform (DPT), and shares its computational simplicity. Preliminary experimentation with the algorithm has shown that it is able to provide accurate parameter estimates. A numerical example is included.
A note on the not 3-choosability of some families of planar graphs
Authors: Mickaël Montassier
Venue: Information Processing Letters (2006)

A grapph G is L-list colorable it for a given list assignment L = {L(v): v ∈ V}, there exists a proper coloring c of G such that c(v) ∈ L(v) for all v ∈ V. If G is L-list colorable for any list assignment with |L(v)| ≥ k for all v ∈ V, then G is said k-choosable. In [M. Voigt, A not 3-choosable planar graph without 3-cycles, Discrete Math. 146 (1995) 325-328] and [M. Voigt, A non-3-choosable planar graph without cycles of length 4 and 5, 2003, Manuscript], Voigt gave a planar graph without 3-cycles and a planar graph without 4-cycles and 5-cycles which are not 3-choosable. In this note, we give smaller and easier graphs than those proposed by Voigt and suggest an extension of Erdös' relaxation of Steinberg's conjecture to 3-choosability.
Evaluating the Reliability of Credential Hardening through Keystroke Dynamics
Authors: Nick Bartlow, Bojan Cukic
Venue: Proceedings of the 17th International Symposium on Software Reliability Engineering (2006)

Most computer systems rely on usernames and passwords as a mechanism for authentication and access control. These credential sets offer weak protection to a broad scope of applications with differing levels of sensitivity. Traditional physiological biometric systems such as fingerprint, face, and iris recognition are not readily deployable in remote authentication schemes. Keystroke dynamics provide the ability to combine the ease of use of username / password schemes with the increased trustworthiness associated with biometrics. Our research extends previous work on keystroke dynamics by incorporating shift-key patterns. The system is capable of operating at various points on a traditional ROC curve depending on application specific security needs. A 1%False Accept Rate is attainable at a 14% False Reject Rate. An Equal Error Rate of 5%is suitable for systems requiring a relatively low security. As a username password authentication scheme, our approach decreases the system penetration rate associated with compromised passwords by 95%-99%. Said performance measures can be further improved through optimization of the classification algorithm on a user specific basis.
Non-orthogonal Gabor representation of biological signals
Authors: M. L. Brown, W. J. Williams
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

A new technique for modelling biological signals as a linear combination of non-orthogonal Gabor logons is described. The technique has been applied to two types of signals, event-related potentials (ERPs) and temporomandibular joint (TMJ) clicks. Examination of time-frequency representations of these signals revealed that they appear to consist of a small number of localized energy concentrations. Attempts to capture this apparent low dimensionality with the standard orthogonal Gabor expansion and the standard wavelet transform were unsuccessful. However, the non-orthogonal Gabor decomposition method described in this paper provides a compact, accurate signal representation and the parameters provide a good basis for ERP category and TMJ click classification.
ScalaBLAST: A Scalable Implementation of BLAST for High-Performance Data-Intensive Bioinformatics Analysis
Authors: Christopher Oehmen, Jarek Nieplocha
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

Genes in an organism's DNA (genome) have embedded in them information about proteins, which are the molecules that do most of a cell's work. A typical bacterial genome contains on the order of 5,000 genes. Mammalian genomes can contain tens of thousands of genes. For each genome sequenced, the challenge is to identify protein components (proteome) being actively used for a given set of conditions. Fundamentally, sequence alignment is a sequence matching problem focused on unlocking protein information embedded in the genetic code, making it possible to assemble a "tree of life” by comparing new sequences against all sequences from known organisms. But, the memory footprint of sequence data is growing more rapidly than per-node core memory. Despite years of research and development, high-performance sequence alignment applications either do not scale well, cannot accommodate very large databases in core, or require special hardware. We have developed a high-performance sequence alignment application, ScalaBLAST, which accommodates very large databases and which scales linearly to as many as thousands of processors on both distributed memory and shared memory architectures, representing a substantial improvement over the current state-of-the-art in high-performance sequence alignment with scaling and portability. ScalaBLAST relies on a collection of techniques—distributing the target database over available memory, multilevel parallelism to exploit concurrency, parallel I/O, and latency hiding through data prefetching—to achieve high-performance and scalability. This demonstrated approach of database sharing combined with effective task scheduling should have broad ranging applications to other informatics-driven sciences.
Cross-company and single-company effort models using the ISBSG database: a further replicated study
Authors: Chris Lokan, Emilia Mendes
Venue: Proceedings of the 2006 ACM/IEEE international symposium on Empirical software engineering (2006)

Five years ago the ISBSG database was used by Jeffery et al. [6] (S1) to compare the effort prediction accuracy between cross- and single-company effort models. Given that more than 2,000 projects were later volunteered to this database, in 2005 Mendes et al. [17] (S2) replicated S1 but obtained different results. The difference in results between both studies could have resulted from legitimate differences in data set patterns but also could have been influenced by differences in experimental procedure. S2 was unable to employ exactly the same experimental procedure used in S1, as S1's procedure was not fully documented. Therefore this paper aimed to apply S2's experimental procedure to the ISBSG database version used in S1 (release 6) to assess if differences in experimental procedure would have contributed towards different results. Our results corroborated those from S1: we found that predictions based on a single-company model were significantly more accurate than those based on a cross-company model.
A distributed multi-formalism simulation to support rail infrastructure control design
Authors: Elisangela Mieko Kanacilo, Alexander Verbraeck
Venue: Proceedings of the 37th conference on Winter simulation (2005)

In this study we use simulation as a method of inquiry to support rail infrastructure control designers in making more effective decisions during the design process. Limitations encountered in commercial simulation tools when modeling rail system elements, are related to the choice of just one formalism (discrete or continuous) to model the element behavior. When supporting the design of rail system control, rail controllers and rail control designers might be in different locations. Therefore distribution of the simulation model is a required feature which is usually not possible in current simulation environments. In order to more accurately represent rail systems behavior and improve the effectiveness of control design, we propose a simulation library where different formalisms can be integrated in one single model and where simulation components are accessible by users in different locations.
Product Line Based Ontology Reuse in Context-aware E-business Environment
Authors: Weishan Zhang, Thomas Kunz
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

Improving the reusability of ontology is recognized as increasingly important due to the prevalence of OWL research and applications. But there exists no convincing methodology and tool support in this direction yet. In this paper, we apply ideas from the research and practice with software product lines in order to explore this issue. The ontology is developed and managed according to the commonalities and variabilities underlying a specific problem domain. Meta-ontology is used in order to improve the reusability, evolve-ability and customizability of ontology. Another advantage is being able to generate needed ontology with the created meta-ontology implemented with XVCL (XML based Variant Configuration Language) technology. We demonstrate our product line based reuse approach with an example B2C application.
Integrating simulation with corporate initiatives
Authors: Malcolm Beaverstock
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Simulation has seen an explosive increase in use within GMI over the past 10 years with increasing financial success. As the demand for simulation grew a decision was made to leverage this tool by significantly expanding the user base. Now, using a highly customized user interface and integrating with central libraries and data bases, simulation has become the focal point for manufacturing and engineering analysis by personnel throughout the organization. Utilizing GMI terminology and metrics, users can easily focus on issues related to company initiatives for conceptual engineering, option engineering, lean manufacturing, and continuous improvement. Reduction in training, relearning, and model development time has lead to early acceptance from casual, intermediate, and power users. While being user friendly is an objective, this initiative is definitely NOT "Simulation for Dummies" but instead requires individuals to understand, in more depth, manufacturing and business alternatives. 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
Modeling and simulation of integrated voice/data cellular communication with generally distributed delay for end voice calls
Authors: Pawan K. Choudhary, Bharat Madan, Kishor S. Trivedi
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Cellular networks are gradually shifting from voice only to voice and data due to increased demand for WWW, FTP and multi-media messaging. This has substantially increased the volume of cellular data traffic. Schemes have been proposed for co-existence and fair sharing of the available bandwidth between circuit switched voice and packetized data traffic. One popular scheme is based on delaying the last incoming acceptable voice call for a random amount of time and utilizing this time to service the accumulated data traffic to prevent excessive queuing delay in delivering the data traffic. However, this delay time has been usually modeled as being exponentially distributed. In this paper, this delay is modeled as a uniformly distributed random variable instead. This scheme is extended by delaying more than one call. Performance measures like voice and data blocking probability is plotted as function of last call delay.
How does personality affect trust in B2C e-commerce?
Authors: Jo Lumsden, Lisa MacKay
Venue: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet (2006)

Trust is a critical component of successful e-Commerce. Given the impersonality, anonymity, and automation of transactions, online vendor trustworthiness cannot be assessed by means of body language and other environmental cues that consumers typically use when deciding to trust offline retailers. It is therefore essential that the design of e-Commerce websites compensate by incorporating circumstantial cues in the form of appropriate trust triggers. This paper presents and discusses the results of a study which took an initial look at whether consumers with different personality types (a) are generally more trusting and (b) rely on different trust cues during their assessment of first impression vendor trustworthiness in B2C e-Commerce.
Background-Subtraction in Thermal Imagery Using Contour Saliency
Authors: James W. Davis, Vinay Sharma
Venue: International Journal of Computer Vision (2007)

We present a new contour-based background-subtraction technique to extract foreground objects in widely varying thermal imagery. Statistical background-subtraction is first used to identify local regions-of-interest. Within each region, input and background gradient information are combined to form a Contour Saliency Map. After thinning, an A ¿ path-constrained search along watershed boundaries is used to complete and close any broken contour segments. Lastly, the contour image is flood-filled to produce silhouettes. Results of our approach are presented for several difficult thermal sequences and compared to alternate approaches. We quantify the results using manually segmented thermal imagery to demonstrate the robustness of the approach.
Finite Instantiations for Integer Difference Logic
Authors: Hyondeuk Kim, Fabio Somenzi
Venue: Proceedings of the Formal Methods in Computer Aided Design (2006)

The last few years have seen the advent of a new breed of decision procedures for various fragments of first-order logic based on propositional abstraction. A lazy satisfiability checker for a given fragment of first-order logic invokes a theory-specific decision procedure (a theory solver) on (partial) satisfying assignments for the abstraction. If the assignment is found to be consistent in the given theory, then a model for the original formula has been found. Otherwise, a refinement of the propositional abstraction is extracted from the proof of inconsistency and the search is resumed. We describe a theory solver for integer difference logic that is effective when the formula to be decided contains equality and disequality (negated equality) constraints so that the decision problem partakes of the nature of the pigeonhole problem. We propose a reduction of the problem to propositional satisfiability by computing bounds on a sufficient subset of solutions, and present experimental evidence for the efficiency of this approach.
Maintaining the Integrity of Links Between Assets within a Clinical Knowledge Repository
Authors: Timothy P. Hanna, Roberto A. Rocha, Nathan C. Hulse, Guilherme Del Fiol, Richard L. Bradshaw
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

This paper describes how Intermountain Healthcare's Clinical Knowledge Repository (CKR) uses asset versioning, asset status, and asset linking to manage clinical assets. This allows authors to create, distribute, and maintain complex clinical assets while insuring patient safety. The CKR helps authors to link to existing assets safely and consistently.