ppxscal/embedding_network huggingface dataset:
Triggering Creativity in Science and Engineering: Reflection as a Catalyst
Authors: Sumit Ghosh
Venue: Journal of Intelligent and Robotic Systems (2003)

In the recent literature, creativity has been clarified as a phenomenon that categorically differs from intelligence in that the ideas that result from it may not be deduced by applying current reasoning techniques on the state-of-the-art knowledge. Thus, creativity clearly transcends intelligence. Despite this new perspective, by its very nature, creativity defies a true and complete definition and the issue of how to arrive at a creative solution for a given problem, continues to remain an open question. This paper represents an effort to gain insights into the nature of creativity. It begins by observing (i) documented manifestations of creative discoveries and inventions by leading scientists and inventors, (ii) records of creative flashes in many day-to-day ordinary activities, and (iii) instances of creativity in Nature. It then critically analyzes these observations to uncover what mechanisms trigger the processes that eventually lead to creative solutions to problems. This paper submits three hypotheses for cases (i) through (iii) and claims that reflection constitutes the underlying mechanism in each of them, serving as a catalyst for creativity. The first hypothesis is that, in many of the highly creative scientific and engineering discoveries, reflection has played an explicit role in catalyzing the onset of creativity in the scientists and inventors, leading to spontaneous solutions. The second hypothesis is that creativity may be triggered by resorting to implicit reflection. The underlying mechanism consists of highly experienced professionals who report arriving at decisions and diagnoses, almost instantaneously, through intuitive flashes that later turn out to be precisely correct. The third postulate is that Nature is guided by reflection, while utilizing enormous resources and knowledge at her disposal, to play her meta-level role in introducing creative traits, selectively, in one or more individuals of a specific animal colony. The resulting collective behavior of the entire colony represents a spontaneous, creative behavior, very different from that of a pure, homogeneous colony. In essence, the contributions of this paper are two-fold. First, although the exact definition of creativity continues to elude us, the use of explicit and implicit reflection constitutes two approaches that are potentially useful in triggering creativity, at will, in ordinary scientific and engineering personnel to achieve quantum leaps in our knowledge and achievement. The role of reflection is that of a catalyst. Reflection also appears to underlie the inner workings of Nature. Second, from the perspective of engineering pedagogy, these approaches may constitute a tried and tested mechanism for inducing creativity in ordinary students through practice.
Embodiments, avatars, clones and agents for multi-user, multi-sensory virtual worlds
Authors: Steve Benford, John Bowers, Lennart E. Fahlén, Chris Greenhalgh, Dave Snowdon
Venue: Multimedia Systems (1997)

This paper explores the issue of user embodiment within collaborative virtual environments. By user embodiment we mean the provision of users with appropriate body images so as to represent them to others and also to themselves. By collaborative virtual environments we mean multi-user virtual reality systems which explicitly support cooperative work (although we argue that the results of our exploration may also be applied to other kinds of collaborative system). The main part of the paper identifies a list of embodiment design issues grouped by the general themes of personal representation, conveying activity, embodiment in heterogeneous systems, embodiment of agents, and ethical issues. These issues are illustrated with examples from our own DIVE and MASSIVE collaborative virtual environments. The paper also uses this set of issues as an analytical framework for comparing a number of other communication technologies.
Towards a formalization of disease-specific ontologies for neuroinformatics
Authors: Amarnath Gupta, Bertram Ludäscher, Jeffrey S. Grethe, Maryann E. Martone
Venue: Neural Networks (2003)

We present issues arising when trying to formalize disease maps, i.e. ontologies to represent the terminological relationships among concepts necessary to construct a knowledge-base of neurological disorders. These disease maps are being created in the context of a large-scale data mediation system being created for the Biomedical Informatics Research Network (BIRN). The BIRN is a multiuniversity consortium collaborating to establish a large-scale data and computational grid around neuroimaging data, collected across multiple scales. Test bed projects within BIRN involve both animal and human studies of Alzheimer's disease, Parkinson's disease and schizophrenia.Incorporating both the static 'terminological' relationships and dynamic processes, disease maps are being created to encapsulate a comprehensive theory of a disease. Terms within the disease map can also be connected to the relevant terms within other ontologies (e.g. the Unified Medical Language System), in order to allow the disease map management system to derive relationships between a larger set of terms than what is contained within the disease map itself. In this paper, we use the basic structure of a disease map we are developing for Parkinson's disease to illustrate our initial formalization for disease maps.
RBPIM: A PCIM-Based Framework for RBAC
Authors: Ricardo Nabhen, Edgard Jamhour, Carlos Maziero
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

