ppxscal/embedding_network huggingface dataset:
Two- and Three-Dimensional Asteroid Impact Simulations
Authors: Galen R. Gisler, Robert P. Weaver, Charles L. Mader, Michael L. Gittings
Venue: Computing in Science and Engineering (2004)

Performing a series of simulations of asteroid impacts using the SAGE code, the authors attempt to estimate the effect of tsunamis and other important environmental events. The code they developed treats multiple fluids with different equations of state and different constitutive models for material strength. The adaptive mesh can refine based on a number of criteria including gradients in physical conditions or material properties. The code uses MPI for portability among many parallel-processing platforms, but hides much of this interface in a library that gives the programmer maximum flexibility. The authors' ocean impact simulations have as a goal the estimation of impact-generated tsunami events as a function of the size and energy of the projectile, partly to aid further studies of potential threats from modest-sized Earth-crossing asteroids. The authors also present a preliminary report on a simulation of the impact that created the Chicxulub crater in Mexico's Yucatan peninsula, widely believed to be responsible for the mass extinctions at the end of the Cretaceous period. They also report on progress in developing betterconstitutive models for the geological materials involved in this impact and in cratering processes in general.
Mesh Vertex Pose and Position Interpolation Using Geometric Algebra
Authors: Rich Wareham, Joan Lasenby
Venue: Proceedings of the 5th international conference on Articulated Motion and Deformable Objects (2008)

This paper presents a method of interpolating between two or more general displacements (rotation and translation). The resulting interpolated path is smooth and possesses a number of desirable properties. It differs from existing algorithms which require factorising the pose into separate rotation and translation components and is derived from an intuitively appealing framework---i.e. a natural extension of the standard interpolation scheme for pure rotations. While this paper presents the theory behind the interpolation and its description as a tool, we also outline the possible advantages of using this technique for vision and graphics applications.
Improved Image Retrieval Using Automatic Image Sorting and Semi-automatic Generation of Image Semantics
Authors: Kai Uwe Barthel
Venue: Proceedings of the 2008 Ninth International Workshop on Image Analysis for Multimedia Interactive Services (2008)

In this paper we propose a new image search system using keyword annotations and low-level visual meta-data to generate inter-image relationships. Unlike other approaches the new system does not try to learn the degree of confidence between images and associated keywords. We rather propose to model the degree of similarity between images by building up a network of linked images. The weights of the inter-image links are learned from the users’ interaction with the system only. For each image search a set of candidate images is selected from a visually sorted arrangement of result images. This candidate set is used to refine the result by filtering out non-suiting images from a larger set of further result images. Semantic inter-image relation-ships of images can be modeled by collecting the candidate sets from many searches. Our system improves Internet image search significantly.
Online Frequency Assignment in Wireless Communication Networks
Authors: Francis Y. Chin
Venue: Proceedings of the 13th Annual international conference on Computing and Combinatorics (2007)

Wireless communication has many applications since its invention more than a century ago. The frequency spectrum used for communication is a scarce resource and the Frequency Assignment Problem (FAP), aiming for better utilization of the frequencies, has been extensively studied in the past 20-30 years. Because of the rapid development of new wireless applications such as digital cellular network, cellular phone, the FAP problem has become more important.In Frequency Division Multiplexing (FDM) networks, a geographic area is divided into small cellular regions or cells, usually regular hexagons in shape. Each cell contains one base station that communicates with other base stations via a high-speed wired network. Calls between any two clients (even within the same cell) must be established through base stations. When a call arrives, the nearest base station must assign a frequency from the available spectrum to the call without causing any interference with other calls. Interference may occur, which distorts the radio signals, when the same frequency is assigned to two different calls emanating from cells that are geographically close to each other. Thus the FAP problem can be viewed as a problem of multi-coloring a hexagon graph with the minimum number of colors when each vertex of the graph is associated with an integer that represents the number of calls in a cell.FAP has attracted more attention recently because of the following:a) Online analysis techniques: FAP problem is known to be NP-complete and many approximation algorithms have been proposed in the past. As frequency assignments have to be done without knowledge of future call requests and releases, online algorithms have been proposed and competitive analysis has been used to measure their performance.b) New technology and application: Wideband Code-Division Multiple-Access (W-CDMA) technology is a new technology used for the implementation of 3G cellular system. Orthogonal Variable Spreading Factor (OVSF) codes are used to satisfy requests with different data rate requirements. FAP with OVSF code trees representing the frequency spectrum becomes an important problem.
Selfish Bin Packing
Authors: Leah Epstein, Elena Kleiman
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

