ppxscal/embedding_network huggingface dataset:
Introduction to the Special Issue: Applications of Complexity Theory to Organization Science
Authors: Philip Anderson, Alan Meyer, Kathleen Eisenhardt, Kathleen Carley, Andrew Pettigrew
Venue: Organization Science (1999)

In crafting the call for papers for this special issue of Organization Science, the appointed editors wrote: Organizational scholars seldom come to grips with nonlinear phenomena. Instead, we tend to model phenomena as if they were linear in order to make them tractable, and we tend to model aggregate behavior as if it is produced by individual entities which all exhibit average behavior... a different view of complexity is emerging that may have important implications for organizational scholarship. Within the past decade, interest in the "sciences of complexity" has increased dramatically. The study of complex system dynamics has perhaps progressed furthest in the natural sciences, but it is also beginning to penetrate the social sciences. This interdisciplinary field of study is still pre-paradigmatic, and it embraces a wide variety of approaches. Although it is not yet clear whether a genuine science of complexity will emerge, it does seem clear that scholars in a variety of fields are viewing complexity in a different way than organizational scholars traditionally have. At this juncture, organizational researchers have few templates that suggest to them how to hypothesize about or model such behavior. It is difficult to know how to draw a conceptual model and how to report the results of empirical inquiries into complex organizational phenomena. The special issue aims to provide scholars with useful templates to follow when analyzing complex processes that involve organizations.
An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
Authors: Luca Maria Gambardella, Marco Dorigo
Venue: INFORMS Journal on Computing (2000)

We present a new local optimizer called SOP-3-exchange for the sequential ordering problem that extends a local search for the traveling salesman problem to handle multiple constraints directly without increasing computational complexity. An algorithm that combines the SOP-3-exchange with an Ant Colony Optimization algorithm is described, and we present experimental evidence that the resulting algorithm is more effective than existing methods for the problem. The best-known results for many of a standard test set of 22 problems are improved using the SOP-3-exchange with our Ant Colony Optimization algorithm or in combination with the MPO/AI algorithm (Chen and Smith 1996).
Providing Decisional Guidance for Multicriteria Decision Making in Groups
Authors: Moez Limayem, Gerardine DeSanctis
Venue: Information Systems Research (2000)

Intelligent user interfaces, particularly in interactive group settings, can be based on system explanations that guide model building, application, and interpretation. Here we extend Silver's (1990, 1991) conceptualization of decisional guidance and the theory of breakpoints in group interaction to operationalize feedback and feedforward for a complex multicriteria modeling system operating within a group decision support system context. We outline a design approach for providing decisional guidance in GDSS and then test the feasibility of the design in a preliminary laboratory experiment. Findings show how decisional guidance that provides system explanations at breakpoints in group interaction can improve MCDM GDSS usability. Our findings support Dhaliwal and Benbasat's (1996) conjecture that system explanations can improve decisional outcomes due to improvement in user understanding of decision models. Further research on intelligent agents, particularly in interactive group settings, can build on the concepts of decisional guidance outlined in this paper.
Whisking: an unexplored sensory modality
Authors: Max Lungarella, Verena V. Hafner, Rolf Pfeifer, Hiroshi Yokoi
Venue: Proceedings of the seventh international conference on simulation of adaptive behavior on From animals to animats (2002)

Whiskers are widespread in the animal kingdom because they play an essential role in adaptive behavior. In spite of the enormous potential of whiskers, they have yet to be systematically investigated and exploited by roboticists. In this work, we present a first series of experiments with prototype artificial whiskers that have been developed in our laboratory. These experiments have been inspired by neuroscience research on real rats. The experiments provide the foundation for future work including active sensing, whisker arrays, and cross-modal integration.
Existence and regularity for scalar minimizers of affine nonconvex simple integrals
Authors: António Ornelas
Venue: Nonlinear Analysis: Theory, Methods Applications (2003)

