ppxscal/embedding_network huggingface dataset:
A Parallel 3D Code for Simulation of Self-gravitating Gas-Dust Systems
Authors: Sergei Kireev
Venue: Proceedings of the 10th International Conference on Parallel Computing Technologies (2009)

A parallel 3D code for simulation of galaxies and protoplanetary discs is developed. The model includes dust, gas, gravitation and friction between dust and gas. The kinetic equation for dust particles is solved by PIC method. Gas dynamics equations are solved by FLIC method. In parallel implementation a domain decomposition technique is used where each subdomain is processed by a group of processors. Results of parallelization efficiency are presented. 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 0-1 Integer LP Formulation for Real Time Optimization of Traffic Signal Control
Authors: Ying Feng, Yanzhi Zhang, Xiang Li
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

A traffic network of an urban area is considered in this paper. This paper presents a 0-1 integer linear program which is based on optimization from a purely mathematical point of view to solve the problem of optimizing traffic signal control. In particular, we consider a group of signalized intersections in an urban area which have different semaphoric cycles. The phase sequence of each intersection is known but the relationship of these phase sequences between each two intersections is unknown beforehand. The identification of the optimal phase relationship between all intersections and duration for the signal phases are combined into one problem in this paper. It can be used as a benchmark for evaluating the performance of some heuristic algorithms such as the genetic algorithm, fuzzy logic and neural networks.
Analysis of Ising Spin Neural Network with Time-Dependent Mexican-Hat-Type Interaction
Authors: Kazuyuki Hara, Seiji Miyoshi, Tatsuya Uezu, Masato Okada
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

We analyzed the equilibrium states of an Ising spin neural network model in which both spins and interactions evolve simultaneously over time. The interactions are Mexican-hat-type, which are used for lateral inhibition models. The model shows a bump activity, which is the locally activated network state. The time-dependent interactions are driven by Langevin noise and Hebbian learning. The analysis results reveal that Hebbian learning expands the bistable regions of the ferromagnetic and local excitation phases.
Dominance-Based Rough Sets Using Indexed Blocks as Granules
Authors: Chien-Chung Chan, Gwo-Hshiung Tzeng
Venue: Fundamenta Informaticae (2009)

Dominance-based rough set introduced by Greco et al. is an extension of Pawlak&iexcl;&macr;s classical rough set theory by using dominance relations in place of equivalence relations for approximating sets of preference ordered decision classes satisfying upward and downward union properties. This paper introduces the concept of indexed blocks for representing dominance-based approximation spaces. Indexed blocks are sets of objects indexed by pairs of decision values. In our study, inconsistent information is represented by exclusive neighborhoods of indexed blocks. They are used to define approximations of decision classes. It turns out that a set of indexed blocks with exclusive neighborhoods forms a partition on the universe of objects. Sequential rules for updating indexed blocks incrementally are considered and illustrated with examples.
FUH (FernUniversit&auml;t in Hagen): metonymy recognition using different kinds of context for a memory-based learner
Authors: Johannes Leveling
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

For the metonymy resolution task at SemEval-2007, the use of a memory-based learner to train classifiers for the identification of metonymic location names is investigated. Metonymy is resolved on different levels of granularity, differentiating between literal and non-literal readings on the coarse level; literal, metonymic, and mixed readings on the medium level; and a number of classes covering regular cases of metonymy on a fine level. Different kinds of context are employed to obtain different features: 1) a sequence of n1 synset IDs representing subordination information for nouns and for verbs, 2) n2 prepositions, articles, modal, and main verbs in the same sentence, and 3) properties of n3 tokens in a context window to the left and to the right of the location name. Different classifiers were trained on the Mascara data set to determine which values for the context sizes n1, n2, and n3 yield the highest accuracy (n1 = 4, n2 = 3, and n3 = 7, determined with the leave-one-out method). Results from these classifiers served as features for a combined classifier. In the training phase, the combined classifier achieved a considerably higher precision for the Mascara data. In the SemEval submission, an accuracy of 79.8% on the coarse, 79.5% on the medium, and 78.5% on the fine level is achieved (the baseline accuracy is 79.4%).
A New Genetic Algorithm for Scheduling for Large Communication Delays
Authors: Johnatan E. Pecero, Denis Trystram, Albert Y. Zomaya
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