Following recent interest in the study of computer science problems in a game theoretic setting, we consider the well known bin packing problem where the items are controlled by selfish agents. Each agent is charged with a cost according to the fraction of the used bin space its item requires. That is, the cost of the bin is split among the agents, proportionally to their sizes. Thus, the selfish agents prefer their items to be packed in a bin that is as full as possible. The social goal is to minimize the number of the bins used. The social cost in this case is therefore the number of bins used in the packing.A pure Nash equilibrium is a packing where no agent can obtain a smaller cost by unilaterally moving his item to a different bin, while other items remain in their original positions. A Strong Nash equilibrium is a packing where there exists no subset of agents, all agents in which can profit from jointly moving their items to different bins. We say that all agents in a subset profit from moving their items to different bins if all of them have a strictly smaller cost as a result of moving, while the other items remain in their positions.We measure the quality of the equilibria using the standard measures PoA and PoS that are defined as the worst case worst/best asymptotic ratio between the social cost of a (pure) Nash equilibrium and the cost of an optimal packing, respectively. We also consider the recently introduced measures SPoA and SPoS, that are defined similarly to the PoA and the PoS, but consider only Strong Nash equilibria.We give nearly tight lower and upper bounds of 1.6416 and 1.6428, respectively, on the PoA of the bin packing game, improving upon previous result by Bilò, and establish the fact that PoS = 1. We show that the bin packing game admits a Strong Nash equilibrium, and that SPoA=SPoS. We prove that this value is equal to the approximation ratio of a natural greedy algorithm for bin packing.
Question Answering on the Semantic Web
Authors: Deborah L. McGuinness
Venue: IEEE Intelligent Systems (2004)

Question answering on the Web is moving beyond the stage where users simply type a query and retrieve a ranked ordering of appropriate Web pages. Users and analysts want targeted answers to their questions without extraneous information. This article presents a spectrum of techniques for improving question answering and discusses their potential uses and impact.
An Online Algorithm for Finding the Longest Previous Factors
Authors: Daisuke Okanohara, Kunihiko Sadakane
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

We present a novel algorithm for finding the longest factors in a text, for which the working space is proportional to the history text size. Moreover, our algorithm is online and exact; in that, unlike the previous batch algorithms [4, 5, 6, 7, 14], which needs to read the entire input beforehand, our algorithm reports the longest match just after reading each character. This algorithm can be directly used for data compression, pattern analysis, and data mining. Our algorithm also supports the window buffer, in that we can bound the working space by discarding the history from the oldest character. Using the dynamic rank/select dictionary [17], our algorithm requires n log¿ + O(n log¿) + O(n) bits of working space, and O(log3 n) time per character, O(n log3 n) total time, n is the length of the history, and ¿ is the alphabet size. We implemented our algorithm and compared it with the recent algorithms [4, 5, 14] in terms of speed and the working space. We found that our algorithm can work with a smaller working space, less than 1/2 of those for the previous methods in real-world data, and with a reasonable decline in speed.
Reliable and Efficient Alarm Message Routing in VANET
Authors: Hao Jiang, Hao Guo, Lijia Chen
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

In this paper, a reliable and efficient alarm message broadcast routing is proposed for VANET. Unlike other similar routing algorithms, REAR is based on the real wireless channel in VANET. REAR uses less broadcast packets to propagate alarm message. According to the theory model of wireless channel, it estimates the receipt probability of alarm messages for nodes. The contention scheme based on the receipt probability is used to select the optimized relay. Two approaches for utilizing the receipt probability and three functions for calculating contention delay are discussed and analyzed. The simulation and theory analysis are confirmed that REAR has a higher reliability and uses less broadcast packets than the location-based algorithm.
A Stochastic Model of the Interleukin (IL)-1β Network
Authors: Johnny Kelsey, Brian Henderson, Rob Seymour, Andy Hone
Venue: Proceedings of the 7th international conference on Artificial Immune Systems (2008)

The interleukin-1β network is a primary mediator of the inflammatory response and plays an important role in many immunological processes. A Markov chain model of the network is presented, along with results from iteration over the stochastic matrix. The stationary distribution of the model is analysed.
Index Sets of Computable Structures with Decidable Theories
Authors: Ekaterina B. Fokina
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

