ppxscal/embedding_network huggingface dataset:
Architectural Decisions in e-Services Design
Authors: Olaf Zimmermann
Venue: Proceeding of the 2008 conference on Techniques and Applications for Mobile Commerce: Proceedings of TAMoCo 2008 (2008)

The design of e-services requires software architects to analyze many domain-specific requirements; the required architectural decisions recur. Many of them are motivated by cross-cutting concerns such as security, transactionality, and reliability. The decision making is driven by many forces; no single design fits all purposes. Some of these concerns can be expressed as model-and code-level aspects; others are better tackled by more conservative implementation practices. In this talk, we present architectural decision modeling as an emerging technique to transform such architectural knowledge from tacit, tribal knowledge into an explicit, manageable form. We present a three-step decision making framework, which supports the semi-automatic identification of decisions in requirements models and the injection of decisions into model and code aspects. We outline a reusable decision model for service-oriented architecture and e-services design, currently being harvested from completed projects. We conclude with a call to action for further research.
Browser Security: Lessons from Google Chrome
Authors: Charles Reis, Adam Barth, Carlos Pizano
Venue: Queue (2009)

Google Chrome developers focused on three key problems to shield the browser from attacks.
A Formal Translation From an Imperative Language With Array to a Declarative Language
Authors: D. Godbout, B. Ktari, M. Mejri
Venue: Proceeding of the 2006 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the fifth SoMeT_06 (2006)

The goal of this paper is to present a translation function of programs written in an imperative language with array to programs written in a declarative language. The two languages used, L1 and L2, are extensions of the languages introduced by [1] which supported expressions needed by a programming language such as assignment, loops and conditional branching. To those, were added expressions related to array creation (x = allocate(y)), manipulation (x[1] = 9) and destruction (free(x)). The original translation function also needed some modifications to migrate program with array definitions from L1 to L2. Indeed, the original translation function could not handle a single variable having multiple definitions at different offsets (indexes).
Furstyling on angle-split shell textures
Authors: Bin Sheng, Hanqiu Sun, Gang Yang, Enhua Wu
Venue: Computer Animation and Virtual Worlds (2009)

This paper presents a new method for modeling and rendering fur with a wide variety of furstyles. We simulate virtual fur using shell textures&mdash;a multiple layers of textured slices for its generality and efficiency. As shell textures usually suffer from the inherent visual gap errors due to the uniform discretization nature, we present the angle-split shell textures (ASST) approach, which classifies the shell textures into different types with different numbers of texture layers, by splitting the angle space of the viewing angles between fur orientation and view direction. Our system can render the fur with biological patterns, and utilizes vector field and scalar field on ASST to control the geometric variations of the furry shape. Users can intuitively shape the fur by applying the combing, blowing, and interpolating effects in real time. Our approach is intuitive to implement without using complex data structures, with real-time performance for dynamic fur appearances. Copyright &copy; 2009 John Wiley & Sons, Ltd. This paper presents the angle-split shell textures (ASST) method for modelling and rendering fur with a wide variety of furstyles. This method classifies the shell textures into different types with different numbers of texture layers, by splitting the angle space of the viewing angles between fur orientation and view direction. Our system can render the fur with biological patterns, and utilize ASST to control the geometric variations of the furry shape.
The proposed autonomous mobile robot navigation system
Authors: Ouarda Hachour
Venue: Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems (2008)

The aim of this work is to develop an algorithm which allows a mobile robot to navigate through static obstacles, and finding the path in order to reach a specified target. We propose an algorithm that provides the robot a trajectory to be followed to move from the initial position to the specified target. The robot trajectory is designed in a grid-map form of a known environment with static obstacles. The robot moves within the environment by sensing and avoiding the obstacles coming across its way towards the known target. The algorithms are implemented in visual basic and DELPHI programming language; whereby the environment is studied in a two dimensional coordinate system. The simulation part is an approach to the real expected result; this part is done using DELPHI with version 7, and visual basic. The algorithms permit the robot to move from the initial position to the desired position following an estimated trajectory.
Unified mechanisms for structural relaxation and crystallization in phase-change memory devices
Authors: D. Ielmini, M. Boniardi, A. L. Lacaita, A. Redaelli, A. Pirovano
Venue: Microelectronic Engineering (2009)

