ppxscal/embedding_network huggingface dataset:
Polarizability functions of heteronuclear diatomic molecules: Semiempirical approach
Authors: M. A. Buldakov, V. N. Cherepanov, N. S. Nagornova
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

A semiempirical method is discussed to construct the polarizability functions for a diatomic heteronuclear molecule as a piecewise-continuous function that exhibits physically correct behavior at small and large internuclear distances and agrees with the polarizability function near the equilibrium position of the molecule nuclei. The method is applied to calculate the static polarizability functions of LiH, HF, HCl and CO molecules in the range of internuclear distances [0, &infin;).
Mobile Agents in Wireless Devices
Authors: Luminita Vasiu, Qusay H. Mahmoud
Venue: Computer (2004)

Mobile agents offer a potential solution to network problems associated with handhelds.
Proceedings of the 2008 ACM workshop on Wireless networks and systems for developing regions
Venue: International Conference on Mobile Computing and Networking (2008)

It is our great pleasure to welcome you to the new ACM Workshop on Wireless Networks and Systems for Developing Regions -- WiNS-DR'08. This workshop focuses on the technology required to provide communications and information access to rural regions in the developing world, and in particular technical aspects of wireless networking, systems and communication. This target environment poses unique system-wide challenges that require the development of new research approaches and innovative designs and techniques. These challenges include infrastructure issues, such as power and connectivity limitations, as well as particular user needs, including cost, literacy and language issues. Thus in addition to considering the specifics of networking protocols and architectures, the aim of the workshop is to consider the entire system by which networking and communication is provided, all the key technical stakeholders, and the overall system lifecycle from economic modeling to deployment. Why this workshop? Wireless systems for developing regions represent an exciting but underutilized opportunity for large-scale impact on the economic livelihood and well-being of the population in these areas. In addition it is clear that the fastest growing markets for wireless technology are in these regions. The special challenges faced in these regions lead to a host of complex and interesting R&D problems that require innovation. What is in the Program? The program committee received papers from India, Malaysia, South Africa, Sweden, Uganda, UK and the US. Each paper received multiple peer reviews from the program committee and 6 were selected for publication. In addition we invited 3 papers from respected experts in the field. The resulting program is organized into three major sessions on Deployment Experience, the specific technical challenges of Delay Tolerant Networking, and a broader session on Policy, Platforms and Architectures. How do I get involved further? Participate in the workshop, propose ideas to follow on the workshop or for next year, write a paper, and contact us to volunteer to help!
Ranking Links on the Web: Search and Surf Engines
Authors: Jean-Louis Lassez, Ryan Rossi, Kumar Jeev
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

The main algorithms at the heart of search engines have focused on ranking and classifying sites. This is appropriate when we know what we are looking for and want it directly. Alternatively, we surf, in which case ranking and classifying links becomes the focus. We address this problem using a latent semantic analysis of the web. This technique allows us to rate, suppress or create links giving us a version of the web suitable for surfing. Furthermore, we show on benchmark examples that the performance of search algorithms such as PageRank is substantially improved as they work on an appropriately weighted graph.
Application of the boundary element method for heat distribution on ferromagnetic core
Authors: Füsun Serteller
Venue: Proceedings of the 7th WSEAS International Conference on Application of Electrical Engineering (2008)

This paper presents analysis of the electro-thermal transformation problem and its effect on a ferromagnetic core. The two-dimensional heat conduction problem is studied using the boundary element method (BEM). Linear elements are used in the solution procedure. The numerical results have been compared with the results of the finite element method (FEM). Three different widely - used ferromagnetic materials have been examined in the analysis.
Collisions on SHA-0 in One Hour
Authors: Stéphane Manuel, Thomas Peyrin
Venue: Fast Software Encryption: 15th International Workshop, FSE 2008, Lausanne, Switzerland, February 10-13, 2008, Revised Selected Papers (2008)

At Crypto 2007, Joux and Peyrin showed that the boomerang attack, a classical tool in block cipher cryptanalysis, can also be very useful when analyzing hash functions. They applied their new theoretical results to SHA and provided new improvements for the cryptanalysis of this algorithm. In this paper, we concentrate on the case of SHA-0. First, we show that the previous perturbation vectors used in all known attacks are not optimal and we provide a new 2-block one. The problem of the possible existence of message modifications for this vector is tackled by the utilization of auxiliary differentials from the boomerang attack, relatively simple to use. Finally, we are able to produce the best collision attack against SHA-0 so far, with a measured complexity of 233,6 hash function calls. Finding one collision for SHA-0 takes us approximatively one hour of computation on an average PC.
Evaluating business intelligence platforms: a case study
Authors: Carlo Dell'Aquila, Francesco Di Tria, Ezio Lefons, Filippo Tangorra
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

