ppxscal/embedding_network huggingface dataset:
Psychological safety and social support in groupware adoption: A multi-level assessment in education
Authors: Jeroen Schepers, Ad de Jong, Martin Wetzels, Ko de Ruyter
Venue: Computers Education (2008)

In this paper, the authors propose that psychological safety, a sense of interpersonal trust and being valued in a work team, is an important determinant of groupware technology adoption in an educational setting. They develop and test a model of antecedents and consequences of psychological safety. Data were collected from 361 university students, organized in 36 teams. Results of multi-level regression analysis reveal positive individual-level effects of perceived tutor support and perceived peer support on psychological safety. Furthermore, our findings show a positive unique group-level effect of perceived tutor support on psychological safety, where an individual's level of self-consciousness strengthens this positive impact. In addition, findings of structural equation modeling demonstrate that both perceived usefulness and perceived ease of use partially mediate the positive effect of psychological safety on groupware usage. Psychological safety also shows a positive direct effect on groupware usage. Finally, a student's offline communication frequency with his tutor and peers appears to strengthen the impact of psychological safety on perceived usefulness, perceived ease of use, and groupware usage.
VizScript: on the creation of efficient visualizations for understanding complex multi-agent systems
Authors: Jing Jin, Romeo Sanchez, Rajiv T. Maheswaran, Pedro Szekely
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

One of the most difficult tasks in software development is understanding the behavior of the final product. Making sure that a system behaves as users expect is a challenging endeavor. Understanding the behavior of a multi-agent system is even more challenging given the additional complexities of multi-agent problems. In this paper, we address the problem of users creating visualizations to debug and understand complex multi-agent systems. We introduce VizScript, a generic framework that expedites the process of creating such visualizations. VizScript combines a generic application instrumentation, a knowledge-base, and simple scene definitions primitives with a reasoning system, to produce an easy to use visualization platform. Using VizScript, we were able to recreate the visualizations for a complex multiagent system with an order-of-magnitude less effort than was required in a Java implementation
The Research and Development of the Highway's Electronic Toll Collection System
Authors: Zhi-hong Xiao, Zong-qi Guan, Zi-han Zheng
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

ETC (Electronic Toll Collection) is an electronic automatism toll collection system that was been researching by the world used in the highway, bridge and tunnel. Throwing information change between electronic labels that held vehicle and RFID antennas that was fixed the roadside or door frame, the center control computer can identify the road user by the information stored in the electronic label and deduct the pike from the road user advance stored card or bank account. Its obvious advantage is no parking troll collection. Thereby it can significantly improve the dispose efficiency of the toll station and the traffic ability of toll road.
A random key based genetic algorithm for the resource constrained project scheduling problem
Authors: J. J. M. Mendes, J. F. Gonçalves, M. G. C. Resende
Venue: Computers and Operations Research (2009)

This paper presents a genetic algorithm for the Resource Constrained Project Scheduling Problem (RCPSP). The chromosome representation of the problem is based on random keys. The schedule is constructed using a heuristic priority rule in which the priorities of the activities are defined by the genetic algorithm. The heuristic generates parameterized active schedules. The approach was tested on a set of standard problems taken from the literature and compared with other approaches. The computational results validate the effectiveness of the proposed algorithm.
Macroblock-Level Rate-Distortion Optimization with Perceptual Adjustment for Video Coding
Authors: Chang Sun, Hong-Jun Wang, Hua Li
Venue: Proceedings of the Data Compression Conference (2008)

H.264/AVC coder adopts rate-distortion optimization (RDO) using Lagrange multipliers to determine a set of coding parameters in the rate-distortion sense under some coding constraints. Traditional RDO is carried out on frame level without consideration of the video contents. However, as the human visual system (HVS) makes final evaluations on the quality of the video, it is wise to adapt coding algorithm to the sensitivity of the human eyes. In this paper, we propose a novel macroblock (MB)-level RDO scheme based on perceptual features of the coded video. Experiments have been conducted based on the reference coder JM12.2 of H.264/AVC. Simulation results show that the subjective qualities of the decoded frames are improved without compromising PSNR.
Case-based software reliability assessmentby fault injection unified procedures
Authors: Alexander Gordeyev, Vyacheslav Kharchenko, Anton Andrashov, Boris Konorev, Vladimir Sklyar, Artem Boyarchuk
Venue: Proceedings of the 2008 international workshop on Software Engineering in east and south europe (2008)

The fault injection methods and tools are presented and analyzed. The unified procedures of software fault injection for assessment of software testing and quality verification on different development stages are proposed. Quality evaluation technique of software testing and verification is described. The results of using the developed tools «InExp» and «SoftAsVer» are presented.
Standardization of Work: Co-constructed Practice
Authors: Gunnar Ellingsen, Eric Monteiro, Glenn Munkvold
Venue: The Information Society (2007)

