ppxscal/embedding_network huggingface dataset:
Aspects of GPU for general purpose high performance computing
Authors: Reiji Suda, Takayuki Aoki, Shoichi Hirasawa, Akira Nukada, Hiroki Honda, Satoshi Matsuoka
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

We discuss hardware and software aspects of GPGPU, specifically focusing on NVIDIA cards and CUDA, from the viewpoints of parallel computing. The major weak points of GPU against newest supercomputers are identified to be and summarized as only four points: large SIMD vector length, small memory, absence of fast L2 cache, and high register spill penalty. As software concerns, we derive optimal scheduling algorithm for latency hiding of host-device data transfer, and discuss SPMD parallelism on GPUs.
A large-scale empirical study of P3P privacy policies: Stated actions vs. legal obligations
Authors: Ian Reay, Scott Dick, James Miller
Venue: ACM Transactions on the Web (TWEB) (2009)

Numerous studies over the past ten years have shown that concern for personal privacy is a major impediment to the growth of e-commerce. These concerns are so serious that most if not all consumer watchdog groups have called for some form of privacy protection for Internet users. In response, many nations around the world, including all European Union nations, Canada, Japan, and Australia, have enacted national legislation establishing mandatory safeguards for personal privacy. However, recent evidence indicates that Web sites might not be adhering to the requirements of this legislation. The goal of this study is to examine the posted privacy policies of Web sites, and compare these statements to the legal mandates under which the Web sites operate. We harvested all available P3P (Platform for Privacy Preferences Protocol) documents from the 100,000 most popular Web sites (over 3,000 full policies, and another 3,000 compact policies). This allows us to undertake an automated analysis of adherence to legal mandates on Web sites that most impact the average Internet user. Our findings show that Web sites generally do not even claim to follow all the privacy-protection mandates in their legal jurisdiction (we do not examine actual practice, only posted policies). Furthermore, this general statement appears to be true for every jurisdiction with privacy laws and any significant number of P3P policies, including European Union nations, Canada, Australia, and Web sites in the USA Safe Harbor program.
Post-Silicon Clock-Timing Tuning Based on Statistical Estimation
Authors: Yuko Hashizume, Yasuhiro Takashima, Yuichi Nakamura
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In deep-submicron technologies, process variations can significantly affect the performance and yield of VLSI chips. As a countermeasure to the variations, post-silicon tuning has been proposed. Deskew, where the clock timing of flip-flops (FFs) is tuned by inserted programmable delay elements (PDEs) into the clock tree, is classified into this method. We propose a novel deskew method that decides the delay values of the elements by measuring a small amount of FFs' clock timing and presuming the rest of FFs' clock timings based on a statistical model. In addition, our proposed method can determine the discrete PDE delay value because the rewriting constraint satisfies the condition of total unimodularity.
Automatic Evaluation of Stroke Slope
Authors: Georgi Gluhchev, Ognian Boumbarov
Venue: Biometrics and Identity Management: First European Workshop, BIOID 2008, Roskilde, Denmark, May 7-9, 2008. Revised Selected Papers (2008)

An approach for the evaluation of the average slope of thestraight line strokes in signatures and handwritten text isdescribed. It is based on the properties of the Fourier Transformwhich allow accumulating energy of pixels lying on straight linesof same slope alongside a single straight line in the frequencydomain. The slope of the latter determines straightforwardly thestroke slope since both slopes differ in &pi;/2. The approach doesnot require image binarization.
Optimization of operation and changeover time for production planning and scheduling in a flexible manufacturing system
Authors: Kanchan Das, M. F. Baki, Xiangyong Li
Venue: Computers and Industrial Engineering (2009)

This paper deals with the production planning problem of a flexible manufacturing system. It specifically addresses issues of machine loading, tool allocation, and part type grouping with the intent of developing an operation sequencing technique capable of optimizing operation time, non-productive tool change times, and orientation change times when processing a group's design features. A hierarchical approach has been adopted to determine the part groups - depending on the operation, tool change and orientation change times at the upper level. At the next level, we sequence the operations of the part groups. Integer programming models are formulated to group the parts and to address the operation-sequencing problem. The model is illustrated with an example related to an auto engine cylinder head machining plant.
Chronos 1.0
Authors: Eric Riewer
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

In this animation short directed by four Gobelins students, a time traveller takes off for the first manned trip to the future ... but the past beckons.
Expressive scoping of distributed aspects
Authors: Éric Tanter, Johan Fabry, Rémi Douence, Jacques Noyé, Mario Südholt
Venue: Proceedings of the 8th ACM international conference on Aspect-oriented software development (2009)

