ppxscal/embedding_network huggingface dataset:
A geometry-centric approach to progressive three-dimensional graphics coding
Authors: C.-C. J. Kuo
Venue:  (2006)

With increasing availability and complexity of 3D models, it is essential to compress 3D model data efficiently. In this research, we have made a comprehensive survey of current 3D triangular mesh coding techniques, and proposed two progressive lossless 3D triangular mesh coders. First, a survey was made, which classified, described and compared prior 3D triangular mesh coders. In addition, several future directions in the field of 3D model compression were discussed. Then, an octree (OT)-based progressive lossless 3D triangular mesh encoder was proposed. This OT-based mesh coder encodes 3D triangular meshes with arbitrary topological structures. For a given mesh, an octree structure is first built, which organizes the input vertices into cubic cells. Then, the octree is traversed from the root gradually to the leaves, and the intermediate mesh quality is progressively refined by cell subdivisions. For each cell subdivision, both local geometry and connectivity changes are encoded, where the connectivity coding is guided by the geometry coding. Furthermore, prioritized cell subdivision is performed in the tree front to provide better rate-distortion (R-D) performance. Based on our experiments, the proposed mesh coder significantly outperforms the prior art, the kd-tree algorithm. For instance, the improvement in geometry coding efficiency is around 10%&sim;20%, but may go up to 50%&sim;60% for meshes with highly regular geometry data and/or tight clustering of vertices. Finally, an iterative-vertex-set-split (IVSS)-based progressive lossless 3D triangular mesh encoder was proposed, which also encodes 3D triangular meshes with arbitrary topological structures. Given a 3D mesh, all its vertices form an initial vertex set which is then iteratively split. At any intermediate stage of the iterative vertex set split process, the representatives of all current vertex sets and their inter-connection form an approximation to the original mesh. For each vertex set split, the offsets of child representatives from the parent and the associated connectivity changes are encoded. With delicate vertex set split control, adaptive offset quantization and effective prediction, significant R-D improvement has been observed over the OT-based coder; i.e., distortion reduction of 50--80% has been observed at the same bitrates, which makes the IVSS-based coder a practical solution in streaming applications.
VCOP--The System of Visual Communication with Computers for Paralyzed Users
Authors: Grzegorz Kurdziel, Halina Kwasnicka
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

Users perceive usefulness of systems by their interfaces. Special attention is put on handicapped people. Adequately designed computer systems can be very helpful for them. The paper presents a developed system, VCOP (Visual COmmunication with computers for Paralyzed users), that meets following requirements: (1) enable people with paralysis to communicate with others by a computer that is able to react to eye movement, even though such communication would be limited (2) use commonly, inexpensive components (the system must be cheap). Some experimental study of usefulness of the system are performed and presented.
Understanding the Mobile Experience Economy: A key to richer more effective M-Business Technologies, Models and Strategies
Authors: Fuchsia Sims, Mary-Anne Williams, Steve Elliot
Venue: Proceedings of the International Conference on the Management of Mobile Business (2007)

A major challenge for firms these days is how to differentiate themselves in a global market and build competitive advantage. Many firms have been able to move up the value chain from a services base to an experience base as a means to attaining high levels of customer satisfaction and profitability. Consequently a better understanding of the experience economy will assist business managers and designers to develop effective strategies by focusing on the m-business experience and how this experience can build sustainable technology innovation, business models and strategies, and help design products for mobile delivery to meet the market's needs. In this paper we describe several experience economy models, identify their weaknesses, and introduce a new cognitive based experience model that can be used to develop more effective m-business infrastructure and applications. It offers a new understanding of experiences which emphasizes cognition as a whole which includes background knowledge, desires and intentions, rather than the sensory and perceptual aspects alone which are the focus of most traditional models. As a result the new model offers new predictive and explanatory power in understanding the m-business experience economy.
Formalising Dynamic Trust Negotiations in Decentralised Collaborative e-Health Systems
Authors: Oluwafemi Ajayi, Richard Sinnott, Anthony Stell
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Access control in decentralised collaborative systems present huge challenges especially where many autonomous entities including organisations, humans, software agents from different security domains seek to access and share resources in a secure and controlled way. Automated trust negotiation (ATN) is one approach that has been proposed for trust discovery and realisation, which enables entities viz. strangers to access resources across autonomous boundaries through iterative exchange of credentials. Various negotiation strategies have been proposed to protect credential disclosure during trust negotiations. However in some domains such as e-Health, not all entities are willing to negotiate credentials or disclose access policies directly to strangers regardless of negotiation strategies and instead prefer to negotiate and disclose sensitive information only to strangers within what we refer to as a circle of trust. In this paper, we introduce a formal model to describe how locally trusted intermediary parties can provide multiple negotiation and delegations hops to protect credentials and access policies. We propose a dynamic trust negotiations (DTN) model that not only protects sensitive information from disclosure but also reduces semantic issues that exist with credentials in decentralised systems. This work is currently being explored and implemented within the e-health domain: specifically in the MRC-funded Virtual Organisation for Trials of Epidemiological Studies (VOTES) project.
Process stress estimation for MEMS RF switches with mixed analytical and numerical simulation
Authors: L. Ferrario, C. Armaroli, B. Margesin, G. Soncini
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

