ppxscal/embedding_network huggingface dataset:
New faces in the computing landscape "not your father's oldsmobile!"
Authors: William Mitchell
Venue: Journal of Computing Sciences in Colleges (2003)

With the publication of Curriculum '68 Computer Science asserted that it was distinct from Mathematics and was able to list enough computing topics to justify a unique undergraduate major. Curriculum 2001 describes Computer Science as an academic discipline thirty-three years later, but also to be described are distinct curricula in software engineering, computer engineering, and information systems. However, this is just the work of an ACM/IEEE Computer Society Task Force. There are now other branches of academe offering computing degrees. This paper looks at the proliferation of computing majors and the professional organizations behind them. It also looks at how new colleges, called IT colleges, are in some universities trying to bring all the different computing majors under one roof (or Dean). Finally, the author offers some suggestions to the majority of faculty who work in higher education institutions that try to squeeze computing into one or two majors.
Three-dimensional memory vectorization for high bandwidth media memory systems
Authors: Jesus Corbal, Roger Espasa, Mateo Valero
Venue: Proceedings of the 35th annual ACM/IEEE international symposium on Microarchitecture (2002)

Vector processors have good performance, cost and adaptability when targeting multimedia applications. However, for a significant number of media programs, conventional memory configurations fail to deliver enough memory references per cycle to feed the SIMD functional units. This paper addresses the problem of the memory bandwidth.We propose a novel mechanism suitable for 2-dimensional vector architectures and targeted at providing high effective bandwidth for SIMD memory instructions. The basis of this mechanism is the extension of the scope of vectorization at the memory level, so that 3-dimensional memory patterns can be fetched into a second-level register file.By fetching long blocks of data and by reusing 2-dimensional memory streams at this second-level register file, we obtain a significant increase in the effective memory bandwidth. As side benefits, the new 3-dimensional load instructions provide a high robustness to memory latency and a significant reduction of the cache activity, thus reducing power and energy requirements. At the investment of a 50% more area than a regular SIMD register file, we have measured and average speed-up of 13% and the potential for power savings in the L2 cache of a 30%.
Travelling-wave solutions of coupled nonlinear evolution equations
Authors: W. Malfliet
Venue: Mathematics and Computers in Simulation (2003)

The tanh technique is used to solve exactly a set of nonlinear coupled equations small describing a problem arising in geochemistry. Next a coupled problem originating from the field of (deterministic) random walk theory with reaction kinetics is investigated but now solved approximately. The latter solution corresponds quite well with numerical results.
Future applications and middleware, and their impact on the infrastructure
Authors: Brian E. Carpenter
Venue: Future Generation Computer Systems (2003)

The Internet today has progressed from being "just a network" through phases as a human communications mechanism and an unrivalled information system to the mere beginning of being a true services network. On the way, it has encountered a series of technical and external challenges that have created some barriers to further development. For the Internet to release its known potential and develop as a resource-sharing computing services platform, these barriers must be torn down.
Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-And-Bound
Authors: Kaj Holmberg, Johan Hellstrand
Venue: Operations Research (1998)

The network design problem is a multicommodity minimal cost network flow problem with fixed costs on the arcs, i.e., a structured linear mixed-integer programming problem. It has various applications, such as construction of new links in transportation networks, topological design of computer communication networks, and planning of empty freight car transportation on railways. We present a Lagrangean heuristic within a branch-and-bound framework as a method for finding the exact optimal solution of the uncapacitated network design problem with single origins and destinations for each commodity (the simplest problem in this class, but still NP-hard). The Lagrangean heuristic uses a Lagrangean relaxation as subproblem, solving the Lagrange dual with subgradient optimization, combined with a primal heuristic (the Benders subproblem) yielding primal feasible solutions. Computational tests on problems of various sizes (up to 1000 arcs, 70 nodes and 138 commodities or 40 nodes and 600 commodities) and of several different structures lead to the conclusion that the method is quite powerful, outperforming for example a state-of-the-art mixed-integer code, both with respect to problem size and solution time.
Bit-level scheduling of heterogeneous behavioural specifications
Authors: M. C. Molina, J. M. Mendías, R. Hermida
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

This paper presents a heuristic scheduling algorithm for heterogeneous specifications, those formed by operations of different types and widths. The algorithm extracts the common operative kernel of the operations, and binds afterwards operations to cycles with the aim of distributing uniformly the number of bits calculated per cycle. In consequence, operations may be fragmented and executed during a set of non-necessarily consecutive cycles, and over a set of several linked simple hardware resources. The proposed algorithm, in combination with allocation algorithms able to guarantee bit-level reuse of hardware resources, obtains considerably smaller datapaths than the ones proposed by conventional synthesis algorithms. In the datapaths produced the type, number, and width of the hardware resources are independent of the type, number, and width of the specification operations and variables.
On the difference between two widely publicized methods for analyzing oscillator phase behavior
Authors: Piet Vanassche, Georges Gielen, Willy Sansen
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