Dynamic deployment of aspects brings greater flexibility and reuse potential, but requires proper means for scoping aspects. Scoping issues are particularly crucial in a distributed context: adequate treatment of distributed scoping is necessary to enable the propagation of aspect instances across host boundaries and to avoid inconsistencies due to unintentional spreading of data and computations in a distributed system. We motivate the need for expressive scoping of dynamically-deployed distributed aspects by an analysis of the deficiencies of current approaches for distributed aspects. Extending recent work on deployment strategies for non-distributed aspects, we then introduce a set of high-level strategies for specifying locality of aspect propagation and activation, and illustrate the corresponding gain in expressiveness. We present the operational semantics of our proposal using Scheme interpreters, first introducing a model of distributed aspects that covers the range of current proposals, and then extending it with dynamic aspect deployment. This work shows that, given some extensions to their original execution model, deployment strategies are directly applicable to the expressive scoping of distributed aspects.
Hydrodynamic simulation of surface traps in the AlGaN/GaN HEMT
Authors: A. Brannick, N. A. Zakhleniuk, B. K. Ridley, L. F. Eastman, J. R. Shealy, W. J. Schaff
Venue: Microelectronics Journal (2009)

Computer simulation of an AlGaN/GaN HEMT is carried out using commercially available software DESSIS. Traps located at the top of the AlGaN layer have been identified as being the primary source of electrons in the AlGaN/GaN HEMT. Recent experiments have focused on their role in HEMT performance with regard to the virtual gate effect and current collapse. In this work, analysis is carried out on these devices through the development of two different models designed to describe the 2DEG formation. Simulation of these models using the hydrodynamic model, which takes into account heating of the electrons, has been carried out to provide a more detailed understanding of the role of surface traps.
Integrating Visual Context and Object Detection within a Probabilistic Framework
Authors: Roland Perko, Christian Wojek, Bernt Schiele, Aleš Leonardis
Venue: Attention in Cognitive Systems: 5th International Workshop on Attention in Cognitive Systems, WAPCV 2008 Fira, Santorini, Greece, May 12, 2008 Revised Selected Papers (2009)

Visual context provides cues about an object's presence, position and size within an observed scene, which are used to increase the performance of object detection techniques. However, state-of-the-art methods for context aware object detection could decrease the initial performance. We discuss the reasons for failure and propose a concept that overcomes these limitations, by introducing a novel technique for integrating visual context and object detection. Therefore, we apply the prior probability function of an object detector, that maps the detector's output to probabilities. Together, with an appropriate contextual weighting, a probabilistic framework is established. In addition, we present an extension to state-of-the-art methods to learn scale-dependent visual context information and show how this increases the initial performance. The standard methods and our proposed extensions are compared on a novel, demanding image data set. Results show that visual context facilitates object detection methods.
Virtual address space mapping for IP auto-configuration in MANET with security capability
Authors: Majid Taghiloo, Mahnaz Tajamolian, Mehdi Dehghan, Raed Mousavi
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

Mobile Ad Hoc Networks (MANETs) are networks with self-organizing capabilities and without a fixed infrastructure. Wireless nodes communicate among themselves using multi-hop radio relaying, without requiring the packets to pass through a central access point or a base station. In a highly mobile and infrastructure-less scenario, pre-configuration of addresses is not possible. Therefore node addresses need to be configured dynamically with minimum delay and packet loss. Existing solutions for IP address auto-configuration do not address security issues. In this paper we propose a secure address auto-configuration for Mobile Ad hoc Networks (MANET) based on Virtual Address Space Mapping [1]. Without any proper authentication mechanism, a malicious node can affect the normal behavior of protocol. Therefore, this approach uses cryptography functions (one-way hash function and symmetric cryptography) to encountering of the all possible address auto-configuration attacks. The scheme uses virtual address space for addressing new nodes joining a network. The aim is to map one point from virtual address sheet to exactly one new node. The reason for using the term "virtual" is that the whole corresponding address space is a 2D flat sheet and each point of this sheet is virtually mapped to a node in MANET. The protocol uses coordinate values for generating addresses. Behavioral simulation had been used for analyzing of the protocol performance.
Context dependent class language model based on word co-occurrence matrix in LSA framework for speech recognition
Authors: Welly Naptali, Masatoshi Tsuchiya, Seiichi Nakagawa
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

