ppxscal/embedding_network huggingface dataset:
Organisational characteristics, cultural qualities and excellence in leading Australian-owned information technology firms
Authors: G. R. Lowry, G. W. Morgan, D. G. FitzGerald
Venue: Proceedings of the 1996 Information Systems Conference of New Zealand (ISCNZ '96) (1996)

This paper reports empirical findings of an initial series of field case studies aimed at identifying and modelling the organisational characteristics and cultural qualities of excellence in top Australian-owned information technology firms. A common set of critical success factors, missions, and core business activities was identified by executive managers and owners of 10% of the top Australian IT firms. Management described other organisational characteristics including size, revenue, growth projections, the role of software, information systems functions, project teams, customer relations, organisational resources and technology uptake. Staff were asked to identify and describe cultural aspects of the organisations such as the importance of key individuals, orthodoxy, watershed events, key functional values and beliefs, folklore, rites and rituals. They provided metaphors for the organisation culture, the organization itself, their manager an employee, the ideal work environment, and the ideal manager.
The splicing as an operation on formal languages
Authors: G. Paun
Venue: Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95) (1995)

Reports results concerning an extensive (ongoing) formal study of the splicing operation introduced by T. Head (1987) as a model of the recombinant behavior of DNA. The author considers the splicing with respect to finite and possibly infinite sets of rules, applied in the free mode or according to restrictions usual in language theory.
A sliding mesh-mortar method for a two dimensional eddy currents model of electric engines
Authors: Y. M A. Buffa
Venue:  (1999)

The paper concerns the application of a non-conforming domain decomposition method to the problem of the computation of induced currents in electric engines with moving conductors. The {\em eddy currents model} is considered as a quasi-static approximation of Maxwell equations and we study the two dimensional problem associated either to the modified magnetic vector potential or to the magnetic field. Two discretizations are proposed, the first based on curved finite elements and the second one on iso-parametric finite elements in both the static and moving parts. The coupling is obtain by means of the {\em mortar element method} and the approximation on the whole domain turns out to be non-conforming. In both cases optimal error estimates are provided. Numerical tests are then proposed in the case of standard first order finite elements to test the reliability and precision of the method. An application of the method to study a realistic eddy currents problem is also provided. TEL:: 0382-505652 KEYWORDS:: Eddy currents problem, nonconforming finite element approximation, domain decomposition methods EMAIL:: annalisa@dimat.unipv.it
HyperSAT a New Generator for 3-SAT Instances
Authors: Juan Segura-Salazar, Jose Torres-Jiménez
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

Propositional satisfiability is the problem of determining, given a formula of prepositionalCalculus in CNF (Conjunctive Normal Form), if here is assignment of truth values forThe variables in such a way that the whole formula is true.The SAT problem is oneOf the most important combinatorial optimization problems, in particular the 3-SAT Problem is the first NP-Complete problem.In order to test sat solving algorithms isNecessary to generate hard sat instance, in this paper we address the constructionAnd testing of HyperSAT a sat instance generator based on the concept of hypergraphs.
Combining implicit polynomials and geometric features for hand recognition
Authors: Cenker Oden, Aytul Ercil, Burak Buke
Venue: Pattern Recognition Letters (2003)

Person identification and verification using biometric methods is getting more and more important in today's information society. Hand recognition is a promising biometric because of its simplicity and fairly good performance of verification. In this work, implicit polynomials, which have proven to be very successful in object modeling and recognition, have been proposed for recognizing hand shapes and the results are compared with existing methods.
An Adaptive Recommendation System without Explicit Acquisition of User Relevance Feedback
Authors: Cyrus Shahabi, Yi-Shin Chen
Venue: Distributed and Parallel Databases (2003)

Recommendation systems are widely adopted in e-commerce businesses for helping customers locate products they would like to purchase. In an earlier work, we introduced a recommendation system, termed Yoda, which employs a hybrid approach that combines collaborative filtering (CF) and content-based querying to achieve higher accuracy for large-scale Web-based applications. To reduce the complexity of the hybrid approach, Yoda is structured as a tunable model that is trained off-line and employed for real-time recommendation on-line. The on-line process benefits from an optimized aggregation function with low complexity that allows the real-time aggregation based on confidence values of an active user to pre-defined sets of recommendations. In this paper, we extend Yoda to include more recommendation sets. The recommendation sets can be obtained from different sources, such as human experts, web navigation patterns, and clusters of user evaluations. Moreover, the extended Yoda can learn the confidence values automatically by utilizing implicit users' relevance feedback through web navigations using genetic algorithms (GA). Our end-to-end experiments show while Yoda's complexity is low and remains constant as the number of users and/or items grow, its accuracy surpasses that of the basic nearest-neighbor method by a wide margin (in most cases more than 100%). The experimental results also indicate that the retrieval accuracy is significantly increased by using the GA-based learning mechanism.
Automatic alarm correlation for fault identification
Authors: I. Rouvellou, G. W. Hart
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