In modern parallel and distributed systems, the time for exchanging data is usually larger than that for computing elementary operations. Consequently, these communications slow down the execution of the application scheduled on such systems. Accounting for these communications is essential for attaining efficient hardware and software utilization. Therefore, we provide in this paper a new combined approach for scheduling parallel applications with large communication delays on an arbitrary number of processors. In this approach, a genetic algorithm is improved with the introduction of some extra knowledge about the scheduling problem. This knowledge is represented by a class of clustering algorithms introduced recently, namely, convex clusters which are based on structural properties of the parallel applications. The developed algorithm is assessed by simulations run on some families of synthetic task graphs and randomly generated applications. The comparison with related approaches emphasizes its interest.
Signal Classification Based on Cyclostationary Spectral Analysis and HMM/SVM in Cognitive Radio
Authors: Xinying He, Zhimin Zeng, Caili Guo
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

Distinction of the type of modulated signals is very important in cognitive radio system. In this paper, a novel approach to signal classification is proposed for cognitive radio. Combining the spectral cyclostationary features, embed SVM into the framework of HMM to construct a hybrid HMM/SVM classifier for signal recognition. The simulation results show that the high performance and robustness of the proposed approach, even in low SNR of -5dB. Compared to the conventional methods including the classifiers based on HMM or ANN, the proposed approach has a rather higher recognition rate of signals.
Interacting with a Music Conducting System
Authors: Carlos Rene Argueta, Ching-Ju Ko, Yi-Shin Chen
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

Music conducting is the art of directing musical ensembles with hand gestures to personalize and diversify a musical piece. The ability to successfully perform a musical piece demands intense training and coordination from the conductor, but preparing a practice session is an expensive and time-consuming task. Accordingly, there is a need for alternatives to provide adequate training to conductors at all skill levels; virtual reality technology holds promise for this application. The goal of this research was to study the mechanics of music conducting and develop a system capable of closely simulating the conducting experience. After extensive discussions with professional and nonprofessional conductors, as well as extensive research on music conducting material, we identified several key features of conducting. A set of lightweight algorithms exploring those features were developed to enable tempo control and instrument emphasis, two core components of conducting. By using position/orientation sensors and data gloves as the interface for human-computer interaction, we developed a functional version of the system. Evaluating the algorithms in real-world scenarios gave us promising results; most users of the final system expressed satisfaction with the virtual experience.
Credibility On-Line: Quality Metrics for Evaluation
Authors: Francisco V. Cipolla Ficarra, Ernesto Vivas, Joaquim Romo
Venue: Proceedings of the 3d International Conference on Online Communities and Social Computing: Held as Part of HCI International 2009 (2009)

We present the results of the assessment of credibility of Information Technology and Communications professionals through the application of a set of heuristic techniques which make it possible to analyze different on-line websites where their curricular data reside. The aim of the current research work is to determine the quality of the public and private institutions through the veracity of the on-line content. We also present a set of binary metrics of quality, credibility and veracity of on-line information, called DECROL (Destroy CRedibility On-Line). These metrics are the result of the comparison of professionals or pseudo professionals in 50 public and private institutions in Spain and Italy.
How bad is the problem of PP-attachment?: a comparison of English, German and Swedish
Authors: Martin Volk
Venue: Proceedings of the Third ACL-SIGSEM Workshop on Prepositions (2006)

The correct attachment of prepositional phrases (PPs) is a central disambiguation problem in parsing natural languages. This paper compares the baseline situation in English, German and Swedish based on manual PP attachments in various treebanks for these languages. We argue that cross-language comparisons of the disambiguation results in previous research is impossible because of the different selection procedures when building the training and test sets. We perform uniform tree-bank queries and show that English has the highest noun attachment rate followed by Swedish and German. We also show that the high rate in English is dominated by the preposition of. From our study we derive a list of criteria for profiling data sets for PP attachment experiments.
Take Three Snapshots - A Tool for Fast Freehand Acquisition of 3D Objects
Authors: Gabriele Peters, Klaus Häming
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

We introduce a tool which allows an untrained user to take three images of an object freehand with a simple consumer camera. From these images a 3d model of the visible parts of the object is reconstructed within seconds and visualized realistically. From a research point of view we propose solutions for three weaknesses of the state-of-the-art reconstruction pipeline. These contributions allow for a more robust and a considerably faster reconstruction process than before, which can be used, e.g., to create new types of interfaces or to assist in creating virtual environments.
Enhancing Progressive Encryption for Scalable Video Streams
Authors: Viktor Gergely, Gábor Fehér
Venue: Proceedings of the 15th Open European Summer School and IFIP TC6.6 Workshop on The Internet of the Future (2009)

