ppxscal/embedding_network huggingface dataset:
Low-complexity algorithm and architecture for block-based motion estimation via one-bit transforms
Authors: B. Natarajan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

We present a strategy for block-based motion estimation that involves transforming video sequences from a multibit to a one-bit/pixel representation, and then applying conventional motion estimation search strategies. This results in substantial reductions in arithmetic and hardware complexity, and reduced power consumption, while maintaining good compression performance. Experimental results and a custom hardware design are also presented.
Proceedings. 2004 IEEE International Workshop on Current and Defect Based Testing (IEEE Cat. No.04EX1004)
Venue: Proceedings of the 2004 IEEE International Workshop on Defect Based Testing (2004)

The following topics are dealt with: IDDX methods; IDDX circuits; IDDQ development; mixed signal LSI relationship; delay analysis; speed binning, fault diagnosis; and bridging defects; memory diagnosis and test data compression. 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
Djange Me
Authors: Paul F. Dubois
Venue: Computing in Science and Engineering (2007)

The author, columnist Paul Dubois, discusses some of the newer tools for fine-tuning your code.
Simulative Considerations for Future 4G Hierarchical Mobility Management in All-IP Networks
Authors: Norbert Jordan, Alexander Poropatich, Peter Reichl
Venue: Proceedings of the Sixth International Conference on Networking (2007)

The convergence of future fixed and wireless networking more and more requires solutions for transporting realtime application data to IP enabled mobile devices and mobile networks. Even if the general Mobile IPv6 protocol performs sufficient in macro environments with non-realtime requirements, seamless mobility demands some more enhanced protocol procedures in between the mobile client and the involved network entities. Limiting the effect of handovers has the potential to considerably improve handover performance in terms of latency and packet loss. This contribution is going to present simulative studies on the performance of a future 4G Hierarchical Mobility Management approach. The demonstrated simulation scenarios comprises 3 independent access domains, twelve access routers, and up to 72 mobile clients that communicate in accordance with the popular IEEE 802.11 wireless LAN standard, as one of the possible wireless access networks in a future All-IP network infrastructure.
Managing Scientific Data: New Challenges for Database Research
Authors: Marianne Winslett
Venue: Proceedings of the 19th International Conference on Scientific and Statistical Database Management (2007)

The database research community's appetite for new applications has led to increased interest in the data management needs of scientists. This area encompasses a huge range of applications, extending from public repositories of observational data such as the popular Sloan Digital Sky Survey to one-of-a-kind runs of simulation codes crafted by individual scientists. In this talk, we will survey the most common data management needs found in the hard sciences, describe the new database research challenges that arise from these needs, and outline ways to address some of these challenges.
Parallel implicit fully coupled newton-krylov-schwarz methods for numerical simulations of magnetohydrodynamics
Authors: Xiao-Chuan Cai
Venue:  (2006)

In this thesis we develop scalable parallel methods and software for solutions of problems in magnetohydrodynamics (MHD). The behavior of an MHD system is complex since it admits various wave phenomena and their instabilities. One of the intrinsic features of the MHD model is the formation of a singular current density sheet, which is linked to the reconnection of magnetic field lines. Reconnection of magnetic flux-tubes leads to a release of energy stored in the magnetic field. Numerical simulation of the reconnection problem plays an important role in our understanding of physical systems ranging from the solar corona to laboratory fusion devices. Robust iterative solvers are needed to simulate this time-dependent, multi-scale, multi-physics phenomenon. We develop a fully-coupled, nonlinearly implicit technique, in which no operator splitting is applied, for solving the system of MHD equations. More precisely, we first apply a high-order implicit time integration scheme, and then, to guarantee the nonlinear consistency, we use a Newton-Krylov-Schwarz algorithm to solve the large sparse nonlinear system of algebraic equations containing all physical variables at every time step. We investigate the performance of the one- and two-level additive Schwarz as well as the inner-outer preconditioning techniques and focus on the scalability studies of the linear and nonlinear solvers on fine meshes and on machines with thousands of processors.
An Efficient eAuction Protocol
Authors: Brian Curtis, Josef Pieprzyk, Jan Seruga
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

