ppxscal/embedding_network huggingface dataset:
A Demonstration of the SciFlo Grid Workflow Engine
Authors: Brian Wilson, Gerald Manipon, Dominic Mazzoni, Benyang Tang, Tom Yunck
Venue: Proceedings of the 18th International Conference on Scientific and Statistical Database Management (2006)

SciFlo is a system for Scientific Knowledge Creation on the Grid using a Semantically-Enabled Dataflow Execution Environment. SciFlo leverages Simple Object Access Protocol (SOAP) Web Services and the Grid Computing standards (WS-* & Globus Alliance toolkits), and enables scientists to do multi-instrument Earth Science by assembling reusable Web Services and native executables into a distributed computing flow (operator graph). SciFlo's XML dataflow documents can be a mixture of concrete operators (fully bound operations) and abstract template operators (late binding via semantic lookup). All data objects and operators can be both simply typed (simple and complex types in XML schema) and semantically typed (linked to OWL ontologies). We will demonstrate a version of the SciFlo workflow engine executing a variety of workflow documents. [Note: This document is a quick description of the proposed demo, not a fully referenced and defended paper.]
Design and Implementation of Switches in Network Simulator (ns2)
Authors: Hongyun Zheng, Yongxiang Zhao, Changjia Chen
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

Switches are necessary components of routers. They have attracted many attentions with rising demand of high-speed communication. Simulation plays more and more important role in studying switches. ns is a popular network simulator, however no support for switch. In this paper, we present the details of design and implementation of switch in ns. The switch is designed as an extension to ns module library. Our goal is to implement the common structure and functionality of switch, such as input and output ports, crossbar-based switch fabric, and arbitrating algorithm with simplicity and extensibility. By deriving from a basic class which is supported in ns, and modifying the process procedure of packets, switch is implemented as a standard module in ns library. The details of the developed switch and representative performance analysis which illustrates how to use the switch and its validation are presented as well.
Detecting Redundant Unit Tests for AspectJ Programs
Authors: Tao Xie, Jianjun Zhao, Darko Marinov, David Notkin
Venue: Proceedings of the 17th International Symposium on Software Reliability Engineering (2006)

Aspect-oriented software development is gaining popularity with the adoption of languages such as AspectJ. Testing is an important part in any software development, including aspect-oriented development. To automate generation of unit tests for AspectJ programs, we can apply the existing tools that automate generation of unit tests for Java programs. However, these tools can generate a large number of test inputs, and manually inspecting the behavior of the software on all these inputs is time consuming. We propose Raspect, a framework for detecting redundant unit tests for AspectJ programs. We introduce three levels of units in AspectJ programs: advised methods, advice, and intertype methods. We show how to detect at each level redundant tests that do not exercise new behavior. Our approach selects only non-redundant tests from the automatically generated test suites, thus allowing the developer to spend less time in inspecting this reduced set of tests. We have implemented Raspect and applied it on 12 subjects taken from a variety of sources; our experience shows that Raspect can effectively reduce the size of generated test suites for inspecting AspectJ programs.
Controllability Analysis Based on Bond Graph
Authors: Xiyun Yang, Xiaojuan Han, Yibing Liu, Daping Xu
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

Controllability of system is basic conception for analyzing and designing system with modern control theoly. Bond graph contains system structure properties and can determine state variables. A simple method of determining controllability with bond graph is introduced in the paper. Only by assigning causality form for all storages elements of system in bond graph, which comply with firstly assigning integral causality and then assigning derivative causality, the controllability condition can be determined. Comparing with conventional numerical matrix method, this method does not depend on parameters of state matrices A and B and overcome miscellaneous computation for obtaining controllability matrix .two examples analyzing with controllability and uncontrollability process verify the effectivenms of the method.
The Materiality of the Internet
Authors: Paul E. Ceruzzi
Venue: IEEE Annals of the History of Computing (2006)

The Internet is a technological construction with a magnitude and scope comparable to thehydroelectric dams, railroads, aircraft, and electric power systems of an earlier era. Yet, it has noobvious physical manifestation--no physical object we can point to that obviously and unambiguouslyrepresents it. This article suggests some of the reasons why that is and whether a physical essenceis important in defining large-scale technological systems.
Distinct Brain Systems for Processing Concrete and Abstract Concepts
Authors: J. R. Binder, C. F. Westbury, K. A. McKiernan, E. T. Possing, D. A. Medler
Venue: Journal of Cognitive Neuroscience (2005)

