ppxscal/embedding_network huggingface dataset:
Modelling Considerations for Dynamic Boundary Conditions in Respect to Tsunami Run-Up Simulations from 100 m Depth
Authors: Richard Zobel, Helmut Duerrast
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

Modelling of tsunami in shallow coastal waters involves fast flows which become complex as they reach the shore because of seabed and shore line boundaries, the pickup and deposit of sand, gravel, coral and rocks. This results in dynamic changes in the water/seafloor boundaries and the water/air boundaries. Typically, the seafloor may locally become deeper or shallower, giving rise to sand banks and small islands being removed and/or added. The consequences are further made more complex by reflections from shoreline solid features, deposition, and removal of materials such as sand on land. There may also be resulting complex chaotic waves and cross currents or even large vortices as seen in the Phuket video footage of the 26 December 2004 Indian Ocean Tsunami. Attempts to model such phenomena are describes in order to improve understanding of possible effects of future tsunamis.
Parallel Iterative Algorithms: From Sequential to Grid Computing (Chapman & Hall/Crc Numerical Analy & Scient Comp. Series)
Authors: Jacques Mohcine Bahi, Sylvain Contassot-Vivier, Raphael Couturier
Venue:  (2007)

Focusing on grid computing and asynchronism, Parallel Iterative Algorithms explores the theoretical and practical aspects of parallel numerical algorithms. Each chapter contains a theoretical discussion of the topic, an algorithmic section that fully details implementation examples and specific algorithms, and an evaluation of the advantages and drawbacks of the algorithms. Several exercises also appear at the end of most chapters. The first two chapters introduce the general features of sequential iterative algorithms and their applications to numerical problems. The book then describes different kinds of parallel systems and parallel iterative algorithms. It goes on to address both linear and nonlinear parallel synchronous and asynchronous iterative algorithms for numerical computation, with an emphasis on the multisplitting approach. The final chapter discusses the features required for efficient implementation of asynchronous iterative algorithms. Providing the theoretical and practical knowledge needed to design and implement efficient parallel iterative algorithms, this book illustrates how to apply these algorithms to solve linear and nonlinear numerical problems in parallel environments, including local, distant, homogeneous, and heterogeneous clusters.
Transient behavior of processes in the tcp paradigm
Authors: T. j. Ott, J. h. b. Kemperman
Venue: Probability in the Engineering and Informational Sciences (2008)

This article derives the transient behavior of the stochastic process X(t) for which in earlier articles it was proven that for αX(t))1/(1−α) (approximately, under low drop probability or ECN marking probability) describes the behavior of the congestion windows in certain transport protocols in the so-called TCP paradigm. The transient distribution is found explicitly and is particularly transparent for moments like E[(X(t))k |X(0)]. The purpose of this article is to be part of the mathematical foundation when comparing the many protocols in the TCP paradigm.
Multi-visibility maps of triangulated terrains
Authors: N. Coll, M. Fort, N. Madern, J. A. Sellarès
Venue: International Journal of Geographical Information Science (2007)

Visibility computation on terrain models is an important research topic with many applications in Geographical Information Systems. A multi-visibility map is the subdivision of the domain of a terrain into regions that, according to different criteria, encodes the visibility with respect to a set of view elements. We present an approach for visualising approximated multi-visibility maps of a triangulated terrain corresponding to a set of view elements by using graphics hardware. Our method supports heterogeneous sets of view elements containing points, segments, polygonal chains and polygons and works for weak and strong visibility. Moreover, we are also able to efficiently solve approximated point and polygonal region multi-visibility queries. To illustrate the usefulness of our approach we present results obtained with an implementation of the proposed algorithms.
System architecture for semantic annotation and adaptation in content sharing environments
Authors: Saar De Zutter, Mark Asbach, Sarah De Bruyne, Michael Unger, Mathias Wien, Rik Van de Walle
Venue: The Visual Computer: International Journal of Computer Graphics (2008)

This paper describes a system architecture, which enables the automatic semantic annotation and adaptation of multimedia content in context-aware content sharing environments. The discussed architecture is the result of research done in the EU FP6 IST INTERMEDIA project. Generating a common vision on user-centric multimedia services in shared content environments to provide users with content personalized to their user preferences and usage environment is one of the objectives of the project. The work presented in this paper describes how media formats with their related metadata are automatically annotated and dynamically adapted. Based on the architecture, a full-featured demonstrator is built.
Data visualization applications in virtual globe software
Authors: Situ Studio, William Cotton, Nate Hill, Alicia Gibb
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

