ppxscal/embedding_network huggingface dataset:
Imperfect partnership: effects of collaboratories on scientists from developing countries
Authors: Judith S. Olson
Venue:  (2008)

Academic research and various reports from research institutions and governmental agencies have consistently indicated a gap in the scientific output of developing and developed countries. Researchers and policy makers are trying hard to reduce the disparity. In recent years, researchers have hypothesized that a new form of scientific collaboration&ndash;the "collaboratory"&ndash;holds promises to greatly benefit scientists from developing countries. It is argued that distributed collaborations enabled by various information technologies can allow scientists from developing countries to reach remotely located experts, instruments, and databases that their local institutions cannot afford. However, there have been no empirical studies to prove or disprove this. Prior studies of the impact of information technology on scientific work tend to focus on the correlation between technology use and scientific productivity as measured by publications and citations. This approach ignores the mediating factors affecting the relationship between information technology use and scientific productivity. As a result, we are not clear about the dynamics through which information technology exerts its influence. Neither do we understand how information technology enhances productivity, if it indeed does so. Thus, the current study focuses on some mediating factors that purportedly lead to productivity, such as scientists' access to resources and participation in communities of practice. Adopting a qualitative approach (interviews complemented by field observation), I explore how scientists from developing countries benefit from reaching remotely located resources and participating in communities of practice in the virtual organization of a collaboratory. I also demonstrate how the relation of resource dependency, the nature of collaborative work, geographical distance and cultural differences influence scientists' participation in collaborataries. These factors affect the ability of scientists from developing countries to access resources of collaboratories, build relationships with other collaboratory members and learn knowledge and practice from their collaborators in the developed world. In addition, I show that collaboratories facilitate technology transfer from scientists from developed countries to those from developing countries. However, scientists from developing countries demonstrate an urgent need to build general competence in performing research. This kind of competence can only be achieved through long-term exposure to the practices of advanced laboratories from the developed world. Collaboratories failed to meet the need because of their project-oriented nature and their funding mechanism.
Supporting Interaction Preferences and Recognition of Misconceptions with Independent Open Learner Models
Authors: Susan Bull, Andrew Mabbott, Peter Gardner, Tim Jackson, Michael J. Lancaster, Steven Quigley, P. A. Childs
Venue: Proceedings of the 5th international conference on Adaptive Hypermedia and Adaptive Web-Based Systems (2008)

Misconceptions have been identified in many subjects. However, there has been less investigation into students' interest in their misconceptions. This paper presents two independent open learner models used alongside seven university courses to highlight the state of their knowledge to the learner as a starting point for their independent study. Many students used the environments; many had misconceptions identified at some point during their learning; and most of those with misconceptions viewed the statements of their misconceptions. Students were able to use the independent open learner models in a variety of ways to suit their interaction preferences, at different levels of study.
Program optimization carving for GPU computing
Authors: Shane Ryoo, Christopher I. Rodrigues, Sam S. Stone, John A. Stratton, Sain-Zee Ueng, Sara S. Baghsorkhi, Wen-mei W. Hwu
Venue: Journal of Parallel and Distributed Computing (2008)

Contemporary many-core processors such as the GeForce 8800 GTX enable application developers to utilize various levels of parallelism to enhance the performance of their applications. However, iterative optimization for such a system may lead to a local performance maximum, due to the complexity of the system. We propose program optimization carving, a technique that begins with a complete optimization space and prunes it down to a set of configurations that is likely to contain the global maximum. The remaining configurations can then be evaluated to determine the one with the best performance. The technique can reduce the number of configurations to be evaluated by as much as 98% and is successful at finding a near-best configuration. For some applications, we show that this approach is significantly superior to random sampling of the search space.
WS-BioZard: A Wizard for Composing Bioinformatics Web Services
Authors: Zhiming Wang, John A. Miller, Jessica C. Kissinger, Rui Wang, Douglas Brewer, Cristina Aurrecoechea
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

As the amount of biological data continues to increase, how biologists share data and analysis tools efficiently is becoming an important issue. Web service technology is a promising solution because of the advanced features it provides such as language independence, platform independence and ease of programmatic access. Recently, we have seen an increasing amount of interest in the composition of biological Web services in order to process a biological task. Although there are some research efforts towards composing biological Web services, such as BioMoby and Taverna, these existing tools are still too difficult to be widely used by the average biologist. Therefore, lowering the learning curve for Web service composition to make it easier for biologists is becoming a critical need. In this paper, we describe WS-BioZard, a comprehensive framework for addressing this need by using wizards and semantics to provide a suite of tools that support practical semi-automatic composition of Web services in the biological domain.
The Development of Computer Programming in Britain (1945 to 1955)
Authors: Martin Campbell-Kelly
Venue: IEEE Annals of the History of Computing (1982)

