ppxscal/embedding_network huggingface dataset:
FiPy: Partial Differential Equations with Python
Authors: Jonathan E. Guyer, Daniel Wheeler, James A. Warren
Venue: Computing in Science and Engineering (2009)

Partial differential equations (PDEs) are ubiquitous to the mathematical description of physical phenomena. Typical examples describe the evolution of a field in time as a function of its value in space, such as in wave propagation or heat flow. Many existing PDE solver packages focus on the important, but arcane, task of actually numerically solving the linearized set of algebraic equations that result from the discretization of a set of PDEs, but the need for many researchers is often higher level than that. They have the physical knowledge to describe their model, and can apply differential calculus to obtain appropriate governing conditions, but when faced with rendering those governing equations on a computer, their skills (or time) are limited to explicit finite differences on uniform square grids. Of the PDE solver packages that focus on an appropriately high level, many are proprietary, expensive, and difficult to customize. Consequently, scientists spend considerable resources repeatedly developing limited tools for specific problems.
Where Is My Peer? Evaluation of the Vivaldi Network Coordinate System in Azureus
Authors: Moritz Steiner, Ernst W. Biersack
Venue: Proceedings of the 8th International IFIP-TC 6 Networking Conference (2009)

Network coordinates allow to estimate the latency among a large number of hosts in a scalable way. Recently, Azureus, a popular implementation of BitTorrent, has implemented network coordinates. We have developed a crawler that allows us to obtain from the network coordinates over one hundred thousand peers running Azureus and to measure the network and application level round trip times to these peers.Our measurements confirm that network coordinates allow to correctly estimate the round trip time between two peers. Our measurements also show that the round trip times from our crawling host to a set of peers located in the same country can vary between a few tens of milliseconds to more than one second. This high variance is due to the large buffers in the ADSL access links, which can increase the round trip time by hundreds of milliseconds. As a consequence, network coordinates and round trip estimations in general cannot be used to select peers that are "nearby", such as peers connected to the same ISP or located in the same country.
Implementing UML associations in Java: a slim code pattern for a complex modeling concept
Authors: Dominik Gessenharter
Venue: Proceedings of the Workshop on Relationships and Associations in Object-Oriented Languages (2009)

Relationships are difficult to implement for two main reasons: Firstly, they provide a complex semantics for relating entities and secondly, relationships are not first class constructs in modern programming languages. The challenge of implementing relationships in code is to resolve the semantics of abstract model elements and turn them into references or pointers of the target language. Language extensions or libraries are often discussed as a means of facilitating the translation of relations into code. We present an approach that uses plain Java language concepts for the implementation of UML associations. We focus on symmetry of associations as well as on navigability, visibility and ownership of association ends and present a code pattern, that can easily be used for automatic code generation.
Learning as Meaning Negotiation: A Model Based on English Auction
Authors: Elisa Burato, Matteo Cristani
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

In this paper we focus upon a specific process of knowledge sharing, the meaning negotiation one, in presence of a number of negotiating subjects greater than two. Current approaches of the literature are based upon argumentation techniques, persuasion dialogue and game theory and all of them are specific of the negotiation subject and typically limited to two agents. In this paper we present a formalisation of the problem based upon a specific game, the English Auction, that results independent of the number of involved agents and of the negotiation subject. In our framework, each agent's viewpoint is denoted by a logical theory. We show that the problem as posed in the framework is decidable, under a very general assumption and that the computational complexity of the algorithm is polynomial in the number of agents and in the number of preferred representations of the agents.
A microwave probe nanostructure for atomic force microscopy
Authors: Y. Ju, M. Hamada, T. Kobayashi, H. Soyama
Venue: Microsystem Technologies (2009)

An atomic force microscope (AFM) probe on a GaAs wafer was studied as a new microwave probe structure. A waveguide was created by evaporating an Au film on the top and bottom surfaces of the GaAs AFM probe. The fabricated AMF probe&#x2019;s tip is 8&#x00a0;&#x03bc;m long and has a radius of curvature of about 50&#x00a0;nm. The open structure of the waveguide at the tip of the probe was generated by using focused ion beam (FIB) fabrication. AFM topography of a grating sample was created by using the fabricated microwave AFM probe. The fabricated probe exhibits nanometer-scale resolution, and microwave emission was successfully detected at the tip of the probe by approaching Cr&#x2013;V steel and Au wire samples.
Modeling and predicting user behavior in sponsored search
Authors: Josh Attenberg, Sandeep Pandey, Torsten Suel
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

