ppxscal/embedding_network huggingface dataset:
Study on Acoustic Field with Fractal Boundary Using Cellular Automata
Authors: Toshihiko Komatsuzaki, Yoshio Iwata
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

In the present study, characteristics of the acoustic field in an enclosure bounded by fractal walls are investigated using Cellular Automata (CA). CA is a discrete system which consists of finite state variables arranged on uniform grid. The dynamics of CA is expressed by temporary updating the states of cells according to the local interaction rules, defined among a cell and its neighbors. In this paper, the effect of fractal shaped boundary structure to the reverberation and sound absorption characteristics of an enclosure is investigated for two dimensional acoustic wave propagation model described by CA. Local rules are provided for the construction of fractal patterns as well as representation of wave propagation phenomena. It is known by the numerical simulations that the damping enhancement and also frequency-selective absorbing behavior is seen for specific fractal patterns and stage numbers.
Towards Realistic Real Time Speech-Driven Facial Animation
Authors: Aleksandra Cerekovic, Goranka Zoric, Karlo Smid, Igor S. Pandzic
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

In this work we concentrate on finding correlation between speech signal and occurrence of facial gestures with the goal of creating believable virtual humans. We propose a method to implement facial gestures as a valuable part of human behavior and communication. Information needed for the generation of the facial gestures is extracted from speech prosody by analyzing natural speech in real time. This work is based on the previously developed HUGE architecture for statistically based facial gesturing, and extends our previous work on automatic real time lip sync.
To Evaluate the Vegetation Dynamic in Northern-Tibet Plateau of China Based on Remotely Sensed Information and Meteorological Data
Authors: Jiahua Zhang, Fengmei Yao
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

A ten-day interval of satellite data (NOAA/AVHRR) between 1981 and 2001 were used to investigate the Vegetation dynamic in Northern-Tibet Plateau (NTP), China. The relationships between NDVI and climatic parameters were analyzed in six counties of NTP. And the human activities factors such as population also tested in this study. The result shown that the prominent increase and decrease of NDVI occurred in middle eastern and eastern NTP with low altitude. Correspondingly, the linear trends of VP-NDVI were weak and no change in western part of the NTP with high altitude. The strong negative relationship between NDVI and evapotranspiration occurred in sub-frigid semi-arid and frigid arid regions, e.g., Nakchu, Shantsa, Palgon and Amdo counties, which indicated that the evapotranspiration was main effecting factor on vegetation degradation in these areas. But in temperate-humid and sub-frigid semi-humid regions, significantly negative correlations imply that human activities had primary influenced on vegetation degradation like Chali and Soksa counties.
The Impact of Network Topology on Trade in Bartering Networks --- Devising and Assessing Network Information Propagation Mechanisms
Authors: David Cabanillas, Steven Willmott
Venue: Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V (2007)

Resource allocation in distributed systems is an exciting area of research. Inherent properties in this environment, such as strategic users acting selfishly and the structure of the environment within which exchanges occur, are relevant challenges to study. This paper proposes a market---based resource allocation in a distributed environment and explores the effects of network structure on the allocation of performance together. Further, we proposed mechanisms to improve the performance of the market. The proposed model, as well as mechanisms to maximize the allocation of objects/goods have been implemented and studied experimentally. The results obtained show how topology affects the performance of the market. Using information propagation mechanisms clearly contributes to its improvement.
RT-STPS Based Receiving and Data Processing Workstation Prepared for the NPP Stage
Authors: Jinshan Zhu, Ichio Asanuma
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 2 - Volume 02 (2008)

Currently available sensors for science as MODIS on Terra or Aqua will terminate their service in the near future and the next satellite on NPOESS Preparatory Project (NPP) will be the next satellite to support the global remote sensing research. The Tokyo University of Information Sciences (TUIS) has updated the MODIS receiving system to capture and ingest the Visible/Infrared Imager/Radiometer Suite (VIIRS) data from the satellite of NPP, which will be launched in 2008. Data processing software from the Direct Readout Laboratory (DRL), such as the Real-time Software Telemetry Processing (RT-STPS), Simulcast, and DB algorithms, will be core programs in our system. The configuration of the hardware and software for higher level MODIS data processing are introduced in this paper. A data ingest, process and publish system is constructed for MODIS based on the software mentioned above; it can process and publish the data in near real time and proved to work well by our test. By this configuration, the VIIRS data in the NPP stage can also be ingested and processed; also, it will have the ability to publish the VIIRS data in near real time.
Assisting mobility of the disabled using space-identifying ubiquitous infrastructure
Authors: Masahiro Bessho, Shinsuke Kobayashi, Noboru Koshizuka, Ken Sakamura
Venue: Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility (2008)

