ppxscal/embedding_network huggingface dataset:
The BINAC: A Case Study in the History of Technology
Authors: Nancy Stern
Venue: IEEE Annals of the History of Computing (1979)

The BINAC, short for Binary Automatic Computer, was developed by John Presper Eckert, Jr. and John William Mauchly during the years 1947-1949 under a contract with the Northrop Aircraft Corporation. It became the first operational stored program computer completed in the United States. This paper provides an historical analysis of the BINAC and the issues relating to its development. It also considers factors relating to the Eckert-Mauchly Computer Corporation and its ultimate acquisition by Remington Rand. 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
Fast algorithms for computing statistics under interval uncertainty, with applications to computer science and to electrical and computer engineering
Authors: Vladik Kreinovich
Venue:  (2007)

In many engineering applications, we have to combine probabilistic and interval uncertainty. For example, in environmental analysis, we observe a pollution level x(t) in a lake at different moments of time t, and we would like to estimate standard statistical characteristics such as mean, variance, autocorrelation, correlation with other measurements. In environmental measurements, we often only measure the values with interval uncertainty. We must therefore modify the existing statistical algorithms to process such interval data.In this dissertation, we will provide a survey of known algorithms for computing various statistics under interval uncertainty and their computational complexity, a description of new algorithms, and the applications of the new algorithms, including applications to the seismic inverse problem in geosciences, to chip design in computer engineering, and to radar data processing.
Large-Scale Fluid-Structure Interaction Simulations
Authors: Rainald Lohner, Juan Cebral, Chi Yang, Joseph D. Baum, Eric Mestreau, Charles Charman, Daniele Pelessone
Venue: Computing in Science and Engineering (2004)

Combining computational-science disciplines, such as in fluid-structure interaction simulations, introduces a number of problems. The authors offer a convenient and cost-effective approach for coupling computational fluid dynamics (CFD) and computational structural dynamics (CSD) codes without rewriting them.
Structural Tractability of Propagated Constraints
Authors: Martin J. Green, Christopher Jefferson
Venue: Proceedings of the 14th international conference on Principles and Practice of Constraint Programming (2008)

Modern constraint solvers do not require constraints to be represented using any particular data structure. Instead, constraints are given as black boxes known as propagators. Propagators are given a list of current domains for variables and are allowed to prune values not consistent with these current domains.Using propagation as the only primitive operation on constraints imposes restrictions on the operations that can be performed in polynomial time. In the extensional representation of constraints (so-called positive table constraints) join and project are primitive polynomial-time operations. This is not true for propagated constraints.The question we pose in this paper is: If propagation is the only primitive operation, what are the structurally tractable classes of constraint programs (whose instances can be solved in polynomial time)?We consider a hierarchy of propagators: arbitrary propagators, whose only ability is consistency checking; partial assignment membership propagators, which allow us to check partial assignments; and generalised arc consistency propagators, the strongest form of propagator.In the first two cases, we answer the posed question by establishing dichotomies. In the case of generalised arc consistency propagators, we achieve a useful dichotomy in the restricted case of acyclic structures.
Unbiased Stratification of Left Ventricles
Authors: Rajagopalan Srinivasan, K. S. Shriram, Srikanth Suryanarayanan
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

Image based quantitative stratification of the Left Ventricles (LV) across a population helps in unraveling the structure-function symbiosis of the heart. An unbiased, reference less grouping scheme that automatically determines the number of clusters and a physioanatomically relevant strategy that aligns the intra cluster LV shapes would enable the robust construction of pathology stratified cardiac atlas. This paper achieves this hitherto elusive stratification and alignment by adapting the conventional strategies routinely followed by clinicians. The individual LV shape models (N=127) are independently oriented to an "attitudinally consistent orientation" that captures the physioanatomic variations of the LV morphology. Affinity propagation technique based on the automatically identified inter-LV_landmark distances is used to group the LV shapes. The proposed algorithm is computationally efficient and, if the inter cluster variations are linked to pathology, could provide a clinically relevant cardiac atlas.
A Contourlet-Based Face Detection Method in Color Images
Authors: Hedieh Sajedi, Mansour Jamzad
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

The first step of any face processing system is detecting the location in images where faces are present. In this paper we present an upright frontal face detection system based on the multi-resolution analysis of the face. In this method firstly, skin-color information is used to detect skin pixels in color images; then, the skin-region blocks are decomposed into frequency sub-bands using contourlet transform. Features extracted from sub-bands are used to detect face in each block. A multi-layer perceptrone (MLP) neural network was trained to do this classification. To decrease false positive detection we use eyes and lips template matching. These templates achieved by averaging corresponding parts in LL sub-band of contourlet decomposition. Experimental results show that the proposed algorithm is effective and efficient in detecting frontal faces in color images.
Global-to-Local Oriented Rapid Scene Perception
Authors: Le Dong, Ebroul Izquierdo
Venue: Proceedings of the 2008 Ninth International Workshop on Image Analysis for Multimedia Interactive Services (2008)