There is strong pressure to achieve greater uniformity, standardization and application of best practices in the service professions, a sector that is growing in presence and importance. At the same time, there is a conflicting demand for the delivery of high-quality (or high-priced or "knowledge-intensive") specialized or localized services. Our article analyzes information systems-enabled standardizing of service work through an in-depth interpretative study of an ongoing standardization initiative within the field of nursing. Nursing provides a graphic illustration of the dilemmas involved in the standardization of service work. In nursing, standardization is commonly a feature of projects to improve both efficiency and quality in health care. In contrast to the dominant conception of standardization as a largely top-down, imposed process, we offer a view of standardization as incomplete, co-constructed with users, and with significant unintended consequences. The article contributes by (a) developing a theoretical perspective for the standardization of information-system-embedded service work and (2) providing operational and practical implications for system design and health care management.
An Implementation of Rough Set in Optimizing Mobile Web Caching Performance (Invited Paper)
Authors: Sarina Sulaiman, Siti Mariyam Shamsuddin, Ajith Abraham
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

The stipulation of internet content rises dramatically in recent years. Servers have become extremely powerful and the bandwidth of end user connections and backbones grew constantly during the previous decade. Nonetheless, users frequently experience poor performance to access web sites or download files primarily if mobile devices have been used due to their limited storage, processing, display, power and communication resources. The causes are often performance which access directly on the servers (e.g. pitiable performance of server-side applications or during burst crowds) and network infrastructure (e.g. long geographical distances, network overloads,etc.). Hence, the goal of this study is to propose Rough Set (RS) as a knowledge representation for uncertainty in data of client behavior and mobile event specification with resource dependencies to reduce latency by prefetching selected resources to resolve the problems in handling dynamic web pages. We conducted the trace-based experiments on the RS approach for better classification outcomes.
On realistic terrains
Authors: Esther Moet, Marc van Kreveld, A. Frank van der Stappen
Venue: Computational Geometry: Theory and Applications (2008)

We study worst-case complexities of visibility and distance structures on terrains under realistic assumptions on edge length ratios and the angles of the triangles, and a more general low-density assumption. We show that the visibility map of a point for a realistic terrain with n triangles has complexity @Q(nn). We also prove that the shortest path between two points p and q on a realistic terrain passes through @Q(n) triangles, and that the bisector of p and q has complexity O(nn). We use these results to show that the shortest path map for any point on a realistic terrain has complexity @Q(nn), and that the Voronoi diagram for any set of m points on a realistic terrain has complexity @W(n+mn) and O((n+m)n). Our results immediately imply more efficient algorithms for computing the various structures on realistic terrains.
A New Cloud Detection Algorithm for FY-2C Images Over China
Authors: Deren Li, Xinyi Dong, Liangming Liu, Daxiang Xiang
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

FY-2C is a geo-stationary orbiting meteorological satellite designed by China independently. Based on statistical and spectral analysis of FY-2C datathis paper proposed a new cloud detection index operating accurately and quickly in spite of the low spatial resolution few spectral information. The diversity and sensitivity of cloud for each of the 4 bands of FY-2C data is also analyzed in this paper. The Infrared Red band 1, band 3 is found to be most suitable for cloud detection due to their spectral sensitivity of cloud.
An Algorithm for Distributed Beacon Selection
Authors: Dominik Lieckfeldt, Jiaxi You, Dirk Timmermann
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

This paper investigates wireless sensor networks where a small percentage of nodes are assumed to know their location a priori. These reference nodes enable absolute localization of other nodes in direct neighborhood. Having estimated their location, these nodes in turn provide their location to other nodes within transmission range. Therefore, location information spreads throughout the network. Consequently, in later state of the network, unknowns desiring to determine their location, or to improve it, will be able to choose from a large pool of nodes with known or estimated locations, which we refer to as beacons. We investigate a method to select a subset of beacons to minimize the error of localization. Regarding Cramer-Rao-Lower-Bound on localization error, the method proposed constitutes a significant improvement in comparison with the often used nearest-neighbors approach.
A metamodel for federation architectures
Authors: Okan Topçu, Mehmet Adak, Halit Oǧuztüzün
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2008)