We address the issue of data sparseness problem in language model (LM). Using class LM is one way to avoid this problem. In class LM, infrequent words are supported by more frequent words in the same class. This paper investigates a class LM based on LSA. A word-document matrix is usually used to represent a corpus in LSA framework. However, this matrix ignores word order in the sentence. We propose several word co-occurrence matrices that keep word order. Together with these matrices, we define a context dependent class (CDC) LM which distinguishes classes according to their context in the sentences. Experiments on Wall Street Journal (WSJ) corpus show that the word co-occurrence matrix works better than word-document matrix. Furthermore, the CDC achieves better perplexity than the traditional class LM based on LSA.
Distributed fault detection in industrial system based on sensor wireless network
Authors: K. K. Tan, S. N. Huang, Y. Zhang, T. H. Lee
Venue: Computer Standards Interfaces (2009)

In metal cutting processes, an effective monitoring system, based on a suitably developed scheme or set of algorithms can maintain machine tools in good condition and delay the occurrence of tool wear. In this paper, an approach is developed for fault detection based on a distributed system. Firstly, identifying of sensor instrumentation system is responsible for the signal processing and the system fault information. Secondly, the sensor wireless networks are used to transmit the data (lower layer) to or receive the commands from the computer center (top layer). Thirdly, the computer center at the top layer will monitor the overall system and generate the alarm signals or the commands when the faults occur.
Home computing: a vision in search of a marketplace: areas of needed research
Authors: John E. Ruchinskas, Charles W. Steinfield, Lynne L. Svenning
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

"The typical family of the late 1980's is a working couple with two children, one car, a small house and a rather well-structured way of living... They have a home computer for paying bills, banking, monitoring their energy use, specialized research services and access to data for personal and business use."
Search-based picture sharing with mobile phones
Authors: Erik Nordström, Daniel Aldman, Fredrik Bjurefors, Christian Rohner
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

We demonstrate search-based data dissemination among mobile phones where content spreads according to how well it ranks against a user's declared interests. The dissemination is facilitated by Haggle -- a data-centric architecture for opportunistic networking environments. On top of Haggle we run an example application, called PhotoShare, which allows users to take photographs with the phone's camera that they can then share with other phones directly, over either WiFi or Bluetooth. In order to illustrate how Haggle disseminates the photos, we visualize each phone's internal state on an external screen. Through the visualization it is possible to see how search primitives, such as relative matching and ranking of content against keywords, are used in Haggle as means to determine the dissemination and forwarding of data.
A generic and reflective debugging architecture to support runtime visibility and traceability of aspects
Authors: Wouter De Borger, Bert Lagaisse, Wouter Joosen
Venue: Proceedings of the 8th ACM international conference on Aspect-oriented software development (2009)

In this paper we present a generic, mirror-based debugging architecture that supports runtime visibility and traceability of aspect oriented (AO) software systems. Runtime visibility supports inspection of an executing AO-system in terms of AO programming abstractions and code artifacts such as (dynamic) aspects, advices, pointcuts, aspect instances and advice applications. Runtime traceability supports inspection of the stack to identify advices that could have been executed, that are being executed, or that may be executed later. Additionally, traceability supports identification and inspection of the pointcut that causes a specific advice. We have created a mirror based architecture that offers introspection support including an aspect-aware breakpoint model for AOP-related runtime events. We introduce the concept of hook frames to trace joinpoints and their advices on the stack. We validate the genericity of our architecture in two instantiations -- JBoss AOP and AspectJ/ABC -- and evaluate both instantiations by applying concrete debugging scenarios.
A study on performance comparison of priority-based queueing scheme with two queueing buffer allocations in an UMTS core network gateway
Authors: Fanpyn Liu, Chen-Hua Fu, Chyan Yang
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

As UMTS systems have evolved into an all-IP stage, packet switching becomes a prerequisite for all UMTS applications within an UMTS core network, where the traffic of UMTS applications consist of four classes: conversational, streaming, interactive, and background, each of which has its QoS features and packets transmission priority. In this paper, a priority-based queueing scheme with two queueing buffer allocations, the DQB allocation and the OQD allocation, within an UMTS core network gateway is proposed to support differentiated services for packet forwarding among UMTS applications. In the proposed queuing scheme, two major modules, a priority-based enqueueing module and a weighted round robin dequeueing module, are used to handle enqueueing and dequeueing processes of UMTS packets. Many scenarios are simulated using the platform built on ns2. According to on the simulation results, each class UMTS application bases on its packet transmission priority to receive its corresponding packet forwarding performance; a differentiated service in packet forwarding among UMTS applications can be supported by the proposed queueing scheme with the two queueing buffer allocations within an UMTS core network gateway. For the DQB allocation, a packet forwarding starvation might be received by one UMTS application with the lowest packet transmission priority in a continuous traffic pattern; for the OQD allocation, there exists disorder packet transmissions among UMTS application.
Extraction and classification of dense implicit communities in the Web graph
Authors: Yon Dourisboure, Filippo Geraci, Marco Pellegrini
Venue: ACM Transactions on the Web (TWEB) (2009)

