ppxscal/embedding_network huggingface dataset:
Robust PCA for skewed data and its outlier map
Authors: Mia Hubert, Peter Rousseeuw, Tim Verdonck
Venue: Computational Statistics Data Analysis (2009)

The outlier sensitivity of classical principal component analysis (PCA) has spurred the development of robust techniques. Existing robust PCA methods like ROBPCA work best if the non-outlying data have an approximately symmetric distribution. When the original variables are skewed, too many points tend to be flagged as outlying. A robust PCA method is developed which is also suitable for skewed data. To flag the outliers a new outlier map is defined. Its performance is illustrated on real data from economics, engineering, and finance, and confirmed by a simulation study.
What can brain researchers learn from computer engineers and vice versa?
Authors: Dmitri "Mitya" Chklovskii
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

The human brain is a network containing a hundred billion neurons, each communicating with several thousand others. As the wiring for neuronal communication draws on limited space and energy resources, evolution had to optimize their use. This principle of minimizing wiring costs, similar to that in computer design, explains many features of brain architecture, including placement and shape of many neurons. However, the shape of some neurons and their synaptic properties remained unexplained. This led us to the principle of maximization of brain's ability to store information. Combination of the two principles provides a systematic view of brain architecture, necessary to explain brain function. It would be interesting to see whether advances in understanding brain function will make impact on computer design. 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
Heterochrony and artificial embryogeny: A method for analyzing artificial embryogenies based on developmental dynamics
Authors: Artur Matos, Reiji Suzuki, Takaya Arita
Venue: Artificial Life (2009)

Artificial embryogenies are an extension to evolutionary algorithms, in which genotypes specify a process to grow phenotypes. This approach has become rather popular recently, with new kinds of embryogenies being increasingly reported in the literature. Nevertheless, it is still difficult to analyze and compare the available embryogenies, especially if they are based on very different paradigms. We propose a method to analyze embryogenies based on growth dynamics, and how evolution is able to change them (heterochrony). We define several quantitative measures that allow us to establish the variation in growth dynamics that an embryogeny can create, the degree of change in growth dynamics caused by mutations, and the degree to which an embryogeny allows mutations to change the growth of a genotype, but without changing the final phenotype reached. These measures are based on an heterochrony framework, due to Alberch, Gould, Oster, & Wake (1979 Size and shape in ontogeny and phylogeny, Paleobiology, 5(3), 296--317) that is used in real biological organisms. The measures are general enough to be applied to any embryogeny, and can be easily computed from simple experiments. We further illustrate how to compute these measures by applying them to two simple embryogenies. These embryogenies exhibit rather different growth dynamics, and both allow for mutations that changed growth without affecting the final phenotype.
Body sensor networks based sensor fusion for cardiovascular biosignal predictions
Authors: Huaming Li, Jindong Tan
Venue: Proceedings of the 2nd International Workshop on Systems and Networking Support for Health Care and Assisted Living Environments (2008)

A Multivariate Autoregressive (MAR) model based sensor fusion technique is developed in this work to improve the reliability and accuracy of cardiovascular biosignal prediction by taking advantages of combining sensory data from heterogeneous biosensors in a network. The importance and potential applications of sensor fusion in body sensor networks are introduced. Real-world data from MIT-BIH multi-parameter database MIMIC (Multi-parameter Intelligent Monitoring for Intensive Care) is used to verify the MAR model performance. The effects of model order number and involved biosignal number are studied. The experiments also show that ECG signals can be partially recovered from other biosignals even if the ECG input is completely missing.
Principled Hybrid Systems: Theory and Applications (Physta)
Authors: Stefanos Kollias, Frederic Piat
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Systematic principles for integrating symbolic and subsymbolic processing will be developed in the project. Key aims are to ensure that the resulting total hybrid system retains desirable properties of both processing levels. On the one side the signal processing abilities, robustness and learning capability of neural networks should be preserved. On the other side advantage should be taken of the ability of rule-based systems to exploit high level knowledge and existing algorithms and to explain (to a user) why conclusions were reached in particular cases. The methodologies developed in the project are tested in a challenging multimedia application related to human computer interaction, which is recognition of emotion based on both voice and visual cues. Low level features are extracted from signals using neural networks and subsequent formulation of rules provides a conceptual framework, substantial for emotion analysis.This work was done under the TMR program, contract number ERB4061PL970238, starting 9-01-1998, ending 8-01-2001. Project participants are: ICCS-NTUA (coordinator), King's College London, Katholieke Universiteit Nijmegen, University of Milan and Queen's University of Belfast.
Dynamic Source Routing versus Greedy Routing in a Testbed Sensor Network Deployment
Authors: Hannes Frey, Kristen Pind
Venue: Proceedings of the 6th European Conference on Wireless Sensor Networks (2009)