The index set of computable structures with decidable theory for some fixed infinite language &sigma; * is m---complete $\Sigma^{0,\emptyset^{(\omega)}}_2$.
Autonomous Decentralized Community Construction Technology for High Quality Information Service
Authors: Khalid Mahmood, Yuuya Kanamaru, Xiadong Lu, Kinji Mori
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

Ubiquitous proliferation of mobile devices calls for context aware services, considering location and time attribute simultaneously, in large area networks. Community system has been proposed to meet the varying requirements of users. This paper deals with provision of service assurance by letting each node autonomously decide the threshold value to initiate update highly volatile Time Distance variable. Depending upon position of node with respect to SP, this threshold value realizes balancing the trade-off between higher accuracy and traffic overhead. Moreover, by introducing the concept of locum cache, accuracy of system is improved parallel to significant decrease in overhead. Simulation results demonstrate the effectiveness of proposed technology in terms of improvement in accuracy and service assurance.
A Consensus Recommender for Web Users
Authors: Murat Göksedef, Şule Gündüz Öğüdücü
Venue: Proceedings of the 3rd international conference on Advanced Data Mining and Applications (2007)

In this paper, we propose a new hybrid recommendation model for web users which is based on multiple recommender systems working in parallel. With the rapid growth of the World Wide Web (www), it becomes a critical issue to find useful information from the Internet. Web recommender systems help people make decisions in this complex information space where the volume of information available to them is huge. Recently, a number of approaches have been developed to extract the user behavior from her navigational path and predict her next request as she visits Web pages. Some of these approaches are based on non-sequential models such as association rules and clustering, and some are based on sequential patterns. In this paper, we present a hybrid recommender model which combines the results of multiple recommender systems in an effective way. We have conducted a detailed evaluation on four different web usage data. Our results show that combining recommendation algorithms effectively leads a better recommendation accuracy. The experimental evaluation shows that our method can achieve a better prediction accuracy compared to standard recommendation systems while still guaranteeing competitive time requirements.
Combining Methods for Dynamic Multiple Classifier Systems
Authors: Amber Tomas
Venue: Proceedings of the 3rd IAPR workshop on Artificial Neural Networks in Pattern Recognition (2008)

Most of what we know about multiple classifier systems is based on empirical findings, rather than theoretical results. Although there exist some theoretical results for simple and weighted averaging, it is difficult to gain an intuitive feel for classifier combination. In this paper we derive a bound on the region of the feature space in which the decision boundary can lie, for several methods of classifier combination using non-negative weights. This includes simple and weighted averaging of classifier outputs, and allows for a more intuitive understanding of the influence of the classifiers combined. We then apply this result to the design of a multiple logistic model for classifier combination in dynamic scenarios, and discuss its relevance to the concept of diversity amongst a set of classifiers.We consider the use of pairs of classifiers trained on label-swapped data, and deduce that although non-negative weights may be beneficial in stationary classification scenarios, for dynamic problems it is often necessary to use unconstrained weights for the combination.
On Decidability and Expressiveness of Propositional Interval Neighborhood Logics
Authors: Davide Bresolin, Valentin Goranko, Angelo Montanari, Guido Sciavicco
Venue: Proceedings of the international symposium on Logical Foundations of Computer Science (2007)

Interval-based temporal logics are an important research area in computer science and artificial intelligence. In this paper we investigate decidability and expressiveness issues for Propositional Neighborhood Logics (PNLs). We begin by comparing the expressiveness of the different PNLs. Then, we focus on the most expressive one, namely, PNL ¿ + , and we show that it is decidable over various classes of linear orders by reducing its satisfiability problem to that of the two-variable fragment of first-order logic with binary relations over linearly ordered domains, due to Otto. Next, we prove that PNL ¿ + is expressively complete with respect to such a fragment. We conclude the paper by comparing PNL ¿ + expressiveness with that of other interval-based temporal logics.
Distributed Accelerometers as a Main Component in Detecting Activities of Daily Living
Authors: Josef Diermaier, Katharina Neyder, Franz Werner, Paul Panek, Wolfgang L. Zagler
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

In this paper we describe the use of accelerometers in a system aiming to detect Activities of Daily Living (ADLs) of elderly people in home environments. Our aim is to enable senior citizens to remain in their familiar home environments as long as possible by increasing their feeling for safety and autonomy in a minimally invasive way. Therefore we developed a ZigBee-based smart system which uses distributed accelerometers as main sensory component and does not need the resident to wear any artifact. In this way certain activity patterns could be recognized respecting the users' privacy. We gathered certain ADLs manually from the raw data and validated them in different ways. In this manner 151 out of 155 ADLs could be verified. In this paper an overview of the system together with the findings of the real life tests are presented.
Braille-Embedded Tactile Graphics Editor with Infty System
Authors: Toshihiro Kanahori, Masayuki Naka, Masakazu Suzuki
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