This paper describes the similarities and differences between two widely publicized methods for analyzing oscillator phase behavior. The methods were presented in [3] and [6]. It is pointed out that both methods are almost alike. While the one in [3] can be shown to be, mathematically, more exact, the approximate method in [6] is somewhat simpler, facilitating its use for purposes of analysis and design. In this paper, we show that, for stationary input noise sources, both methods produce equal results for the oscillator's phase noise behavior. However, when considering injection locking, it is shown that both methods yield different results, with the approximation in [6] being unable to predict the locking behavior. In general, when the input signal causing the oscillator phase perturbations is non-stationary, the exact model produces the correct results while results obtained using approximate model break down.
Sensing surfaces: bringing the desktop into virtual environments
Authors: Matthias Bues Roland Blach Frank Haselberger
Venue: Proceedings of the workshop on Virtual environments 2003 (2003)

There are many classes of information for which a suitable 3-D representation does not (yet) exist, and for which users are familiar with more or less ef cient desktop interfaces. Therefore, a convenient way of accessing GUI-based systems from within a Virtual Environment can greatly enhance application possibilities and leverage integration with other IT facilities. We describe Sensing Surfaces, which follows the approach of mapping the contents of a GUI desktop to aribtrary textured geometry in the VE.
Ethics and the internet: a novel approach to computer literacy
Authors: Barbara Boucher Owens
Venue: Journal of Computing Sciences in Colleges (2003)

This report outlines three years of teaching college freshman topics covered in a typical literacy class: word processing, presentation software, and web use and programming. Coverage of ethical theory and its application to Internet use and misuse is an integral part of this attempt to effect responsible use of technology. The paper outlines the historical background for such a course, suggests myriad sources for course materials, and proposed a research model for testing the efficacy of the computing component as well as the ethical reasoning component of the course.
An inequality in character algebras
Authors: Arlene A. Pascasio
Venue: Discrete Mathematics (2003)

In this paper, we prove the following: Theorem. Let A = 〈A0,A1,...,Ad〉 denote a complex character algebra with d ≥ 2 which is P-polynomial with respect to the ordering A0,A1,...,Ad of the distinguished basis. Assume that the structure constants pijh are all nonnegative and the Krein parameters qijh are all nonnegative. Let θ and θ' denote eigenvalues of A1, other than the valency k = k1. Then the structure constants a1 = P111 and b1 = P121 satisfy (θ + k/a1 + 1) (θ' + k/a1 + 1) ≥ - ka1b1/(a1 + 1)2). Let E and F denote the primitive idempotents of A associated with θ and θ', respectively. Equality holds in the above inequality if and only if the Schur product E o F is a scalar multiple of a primitive idempotent of A.The above theorem extends some results of Jurisić, Koolen, Terwilliger, and the present author. These people previously showed the above theorem holds for those character algebras isomorphic to the Bose-Mesner algebra of a distance-regular graph.
Automated verification using deduction, exploration, and abstraction
Authors: Natarajan Shankar
Venue: Programming methodology (2003)

Computer programs are formal texts that are composed by programmers and executed by machines. Formal methods are used to predict the execution-time behavior of a program text through formal, symbolic calculation. Automation in the form of computer programs can be used to execute formal calculations so that they are reproducible and checkable. Deduction and exploration are two basic frameworks for the formal calculation of program properties. Both deduction and exploration have their limitations. We argue that these limitations can be overcome through a methodology for automated verification that uses property-preserving abstractions to bridge the gap between deduction and exploration. We introduce models, logics, and verification methods for transition systems, and outline a methodology based on the combined use of deduction, exploration, and abstraction.
Reengineering legacy systems for distributed environments
Authors: Miguel A. Serrano, Doris L. Carver, Carlos Montes de Oca
Venue: Journal of Systems and Software (2002)