By 1950 there were three influential centers of programming in Britain where working computers had been constructed: Cambridge University (the EDSAC), Manchester University (the Mark I), and the National Physical Laboratory (the Pilot ACE). At each of these centers a distinctive style of programming evolved, largely independently of the others. This paper describes how the three schools of programming influenced programming for the other stored-program computers constructed in Britain up to the year 1955. These machines included several prototype and research computers, as well as five commercially manufactured machines. The paper concludes with a comparative assessment of the three schools of programming.
A Coprocessor for the Final Exponentiation of the ηT Pairing in Characteristic Three
Authors: Jean-Luc Beuchat, Nicolas Brisebarre, Masaaki Shirase, Tsuyoshi Takagi, Eiji Okamoto
Venue: Proceedings of the 1st international workshop on Arithmetic of Finite Fields (2007)

Since the introduction of pairings over (hyper)elliptic curves in constructive cryptographic applications, an ever increasing number of protocols based on pairings have appeared in the literature. Software implementations being rather slow, the study of hardware architectures became an active research area. Beuchat et al. proposed for instance a coprocessor which computes the characteristic three ¿ T pairing, from which the Tate pairing can easily be derived, in 33 μs on a Cyclone II FPGA. However, a final exponentiation is required to ensure a unique output value and the authors proposed to supplement their ¿ T pairing accelerator with a coprocessor for exponentiation. Thus, the challenge consists in designing the smallest possible piece of hardware able to perform this task in less than 33 μs on a Cyclone II device. In this paper, we propose a novel arithmetic operator implementing addition, cubing, and multiplication over $\mathbb{F}_{3^{97}}$ and show that a coprocessor based on a single such operator meets this timing constraint.
Optimal Tree Structures for Group Key Tree Management Considering Insertion and Deletion Cost
Authors: Weiwei Wu, Minming Li, Enhong Chen
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

We study the optimal structure for group broadcast problem where the key tree model is extensively used. The objective is usually to find an optimal key tree to minimize the cost based on certain assumptions. Under the assumption that n members arrive in the initial setup period and only member deletions are allowed after that period, previous works show that when only considering the deletion cost, the optimal tree can be computed in O(n 2) time. In this paper, we first prove a semi-balance property for the optimal tree and use it to improve the running time from O(n 2) to O(loglogn). Then we study the optimal tree structure when insertion cost is also considered. We show that the optimal tree is such a tree where any internal node has at most degree 7 and children of nodes with degree not equal to 2 or 3 are all leaves. Based on this result we give a dynamic programming algorithm with O(n 2) time to compute the optimal tree.
On the Assessment of Petroleum Corporation's Sustainability Based on Linguistic Fuzzy Method
Authors: Li-Fan Zhang
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

By use of the relationship between uncertain fuzzy number and linguistic number, a linguistic fuzzy method to assess the sustainability of Petroleum Corporation as one kind of hybrid multi-attribute decision making problems is put forward. Simultaneously, the attribute weight of decision making problem is derived from the maximum entropy model. The OWA operator is used to aggregate the attribute information. Finally, it is illustrated by a numerical example that this method is feasible and effective.
Explaining Recommendations
Authors: Nava Tintarev
Venue: Proceedings of the 11th international conference on User Modeling (2007)

This thesis investigates the properties of a good explanation in a movie recommender system. Beginning with a summarized literature review, we suggest seven criteria for evaluation of explanations in recommender systems. This is followed by an attempt to define the properties of a useful explanation, using a movie review corpus and focus groups. We conclude with planned experiments and evaluation.
Similarity-Based Exploded Views
Authors: Marc Ruiz, Ivan Viola, Imma Boada, Stefan Bruckner, Miquel Feixas, Mateu Sbert
Venue: Proceedings of the 9th international symposium on Smart Graphics (2008)

Exploded views are often used in illustration to overcome the problem of occlusion when depicting complex structures. In this paper, we propose a volume visualization technique inspired by exploded views that partitions the volume into a number of parallel slabs and shows them apart from each other. The thickness of slabs is driven by the similarity between partitions. We use an information-theoretic technique for the generation of exploded views. First, the algorithm identifies the viewpoint which gives the most structured view of the data. Then, the partition of the volume into the most informative slabs for exploding is obtained using two complementary similarity-based strategies. The number of slabs and the similarity parameter are freely adjustable by the user.
Note: Random-order bin packing
Authors: Edward G. Coffman,  Jr., János Csirik, Lajos Rónyai, Ambrus Zsbán
Venue: Discrete Applied Mathematics (2008)