We present our findings of an empirical performance comparison between dynamic source routing and greedy routing in a testbed wireless sensor network deployment. The environment is based on a grid ranging between 2 &times;2 to 7 &times;7 battery operated Tmote Sky sensor nodes. We briefly sketch the protocol implementations and the experimental setup used in this work. We also discuss how we managed such larger set of nodes in a convenient way. We hope that some of the lessons we learnt may be useful to others doing such kind of testbed experiments as well. Finally, we discuss our findings from the measurement data we have gathered.
Hybrid Particle Swarm Optimization Based on Thermodynamic Mechanism
Authors: Yu Wu, Yuanxiang Li, Xing Xu, Sheng Peng
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

This paper describes a thermodynamic particle swarm optimizer (TDPSO) based on the simple evolutionary equations. Inspired by the minimum free energy principle of the thermodynamic theoretics, a rating-based entropy (RE) and a component thermodynamic replacement (CTR) rule are implemented in the novel algorithm TDPSO. The concept of RE is utilized to systemically measure the fitness dispersal of the swarm with low computational cost. And the fitness range of all particles is divided into several ranks. Furthermore, the rule CTR is applied to control the optimal process with steeply fast convergence speed. It has the potential to maintain population diversity. Compared with the other improved PSO techniques, experimental results on some typical minimization problems show that the proposed technique outperforms other algorithms in terms of convergence speed and stability.
Introduction to the Maximum Solution Problem
Authors: Peter Jonsson, Gustav Nordh
Venue: Complexity of Constraints: An Overview of Current Research Themes (2008)

This paper surveys complexity and approximability results for the Maximum Solution (Max Sol) problem. Max Sol is an optimisation variant of the constraint satisfaction problem. Many important and well-known combinatorial optimisation problems are instances of Max Sol: for example, Max Sol restricted to the domain {0,1} is exactly the Max Ones problem (which, in turn, captures problems such as Independent Set and 0/1 Integer Programming). By using this relationship, many different problems in logic, graph theory, integer programming, and algebra can be given a uniform treatment. This opens up for new ways of analysing and solving combinatorial optimisation problems.
Intelligent human interface based on mental cloning-based software
Authors: Hamido Fujita, Jun Hakura, Masaki Kurematu
Venue: Knowledge-Based Systems (2009)

This paper reports on our experience in adapting emotional experiences of the software engineers in the evolutionary design of software systems. This paper represents the progress report on the development relative to the state of art needed to have multidisciplinary technologies for establishing the best harmonica engagement between human user and software application, based on cognitive analysis. The best performance related engagement has been achieved using together both the facial and voice analysis. And through it, we have measured (collectivized and quantified) and observed the user behavior, and accordingly enhanced the engagement by generative interactive scenario. The approach has been experimented using a famous literature person (Keni Miyazawa).
Design and Analysis of Private-Preserving Dot Product Protocol
Authors: Ting Wang, Wenjun Luo
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

Private-preserving shared dot product protocol is an important protocol of many secure multi-party computation problems. It has been the main building block of various data mining algorithms with privacy concerns, and providing fundamental security guarantee for many privacy-preserving data mining algorithms. In this paper, we construct a privacy-preserving two-party shared dot product protocol based on some basic cryptographic techniques which is provably secure in malicious model; this protocol has more security than those of previous protocols in the semi-honest model. The potential areas of application of this protocol are numerous, for example, computation of Euclidean distance, privacy-preserving computational geometry, privacy-preserving cooperative statistical analysis and so on.
Inflectional Morphology Analyzer for Sanskrit
Authors: Girish Nath Jha, Muktanand Agrawal, Subash, Sudhir K. Mishra, Diwakar Mani, Diwakar Mishra, Manji Bhadra, Surjit K. Singh
Venue: Sanskrit Computational Linguistics: First and Second International Symposia Rocquencourt, France, October 29-31, 2007 Providence, RI, USA, May 15-17, 2008 Revised Selected and Invited Papers (2009)