This article proposes a metamodel for describing the architecture of a High Level Architecture (HLA) compliant federation. A salient feature of the Federation Architecture Metamodel (FAMM) is the behavioral description of federates based on live sequence charts. FAMM formalizes the standard HLA Object Model and Federate Interface Specification. FAMM supports processing through automated tools, and in particular through code generation. It is formulated in metaGME, the metamodel for the Generic Modeling Environment.
Modeling of failure probability and statistical design of spin-torque transfer magnetic random access memory (STT MRAM) array for yield enhancement
Authors: Jing Li, Charles Augustine, Sayeef Salahuddin, Kaushik Roy
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Spin-Torque Transfer Magnetic RAM (STT MRAM) is a promising candidate for future universal memory. It combines the desirable attributes of current memory technologies such as SRAM, DRAM and flash memories. It also solves the key drawbacks of conventional MRAM technology: poor scalability and high write current. In this paper, we analyzed and modeled the failure probabilities of STT MRAM cells due to parameter variations. Based on the model, we developed an efficient simulation tool to capture the coupled electro/magnetic dynamics of spintronic device, leading to effective prediction for memory yield. We also developed a statistical optimization methodology to minimize the memory failure probability. The proposed methodology can be used at an early stage of the design cycle to enhance memory yield.
Population size versus runtime of a simple evolutionary algorithm
Authors: Carsten Witt
Venue: Theoretical Computer Science (2008)

Evolutionary algorithms (EAs) find numerous applications, and practical knowledge on EAs is immense. In practice, sophisticated population-based EAs employing selection, mutation and crossover are applied. In contrast, theoretical analysis of EAs often concentrates on very simple algorithms such as the (1+1) EA, where the population size equals 1. In this paper, the question is addressed whether the use of a population by itself can be advantageous. A population-based EA that neither makes use of crossover nor any diversity-maintaining operator is investigated on an example function. It is shown that an increase of the population size by a constant factor decreases the expected runtime from exponential to polynomial. Thereby, the best gap known so far is improved from superpolynomial vs. polynomial to exponential vs. polynomial. Moreover, it is proved that the exponential and polynomial runtime bounds occur with a probability exponentially close to one if the population size is a constant (resp., a small polynomial). Finally, a second example function, where only a small population leads to a polynomial runtime, and a hierarchy result on the appropriate population size are presented. The analyses show formally how the population size can lead to different attractors in the search space.
Generating Algorithms plus Loop Invariants by Formal Derivation
Authors: Haihe Shi, Dawei Du, Jinyun Xue
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

We advocate a mechanical derivation approach for developing provably correct algorithmic programs. The paper presents our new formal methods and techniques for generating algorithms plus loop invariants. Through our methods and techniques, the ideas behind MergeSort algorithm is revealed naturally from a formal specification, and then its loop invariant and nonrecursive algorithmic solution are generated mechanically. Furthermore, instead of fresh formal derivation, the Insertion Sort is easily achieved based on the derivation of MergeSort. By means of our tools their executable language programs can be generated automatically. Therefore mathematical knowledge required by formal development process is reduced substantially and the confidence in the resultant code is increased.
ACE in the Hole: Adaptive Contour Estimation Using Collaborating Mobile Sensors
Authors: Sumana Srinivasan, Krithi Ramamritham, Purushottam Kulkarni
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

This paper focuses on the use of mobile sensors to estimate contours in a field. In particular, we focus onstrategies to estimate the contour with minimum latency and maximum precision. We propose a novel algorithm, ACE (Adaptive Contour Estimation), that (a) estimates and exploits information regarding the gradients in the field to move towards the contour and (b) uses a spread component to surround the contour in order to optimize latency. While it is possible for sensors to spread as they approach the contour, it is crucial to judiciously determine when and how much to spread. Spreading too early or too much may result in increasing the latency or affecting the precision. ACE dynamically makes this decision using local sensor measurements, history of measurements as well as collaboration between sensors while adapting to different types of deployment, distance from the contour and shapes of the contour. We demonstrate that ACE, in the absence of energy constraints precisely determines the contour with a lower latency than when only gradients are used for movement or when the sensors spread out right from the start of estimation. Additionally, we show that ACE significantly improves precision of contour estimation in the presence of energy constraints. We also demonstrate a proof of concept implementation on a mobile robot testbed.
A survey on snarks and new results: Products, reducibility and a computer search
Authors: A. Cavicchioli, M. Meschiari, B. Ruini, F. Spaggiari
Venue: Journal of Graph Theory (1998)