Behavioral and neurophysiological effects of word imageability and concreteness remain a topic of central interest in cognitive neuroscience and could provide essential clues for understanding how the brain processes conceptual knowledge. We examined these effects using event-related functional magnetic resonance imaging while participants identified concrete and abstract words. Relative to nonwords, concrete and abstract words both activated a left-lateralized network of multimodal association areas previously linked with verbal semantic processing. Areas in the left lateral temporal lobe were equally activated by both word types, whereas bilateral regions including the angular gyrus and the dorsal prefrontal cortex were more strongly engaged by concrete words. Relative to concrete words, abstract words activated left inferior frontal regions previously linked with phonological and verbal working memory processes. The results show overlapping but partly distinct neural systems for processing concrete and abstract concepts, with greater involvement of bilateral association areas during concrete word processing, and processing of abstract concepts almost exclusively by the left hemisphere.
Demand-driven server and service location in third generation mobile networks: Research Articles
Authors: Geraldo Robson Mateus, Olga Goussevskaia, Antonio A. F. Loureiro
Venue: Wireless Communications Mobile Computing (2007)

In this paper, we formulate and solve the problem of how to dynamically distribute network resources in third-generation mobile telecommunication systems, aiming to minimize the equipment maintenance and service provision costs. A mobility simulator was implemented in order to represent a hypothetical city, which was populated with different groups of users, whose mobility behavior and demand for different kinds of services was generated in order to simulate a typical 24-h day behavior. Given the generated demand at a certain period of time, a server allocation is made in order to attend it. This is done by modeling the system as an integer-programming problem and by, afterwards, running an optimization algorithm on it. The output from the optimization process was used to reconfigure the system by activating the selected servers and deactivating the others. The problem turned out to be NP-hard, so a heuristic method was necessary in order to solve it. We chose the Lagrangean relaxation technique to do the task, and obtained good results in terms of the solution proximity to the optimum. The performed experiments demonstrated the model's sensitivity to different kinds of parameters, such as user mobility, demand distribution over time and space, time of day, type of area where events occur, and the relation between fixed and variable costs of the system. A significant system cost reduction was also achieved. The proposed approach allows a personalized and demand driven resource distribution. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Investigating the dynamics of competition: coevolving red and blue simulation parameters
Authors: Mary L. McDonald, Stephen C. Upton
Venue: Proceedings of the 37th conference on Winter simulation (2005)

In this paper we explore the concept of two-sided competitive coevolution as a mechanism to explore the dynamics of competition in a simulation context. One potential value of doing so is the ability to rapidly explore simultaneous adaptations to two sides, presumably Blue and Red, in order to find solutions that perform well and are relatively robust even in the face of an adaptive adversary.
A state propagation method for consistency checking of web service function invocations in web applications
Authors: Tomohiro Kaizu, Tomoya Noro, Takehiro Tokuda
Venue: Workshop proceedings of the sixth international conference on Web engineering (2006)

When we realize Web applications using already existing Web service functions, we often have a situation in which preconditions of Web service function invocations may not be satisfied or necessary data may not be yet provided to produce output Web pages. Traditional approaches to consistency checking of Web service function invocations are use of linear temporal logic formulae and finite-state model based checking. These approaches may not be for every programmers. In this paper we propose an easy-to-use method for consistency checking of Web service function invocations. Our approach uses preconditions and postconditions of Web service function invocations and computation of weakest execution states.
Baby boomers as adult learners of computer applications in higher education: a case study
Authors: James A. Gregson
Venue:  (2006)