Focusing on the intersection of visual data mapping and virtual globe software, this application is part digital library and part analytical tool. It combines data sets into a collaborative database and visualizes the information through Google Earth overlays. This user-centered interface makes previously hard-to-use public information (e.g. census data) accessible and easily interpretable. We are presenting an interactive application named GeoDatum that allows users to upload their databases and display this information through a number of visualization tools, either individually or comparatively. The software is an open source web application with multiple goals. Primarily, it is a central repository for both geographic boundaries and the data related to those boundaries. In addition, it gives users the ability to create dynamic visualizations viewable in Google Earth's extensible KML environment, complete with full 3D renderings and animations. The trade-off is that anyone who wants to use the application to generate visualizations will leave their data for public use. The software's core functionality is to allow users to import their own Shapefiles as well as CSVs containing data about the geographic areas. Shapefiles are an industry standard GIS format supported by numerous software applications including ArcGIS. This software will convert this information into KML files and Google Earth overlays. While it can display publicly available data sets, it also allows a user to include their own information, thus making it a useful internal analytic tool for private interests as well. We will present a case study done with the Brooklyn Public Library that utilizes this tool in the service of a project on urban planning and analysis.
From the Archives: The U.S. and West German Agent Radio Ciphers
Authors: Jan Bury
Venue: Cryptologia (2007)

The translation of an in-house research paper of the communist Polish counterintelligence depicting the ciphers and the one-way radio communications patterns used by the U.S. and West German intelligence services against Poland in the 1960s and early 1970s is presented.
Efficient cooperative search of smart targets using uav swarms1
Authors: Yaniv Altshuler, Vladimir Yanovsky, Israel a. Wagner, Alfred m. Bruckstein
Venue: Robotica (2008)

This work examines the Cooperative Hunters problem, where a swarm of unmanned air vehicles (UAVs) is used for searching one or more “evading targets,” which are moving in a predefined area while trying to avoid a detection by the swarm. By arranging themselves into efficient geometric flight configurations, the UAVs optimize their integrated sensing capabilities, enabling the search of a maximal territory.
Inversion handling for stable deformable modeling
Authors: Ruediger Schmedding, Matthias Teschner
Venue: The Visual Computer: International Journal of Computer Graphics (2008)

In 3D deformable modeling approaches based on FEM, inverted tetrahedral elements can cause undesired visual artifacts and the breakdown of the simulation. As inversion can never be avoided and sometimes is even the correct behavior of elements, there is a strong need for stable inversion handling. In this paper, we propose a novel method to resolve inverted elements which is motivated by previous work of Irving et al. [6]. In combination with an efficient handling of degenerated elements, our approach yields a stable simulation of arbitrary deformations. Although we focus on the corotational formulation of linear FEM, the method can be implemented within arbitrary constitutive models.
A catalog of architectural primitives for modeling architectural patterns
Authors: Uwe Zdun, Paris Avgeriou
Venue: Information and Software Technology (2008)

Architectural patterns are a fundamental aspect of the architecting process and subsequently the architectural documentation. Unfortunately, there is only poor support for modeling architectural patterns for two reasons. First, patterns describe recurring design solutions and hence do not directly match the elements in modeling languages. Second, they support an inherent variability in the solution space that is hard to model using a single modeling solution. This paper proposes to address this problem by finding and representing architectural primitives: fundamental, formalized modeling elements in representing patterns. In particular, we examined architectural patterns from the components and connectors architectural view, and we discovered recurring primitive abstractions among the patterns, that also demonstrate a degree of variability for each pattern. We used UML 2 as the language for representing these primitive abstractions as extensions of the standard UML elements. The contribution of this approach is that we provide a generic and extensible concept for modeling architectural patterns by means of architectural primitives. Also, we can demonstrate a first set of primitives that participate in several well-known architectural patterns.
Defining the abstract syntax of visual languages with advanced graph grammars-A case study based on behavior trees
Authors: Lars Grunske, Kirsten Winter, Nisansala Yatapanage
Venue: Journal of Visual Languages and Computing (2008)

Diagrammatic visual languages can increase the ability of engineers to model and understand complex systems. However, to effectively use visual models, the syntax and semantics of these languages should be defined precisely. Since most diagrammatic visual models that are currently used to specify systems can be described as (directed) typed graphs, graph grammars have been identified as a suitable formalism to describe the abstract syntax of visual modeling languages. In this article, we investigate how advanced graph-transformation techniques, such as conditional, structure-generic and type-generic graph-transformation rules, can help to improve and simplify the specification of the abstract syntax of a visual modeling language. To demonstrate the practicability of an approach that unifies these advanced graph-transformation techniques, we define the abstract syntax of behavior trees (BTs), a graphical specification language for functional requirements. Additionally, we provide a translational semantics of BTs by formalizing a translation scheme to the input language of the SAL model checking tool for each of the graph-transformation rules.
RFID-Based Ubiquitous Learning Environment for School Students
Authors: Jiangtao Yin, Xudong Yang
Venue: Proceedings of the Fifth IEEE International Conference on Wireless, Mobile, and Ubiquitous Technology in Education (2008)