The technique called progressive encryption is used in many areas of content security. However, the plain algorithm itself is only applicable in real transmission scenarios where no packet loss occurs, otherwise additional error correction techniques need to be used in order to achieve maximum decodeability of network packets. The cipher-stepping method (CSM) described in this article adds error correction to progressive encryption in the case where stream ciphers are used to encrypt stream data. It is also explained how the CSM method along with progressive encryption can be used in the encryption of scalable video streams.
Static-Analysis Assisted Dynamic Verification of MPI Waitany Programs (Poster Abstract)
Authors: Sarvani Vakkalanka, Grzegorz Szubzda, Anh Vo, Ganesh Gopalakrishnan, Robert M. Kirby, Rajeev Thakur
Venue: Proceedings of the 16th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2009)

It is well known that the number of schedules (interleavings) of a concurrent program grows exponentially with the number of processes. Our previous work has demonstrated the advantages of an MPI-specific dynamic partial order reduction (DPOR, [5]) algorithm called POE in a tool called ISP [1,2,3] in dramatically reducing the number of interleavings during formal dynamic verification. Higher degrees of interleaving reduction were achieved when the programs were deterministic. In this work, we consider the problem of verifying MPI using MPI_Waitany (and related operations wait/test some/all). Such programs potentially have a higher degree of non-determinism. For such programs, POE can become ineffective, as shown momentarily. To solve this problem, we employ static analysis (supported by ROSE [4]) in a supporting role to POE to determine the extent to which the out parameters of MPI_Waitany can affect subsequent control flow statements. This informs ISP's scheduler to exert even more intelligent backtrack/replay control.
Proceedings of the Third International Workshop on Knowledge Discovery from Sensor Data
Venue: International Conference on Knowledge Discovery and Data Mining (2009)

Wide-area sensor infrastructures, remote sensors, RFIDs, and wireless sensor networks yield massive volumes of disparate, dynamic, and geographically distributed data. As such sensors are becoming ubiquitous, a set of broad requirements is beginning to emerge across high-priority applications including adaptability to climate change, electric grid monitoring, disaster preparedness and management, national or homeland security, and the management of critical infrastructures. The raw data from sensors need to be efficiently managed and transformed to usable information through data fusion, which in turn must be converted to predictive insights via knowledge discovery, ultimately facilitating automated or humaninduced tactical decisions or strategic policy based on decision sciences and decision support systems.
Computable CTL* for Discrete-Time and Continuous-Space Dynamic Systems
Authors: Pieter Collins, Ivan S. Zapreev
Venue: Proceedings of the 3rd International Workshop on Reachability Problems (2009)

The CTL * model-checking problem is thoroughly studied and is fully understood for finite and countable state spaces. Yet, in most models arising in the sciences and engineering the system's sate space is uncountable. Then, the standard computability and complexity theory is inapplicable but the semantics of CTL * has to be in some sense computable to allow for model-checking algorithms that are implementable on digital computers. To tackle this problem, we consider discrete-time continuous-space dynamic systems for which we study the computability of the standard semantics of CTL * and provide a variant thereof computable in the sense of Type-2 Theory of Effectivity.
Iterative Discrete Particle Swarm Optimization Algorithm and Its Application to Batch Process Optimization
Authors: Ganping Li, Qingnian Wang
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

To solve dynamic optimization problems of batch processes without state independent and end-point constraints, an iterative discrete particle swarm optimization (IDPSO) algorithm was developed. The main idea of the algorithm was to execute the discrete particle swarm optimization (DPSO) iteratively then the control profile would converge to an optimal one. For the method, the control region and time interval were discretized to a finite number of decision variables and DPSO was then used to search for the best control vector. The searching space contracted as iterations proceeded hence the performance index and control profile could achieve the best value. The results of each iterated calculation were filtered by a three-point linear smooth operator, which makes the optimal trajectory smooth and steady. The simulation result of a batch process shows that the IDPSO algorithm can solve the dynamic optimization problems effectively if there is no state independent and end-point constraints.
How Formal Dynamic Verification Tools Facilitate Novel Concurrency Visualizations
Authors: Sriram Aananthakrishnan, Michael Delisi, Sarvani Vakkalanka, Anh Vo, Ganesh Gopalakrishnan, Robert M. Kirby, Rajeev Thakur
Venue: Proceedings of the 16th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2009)