One of the basic parameters in RF capacitive switches is the actuation voltage. It strongly depends on the process stress accumulated in the switching structure, typically a suspended thin bridge, made of conductive materials. The control and the tuning of the deposition steps require the monitoring and the reduction of the process stress. We present a method to estimate the global process stress of the device taking advantage of the electrical characterization done on standard capacitive test structures integrated in the process layout.
Trusting trusted hardware: towards a formal model for programmable secure coprocessors
Authors: Sean W. Smith, Vernon Austel
Venue: Proceedings of the 3rd conference on USENIX Workshop on Electronic Commerce - Volume 3 (1998)

Secure coprocessors provide a foundation for many exciting electronic commerce applications, as previous work [20, 21] has demonstrated. As our recent work [6, 13, 14] has explored, building a high-end secure coprocessor that can be easily programmed and deployed by a wide range of third parties can be an important step toward realizing this promise. But this step requires trusting trusted hardware-and achieving this trust can be difficult in the face of a problem and solution space that can be surprisingly complex and subtle. Formal methods provide one means to express, verify, and analyze such solutions (and would be required for such a solution to be certified at FIPS 140-1 Level 4). This paper discusses our current efforts to apply these principles to the architecture of our secure coprocessor. We present formal statements of the security goals our architecture needs to provide; we argue for correctness by enumerating the architectural properties from which these goals can be proven; we argue for conciseness by showing how eliminating properties causes the goals to fail; but we discuss how simpler versions of the architecture can satisfy weaker security goals. We view this work as the beginning of developing formal models to address the trust challenges arising from using trusted hardware for electronic commerce.
Aura 3D Textures
Authors: Xuejie Qin Yee-Hong Yang
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

This paper presents a new technique, called aura 3D textures, for generating solid textures based on input examples. Our method is fully automatic and requires no user interactions in the process. Given an input texture sample, our method first creates its aura matrix representations and then generates a solid texture by sampling the aura matrices of the input sample constrained in multiple view directions. Once the solid texture is generated, any given object can be textured by the solid texture. We evaluate the results of our method based on extensive user studies. Based on the evaluation results using human subjects, we conclude that our algorithm can generate faithful results of both stochastic and structural textures with an average successful rate of 76.4 percent. Our experimental results also show that the new method outperforms Wei and Levoy's method and is comparable to that proposed by Jagnow et al. [CHECK END OF SENTENCE].
TestU01: A C library for empirical testing of random number generators
Authors: Pierre L'Ecuyer, Richard Simard
Venue: ACM Transactions on Mathematical Software (TOMS) (2007)

We introduce TestU01, a software library implemented in the ANSI C language, and offering a collection of utilities for the empirical statistical testing of uniform random number generators (RNGs). It provides general implementations of the classical statistical tests for RNGs, as well as several others tests proposed in the literature, and some original ones. Predefined tests suites for sequences of uniform random numbers over the interval (0, 1) and for bit sequences are available. Tools are also offered to perform systematic studies of the interaction between a specific test and the structure of the point sets produced by a given family of RNGs. That is, for a given kind of test and a given class of RNGs, to determine how large should be the sample size of the test, as a function of the generator's period length, before the generator starts to fail the test systematically. Finally, the library provides various types of generators implemented in generic form, as well as many specific generators proposed in the literature or found in widely used software. The tests can be applied to instances of the generators predefined in the library, or to user-defined generators, or to streams of random numbers produced by any kind of device or stored in files. Besides introducing TestU01, the article provides a survey and a classification of statistical tests for RNGs. It also applies batteries of tests to a long list of widely used RNGs.
Development of an Extension of the Otsu Algorithm for Multidimensional Image Segmentation of Thin-Film Blood Slides
Authors: Bernard F. Buxton, Houari Abdallahi, Delmiro Fernandez-Reyes, William Jarra
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