A secure protocol for electronic, sealed-bid, single item auctions is presented. The protocol caters to both first and second price (Vickrey) auctions and provides full price flexibility. Both computational and communication cost are linear with the number of bidders and utilize only standard cryptographic primitives. The protocol strictly divides knowledge of the bidder's identity and their actual bids between, respectively, a registration authority and an auctioneer, who are assumed not to collude but may be separately corrupt. This assures strong bidderanonymity, though only weak bid privacy. The protocol is structured in two phases, each involving only off-line communication. Registration, requiring the use of the public key infrastructure, is simultaneous with hash-sealed bidcommitment and generates a receipt to the bidder containing a pseudonym. This phase is followed by encrypted bid-submission. Both phases involve the registration authority acting as a communication conduit but the actual message size is quite small. It is argued that this structure guarantees non-repudiation by both the winner and the auctioneer. Second price correctness is enforced either by observing the absence of registration of the claimed second-price bid or, where registered but lower than the actual second price, is subject to cooperation by the second price bidder - presumably motivated through self-interest. The use of the registration authority in other contexts is also considered with a view to developing an architecture for efficient secure multiparty transactions.
Differential Compression of Executable Code
Authors: Giovanni Motta, James Gustafson, Samson Chen
Venue: Proceedings of the 2007 Data Compression Conference (2007)

A platform-independent algorithm to compress file differences is presented here. Since most file updates consist of software updates and security patches, particular attention is dedicated to making this algorithm suitable to efficient compression of differences between executable files. This algorithm is designed so that its low-complexity decoder can be used in mobile and embedded devices. Compression is compared with several existing methods on a common test suite.
ICE: The Isothetic Convex Envelope of a Digital Object
Authors: Partha Bhowmick, Arindam Biswas, Bhargab B. Bhattacharya
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

A novel algorithm to derive the isothetic convex envelope (ICE) of an object using a digital geometric technique is proposed in this paper. ICE is defined as the isothetic convex polygon that contains the digital object, with an aim of capturing its underlying shape information. Slackening the tightness of an ICE corresponding to a digital object is achievable by increasing the grid size, and for a slackened ICE with lesser output complexity (i.e., with lesser number of vertices), the runtime of the algorithm falls significantly. The proposed algorithm is marked by its dependence on object boundary instead of object size, and usage of primitive integer operations in the digital domain, which, in entirety, ensures its speedy execution and acceptability in a real-world application. Experimental results including CPU time demonstrate the elegance of ICE and the efficiency of the proposed algorithm.
Calibrating a forest landscape model to simulate frequent fire in Mediterranean-type shrublands
Authors: Alexandra D. Syphard, Jian Yang, Janet Franklin, Hong S. He, Jon E. Keeley
Venue: Environmental Modelling Software (2007)

In Mediterranean-type ecosystems (MTEs), fire disturbance influences the distribution of most plant communities, and altered fire regimes may be more important than climate factors in shaping future MTE vegetation dynamics. Models that simulate the high-frequency fire and post-fire response strategies characteristic of these regions will be important tools for evaluating potential landscape change scenarios. However, few existing models have been designed to simulate these properties over long time frames and broad spatial scales. We refined a landscape disturbance and succession (LANDIS) model to operate on an annual time step and to simulate altered fire regimes in a southern California Mediterranean landscape. After developing a comprehensive set of spatial and non-spatial variables and parameters, we calibrated the model to simulate very high fire frequencies and evaluated the simulations under several parameter scenarios representing hypotheses about system dynamics. The goal was to ensure that observed model behavior would simulate the specified fire regime parameters, and that the predictions were reasonable based on current understanding of community dynamics in the region. After calibration, the two dominant plant functional types responded realistically to different fire regime scenarios. Therefore, this model offers a new alternative for simulating altered fire regimes in MTE landscapes.
The VC dimension of k-uniform random hypergraphs
Authors: B. Ycart, J. Ratsaby
Venue: Random Structures Algorithms (2007)

A set of vertices is shattered in a hypergraph if any of its subsets is obtained as the intersection of an edge with the set. The VC dimension is the size of the largest shattered subset. Under the binomial model of k-uniform random hypergraphs, the threshold function for the VC dimension to be larger than a given integer is obtained. The same is done for the testing dimension, which is the largest integer d such that all sets of cardinality d are shattered. &copy; 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2007
Online optimizations driven by hardware performance monitoring
Authors: Florian T. Schneider, Mathias Payer, Thomas R. Gross
Venue: Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation (2007)