In communication networks, a large number of alarms exist to signal any abnormal behavior of the network. As network faults typically result in a number of alarms, correlating these different alarms and identifying their source is a major problem in fault management. The alarm correlation problem is of major practical significance. Alarms that have not been correlated may not only lead to significant misdirected efforts, based on insufficient information, but may cause multiple corrective actions (possibly contradictory) as each alert is handled independently. The paper proposes a general framework to solve the alarm correlation problem. The authors introduce a new model for faults and alarms based on probabilistic finite state machines. They propose two algorithms. The first one acquires the fault models starting from possibly incomplete and incorrect date. The second one correlates alarms in the presence of multiple faults and noisy information. Both algorithms have polynomial time complexity, use an extension of the Viterbi algorithm to deal with the corrupted data, and can be implemented in hardware. As an example, they are applied to analyse faults using data generated by the ANS (Advanced Network and Services, Inc.)/NSF T3 network.
Implicit Multigrid Method for Modeling Turbulent Diffusion Flames with Detailed Chemistry
Authors: C. Liao, Z. Liu, C. Liu
Venue:  (1994)

An implicit multigrid time-stepping technique is applied to the turbulent diffusion methane-air combustion with detailed chemistry in a sudden-expansion combustor. The chemical reaction model is assumed to have 16 species and 45 finite-rate, reversible reaction steps. The \kappa - \eps turbulence model and the algebraic correlation model are applied to close the time-average Navier-Stokes equations and the species equations. The computation requires about 80 time steps to reduce the residual by 4 orders of magnitude on a 34 x 34 grid, showing the convergence rate is much faster than conventional iterative methods. Both 2-D and 3-D, laminar and turbulent diffusion flames are simulated. Computational results with detailed chemistry are exhibited and some of them are compared with experimental data. Qualitative agreement between the computational results and experimental results is observed.
Self-Migrating Threads for Multi-Agent Applications
Authors: Naoya Suzuki, Munehiro Fukuda, Lubomir F. Bic
Venue: Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing (1999)

We propose ``self-migrating threads'' as a new cluster computing paradigm for multi-agent applications, which can be viewed as the interactions among autonomous computing entities, each having its own objectives, behavior, and local information in a synthetic world. Self-migrating threads have both navigational autonomy of mobile agents and fine computation granularity of threads. They are also given the capability to construct system-wide logical networks, representing synthetic worlds. With those aspects, we expect that self-migrating threads provide multi-agent applications with good programmability and performance. We have designed the functionality of self-migrating threads and implemented a low-level migration library. In this paper, we discuss the feasibility of our design by considering the implementation techniques and basic migration performance.
Designing for Print
Authors: Charles Conover
Venue:  (2003)

:A highly visual guide to designing for print media, from project inception to final production Packed with hundreds of informative, illustrated examples, Designing for Print demonstrates methods and techniques for creating top-quality print media projects. Carefully chosen real-world design exercises and problem-solving projects offer hands-on practice to help readers achieve strong designs. This easy-to-use guide presents software tricks and tips, along with discussions on scanning, output, and other issues related to digital design for print and electronic media. Up-to-date coverage includes useful skills for getting the most out of the latest technologies. Dozens of sidebars and step-by-step descriptions walk readers through the design process in the same order actual projects are implemented: Planning design Designing with type Designing with photographs Advanced typography Designing for Print gives a peerless introduction to designing all types of print projects. Author Biography: CHARLES CONOVER is a full-time professor of graphic design at Long Island University in New York. During his career, he has worked as a designer at Ziff-Davis Publishing and as an associate art director of PC Magazine. In addition to his design background, his paintings and prints have been exhibited in New York City galleries and museums for the past fifteen years. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Object-Oriented Design of Adaptive Multicast Communications
Authors: Weiming Zhang, Weijia Jia
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

Multicast (group) communications have been widely recognized by current research and industry. Multicast is very useful for various network applications such as distributed (replicated) database, video/audio conference, information distribution and server locations etc. But design and implementation of such multicast communication systems in networks are complicated tasks, especially when quality of services (QoS) of applications such as real-time and reliability are desired. To quick design and implement multicast communication, good tools are crucial and must be facilitated. This paper presents a novel object-oriented (O-O) QoS driven approach for the quick design and prototyping of multicast communication systems under certain QoS requirements for multicast message transmission and receptions such as real-time, total ordering, atomicity and fault-tolerance etc.
Reactive-Process Programming and Distributed Discrete-Event Simulation
Authors: Wen Su
Venue:  (1989)

