ppxscal/embedding_network huggingface dataset:
Fabrication of compliant high aspect ratio silicon microelectrode arrays using micro-wire electrical discharge machining
Authors: Dinesh Rakwal, Sumet Heamawatanachai, Prashant Tathireddy, Florian Solzbacher, Eberhard Bamberg
Venue: Microsystem Technologies (2009)

This paper reports on the fabrication of high aspect ratio silicon microelectrode arrays by micro-wire electrical discharge machining (&#x03bc;-WEDM). Arrays with 144 electrodes on a 400&#x00a0;&#x03bc;m pitch were machined on 6 and 10&#x00a0;mm thick p-type silicon wafers to a length of 5 and 9&#x00a0;mm, respectively. Machining parameters such as voltage and capacitance were varied for different wire types to maximize the machining rate and to obtain uniform electrodes. Finite element analysis was performed to investigate electrode shapes with reduced lateral rigidity. These compliant geometries were machined using &#x03bc;-WEDM followed by a two step chemical etching process to remove the recast layer and to reduce the cross sections of the electrodes.
The effects of personality factors on participation in online learning
Authors: Iwen Huang
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

The e-learning is a new approach in higher education and the market is increasing. Multimedia-learning environments have led to the development of a new pedagogy in online courses. Research in human factor provides a possible explanation for the performance in e-learning environment. Individuals' personality factors can affect their performance in online learning. The study examined whether personality types as measured by the Myers Briggs Type Indicator influence participation in online asynchronous discussion. The results of the study suggested personality factors have no impact on participation. However, students with introverted, intuition, thinking, and judging for each dichotomous personality got higher means of participation.
A multi-modal immune algorithm for the job-shop scheduling problem
Authors: Guan-Chun Luh, Chung-Huei Chueh
Venue: Information Sciences: an International Journal (2009)

This paper describes the application of an artificial immune system to a scheduling application. A novel approach multi-modal immune algorithm is proposed for finding optimal solutions to job-shop scheduling problems emulating the features of a biological immune system. Inter-relationships within the proposed algorithm resemble antibody molecule structure, antibody-antigen relationships in terms of specificity, clonal proliferation, germinal center, and the memory characteristics of adaptive immune responses. Gene fragment recombination and several antibody diversification schemes including somatic recombination, somatic mutation, gene conversion, gene reversion, gene drift, and nucleotide addition were incorporated into the algorithm in order to improve the balance between exploitation and exploration. In addition, niche antibody was employed to discover multi-modal solutions. Numerous well-studied benchmark examples in job-shop scheduling problems were utilized to evaluate the proposed approach. The results indicate the effectiveness and flexibility of the immune algorithm.
The Complexity of Rationalizing Matchings
Authors: Shankar Kalyanaraman, Christopher Umans
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called rationalization or revealed preference problems in the economic literature, and are the subject of a rich body of work.From the computer science perspective, it is natural to study the complexity of rationalization in various scenarios. We consider a class of rationalization problems in which the economic data is expressed by a collection of matchings, and the question is whether there exist preference orderings for the nodes under which all the matchings are stable.We show that the rationalization problem for one-one matchings is NP-complete. We propose two natural notions of approximation, and show that the problem is hard to approximate to within a constant factor, under both. On the positive side, we describe a simple algorithm that achieves a 3/4 approximation ratio for one of these approximation notions. We also prove similar results for a version of many-one matching.
Tele-operators' judgments of their ability to drive through apertures
Authors: Keith S. Jones, Elizabeth A. Schmidlin, Brian R. Johnson
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

It has been suggested that operators should base decisions to enter apertures on their ability to control the robot, rather than its static dimensions. Doing so, however, assumes that operators know whether they can drive a robot through the aperture. The present study tested that assumption. Results indicated that judgments about control of the robot were not accurate. In contrast, judgments of static dimensions were accurate. Thus, operators will require support if they must base decisions to enter apertures on their ability to control that robot.
Position Auctions with Bidder-Specific Minimum Prices
Authors: Eyal Even-Dar, Jon Feldman, Yishay Mansour, S. Muthukrishnan
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

Position auctions such as the Generalized Second Price (GSP) auction are in wide use for sponsored search, e.g., by Yahoo! and Google. We now have an understanding of the equilibria of these auctions, via game-theoretic concepts like Generalized English Auctions and the "locally envy-free" property, as well as through a relationship to the well-known, truthful Vickrey-Clarke-Groves (VCG) mechanism. In practice, however, position auctions are implemented with additional constraints, in particular, bidder-specific minimum prices are enforced by all major search engines. The minimum prices are used to control the quality of the ads that appear on the page.We study the effect of bidder-specific minimum prices in position auctions with an emphasis on GSP. Some properties proved for standard GSP no longer hold in this setting. For example, we show that the GSP allocation is now not always efficient (in terms of advertiser value). Also, the property of "envy-locality" enjoyed by GSP--which is essential in the prior analysis of strategies and equilibria--no longer holds. Our main result is to show that despite losing envy locality, GSP with bidder-specific minimum prices still has an envy-free equilibrium. We conclude by studying the effect of bidder-specific minimum prices on VCG auctions.
Proceedings of the May 4-7, 1981, national computer conference
Venue: AFIPS Joint Computer Conferences (1981)

The National Computer Conference is an institution of the U.S. computer industry. Each year at the NCC, thousands representing companies, government agencies, and universities gather, and a forum is provided for hundreds of them. Much of what occurs is of course ephemeral, a great deal is of current and very practical value, and some lasts for many years. The Proceedings of the NCC is a principal element of that set of things from the conference with lasting value. This 1981 Conference Proceedings, the fiftieth volume in the series, is an exhibit of the labors of Dr. Alex Orden, Program Chairman of the 1981 NCC. The myriad of details connected with organizing a program of this scope are treated in Professor Orden's introduction, and the reader will be wise to use that section as a road map before beginning to traverse the extensive volume. Authors of papers appearing here have contributed a great deal also, as have referees, session organizers, panelists, and other presenters of information at the conference whose contributions could not be made fully apparent in this volume. Another person who must be mentioned is the one who shepherded production of this Proceedings, Elizabeth G. Emanuel of AFIPS Press; her work was excellent and in keeping with the fine tradition at AFIPS established by Nelle W. Morgan many years ago. 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
Exact Non-Reflecting Boundary Conditions on Perturbed Domains and hp-Finite Elements
Authors: Tommy L. Binford,  Jr., David P. Nicholls, Nilima Nigam, T. Warburton
Venue: Journal of Scientific Computing (2009)

For exterior scattering problems one of the chief difficulties arises from the unbounded nature of the problem domain. Inhomogeneous obstacles may require a volumetric discretization, such as the Finite Element Method (FEM), and for this approach to be feasible the exterior domain must be truncated and an appropriate condition enforced at the far, artificial, boundary. An exact, non-reflecting boundary condition can be stated using the classical DtN-FE method if the Artificial Boundary's shape is quite specific: circular or elliptical. Recently, this approach has been generalized to permit quite general Artificial Boundaries which are shaped as perturbations of a circle resulting in the "Enhanced DtN-FE" method. In this paper we extend this method to a two-dimensional FEM featuring high-order polynomials in order to realize a high rate of convergence. This is more involved than simply specifying high-order test and trial functions as now the scatterer shape and Artificial Boundary must be faithfully represented. This entails boundary elements which conform (to high order) to the true boundary shapes. As we show, this can be accomplished and we realize an arbitrary order FEM without spurious reflections.
Augmented reality authoring for artists and designers
Authors: Rodney Berry, Marina Oikawa, Janaka Prasad, Jörg Unterberg, Wei Liu, Adrian David Cheok, Hirokazu Kato
Venue: ACM SIGGRAPH ASIA 2008 artgallery: emerging technologies (2008)

By using ARToolkit for marker tracking and Touch Designer (a commercial, real-time 3D environment) for modeling, rendering, and compositing real and virtual images, artists and designers can quickly create interactive augmented-reality environments.
Toward technologies that support family reflections on health
Authors: Andrea Grimes, Desney Tan, Dan Morris
Venue: Proceedings of the ACM 2009 international conference on Supporting group work (2009)

Previous research has explored how technology can motivate healthy living in social groups such as friends and coworkers. However, little research has focused on the implications of collecting, sharing, and reflecting upon health information within families. To explore this domain, we conducted a study that consisted of a week-long journaling activity followed by semi-structured interviews and formative design activities with 15 families (66 people). We identified four areas in which these practices are unique in a family context. Based on these findings we propose preliminary considerations for technologies that effectively support family reflections on health data.
Multiline Addressing by Network Flow
Authors: Friedrich Eisenbrand, Andreas Karrenbauer, Martin Skutella, Chihao Xu
Venue: Algorithmica (2009)

We consider an optimization problem arising in the design of controllers for OLED displays. Our objective is to minimize amplitude of the electrical current through the diodes which has a direct impact on the lifetime of such a display. Modeling the problem in mathematical terms yields a class of network flow problems where we group the arcs and pay in each group only for the arc carrying the maximum flow. We develop (fully) combinatorial approximation heuristics suitable for being implemented in the hardware of a control device that drives an OLED display.
The Quantum Locker Puzzle
Authors: David Avis, Anne Broadbent
Venue: Proceedings of the 2009 Third International Conference on Quantum, Nano and Micro Technologies (2009)

The locker puzzle is a game played by multiple players against a referee. It has been previously shown that the best strategy that exists cannot success with probability greater than than 1-ln2 (approximately 0.31), no matter how many players are involved. Our contribution is to show that quantum players can do much better---they can succeed with probability 1. By making the rules of the game significantly stricter, we show a scenario where the quantum players still succeed perfectly, while the classical players win with vanishing probability. Other variants of the locker puzzle are considered, as well as a cheating referee.
Musical fingerprints: collaboration around home media collections
Authors: Robin Sease, David W. McDonald
Venue: Proceedings of the ACM 2009 international conference on Supporting group work (2009)

As people collect more and more digital music, photos, and video, the growing scale of the collection challenges how families share and collaborate around home media collections. We studied the intersection between physical and digital media collections. Through 20 two hour, in home interviews, we explored the when, why, and how of the households' organization, access and sharing. Our grounded approach is framed through the use of the media lifecycle and the spectrum of intimacy of the collector and others involved in the stages of the lifecycle. We found a range of accommodations to facilitate collaboration around media collections in the home. For example, media collections often begin with an individual, but as they become shared and integrated into a household, a member of the household will often play a key curatorial role that includes making changes to the organizational scheme, setting aside sub-collections and selecting items to play that account for the entire household's taste. Our findings identify key practices that can inform the design of future media software for the home.
Parallel Tracking and Mapping for Small AR Workspaces
Authors: Georg Klein, David Murray
Venue: Proceedings of the 2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality (2007)

This paper presents a method of estimating camera pose in an unknown scene. While this has previously been attempted by adapting SLAM algorithms developed for robotic exploration, we propose a system specifically designed to track a hand-held camera in a small AR workspace. We propose to split tracking and mapping into two separate tasks, processed in parallel threads on a dual-core computer: one thread deals with the task of robustly tracking erratic hand-held motion, while the other produces a 3D map of point features from previously observed video frames. This allows the use of computationally expensive batch optimisation techniques not usually associated with real-time operation: The result is a system that produces detailed maps with thousands of landmarks which can be tracked at frame-rate, with an accuracy and robustness rivalling that of state-of-the-art model-based systems.
Low power and high performance sram design using bank-based selective forward body bias
Authors: Kalyana C. Bollapalli, Rajesh Garg, Kanupriya Gulati, Sunil P. Khatri
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Leakage power consumption is a large fraction of the total power consumption in contemporary VLSI designs. Since memories occupy a large portion of the total area of many high-performance ICs, it is crucial to reduce the leakage energy of memories. This problem is particularly aggravated for memories implemented in the 45nm technology node, since these processes exhibit significantly higher leakage power. For these memories, leakage is a significant problem not only from a power point of view, but also from a performance degradation standpoint. In this paper, we quantify this problem and provide a solution, using a 512KByte SRAM implemented in a 45nm bulk process as a design example. We show that implementing the SRAM as a monolithic memory results in increased delay as well as power. We illustrate a methodology to optimally reduce leakage power and improve performance in memories by splitting the memory array into word line groups (WLGs) which are selectively forward body biased when accessed. We present a derivation of optimal number of WLGs and the forward body bias voltage value, and show that our approach results in a 9:2% access time reduction, and a 53:4% reduction in power during a read operation. Our approach also achieves an 18% reduction in power during a write operation and a 69% leakage power improvement. The area overhead of our scheme is 7:2% compared to a monolithic memory.
Computational Studies of a Protein-based Nanoactuator for Nanogripping Applications
Authors: Gaurav Sharma, Constantinos Mavroidis, Kaushal Rege, Martin L. Yarmush, David Budil
Venue: International Journal of Robotics Research (2009)

The design hypothesis, architectures, and computational modeling of a novel peptide-based nanoactuator are presented in this paper. We engineered the Î±-helical coiled-coil portion of the yeast transcriptional activator peptide called GCN4 to obtain an environmentally responsive nanoactuator. The dimeric coiled-coil peptide consists of two identical approximately 4.5 nm long and approximately 3 nm wide polypeptide chains. The actuation mechanism depends on the modification of electrostatic charges along the peptide by varying the pH of the solution resulting in the reversible movement of helices and, therefore, creating the motion of an actuator. Using molecular dynamics simulations we showed that pH changes led to a reversible opening of up to 1.5 nm which is approximately 150% of the initial separation of the nanoactuator. We also investigated the forces generated by the nanoactuator upon pH actuation, using a new method based on a modified steered molecular dynamics technique. Owing to its open and close motion resembling that of tweezers, the new nanoactuator can potentially be used as a nanogripper in various nanomanipulation tasks such as detection and removal of heavy metal ions during nanofabrication processes or as a molecular switch.
Theoretic Analysis of Inter Frame Dependency in Video Coding
Authors: Yue Wang, Jun Sun, Siwei Ma, Wen Gao
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

In this paper, we present theoretic analysis of optimal bit allocation in prediction-based video coders. Usually, the optimal bit allocation is to minimize the sum of frame distortions under a total bit rate constraint. We use the Laplacian model to describe the distribution of DCT coefficients of residual frame and analyze the dependency between reference frame and predicted frame at different bit rates. Then we found that inter frame dependency will increase as bit rates decrease. Finally, based on this rule, we give some suggestions for rate allocation in practical video coding.
DTSMA: Distributed time-spread multiple access for wireless mesh networks with IEEE 802.16d MAC protocol
Authors: Peng-Yong Kong, Inn-Inn Er
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

This paper studies the use of IEEE 802.16d mesh MAC protocol for multi-hop networking in an indoor domestic environment. The mesh network is expected to support time-sensitive audio-video applications with stringent QoS requirement. In the literature, time-spread multiple access (TSMA) is a promising technology to provide a minimum throughput guarantee in a multi-hop mesh network with dynamic topology. However, existing TSMA schemes require the number of nodes in the entire network and their global maximum node degree, be known a priori to a central controller. The requirement is not practical. In view of this problem, this paper proposes a distributed time-spread multiple access (DTSMA) scheme. The proposed DTSMA has the following main contributions: (a) A method for each node to determine locally its polynomial coefficients without a priori global knowledge of node number and maximum node degree, and (b) A method to distribute to neighbours the locally determined polynomial coefficients, and to resolve collision between two sets of identical polynomial coefficients from two neighbouring nodes. The proposed DTSMA has been evaluated through extensive simulations to confirm that it can indeed preserve the capability of providing a minimum throughput guarantee in the absence of the a priori global knowledge. In benchmark against the de facto distributed coordinated scheduling (DCS) in the original IEEE 802.16d mesh MAC protocol under various domestic wireless channel conditions, DTSMA outperforms in terms of packet delivery ratio and average end-to-end packet delay which are important metrics for time-sensitive audio-video applications. Simulation results also show that DTSMA outperforms TSMA in terms of average end-to-end packet delay and average delay jitter when the severity of propagation impairment is high.
Secure computer operation with virtual machine partitioning
Authors: Clark Weissman
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

In an earlier paper, I noted the extremes to which one commercial company, System Development Corporation (SDC), has gone to satisfy its disparate security/privacy requirements; this may be typical of at least one-half of the industry. In brief, the solution is to have two CPUs; six different operating systems, including two custom products; six user classes from research and development to a Corporate Management Information System; and four blocked-time periods, i.e., Periods Processing, per machine. This distasteful Periods Processing (PP) solution is the only choice for demanding facility operators, short of not processing sensitive data, and the only one accepted by the U.S. Department of Defense.
A Parallel Method in the 3G Firewall
Authors: ZhenYu Liu, ShengLi Xie, Yue Lai
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

IMSI (International Mobile Station Identity) is a unique number associated with all GSM and UMTS network mobile phone user. IMSI filtering—a prefix filtering, is an important function in the 3G firewall. It is an indefinite filtering which affects the efficiency of the security device. This paper brings forward a parallel processing method which uses vector coding and structure of bloom filter. This method is realized in Intel network processor—IXP 2850. The features of parallel multithreads and hash unit in network processor are taken advantages. The experiments show the excellent performance of the method in 3G firewall.
The Ergonomic Analysis of the Workplace of Physically Disabled Individuals
Authors: Matthieu Aubry, Frédéric Julliard, Sylvie Gibet
Venue: Gesture-Based Human-Computer Interaction and Simulation: 7th International Gesture Workshop, GW 2007, Lisbon, Portugal, May 23-25, 2007, Revised Selected Papers (2009)

This paper presents a new gesture-based approach for the ergonomic evaluation of the workplaces of the physically handicapped. After a brief overview of tools using interactive simulation to perform ergonomic analysis, we describe the requirements to perform ergonomic analyses for the disabled. We then propose a framework unifying the synthesis and analysis of motions and integrating a model of disabilities based on constraints. Finally, we present preliminary results following the implementation of a constraint enabled kinematic controller.