In achieving the mobility assistance for the individuals with different disabilities, it is required to recognize places with different granularities defined based on human interest, which is hard to be accomplished using traditional GPS-based approaches. In order to meet this requirement, a space-identifying ubiquitous infrastructure designed upon the concept of the universal design has been proposed, which is capable of constructing a service that is aware of places of human interest using ubiquitous computing technologies. Upon this infrastructure, two case studies are performed in the existing civil space, consisting of a pedestrian navigation service for the individuals with different needs, and a mobility assistant service for the visually-impaired. Through these case studies, the possibilities of the proposed infrastructure are discussed.
Improving Attack Graph Visualization through Data Reduction and Attack Grouping
Authors: John Homer, Ashok Varikuti, Xinming Ou, Miles A. Mcqueen
Venue: Proceedings of the 5th international workshop on Visualization for Computer Security (2008)

Various tools exist to analyze enterprise network systems and to produce attack graphs detailing how attackers might penetrate into the system. These attack graphs, however, are often complex and difficult to comprehend fully, and a human user may find it problematic to reach appropriate configuration decisions. This paper presents methodologies that can 1) automatically identify portions of an attack graph that do not help a user to understand the core security problems and so can be trimmed, and 2) automatically group similar attack steps as virtual nodes in a model of the network topology, to immediately increase the understandability of the data. We believe both methods are important steps toward improving visualization of attack graphs to make them more useful in configuration management for large enterprise networks. We implemented our methods using one of the existing attack-graph toolkits. Initial experimentation shows that the proposed approaches can 1) significantly reduce the complexity of attack graphs by trimming a large portion of the graph that is not needed for a user to understand the security problem, and 2) significantly increase the accessibility and understandability of the data presented in the attack graph by clearly showing, within a generated visualization of the network topology, the number and type of potential attacks to which each host is exposed.
Exploring the Persuasiveness of "Just-in-time" Motivational Messages for Obesity Management
Authors: Megha Maheshwari, Samir Chatterjee, David Drew
Venue: Proceedings of the 3rd international conference on Persuasive Technology (2008)

The healthcare industry in the United States is going through major challenges in terms of financial and human resources. One of the preferred ways to address this issue is to develop effective prevention systems so that the people can live healthy lives and in turn minimize the use of the medical system. Preventing diseases requires people to adopt healthy lifestyles. Advances in pervasive technology provide promising opportunity in developing such systems. Specifically, sending "just-in-time" motivational messages to help people make right health related decision has been pointed out as an emerging field of research. However, in order to persuade the users to take a healthy action, it is essential that the "just-in-time" messages are persuasive to the recipients. In this study, we explored persuasiveness of such messages by considering two of the five elements of a communication process with a focus on obesity management.
A Logic for Closed-World Interaction
Authors: Jan Broersen, Rosja Mastop, John-Jules Ch. Meyer, Paolo Turrini
Venue: Proceedings of the 11th European conference on Logics in Artificial Intelligence (2008)

The aim of the work is to provide a language to reason about closed-world interaction, that is all those situations in which the outcomes of an interaction can be determined by the agents themselves and in which Nature does not play an active role. We formalize this intuition by identifying all such interactions and axiomatizing their logic. We apply the formal tools to reason about games and their regulation.
On the Necessity and Feasibility of Detecting a Driver's Emotional State While Driving
Authors: Michael Grimm, Kristian Kroschel, Helen Harris, Clifford Nass, Björn Schuller, Gerhard Rigoll, Tobias Moosmayr
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

This paper brings together two important aspects of the human-machine interaction in cars: the psychological aspect and the engineering aspect. The psychologically motivated part of this study addresses questions such as why it is important to automatically assess the driver's affective state, which states are important and how a machine's response should look like. The engineering part studies how the emotional state of a driver can be estimated by extracting acoustic features from the speech signal and mapping them to an emotion state in a multidimensional, continuous-valued emotion space. Such a feasibility study is performed in an experiment in which spontaneous, authentic emotional utterances are superimposed by car noise of several car types and various road surfaces.
3D Human Motion Reconstruction Using Video Processing
Authors: Nadiya Roodsarabi, Alireza Behrad
Venue: Proceedings of the 3rd international conference on Image and Signal Processing (2008)

One of the important problems in human motion analysis is the 3D reconstruction of human motion, which utilizes the anatomic point's positions. These points can uniquely define the position and orientation of all anatomical segments. In this paper, a new method for reconstruction of human motion from the image sequence of a single static camera is described. In this method 2D tracking is used for 3D reconstruction, which a database of selected frames are used for the correction of tracking process. We use Discrete Cosine Transform (DCT) block as a "Matrix des criptor" used in the matching process for finding appropriate frame in the database and tracking process. Finally, 3D reconstruction is performed using Taylor method. By using DCT, we can select best frequency region for various tasks such as tracking, matching, correcting joints and so on. Experimental results showed the promise of the algorithm.
A novel backtracking particle filter for pattern matching indoor localization
Authors: widyawan, Martin Klepal, Stéphane Beauregard
Venue: Proceedings of the first ACM international workshop on Mobile entity localization and tracking in GPS-less environments (2008)