The same forces that spurred the development of multicomputers - the demand for better performance and economy - are driving the evolution of multicomputers in the direction of more abundant and less expensive computing nodes - the direction of fine-grain multicomputers. This evolution in multicomputer architecture derives from advances in integrated circuit, packaging, and message-routing technologies, and carries far-reaching implications in programming and applications. This thesis pursues that trend with a balanced treatment of multicomputer programming and applications. First, a reactive- process programming system - Reactive-C - is investigated; then, a model application - discreteevent simulation - is developed; finally, a number of logic-circuit simulators written in the Reactive-C notation are evaluated. One difficulty in multicomputer applications is the inefficiency of many distributed algorithms compared to their sequential counterparts. When better formulations are developed, they often scale poorly with increasing numbers of nodes, and their beneficial effects eventually vanish when many nodes are used. However, rules for programming are quite different when nodes are plentiful and cheap: The primary concern is to utilize all of the concurrency available in an application, rather than to utilize all of the computing cycles available in a machine. We have shown in our research that it is possible to extract the maximum concurrency of a simulation subject, even one as difficult as a logic circuit, when one simulation element is assigned to each node. Despite the initial inefficiency of a straightforward algorithm, as the the number of nodes increases, the computation time decreases linearly until there are only a few elements in each node. We conclude by suggesting a, technique to further increase the available concurrency when there are many more nodes than simulation elements.
Trillium: a model for the assessment of telecom software system development and maintenance capability
Authors: A. April, F. Coallier
Venue: Proceedings of the 2nd IEEE Software Engineering Standards Symposium (1995)

Since 1982 Bell Canada has been developing a model to assess the software development process of existing and prospective suppliers as a means to minimize the risks involved and ensure both the performance and timely delivery of software systems purchased. This paper presents the revised Trillium model (version 3.0). The basis of the process assessment models for software relies on benchmarking, e.g. comparing your practices with the best and successful organizations. It is also a basic tool that you will find in the TQM literature. For software assessment we have used initially two levels of benchmarks to develop the model: professional, national and international standards; and comparisons with other organizations in the same market segment. The software assessment model should therefore map to existing engineering standards as well as quality standards. It should also provide an output that can be used easily to benchmark against "best-in-class" organizations.
On the fractal beauty of bin packing
Authors: L. Epstein, S. Seiden, Rob Stee
Venue:  (2001)

In the variable-sized online bin packing problem, one has to assign items to bins one by one. The bins are drawn from some fixed set of sizes, and the goal is to minimize the sum of the sizes of the bins used. We present the first unbounded space algorithms for this problem. We also show the first lower bounds on the asymptotic performance ratio. The case where bins of two sizes, 1 and $\alpha \in (0,1)$, are used is studied in detail. This investigation leads us to the discovery of several interesting fractal-like curves.
Dynamic Generation of Discrete Random Variates
Authors: Jeffrey S Vitter, Wen Ni
Venue:  (1992)

We present and analyze an efficient new algorithm for generating a random variate distributed according to a dynamically changing set of weights. The algorithm can generate the random variate and update a weight each in $O(log^* K)$ expected time. (For all feasible values of $K$, $log^* K$ is at most 5.) The $O(log^* K)$ expected update time is amortized; in the worst-case the expected update time is $O(2^(log^* K))$. The algorithm is simple, practical, and easy to implement.
Benchmarking Real-Time Distributed Object Management Systems for Evolvable and Adaptable Command and Control Applications
Authors: Richard Freedman, John Maurer, Steve Wohlever, Bhavani Thuraisingham, Victor Wolfe, Michael Milligan
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

This paper describes benchmarking for evolvable and adaptable real-time command and control systems
A World Wide Supermarket Scheme Using Rights Trading System
Authors: Ko Fujimura, Masayuki Terada, Jun Sekine
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

This paper presents a new electronic commerce scheme that provides consumers with a one-stop checkout service for the purchase of a set of items from multiple autonomous shops. In this scheme, a consumer collects a transaction ticket, a specific form of digital-right, from each shop for each purchase representing the right to said purchase, and transfers the collected tickets to a check-out agent when the customer finally decides to complete all purchases selected. This approach allows for the autonomy of inventory/reservation databases in each shop without requiring them to provide transaction control interfaces, e.g., prepare, commit, and rollback, which are traditionally required to avoid the situation in which an item put into a shopping cart not exist at the check-out phase. It also enables the redemption of digital coupons or gift certificates together with transaction tickets at the same time in a uniform manner.
Efficient Load Balancing in Interconnected LANs Using Group Communication
Authors: Chi-Chung Hui, Samuel T. Chanson
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