Commencing with the Fisher discrimminant, the Otsu algorithm for image segmentation is reviewed and a multidimensional extension proposed. Identification of the pixels belonging to red-blood cells in 1300 × 1030 24-bit colour images of thin-film microscope slides of laboratory samples of malarial infected blood is used to illustrate the Otsu algorithm and the proposed extension. The Otsu algorithm is applied to the image intensity and independently to each of the colour channels in a set of 142 images and the best combination of the colour channel outputs that maximizes the Fisher discriminant selected. ROC and MRROC curves and error rates are used to evaluate performance. The multidimensional extension of the Otsu algorithm is similarly assessed. Preliminary results obtained from sequential application of the multi-dimensional extension of the Otsu algorithm are presented and directions for further research discussed.
Massive Data Input System for Geographical Origin Identification System of Vegetables Using Trace Element Compositions
Authors: Nobuyoshi Sato, Minoru Uehara, Koichiro Shimomura, Hirobumi Yamamoto, Kenichi Kamijo
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

As co-research with agricultural chemists, we developed a vegetable geographical origin identification system using difference of trace element compositions of vegetables from cultivated districts. The system works well to identify geographical origin of vegetables in our previous works. However, there are some problems to gather trace element compositions data. Generally, measured trace element data contains outlying observations, and normally an experimenter removes these kinds of outlying observations. However, in case of massive data must be registered in short time, checking of measured data by hand is an obstruction to automatically registration. Therefore, in this paper, we describe about trial to introduce outlying observation detector using Smirnov test. Also, we describe about how to extract measured data in electronic form from measuring instruments such as ICP-MS which are normally closed system.
Similarities and Differences of E-Commerce and e-Government: Insights from a Pilot Study
Authors: Karine Barzilai-Nahon, Hans J. (Jochen) Scholl
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

So far, empirically grounded studies, which compare the phenomena of e-Commerce and e-Government, have been in short supply. However, such studies it has been argued would most likely deepen the understanding of the sector-specific similarities and differences leading to potential cross-fertilization between the two sectors as well as to the establishment of performance measures and success criteria. This paper reports on the findings of an empirical research pilot, which is the first in a series of planned exploratory and theory-testing studies on the subject.
Remote augmented reality for multiple players over network
Authors: Daniel Chun-Ming Leung, Pak-Shing Au, Irwin King, Edward Hon-Hei Yau
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

Augmented Reality (AR) in multimedia gaming is a dynamic and exciting field of research. One of the challenges is to have multiple users interacting in the networked augmented reality environment. In recent years, camera-based body motion capturing console games, which captures the player's body movement to control the objects rendered by the computer, have been developed. In this paper, we present a system called, Tele-Table which allows multiple users to interact with each other through the network using real objects. Each player's set-up consists of an overhead mounted camera perceiving real objects, a plasma TV placed horizontally to act as a game table, and a computer. One of the most challenging tasks is data synchronization between two terminals. There are mainly three synchronization tasks we need to handle. They are temporal synchronization, spatial synchronization, and game states synchronization between the two terminals. We present these difficulties and present solutions and discussion to solve them. The design goals of the Tele-Table are real-time and realistic user experience. The features of the system are changeable background, using real objects, and real-time augmented reality gaming between two terminals. We outline the system, present the detailed description, and discuss current achievements.
Optimal bit allocation with side information
Authors: P. Prandoni
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

For a given set of quantizers and a data vector, the optimal bit allocation in a rate/distortion sense is the sequence of quantizers which minimizes the overall distortion for a given bit budget. In an operational framework, this sequence is dependent on the data realization rather than on its probabilistic model and the cost of describing the sequence itself becomes therefore part of the bit budget. We present an allocation algorithm based on dynamic programming which determines the optimal bit allocation taking into account the side information of describing the structure of the allocation itself; practical simplifications of the algorithm are also presented with respect to coding of continuous data sources.
Affinity groups: a framework for developing workplace skills
Authors: A. Q. Gates
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