Particle Filter (PF) techniques has been widely used in indoor localization systems. They are often used in conjunction with pattern matching based on Received Signal Strength Indication (RSSI) fingerprinting. Several variants of the particle filter within a generic framework of the Sequential Importance Sampling (SIS) algorithm have been described. The purpose of this paper is to show how a variant of PF, the so-called Backtracking Particle Filter (BPF), can be used to improve indoor localization performance. The BPF is a technique for refining state estimates based on exclusion of invalid particle trajectories. Categorization of invalid trajectory determined during importance sampling step of the PF. The BPF can also take advantage of available building plan information using the so-called Map Filtering (MF) technique. The incorporation of MF allows the BPF to exploit long-range geometrical constraints. This paper evaluates BPF with indoor localization based on WLAN RSSI fingerprinting. The filtering schema is evaluated using the propagation simulation in an office building, a typical environment for fingerprinting technique. Favorable result are obtained, showing positioning performance (1.34 m mean 2D error) superior to the PF-only no MF case (1.82 m mean 2D error), or up to 25% improvement. It is also shown that the performance is far better than the position estimates from conventional Nearest-Neighbour (NN) and Kalman Filter (KF) approaches using the same RSSI measurements.
The Steiner tree problem on graphs: Inapproximability results
Authors: Miroslav Chlebík, Janka Chlebíková
Venue: Theoretical Computer Science (2008)

The Steiner tree problem on weighted graphs seeks a minimum weight subtree containing a given subset of the vertices (terminals). We show that it is NP-hard to approximate the Steiner tree problem within a factor 96/95. Our inapproximability results are stated in a parametric way, and explicit hardness factors would be improved automatically by providing gadgets and/or expanders with better parameters.
Symbolic Solution to Magnetohydrodynamic Hiemenz Flow in Porous Media
Authors: Seripah Awang Kechil, Ishak Hashim
Venue: Computer Mathematics: 8th Asian Symposium, ASCM 2007, Singapore, December 15-17, 2007. Revised and Invited Papers (2008)

A system of nonlinear ordinary differential equations governing the boundary layers of magnetohydrodynamic (MHD) Hiemenz flow in porous media is solved using a simple and efficient analytical technique of Adomian decomposition method (ADM) and Padé approximant through the computer algebra package system Maple. Several symbolic features of the Maple system are utilized to develop specific routines that compute the approximate analytical solutions of the stream, velocity and temperature functions for some exemplary prescribed parameters. Comparative study shows the well agreement of the present symbolic results with the existing numerical results.
Mathematical search for content mathml digital libraries
Authors: Abdou Youssef
Venue:  (2008)

Search technology facilitates text search and does not handle non-alphanumeric symbols. The development of math search capabilities is a new area of research with many technical challenges due to the nature of the mathematical writing system. Some of the challenges are addressed through the use of current XML-based technologies. For example, the basic set of non-alphabetic mathematical symbols and mathematical expression's tree structures are captured directly through the use of Content MathML encoding. This resolves some ambiguities and inconsistencies inherent in the use of mathematical notation. Furthermore, mathematical expressions' rich structures, which proved to be a challenge to text search technology, can now be recognized by the emerging XML-based search engines. Consequently, the development of a math search system that fully captures math content is now possible. This research focuses on developing novel techniques that allow the general users to describe a mathematical expression using a simple math query language executed against a data repository of files containing mathematical content.
Aspects of airborne continuous surveillance systems: practical image encryption module
Authors: Ciprian Racuciu, Nicolae Jula, Constantin Balan, Cosmin Adomnicai
Venue: Proceedings of the 10th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering (2008)

This paper presents an encryption system developed to be used on an airborne surveillance system. The encryption system is composed from six modules: image capture, encryption, two radio link modules, decryption and display module. The first three modules are used on airborne hardware platform and the last three modules are used on the base station platform. The airborne hardware platform is the CV700C motherboard and the base station is an Intel microprocessor based notebook. For encryption, Rijndael algorithm was used.
An Annotated Bibliography of FORTRAN
Authors: J. A. N. Lee
Venue: IEEE Annals of the History of Computing (1984)