The paper examines some common platforms supporting Business Intelligence activities in order to state evaluation criteria for the system choice. The evaluation considers a software measurement method based on the analysis of the functional complexity of the platforms. The study has been performed on an academic warehouse that uses historical data available in legacy databases. Experimental results are reported which show the advantages and the drawbacks of each considered system.
Combining Basic Probability Assignments for Fuzzy Focal Elements
Authors: Ewa Straszecka
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

The Dempster-Shafer theory is convenient for implementation in models of medical diagnosis as it neglects dependence of symptoms. Yet, combination of two basic probability assignments that is defined in the theory is often criticized. The paper shows opportunities of combining that are created when the Dempster-Shafer theory is extended for fuzzy focal elements. The proposed method can help to avoid several disadvantages of the classical combination. 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
A Visual Description of the Convective Flow Field around the Head of a Human
Authors: O. Özcan, K. E. Meyer, A. K. Melikov
Venue: Journal of Visualization (2005)

Mean velocity data obtained by PIV (Particle Image Velocimetry) around the head of a real-life size breathing thermal manikin are presented for two cases of 'no breathing' and 'continuous exhalation through nose'. Experiments were conducted in a special chamber which provided stationary convective flows around the seated manikin. Results are limited to the plane of symmetry. The paper aims to describe the physical structure of the turbulent flow field by presenting velocity and vorticity data in color graphics.
An Improved ACO Based Plug-in to Enhance the Interpretability of Fuzzy Rule Bases with Exceptions
Authors: Pablo Carmona, Juan Luis Castro
Venue: Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence (2008)

In a previous work, the authors proposed, on one hand, an extension on the syntax of fuzzy rules by including new predicates and exceptional rules and, on the other hand, the use of an ant colony optimization algorithm to obtain an optimal set of such rules that describes an initial fuzzy model. The present work proposes several extensions on that algorithm in order to improve the interpretability of the obtained fuzzy model, as well as the computational cost of the algorithm. Experimental results on several initial fuzzy models reveal the gain obtained with each extension and when applied altogether.
A Matrix-Based Secret Sharing Scheme for Images
Authors: A. Martín Rey
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

In this paper, we propose a novel secret sharing scheme for digital images based on the use of binary matrices. It is shown that the scheme presented is ideal and perfect. Also, it exhibits good statistical properties.
Gem #12: limited types in Ada 2005: <> Notation Part 2
Authors: Bob Duff
Venue: ACM SIGAda Ada Letters (2008)

Ada Gem #12 -- We show how the
Automatic Communication Performance Debugging in PGAS Languages
Authors: Jimmy Su, Katherine Yelick
Venue: Languages and Compilers for Parallel Computing: 20th International Workshop, LCPC 2007, Urbana, IL, USA, October 11-13, 2007, Revised Selected Papers (2007)

Recent studies have shown that programming in a Partition Global Address Space (PGAS) language can be more productive than programming in a message passing model. One reason for this is the ability to access remote memory implicitly through shared memory reads and writes. But this benefit does not come without a cost. It is very difficult to spot communication by looking at the program text, since remote reads and writes look exactly the same as local reads and writes. This makes manual communication performance debugging an arduous task. In this paper, we describe a tool called ti-trend-prof that can do automatic performance debugging using only program traces from small processor configurations and small input sizes in Titanium [13], a PGAS language. ti-trend-prof presents trends to the programmer to help spot possible communication performance bugs even for processor configurations and input sizes that have not been run. We used ti-trend-prof on two of the largest Titanium applications and found bugs that would have taken days in under an hour.
Secure Safety: Secure Remote Access to Critical Safety Systems in Offshore Installations
Authors: Martin Gilje Jaatun, Tor Olav Grøtan, Maria B. Line
Venue: Proceedings of the 5th international conference on Autonomic and Trusted Computing (2008)

Safety Instrumented Systems (SIS) as defined in IEC 61508 and IEC 61511 are very important for the safety of offshore oil natural gas installations. SIS typically include the Emergency Shutdown System (ESD) that ensures that process systems return to a safe state in case of undesirable events. Partly as a consequence of the evolving "Integrated Operations" concept, a need is emerging for remote access to such systems from vendors external to the operating company. This access will pass through a number of IP-based networks used for other purposes, including the open Internet. This raises a number of security issues, ultimately threatening the safety integrity of SIS.In this paper we present a layered network architecture that represents current good practice for a solution to ensure secure remote access to SIS. Also, a method for assessing whether a given solution for remote access to SIS is acceptable is described. The primary objective with the specification of the remote access path is to defend the Safety Integrity Level (SIL) of SIS from security infringements. It also accommodates the special case when security functions have to be implemented within SIS.
Finding Frequent Items over General Update Streams
Authors: Sumit Ganguly, Abhayendra N. Singh, Satyam Shankar
Venue: Proceedings of the 20th international conference on Scientific and Statistical Database Management (2008)