Baby Boomers are attending college in record numbers and for a variety of reasons. There are currently 76 million Boomers in the United States and in 2006, Baby Boomers range from 42 to 60 years old. Boomer students are faced with a campus environment that embraces computer technology both inside and outside the classroom and using this technology is fundamental to being a college student in the 21st century. Computer literacy is important for an optimum college experience but it also has both economic and social ramifications. The purpose of this study is to describe and analyze the computer experiences of higher education Baby Boomer students. A constructivist paradigm and a qualitative case study methodology were used. The population was Baby Boomer students in higher education. Data were generated from an online survey and 24 in-depth interviews. The study includes the dimensions of adult learning, the values of progressive and humanistic adult education philosophy, and andragogy and generational learning theory along with 14 roadblocks to computer literacy. The interview data include descriptions of first computer experiences, experiences using computers as higher education students, and computer learning experiences, preferences, and resources. The study shows the prevalence of computer use by the Baby Boomer higher education students across the curriculum. The majority of the Boomers rated themselves as competent computer users while others rated themselves as incompetent. The data indicate there is a need for computer learning assistance for Boomers in higher education and that, often times, computer knowledge is taken for granted by university professors. Among other things, the study indicates the importance of relevancy, immediacy, co-learning, and hands-on computer learning. The study also points out the numerous computer learning resources used by the Baby Boomers. The rising number of on-line course offerings further increases the importance of computer literacy in higher education. This study has implications about how higher education institutions and computer application instructors might best facilitate computer applications learning for Baby Boomers in order to attract, retain, and assist them. Recommendations for the institution, the computer applications educator, and further research are included.
A comparison of students' conceptions about the nature of argumentation in school and professional science
Authors: Kelli A. Millwood
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

This paper explores the relationship between students' conceptions about warranting claims in science class and their beliefs about how professional scientists warrant claims. An interview was used to measure beliefs about school science, and a questionnaire was used to measure beliefs about professional science. The difference of these expressed ideas in the two contexts have implications for understanding students' personal epistemologies of science as well as the coherence of students' epistemological beliefs.
Assessing simulation learning in higher education
Authors: Brian Hollocks
Venue: Proceedings of the 37th conference on Winter simulation (2005)

System simulation may be used as a valuable exemplar of modeling in degree programs across a range of disciplines. This paper describes and discusses an approach to assessing learning in that domain, relating it to Bloom's and Biggs' taxonomies. It uses a mini-project, scenario concept, evaluated through oral examination. The scenario text and grading plan are included in the paper. The approach is found to usefully differentiate across the full range of student performance.
Analysis of production control methods for semiconductor research and development fabs using simulation
Authors: Vikram Ramamurthi, Michael E. Kuhl, Karl D. Hirschman
Venue: Proceedings of the 37th conference on Winter simulation (2005)

A semiconductor company must bring technology to the market as soon as its application is deemed feasible to be a leader in the industry. The goal of this paper is to investigate production control methods in semiconductor R&D fabs to minimize the time to market for the aforementioned technology. Simulation models of a representative R&D fab are run with different levels of bottleneck utilization, lot priorities, primary and secondary dispatching strategies and due date tightness as treatment combinations in a formally designed experiment. The fab performance measures are percent on time delivery, average cycle time, standard deviation of cycle time and average work-in-process. Fab characteristics are found to influence the application of dispatching rules. However, several dispatching rules are found to be robust across performance measures.
Shamon: A System for Distributed Mandatory Access Control
Authors: Jonathan M. McCune, Trent Jaeger, Stefan Berger, Ramon Caceres, Reiner Sailer
Venue: Proceedings of the 22nd Annual Computer Security Applications Conference (2006)

We define and demonstrate an approach to securing dis- tributed computation based on a shared reference monitor (Shamon) that enforces mandatory access control (MAC) policies across a distributed set of machines. The Shamon enables local reference monitor guarantees to be attained for a set of reference monitors on these machines. We im- plement a prototype system on the Xen hypervisor with a trusted MAC virtual machine built on Linux 2.6 whose reference monitor design requires only 13 authorization checks, only 5 of which apply to normal processing (others are for policy setup). We show that, through our architec- ture, distributed computations can be protected and con- trolled coherently across all the machines involved in the computation.
On the structure of the counting function of sparse context-free languages
Authors: Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio
Venue: Theoretical Computer Science (2006)

We give an exact description of the counting function of a sparse context-free language. Let L be a sparse context-free language and let fL be its counting function. Then there exist polynomials P0, P1,...,Pk - 1, with rational coefficients, and an integer constant k0, such that for any n ≥ k0 one has fL (n) = pj (n) where j is such that j ≡ n mod k. As a consequence one can easily show the decidability of some questions concerning sparse context-free languages. Finally, we show that for any sparse context-free language L there exists a regular language L' such that for any n ≥ 0 one has fL (n) = fL' (n) and, therefore, fL is rational.
Using transformative research to explore congruencies between science reform and urban schools
Authors: Ann E. Rivet
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