In the last decade, we have seen an increasing use of both the object-oriented paradigm and distributed systems. As a result, there is increasing interest in migrating and reengineering legacy systems to these new hardware technologies and software development paradigms. We define a reengineering environment that assists with the migration of legacy systems to distributed object environments. The reengineering environment includes the methodology and an integrated set of tools that support the implementation of the methodology. The methodology consists of multiple phases. First, we use reverse engineering techniques for program comprehension and design recovery. We then decompose the system into a hierarchy of subsystems by defining relationships between the entities of the underlying paradigm of the legacy system. The decomposition is driven by data mining, software metrics, and clustering techniques. Next, if the underlying paradigm of the legacy system is not object-based, we perform object-based adaptations on the subsystems. We then create components by wrapping objects and defining an interface. Finally, we allocate components to different sites by specifying the requirements of the system and characteristics of the network as an integer-programming model that minimizes the remote communication. We use middleware technologies for the implementation of the distributed object system.
2-factor Hamiltonian graphs
Authors: M. Funk, Bill Jackson, D. Labbate, J. Sheehan
Venue: Journal of Combinatorial Theory Series B (2003)

The Heawood graph and K3, 3 have the property that all of their 2-factors are Hamilton circuits. We call such graphs 2-factor hamiltonian. We prove that if G is a k-regular bipartite 2- factor hamiltonian graph then either G is a circuit or k = 3. Furthermore, we construct an infinite family of cubic bipartite 2-factor hamiltonian graphs based on the Heawood graph and K3,3 and conjecture that these are the only such graphs.
A measure for the cohesion of weighted networks
Authors: Leo Egghe, Ronald Rousseau
Venue: Journal of the American Society for Information Science and Technology (2003)

A generalization of both the Botafogo-Rivlin-Shneiderman compactness measure and the Wiener index is presented. These new measures for the cohesion of networks can be used in case a dissimilarity value is given between nodes in a network or a graph. It is illustrated how a set of weights between connected nodes can be transformed into a set of dissimilarity measures for all nodes. The new compactness measure for the cohesion of weighted graphs has several desirable properties related to the disjoint union of two networks. Finally, an example is presented of the calculation of the new compactness measures for a co-citation and a bibliographic coupling network.
Take it to the next stage: the roles of role playing in the design process
Authors: Kristian T. Simsarian
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

Using role play at every stage of the design process has been a vital tool for IDEO in working with clients and users. With the dual properties of bringing participants into the moment and making shared activities physical rather than just mental, role playing techniques make the process more experiential and creatively generative. Role playing is complimentary to traditional design techniques providing additional team dynamics and insights that bring the process and designs to another level. This paper describes how we have used role-playing in our design process and how it can be integrated into any HCI project.
A local circuit topology for inductive parasitics
Authors: Andrea Pacelli
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

A novel circuit topology for inductive coupling between interconnecting wires is presented. The model is local, i.e., only coupling between neighboring wires is explicitly modeled. However, the topology accounts for long-range coupling by propagating the vector potential from one wire to the next. Examples of model calibration, both directly from layout and as model-order reduction of a given inductance matrix, are presented for simple wiring structures.
Stochastic algorithms for searching causal orderings in Bayesian networks
Authors: Luis M. de Campos, Juan F. Huete
Venue: Technologies for constructing intelligent systems: tools (2002)

The structure of a Bayesian network depends heavily on the ordering of its variables: given any ordering it is always possible to build a Bayesian network whose arcs are consistent with the initial ordering; however, the topology of the network, and therefore the number of conditional independence relationships that may be explicitly represented can vary greatly from one ordering to another. As a sparse representation is always preferable to a denser representation of the same model, the task of determining the ordering giving rise to the network with minimum number of arcs is important. In this work we propose methods to obtain a good approximation to the optimal ordering, using only partial information. More precisely, we only use conditional independence relationships of order zero and one, and search for the ordering which best preserves this information. The search process will be guided by genetic algorithms and simulated annealing.
Learning regular expressions
Authors: Giovanni Organtini
Venue: Linux Journal (2003)

Discover a powerful, fast technique for text searching and filtering.
The chromatic number of a graph of girth 5 on a fixed surface
Authors: Carsten Thomassen
Venue: Journal of Combinatorial Theory Series B (2003)

We prove a color extension result implying that, for every fixed surface S, there are only finitely many 4-color-critical graphs of girth 5 on S. The result is best possible in the sense that there are infinitely many 4-color-critical graphs of girth 4 on S. except when S is the sphere. As a consequence, the chromatic number of graphs of girth 5 on S can be found in polynomial time.
Comparative genomics approaches to study organism similarities and differences
Authors: Liping Wei, Yueyi Liu, Inna Dubchak, John Shon, John Park
Venue: Computers and Biomedical Research (2002)