In recent years, with the advancements in mobile, wireless and radio frequency identification (RFID) technologies invisible computers are embedded in one’s life and working environment and also with the growing of home internet appliances and wide use of RFID tags, it will be possible to realize the intelligence exchange with surrounding matters. When these technologies are used in educational settings, new learning opportunities arise, but new issues also emerge, and one of the issues is how learning can be managed across contexts such as home and school. In this paper we propose a Ubiquitous Learning Environment with Educational Resources (ULEER) based on ubiquitous computing, RFID and the Internet to assist school students to improve their learning effect. With using the ULEER, students can learn at any time, any where. And the ULEER also provides suitable learning support to help the students focus on the learning behaviors by collecting the data regarding their behaviors. Also, we present a validation scenario application, which includes a series of learning activities.
Browsing personal digital photograph collections with spatial and temporal based ontology and MPEG-7 dozen dimensional digital content architecture
Authors: Pei-Jeng Kuo, Terumasa Aoki, Hiroshi Yasuda
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

The current trend of image retrieval is to incorporate the image visual features used in Content Based Image Retrieval (CBIR) and semantics annotations used in Metadata Based Image Retrieval to enhance retrieval performance. Because of the pervasive of consumer imaging devices, building personal digital photograph libraries became an increasingly interested domain. Personal digital photograph collections have specific characteristics compare to general purpose image databases. Hence, annotation architecture specially designed for that plays an important role in building an interoperatable data repository for future indexing, browsing and retrieving purposes. We propose a MPEG- 7 based multimedia content description architecture, Dozen Dimensional Digital Content (DDDC), which annotates multimedia data with twelve main attributes regarding its semantic representation. In addition, we also proposed a machine-understandable "Spatial and Temporal Based Ontology" representation for the above DDDC semantics description to enable semi-automatic annotation process.
A new criterion for MPR selection in OLSR
Authors: A. Baayer, N. Enneya, M. El Koutbi
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

The Optimized Link State Protocol (OLSR) routing protocol, is an optimization of link state protocols designed for mobile adhoc networks. OLSR is suitable for large and dense adhoc networks. For the learning routes process, it uses the flooding technique based on multipoint relays (MPR) which make it possible to reach all nodes in the network with a limited number of broadcasts. OLSR evaluates links with neighbour nodes before including them in the neighbouring MPR base. We aim to improve the process of MPR election based on mobility that can be estimated periodically during the exchange of HELLO messages.
Manufacturing lot sizing with backordering, scrap, and random breakdown occurring in inventory-stacking period
Authors: Singa Wang Chiu, Yuan-Shyi Peter Chiu
Venue: Proceedings of the 2nd WSEAS International Conference on Circuits, Systems, Signal and Telecommunications (2008)

This paper is concerned with determination of optimal lot size for an economic manufacturing quantity model with backordering, scrap and breakdown occurring in inventory-stacking period. Generation of defective items and random breakdown of production equipment are inevitable in most real-life manufacturing systems. To cope with the stochastic machine failures, production planners practically calculate the mean time between failures (MTBF) and establish the robust plan accordingly, in terms of optimal lot size that minimizes total production-inventory costs for such an unreliable system. Random scrap rate is considered in this study, and breakdown is assumed to occur in inventory stacking period. Mathematical modeling and analysis is used and the renewal reward theorem is employed to cope with the variable cycle length. An optimal manufacturing lot size that minimizes the long-run average costs for such an imperfect system is derived. Numerical example is provided to demonstrate its practical usages.
Testing for buffer overflows with length abstraction
Authors: Ru-Gang Xu, Patrice Godefroid, Rupak Majumdar
Venue: Proceedings of the 2008 international symposium on Software testing and analysis (2008)

We present Splat, a tool for automatically generating inputs that lead to memory safety violations in C programs. Splat performs directed random testing of the code, guided by symbolic execution. However, instead of representing the entire contents of an input buffer symbolically, Splat tracks only a prefix of the buffer symbolically, and a symbolic length that may exceed the size of the symbolic prefix. The part of the buffer beyond the symbolic prefix is filled with concrete random inputs. The use of symbolic buffer lengths makes it possible to compactly summarize the behavior of standard buffer manipulation functions, such as string library functions, leading to a more scalable search for possible memory errors. While reasoning only about prefixes of buffer contents makes the search theoretically incomplete, we experimentally demonstrate that the symbolic length abstraction is both scalable and sufficient to uncover many real buffer overflows in C programs. In experiments on a set of benchmarks developed independently to evaluate buffer overflow checkers, Splat was able to detect buffer overflows quickly, sometimes several orders of magnitude faster than when symbolically representing entire buffers. Splat was also able to find two previously unknown buffer overflows in a heavily-tested storage system.
Responsive Fault-Tolerant Computing in the Era of Terascale Integration State of Art Report
Authors: Paul Devadoss Ezhilchelvan
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