Hardware performance monitors provide detailed direct feedback about application behavior and are an additional source of infor-mation that a compiler may use for optimization. A JIT compiler is in a good position to make use of such information because it is running on the same platform as the user applications. As hardware platforms become more and more complex, it becomes more and more difficult to model their behavior. Profile information that captures general program properties (like execution frequency of methods or basic blocks) may be useful, but does not capture sufficient information about the execution platform. Machine-level performance data obtained from a hardware performance monitor can not only direct the compiler to those parts of the program that deserve its attention but also determine if an optimization step actually improved the performance of the application. This paper presents an infrastructure based on a dynamic compiler+runtime environment for Java that incorporates machine-level information as an additional kind of feedback for the compiler and runtime environment. The low-overhead monitoring system provides fine-grained performance data that can be tracked back to individual Java bytecode instructions. As an example, the paper presents results for object co-allocation in a generational garbage collector that optimizes spatial locality of objects on-line using measurements about cache misses. In the best case, the execution time is reduced by 14% and L1 cache misses by 28%.
Qualitative Research Genres in the IS Literature: Emerging Issues and Potential Implications
Authors: Suprateek Sarker
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

In this opinion piece, we provide a critical commentary on the arena of qualitative research in IS. We reflect on why reviewer or editorial evaluations of manuscripts, with respect to methodological issues in qualitative studies, often come across as "prejudiced." By viewing the adoption of qualitative research in the IS discipline as an evolutionary process, and by highlighting key differences among genres of qualitative manuscripts, a number of implications for both authors and evaluators of qualitative manuscripts emerge.
Teach and Playback of Realistic Target Reaching Movement of Virtual Human Upper Limb
Authors: Meng Na, Li Ding, Peifa Jia
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

The significant research objective of virtual human is to generate realistic movement like real-life person. For the most frequent daily activity of target reaching movement of human upper limb, teach and playback method is proposed to generate vivid human motion, which combines respective merits of parametric keyframe, kinematics, dynamics, and motion capture methods together. First, the tip trajectory and velocity rules are learned and estimated by a weighted least squares support vector machine (WLS-SVM) and a combined half-Gaussians model respectively. Then an inverse kinematic method with dynamic constraint, damped least squares (DLS), is used to calculate the joint angles of the upper limb. Finally, the experimental results show that once the target position is appointed, the 3D virtual human skeleton model can generate realistic reaching movement.
The design and implementation of Guaraná
Authors: Alexandre Oliva, Luiz Eduardo Buzato
Venue: Proceedings of the 5th conference on USENIX Conference on Object-Oriented Technologies & Systems - Volume 5 (1999)

Several reflective architectures have attempted to improve meta-object reuse by supporting composition of meta-objects, but have done so using limited mechanisms such as Chains of Responsibility. We advocate the adoption of the Composite pattern to define meta-configurations. In the meta-object protocol (MOP) of Guaraná, a composer meta-object can control reconfiguration of its component meta-objects and their interactions with base-level objects, resolving conflicts that may arise and establishing meta-level security policies. Guaraná is currently implemented as an extension of Kaffe OpenVMTM, a free implementation of the Java Virtual Machine. Nevertheless, most design decisions presented in this paper can be transported to other programming languages and MOPs, improving their flexibility, reconfigurability, security and meta-level code reuse. We present performance figures that show that it is possible to introduce run-time reflection support in a language like Java without much impact on execution speed.
Scenarios of optimal control of transregional migration processes under risk
Authors: V. V. Akimenko, A. G. Nakonechnyi, S. D. Voloshchuk
Venue: Cybernetics and Systems Analysis (2007)

Scenarios of migration are considered as applied to the problem of optimal control of transregional migration with zero risk of overpopulation or insufficient population and migration with obtaining the minimum of the objective functional and minimizing risk. Numerical algorithms for the scenarios considered are developed. The algorithms are implemented in an applied geoinformation decision-support system for control of transregional migration of population.
From classes to code: supporting the transition from design to implementation
Authors: James H. Paterson, John Haddow
Venue: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (2007)

This paper describes provision of support for the implementation of fundamental class relationships through the use of a tool previously created for teaching design patterns.
Changing the engineering undergraduate experience by appropriate use of computer technology
Authors: R. A. Green
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

Over the last few years, the price of personal computers has dropped while performance has increased. This has made it practical for college students to own computers that heretofore had been provided by the institution. As a result, there is now a national trend toward moving computers out of labs and into the hands and rooms of students. Several schools in the USA have instituted personal computer ownership policies over the years and the number is increasing each year. The College of Engineering at Mississippi State University (MSU) is currently one of the schools that uses computers in the laboratory environment but is moving to become one of the schools that requires computer ownership. This paper describes conclusions resulting from an evaluation of implementing a personal computer initiative at MSU.
Review on Microwave and Millimeter Filters Using MEMS Technology
Authors: Aline Jaimes-Vera, Ignacio Llamas-Garro, Alonso Corona-Chavez, Ignacio Zaldivar-Huerta
Venue: Proceedings of the 17th International Conference on Electronics, Communications and Computers (2007)

