ppxscal/embedding_network huggingface dataset:
From Autonomic Computing to Autonomic Networking: An Architectural Perspective
Authors: David Raymer, Sven van der Meer, John Strassner
Venue: Proceedings of the Fifth IEEE Workshop on Engineering of Autonomic and Autonomous Systems (2008)

This paper aims to provide a roadmap on how to extend our understanding of the biological analogy applied to a single computing platform (Autonomic Computing) towards a larger scale of a network supporting distributed application sets. We will draw from our experience in autonomic networking and autonomic management, and discuss how the ACF Architecture Expert’s Group plans to provide architectural specifications and guidelines that allow for the modeling, design, implementation and deployment of an autonomic network.
Moments of the duration of busy periods of mx/g/1/n systems
Authors: António Pacheco, H. Ribeiro
Venue: Probability in the Engineering and Informational Sciences (2008)

We derive a simple recursion to compute moments of arbitrary order of the duration of busy periods of MX/G/1/n systems starting with an arbitrary number of customers in the system.
Randomness in interactive proofs
Authors: M. Bellare
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

The quantitative aspects of randomness in interactive proof systems are studied. The result is a randomness-efficient error-reduction technique: given an Arthur-Merlin proof system (error probability
A family of improved Jarratt multipoint methods
Authors: J. R. Sharma
Venue: International Journal of Computer Mathematics (2007)

We derive a one-parameter family of sixth-order methods for solving equations which is based on the Jarratt fourth-order multipoint method. Further, we show that a particular choice of the parameter results in fifth-order convergence. Each member of the family requires two evaluations of the given function and two of its derivative per iteration. Numerical examples are presented and the performance is compared with the Jarratt method.
Opportunistic Data Dissemination Using Real-World User Mobility Traces
Authors: Andreas Heinemann, Jussi Kangasharju, Max Muehlhaeuser
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Opportunistic communication allows humans equipped with mobile devices to exchange information via a wireless link whenever they are nearby. This work examines the performance of a profile-based data dissemination scheme. We use a 2-step simulation approach which combines realistic user mobility traces with synthetic mobility models. We consider different system configurations and evaluate their effects on the data dissemination scheme. In particular, we look at how different wireless networking technologies affect the system and how much can we benefit from the installation of fixed information sprinkler nodes. Furthermore, we investigate the effects of user behavior by comparing selfish and generous users. Our results clearly demonstrate that realistic user mobility patterns result in a feasible opportunistic data dissemination scheme. In most of the studies scenarios, the effectiveness of the dissemination is very high, with over 90% of the users reached within a week of real time. Our results on user behavior show that although the effects of selfish behavior can be mitigated, they cannot be completely eliminated.
Vertices contained in every minimum dominating set of a tree
Authors: C. M. Mynhardt
Venue: Journal of Graph Theory (1999)

In this article we begin the study of the vertex subsets of a graph G which consist of the vertices contained in all, or in no, respectively, minimum dominating sets of G. We characterize these sets for trees, and also obtain results on the vertices contained in all minimum independent dominating sets of trees. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 31: 163-177, 1999
A Hybrid Approach for Developing an Ontology of Genetic Susceptibility to Common Disease (OGSCD)
Authors: Yu Lin, Norihiro Sakamoto
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Motivation: To identify the genetic susceptibility to human disease is the central task for the medical genetics researchers; however, to distinguish the true susceptibility factors remains far less satisfaction. Considering the complex and unstructured information on this topic, an ontology is important to explicit the concepts and their relationships in the domain of the genetic susceptible factors to common disease. Here by using Diabetes Mellitus as an example,we developed an Ontology of Genetic Susceptibility to Common Disease (OGSCD). Results: The core conception was primarily summarized, then we half adopted conceptions from BFO to develop the ontology starting from the top level. A hybrid of middle-out and top-down approach was conducted for the construction of OGSCD. By using Protége-OWL editor, we developed the ontology which represents the knowledge of the susceptibility genetic factors to common disease.
A PPM Prediction Model Based on Stochastic Gradient Descent for Web Prefetching
Authors: Zhijie Ban, Zhimin Gu, Yu Jin
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

PPM models are commonly used to predict the user’s next request in Web prefetching by extracting useful knowledge from historical user requests. Any of features such as page access frequency, prediction feedback, context length and conditional probability can influence on the prefetching performance of PPM models. However, existing PPM models only consider one or a few of them. Based on stochastic gradient descent, we present a novel PPM model that takes into account all the above mentioned features. Our model defines a target function to describe a node’s prediction capability, which is a linear combination of these features. In order to decrease the number of incorrect predictions, weights of these features are dynamically updated over every example according to the stochastic gradient descent rule. Our model selects a node with the maximum target function value among all matching nodes to predict the next most probable page. We use real web logs to examine proposed model. The simulation shows our model can significantly improve the prefetching performance.
Interactive Fuzzy Multi-objective Ant Colony Optimization with Linguistically Quantified Decision Functions for Flexible Job Shop Scheduling Problems
Authors: Li-Ning Xing, Ying-Wu Chen, Ke-Wei Yang
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Scheduling for the flexible job shop is very important in the fields of production management and combinatorial optimization. It proposes an Ant Colony Optimization with Linguistically Quantified Decision Functions (ACO-LQDF) for the Flexible Job Shop Scheduling Problems (FJSSP) in this work. The novelty of the proposed approach is the interactive and fuzzy multi-objective nature of the Ant Colony Optimization (ACO) that considers the aspiration levels set by the decision maker (DM) for the objectives. The ACO's decision function is a linguistically quantified statement about acceptable distances between achieved objective values and aspiration levels. Linguistic quantifiers are represented by means of fuzzy sets. Our computational investigation indicates that this approach can tackle multi-objective FJSSP effectively.
Multi-Level Reputation-Based Greylisting
Authors: Andreas G. K. Janecek, Wilfried N. Gansterer, K. Ashwin Kumar
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

We present the idea and implementation details of a highly effective and reliable e-mail filtering technique. At the core of the component-based architecture is a novel combination of an enhanced self-learning variant of greylisting with a reputation-based trust mechanism. These strategies provide separate feature extraction and classification components with the opportunity of utilizing the time between two delivery attempts of an e-mail message. The approach presented features a very high spam blocking rate and also minimizes the workload on the client side, as no responsibility for messages classified as spam is taken. The reputation-based trust mechanism decreases the delay in the transfer process of e-mail messages from reliable senders and also reduces the number of erroneously blocked legitimate messages.
Optimization in a multivariate generalized linear model situation
Authors: S. Mukhopadhyay, A. I. Khuri
Venue: Computational Statistics Data Analysis (2008)

The purpose of this article is to find the settings of the factors which simultaneously optimize several mean responses in a multivariate generalized linear model (GLM) environment. The generalized distance approach, initially developed for the simultaneous optimization of several linear response surface models, is adapted to this multivariate GLM situation. An application of the proposed methodology is presented in the special case of a bivariate binary distribution resulting from a drug testing experiment concerning two responses, namely, the efficacy and toxicity of a particular drug combination. One of the objectives of this application is to find the dose levels of two drugs that simultaneously maximize their therapeutic effect and minimize any possible toxic effects. A second application is presented in the case of a multivariate gamma distribution.
Logical handling of uncertain, ontology-based, spatial information
Authors: Florence Dupin de Saint-Cyr, Henri Prade
Venue: Fuzzy Sets and Systems (2008)

The paper describes a logical framework for handling uncertain spatial information, and merging it when it comes from multiple sources. For this purpose, we use a simple logical formalization for spatial ontologies and for property ontologies relative to different universes of discourse (these ontologies only involve subsumption and mutual exclusiveness relations), since spatial information typically associates properties to sets of parcels that are themselves described in terms of the spatial and/or property vocabularies appearing in the ontologies. Apart from the ontological information describing relations between vocabulary labels, we propose to represent a piece of spatial information as a pair, called ''attributive formula'', associating a property formula to a set of parcels (represented by a spatial formula). A set of inference rules is given in order to be able to reason from these attributive pairs. Then, we examine how uncertainty can be encoded in attributive information, using possibilistic logic in a reified manner with respect to parcels. Another important issue pointed out in this paper is that there are two ways to link a property to an area. A first meaning is that the property is true everywhere in the area, a second meaning is that the property is at least true somewhere in the area. This distinction is necessary in order to be able to use both ontological information (which can be encoded by ''everywhere'' attributive-formulas) and attributive information (which contain the two kinds of attributive-formulas). Lastly, the paper studies how information fusion problems can be handled in the context of spatial data. The problems encountered do not come only from the uncertainty and the possible inconsistency of information as in any information fusion situations, but also from the fact that sources may use different space partitions and may not explicitly specify the somewhere or everywhere reading associated to the information.
Families of algorithms related to the inversion of a Symmetric Positive Definite matrix
Authors: Paolo Bientinesi, Brian Gunter, Robert A. van de Geijn
Venue: ACM Transactions on Mathematical Software (TOMS) (2008)

We study the high-performance implementation of the inversion of a Symmetric Positive Definite (SPD) matrix on architectures ranging from sequential processors to Symmetric MultiProcessors to distributed memory parallel computers. This inversion is traditionally accomplished in three &ldquo;sweeps&rdquo;: a Cholesky factorization of the SPD matrix, the inversion of the resulting triangular matrix, and finally the multiplication of the inverted triangular matrix by its own transpose. We state different algorithms for each of these sweeps as well as algorithms that compute the result in a single sweep. One algorithm outperforms the current ScaLAPACK implementation by 20-30 percent due to improved load-balance on a distributed memory architecture.
Software architecting without requirements knowledge and experience: What are the repercussions?
Authors: Remo Ferrari, Nazim H. Madhavji
Venue: Journal of Systems and Software (2008)

Whereas the relationship between Requirements Engineering and Software Architecture (SA) has been studied increasingly in recent years in terms of methods, notations, representations, tools, development paradigms and project experiences, that in terms of the human agents conducting these processes has not been explored scientifically. This paper describes the impact of requirements knowledge and experience (RKE) on software architecting tasks. Specifically, it describes an exploratory, empirical study involving 15 architecting teams, approximately evenly split between those teams with RKE and those without. Each team developed its own system architecture from the same given set of requirements in the banking domain. The subjects were all final year undergraduate or graduate students enrolled in a university-level course on software architectures. The overall results of this study suggest that architects with RKE develop higher-quality software architectures than those without, and that they have fewer architecture-development problems than did the architects without RKE. This paper identifies specific areas of both architecture design as well as the architecture-development process where the differences manifest between the RKE and non-RKE architects. The paper also describes the possible implications of the findings on the areas of hiring and training, pedagogy, and technology. The empirical study was carried out using the ''mixed methods'' approach, involving both quantitative and qualitative aspects of the investigation. A bi-product of this study is an architectural assessment instrument (included in the Appendix) for quantitative analysis of the quality of a software architecture. This paper also describes some new threads for future work.
Interdomain routing and games
Authors: Hagay Levin, Michael Schapira, Aviv Zohar
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

We present a game-theoretic model that captures many of the intricacies of interdomain routing in today's Internet. In this model, the strategic agents are source nodes located on a network, who aim to send traffic to a unique destination node. The interaction between the agents is dynamic and complex -- asynchronous, sequential, and based on partial information. Best-reply dynamics in this model capture crucial aspects of the interdomain routing protocol de facto, namely the Border Gateway Protocol (BGP). We study complexity and incentive-related issues in this model. Our main results are showing that in realistic and well-studied settings, BGP is incentive-compatible. I.e., not only does myopic behaviour of all players converge to a "stable" routing outcome, but no player has motivation to unilaterally deviate from the protocol. Moreover, we show that even coalitions of players of any size cannot improve their routing outcomes by collaborating. Unlike the vast majority of works in mechanism design, our results do not require any monetary transfers (to or by the agents).
The BP Neural Network Optimizing Design Model for Agricultural Information Measurement Based on Multistage Dynamic Fuzzy Evaluation
Authors: Zhibin Liu, Li Bai
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

The agricultural information level is on the initial stage in China, so we should pay more attention to its construction, but how to measure the agricultural information degree is a major issue. This paper overcomes the shortcoming of traditional linear agricultural information degree evaluation method, proposes a BP neural network evaluating method based on the multistage dynamic fuzzy judgment, takes the multistage dynamic fuzzy judgment as the sampling foundation, uses the BP neural network principle to establish evaluation model. This method not only can exert the unique advantages of BP neural network, but also overcome the difficulty of seeking the high grade training sample data. The agricultural information degree evaluation of 10 cities in Jilin province indicates that the method to evaluate the agricultural information degree is stable and reliable.
Assessing post-tsunami effects on ocean colour at eastern Indian Ocean using MODIS Aqua satellite
Authors: C. K. Tan, J. Ishizaka, A. Manda, E. Siswanto, S. C. Tripathy
Venue: International Journal of Remote Sensing (2007)

The 2004 Indian Ocean tsunami had been reported to cause vast destruction on marine environment, but its effect on the primary production and upwelling event was unknown. Moderate Resolution Imaging Spectroradiometer (MODIS) Aqua ocean colour imageries were used to assess the tsunami effects on the chlorophyll-a (chl-a) and turbidity variations. Chlorophyll-a and normalized water leaving radiance at 551 nm (nLw 551) before and after the tsunami event were processed using SeaWiFS data analysis system (SeaDAS), and the variations were examined. Results showed a sudden increase of chl-a and nLw 551 at the north-western Sumatra and middle of Malacca Straits (MS) after the tsunami. At western Sumatra, high sedimentation caused by the backwash resulted in overestimation of the chl-a values. However, the chl-a in the upwelling area in the northern MS did not exhibit any significant changes. The chl-a variation in the northern MS was found to be related to the monsoon wind with about one week time lag. At the seriously eroded coastline along western Sumatra, continuous sedimentation was observed. The sedimentation problem became more severe during higher rainfall periods in April 2005. We strongly suggest a long term monitoring of this sedimentation problem.
Hidden surface removal for axis-parallel polyhedra
Authors: M. de Berg, M. H. Overmars
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

An efficient, output-sensitive method for computing the visibility map of a set of axis-parallel polyhedra (i.e. polyhedra with their faces and edges parallel to the coordinate axes) as seen from a given viewpoint is introduced. For nonintersecting polyhedra with n edges in total, the algorithm runs in time O((n+k)log n), where k is the complexity of the visibility map. The method can handle cyclic overlap of the polyhedra and perspective views without any problem. For c-oriented polyhedra (with faces and edges in c orientations, for some constant c) the method can be extended to run in the same time bound. The method can be extended even further to deal with intersecting polyhedra with only a slight increase in the time bound.
Teacher Monitoring System in One-to-One Self-Paced Learning Classroom
Authors: Oskar Y. M. Ku, Owen W. S. Huang, Tak-Wai Chan
Venue: Proceedings of the Fifth IEEE International Conference on Wireless, Mobile, and Ubiquitous Technology in Education (2008)

One-to-one technology is getting more and more attention, and it will start to make changes to education. However, it is not easy to change the traditional classroom, most teachers don’t want to alter their teaching habits, if we put computer into classroom but no appropriate pedagogy and subject matter accompanied, computers in classroom will lost their value. Here we apply self-paced learning as the pedagogy in one-to-one classroom, and develop a monitoring system to help teacher to handle the classroom. A preliminary study was proceeded to test the usability of the system.
Optimal flight scheduling models for cargo airlines under alliances
Authors: Shangyao Yan, Chia-Hung Chen
Venue: Journal of Scheduling (2008)

In this paper we develop several coordinated scheduling models combining airport selection, fleet routing and timetable setting, in order to help airlines solve for the most satisfactory cargo fleet routes and timetables when they enter into alliances. We employ network flow techniques to construct the models, which are formulated as a multiple commodity network flow problem and can be solved using a mathematical programming solver. To evaluate the models, we perform numerical tests based on real operating data from two Taiwan airlines. The preliminary results are good, showing that the models would be useful for airline alliances.
A Cryptographic Scavenger Hunt
Authors: Judy A. Holdener, Eric J. Holdener
Venue: Cryptologia (2007)

In this article, the authors present a mathematical scavenger hunt designed to motivate and excite students learning RSA cryptography in an introductory number theory course. The hunt relies on the RSA cryptosystem, in which Maple is used to encipher and decipher secret information contained within the clues.
Thin clients booting over a wireless bridge
Authors: Ronan Skehill, Alan Dunne, John Nelson
Venue: Linux Journal (2008)

Setting up a thin-client network, and some useful operation/administration tools.
A Novel Offline Demosaicing Method for Wireless Endoscope
Authors: Yongqiang Cheng, Keming Xie
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

In this paper, we propose a new demosaicking scheme suitable for wireless endoscope. The proposed approach consists of an iterative process where two effective filters are applied to luminance image and color different image, respectively. Since some prior information about the original color image is introduced and the penalty term is quadratic, the iterative convergence is guaranteed. The new method is especially good at reconstructing the image suffering lens blurring and wireless channel noise. We have compared the proposed demosaicing algorithm with current state-of-the-art techniques reported in literature. Ours outperforms them on visual quality and objective criteria.
Evaluation of electron beam welding technique for the integration of robust sensor elements into high-pressure automotive systems
Authors: U. Schmid, D. Schmitt-Landsiedel, G. Kr&#x00f6;tz
Venue: Microsystem Technologies (2008)

For &#x201c;on board&#x201d; diagnosis purposes of the injected fuel quantity flow sensitive elements based on the thermo-resistive measurement principle were integrated into finished Common Rail injection nozzles of valve-covered orifice (VCO) or mini-sac hole (MSH) class. Electron-discharge machining as well as electron beam welding technique are key technologies for a reliable integration procedure. To demonstrate negligible influence on the hydraulic performance of the nozzle after modification an optical measurement set-up is used to record temporally resolved the propagation of the spray patterns ejected from the six injection holes simultaneously. From these investigations the impact on the structural distortion of the valve caused by the welding seam is proved as its position can be directly linked to any chances in spray performance of each individual injection hole. Reducing the energy input during the electron beam welding lowers substantially the asymmetry in spray patterns from hole to hole as the needle uncovers the six injection holes more symmetrically. Besides this important finding, the numerical calculations indicate that the implementation of the sensor chip slightly amplifies the asymmetry induced by the welding process due to an additional weakening of the nozzle body which is confirmed experimentally. Despite these challenges, however, it is demonstrated that appropriate parameters for the integration procedure can be found affecting the hydraulic performance negligible compared to the original state.