ppxscal/embedding_network huggingface dataset:
Graphs with large total domination number
Authors: Michael A. Henning
Venue: Journal of Graph Theory (2000)

Let G = (V,E) be a graph. A set S &sube; V is a total dominating set if every vertex of V is adjacent to some vertex in S. The total domination number of G, denoted by &Upsilon;t(G), is the minimum cardinality of a total dominating set of G. We establish a property of minimum total dominating sets in graphs. If G is a connected graph of order n &ge; 3, then (see [3]) &Upsilon;t(G) &le; 2n-3. We show that if G is a connected graph of order n with minimum degree at least 2, then either &Upsilon;t(G) &le; 4n-7 or G &epsilon; {C3, C5, C6, C10}. A characterization of those graphs of order n which are edge-minimal with respect to satisfying G connected, &delta;(G) e 2 and &Upsilon;t(G) &ge; 4n-7 is obtained. We establish that if G is a connected graph of size q with minimum degree at least 2, then &Upsilon;t(G) &le;(q + 2)-2. Connected graphs G of size q with minimum degree at least 2 satisfying &Upsilon;t(G) > q-2 are characterized. &copy; 2000 John Wiley Sons, Inc. J Graph Theory 35: 2145, 2000
Comparing communication primitives via their relative expressive power
Authors: Daniele Gorla
Venue: Information and Computation (2008)

In this paper, we study sixteen communication primitives, arising from the combination of four useful programming features: synchronism (synchronous vs asynchronous primitives), arity (monadic vs polyadic data), communication medium (message passing vs shared dataspaces) and pattern-matching. Some of these primitives have already been used in at least one language which has appeared in the literature; however, to reason uniformly on such primitives, we plug them into a common framework based on the @p. By means of possibility/impossibility of 'reasonable' encodings, we compare every pair of primitives to obtain a hierarchy of languages based on their relative expressive power.
A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts
Authors: Michael H. Goldwasser, Arundhati Bagchi Misra
Venue: Information Processing Letters (2008)

We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the number of jobs completed by their deadlines. Chrobak et al. (2007, SICOMP 36:6) introduce a preempt-restart model in which progress toward completing a preempted job is lost, yet that job can be restarted from scratch. They provide a 3/2-competitive deterministic algorithm and show that this is the optimal competitiveness. Their analysis is based on a complex charging scheme among individual jobs and the use of several partial functions and mappings for assigning the charges. In this paper, we provide an alternative proof of the result using a more global potential argument to compare the relative progress of the algorithm versus the optimal schedule over time. This new proof is significantly simpler and more intuitive that the original, and our technique is applicable to related problems.
A local convergence property of primal-dual methods for nonlinear programming
Authors: Paul Armand, Jo&#x00eb;l Benoist
Venue: Mathematical Programming: Series A and B (2008)

We prove a new local convergence property of some primal-dual methods for solving nonlinear optimization problems. We consider a standard interior point approach, for which the complementarity conditions of the original primal-dual system are perturbed by a parameter driven to zero during the iterations. The sequence of iterates is generated by a linearization of the perturbed system and by applying the fraction to the boundary rule to maintain strict feasibility of the iterates with respect to the nonnegativity constraints. The analysis of the rate of convergence is carried out by considering an arbitrary sequence of perturbation parameters converging to zero. We first show that, once an iterate belongs to a neighbourhood of convergence of the Newton method applied to the original system, then the whole sequence of iterates converges to the solution. In addition, if the perturbation parameters converge to zero with a rate of convergence at most superlinear, then the sequence of iterates becomes asymptotically tangent to the central trajectory in a natural way. We give an example showing that this property can be false when the perturbation parameter goes to zero quadratically.
Analysis of SEM Images of Stomata of Different Tomato Cultivars Based on Morphological Features
Authors: Pritimoy Sanyal, Ujjwal Bhattacharya, Samir K. Bandyopadhyay
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Tomato is one of the important cash crops in the world. There are several varieties of tomato cultivars. Their identifications as well as taxonomy had been studied in the literature using different laboratory methods. Both morphological and/or genetical characteristics were considered in these available studies. However, to the best of our knowledge, there does not exist any study employing an image analysis based approach. Also, morphological features of stomata of tomato cultivars had not been studied before for the present purpose. In this article, we report results of our recent study of morphological features of stomata of different tomato cultivars based on their Scanning Electron Microscopy (SEM) images. Interestingly, these results of the present study are supported by the protein binding pattern of the seeds of respective cultivars.
Interface effects on digital library credibility judgments
Authors: Paul R. Aumer-Ryan
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