Existence of AC minimizers x: [a, b] → R is proved for the nonconvex integral ∫ab{ρ(x) h(x')+ φ(x)} dt, under the general hypotheses of lower semicontinuity, boundedness below, and superlinear growth at infinity in x'(.). Any nonconvex function h : R → [0, + ∞] will do, provided it is convex at ξ = 0.Moreover, minimizers are shown to satisfy several regularity properties, under adequate hypotheses.
Fuzzifications of foldness of quasi-associative ideals in BCI-algebras
Authors: Young Bae Jun, Kyung Ho Kim
Venue: The Korean Journal of Computational Applied Mathematics (2003)

Fuzzifications of n-fold quasi-associative ideals are considered. Conditions for a fuzzy ideal to be a fuzzy n-fold quasi-associative ideal are given. Using a collection of n-fold quasi-associative ideals, fuzzy n-fold quasi-associative ideals are constructed. Finally, the extension property for fuzzy n-fold quasi-associative ideals is established.
Newton-like method with modification of the right-hand-side vector
Authors: Nataša Krejić, Zorana Lužanin
Venue: Mathematics of Computation (2002)

This paper proposes a new Newton-like method which defines new iterates using a linear system with the same coefficient matrix in each iterate. while the correction is performed on the right-hand-side vector of the Newton system. In this way a method is obtained which is less costly than the Newton method and faster than the fixed Newton method. Local convergence is proved for nonsingular systems. The influence of the relaxation parameter is analyzed and explicit formulae for the selection of an optimal parameter are presented. Relevant numerical examples are used to demonstrate the advantages of the proposed method.
Robust and passive model order reduction for circuits containing susceptance elements
Authors: Hui Zheng, Lawrence T. Pileggi
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

Numerous approaches have been proposed to address the overwhelming modeling problems that result from the emergence of magnetic coupling as a dominant performance factor for ICsand packaging. Firstly, model order reduction (MOR) methods have been extended to robustly capture very high frequency behaviors for large RLC systems via methods such as PRIMA[8] with guaranteed passivity. In addition, new models of the magnetic couplings in terms of susceptance (inverse of inductance) have shown great promise for robust sparsification of otherwise intractable inductance coupling-matrix problems [3--5]. However, model order reduction via PRIMA for circuits that include susceptance elements does not guarantee passivity. Moreover, susceptance elements are incompatible with the path tracing algorithms that provide the fundamental runtime efficiency of RICE [10]. In this paper a novel MOR algorithm, SMOR, is proposed as an extension of ENOR [11] which exploits the matrix properties of susceptance-based circuits for runtime efficiency, and provides for a numerically stable, provably passive MOR using a new or-thonormalization strategy.
Turnover of IT professionals: a quantitative analysis of the literature
Authors: Damien Joseph, Soon Ang
Venue: Proceedings of the 2003 SIGMIS conference on Computer personnel research: Freedom in Philadelphia--leveraging differences and diversity in the IT workforce (2003)

IT scholars have long been interested in the turnover of IT professionals. In their many studies, IT scholars have considered a wide range of predictors of IT turnover including personal characteristics, role constructs, job characteristics, and organizational characteristics. In this paper, we conduct a meta-analysis to summarize this body of research. The objective of this paper is, therefore, to examine the bivariate relationships of predictors with IT turnover. The meta-analytic results on the relationships with turnover are consistent with theory and prior empirical research.
A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
Authors: Yu-Fei Yang, Dong-Hui Li, Liqun Qi
Venue: SIAM Journal on Optimization (2002)

In this paper, by means of the concept of the working set, which is an estimate of the active set, we propose a feasible sequential linear equation algorithm for solving inequality constrained optimization problems. At each iteration of the proposed algorithm, we first solve one system of linear equations with a coefficient matrix of size m &times; m (where m is the number of constraints) to compute the working set; we then solve a subproblem which consists of four reduced systems of linear equations with a common coefficient matrix. Unlike existing QP-free algorithms, the subproblem is concerned with only the constraints corresponding to the working set. The constraints not in the working set are neglected. Consequently, the dimension of each subproblem is not of full dimension. Without assuming the isolatedness of the stationary points, we prove that every accumulation point of the sequence generated by the proposed algorithm is a KKT point of the problem. Moreover, after finitely many iterations, the working set becomes independent of the iterates and is essentially the same as the active set of the KKT point. In other words, after finitely many steps, only those constraints which are active at the solution will be involved in the subproblem. Under some additional conditions, we show that the convergence rate is two-step superlinear or even Q-superlinear. We also report some preliminary numerical experiments to show that the proposed algorithm is practicable and effective for the test problems.
Geometric Spanners for Wireless Ad Hoc Networks
Authors: Khaled Alzoubi, Xiang-Yang Li, Yu Wang, Peng-Jun Wan, Ophir Frieder
Venue: IEEE Transactions on Parallel and Distributed Systems (2003)

We propose a new geometric spanner for static wireless ad hoc networks, which can be constructed efficiently in a localized manner. It integrates the connected dominating set and the local Delaunay graph to form a backbone of the wireless network. Priori arts showed that both structures can be constructed locally with bounded communication costs. This new spanner has these following attractive properties: 1) the backbone is a planar graph, 2) the node degree of the backbone is bounded from above by a positive constant, 3) it is a spanner for both hops and length, 4) it can be constructed locally and is easy to maintain when the nodes move around, and 5) moreover, the communication cost of each node is bounded by a constant. Simulation results are also presented for studying its practical performance.
An Asset and Liability Management System for Towers Perrin-Tillinghast
Authors: John M. Mulvey, Gordon Gould, Clive Morgan
Venue: Interfaces (2000)