The paper describes a Sanskrit morphological analyzer that identifies and analyzes inflected noun-forms and verb-forms in any given sandhi-free text. The system which has been developed as java servlet RDBMS can be tested at http://sanskrit.jnu.ac.in (Language Processing Tools > Sanskrit Tinanta Analyzer/Subanta Analyzer) with Sanskrit data in Unicode text. Subsequently, the separate systems of subanta and tinanta will be combined into a single system of sentence analysis with karaka interpretation. Currently, the system checks and labels each word as three basic POS categories - subanta, tinanta, and avyaya. Thereafter, each subanta is sent for subanta processing based on an example database and a rule database. The verbs are examined based on a database of verb roots and forms as well by reverse morphology based on Paninian techniques. Future enhancements include plugging in the amarakosa (http://sanskrit.jnu.ac.in/amara) and other noun lexicons with the subanta system. The tinanta will be enhanced by the kṛdanta analysis module being developed separately.
Transdisciplinarity: Reaching Beyond Disciplines To Find Connections
Authors: Azad M. Madni
Venue: Journal of Integrated Design Process Science (2007)

We live in an era in which the world is becoming increasingly more connected or, as Tom Friedman puts it, "flat." The inevitable consequence of this interconnectedness trend is that problems are becoming much too complex to successfully solve by applying methods from within a single discipline. This recognition is most evident in the growing trend toward multidisciplinary and interdisciplinary collaboration among traditionally independent disciplines. As such collaboration intensifies, existing disciplines are being enriched and occasionally new disciplines are beginning to emerge. At the same time, the knowledge gaps among the disciplines are beginning to surface. What appears to be lacking is a new way of thinking that strives to harmonize traditional disciplines by reaching beyond their traditional boundaries to fill the knowledge gaps not addressed by them. Transdisciplinary thinking promises to reach beyond disciplinary boundaries to identify and overcome knowledge voids and incompatibilities in the quest for knowledge unification. Achieving these objectives is key to fostering new relationships among traditionally independent disciplines and, in so doing, begin to address problems of national and global significance. This paper discusses the aims of transdisciplinarity, the road to transdisciplinarity, successes resulting from transdisciplinary thinking, and recommendations for a research and education agenda embracing trandsdisciplinary thinking.
A team-oriented design methodology for mixed model assembly systems
Authors: Emre Cevikcan, M. Bulent Durmusoglu, Murat E. Unal
Venue: Computers and Industrial Engineering (2009)

Team-oriented approaches are widely being used in modern real life assembly systems, as are other modern systems. In this paper, first the literature of single and mixed model assembly line balancing, which plays an important role for the design of assembly systems, is reviewed. The associated literature matrixes reveal that team-oriented approaches do not have an intensive research area. Second, a team-oriented mathematical programming model for creating assembly teams (physical stations) in mixed model assembly lines is devised. Owing to the fact that this model is NP hard, a scheduling based heuristic algorithm is developed. The mixed model assembly line design methodology, which includes a team-oriented algorithm as a step, is proposed. Both model sequencing and worker transfer systems are included in the methodology. The algorithms for each step of the methodology are also coded by using MATLAB and MS Excel is used as the user interface. Furthermore, the presented methodology was applied in a chosen segment of a real life mixed model tractor assembly system.
Industrial perspectives panel
Authors: Parthasarathy Ranganathan
Venue: Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming (2009)

This year, we have a different format for HPCA's industrial session. We will have an "industrial perspectives panel" with practitioners from industry presenting their perspectives on interesting future technical challenges and opportunities for research. We have panelists from IBM, Microsoft, NVIDIA, and Sun exploring a spectrum of interesting areas from consumer to enterprise markets including "hot" topics around multicores, graphics accelerators, and solid-state memory.
Radial basis functions networks to hybrid neuro-genetic RBFNs in financial evaluation of corporations
Authors: Loukeris Nikolaos
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Financial management maximise investors' return, seeking for stocks with increasing expected corporate value. Hidden information is included in vast accounting data and financial indices that are available in international financial markets. Methods of Econometrics and Artificial Intelligence- mainly in the field of Neural Networks- provide classifications of companies regarding their economic health. Radial Basis Function networks are examined in a hybrid form of Neural Network optimised with Genetic Algorithms and in a regular Neural Net form, to determine efficient methods of Financial Analysis. The regular Radial Basis Function network with 3 layers, Genetic Algorithms in all the layers and Cross Validation is superior to all the neuro-genetic forms of RBF in Financial Analysis.
A simulation based optimization algorithm for slack reduction and workforce scheduling
Authors: Daniel Noack, Oliver Rose
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

In an assembly line with high labor proportion, the workforce planning and scheduling is a very complex problem. At the background of increasing labor costs, it is very important to increase workforce efficiency. It is essential for companies to remain competitive on global markets. Increasing efficiency is our motivation to work on simulation-based workforce scheduling for complex assembly lines. In this paper, we will focus on the heuristic algorithm in our simulation-based optimization approach. The objective is workforce quantity and slack reduction. To improve the objective, an algorithm assigns the number of workers for activities, scheduled in the simulation run. We will present three different strategies implemented in these optimization algorithms. They basically use the performance indicator slack time, work center utilization and a mix of both parameters. We will compare the algorithms according to their achieved objective and the required computation time.
Risk Analysis and Quantitative Evaluation of Large and Middle-Scaled Reservoir Flood
Authors: Xiangyang Xu, Tianyi Xu, Changjian Shen
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