In digital library search engines, "no results found" is a misleading phrase because it masquerades as a definitive answer; in reality, the collection being searched may in fact contain content that matches a user's query. This research examines the effect of null result sets on search behavior and on the perception of contents in digital libraries. In particular, this research supports the hypothesis that interface and design flaws have an effect on the perceived authority and credibility (here defined in terms of being authentic, factual, trustworthy, scholarly, and accurate) of the information being communicated by the interface in question. In short, interface design and the "form" of information (or, alternatively, the messenger) can negatively impact the perception of the quality of the "content" of information (the message).
Max-margin Classification of Data with Absent Features
Authors: Gal Chechik, Geremy Heitz, Gal Elidan, Pieter Abbeel, Daphne Koller
Venue: The Journal of Machine Learning Research (2008)

We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between the features. Unlike the case where a feature exists but its value is not observed, here we focus on the case where a feature may not even exist (structurally absent) for some of the samples. The common approach for handling missing features in discriminative models is to first complete their unknown values, and then use a standard classification procedure over the completed data. This paper focuses on features that are known to be non-existing, rather than have an unknown value. We show how incomplete data can be classified directly without any completion of the missing features using a max-margin learning framework. We formulate an objective function, based on the geometric interpretation of the margin, that aims to maximize the margin of each sample in its own relevant subspace. In this formulation, the linearly separable case can be transformed into a binary search over a series of second order cone programs (SOCP), a convex problem that can be solved efficiently. We also describe two approaches for optimizing the general case: an approximation that can be solved as a standard quadratic program (QP) and an iterative approach for solving the exact problem. By avoiding the pre-processing phase in which the data is completed, both of these approaches could offer considerable computational savings. More importantly, we show that the elegant handling of missing values by our approach allows it to both outperform other methods when the missing values have non-trivial structure, and be competitive with other methods when the values are missing at random. We demonstrate our results on several standard benchmarks and two real-world problems: edge prediction in metabolic pathways, and automobile detection in natural images.
Efficient Retargeting of Generated Device User-Interfaces
Authors: Olufisayo Omojokun, Prasun Dewan
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

Many pervasive computing systems have been builtfor using mobile computers to interact with networkeddevices. To deploy a device’s user-interface, severalsystems dynamically generate the user-interface on amobile computer. While this approach has severaladvantages, empirical results from different generatorsshow that it takes a relatively long time for a mobilecomputer to create a user-interface from scratch. Thispaper shows that it is possible to overcome thislimitation by efficiently mapping or retargeting apreviously generated user-interface of one (source)device to another (target) device of the same ordifferent type. Using the implementation of an existinggenerator and a set of real-world scenarios, we showthat user-interface retargeting can yield deploymenttimes that are often as good as or noticeably betterthan the approach of locally loading pre-existingmanually-written user-interface code.
Experiences on Model-Driven Software Development for Mobile Applications
Authors: Peter Braun, Ronny Eckhaus
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

The development of mobile data services is a challenging process. Not only do mobile devices differ substantially from each other but also users of mobile services have different preferences according to which communication channel they want to access these services. Our company has started a project to develop a new software architecture by which it will be possible to provide the sameservice as mobile Web service as well as mobile application. This paper reports on a feasibility study that we conducted in order to evaluate whether model-based software development can be used for this project.
Routing based authentication for mobile ad hoc network in home environment
Authors: Kyu-Hwan Lee, Jae-Hyun Kim, Jun-Hee Park, Dong-Hee Kim, Kyung Duk Moon
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

This paper proposes the ad hoc authentication protocol for user convenience and guest authentication in a home environment. To improve the delay performance, an authentication protocol was implemented into the ad hoc routing algorithm. The proposed protocol was evaluated through three analyses. The correctness of the proposed protocol was proved via the GNY analysis. According to the security analysis, the proposed protocol was shown to be resistant to various attacks. For the performance analysis, the protocol was implemented on the laptop using the Linux operating system and transmission time was measured. The analysis results show that the proposed protocol provides a secure home network environment without significant performance degradation.
Make your application accessible with accerciser
Authors: Eitan Isaacson
Venue: Linux Journal (2008)

Find and solve access issues; your users will thank you.
A MULTI-AGENT SYSTEM FOR UNIVERSITY COURSE TIMETABLING
Authors: Damjan Strnad, Nikola Guid
Venue: Applied Artificial Intelligence (2007)