This paper describes the affinity group concept and model as an alternative to traditional research groups in university computer science programs. The affinity research groups provide a physical setting in a cooperative environment in which undergraduate and graduate college students engage in research. Affinity groups involve students with a wide range of experiences, talents, interests and skill levels, and provide them with an opportunity to deepen their knowledge in a computer science area and to develop skills and strategies that will make them effective leaders and successful in academia and industry. The structured activities that are characteristic of affinity groups facilitate the transfer of knowledge and skills from an academic setting to the workplace. The paper addresses issues in the development of workplace skills, the challenges of the transfer of knowledge and skills and the particular ways in which the affinity group processes take into account what is known about transfer and the development of research, technical and social skills.
Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols
Authors: Emanuele Viola, Avi Wigderson
Venue: Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity (2007)

This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is the use of (known) norms on Boolean functions, which capture their approximability in each of these models. The main contributions are new XOR lemmas. We show that if a Boolean function has correlation at most \in \leqslant 1/2 with any of these models, then the correlation of the parity of its values on m independent instances drops exponentially with m. More specifically:For GF(2) polynomials of degree d, the correlation drops to exp (-m/4^d). No XOR lemma was known even for d = 2.For c-bit k-party protocols, the correlation drops to 2^c \cdot\in^{m/2^k} . No XOR lemma was known for k \geqslant 3 parties. Another contribution in this paper is a general derivation of direct product lemmas from XOR lemmas. In particular, assuming that f has correlation at most \in \leqslant1/2 with any of the above models, we obtain the following bounds on the probability of computing m independent instances of f correctly:For GF(2) polynomials of degree d we again obtain a bound of exp (-m/4^d).For c-bit k-party protocols we obtain a bound of 2^{-\Omega(m)} in the special case when \in \leqslant exp (-c \cdot 2^k). In this range of \in, our bound improves on a direct product lemma for two-parties by Parnafes, Raz, and Wigderson (STOC '97). We also use the norms to give improved (or just simplified) lower bounds in these models. In particular we give a new proof that the Mod_m function on n bits, for odd m, has correlation at most exp(-n/4^d) with degree-d GF(2) polynomials.
TTTC: test technology technical council
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International (2004)

We present the effects of using an efficient algorithm for behavior-based model synthesis which is specifically tailored to reactive (legacy) system behaviors. Conceptual backbone is the classical automata learning procedure L*, which we adapt according to the considered application profile. The resulting learning procedure L*Meal , which directly synthesizes generalized Mealy automata from behavioral observations gathered via an automated test environment, drastically outperforms the classical learning algorithm for deterministic finite automata. Thus it marks a milestone towards opening industrial legacy systems to model-based test suite enhancement, test coverage analysis, and online testing. 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
A new management approach for finding an optimal path in an ad-hoc network
Authors: F. Shebli, I. Dayoub, J.-M. Rouvaen, N. Al-Houlou
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

Ad hoc networks, and particularly sensors networks, are composed of nodes in which the batteries and processing capacities are limited. Each node can adjust its power to some extent, that determines all its neighbors that can potentially participate in a hop. The traffic expedition through multiple hops is used when the foreseen destination is not in the immediate extension. The nodes have initially limited energy and consume it in different proportions, according to power level and foreseen receivers. In this paper, a new approach to choose the data paths is proposed, in order to maximize the lifetime of node batteries. This algorithm, basically inspired from project management theory, is simple and allows to find the longest life time of an ad hoc network by calculating the optimal path between a source and a destination.
An Empirical Study of the I Test for Exact Data Dependence
Authors: Kleanthis Psarris, Santosh Pande
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

Parallelizing Compilers rely upon subscript analysis to detect data dependences between pairs of array references inside loop nests. The most widely used approximate subscript analysis tests are the GCD test and the Banerjee test. In an earlier work we proposed the I test, an improved subscript analysis test. The I test extends the accuracy of a combination of the GCD test and the Banerjee test. It is also able to provide exact data dependence information at no additional computation cost. In the present work we perform an empirical study on the Perfect Club benchmarks to demonstrate the effectiveness and practical importance of the I Test. We compare its performance with that of the GCD test and the Banerjee test. We show that the I test is always an exact test in practice.