This paper presents a PCIM-based framework forstoring and enforcing RBAC (Role Based Access Control)policies in distributed heterogeneous systems. PCIM(Policy Core Information Model) is a generic informationmodel proposed by IETF. This paper proposes a PCIMextension, called RBPIM (Role-Based Policy InformationModel), in order to represent network access policiesbased on the RBAC model. A RBPIM implementationframework based on the PDP/PEP (Policy DecisionPoint/Policy Enforcement Point) approach is alsopresented. In the proposed framework, thecommunication between the PDP and the PEPs isimplemented using the COPS (Common Open PolicyService) protocol, also defined by the IETF. Theframework adopts the outsourcing approach, where thepolicy rules are evaluated by the PDP, as defined by theCOPS standard. This paper evaluates the outsourcingmodel for access control by presenting a case study andthe average response time of PDP under different loadconditions.
Designing cognitive technologies for people with disabilities - perspectives for theory and practice
Authors: Jim Sullivan, Joanna McGrenere
Venue: Issue 73-74 (June-September 2002) (2002)

This panel will identify and discuss practical and theoretical issues in the design, implementation, and evaluation of technologies to assist persons with developmental and acquired cognitive deficits.
Learning and reasoning about interruption
Authors: Eric Horvitz, Johnson Apacible
Venue: Proceedings of the 5th international conference on Multimodal interfaces (2003)

We present methods for inferring the cost of interrupting users based on multiple streams of events including information generated by interactions with computing devices, visual and acoustical analyses, and data drawn from online calendars. Following a review of prior work on techniques for deliberating about the cost of interruption associated with notifications, we introduce methods for learning models from data that can be used to compute the expected cost of interruption for a user. We describe the Interruption Workbench, a set of event-capture and modeling tools. Finally, we review experiments that characterize the accuracy of the models for predicting interruption cost and discuss research directions.
Far-infrared laser on quantum dots created by electric-field focusing
Authors: Lucjan Jacak, Jurij Krasnyj, Dorota Jacak, Liliana Bujkiewicz
Venue: Microelectronic Engineering (2003)

The new proposal of a far-infrared laser employing intraband transitions in the system of quantum dots is briefly described. The conditions for inversion of population for electrons in the quantum dot matrix created by an electric-field focusing in narrow GaAs/AlGaAs quantum well are discussed. The laser is planned to be pumped by periodically repeated rapid creation and destruction of the quantum dot matrix allowing for repeated filling of the dot levels with electrons from a quantum well. Some major results of the analysis of the kinetics of the electron-photon system are presented.
Fault prognostics using dynamic wavelet neural networks
Authors: Peng Wang, George Vachtsevanos
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2001)

Modern industry is concerned about extending the lifetime of its critical processes and maintaining them only when required. Significant aspects of these trends include the ability to diagnose impending failures, prognosticate the remaining useful lifetime of the process and schedule maintenance operations so that uptime is maximized. Prognosis is probably the most difficult of the three issues leading to condition-based maintenance (CBM). This paper attempts to address this challenging problem with intelligence-oriented techniques, specifically dynamic wavelet neural networks (DWNNs). DWNNs incorporate temporal information and storage capacity into their functionality so that they can predict into the future, carrying out fault prognostic tasks. Such fundamental issues as the network structure, learning algorithms, stability analysis, uncertainty management, and performance assessment are studied in a theoretical framework. An example is presented in which a trained DWNN successfully prognoses a defective bearing with a crack in its inner race.
Announcements
Authors: Anonymous
Venue: Organised Sound (2001)

Concerning this issue's theme, we have received the following materials:Conference Proceedings from the Australasian Computer Music Conference 1999, &lsquo;Imaginary Spaces&rsquo; (Victoria University of Wellington) and 2000, &lsquo;InterFaces&rsquo; (Queensland University of Technology). For further information on conferences, please refer to <http://www.acma.asn.au/conferences.html>. MikroPolyphone also publishes selected conference papers and other articles: <http://farben.latrobe.edu.au/mikropol/>.
Algorithmic Aspects of a Chip-Firing Game
Authors: Jan Van Den Heuvel
Venue: Combinatorics, Probability and Computing (2001)

Algorithmic aspects of a chip-firing game on a graph introduced by Biggs are studied. This variant of the chip-firing game, called the dollar game, has the properties that every starting configuration leads to a so-called critical configuration. The set of critical configurations has many interesting properties. In this paper it is proved that the number of steps needed to reach a critical configuration is polynomial in the number of edges of the graph and the number of chips in the starting configuration, but not necessarily in the size of the input. An alternative algorithm is also described and analysed.
Experience with an evolving overlay network testbed
Authors: David G. Andersen, Hari Balakrishnan, M. Frans Kaashoek, Robert Morris
Venue: ACM SIGCOMM Computer Communication Review (2003)