In the paper, we present a new architecture and implementation of a multi-agent system for university timetable generation. Agents as representatives of individual courses have the task of allocating the necessary human and technical resources through negotiation. We define the negotiation protocol and describe autonomous decisions of agents within the prescribed framework. The advantages of the multi-agent approach are a direct resolution of conflicts, strategic versatility of negotiation, and natural representation of some real-life problems.
Generating soil electrical conductivity maps at regional level by integrating measurements on the ground and remote sensing data
Authors: P. Brunner, H. T. Li, W. Kinzelbach, W. P. Li
Venue: International Journal of Remote Sensing (2007)

In arid and semi-arid areas, salinization of soil and water resources is one of the major threats to irrigated agriculture. For management purposes, quantifying both the extent and distribution of salinization is important, but accurate data with sufficient spatial resolution are often not available. Commonly used techniques such as soil sampling and geophysical methods are time-consuming and yield only point data. A method is described in which multispectral remote sensing images can be used to regionalize point data measured on the field. Field data consist of measurements of electrical conductivity and are obtained by the combination of geophysical methods and the analysis of field soil samples. Uncalibrated salinity maps were calculated with spectral correlation mapping using image-based reference spectra of saline areas. As an alternative indicator for soil salinity, the NDVI was used. The method was verified in the Yanqi Basin, northwestern China. Correlations between field data and the uncalibrated salinity maps were found over non-irrigated sites for all images. Good correlations (R 2 up to 0.85) resulted for images collected during the winter months. The high correlation coefficients allow the uncalibrated salinity maps to be scaled to electrical conductivity maps.
Communication Protocols and Message Formats for BLAST Parallelization on Cluster Systems
Authors: Hong-Soog Kim, Woo-Hyuk Jang, Dong-Soo Han
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

With the widespread use of BLAST, many parallel versions of BLAST on cluster systems are announced, but little work has been done for the parallel execution in the search for individual query sequence on BLAST on cluster systems. Since we can improve not only throughput but also response time, the techniques for parallel execution of BLAST on cluster systems in the search for individual query sequence deserve to be developed. This paper develops communication protocols and message formats to reduce the communication overheads for the parallel execution of BLAST in the search for individual query sequence on cluster systems.The developed communication protocols and message formats are implemented on a new version of BLAST on cluster systems. The new version of BLAST is named Hyper-BLAST in this paper. In this paper, we also measured the throughput and response time of Hyper-BLAST on various cluster systems.It turned out that considerable performance improvement of BLAST on cluster systems can be achieved through parallel execution in the search for individual query sequence on small or middle-sized cluster systems.On 1-way 64-node system, Hyper-BLAST achieved scalable speedup up to 63 processors for 1000-5000 length query size.
A low-power ADPLL using feedback DCO quarterly disabled in time domain
Authors: Chua-Chin Wang, Chi-Chun Huang, Sheng-Lun Tseng
Venue: Microelectronics Journal (2008)

We propose a low-power ADPLL (all-digital phase-locked loop) using a controller which employs a binary frequency searching method in this paper. Glitch hazards and timing violations which occurred very often in the prior ADPLL designs are avoided by the control method and the modified DCO (digital-controlled oscillator) with multiplexers. Besides, the feedback DCO is disabled half a cycle in every two cycles so as to reduce 25% of dynamic power theoretically. The proposed design is implemented by only using the standard cells of a typical 0.18@mm CMOS process. The feature of power saving is verified on silicon to be merely 1.53mW at a 133MHz output.
A foundation of rough sets theoretical and computational hybrid intelligent system for survival analysis
Authors: Puntip Pattaraintakorn, Nick Cercone
Venue: Computers Mathematics with Applications (2008)

What do we (not) know about the association between diabetes and survival time? Our study offers an alternative mathematical framework based on rough sets to analyze medical data and provide epidemiology survival analysis with risk factor diabetes. We experiment on three data sets: geriatric, melanoma and Primary Biliary Cirrhosis. A case study reports from 8547 geriatric Canadian patients at the Dalhousie Medical School. Notification status (dead or alive) is treated as the censor attribute and the time lived is treated as the survival time. The analysis result illustrates diabetes is a very significant risk factor to survival time in our geriatric patients data. This paper offers both theoretical and practical guidelines in the construction of a rough sets hybrid intelligent system, for the analysis of real world data. Furthermore, we discuss the potential of rough sets, artificial neural networks (ANNs) and frailty index in predicting survival tendency.
Why many theories of shock waves are necessary: Convergence error in formally path-consistent schemes
Authors: Manuel J. Castro, Philippe G. LeFloch, María Luz Muñoz-Ruiz, Carlos Parés
Venue: Journal of Computational Physics (2008)