Comparative genomics is a large-scale, holistic approach that compares two or more genomes to discover the similarities and differences between the genomes and to study the biology of the individual genomes. Comparative studies can be performed at different levels of the genomes to obtain multiple perspectives about the organisms. We discuss in detail the type of analyses that offer significant biological insights in the comparisons of (1) genome structure including overall genome statistics, repeats, genome rearrangement at both DNA and gene level, synteny, and breakpoints; (2) coding regions including gene content, protein content, orthologs, and paralogs; and (3) noncoding regions including the prediction of regulatory elements. We also briefly review the currently available computational tools in comparative genomics such as algorithms for genome-scale sequence alignment, gene identification, and nonhomology-based function prediction.
Segmentation and detection at IBM: hybrid statistical models and two-tiered clustering
Authors: S. Dharanipragada, M. Franz, J. S. McCarley, T. Ward, W.-J. Zhu
Venue: Topic detection and tracking: event-based information organization (2002)

IBM's story segmentation uses a combination of decision tree and maximum entropy models. They take a variety of lexical, prosodic, semantic, and structural features as their inputs. Both types of models are source-specific, and we substantially lower Cseg by combining them. IBM's topic detection system introduces a minimal hierarchy into the clustering: each cluster is comprised of one or more microclusters. We investigate the importance of merging microclusters together, and propose a merging strategy which improves our performance.
The relationship between information and communication technologies adoption and management
Authors: Yiannis E. Spanos, Gregory P. Prastacos, Angeliki Poulymenakou
Venue: Information and Management (2002)

This paper examines the impact of information and communication technologies (ICT) adoption on management, praxis. The study, building on the theoretical framework developed by Scott Morton and his colleagues, attempts to identify the dynamic relationships between ICT adoption and management efforts towards modernization and reorganization. Using data from leading Greek firms, we report evidence as to how changes in strategy, organizational structure, management systems, and human skills link with the current and prospective level of use of various types of advanced ICT. Findings generally appear to suggest that Greek firms are in a process of recognizing the potential of ICT to enable and support changes that are necessary for successfully competing in a hyper-competitive environment. In particular, ICT adoption is shown to affect strategy by supporting long-term strategic objectives and the quest for profitability. Indirectly, it also links to strategic planning systems. ICT is found to be related to an internal environment characterized by open organization and flexibility. Finally, the results show that the sample firms recognize the need for multi-skilled personnel to exploit the advantages stemming from ICT adoption.
An Economic Model for Evaluating Mining and Manufacturing Ventures with Output Yield Uncertainty
Authors: Bardia Kamrad, Ricardo Ernst
Venue: Operations Research (2001)

This paper develops an operational risk management model for evaluating production efforts in manufacturing and mining industries where the resource to be exploited is nonhomogenous. Using acontingent claims methodology now commonly encountered in financial applications, we formulate a production control model in an environment characterized bymarket andprocess uncertainty. In our analysis, market risk is depicted by the output price while process uncertainty is captured by the random variability inherent in the output's yield. In this light, adjustments to the rate of production are viewed as a sequence of (nested) real options affording operating flexibility. We account for an optimal sequence of production adjustments, over a preestablished production horizon, by taking the production rate as an adapted positive real-valued process. Accordingly, techniques of stochastic control theory and contingent claims analysis (CCA) are employed to ensure value maximizing production policies are rendered in a manner consistent with an equilibrium price structure.
Complexity theory and models for social networks
Authors: John Skvoretz
Venue: Complexity (2002)

Much work in complexity theory employs agent-based models in simulations of systems of multiple agents. Agent interaction follows some standard types of network topologies. My aim is to assess how recent advances in the statistical modeling of social networks may contribute to agent-based modeling traditions, specifically, by providing structural characterizations of a variety of network topologies. I illustrate the points by reference to a computational model for the evolution of cooperation among agents embedded in neighborhoods and by reference to complex, real social networks defined by the ties of political support between US Senators as revealed through ties of cosponsorship of legislation.
Fast processor core selection for WLAN modem using mappability estimation
Authors: Juha-Pekka Soininen, Jari Kreku, Yang Qu, Martti Forsell
Venue: Proceedings of the tenth international symposium on Hardware/software codesign (2002)

Mappability metric and a novel method for evaluating the goodness of processor core and algorithm combinations are introduced. The new mappability concept is an addition to performance and cost metrics used in existing codesign and system synthesis approaches. The mappability estimation is based on the analysis of the correlation or similarity of algorithm and core architecture characteristics. It allows fast design space exploration of core architectures and mappings with little modeling effort. The method is demonstrated by analyzing suitable processor core architectures for baseband algorithms of the WLAN modem. 140400 architecture-algorithm pairs were analyzed in total and the estimated results were similar to the results of more detailed evaluations. The method is not, however, limited to the WLAN modem, but is applicable for digital signal processing in general.