ppxscal/embedding_network huggingface dataset:
Formal Verification of a Grid Resource Allocation Protocol
Authors: Mathias Dalheimer, Franz-Josef Pfreundt, Peter Merz
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

As the adoption of grid technology moves from science to industry, new requirements arise. In todays grid middlewares, the notion of paying for a job is a secondary requirement. In addition, the concept of selling computational power on a market is not established. On the other hand, the lack of billing capabilities hinders the commercial adoption.In this paper, we present our resource allocation protocol that suits the needs of commercial solution providers. We have developed an auction-based resource broker which uses a distributed agent infrastructure to communicate the user's requirements to resource providers and monetary prices back. The protocol has been formally verified and guarantees certain properties - for example, we can guarantee that the right stakeholder is billed for a job.
Bookisms
Authors: Paul Gray
Venue: Information Systems Management (2007)

In this issue we review three books, two of which deal with knowledge and knowledge management and the third deals with the many collaboration techniques coming to market. The first two are solid works by people who are leaders in the field, including Laurence Prusak, coauthor with Tom Davenport of the most widely read Knowledge management book (Davenport and Prusak, 1995) published in the United States (see review in Volume 15, No. 3, Summer 1998 issue of ISM) and Ikujiro Nonaka (1991) from Japan who wrote the original knowledge management article in Harvard Business Review. The third book, Wikinomics, by Don Tapscott and coauthor, praises collaboration developments from Wikis to MySpace and beyond, written in a breathless, advertising style that may not appeal to everyone.
Computer science olympiad: exploring computer science through competition
Authors: Iretta B. Kearse, Charles R. Hardnett
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

Generating interest in specialized areas of Computer Science (CS) is one of the goals of the department of Computer and Information Science at Spelman College as with most departments. Achieving this goal in a new, exciting, and innovative manner provided the inspiration to establish the Spelman College Computer Science Olympiad (SC CS Olympiad). The SC CS Olympiad is patterned after the Olympics athletic event. Students participate in the Olympiad as a part of a team as with the Olympics. In addition, there are several events for competition as there are in the Olympics. The events are designed to expose students to the interesting breadth of CS over several days. In this paper, the events are in the following categories: Cryptography, Robotics, Website Design, Hardware and Software Integration, and Programming. Teams use their CS knowledge and problem-solving skills to complete hands-on exercises in each area. Each teams receives points based on the quality of their results from the exercise. In this paper, we present the implementation, results, and future directions of the Spelman College Computer Science Olympiad.
A bioinformatics track in computer science
Authors: Sami Khuri
Venue: ACM SIGCSE Bulletin (2008)

In this paper, we describe the bioinformatics track we created to better prepare students for health, medical and life science professions. Our program was motivated by the fact that bioinformatics training is in high demand. Many universities have responded to this demand by creating majors in bioinformatics, while others by creating minors in bioinformatics. Our response was less extreme as we opted for a computer science track in bioinformatics which we describe in this article.
The study of drug-reaction relationships using global optimization techniques
Authors: M. A. Mammadov, A. M. Rubinov, J. Yearwood
Venue: Optimization Methods Software (2007)

In this paper we develop an optimization approach for the study of adverse drug reaction (ADR) problems. This approach is based on drug-reaction relationships represented in the form of a vector of weights, which can be defined as a solution to some global optimization problem. Although it can be used for solving many ADR problems, we concentrate on two of them here: the accurate identification of drugs that are responsible for reactions that have occurred, and drug-drug interactions. Based on drug-reaction relationships, we formulate these problems as an optimization problem. The approach is applied to cardiovascularn-type reactions from the Australian Adverse Drug Reaction Advisory Committee (ADRAC) database. Software based on this approach has been developed and could have beneficial use in prescribing.
ICT integration in the classroom: Challenging the potential of a school policy
Authors: Jo Tondeur, Hilde van Keer, Johan van Braak, Martin Valcke
Venue: Computers Education (2008)

Despite the assumption that the integration of ICT influences the entire school system, research focusing on ICT in schools is generally limited to the study of variables at class level. In contrast to these studies, the present research explores ICT integration from a school improvement approach. More particularly, it examines the local school policy with respect to ICT integration from both the principal's perspective and perceptions of teachers. Furthermore, it studies the relationship between school policies and the actual use of ICT in the classroom. To answer the research questions, a representative sample of 53 primary school principals was interviewed. In addition, the interview data were supplemented with survey data of 574 teachers from the same 53 schools. What emerged from the analyses was that school-related policies, such as an ICT plan, ICT support and ICT training have a significant effect on class use of ICT. In addition, the findings from the interviews indicate that school policies are often underdeveloped and underutilised. The discussion section focuses on challenges to improve the potential of an ICT school policy.
Path coverings with paths
Authors: J. McGee, C. A. Rodger
Venue: Journal of Graph Theory (2001)