Data retention in phase-change memory (PCM) devices is the result of two physical phenomena: structural relaxation (SR) and crystallization of the amorphous chalcogenide material. Although the two processes are rather different, we show in this paper that a common physical interpretation for SR and crystallization kinetics is possible. Activation energies and Arrhenius pre-factors for SR and crystallization are found to coherently obey a Meyer-Neldel rule and are explained by many-body thermal excitation of weakly-bonded and normally-bonded clusters, respectively.
Directional Beaconing: A Robust WiFi Positioning Method Using Angle-of-Emission Information
Authors: Kensaku Kawauchi, Takashi Miyaki, Jun Rekimoto
Venue: Proceedings of the 4th International Symposium on Location and Context Awareness (2009)

WiFi-based positioning has been widely used because it does not require any additional sensors for existing WiFi mobile devices. However, positioning accuracy based on radio signal strength is often influenced by noises, reflections, and obstacles. The Time-of-Arrival (TOA) or Angle-of-Arrival (AOA) methods may be used, but both require additional sensing mechanisms and cannot be applied to existing WiFi mobile devices. In this paper, we propose a new WiFi-based positioning method called directional beaconing. This method uses the Angle-of-Emission (AOE) method instead of the AOA. Using this method, access points (APs) emit beacon signals through rotating directional antennas with angle information encoded in beacons. WiFi devices estimate the direction and distance to the AP by receiving and decoding these beacons. This method integrates the advantages of the AOA and signal strength methods without requiring additional sensors. We constructed revolving directional APs and verified positioning accuracy is improved using the proposed method.
Simultaneous phylogeny reconstruction and multiple sequence alignment
Authors: Jijun Tang
Venue:  (2008)

A phylogeny is the evolutionary history of a group of organisms and is one of the most important tools in biology. The process of phylogeny inference from molecular sequences always starts with a multiple sequence alignment, which is another fundamental task in computational biology. High quality multiple sequence alignments can be used to verify homologous residues among a set of given sequences and further reveal information on structural or functional evolution. In this dissertation, we present a new system MSAM to simultaneously align multiple sequences and search for the phylogenetic tree. It is widely accepted that a good phylogenetic tree can help produce high quality alignment, but the direct dynamic programming solution grows exponentially. We propose an algorithm that can produce optimal alignment for three sequences and infer their common ancestor sequence. It is based on dynamic programming, so the result is optimal. At the same time, a divide-and-conquer strategy is adopted in this algorithm to reduce its memory space from O(n 3) to O(n2). By iteratively relabeling the internal nodes with the above procedure, we can achieve the goal of tree refinement and produce the best sequence alignment for any given tree. We also implement the hill-climbing strategies (such as NNI and TBR) to search for the best tree in the large tree space. In summary, our algorithm is an effort to unify the two procedures of phylogenetic reconstruction and sequence alignment.
Network adiabatic theorem: an efficient randomized protocol for contention resolution
Authors: Shreevatsa Rajagopalan, Devavrat Shah, Jinwoo Shin
Venue: Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems (2009)

The popularity of Aloha-like algorithms for resolution of contention between multiple entities accessing common resources is due to their extreme simplicity and distributed nature. Example applications of such algorithms include Ethernet and recently emerging wireless multi-access networks. Despite a long and exciting history of more than four decades, the question of designing an algorithm that is essentially as simple and distributed as Aloha while being efficient has remained unresolved. In this paper, we resolve this question successfully for a network of queues where contention is modeled through independent-set constraints over the network graph. The work by Tassiulas and Ephremides (1992) suggests that an algorithm that schedules queues so that the summation of `weight' of scheduled queues is maximized, subject to constraints, is efficient. However, implementing such an algorithm using Aloha-like mechanism has remained a mystery. We design such an algorithm building upon a Metropolis-Hastings sampling mechanism along with selection of `weight' as an appropriate function of the queue-size. The key ingredient in establishing the efficiency of the algorithm is a novel adiabatic-like theorem for the underlying queueing network, which may be of general interest in the context of dynamical systems.
Two algorithms for generating structured and unstructured monotone ordinal data sets
Authors: Rob Potharst, Arie Ben-David, Michiel van Wezel
Venue: Engineering Applications of Artificial Intelligence (2009)

Monotone constraints are very common while dealing with multi-attribute ordinal problems. Grinding wheels hardness selection, timely replacements of costly laser sensors in silicon wafer manufacturing, and the selection of the right personnel for sensitive production facilities, are just a few examples of ordinal problems where monotonicity makes sense. In order to evaluate the performance of various ordinal classifiers one needs both artificially generated as well as real world data sets. Two algorithms are presented for generating monotone ordinal data sets. The first can be used for generating random monotone ordinal data sets without an underlying structure. The second algorithm, which is the main contribution of this paper, describes for the first time how structured monotone data sets can be generated.
Median Topographic Maps for Biomedical Data Sets
Authors: Barbara Hammer, Alexander Hasenfuss, Fabrice Rossi
Venue: Similarity-Based Clustering: Recent Developments and Biomedical Applications (2009)