According to the current status of large and middle-scaled reservoirs in China, the analysis methods of reservoirs downstream flood risk in the event of dam-break and in check flood conditions are established. In the calculation of flooding status caused by reservoir check flood, based on the different characteristics of downstream rivers, water surface profile method, backwater profile method, storage routing method and unsteady open channel flows method are applied respectively. In the calculation of flooding status caused by reservoir dam-break flood, the formula of maximum dam-break discharge method and dam-break flow hydrograph method are presented. On the basis of these, a more suitable way of rendering flood risk maps for large and middle-scaled reservoirs in China is advanced, which is of great significance for the reservoir flood control operation and regional flood prevention decision-making.
Standard C++ IOStreams and Locales: Advanced Programmer's Guide and Reference, 1st edition
Authors: Angelika Langer, Klaus Kreft
Venue:  (2008)

Aimed at the advanced C++ programmer, Standard C++ IOStreams and Locales explains the internals of how C++ streams work and provides support for internationalization. It explains the inner details of architecture and design of these important built-in C++ objects, and it's a reference to all relevant classes and methods. This book effectively reveals the inner workings of the entire stream class library in today's Standard C++ in two ways: First, it explains the design principles and internal function of these stream classes, whether for simple console or file I/O or for more advanced topics like memory streams. There's coverage of I/O basics (manipulators, stream flags, and other built-in features) for everyday programming with streams. The book also does an excellent job of delving into the nitty-gritty details of these classes (which most of us know only on the surface). Examples include a custom date class that will cooperate with existing stream libraries and create new "facets"--output rules that customize data for particular languages or "locales." Besides an in-depth guide to what streams do by default and some hints for adding your own classes to work with them, the text also contains over 200 pages of reference material on every C++ stream and locale class, organized by header files. (These sections will arguably be the most useful for the working C++ developer.) Like the support for template classes, the Standard Library's support for streams is powerful but until now, anyway, not easily accessible to ordinary programmers. For anyone who already knows the fundamentals of streams and is seeking to do more, this title fills a useful niche. It is an authoritative and densely packed source of technical detail on built-in C++ classes. --Richard Dragan Topics covered: Standard C++ predefined streams, input and output operators, manipulators, locale basics, formatted input, stream state flags, file streams, in-memory I/O, stream positioning, synchronizing streams, stream class architecture, stream buffer classes, character types, wide character support, stream and stream buffer iterators, custom stream classes for user-defined types, inserters and extractors, user-defined manipulators, customizing stream and stream buffer classes, internationalization and localization, standard facets, user-defined facets, stream and locale class reference.
Delay-dependent Output Feedback Robust Passivity Controller Design for Uncertain Delayed Systems
Authors: Li Gui-Fang, Huang Sheng-Guo, Liu Xing
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

This paper deals with the problem of output feedback robustly passive control for parameter uncertain systems with time-varying delay. The parameter uncertainties are norm-bounded. We provide a dynamic output feedback controller that guarantees the closed-loop systems strongly robustly stable with strictly passive for all admissible uncertainties. Delay-dependent sufficient conditions for the existence of the robust output feedback controller are derived in terms of linear matrix inequalities (LMIs). Furthermore, a procedure of constructing such controllers from the solutions of the LMIs is given.
Retrieval processes supporting judgments of recency
Authors: Kerrie L. Grove, Edward L. Wilding
Venue: Journal of Cognitive Neuroscience (2009)

The circumstances under which different retrieval processes can support judgments about how long ago events occurred remain a matter of debate, as do the ways in which retrieved information can be employed in support of such judgments. In order to contribute to an understanding of the nature and number of distinct retrieval processes that support time judgments, event-related potentials (ERPs) were acquired during a continuous verbal memory task, where the lag between presentation and re-presentation of words was varied. Participants made judgments of recency (JORs), indicating the number of words that had intervened between presentation and re-presentation. Two spatially and temporally separable ERP effects predicted JORs, and the two effects bore correspondences with ERP modulations that have been linked to the processes of recollection and familiarity, suggesting that both of these processes contributed to JORs. The two effects predicting recency judgments also did so in the same way, with larger effects uniformly predicting shorter lag judgments. In so far as the sizes of the effects index memory strength, these findings are consistent with theoretical accounts of JORs where strength is employed heuristically: The more information recovered, the more recently the event occurred.