The Urban Science Education Center at Teachers College, Columbia University is attempting to inform how science reforms are introduced to urban middle school classrooms. In our work we are exploring three levels of congruency necessary in order for new innovations to result in sustained reform in individual school settings. To explore these congruencies we use the framework of transformative research, which is research that while focused on generating new ideas also works to "transform" or improve the teaching and learning of science. This paper describes our collaboration with one public middle school in New York City, using the concepts of congruencies to frame our efforts with the school as we collaboratively developed a project-based school-wide science curriculum plan. Through this process we learned both about ways to consider innovative reforms in relation to this school setting, and more general characteristics of conducting transformative research with urban schools.
Negotiation-based coalitions in the physical world
Authors: Majid Ali Khan, Ladislau Bölöni
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

We present a negotiation based coalition formation scheme for autonomous agents residing in the physical world. While in the virtual world we can abstract the negotiation into a calculation of rewards and ignore the details of the physical substrate of the negotiation, in the physical world we need to concern ourselves with variables such as the geographical location of the agent, range of the communication devices, path planning, obstacles and hazards, the necessity of co-location and the temporal constraints assocatiated with it. We concentrate on agents with coordinated location and speed (convoys) which can improve their performance by being able to traverse previously inaccessible areas. We assume a model where agents can dynamically join and leave the coalition.
Applying Weights in the Functioning of the Dynamic Classifier Selection Method
Authors: Diogo Fagundes, Anne Canuto
Venue: Proceedings of the Ninth Brazilian Symposium on Neural Networks (2006)

There are two main approaches to combine the output of classifiers within a multi-classifier system, which are: combination-based and selection-based methods. In selectionbased methods, only one classifier is needed to correctly classify the input pattern. The choice of a classifier is typically based on the certainty of the current decision. On the other hand, the use of weights can be very useful for the final decision of a multi-classifier system since it can provide a confidence degree for each classifier. This paper presents an investigation of using two confidence measures (weights) in the functioning of the dynamic classifier method, which is a selection-based method. The main aim of this paper is to analyze the benefits of using weights in a selection-based method and which one is more suitable to be used.
Efficient discovery of XML data redundancies
Authors: Cong Yu, H. V. Jagadish
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

As XML becomes widely used, dealing with redundancies in XML data has become an increasingly important issue. Redundantly stored information can lead not just to a higher data storage cost, but also to increased costs for data transfer and data manipulation. Furthermore, such data redundancies can lead to potential update anomalies, rendering the database inconsistent.One way to avoid data redundancies is to employ good schema design based on known functional dependencies. In fact, several recent studies have focused on defining the notion of XML Functional Dependencies (XML FDs) to capture XML data redundancies. We observe further that XML databases are often "casually designed" and XML FDs may not be determined in advance. Under such circumstances, discovering XML data redundancies (in terms of FDs) from the data itself becomes necessary and is an integral part of the schema refinement process.In this paper, we present the design and implementation of the first system, DiscoverXFD, for effcient discovery of XML data redundancies. It employs a novel XML data structure and introduces a new class of partition based algorithms. DiscoverXFD can not only be used for the previous definitions of XML functional dependencies, but also for a more comprehensive notion we develop in this paper, capable of detecting redundancies involving set elements while maintaining clear semantics. Experimental evaluations using real life and benchmark datasets demonstrate that our system is practical and scales well with increasing data size.
Deficits in Complex Visual Perception Following Unilateral Temporal Lobectomy
Authors: Krystel R. Huxlin, William H. Merigan
Venue: Journal of Cognitive Neuroscience (1998)

Although human temporal cortex is known to be important for short- and long-term memory, its role in visual perception is not well understood. In this study, we compared the performance of three patients with unilateral temporal lobectomies to that of normal controls on both "simple" and "complex" visual discriminations that did not involve explicit memory components. Two types of complex tasks were tested that involved discriminations secondary to texture segmentation. These were contrasted with simple discriminations using luminance-defined stimuli. Patients showed impaired thresholds only on tasks involving texture segmentation, performing as well as controls when the targets were defined by luminance rather than texture. The minimum stimulus presentation times for threshold performance were also measured for all tasks and found to be elevated in temporal lobectomy patients relative to controls. Although the magnitude of the deficits observed was substantial, loss was equivalent in ipsi- and contra-lesional regions of the visual field. Additional control experiments showed that the patients' perceptual deficits were not due, even in part, to disturbances of basic visual capacities such as acuity and contrast sensitivity. Our results indicate that temporal lobe damage disrupts complex, but not simple, visual discriminations throughout the visual field.