Median clustering extends popular neural data analysis methods such as the self-organizing map or neural gas to general data structures given by a dissimilarity matrix only. This offers flexible and robust global data inspection methods which are particularly suited for a variety of data as occurs in biomedical domains. In this chapter, we give an overview about median clustering and its properties and extensions, with a particular focus on efficient implementations adapted to large scale data analysis.
Exploring the effects of SourceForge.net coordination and communication tools on the efficiency of open source projects using data envelopment analysis
Authors: Stefan Koch
Venue: Empirical Software Engineering (2009)

In this paper we explore possible benefits of communication and coordination tools in open source projects using an efficiency score derived from data envelopment analysis (DEA) as dependent variable. DEA is a general non-parametric method for efficiency comparisons without asking the user to define any relations between different factors or a production function. The method can account for economies or diseconomies of scale, and is able to deal with multi-input, multi-output systems in which the factors have different scales. Using two different data sets, successful and random open source projects, retrieved from SourceForge.net, we analyze impacts on their efficiency from the usage of communication and coordination tools. The results were mixed with no clear positive effects being proven consistently: In the data set of successful projects, mostly negative influences were found. On the contrary, tool adoption showed positive relationships to efficiency in the random data set. This stresses the importance of development status as a moderating variable and might also hint at threshold values for tool benefits. In addition, adoption of tools outside the hosting platform may be more likely for successful projects.
Technical Section: A divide-and-conquer approach for automatic polycube map construction
Authors: Ying He, Hongyu Wang, Chi-Wing Fu, Hong Qin
Venue: Computers and Graphics (2009)

Polycube map is a global cross-surface parameterization technique, where the polycube shape can roughly approximate the geometry of modeled objects while retaining the same topology. The large variation of shape geometry and its complex topological type in real-world applications make it difficult to effectively construct a high-quality polycube that can serve as a good global parametric domain for a given object. In practice, existing polycube map construction algorithms typically require a large amount of user interaction for either pre-constructing the polycubes with great care or interactively specifying the geometric constraints to arrive at the user-satisfied maps. Hence, it is tedious and labor intensive to construct polycube maps for surfaces of complicated geometry and topology. This paper aims to develop an effective method to construct polycube maps for surfaces with complicated topology and geometry. Using our method, users can simply specify how close the target polycube mimics a given shape in a quantitative way. Our algorithm can both construct a similar polycube of high geometric fidelity and compute a high-quality polycube map in an automatic fashion. In addition, our method is theoretically guaranteed to output a one-to-one map. To demonstrate the efficacy of our method, we apply the automatically-constructed polycube maps in a number of computer graphics applications, such as seamless texture tiling, T-spline construction, and quadrilateral mesh generation.
On-demand fingerprint selection for 802.11-based positioning systems
Authors: Thomas King, Thomas Haenselmann, Wolfgang Effelsberg
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

Fingerprinting is a popular technology for 802.11-based positioning systems: Radio characteristics from different access points are measured at various positions and stored in a database. The database is copied to all mobile devices, and in case that a position estimate is needed, the device compares its currently measured radio characteristics with all the database entries. In this paper, we present two on-demand fingerprint selection algorithms to avoid the cumbersome and time-consuming approach of manually copying all fingerprints. Our algorithms only request those fingerprints from the database that are currently required to compute a position. The two algorithms differ in the way they shape the region for which fingerprints are requested. On-demand selection also allows storage-restricted mobile devices to utilize the positioning system. We carefully evaluate our algorithms in a real-world experiment. The results show that our algorithms do not harm the position accuracy of the positioning system. In addition, we analyze the space requirements of our algorithms and show that the typical constraints of mobile devices are met.
A tightly coupled finite field arithmetic hardware in an FPGA-based embedded processor core for elliptic curve cryptography
Authors: M. Khalil-Hani, A. Irwansyah, Y. W. Hau
Venue: International Journal of Information and Communication Technology (2009)