In this paper, we give two new proofs of a result of Heinrich, Langdeau and Verrall that provide necessary and sufficient conditions for the existence of a set S of 3-paths in Kn having the property that each 2-path in Kn lies in exactly one path in S. These are then used to consider the case n&thinsp;&equiv;&thinsp;3 (mod 4) when no such exact covering is possible, and to solve the problem of covering (k-1)-paths with k-paths for all k&thinsp;&ge;&thinsp;3. &copy; 2001 John Wiley & Sons, Inc. J Graph Theory 36: 156&ndash;167, 2001 This research is supported by NSF grant DMS 9531722 and ONR grant N00014-97-1-1067.
A time-dependent LMS algorithm for adaptive filtering
Authors: Yuu-Seng Lau, Zahir M. Hussian, Richard Harris
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

A novel approach for the least-mean-square (LMS) estimation algorithm is proposed. The approach utilizes the conventional LMS algorithm with a time-varying convergence parameter µn rather than a fixed convergence parameter µ. It is shown that the proposed time-varying LMS algorithm (TVLMS) provides reduced mean-squared error and also leads to a faster convergence as compared to the conventional fixed parameter LMS algorithm. This paper presents a performance study for the proposed TV-LMS algorithm and other two main adaptive approaches: the least-mean square (LMS) algorithm and the recursive least-squares (RLS) algorithm. These algorithms have been tested for noise reduction and estimation in single-tone sinusoids and nonlinear narrow-band FM signals corrupted by additive white Gaussian noise. The study shows that the TV-LMS algorithm has a computation time close to conventional LMS algorithm with the advantages of faster convergence time and reduced mean-squared error.
Visual Support In Automated Tracing
Authors: Jane Cleland-Huang, Rafal Habrat
Venue: Proceedings of the Second International Workshop on Requirements Engineering Visualization (2007)

Automated traceability facilitates the dynamic generation of candidate links between requirements and other software artifacts. It provides an alternative option to the arduous and error-prone process of manually creating and maintaining a trace matrix. However the result set contains both true and false links which must therefore be evaluated by an analyst. Current approaches display the candidate links to the user in a relatively bland textual format. This position paper proposes several visualization techniques for helping analysts to evaluate sets of candidate links. The techniques are illustrated using examples from the Ice Breaker System.
Modeling of the Effect of Crosstalk in Apoptotic Pathways on Caspase-3 Activation
Authors: Jinki Kim, Gwan-Su Yi
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Apoptosis is a physiologically crucial process for the control of cellular development and homeostasis in multi-cellular organisms. It occurs as a result of signal cascades in a complex cellular network. Although individual apoptotic signal pathways have been revealed, it is difficult to explain the effect of collaborative responses in apoptosis system. In the present work, we propose a mathematical model for crosstalk between the death receptor and the mitochondria-dependent pathway. The crosstalk in this model is a key element to ensure bistability, an important feature for the completion of apoptotic events. Our analysis suggests that the crosstalk between positive feedback loops in two major apoptotic pathways can perform an important role in terms of maintaining bistability. We show that the crosstalk can enhance feedback strength, leading to irreversible caspase-3 activation.
On the Approximation of Correlation Clustering and Consensus Clustering
Authors: Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Tao Jiang
Venue: Journal of Computer and System Sciences (2008)

The Correlation Clustering problem has been introduced recently [N. Bansal, A. Blum, S. Chawla, Correlation Clustering, in: Proc. 43rd Symp. Foundations of Computer Science, FOCS, 2002, pp. 238-247] as a model for clustering data when a binary relationship between data points is known. More precisely, for each pair of points we have two scores measuring the similarity and dissimilarity respectively, of the two points, and we would like to compute an optimal partition where the value of a partition is obtained by summing up the similarity scores of pairs involving points from the same cluster and the dissimilarity scores of pairs involving points from different clusters. A closely related problem is Consensus Clustering, where we are given a set of partitions and we would like to obtain a partition that best summarizes the input partitions. The latter problem is a restricted case of Correlation Clustering. In this paper we prove that Minimum Consensus Clustering is APX-hard even for three input partitions, answering an open question in the literature, while Maximum Consensus Clustering admits a PTAS. We exhibit a combinatorial and practical 45-approximation algorithm based on a greedy technique for Maximum Consensus Clustering on three partitions. Moreover, we prove that a PTAS exists for Maximum Correlation Clustering when the maximum ratio between two scores is at most a constant.
Implementation and Analysis of New Lightweight Cryptographic Algorithm Suitable for Wireless Sensor Networks
Authors: Woo Kwon Koo, Hwaseong Lee, Yong Ho Kim, Dong Hoon Lee
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