Implicit user feedback, including click-through and subsequent browsing behavior, is crucial for evaluating and improving the quality of results returned by search engines. Several recent studies [1, 2, 3, 13, 25] have used post-result browsing behavior including the sites visited, the number of clicks, and the dwell time on site in order to improve the ranking of search results. In this paper, we first study user behavior on sponsored search results (i.e., the advertisements displayed by search engines next to the organic results), and compare this behavior to that of organic results. Second, to exploit post-result user behavior for better ranking of sponsored results, we focus on identifying patterns in user behavior and predict expected on-site actions in future instances. In particular, we show how post-result behavior depends on various properties of the queries, advertisement, sites, and users, and build a classifier using properties such as these to predict certain aspects of the user behavior. Additionally, we develop a generative model to mimic trends in observed user activity using a mixture of pareto distributions. We conduct experiments based on billions of real navigation trails collected by a major search engine's browser toolbar.
Play-it-by-eye! collect movies and improvise perspectives with tangible video objects
Authors: Cati Vaucelle, Hiroshi Ishii
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2009)

We present an alternative video-making framework for children with tools that integrate video capture with movie production. We propose different forms of interaction with physical artifacts to capture storytelling. Play interactions as input to video editing systems assuage the interface complexities of film construction in commercial software. We aim to motivate young users in telling their stories, extracting meaning from their experiences by capturing supporting video to accompany their stories, and driving reflection on the outcomes of their movies. We report on our design process over the course of four research projects that span from a graphical user interface to a physical instantiation of video. We interface the digital and physical realms using tangible metaphors for digital data, providing a spontaneous and collaborative approach to video composition. We evaluate our systems during observations with 4-to 14-year-old users and analyze their different approaches to capturing, collecting, editing, and performing visual and sound clips.
A communication model on implementing anycast service in mobile IPv6 networks
Authors: Xiao-Nan Wang, Huan-Yan Qian
Venue: International Journal of Systems, Control and Communications (2009)

This paper has proposes a new kind of Anycast communication model in a mobile IPv6 network. In this model, each mobile node has only one permanent address &ndash; the home address, and when a mobile node moves to a foreign area it does not need to register itself with its home agent or build a tunnel to transfer data packets, or in route optimisation it does not need to send an address-binding message to clients. In addition, this model can perform IPSec. The experimental data in an IPv6 simulation indicate that the performance of an Anycast service acquired in this model is better than the one in the existing model.
Event-Driven Visual Sensor Networks: Issues in Reliability
Authors: Alexandra Czarlinska, Deepa Kundur
Venue: Proceedings of the 2008 IEEE Workshop on Applications of Computer Vision (2008)

Event-driven visual sensor networks (VSNs) rely on a combination of camera nodes and scalar sensors to determine if a frame contains an event of interest that should be transmitted to the cluster head. The appeal of event-driven VSNs stems from the possibility of eliminating non-relevant frames at the source thus implicitly minimizing the amount of energy required for coding and transmission. The challenges of the event-driven paradigm result from the vulnerability of scalar sensors to attack or error and from the lightweight image processing available to the camera nodes due to resource constraints. In this work we focus on the reliability issues of VSNs in the case of global actuation attacks on the scalar sensors. We study the extent to which various utility functions enable an attacker to increase the average expected number of affected nodes with a relatively small penalty in the loss of stealth. We then discuss trade-offs between different attack detection strategies in terms of the cost of processing and the required information at the cluster head and nodes.
Derandomized Constructions of k-Wise (Almost) Independent Permutations
Authors: Eyal Kaplan, Moni Naor, Omer Reingold
Venue: Algorithmica (2009)