Towers Perrin-Tillinghast employs a stochastic asset-and-liability management system for helping its pension plan and insurance clients understand the risks and opportunities related to capital market investments and other major decisions. The system has three major components: (1) a stochastic scenario generator (CAP:Link); (2) a nonlinear optimization simulation model (OPT:Link); and (3) a flexible liability- and financial-reporting module (FIN:Link). Each part improves over existing technology as compared with traditional actuarial approaches. The integrated investment system links asset risks to liabilities so that company goals are best achieved. For example, US WEST saved $450 to $1,000 million in opportunity costs in its pension plan by following the advice of the asset-and-liability system.
Time-evolving interfaces in a Stokes flow
Authors: Mary Catherine A. Kropinski
Venue: Scientific computing and applications (2001)

We present new methods for computing the motion of two dimensional closed interfaces in a slow viscous flow. The interfacial velocity is found through the solution to an integral equation whose analytic formulation is based on complex-variable theory for the biharmonic equation. The numerical methods for solving the integral equations are spectrally accurate and employ a fast multipole-based iterative solution procedure, which requires only O(N) operations where N is the number of nodes in the discretisation of the interface. The interface is described spectrally, and we use evolution equations that preserve equal spacing in arclength of the marker points. A small-scale decomposition is performed to extract the dominant term in the evolution of the interface and we show that this dominant term leads to a CFL-type stability constraint. When in an equal arclength frame, this term is linear and we show that implicit time-integration schemes that are explicit in Fourier space can be formulated. We verify this analysis through several numerical examples.
HiC: a C++ compiler for CS1
Authors: Robert W. Hasker
Venue: Journal of Computing Sciences in Colleges (2002)

In CS1 courses, students must often use professional environments to develop programs. Students often find these difficult to use because error messages involve terms they do not understand. Professional systems must support the entire language, so messages must use terms which ensure both accuracy and brevity. This is a particular problem in C++. This paper presents a solution based on identifying a subset of C++ which is appropriate for introductory students. It also presents a development environment based on this subset, HiC, and our experiences in using HiC in a CS1 course.
Cluster overlap distribution map: visualization for gene expression analysis using immersive projection technology
Authors: Makoto Kano, Kunihiro Nishimura, Shuichi Tsutsumi, Hiroyuki Aburatani, Koichi Hirota, Michitaka Hirose
Venue: Presence: Teleoperators and Virtual Environments (2003)