The average-case analysis of algorithms usually assumes independent, identical distributions for the inputs. In [C. Kenyon, Best-fit bin-packing with random order, in: Proc. of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 1996, pp. 359-364] Kenyon introduced the random-order ratio, a new average-case performance metric for bin packing heuristics, and gave upper and lower bounds for it for the Best Fit heuristics. We introduce an alternative definition of the random-order ratio and show that the two definitions give the same result for Next Fit. We also show that the random-order ratio of Next Fit equals to its asymptotic worst-case, i.e., it is 2.
The Behavioural Rules in Multi Agent Systems: A "Not a Toy" Approach
Authors: Massimiliano Petri, Alessandra Lapucci, Diana Poletti
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

The current research deals with the development of an Activity Based Multi Agent System able to analyse and simulate the complex dynamics of sustainable mobility as derived from millions of choices performed by the individuals belonged to the system itself. With the objective to perform a dynamic decision support system for the phenomena comprehension at urban scale, the population sample questionnaire structuring, the "temporal" geodatabase construction and the agents behaviural rules extraction, via two different artificial intelligence techniques, represent the most relevant innovations experimented till now.
The Growing Role of IT in Transportation
Authors: Wesley Chou
Venue: IT Professional (2003)

The automobile and railway industries have grown more reliant on IT, but future intelligent transportation systems must also address potential security breaches.
Enumerating Isolated Cliques in Synthetic and Financial Networks
Authors: Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier
Venue: Proceedings of the 2nd international conference on Combinatorial Optimization and Applications (2008)

We do computational studies concerning the enumeration of maximal isolated cliques in graphs. Isolation, as recently introduced, measures the degree of connectedness of the cliques to the rest of the graph. Isolation helps both in getting faster algorithms than for the enumeration of maximal general cliques and in filtering out cliques with special semantics. We perform experiments with synthetic graphs (in the G n,m,p model) and financial networks, proposing the enumeration of isolated cliques as a useful instrument in analyzing financial networks.
Regulative Effect of Water Molecules on the Switches of Guanine-Cytosine (GC) Watson-Crick Pair
Authors: Hongqi Ai, Xian Peng, Yun Li, Chong Zhang
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

To regulate the switch effect induced by NH¿ anion substitution at the H8 site of the guanine-cytosine (GC) watson-crick pair and investigate the actual state in the solution, 1-9 water molecules attached GNH ¿C derivatives are probed in the present paper. Results show that the switch effect, i.e., deformation effect of hydrogen bonding between GNH ¿ and C pair reduces step-wise as the number of discrete water molecules around the NH¿ group increases. Thus one can control the switch action of GNH ¿C by regulating the number of water molecules around the NH¿ group.
Xen Virtualization and Multi-host Management Using MLN
Authors: Kyrre Begnum
Venue: Proceedings of the 1st international conference on Autonomous Infrastructure, Management and Security: Inter-Domain Management (2007)

Xen virtualization is a powerful tool for encapsulating services and providing seamless migration of tasks on hardware failure. This tutorial shows how to set up multiple Xen instances in a network using the MLN management tool.One of the main challenges in virtual machine administration on a large scale is the specification of complex and repeatable virtualized scenarios. Creating a singe new virtual machine, boot it and install an operating system is straight forward with many of todays tools. But what if you need to deploy 50 identical virtual machines across 25 servers and manage them as an atomic unit? How do you at a later point make consistent design adjustments such as migrating a subset of the virtual machines to a new server or adjusting memory levels? These issues are at the heart of this tutorial.MLN is a virtual machine management tool supporting both User-Mode Linux and Xen. It has been developed at the Oslo University College in conjunction with its research on system administration and resource management. MLN and its research has previously been presented at the Norwegian Unix User Group (NUUG) and the 20th USENIX Large Installation System Administration conference LISA. This tutorial is interesting for all who want to look beyond the typical one-vm-on-my-desktop scenario. Teachers interested in virtual student labs should also attend.We start with a short introduction to the Xen virtual machine technology and then proceed to MLN and its own configuration language. In the second part of the tutorial, we will talk about installation and configuration of MLN into a virtual infrastructure across several servers.
Creating Profit with Computers: My Life as CEO of Bonner & Moore Associates
Authors: Joe F. Moore
Venue: IEEE Annals of the History of Computing (2003)

When Bonner & Moore was formed in 1956, few-if any-other firms were offering computer consulting services to private industry. Over the years, Bonner & Moore's software development and computer modeling projects took the company far and wide, from Texas oil refineries to the other side of the globe. Its computer services created a solid financial success. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Teachning network storage technology: assessment outcomes and directions
Authors: Vladan Jovanovic, Timur Mirzoev
Venue: Proceedings of the 9th ACM SIGITE conference on Information technology education (2008)