This work presents the implementation of a tightly-coupled hardware architectural enhancement to the Altera FPGA-based Nios II embedded processor. The goal is to accelerate finite field arithmetic operations in the binary fields of F&lt;SUB align=right&gt;2&lt;SUP align=right&gt;163&lt;/SUP&gt; and F&lt;SUB align=right&gt;2&lt;SUP align=right&gt;193&lt;/SUP&gt;, for application in a high-performance embedded system implementing elliptic curve cryptography (ECC). The concept is to augment the embedded processor with a few custom instructions for fast finite field arithmetic operations. Instead of a coprocessor, hardware acceleration of the arithmetic operation is provided by custom logic tightly coupled to the processor core and directly controlled by the instruction stream. This concept, which may be considered as a hardware-software co-design approach, is evaluated by prototyping an elliptic curve cryptosystem (ECC) on an Altera Stratix FPGA development board. Experimental results shows that for the point multiplication operation, which is the core operation in an ECC computation, the implementation with custom instructions and tightly-coupled hardware is about 50&#37; faster than the coprocessor-based hardware.
In-browser summarisation: generating elaborative summaries biased towards the reading context
Authors: Stephen Wan, Cécile Paris
Venue: Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers (2008)

We investigate elaborative summarisation, where the aim is to identify supplementary information that expands upon a key fact. We envisage such summaries being useful when browsing certain kinds of (hyper-)linked document sets, such as Wikipedia articles or repositories of publications linked by citations. For these collections, an elaborative summary is intended to provide additional information on the linking anchor text. Our contribution in this paper focuses on identifying and exploring a real task in which summarisation is situated, realised as an In-Browser tool. We also introduce a neighbourhood scoring heuristic as a means of scoring matches to relevant passages of the document. In a preliminary evaluation using this method, our summarisation system scores above our baselines and achieves a recall of 57% annotated gold standard sentences.
Source Code Verification Tools for Software Security Bugs
Authors: Frédéric Michaud, Frédéric Painchaud
Venue: Proceeding of the 2006 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the fifth SoMeT_06 (2006)

We investigated errors and vulnerabilities that emerge from software defects in C/C++ and Java programs. This allowed us to create a meaningful testbench in order to evaluate best-of-breed automatic source code verification tools. Our results show that current static tools cannot significantly reduce the risk associated with confidential data processing in a military context. Dynamic tools should be used in conjunction in order to provide the necessary assurance level.
Modeling actions of PubMed users with n-gram language models
Authors: Jimmy Lin, W. John Wilbur
Venue: Information Retrieval (2009)

Transaction logs from online search engines are valuable for two reasons: First, they provide insight into human information-seeking behavior. Second, log data can be used to train user models, which can then be applied to improve retrieval systems. This article presents a study of logs from PubMed®, the public gateway to the MEDLINE® database of bibliographic records from the medical and biomedical primary literature. Unlike most previous studies on general Web search, our work examines user activities with a highly-specialized search engine. We encode user actions as string sequences and model these sequences using n-gram language models. The models are evaluated in terms of perplexity and in a sequence prediction task. They help us better understand how PubMed users search for information and provide an enabler for improving users' search experience.
Multi-output regression on the output manifold
Authors: Guangcan Liu, Zhouchen Lin, Yong Yu
Venue: Pattern Recognition (2009)

Multi-output regression aims at learning a mapping from an input feature space to a multivariate output space. Previous algorithms define the loss functions using a fixed global coordinate of the output space, which is equivalent to assuming that the output space is a whole Euclidean space with a dimension equal to the number of the outputs. So the underlying structure of the output space is completely ignored. In this paper, we consider the output space as a Riemannian submanifold to incorporate its geometric structure into the regression process. To this end, we propose a novel mechanism, called locally linear transformation (LLT), to define the loss functions on the output manifold. In this way, currently existing regression algorithms can be improved. In particular, we propose an algorithm under the support vector regression framework. Our experimental results on synthetic and real-life data are satisfactory.
Decision tree and first-principles model-based approach for reactor runaway analysis and forecasting
Authors: Tamas Varga, Ferenc Szeifert, Janos Abonyi
Venue: Engineering Applications of Artificial Intelligence (2009)

Decision trees (DTs) are effective in extracting linguistically interpretable models from data. This paper shows that DTs can also be used to extract information from process models, e.g. they can be used to represent homogenous operating regions of complex process. To illustrate the usefulness of this novel approach a detailed case study is shown where DTs are used for forecasting the development of runaway in an industrial, fixed bed, tube reactor. Based on first-principles knowledge and historical process data the steady-state simulator of the tube reactor has been identified and validated. The runaway criterion based on Ljapunov's indirect stability analysis has been applied to generate a data base used for DT induction. Finally, the logical rules extracted from the DTs are used in an operator support system (OSS), since they are proven to be useful to describe the safe operating regions. A simulation study based on the dynamical model of the process is also presented. The results confirm that by the synergistic combination of a DT based on expert system and the dynamic simulator a powerful tool for runaway forecasting and analysis is achieved and it can be used to work safe operating strategies out.