The papers listed in this chronological bibliography have been selected on the basis of their relationship to the language FORTRAN, its implementations, its derivatives, and its definition. Only in exceptional cases have references been included to the use of FORTRAN in specialized applications. Papers have been included where the application is in the development of a secondary language, however, or where the modification of FORTRAN is capable of supporting some application other than "scientific programming". For historical completeness, a few references have been included to pre-FORTRAN systems that were referenced in some of the early FORTRAN publications. 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
HVEM Control System Based on Grid: A Cornerstone of e-Biology
Authors: Hyuck Han, Shingyu Kim, Hyungsoo Jung, Heon Y. Yeom
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

This paper proposes HVEM Control System, which is the cornerstone for teleinstrumentation infrastructure. The proposed system is oriented for people whose primary work is to get access to a remotely located instrument, a High-Voltage Electron Microscope (HVEM). Our system is implemented to fulfill all the necessary requirements in allowing the user to 1) control every single part of HVEM in a fine-grained manner, 2) check the HVEM and observe various states of sample, and 3) take their high resolution images of the sample. In that aspect, this paper suggests an HVEM Control System designed on the concept of the Grid and Web Service which satisfies various types of user groups, explains novel characteristics of our system.
Fast Central Catadioptric Line Extraction
Authors: Jean Charles Bazin, Cédric Demonceaux, Pascal Vasseur
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II (2007)

Lines are particularly important features for different tasks such as calibration, structure from motion, 3D reconstruction in computer vision. However, line detection in catadioptric images is not trivial because the projection of a 3D line is a conic eventually degenerated. If the sensor is calibrated, it has been already demonstrated that each conic can be described by two parameters. In this way, some methods based on the adaptation of conventional line detection methods have been proposed. However, most of these methods suffer from the same disadvantages than in the perspective case (computing time, accuracy, robustness, ...). In this paper, we then propose a new method for line detection in central catadioptric image comparable to the polygonal approximation approach. With this method, only two points of a chain allows to extract with a very high accuracy a catadioptric line. Moreover, this algorithm is particularly fast and is applicable in realtime. We also present experimental results with some quantitative and qualitative evaluations in order to show the quality of the results and the perspectives of this method.
Programming of a machining procedure for adaptive spiral cutting trajectories
Authors: R. Roy, J-F. Chatelain, R. Mayer, S. Chalut, S. Engin
Venue: Proceedings of the 10th WSEAS International Conference on Automatic Control, Modelling & Simulation (2008)

The objective of this paper is to present a new adaptive spiral cutting method and its implementation in CAD/CAM software applications. A Visual Basic (VB) macro automatically generates a spiral tool path for the machining of pockets in aircraft wing components. The second part of the paper is aimed at improving the cutting methods for machining pockets with inclined walls. During the roughing operation, the proposed tool path takes into consideration the slant of the walls but also allows maximizing the quantity of material to be removed.
Methods for Coalition Formation in Adaptation-Based Social Networks
Authors: Levi Barton, Vicki H. Allan
Venue: Proceedings of the 11th international workshop on Cooperative Information Agents XI (2007)

Coalition formation in social networks consisting of a graph of interdependent agents allows many choices of which task to select and with whom to partner in the social network. Nodes represent agents and arcs represent communication paths for requesting team formation. Teams are formed in which each agent must be connected to another agent in the team by an arc. Agents discover effective network structures by adaptation. Agents also use several strategies for selecting the task and determining when to abandon an incomplete coalition. Coalitions are finalized in one-on-one negotiation, building a working coalition incrementally.
Grid-Enabled Software Environment for Enhanced Dynamic Data-Driven Visualization and Navigation During Image-Guided Neurosurgery
Authors: Nikos Chrisochoides, Andriy Fedorov, Andriy Kot, Neculai Archip, Daniel Goldberg-Zimring, Dan Kacher, Stephen Whalen, Ron Kikinis, Ferenc Jolesz, Olivier Clatz, Simon K. Warfield, Peter M. Black, Alexandra Golby
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

In this paper we present our experience with an Image Guided Neurosurgery Grid-enabled Software Environment (IGNS-GSE) which integrates real-time acquisition of intraoperative Magnetic Resonance Imaging (IMRI) with the preoperative MRI, fMRI, and DT-MRI data. We describe our distributed implementation of a non-rigid image registration method which can be executed over the Grid. Previously, non-rigid registration algorithms which use landmark tracking across the entire brain volume were considered not practical because of the high computational demands. The IGNS-GSE, for the first time ever in clinical practice, alleviated this restriction. We show that we can compute and present enhanced MR images to neurosurgeons during the tumor resection within minutes after IMRI acquisition. For the last 12 months this software system is used routinely (on average once a month) for clinical studies at Brigham and Women's Hospital in Boston, MA. Based on the analysis of the registration results, we also present future directions which will take advantage of the vast resources of the Grid to improve the accuracy of the method in places of the brain where precision is critical for the neurosurgeons.