Constructions of k-wise almost independent permutations have been receiving a growing amount of attention in recent years. However, unlike the case of k-wise independent functions, the size of previously constructed families of such permutations is far from optimal. This paper gives a new method for reducing the size of families given by previous constructions. Our method relies on pseudorandom generators for space-bounded computations. In fact, all we need is a generator, that produces &#x201c;pseudorandom walks&#x201d; on undirected graphs with a consistent labelling. One such generator is implied by Reingold&#x2019;s log-space algorithm for undirected connectivity (Reingold/Reingold et al. in Proc. of the 37th/38th Annual Symposium on Theory of Computing, pp.&#x00a0;376&#x2013;385/457&#x2013;466, 2005/2006). We obtain families of k-wise almost independent permutations, with an optimal description length, up to a constant factor. More precisely, if the distance from uniform for any k tuple should be at most &#x03b4;, then the size of the description of a permutation in the family is $O(kn+\log \frac{1}{\delta})$.
On-line motif detection in time series with SwiftMotif
Authors: Erich Fuchs, Thiemo Gruber, Jiri Nitschke, Bernhard Sick
Venue: Pattern Recognition (2009)

This article presents SwiftMotif, a novel technique for on-line motif detection in time series. With this technique, frequently occurring temporal patterns or anomalies can be discovered, for instance. The motif detection is based on a fusion of methods from two worlds: probabilistic modeling and similarity measurement techniques are combined with extremely fast polynomial least-squares approximation techniques. A time series is segmented with a data stream segmentation method, the segments are modeled by means of normal distributions with time-dependent means and constant variances, and these models are compared using a divergence measure for probability densities. Then, using suitable clustering algorithms based on these similarity measures, motifs may be defined. The fast time series segmentation and modeling techniques then allow for an on-line detection of previously defined motifs in new time series with very low run-times. SwiftMotif is suitable for real-time applications, accounts for the uncertainty associated with the occurrence of certain motifs, e.g., due to noise, and considers local variability (i.e., uniform scaling) in the time domain. This article focuses on the mathematical foundations and the demonstration of properties of SwiftMotif-in particular accuracy and run-time-using some artificial and real benchmark time series.
Technical Section: Geometry-aware domain decomposition for T-spline-based manifold modeling
Authors: Hongyu Wang, Ying He, Xin Li, Xianfeng Gu, Hong Qin
Venue: Computers and Graphics (2009)

This paper presents a new and effective method to construct manifold T-splines of complicated topology/geometry. The fundamental idea of our novel approach is the geometry-aware object segmentation, by which an arbitrarily complicated surface model can be decomposed into a group of disjoint components that comprise branches, handles, and base patches. Such a domain decomposition simplifies objects of arbitrary topological type into a family of genus-zero/one open surfaces, each of which can be conformally parameterized into a set of rectangles. In contrast to the conventional decomposition approaches, our method can guarantee that the cutting locus are consistent on the parametric domain. As a result, the resultant T-splines of decomposed components are automatically glued and have high-order continuity everywhere except at the extraordinary points. We show that the number of extraordinary points of the domain manifold is bounded by the number of segmented components. Furthermore, the entire mesh-to-spline data conversion pipeline can be implemented with full automation, and thus, has potential in shape modeling and reverse engineering applications of complicated real-world objects.
Long-term software projects development: the affect of students' self-appreciation and initial expectations
Authors: Bruria Haberman, Cecile Yehezkel
Venue: Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education (2009)

The "Computer Science, Academia and Industry" extra-curricular program has been running at the Davidson Institute of Science Education for the past few years. The program, designed especially for high-school students majoring in computer science, aims to bridge the gap between the school and "real world" of computing.
Guidelines for designing graphical authentication mechanism interfaces
Authors: K. V. Renaud
Venue: International Journal of Information and Computer Security (2009)

The password era is drawing to a close. The latest technology is being released without keyboards, which makes password entry insecure and arduous. Furthermore, everyone is straining under the burden of multiple passwords and Personal Identification Numbers (PINs), and a viable knowledge-based alternative is urgently required. In the last few years a number of innovative graphical authentication mechanisms, which use pictures instead of alphanumeric strings, have been proposed. There is long-standing evidence that people remember pictures far better than they remember alphanumeric strings, so in terms of easing the memory load, pictures seem to offer a viable alternative. However, what is emerging from current research is that the design of such a graphical authentication mechanism interface can either make or break it, both in terms of security and usability. This paper will discuss various design options and make recommendations about how such systems should be designed in order to make them maximally efficacious while considering the level of risk associated with the resource being protected by the mechanism.
Visual search-based design and evaluation of screen magnifiers for older and visually impaired users
Authors: Zhengxuan Zhao, Pei-Luen Patrick Rau, Ting Zhang, Gavriel Salvendy
Venue: International Journal of Human-Computer Studies (2009)