In this paper we survey recent results and problems of both theoretical and algorithmic character on the construction of snarksnon-trivial cubic graphs of class two, of cyclic edge-connectivity at least 4 and with girth &ge; 5. We next study the process, also considered by Cameron, Chetwynd, Watkins, Isaacs, Nedela, and &Scaron;koviera, of splitting a snark into smaller snarks which compose it. This motivates an attempt to classify snarks by recognizing irreducible and prime snarks and proving that all snarks can be constructed from them. As a consequence of these splitting operations, it follows that any snark (other than the Petersen graph) of order &le; 26 can be built as either a dot product or a square product of two smaller snarks. Using a new computer algorithm we have confirmed the computations of Brinkmann and Steffen on the classification of all snarks of order less than 30. Our results recover the well-known classification of snarks of order not exceeding 22. Finally, we prove that any snark G of order &le; 26 is almost Hamiltonian, in the sense that G has at least one vertex v for which G \ v is Hamiltonian. &copy; 1998 John Wiley Sons, Inc. J Graph Theory 28: 5786, 1998
Rough Sets and Few-Objects-Many-Attributes Problem: The Case Study of Analysis of Gene Expression Data Sets
Authors: Dominik Slezak
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

We discuss two methodologies developed within the theory of rough sets, which may be used in the analysis of data with relatively low number of objects (rows, experiments) and large number of attributes (columns, features). We illustrate their applicability by referring to the gene expression data sets, which are widely known to suffer from such a few-objects-many-attributes problem. The first methodology is based on the notion of a reduct, aiming at very clear and simple representation of (possibly inexact) functional dependencies between groups of attributes in a data table. In particular, we talk about collections of decision reducts and association reducts, useful, respectively, in the new case classification and the data-based knowledge representation tasks, where genes are interpreted as attributes and where reducts represent (inexact) functional dependencies between expressions of groups of genes. The second methodology is referred to as to rough discretization (sometimes called also dynamic discretization or roughfication, in contrast to fuzzification known from fuzzy logic.) Given a data set with numeric attributes, rough discretization produces a new data set with the same number of attributes, where, however, the number of records is squared and the values become symbolic. Basically, it uses each of original records to discretize the others by mutual comparisons between values over all numeric attributes, without any additional, externally tuned discretization parameters needed. Such roughfied data sets are a perfect source for calculations of decision and association reducts, which result in rules interpreted in terms of inequalities involving original attributes and their respective value domains. As a summary, the two presented rough-set-based methods applied together provide a simple, easily interpretable, and noninvasive framework for gene expression data analysis.
Teaching query writing: an informed instruction approach
Authors: Joseph E. Hollingsworth
Venue: ACM SIGCSE Bulletin (2008)

This paper is intended for those instructors asked to teach an undergraduate introductory class on SQL query writing, which is usually difficult for students to learn. After reading Bruer's Schools for Thought [1], we realized that we need to modify our approach so that it uses informed instruction (instead of traditional instruction) and since have noticed improvements in student performance in SQL query writing.
Subscription-aware publish/subscribe tree construction in mobile ad hoc networks
Authors: Xiang Cao, Chien-Chung Shen
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

A publish/subscribe system consists of publishers, subscribers, and a delivery infrastructure, where publishers produce events, subscribers declare their interests in receiving events via subscriptions, and the delivery infrastructure forwards subscribed events from publishers to corresponding subscribers. The paper describes a distributed, subscription-aware publish/subscribe tree (PST) construction protocol, termed DSAPST, forMANET. DSAPST specifically takes subscribers&#x2019; subscriptions into account so that subscribers sharing common subscriptions that are closer in terms of hop count would be connected together in the constructed PSTs, resulting in lower event delivery overhead in terms of the number of wireless transmissions. In addition, DSAPST adapts to mobility of nodes, allows existing nodes to join and leave as subscribers, and accommodates brand new nodes joining a MANET as subscribers. Simulation results show that DSAPST outperforms a MAODV-based PST construction protocol which is not subscription-aware.
Querying xml documents in logic programming*
Authors: J. m. Almendros-jimÉnez, A. Becerra-terÓn, F. j. Enciso-baÑos
Venue: Theory and Practice of Logic Programming (2008)

Extensible Markup Language (XML) is a simple, very flexible text format derived from SGML. Originally designed to meet the challenges of large-scale electronic publishing, XML is also playing an increasingly important role in the exchange of a wide variety of data on the Web and elsewhere. XPath language is the result of an effort to provide address parts of an XML document. In support of this primary purpose, it becomes in a query language against an XML document. In this paper we present a proposal for the implementation of the XPath language in logic programming. With this aim we will describe the representation of XML documents by means of a logic program. Rules and facts can be used for representing the document schema and the XML document itself. In particular, we will present how to index XML documents in logic programs: rules are supposed to be stored in main memory, however facts are stored in secondary memory by using two kind of indexes: one for each XML tag, and other for each group of terminal items. In addition, we will study how to query by means of the XPath language against a logic program representing an XML document. It evolves the specialization of the logic program with regard to the XPath expression. Finally, we will also explain how to combine the indexing and the top-down evaluation of the logic program.