Scaling in hardware integration process results in IC-process geometry reductions, lower operating voltages and increased clock speeds. This paper first surveys the reliability obstacles these developments give rise to and then points out that computing systems can no longer be safely assumed to fail only by crashing. Yet this assumption is at the core of primary-backup replication which the literature presents as the appropriate, and hence the most widely used, strategy for time-critical fault-tolerant applications. The paper then observes that building computing nodes with announced crash failure mode is a promising way forward to deal with the emerging reliability challenges. Work carried out to assure such a failure mode has also been briefly surveyed.
Protecting bus-based hardware IP by secret sharing
Authors: Jarrod A. Roy, Farinaz Koushanfar, Igor L. Markov
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Our work addresses protection of hardware IP at the mask level with the goal of preventing unauthorized manufacturing. The proposed protocol based on chip locking and activation is applicable to a broad category of electronic systems with a primary bus. Such designs include (1) numerous IP offerings for USB, PCI, PCI-E, AMBA and other bus standards typically used in system-on-a-chip designs and computer peripherals, (2) SRAM-based FPGAs that are programmed through an input bus, (3) general-purpose and embedded microprocessors, including soft cores, (4) DSPs, (5) network processors, and (6) game consoles. Our key insight is that such designs can be locked by scrambling the central bus by controlled reversible bit-permutations and substitutions. To securely establish a unique code per chip to control bus scrambling, we employ true random number generators and Diffie-Hellman cryptography during activation.
A mobile physiological monitoring system for patient transport
Authors: Jui-Chi Shen, Dong-Her Shih, Hsiu-Sen Chiang, Shih-Bin Lin
Venue: Journal of High Speed Networks (2007)

More and more intra-hospital transport of patients is required to perform special examination or therapy in recent years. The key point of all critical care transport is the continuous monitoring of vital signs. Also, with the growing popularity of wireless technology in the health care area, there is a pressing need to have a proper system in place for patient identification. Errors in patient identification and hence improper administrator of medication can lead to disastrous results. This paper proposes a mobile physiological patient monitoring system, which integrates current mobile smart phone, wireless sensor network, Bluetooth, and RFID patient identification systems for patient monitoring. This system enables continuous monitoring and patient identification during intra-hospital or inter-hospital patient transport.
Divisibility tests (abstract only)
Authors: Randall Wolfe
Venue: ACM Communications in Computer Algebra (2008)

Divisibility tests have always fascinated people. My project shows tricks of how you can tell if really large numbers can be divisible by smaller numbers. Modular arithmetic is utilized to find and analyze divisibility tests. Three methods (Ending Digits Test, Sum of Digits Test, and Alternating Sum of Digits Test) in which you can test divisibility of a number (a) by a number (d) and proofs are presented in this poster.
Towards a Unified Framework for Cohesion Measurement in Aspect-Oriented Systems
Authors: Avadhesh Kumar, Rajesh Kumar, P. S. Grover
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

Aspect-Oriented Programming (AOP) is an emerging technique that provides a means to cleanly encapsulate and implement aspects that crosscut other modules. However, despite an interesting body of work for measuring cohesion in Aspect-Oriented (AO) Systems, there is poor understanding of cohesion in the context of AOP. Most of the proposed cohesion assessment framework and metrics for AOP are for AspectJ programming language. In this paper we have defined a generic cohesion framework that takes into account two, the most well known families of available AOP languages, AspectJ and CaesarJ. This unified framework contributes in better understanding of cohesion in AOP, witch can contribute in (i) comparing measures and their potential use, (ii) integrating different existing measures which examine the same concept in different ways, and (iii) defining new cohesion metrics, which in turn permits the analysis and comparison of Java, AspectJ and CaesarJ implementations.
Introduction a novel approach for power system load-frequency control
Authors: Shabnam Vahdati Daneshmand, Ahad Kazemi, Shahram Jadid
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

In this paper a novel approach design for load-frequency control (LFC) of power systems is proposed. In this approach, artificial neural network (ANN) trained with the real-time recurrent learning (RTRL) algorithm is used to control power systems. This algorithm works on real time. So it is the best algorithm for training the ANN controller in comparison with other neural network algorithms for LFC of power systems. The superiority of the proposed method over conventional integral controller is verified from simulations and comparisons. The proposed controller provides faster responses with lower overshoots. With this controller, steady state error of frequencies and interchanges of tie-lines are maintained in desired values.