The purpose of this study was to achieve the following goals: apply some principles in visual search theory to design and develop a screen magnifier; evaluate if applying such features could increase user performance; and make some recommendations for designing a screen magnifier according to the findings of the study. In order to achieve these goals, a screen magnifier and an experimental tool to present stimulus words were developed. Seventy-two elderly Chinese adults took part in the experiment. The findings indicate that, for a screen magnifier, the overlapping mode is superior to the parallel mode; the yellow-highlighted background is superior to the non-highlighted background; for lower-density text, the dual output mode (visual+auditory) is superior to the mono output mode (visual only), while for the higher-density text, no difference was found between the mono and dual output modes. Based on the findings, several recommendations are made. The overlapping mode should be set as the default working mode. Yellow could be a reasonable choice of background color for a magnifier when the text is black. Auditory output support should be used, and users should be advised to use dual output when the text density is lower and mono output when the text density is higher.
Agent Based Decision Support in Manufacturing Supply Chain
Authors: Per Hilletofth, Lauri Lättilä, Olli-Pekka Hilmola
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

Supply Chain Management (SCM) is becoming increasingly complex and an intensified competition in the end-markets has started to create a situation where co-operation requirements between companies in a Supply Chain (SC) are increasing. The old mechanistic operations management solutions are becoming obsolete and advanced decision support is increasingly needed to realize efficient and effective management of complex SCs. The objective of this research is to contribute to the understanding of how Agent Based Modeling (ABM) can advance decision making and to discuss why ABM should be regarded as method to realize Information Fusion (IF). In this research work an agent based model of SCM has been implemented in a simulation platform to provide an approach for evaluation of decision and management alternatives. Research shows that this kind of decision support system is based on IF, since it collects and fuses information from different sources into a situation image that provides effective support for human decision making
Effectiveness data transmission error detection using check sum control for military application
Authors: Nikolaos Doukas, Nikolaos Bardis
Venue: Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems (2008)

In this paper the technological aspects are presented concerning the error detection during digital data transmission and storage and its effectiveness needed for military applications. Also an analysis in theoretical level is completed for the effectiveness of error detection during digital data transmission and storage in information systems. Finally, the proposed method is based on the coding optimization to increase the effectiveness of the error detection during data transmission and data storage using the check sums for Military Applications.
Construct state modification in the Arabic Treebank
Authors: Ryan Gabbard, Seth Kulick
Venue: Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers (2008)

Earlier work in parsing Arabic has speculated that attachment to construct state constructions decreases parsing performance. We make this speculation precise and define the problem of attachment to construct state constructions in the Arabic Treebank. We present the first statistics that quantify the problem. We provide a baseline and the results from a first attempt at a discriminative learning procedure for this task, achieving 80% accuracy.
A process for supporting activity-oriented assessment of non-functional requirements on probability of failure and mean-time-to-repair
Authors: W. Eric Wong
Venue:  (2008)

As the importance of non-functional requirements has increased, many researchers in industry as well as academia have become interested in the notation, modeling, and assessment of non-functional requirements. However, the intrinsic features of non-functional requirements are so abstruse that there have been many issues which have not been addressed until now. In order to address one of the unsolved problems of non-functional requirements, we propose a systematic software development process to support the management of non-functional requirements. The process consists of six steps, which are composed of detailed activities to be performed in each step. Moreover, to support some activities, we propose the mapping rules and transformation algorithm which together translate UML activity diagram to Colored Petri Nets (CPN) model. The empirical studies show how the mapping rules and transformation algorithm may be adopted to model and analyze non-functional requirements. In addition, by means of a third-party tool, CPNTools, simulations are conducted on CPN model generated manually by use of the mapping rules and transformation algorithm proposed in this dissertation. We analyze the system model including non-functional requirements by simulation. Though we deal with the two non-functional requirements, the probability of failure and mean-time-to-repair in the UML activity diagram, we can extend our research to other non-functional requirements in the other UML diagrams. In other words, the proposed process can be extended to adapt to the other non-functional requirements. Also the development of new mapping and transformation approaches, which translate UML diagrams other than an activity diagram into formal notations other than CPN can be propelled as next research topics.