The MIT RON testbed consists of 36 Internet-connected nodes at 31 different sities. It has been in operation for two years. This paper presents an overview of the testbed, summarizes some of the research for which it has proved useful, and presents the lessons we learned during its development. The testbed has been useful both for our own research and for that of external researchers becuase of its heterogeneous, diverse network connections; its homogenous hardware and software platform; its incremental, bottom-up development; and its easy configuration and management tools.
Reconfiguration control in adaptive networks
Authors: Karin Sigurd
Venue:  (2003)

Distributed control systems are emerging as more robust and flexible alternatives to traditional control systems in several mechatronic fields such as satellite control and robotics. Instead of relying on one large unit with a centralized control architecture, one thus uses a parallel structure composed of many simple controllers collectively capable of performing the same task as the large unit. Reconfiguration control involves cooperation, coordination and mutual adaptation and is relevant in a number of engineering problems such as formation control, multiagent learning and role allocation. In addition to being a key issue for using the distributed control paradigm to its full potential, reconfiguration control also offers a well delimited framework for addressing a number of interesting theoretical questions in distributed control such as those related to the overlapping notions of cooperation and coordination. We propose a unified game theoretic approach to the problem of reconfiguration control which interprets node positions as strategies, identifies each configuration with the unique equilibrium of a game and sees reconfigurations as switches of games. Our approach is implemented in two different settings, both related to trajectory planning, and illustrated with simulation results. In the first setting, we propose replicator learning as a multiagent learning algorithm which is a generalization of the replicator dynamics and show convergence in any finite dimension l of the average strategy to any desired strategy as a function of the chosen game matrix. We show how this result can be linked to collective motion in a subspace of &Re;l-1 resulting in a successive visiting of a set of waypoints. In the second setting, we propose a novel total field collision avoidance algorithm of magnetic nature which permits a set of vehicles to reconfigure successively without knowing each other's positions; strategic sensor positioning makes sure that the vehicles do not sense their own fields. Contributions of our research are a multiagent learning algorithm, a unified game theoretic framework for addressing reconfiguration problems, the identification of reconfiguration control as a problem common to several different fields but previously addressed with field-specific methods, the proposal of a definition of robustness in this context and, for the two trajectory planning settings in which our algorithm was implemented, two algorithms for distributed coordination and collision avoidance, respectively. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Efficient elastic burst detection in data streams
Authors: Yunyue Zhu, Dennis Shasha
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Burst detection is the activity of finding abnormal aggregates in data streams. Such aggregates are based on sliding windows over data streams. In some applications, we want to monitor many sliding window sizes simultaneously and to report those windows with aggregates significantly different from other periods. We will present a general data structure for detecting interesting aggregates over such elastic windows in near linear time. We present applications of the algorithm for detecting Gamma Ray Bursts in large-scale astrophysical data. Detection of periods with high volumes of trading activities and high stock price volatility is also demonstrated using real time Trade and Quote (TAQ) data from the New York Stock Exchange (NYSE). Our algorithm beats the direct computation approach by several orders of magnitude.
Structures and energies of &#x03B2;-neocarrabiose in vaccum and in aqueous solution
Authors: M. Sekkal-Rahal, D. C. Kleb, P. Bleckmann
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

In order to explain some physical behaviour of carrageenans, we focuse our interrest on the structure of one of the two basic dissacharides of these polygalactanes.The structure of β-neocarrabiose has been studied using quantum mechanics methods such as RHF/6-31g*, RHF/6-31g**, RHF/6-311+g*, B3LYP/6-31g*, B3LYP/6-31g** and B3LYP/6-311+g* both in vaccum and in water solution using the SCRF onsager model. The structures and the energies obtained from each calculations have been compared and the effect of solvent as well as some other features concerning the preferential conformations are investigated.The vibrational frequencies have been also computed for each method in order to discuss the stability of these molecule with the aid of the obtained thermodynamical values, notably in term of Gibbs free energies.
Toward an Easy Programming Environment for Implementing Mobile Applications: A Fleet Application Case Study using SyD Middleware
Authors: S. K. Prasad, M. Weeks, Y. Zhang, A. Zelikovsky, S. Belkasim, R. Sunderraman, V. Madisetti
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