An approach for rapid scene perception from global layout to local features is presented. The representation of a complex scene is initially built from a collection of global features from which properties related to the spatial layout of the scene and its semantic category can be estimated. The rapid perception of natural scenes relies partly on a global estimation of the features contained in the scene. Further analysis on the local essential areas is deployed on the basis. Such kind of integrated model guarantees the interactive processing between local and global features, thus enabling low-level features to initiate scene perception and categorization efficiently.
Transitioning to OOP/Java -- A Never Ending Story
Authors: Jürgen Börstler, Marie Nordström, Lena Kallin Westin, Jan-Erik Moström, Johan Eliasson
Venue: Reflections on the Teaching of Programming: Methods and Implementations (2008)

Changing the introductory programming course from a traditional imperative model to an object-oriented model is not simply a matter of changing compilers and syntax. It requires a profound change in course materials and teaching approach to be successful. We have been working with this transition for almost ten years and have realized that teaching object-oriented programming is not as simple or "natural" as some proponents claim. In fact, it has proven difficult to convey to the students the advantages and methodologies associated with object-oriented programming. To help ourselves and others in a transition like this we have developed a number of "course design principles" as well as teaching methods and examples that have proven to have positive influence on student learning outcome.
Summa: This Is Not a Demo
Authors: Gitte Behrens, Mikkel Kamstrup Erlandsen, Toke Eskildsen, Bolette Ammitzbøll Jurik, Dorete Bøving Larsen, Hans Lauridsen, Michael Poltorak Nielsen, Jørn Thøgersen, Mads Villadsen
Venue: Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries (2008)

The Summa search system is a fast, scalable, modular, open source search system, which can integrate all types of library metadata and full text. The Summa search system is based on user studies and on librarian expertise in formats and metadata. Summa is an open and modular design. Summa offers modules for faceted browsing, automated cluster extraction and a flexible user interface among others. The in-house Summa production system at The State and University Library in Denmark searches a corpus of 8 million records. The Summa search system version 1.0 to be released in the autumn 2008 is designed to scale to hundreds of millions.
The Composite Sensing of Affect
Authors: Gordon Mcintyre, Roland Göcke
Venue: Affect and Emotion in Human-Computer Interaction: From Theory to Applications (2008)

This paper describes some of the issues faced by typical emotion recognition systems and the need to be able to deal with emotions in a natural setting. Studies tend to ignore the dynamic, versatile and personalised nature of affective expression and the influence that social setting, context and culture have on its rules of display. Affective cues can be present in multiple modalities and they can manifest themselves in different temporal order. Thus, fusing the feature sets is challenging. We present a composite approach to affective sensing. The term composite is used to reflect the blending of information from multiple modalities with the available semantic evidence to enhance the emotion recognition process.
Bilingual Text Classification
Authors: Jorge Civera, Elsa Cubel, Enrique Vidal
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

Bilingual documentation has become a common phenomenon in official institutions and private companies. In this scenario, the categorization of bilingual text is a useful tool. In this paper, different approaches will be proposed to tackle this bilingual classification task. On the one hand, three finite-state transducer algorithms from the grammatical inference framework will be presented. On the other hand, a naive combination of smoothed n-gram models will be introduced. To evaluate the performance of bilingual classifiers, two categorized bilingual corpora of different complexity were considered. Experiments in a limited-domain task show that all the models obtain similar results. However, results on a more open-domain task denote the supremacy of the naive approach.
Analysis of QoS routing in MPLS network in Kosova using fuzzy logic
Authors: Arianit Maraj, Besnik Shatri, Ilir Limani, Agim Abdullahu, Skënder Rugova
Venue: Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation (2008)

One of the main issues for offering end-to-end QoS in a network is how to select feasible paths that meet QoS requirements. In general, finding paths that meet QoS requirements is not an easy task and is called "QoS routing". The complexity of the networks that offer multimedia applications requires the consideration of multiple constraints for routing decision. This paper treats QoS routing problems in IP/MPLS networks using fuzzy logic. A number of different algorithms have been proposed for solving this problem. Most of these algorithms are not efficient because of their complexity and high cost. In this paper we propose Fuzzy QoS (FQOS) algorithm, for solving such a problem in MPLS network in Kosova. The performance of FQOS algorithm is evaluated using simulation and is compared to existing routing algorithm - CSPF.
E-Discovery: Identifying and Mitigating Security Risks during Litigation
Authors: Faith M. Heikkila
Venue: IT Professional (2008)