We are interested in nonlinear hyperbolic systems in nonconservative form arising in fluid dynamics, and, for solutions containing shock waves, we investigate the convergence of finite difference schemes applied to such systems. According to Dal Maso, LeFloch, and Murat's theory, a shock wave theory for a given nonconservative system requires prescribing a priori a family of paths in the phase space. In the present paper, we consider schemes that are formally consistent with a given family of paths, and we investigate their limiting behavior as the mesh is refined. we first generalize to systems a property established earlier by Hou and LeFloch for scalar conservation laws, and we prove that nonconservative schemes generate, at the level of the limiting hyperbolic system, an convergence error source-term which, provided the total variation of the approximations remains uniformly bounded, is a locally bounded measure. This convergence error measure is supported on the shock trajectories and, as we demonstrate here, is usually ''small''. In the special case that the scheme converges in the sense of graphs - a rather strong convergence property often violated in practice - then this measure source-term vanishes. We also discuss the role of the equivalent equation associated with a difference scheme; here, the distinction between scalar equations and systems appears most clearly since, for systems, the equivalent equation of a scheme that is formally path-consistent depends upon the prescribed family of paths. The core of this paper is devoted to investigate numerically the approximation of several (simplified or full) hyperbolic models arising in fluid dynamics. This leads us to the conclusion that for systems having nonconservative products associated with linearly degenerate characteristic fields, the convergence error vanishes. For more general models, this measure is evaluated very accurately, especially by plotting the shock curves associated with each scheme under consideration; as we demonstrate, plotting the shock curves provide a convenient approach for evaluating the range of validity of a given scheme.
Performance comparison of a network layer ACP and an application layer ACP via simulations
Authors: Rohan De Silva
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

In this paper, we present the performance of a new inter-agent communication protocol that operates in the network layer. Its performance is compared with the performance of an inter-agent communication protocol that operates in the application layer. It improves the efficiency and reduces latency in finding a product match. The packets that are sent across the network using our protocol will be recognised by active routers, which will then be processed to identify different types of agents. Information of the merchant agents is stored in an active router that acts as an e-marketplace.
The Official Ubuntu Book, 3 edition
Authors: Benjamin Mako Hill, Corey Burger, Jonathan Jesse, Jono Bacon
Venue:  (2008)

Linux Journal Readers Choice Awards 2008 Favorite Linux Book, Honorable Mention. http://www.linuxjournal.com. . . this one (Ubuntu Linux book) is at the head of the pack for getting started with your penguin experience. . . .Tom DuffBenjamin Mako Hill et al. have produced an excellent book that speaks to everyone who uses or is considering using Ubuntu.James Pyles, Reviewer, The Linux TutorialWell written in an easy-to-follow format. Full of information for folks new to Linux or just new to Ubuntu. Even nontechnical users would find this a very helpful resource.Ben Gerber, Arsgeek.comId recommend picking it up if you are running Ubuntu.Tony Lawrence, owner of aplawrence.comUbuntu is a complete, free operating system that emphasizes community, support, and ease of use without compromising speed, power, or flexibility. Its Linux for human beingsdesigned for everyone from computer novices to experts. Ubuntu 8.04 LTS (Long Term Support), a.k.a., Hardy Heron, is the latest releasemore powerful, more flexible, and friendlier than ever. The Official Ubuntu Book, Third Edition, will get you up and running quickly.Written by expert leading Ubuntu community members, this book covers all you need to know to make the most of Ubuntu 8.04 LTS, whether youre a home user, small business user, server administrator, or programmer. The authors cover Ubuntu 8.04 LTS from start to finish: installation, configuration, desktop productivity, games, management, support, and much more. Among the many new topics covered in this edition: the new Edubuntu and the brand new Kubuntu Remix including KDE 4. The Official Ubuntu Book, Third Edition, covers standard desktop applications, from word processing, spreadsheets, Web browsing, e-mail, instant messaging, music, video, and games to software development, databases, and server applications. In addition, youllLearn how to customize Ubuntu for home, small business, school, government, and enterprise environmentsLearn how to quickly update Ubuntu to accommodate new versions and new applications Find up-to-the-minute troubleshooting advice from Ubuntu users worldwideLearn Ubuntu Server installation and administration, including LVM and RAID implementationLearn about EdubuntuUbuntu optimized specifically for the classroom The DVD includes the complete Ubuntu Linux operating system for installation on PC platforms, preconfigured with an outstanding desktop environment for both home and business computing. It can be used to install other complete variants of Ubuntu including Kubuntu (with the KDE environment), and Edubuntu (for use in schools).