With the exploding scale of concurrency, presenting valuable pieces of information collected by formal verification tools intuitively and graphically can greatly enhance concurrent system debugging. Traditional MPI program debuggers present trace views of MPI program executions. Such views are redundant, often containing equivalent traces that permute independent MPI calls. In our ISP formal dynamic verifier for MPI programs, we present a collection of alternate views made possible by the use of formal dynamic verification. Some of ISP's views help pinpoint errors, some facilitate discerning errors by eliminating redundancy, while others help understand the program better by displaying concurrent even orderings that must be respected by all MPI implementations, in the form of completes-before graphs. In this paper, we describe ISP's graphical user interface (GUI) capabilities in all these areas which are currently supported by a portable Java based GUI, a Microsoft Visual Studio GUI, and an Eclipse based GUI whose development is in progress.
Motion-Sickness Related Brain Areas and EEG Power Activates
Authors: Yu-Chieh Chen, Jeng-Ren Duann, Chun-Ling Lin, Shang-Wen Chuang, Tzyy-Ping Jung, Chin-Teng Lin
Venue: Proceedings of the 5th International Conference on Foundations of Augmented Cognition. Neuroergonomics and Operational Neuroscience: Held as Part of HCI International 2009 (2009)

This study investigates electroencephalographic (EEG) correlates of motion sickness in a virtual-reality based driving simulator. The driving simulator comprised an actual automobile mounted on a Stewart motion platform with six degrees of freedom, providing both visual and vestibular stimulations to induce motion-sickness in a manner that is close to that in daily life. EEG data were acquired at a sampling rate of 500 Hz using a 32-channel EEG system. The acquired EEG signals were analyzed using independent component analysis (ICA) and time-frequency analysis to assess EEG correlates of motion sickness. Subject's degree of motion-sickness was simultaneously and continuously reported using an onsite joystick, providing non-stop psychophysical references to the recorded EEG changes. Five Motion-sickness related brain processes with equivalent dipoles located in the left motor, the parietal, the right motor, the occipital and the occipital midline areas were consistently identified across all subjects. These components exhibited distinct spectral suppressions or augmentation in motion sickness. The results of this study could lead to a practical human-machine interface for noninvasive monitoring of motion sickness of drivers or passengers in real-world environments.
VieSLAF Framework: Enabling Adaptive and Versatile SLA-Management
Authors: Ivona Brandic, Dejan Music, Philipp Leitner, Schahram Dustdar
Venue: Proceedings of the 6th International Workshop on Grid Economics and Business Models (2009)

Novel computing paradigms like Grid and Cloud computing demand guarantees on non-functional requirements such as application execution time or price. Such requirements are usually negotiated following a specific Quality of Service (QoS) model and are expressed using Service Level Agreements (SLAs). Currently available QoS models assume either that service provider and consumer have matching SLA templates and common understanding of the negotiated terms or provide public templates, which can be downloaded and utilized by the end users. On the one hand, matching SLA templates represent an unrealistic assumption in systems where service consumer and provider meet dynamically and on demand. On the other hand, handling of public templates seems to be a rather challenging issue, especially if the templates do not reflect users' needs. In this paper we present VieSLAF, a novel framework for the specification and management of SLA mappings. Using VieSLAF users may specify, manage, and apply SLA mapping bridging the gap between non-matching SLA templates. Moreover, based on the predefined learning functions and considering accumulated SLA mappings, domain specific public SLA templates can be derived reflecting users' needs.
Strategic Supply Chain of Multi-project: An Owners' Perspective
Authors: Zhonglin Chen, Qiaoting Dong, Yingming Shen
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

In view of the current practices and developing tendency of multi-project management, it was suggested that it is the owners rather than the contractors should be at the core to build an effective and efficient supply chain for multi-project. Multi-project management is neither an extension nor a scaled up version of single project management. The characteristics of centralized procurement, Third-party logistics (TPL) procurement, and Just in time (JIT) procurement were also discussed. Finally a new organizational structure for multi-project management was designed to make sure the strategic supply chain can be implemented smoothly.
Using Higher Order DCT Difference to Effective Improve Markov Process Based JPEG Steganalysis Detection Rate
Authors: Guibin Yang, Hongbin Zhang
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

In recent, A Markov Process based approach has been proposed to effective attacking JPEG Steganography, and the experimental works had demonstrated that scheme has outperformed the existing steganalyzers in attacking JPEG steganography. To improve that original Markov Process based approach, several variants based that scheme has been proposed and experimented including using JPEG 1-D array, using higher order difference of JPEG DCT coefficients, using inter-block 1-D array and separating the DCT coefficients to several groups. Support vector machines (SVM) are utilized as classifier. The experimental works are presented to demonstrate that using intra-block JPEG 2-D array and second order difference can significantly improve detection rate.