When producing electronically stored information (ESI) in response to lawsuits, businesses face several security risks as well as legal requirements they must satisfy. Customized document management programs and e-discovery policies are key tools in protecting against inadvertent disclosure as well as meeting business and legal needs.
Meshless cubature over the disk using thin-plate splines
Authors: Alessandro Punzi, Alvise Sommariva, Marco Vianello
Venue: Journal of Computational and Applied Mathematics (2008)

In some recent papers, the construction of meshless interpolatory cubature formulas using radial basis functions has been studied. In particular, thin-plate splines allow us to conveniently use Green's formula and give good results on scattered samples of small/moderate size over polygons. Here, we discuss the extension to meshless cubature over the disk and its practical implementation.
Multiresolution of Clinical EEG Recordings Based on Wavelet Packet Analysis
Authors: Lisha Sun, Guoliang Chang, Patch J. Beadle
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

Method for extracting the specified rhythms of clinical electroencephalogram (EEG) is proposed using the wavelet packet decomposition. Based on the ability of accurately resolving the signal into desired time-frequency components, EEG signals are preprocessed and decomposed into a series of rhythms for many clinical applications. Specified dynamic EEG rhythms can be accurately filtered with designed wavelet structure. In addition, we present a wavelet packet entropy method for processing of EEG signal. Both relative wavelet packet energy and wavelet packet entropy are presented as the quantitative parameter to measure the complexity of the EEG signal. Several experiments with real EEG signals are carried out to show that the proposed method excels the common discrete wavelet decomposition. The presented procedure can isolate specific EEG rhythms accurately and is also regarded as an efficient method for analyzing non-stationary signals in practice.
BusiROLE: A Model for Integrating Business Roles into Identity Management
Authors: Ludwig Fuchs, Anton Preis
Venue: Proceedings of the 5th international conference on Trust, Privacy and Security in Digital Business (2008)

The complexity of modern organisations' IT landscapes has grown dramatically over the last decades. Many enterprises initiate role projects in order to reorganise their access structures based on an organisation-wide Identity Management Infrastructure (IdMI). This paper surveys role models and related literature and identifies different role properties. It shows that current role models are not feasible for their usage in IdMIs. By implementing one single type of role they fail to take business requirements and different role perceptions into account. This paper improves the current situation by developing busiROLE, a role model that integrates various types of roles, fulfilling business- as well as IT requirements, and is hence usable in IdMIs.
Engineering a Sustainable World
Authors: Bob Colwell
Venue: Computer (2004)

The more important a technology becomes, the more its users take it for granted. 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
Task-space PD Control of Robot Manipulators: Unified Analysis and Duality Property
Authors: C.C. Cheah
Venue: International Journal of Robotics Research (2008)

Task-space regulation of robots is classified into two basic approaches, namely transpose Jacobian regulation and inverse Jacobian regulation. This paper shows that, despite the distinct differences between inverse Jacobian and transpose Jacobian regulation problems, there is a unified approach for the analysis and design of the transpose Jacobian and inverse Jacobian PD controllers for non-redundant robots. Based on the unified analysis, we show that there is a fundamental property in the task-space regulation problem, namely the duality property. The results on the duality property show that the transpose Jacobian matrix can be replaced by the inverse Jacobian matrix and vice versa. The two basic transformations, the transpose Jacobian and the inverse Jacobian, are said to be dual. The task-space PD controllers are implemented on an industrial robot and experiment results are presented.
A New Paradigm for Prioritizing Multiple Class Services in Optical Burst Switched Networks
Authors: Aresh Dadlani, Ali Rajabi, Ahmad Khonsari
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

Quality of service (QoS) differentiation within the optical infrastructure is under constant development due to the direct impact of the ever-rising demand for time-critical and multimedia applications in the Internet. In this paper, we propose an efficient prioritized hybrid model based on two eminent approaches namely, resource-reservation and extra offset-time based QoS that have already been investigated in the literature. We show that this model guarantees better performance with increase in number of traffic classes. We also simulate a complete topologically optical network bearing Poisson traffic to assess the performance of the proposed model as compared with the two aforementioned approaches.
Fuzzy systems simulation: models, foundations, and systems development
Authors: Kevin D. Reilly
Venue:  (2007)