The paper presents content, delivery and assessment mechanisms used for an undergraduate course on Networked Storage Technology. We based the course on the EMC's vendor-neutral Storage Technology Fundamentals course and provided additional content fitting our respective degree programs. This paper provides a detail review of how the course fits into our curricula, what important enhancements are included in the content, and in particular, how it helps achieve the 2008 ABET assessment requirements.
Cerebellar transcranial direct current stimulation impairs the practice-dependent proficiency increase in working memory
Authors: R. Ferrucci, S. Marceglia, M. Vergari, F. Cogiamanian, S. Mrakic-Sposta, F. Mameli, S. Zago, S. Barbieri, A. Priori
Venue: Journal of Cognitive Neuroscience (2008)

How the cerebellum is involved in the practice and proficiency of non-motor functions is still unclear. We tested whether transcranial direct current stimulation (tDCS) over the cerebellum (cerebellar tDCS) induces after-effects on the practice-dependent increase in the proficiency of a working memory (WM) task (Sternberg test) in 13 healthy subjects. We also assessed the effects of cerebellar tDCS on visual evoked potentials (VEPs) in four subjects and compared the effects of cerebellar tDCS on the Sternberg test with those elicited by tDCS delivered over the prefrontal cortex in five subjects. Our experiments showed that anodal or cathodal tDCS over the cerebellum impaired the practice-dependent improvement in the reaction times in a WM task. Because tDCS delivered over the prefrontal cortex induced an immediate change in the WM task but left the practice-dependent proficiency unchanged, the effects of cerebellar tDCS are structure-specific. Cerebellar tDCS left VEPs unaffected, its effect on the Sternberg task therefore seems unlikely to arise from visual system involvement. In conclusion, tDCS over the cerebellum specifically impairs the practice-dependent proficiency increase in verbal WM.
Estimating statistical aggregates on probabilistic data streams
Authors: T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee
Venue: ACM Transactions on Database Systems (TODS) (2008)

The probabilistic stream model was introduced by Jayram et al. [2007]. It is a generalization of the data stream model that is suited to handling probabilistic data, where each item of the stream represents a probability distribution over a set of possible events. Therefore, a probabilistic stream determines a distribution over a potentially exponential number of classical deterministic streams, where each item is deterministically one of the domain values. We present algorithms for computing commonly used aggregates on a probabilistic stream. We present the first one pass streaming algorithms for estimating the expected mean of a probabilistic stream. Next, we consider the problem of estimating frequency moments for probabilistic data. We propose a general approach to obtain unbiased estimators working over probabilistic data by utilizing unbiased estimators designed for standard streams. Applying this approach, we extend a classical data stream algorithm to obtain a one-pass algorithm for estimating F2, the second frequency moment. We present the first known streaming algorithms for estimating F0, the number of distinct items on probabilistic streams. Our work also gives an efficient one-pass algorithm for estimating the median, and a two-pass algorithm for estimating the range.
Negotiating task interruptions with virtual agents for health behavior change
Authors: Timothy Bickmore, Daniel Mauer, Francisco Crespo, Thomas Brown
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

Virtual health counseling agents on mobile devices need to be able to interrupt their users when it is time for them to engage in healthy behaviors, such as scheduled medication taking or exercise. However, these real-time reminders often represent task interruptions for individuals who are engaged in work activities. This paper presents the results of a study which compares four strategies used by a virtual agent on a PDA for interrupting users at work to perform a healthy behavior. We find that, among several interruption coordination strategies previously explored in the HCI literature, empathic interruptions are superior overall in gaining both short-term compliance and self-reported desire to continue working with the agent.
An approach to optimizing software development team size
Authors: Marjan Heričko, Aleš Živkovič, Ivan Rozman
Venue: Information Processing Letters (2008)

This paper explores the relationship between software size, development effort and team size. We propose an approach aimed at finding the team size where the project effort has its minimum. The approach was applied to the ISBSG repository containing nearly 4000 software projects. Based on the results we provide our recommendation for the optimal or near-optimal team size in seven project groups defined by four project properties.
From Data and Signals Cellular Automata to Self-organizing Circuits
Authors: André Stauffer, Joël Rossier
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

Self-organizing circuits are able to grow, to self-replicate, and to self-repair. These properties are implemented in hardware thanks to configuration, cloning and cicatrization mechanisms. They are realized by the configuration layer of the POEtic tissue, a data and signals cellular automata based circuit. Specified as a data-flow processor, the application and routing layers of the circuit compose a timer as an application example.