In this paper, we discuss possible applications of virtual reality technologies, such as immersive projection technology (IPT), in the field of genome science, and propose cluster-oriented visualization that attaches importance to data separation of large gene data sets with multiple variables. Based on these strategies, we developed the cluster overlap distribution map (CDCM), which is a visualization methodology using IPT for pairwise comparison between cluster sets generated from different gene expression data sets. This methodology effectively provides the user with indications of gene clusters that are worth a close examination. In addition, by using the plate window manager system, which enables the user to manipulate existing 2D GUI applications in the virtual 3D space, we developed the virtual environment for the comprehensive analysis from providing the indications to further examination by referring to the database on Web sites. Our system was applied in the comparison between the gene expression data sets of hepatocellular carcinomas and hepatoblastomas, and the effectiveness of the system was confirmed.
Global attractor for damped abstract nonlinear hyperbolic systems
Authors: Gabriella A. Pintér
Venue: Nonlinear Analysis: Theory, Methods Applications (2003)

This work is concerned with the long time dynamics of a class of abstract nonlinear second order in time systems with damping. This class of systems describes nonlinear dissipative elastic models with the nonlinear term produced by neo-Hookean type stress-strain relationships. In the present work, we use an analysis based in part on the results of H.T. Banks, D.S. Gilliam and V.I. Shubov on the existence and uniqueness of the weak solutions to show that these systems generate a "strong" dynamical system also. More importantly, we are able to prove the existence of a compact "strong" global attractor. Finally, we make several comments concerning the regularity of this attractor, and present some examples.
Discovering instances of poetic allusion from anthologies of classical Japanese poems
Authors: Masayuki Takeda, Tomoko Fukuda, Ichiro Nanri, Mayumi Yamasaki, Koichi Tamari
Venue: Theoretical Computer Science (2003)

Waka is a form of traditional Japanese poetry with a 1300-year history. In this paper, we attempt to semi-automatically discover instances of poetic allusion, or more generally, to find similar poems in anthologies of Waka poems. One reasonable approach would be to arrange all possible pairs of poems in two anthologies in decreasing order of similarity values, and to scrutinize high-ranked pairs by human effort. The means of defining similarity between Waka poems plays a key role in this approach. In this paper, we generalize existing (dis)similarity measures into a uniform framework, called string resemblance systems, and using this framework, we develop new similarity measures suitable for finding similar poems. Using the measures, we report successful results in finding instances of poetic allusion between two anthologies Kokin-Shu and Shin-Kokin-Shu. Most interestingly, we have found an instance of poetic allusion that has never before been pointed out in the long history of Waka research.
On strong approximations of USC nonconvex-valued mappings
Authors: Dusan Repovš, Pavel V. Semenov
Venue: Journal of Approximation Theory (2002)

For any upper semicontinuous and compact-valued (usco) mapping F : X → Y from a metric space X without isolated points into a normed space Y, we prove the existence of a single-valued continuous mapping f : X → Y such that the Hausdorff distance between graphs ΓF and Γf is arbitrarily small, whenever "measure of nonconvexity" of values of F admits an appropriate common upper estimate. Hence, we prove a version of the Beer-Cellina theorem, under controlled withdrawal of convexity of values of multifunctions. We also give conditions for such strong approximability of star-shaped-valued upper semicontinuous (usc) multifunctions in comparison with Beer's result for Hausdorff continuous star-shaped-valued multifunctions.
A tool supporting capture and analysis of field research data using the contextual design methodology
Authors: Karen Holtzblatt, Hugh Beyer
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