Sensor devices have critical resource constraints such as processing speed, memory size and energy supply. Especially, energy consumption affects the network lifetime so that energy efficiency is an important requirement for wireless sensor networks (WSNs). It means that it is a considerable matter to choose the energy- and memory-efficient cryptographic algorithm suitable for wireless sensor networks. TinySec, de facto security architecture for wireless sensor networks, supports traditional cryptographic algorithms such as RC5 and Skipjack while the traditional cryptographic algorithms might be unsuitable for 8-bit computing devices of which wireless sensor networks consist. Accordingly, it is necessary to evaluate the traditional cryptographic algorithms and 8-bit oriented cryptographic algorithm in performance but there is no work in this area. In this paper, we consider another candidate HIGHT, designed to be proper to ubiquitous 8-bit computing devices (e.g. sensor node or RFID tag), for wireless sensor networks. After implementing new lightweight HIGHT on Mica2 and analyzing the performance between HIGHT and the traditional cryptographic algorithms, we can conclude that HIGHT, outstanding in security and efficiency, is recommended for TinySec as like traditional cryptographic algorithms on TinySec. Hence, we recommend new lightweight candidate HIGHT to be added to security module in TinySec.
Combinatorial complexity bounds for arrangements of curves and surfaces
Authors: K. L. Clarkson
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

The authors study both the incidence counting and the many-faces problem for various kinds of curves, including lines, pseudolines, unit circles, general circles, and pseudocircles. They also extend the analysis to three dimensions, where they concentrate on the case of spheres, which is relevant for the three-dimensional unit-distance problem. They obtain upper bounds for certain quantities. The authors believe that the techniques they use are of independent interest.
An approach to quality engineering of TTCN-3 test specifications
Authors: Helmut Neukirchen, Benjamin Zeiss, Jens Grabowski
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2008)

Experience with the development and maintenance of large test suites specified using the Testing and Test Control Notation (TTCN-3) has shown that it is difficult to construct tests that are concise with respect to quality aspects such as maintainability or usability. The ISO/IEC standard 9126 defines a general software quality model that substantiates the term &#x201c;quality&#x201d; with characteristics and subcharacteristics. The domain of test specifications, however, requires an adaption of this general model. To apply it to specific languages such as TTCN-3, it needs to be instantiated. In this paper, we present an instantiation of this model as well as an approach to assess and improve test specifications. The assessment is based on metrics and the identification of code smells. The quality improvement is based on refactoring. Example measurements using our TTCN-3 tool TRex demonstrate how this procedure is applied in practise.
A Control Theory Approach to Improve the Real-Time Capability of Multi-Threaded Microprocessors
Authors: Uwe Brinkschulte, Mathias Pacher
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

Our aim is to investigate if it is possible to control the throughput (IPC rate) of a thread running on a simultaneous multi-threaded microprocessor by a closed feedback loop. We showed in previous experimental studies that the proposed approach works. In this paper we discuss the control theory approach from a theoretical point of view. We develop a mathematical model of a general purpose multi-threaded microprocessor enhanced with a closed feedback controller and use control theory methods to investigate properties like stability and settling time.
High Performance Sleep-Wake Sensor Systems Based on Cyclic Cellular Automata
Authors: Y. M. Baryshnikov, E. G. Coffman, K. J. Kwak
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

Our contribution in this paper is a scalable, easily implemented, self-organizing, energy conserving intrusion-detection sensor system applying concepts from cellular automata theory. The system self-assembles periodic wake-sensor barriers (waves) that sweep the sensor field; it is highly effective even in the case of frequent communication failures, sensor failures, large obstacles, and when intruders know sensor locations.
Elements for a modular dynamic geometry system
Authors: M. Freixas, R. Joan Arinyo, A. Soto-Riera
Venue: Proceedings of the 2008 ACM symposium on Applied computing (2008)

Dynamic geometry systems are tools for geomotric visualization. They allow the user to define geometric elements, establish relationships between them and explore the dynamic behavior of the remaining geometric elements when one of them is moved. In this work we propose a modular architecture for dynamic geometry systems built upon a set of functional units which will allow to apply some well known results from the Geometric Constraint Solving field.
Optimality conditions for a nonconvex set-valued optimization problem
Authors: María Alonso, Luis Rodríguez-Marín
Venue: Computers Mathematics with Applications (2008)