The World Wide Web (WWW) is rapidly becoming important for society as a medium for sharing data, information, and services, and there is a growing interest in tools for understanding collective behavior and emerging phenomena in the WWW. In this article we focus on the problem of searching and classifying communities in the Web. Loosely speaking a community is a group of pages related to a common interest. More formally, communities have been associated in the computer science literature with the existence of a locally dense subgraph of the Web graph (where Web pages are nodes and hyperlinks are arcs of the Web graph). The core of our contribution is a new scalable algorithm for finding relatively dense subgraphs in massive graphs. We apply our algorithm on Web graphs built on three publicly available large crawls of the Web (with raw sizes up to 120M nodes and 1G arcs). The effectiveness of our algorithm in finding dense subgraphs is demonstrated experimentally by embedding artificial communities in the Web graph and counting how many of these are blindly found. Effectiveness increases with the size and density of the communities: it is close to 100&percnt; for communities of thirty nodes or more (even at low density). It is still about 80&percnt; even for communities of twenty nodes with density over 50&percnt; of the arcs present. At the lower extremes the algorithm catches 35&percnt; of dense communities made of ten nodes. We also develop some sufficient conditions for the detection of a community under some local graph models and not-too-restrictive hypotheses. We complete our Community Watch system by clustering the communities found in the Web graph into homogeneous groups by topic and labeling each group by representative keywords.
Evaluating the transient behavior of queueing systems via simulation and transfer function modeling
Authors: Jingang Liu, Feng Yang
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Characterizing the transient behavior of queueing systems is a difficult problem, which has been addressed by either simplified analytical models or simulation. We seek to capture the transient performance of systems from a new perspective: based on high-fidelity simulation experiments, we estimate a number of transfer function models (the discrete approximations of those ODEs provided by an analytical approach) which characterizes the evolution of the system's dynamic behavior.
Planning ahead: techniques for simplifying mobile service use
Authors: Mike Harding, Oliver Storz, Nigel Davies, Adrian Friday
Venue: Proceedings of the 10th workshop on Mobile Computing Systems and Applications (2009)

Interacting with mobile applications and services remains difficult for users because of the impact of mobility on both device capabilities and the cognitive resources of users. In this paper we explore the idea that interaction with mobile services can be made faster and more convenient if users are allowed to speculatively prepare in advance the services they wish to use and the data they will need. Essentially we propose to enable users to offset difficult interactions while mobile with a larger number of interactions conducted in the desktop environment. To illustrate the concept of offsetting we have developed a prototype we call the 'context clipboard'. Early feedback suggests that a majority (70%) of the participants are in favour of the concept and that they (80%) may be prepared to use explicit preparation behaviour to simplify future interactions. We close with our reflections on key implications for systems design and challenges for taking this work forward.
An adaptable personal learning environment for e-learning and e-assessment
Authors: Steve Green, Lilyana Nacheva-Skopalik, Elaine Pearson
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

This paper proposes a component model and development framework for an open source Adaptable Personal Learning Environment (APLE), an e-Learning environment which is responsive to an individual learner's needs or preferences and to the environment in which they are working. In this paper we briefly cover three separate areas of the proposed systems: firstly the component model and open source development framework for an APLE itself; secondly the development of adaptive learning objects; thirdly adaptive e-Assessment, based around models for formative assessment and evaluation.
Algebraic Study of Lattice-Valued Logic and Lattice-Valued Modal Logic
Authors: Yoshihiro Maruyama
Venue: Proceedings of the 3rd Indian Conference on Logic and Its Applications (2009)

In this paper, we study lattice-valued logic and lattice-valued modal logic from an algebraic viewpoint. First, we give an algebraic axiomatization of L-valued logic for a finite distributive lattice L. Then we define the notion of prime L-filters and prove an L-valued version of prime filter theorem for Boolean algebras, by which we show a Stone-style representation theorem for algebras of L-valued logic and the completeness with respect to L-valued semantics. By the representation theorem, we can show that a strong duality holds for algebras of L-valued logic and that the variety generated by L coincides with the quasi-variety generated by L. Second, we give an algebraic axiomatization of L-valued modal logic and establish the completeness with respect to L-valued Kripke semantics. Moreover, it is shown that L-valued modal logic enjoys finite model property and that L-valued intuitionistic logic is embedded into L-valued modal logic of S4-type via Gödel-style translation. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player