This paper investigates the use of group communication to improve the efficiency of load balancing in interconnected LANs.Conventional load balancing techniques usually assume point-to-point connections among the computers and typically work on a single LAN only. This may waste network bandwidth and lengthen the load balancing time in LANs that support group communication such as the Ethernet. To tackle this problem a two-level algorithm is proposed in this paper. At the LAN level, all computers in a LAN maintain loading information in the entire LAN using a globally ordered group channel. The workload in the different LANs is balanced by moving load from the overloaded LANs to the underloaded ones. It is proved that the proposed algorithm converges to the state of global balance geometrically. Experimental results show that the algorithm reduces load balancing time and network utilization significantly compared to the single level algorithm without group communication.
Uncertainty Handling and Quality Assesment in Data Mining
Authors: Michalis Vazirgiannis, Maria Halkidi, Dimitrios Gunopulos
Venue:  (2003)

:"Uncertainty Handling and Quality Assessment in Data Mining provides an introduction to the application of these concepts in Knowledge Discovery and Data Mining. It reviews the state-of-the-art in uncertainty handling and discusses a framework for unveiling and handling uncertainty. Coverage of quality assessment begins with an introduction to cluster analysis and a comparison of the methods and approaches that may be used. The techniques and algorithms involved in other essential data mining tasks, such as classification and extraction of association rules, are also discussed together with a review of the quality criteria and techniques for evaluating the data mining results." "This book presents a general framework for assessing quality and handling uncertainty, which is based on tested concepts and theories. This framework forms the basis of an implementation tool, 'UMiner' which is introduced to the reader for the first time." Aimed at IT professionals involved with data mining and knowledge discovery, the work is supported with case studies from epidemiology that illustrate how the tool works in 'real-world' data mining projects. The book would also be of interest to final year undergraduates or post-graduate students looking at databases, algorithms, artificial intelligence and information systems particularly with regard to uncertainty and quality assessment.
Word Sense Disambiguation Using Numerical Constraint Satisfaction
Authors: Julia Komissarchik, Claire Cardie
Venue:  (1997)

In this paper we present a description and evaluation of a word sense disambiguation mechanism that is an extension of the work by Ide and Veronis. The mechanism''s underlying approach is a numerical constraint satisfaction algorithm applied to the network built using an on-line dictionary. In this work we aim to duplicate the original results and extend the method to large-scale applications. To determine the scalability of the approach, we evaluate the mechanism on 20 ambiguous words taken in their contexts of different size from the Brown corpus. We offer a discussion of encountered difficulties and describe several possible directions that can be investigated to improve the mechanism''s performance and scalability.
Recent Developments in the NL-Soar Garden Path Theory
Authors: Richard L. Lewis
Venue:  (1992)

This report describes a theory of garden path phenomena that is emerging from work on NL-Soar, a computational model of language comprehension embedded within the Soar architecture. The theory is constrained by a corpus of two kinds of sentences: garden paths (GP), which reveal the limitations of human comprehension in dealing with local ambiguities, and non-garden-paths (NGP), which reveal its power in handling local ambiguities. NL-Soar is a single-path comprehender with a limited capacity to repair misanlysed input. A space of repair mechanisms is explored by hand simulation on the corpus. The importance of phonology and plausible search control is established, leading to a theory up to 95% accurate (76% worst case) in predicting performance on 37 distinct GP and NGP types.
Multi-Lingual Cascading Text Compressors for WWW
Authors: Chi-Hung Chi
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

Global sharing and distribution of information on Internet result in a great demand for efficient multi-lingual text compression for web server and proxy implementation. Current text compressors such as Huffman coding, Lempel-Ziv (LZ) variants, and LZ-Huffman cascading fail to perform efficiently because of the mismatched character sampling size and the large character set of the multilingual languages. Our previous research [7,8] already showed that better compression ratio could be obtained by re-adjusting the character-sampling rate.In this paper, we investigate the cascading of LZ variants to Huffman coding for multilingual documents. Two basic approaches, static and dynamic dictionaries, are proposed. Techniques for reducing the dictionary overhead are also suggested. Based on our multi-lingual corpus, our adaptive cascading scheme can perform better than the well-known cascading compressor, gzip, by an average of about 20%.