In this paper we study necessary and sufficient optimality conditions for a set-valued optimization problem. Convexity of the multifunction and the domain is not required. A definition of K-approximating multifunction is introduced. This multifunction is the differentiability notion applied to the problem. A characterization of weak minimizers is obtained for invex and generalized K-convexlike multifunctions using the Lagrange multiplier rule.
Near real-time fire alert system in South Africa: from desktop to mobile service
Authors: Diane K. Davies, Hein F. Vosloo, Suresh Santhana Vannan, Philip E. Frost
Venue: Proceedings of the 7th ACM conference on Designing interactive systems (2008)

We present a design case study of a near-real time alert system warning of vegetation fires that threaten to disrupt electricity flow along power transmission lines in South Africa. Fire is one of the main causes of outages on South Africa's extensive power grid. For Eskom (South Africa's largest electricity company), knowing where and when these fires occur saves money, resources and time. The system was primarily designed to provide the locations of vegetation fires, detected from satellite data, to the mobile phones of field supervisors via SMS (short message service). The system adapts an existing desktopaccessible internet application to provide fire alerts to nonexpert users via mobile phones. It demonstrates how usability and access to needed information is enhanced by changing the output to a mobile service.
Classifying web genres in context: A case study documenting the web genres used by a software engineer
Authors: Michela Montesi, Trilce Navarrete
Venue: Information Processing and Management: an International Journal (2008)

This case study analyzes the Internet-based resources that a software engineer uses in his daily work. Methodologically, we studied the web browser history of the participant, classifying all the web pages he had seen over a period of 12 days into web genres. We interviewed him before and after the analysis of the web browser history. In the first interview, he spoke about his general information behavior; in the second, he commented on each web genre, explaining why and how he used them. As a result, three approaches allow us to describe the set of 23 web genres obtained: (a) the purposes they serve for the participant; (b) the role they play in the various work and search phases; (c) and the way they are used in combination with each other. Further observations concern the way the participant assesses quality of web-based resources, and his information behavior as a software engineer.
Reflection effects of the sea in the GSM telecommunication systems: measurements, tests and suggestions
Authors: N. Erol Ozguner, Dogan Dibekci, I. Hakki Cavdar, Arif Dolma, O. Mete Sasmaz
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

In this study, reflection effects of the sea in the GSM networks are described. In the GSM networks, especially some BTSs (Base Station Transceiver) have to be designed near the sea so some radio waves propogates uncontrolly from BTS and these waves propogates far away via the sea. This situation is not prefereed for GSM cell planner. In this study, two BTSs which are located Black Sea in Turkey are researched (about 97 km from eachother). Normally, although these two BTSs are not neighbour eachother but drive test shows that BTS1's signal influences BTS2's signals. This abnormal situaiton was determined with drive tests and finally, some suggesitons were offered.
A Legacy for Living Systems: Gregory Bateson as Precursor to Biosemiotics, 1 edition
Authors: Jesper Hoffmeyer
Venue:  (2008)

Gregory Bateson s contribution to 20th century thinking has appealed to scholars from a wide range of fields dealing in one way or another with aspects of communication and epistemology. A number of his insights were taken up and developed further in anthropology, psychology, evolutionary biology and communication theory. But the large, trans-disciplinary synthesis that, in his own mind, was his major contribution to science received little attention from the mainstream scientific communities. This book represents a major attempt to revise this deficiency. Scholars from ecology, biochemistry, evolutionary biology, cognitive science, anthropology and philosophy discuss how Bateson's thinking might lead to a fruitful reframing of central problems in modern science. Most important perhaps, Bateson's bioanthropology is shown to play a key role in developing the set of ideas explored in the new field of biosemiotics. The idea that organismic life is indeed basically semiotic or communicative lies at the heart of the biosemiotic approach to the study of life. The only book of its kind, this volume provides a key resource for the quickly-growing substratum of scholars in the biosciences, philosophy and medicine who are seeking an elegant new approach to exploring highly complex systems.
Towards a Usenet-Like Discussion System for Users of Disconnected MANETs
Authors: Julien Haillot, Frederic Guidec
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Applications that rely on the publish-subscribe model (such as those dedicated to news or event distribution) require a communication model whereby information can flow towards any interested receiver rather than towards set destinations. Content-based communication is a style of communication that perfectly fits the needs of such applications. Yet supporting this kind of communication in partially or intermittently connected mobile ad hoc networks (MANETs) is still a challenge, for end-to-end content-driven routing structures can hardly be constructed and maintained in such environments. In this paper we provide an overview of a protocol we designed to support opportunistic, delay-tolerant, content-based communication in a disconnected MANET. We also describe our project of using this protocol to implement a peer-to-peer, Usenet-inspired discussion system.