We are developing a graphics editor to easily draw Braille-embedded tactile graphics for scientific documents including mathematical expressions with Infty specialized system. Each graphics embedded in a document is cut out and characters on the graphics are recognized by InftyReader. The recognized graphics can be edited with this graphics editor, which is based on scalable vector graphics. Since, in the editor, ordinary texts and mathematical expressions on the recognized graphics are presented by InftyEditor, users can easily edit them with its input interface. After completing the edit process, all texts and mathematical expressions are automatically translated into Braille by our original Braille translator, InftyBraille. Then, the edited graphics is output as an EMF file. Embossing out the EMF file, users even who do not know Braille codes can get a Braille-embedded tactile graphics.
BSGI: An Effective Algorithm towards Stronger l-Diversity
Authors: Yang Ye, Qiao Deng, Chi Wang, Dapeng Lv, Yu Liu, Jianhua Feng
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

To reduce the risk of privacy disclosure during personal data publishing, the approach of anonymization is widely employed. On this topic, current studies mainly focus on two directions: (1)developing privacy preserving models which satisfy certain constraints, such as k-anonymity, l-diversity, etc.; (2)designing algorithms for certain privacy preserving model to achieve better privacy protection as well as less information loss. This paper generally belongs to the second class. We introduce an effective algorithm "BSGI" for the widely accepted privacy preserving model: l-diversity. In the meantime, we propose a novel interpretation of l-diversity: Unique Distinct l-diversity, which can be properly achieved by BSGI. We substantiate it's a stronger l-diversity model than other interpretations. Related to the algorithm, we conduct the first research on the optimal assignment of parameter l according to certain dataset. Extensive experimental evaluation shows that Unique Distinct l-diversity provides much better protection than conventional l-diversity models, and BSGI greatly outperforms the state of the art in terms of both efficiency and data quality.
General Ad Hoc Encryption from Exponent Inversion IBE
Authors: Xavier Boyen
Venue: Proceedings of the 26th annual international conference on Advances in Cryptology (2007)

Among the three broad classes of Identity-Based Encryption schemes built from pairings, the exponent inversion paradigm tends to be the most efficient, but also the least extensible: currently there are no hierarchical or other known extension of IBE based on those schemes. In this work, we show that such extensions can be realized from IBE systems that conform to a certain abstraction of the exponent inversion paradigm. Our method requires no random oracles, and is simple and efficient.
IBR-DTN: an efficient implementation for embedded systems
Authors: Michael Doering, Sven Lahde, Johannes Morgenroth, Lars Wolf
Venue: Proceedings of the third ACM workshop on Challenged networks (2008)

In our demonstration we present an implementation of DTN for embedded systems and demonstrate how a WLAN access point can be turned into a stand-alone DTN-node for mobile applications. The modular software design of "IBRDTN" is centered on the efficient use of resources and interoperability with the DTN2 reference implementation. Our modules comprise a DTN Core, Bundle Router, Persistent Storage and a Convergence Layer Manager. IBR-DTN is work in progress, but the comparison of the features and performance to DTN2 is already very promising. Finally, we present a practical evaluation in a mobile scenario in which a vehicle mounted node passes a stationary node.
Adaptive frame rate up-conversion based on motion classification
Authors: Xinbo Gao, Yue Yang, Bing Xiao
Venue: Signal Processing (2008)

In this paper, a new technique on video frame rate up-conversion (FRUC) is presented by combining the adaptive motion classification (AMC) for image sequences and the mixed motion estimation (ME). In the proposed FRUC scheme, the AMC classifies sequences into global and local motion sequences (G/LMS) whose advantages are fully utilized. The mixture of bidirectional ME (BDME) and unidirectional ME (UDME) is proposed to avoid hole and ''background replace object'' phenomenon in interpolated frames. Moreover, the motion vectors (MVs) refinement technique is employed to smooth MVs field. For LMS, the motion detection is used to deal with static background and occlusions are located by using forward prediction of motion regions. Correctional sum of absolute difference (CSAD) which gives more precise physical MVs field than conventional SAD is applied during all of the ME process. Simulation results demonstrate the effectiveness of the proposed FRUC algorithm.