We present novel space and time-efficient algorithms for finding frequent items over general update streams. Our algorithms are based on a novel adaptation of the popular dyadic intervals method for finding frequent items. The algorithms improve upon existing algorithms in both theory and practice.
On the Influence of Phonetic Content Variation for Acoustic Emotion Recognition
Authors: Bogdan Vlasenko, Björn Schuller, Andreas Wendemuth, Gerhard Rigoll
Venue: Proceedings of the 4th IEEE tutorial and research workshop on Perception and Interactive Technologies for Speech-Based Systems: Perception in Multimodal Dialogue Systems (2008)

Acoustic Modeling in today's emotion recognition engines employs general models independent of the spoken phonetic content. This seems to work well enough given sufficient instances to cover for a broad variety of phonetic structures and emotions at the same time. However, data is usually sparse in the field and the question arises whether unit specific models as word emotion models could outperform the typical general models. In this respect this paper tries to answer the question how strongly acoustic emotion models depend on the textual and phonetic content. We investigate the influence on the turn and word level by use of state-of-the-art techniques for frame and word modeling on the well-known public Berlin Emotional Speech and Speech Under Simulated and Actual Stress databases. In the result it is clearly shown that the phonetic structure does strongly influence the accuracy of emotion recognition.
Binarizing Training Samples with Multi-threshold for Viola-Jones Face Detector
Authors: Hiroaki Inayoshi, Takio Kurita
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

We propose an alternative method to Viola-Jones face- detector: in learning stage, we replace each of the gray-scale training images with multiple binary images using multi-threshold; and in detection stage, we use a binarized input-image instead of a gray-scale one. We call this method "TMBMT" (Training by Multiple Binarized samples using Multi-Threshold). Using face images of 1040 individuals from the CAS-PEAL face database, we show that proposed face-detector improves the conventional Viola-Jones facedetectors in terms of numbers of both missed-faces and false-alarms. We also discuss (hypothetical) reasons for the improved performance with (partially) supporting evidence: (1) binarization leads to sharpening of feature distribution; (2) use of multi-threshold leads to better selection of feature location. We speculate these two reasons explain the improved performance.
Activity Completion Duration Based Checkpoint Selection for Dynamic Verification of Temporal Constraints in Grid Workflow Systems
Authors: Jinjun Chen, Yun Yang
Venue: International Journal of High Performance Computing Applications (2008)

In grid workflow systems, to verify temporal constraints efficiently at the run-time execution stage, some checkpoints are selected such that temporal verification need only be conducted at those checkpoints rather than at all activity points. However, existing typical checkpoint selection strategies may ignore some necessary checkpoints and select some unnecessary ones. This eventually impacts overall temporal verification effectiveness and efficiency. To improve such status, in this paper, we develop a new checkpoint selection strategy. Specifically, we first investigate the relationships between activity completion duration and the consistency of temporal constraints. Then, based on those relationships we present our new checkpoint selection strategy. Our new strategy can avoid the omission of necessary checkpoints and the selection of excess unnecessary checkpoints. Consequently, it can achieve better temporal verification effectiveness and efficiency than the existing typical checkpoint selection strategies. The final comparison and quantitative evaluation further demonstrate this result.
Local Coordinates Alignment and Its Linearization
Authors: Tianhao Zhang, Xuelong Li, Dacheng Tao, Jie Yang
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

Manifold learning has been demonstrated to be an effective way to discover the intrinsic geometrical structure of a number of samples. In this paper, a new manifold learning algorithm, Local Coordinates Alignment (LCA), is developed based on the alignment technique. LCA first obtains the local coordinates as representations of a local neighborhood by preserving the proximity relations on the patch which is Euclidean; and then the extracted local coordinates are aligned to yield the global embeddings. To solve the out of sample problem, the linearization of LCA (LLCA) is also proposed. Empirical studies on both synthetic data and face images show the effectiveness of LCA and LLCA in comparing with existing manifold learning algorithms and linear subspace methods.
Dependency Analysis for Control Flow Cycles in Reactive Communicating Processes
Authors: Stefan Leue, Alin Ştefănescu, Wei Wei
Venue: Proceedings of the 15th international workshop on Model Checking Software (2008)