Simulations of modeled systems are effective tools for evaluating system attributes; fuzzy logic provides for simulation of systems with inherent uncertainties. This research to advance simulation of fuzzy systems involves several studies in a planned sequence. Continuous fuzzy system modeling activities constitute a first stage of research action, a natural flow from earlier work on modeling discrete fuzzy systems; the notion of using crisp simulation to carry out fuzzy computations is at the heart of the work. This activity requires choosing tools and problems with which to demonstrate feasibility and broad applicability of the approach. Some fundamental issues underlying the work provoke new departures for the second stage consisting of two substages. The first substage involves a new fuzzy number (FN) concept, that of a B&eacute;zier generated FN (BGFN). These numbers were conceived at a very basic level to illustrate that the approach we take is not rooted in or confined to simple triangular FNs (TFN) that are often used in modeling. Their potential lies in both previous discrete simulation and in continuous simulation. The second substage of continuous modeling pursues these numbers in relation to random FNs. The second stage includes these pursuits in parallel with investigations of sequences of random numbers (as they are required for fuzzy modeling). Sequences must be able to pass rigorous statistical inspection, for which we offer some new ideas, at least in the fuzzy domain. A final phase of work, a third stage, from software cost estimation's (SCE) COnstructive COst MOdel (COCOMO), concerns f-COCOMO(fuzzy COCOMO). Our f-COCOMO studies may be viewed as software engineering (SE) reflections on the entire modeling effort, but a broader tact is taken; that is, inherited from CO-COMO's broad perspective. Advances in fuzzy treatments of COCOMO open a new fuzzy modeling frontier relating to cost systems analysis. In our overview of the entire effort, we note the progression from discrete to continuous models, and address some theoretical and mathematical foundations as they arise. We also note that this progression that culminates in fundamental SE contributions, parallels for fuzzy systems, a similar workflow found in crisp systems.
Low-Cost Adaptive Data Prefetching
Authors: Luis M. Ramos, José Luis Briz, Pablo E. Ibáñez, Víctor Viñals
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

We explore different prefetch distance-degree combinations and very simple, low-cost adaptive policies on a superscalar core with a high bandwidth, high capacity on-chip memory hierarchy. We show that sequential prefetching aggressiveness can be properly tuned at a very low cost to outperform state-of-the-art hardware data prefetchers and complex filtering mechanisms, avoiding performance losses in hostile applications and keeping the pressure of the prefetching on the cache low, turning it out into a real implementation option for current processors.
Computational Modeling of Circadian Rhythms in Suprachiasmatic Nucleus Neurons
Authors: Hyoungkyu Kim, Jaeseung Jeong
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

The suprachiasmatic nucleus(SCN) is a self-sustaining circadian rhythm generator in mammals. SCN neurons exhibit irregular and complex firing activity, but their firing rates display well-defined deterministic behavior with a periodicity of 24 hours. Their underlying mechanisms are still unclear. In this study, we aim to develop the computational model using NEURON, a software package for biological neuron simulation, to examine channel contributions to circadian rhythms. We found that SCN neurons produced circadian rhythms of firing activity through an interplay of various channels, including the potassium and sodium channels.
Estimation of Dense, Non-rigid Motion Fields from a Multi-camera Array Using a Hierarchical Mixture Model
Authors: Adam Bowen, Andrew Mullins, Roland Wilson, Nasir Rajpoot
Venue: Proceedings of the 5th international conference on Articulated Motion and Deformable Objects (2008)

The problem of modelling objects of arbitrary complecity for video based rendering has been much studied in recent years, with the growing interest in `free viewpoint' video and similar applications. Typical approaches fall into two categories: those which approximate surfaces from dense depth maps obtained by generalisations of stereopsis methods and those which employ an explicit geometric representation such as a mesh. While the former has generality with respect to geometry, it is inevitably limited in terms of viewpoint; the latter, on the other hand, sacrifices generality of object geometry for freedom to pick an arbitary viewpoint. The purpose of the work reported here is to bridge this gap in object representation, by employing a surface element model, but one which is freed from the restrictions of a mesh. Estimation of the model and tracking it through time from multiple cameras is achieved by novel multiresolution stochastic simulation methods. After a brief outline of the method, its use in modelling human motions using data from the Warwick multi-camera studio is presented to illustrate its effectiveness compared to the current state of the art.
Text Retrieval Oriented Auto-construction of Conceptual Relationship
Authors: Yi Hu, Ruzhan Lu, Yuquan Chen, Bingzhen Pei
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

The dependence analysis is usually the key for improving the performance of text retrieval. Compared with the statistical value of a conceptual relationship, the recognition of relation type between concepts is more meaningful. In this paper, we explored a bootstrapping method for automatically extracting semantic patterns from a large-scale corpus to identify the geographical "is part of" relationship between Chinese location concepts. The experiments showed that the pattern set generated by our method achieves higher coverage and precision than DIPRE does.