This paper describes the advantages of SyD (System onMobile Devices), a middleware technology for mobile devicesand e-services, in terms of technology and programming.Features of SyD are illustrated here through our prototypeapplication, a complex communication system for atrucking fleet that operates an automated package deliverysystem. The fleet system has been implemented in threeways, with SOAP, with JDBC, and with SyD. Our implementationexperience shows that SyD greatly simplifies codingby allowing heterogeneous devices, peer-to-peer communications,group transactions based on triggering events, andmobility support through proxies and directory service.
High-level language support for programming distributed systems
Authors: J. S. Auerbach, D. F. Bacon, A. P. Goldberg, G. S. Goldszmidt, M. T. Kennedy, A. R. Lowry, J. R. Russell, W. Silverman, R. E. Strom, D. M. Yellin, S. A. Yemini
Venue: Proceedings of the 1991 conference of the Centre for Advanced Studies on Collaborative research (1991)

This paper presents a strategy for simplifying the programming of heterogeneous distributed multiapplications. A multiapplication is a distributed system or a collection of autonomous applications which occasionally interact, such as a bank and its customers. Our approach is based on designing a machine-and language-independent process model, and integrating the abstract primitives for process creation, connection, and communication into programming languages. Our goal is to make it easy for non-experts to write multiapplications and multiapplication components, and to produce software which is portable across different machine and operating system environments. The complexity of managing address spaces, name spaces, buffers, communications connections, and recovery in such environments is hidden inside the implementation of a small number of high-level language constructs.We discuss our process model, and two language efforts based on this model: Hermes, a secure, representation-independent language designed explicitly around the process model, and Concert-C, a minimal set of extensions to C to support the process model while allowing reuse of existing C code. We discuss the status of the Hermes and Concert-C prototype implementations.
On maximal synchronous codes
Authors: Yannick Guesnet
Venue: Theoretical Computer Science (2003)

In this paper, we are interested in maximal synchronous codes. More precisely, we prove that we can embed any synchronous code in a maximal one. Moreover, we establish that, for synchronous codes, the notion of maximality in the family of synchronous codes is equivalent to the notion of maximality in the family of codes.
Data flow graphs: system specification with the most unrestricted semantics
Authors: Gjalt G. de Jong
Venue: Proceedings of the conference on European design automation (1991)

A new data flow graph concept is defined to be used for architectural synthesis as well as verification of a system. The graph contains only the explicit data dependencies, but any other constraints can also be described. The semantics of this graph does not impose any restriction on the scheduler, except for the explicit data dependencies. For instance, the scheduler is not forced to work on certain blocks in the graph, like loop bodies but may work also across these borders. It is also proved that an optimal schedule can be found efficiently.
Dualising initial algebras
Authors: Neil Ghani, Christoph Lüth, Federico De Marchi, John Power
Venue: Mathematical Structures in Computer Science (2003)

Whilst the relationship between initial algebras and monads is well understood, the relationship between final coalgebras and comonads is less well explored. This paper shows that the problem is more subtle than might appear at first glance: final coalgebras can form monads just as easily as comonads, and, dually, initial algebras form both monads and comonads.In developing these theories we strive to provide them with an associated notion of syntax. In the case of initial algebras and monads this corresponds to the standard notion of algebraic theories consisting of signatures and equations: models of such algebraic theories are precisely the algebras of the representing monad. We attempt to emulate this result for the coalgebraic case by first defining a notion of cosignature and coequation and then proving that the models of such coalgebraic presentations are precisely the coalgebras of the representing comonad.
Weakly nonoscillatory schemes for scalar conservation laws
Authors: Kirill Kopotun, Marian Neamtu Bojan Popov
Venue: Mathematics of Computation (2003)

A new class of Godunov-type numerical methods (called here weakly nonoscillatory or WNO) for solving nonlinear scalar conservation laws in one space dimension is introduced. This new class generalizes the classical nonoscillatory schemes. In particular, it contains modified versions of Min-Mod and UNO. Under certain conditions, convergence and error estimates for WNO methods are proved.
Challenging interfaces/redesigning users
Authors: Anna Dickinson, Roos Eisma, Peter Gregor
Venue: Issue 73-74 (June-September 2002) (2002)

As the identity of the computer user becomes more diverse, software developers can no longer assume familiarity with legacy systems or perfect vision, motor control and memory. The development of Piloot (for users with learning difficulties) and SeeWord (for dyslexic readers) shows that systems can be usable and accessible for 'non-typical' user groups. It is no longer appropriate to design 'general purpose' software that excludes users because of their age or minor impairments. Piloot and SeeWord, although developed for very different user groups, uncover some common barriers to computer use. Although some of these barriers were overcome in similar ways, other solutions were specific to the target user group and this may suggest strategies that will be effective in developing inclusive systems in the future.