Several different fabrication techniques and materials have been proposed for the realization of low loss high-Q micromachined filters or tunable filters. In this paper a review of several filters that have been proposed over the last years is presented, including a discussion of topologies and the structures used to make microwave filters.
Verifying feature models using OWL
Authors: Hai H. Wang, Yuan Fang Li, Jing Sun, Hongyu Zhang, Jeff Pan
Venue: Web Semantics: Science, Services and Agents on the World Wide Web (2007)

Feature models are widely used in domain engineering to capture common and variant features among systems in a particular domain. However, the lack of a formal semantics and reasoning support of feature models has hindered the development of this area. Industrial experiences also show that methods and tools that can support feature model analysis are badly appreciated. Such reasoning tool should be fully automated and efficient. At the same time, the reasoning tool should scale up well since it may need to handle hundreds or even thousands of features a that modern software systems may have. This paper presents an approach to modeling and verifying feature diagrams using Semantic Web OWL ontologies. We use OWL DL ontologies to precisely capture the inter-relationships among the features in a feature diagram. OWL reasoning engines such as FaCT++ are deployed to check for the inconsistencies of feature configurations fully automatically. Furthermore, a general OWL debugger has been developed to tackle the disadvantage of lacking debugging aids for the current OWL reasoner and to complement our verification approach. We also developed a CASE tool to facilitate visual development, interchange and reasoning of feature diagrams in the Semantic Web environment.
Minitrack on Innovation and Innovation Management
Authors: Desai Narasimhalu, Gina Poole, Marko Torkkeli
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

We are pleased with the increase in number of submissions for the minitrack. The submissions met the objectives set out for the minitrack - to bring together practice and theory for enhancing each other. The minitrack co-chairs express their heartfelt gratitude to the track chair Professor Hugh Watson and organizers of HICSS 40 for their support for the program. The selected papers represent practice in industries ranging from engineering services to aircraft manufacturing. They also report theory developed from significant observations from the practice world.
Monge Property and Bounding Multivariate Probability Distribution Functions with Given Marginals and Covariances
Authors: Xiaoling Hou, Andra´s Pre´kopa
Venue: SIAM Journal on Optimization (2007)

Multivariate probability distributions with given marginals are considered, along with linear functionals, to be minimized or maximized, acting on them. The functionals are supposed to satisfy the Monge or inverse Monge or some higher order convexity property, and they may be only partially known. Existing results in connection with Monge arrays are reformulated and extended in terms of linear programming dual feasible bases. Lower and upper bounds are given for the optimum value as well as for unknown coefficients of the objective function, based on the knowledge of some dual feasible bases and corresponding objective function coefficients. In the two- and three-dimensional cases dual feasible bases are obtained for the problem, where not only the univariate marginals but also the covariances of the pairs of random variables are known.
Toward Visualization of Skill in VR: Adaptive Real-Time Guidance for Learning Force Exertion through the "Shaping" Strategy
Authors: Mikko J. Rissanen, Yoshihiro Kuroda, Megumi Nakao, Naoto Kume, Tomohiro Kuroda, Hiroyuki Yoshihara
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

The authors aim to make principles of expert's haptic interaction explicit on a Virtual Reality (VR) based simulator. Our approach is based on visualization of significant components of the interaction with consideration on their importance which acts as the foundation for manual skill. Delicate force exertion, which is the basis for various fine-motor skills, was chosen as an example. Expert's haptic interaction was recorded and presented to novices. Two visualization techniques were compared as a training aid by overlaying guidance on a simulator's screen: 1) tracking force curve (traditional technique), and 2) tracking the components of pre-defined "skill" (proposed technique). The visual presentation adapts to the components' importance: maximum power, duration, and force curve. The results support the possibility of using the proposed visualization technique for mediating principles of haptic interaction from experts to novices through a VR system.
Model checking of multi-applet javacard applications
Authors: Gennady Chugunov, Lars-Åke Fredlund, Dilian Gurov
Venue: Proceedings of the 5th conference on Smart Card Research and Advanced Application Conference - Volume 5 (2002)

The paper describes a framework for model checking JavaCard applets on the bytecode level. From a set of JavaCard applets we extract their method call graphs using a static analysis tool. The resulting structure is translated into a pushdown system for which the model checking problem for Linear Temporal Logic (LTL) is decidable, and for which there are efficient model checking tools available. The model checking approach of the paper is tailored to the analysis of inter applet (intra card) communications and we demonstrate it using a prototypical example of a purse applet and a set of loyalty applets.