Field research techniques generate large amounts of unstructured data about users: their work practice, attitudes, strategies, motivations, and so forth. Managing, organizing, communicating, and making sense of this complex and rich data is an ongoing problem for HCI researchers. InContext performs field research and design for its clients, so we have experienced these problems in our business. This presentation demonstrates the software tools we built to manage our own research and design projects, showing how such tools can support a heavily team-based process, and how they can enhance the human thought process inherent in research and design.
IT outsourcing evolution---: past, present, and future
Authors: Jae-Nam Lee, Minh Q. Huynh, Ron Chi-Wai Kwok, Shih-Ming Pi
Venue: Communications of the ACM (2003)

To achieve complex solutions in the rapidly changing world of e-commerce, it is impossible to go it alone. This explains the latest trend in IT outsourcing---global and partner-based alliances. But where do we go from here?
Program animation based on the roles of variables
Authors: Jorma Sajaniemi, Marja Kuittinen
Venue: Proceedings of the 2003 ACM symposium on Software visualization (2003)

Computer programming is a difficult skill for many students and visualizations may be used to foster learning. This paper presents a program animation system, PlanAni, that is based on the concept of the roles of variables. Roles represent schematic uses of variables that occur in programs over and over again, and a set of nine roles covers practically all variables in novice-level programs. PlanAni has been tested in a teaching experiment comparing traditional teaching with role-based teaching and animation. The results of a semi-structured interview with the teacher indicate that students like to work with the animator and that the system clarifies many concepts in programming.
Comprehensive interest points based imaging mosaic
Authors: Gui Yun Tian, Duke Gledhill, David Taylor
Venue: Pattern Recognition Letters (2003)

This paper begins by reviewing the current state-of-the-art for imaging mosaic and applications. Then a new approach that uses a four-step automatic imaging mosaic, based on interest points, is proposed. The four steps are identification of interest points, finding corresponding points in the stitching images, deriving the spatial and spectral transform matrix then image mosaic and smoothing. The advantage of this approach is that it is robust to image capture conditions such as lighting, rotation, viewpoint and capture device.
Adjusting control points to achieve continuity
Authors: Stephen Mann
Venue: Computer Aided Geometric Design (2002)

In this paper, I discuss a method for increasing the continuity between two functional triangular polynomial patches by adjusting their control points. The method described in this paper leaves the control points unchanged if the patches already meet with the desired level of continuity. As an example of using this construction, I give a simple method to construct a C0 patch network with high order polynomial precision, and then adjust its control points to increase continuity without decreasing the order of polynomial precision.
A GA-based fuzzy modeling approach for generating TSK models
Authors: S. E. Papadakis, J. B. Theocharis
Venue: Fuzzy Sets and Systems (2002)

This paper proposes a new genetic-based modeling method for building simple and well-defined TSK models with scatter-type input partitions. Our approach manages all attributes characterizing the structure of a TSK model, simultaneously. Particularly, it determines the number of rules, the input partition, the participating inputs in each rule and the consequent parameters. The model building process is divided into two phases. In phase one, the structure learning task is formulated as a multi-objective optimization problem which is resolved using a novel genetic-based structure learning (GBSL) scheme. Apart from the mean square error (MSE) and the number of rules, three additional criteria are introduced in the fitness function for measuring the quality of the partitions. Optimization of these measures leads to models with representative rules, small overlapping and efficient data cover. In order to obtain models with accurate data fitting and good local performance, the consequent parameters are determined using a local MSE function while the overall model is evaluated on the basis of a global MSE function. The search capabilities of the suggested structure learning scheme are significantly enhanced by including a highly effective local search operator implemented by a micro-genetic algorithm and four problem-specific operators. Finally, a genetic-based parameter learning (GBPL) scheme is suggested in phase two, which performs fine-tuning of the initial models obtained after structure learning. The performance of the proposed modeling approach is evaluated using a static example and a well-known dynamic benchmark problem. Simulation results demonstrate that our models outperform those suggested by other methods with regard to simplicity, model structure, and accuracy.