The execution of a reactive system amounts to the repetitions of executions of control flow cycles in the component processes of the system. The way in which cycle executions are combined is not arbitrary since cycles may depend on or exclude one another. We believe that the information of such dependencies is important to the design, understanding, and verification of reactive systems. In this paper, we formally define the concept of a cycle dependency, and propose several static analysis methods to discover such dependencies. We have implemented several strategies for computing cycle dependencies and compared their performance with realistic models of considerable size. It is also shown how the detection of accurate dependencies is used to improve a livelock freedom analysis that we developed previously.
CCIC: Consistent Common Itemsets Classifier
Authors: Yohji Shidara, Atsuyoshi Nakamura, Mineichi Kudo
Venue: Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition (2007)

We propose a novel approach which extracts consistent (100% confident) rules and builds a classifier with them. Recently, associative classifiers which utilize association rules have been widely studied. Indeed, the associative classifiers often outperform the traditional classifiers. In this case, it is important to collect high quality (association) rules. Many algorithms find only high support rules, because decreasing the minimum support to be satisfied is computationally demanding. However, it may be effective to collect low support but high confidence rules. Therefore, we propose an algorithm that produces a wide variety of 100% confident rules including low support rules. To achieve this goal, we adopt a specific-to-general rule searching strategy, in contrast to the previous many approaches. Our experimental results show that the proposed method achieves higher accuracies in several datasets taken from UCI machine learning repository.
From CA to Gene Expression: Machines and Mechanisms
Authors: Debashish Chowdhury, Ashok Garai, Philip Greulich, Katsuhiro Nishinari, Andreas Schadschneider, Tripti Tripathi, Jian-Sheng Wang
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

Molecular motors are proteins or macromolecular complexes which use input energy to perform mechanical work. Some of these motors move on filamentous proteins whereas other move on DNA or RNA strands. Often, many such motors move simultaneously on the same track and their collective movement is similar to vehicular traffic on highways. We have developed theoretical models of different types of molecular motor traffic by appropriately extending the totally asymmetric simple exclusion process (TASEP). Thus, our models of molecular motor traffic belong to the broad class of driven-diffusive lattice gas models which have close relations with cellular automata. By drawing analogy with vehicular traffic, we have introduced novel quantities for characterizing the nature of the spatio-temporal organization of molecular motors on their tracks. We show how the mechano-chemistry of the individual motors influence the traffic-like intracellular collective phenomena.
An Application of Name Based Addressing to Low Level Distributed Algorithms
Authors: M. Ahamad
Venue: IEEE Transactions on Software Engineering (1985)

An interprocess communication structure for a distributed language is described which provides message level communication, multicast, and a generalized naming facility. The design is oriented to the needs of low level algorithms which, for example, might be used in a distributed operating system to support resource allocation or enhance reliability. The proposal is illustrated by programming several distributed algorithms from the literature. An implementation is described that takes advantage of physical multicast technology, and reduces to more conventional schemes for common communication paradigms.
Deriving Structural Labelled Transitions for Mobile Ambients
Authors: Julian Rathke, Paweł Sobociński
Venue: Proceedings of the 19th international conference on Concurrency Theory (2008)

We present a new labelled transition system (lts) for the ambient calculus on which ordinary bisimilarity coincides with contextual equivalence. The key feature of this lts is that it is the fruit of ongoing work on developing a systematic procedure for deriving ltss in the structural style from the underlying reduction semantics and observability. Notably, even though we have derived our lts for ambients systematically it compares very favourably with existing transition systems for the same calculus.
A Practical Parameterized Algorithm for Weighted Minimum Letter Flips Model of the Individual Haplotyping Problem
Authors: Minzhu Xie, Jianxin Wang, Wei Zhou, Jianer Chen
Venue: Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics (2008)

Given a set of DNA sequence fragments of an individual with each base of every fragment attached a confidence value, the weighted minimum letter flips model (WMLF) of the individual haplotyping problem is to infer a pair of haplotypes by flipping a number of bases such that the sum of the confidence values corresponding to the flipped bases is minimized. WMLF is NP-hard. This paper proposes a parameterized exact algorithm for WMLF of time $O(nk_22^{k_2}+mlogm+mk_1)$, where m is the number of fragments, n is the number of SNP sites, k 1 is the maximum number of SNP sites that a fragment covers, and k 2 is the maximum number of fragments that cover a SNP site. Since in real biological experiments, both k 1 and k 2 are small, the parameterized algorithm is efficient in practical application.
An MPI-Based System for Testing Multiprocessor and Cluster Communications
Authors: Alexey N. Salnikov, Dmitry Y. Andreev
Venue: Proceedings of the 15th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2008)

This article describes a system of MPI-tests that collects statistics on delays during message transmitting through communications of multiprocessor or cluster and Graphic User Interface (GUI) to visualize it. The system is capable to imitate communication activity level and to count delays for targeted messages passing. A cluster with 940 multicore processors has been tested.