ppxscal/embedding_network huggingface dataset:
A Multi-Sensor System for Mobile Services with Vision Enhanced Object and Location Awareness
Authors: Patrick Luley, Alexander Almer, Christin Seifert, Gerald Fritz, Lucas Paletta
Venue: Proceedings of the Second IEEE International Workshop on Mobile Commerce and Services (2005)

We describe a system which proposes a solution for multi-sensor object awareness and positioning to enable stable location awareness for a mobile service in urban areas. The system offers technology of outdoors vision based object recognition that will extend state-of-the-art location and context aware services towards object based awareness in urban environments. In the proposed application scenario, tourist pedestrians are equipped with a GPRS or UMTS capable camera-phone. They are interested whether their field of view contains tourist sights that would point to more detailed information. Multimedia type data about related history might be explored by a mobile user who is intending to learn within the urban environment. Ambient learning is in this way achieved by pointing the device towards the urban sight, capturing an image, and consequently getting information about the object on site and within the focus of attention, i.e., the user's current field of view. The described mobile system offers multiple opportunities for application in both mobile business and commerce, and is currently developed towards an industrial prototype.
Rapid part-based 3D modeling
Authors: Ismail Oner Sebe, Suya You, Ulrich Neumann
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2005)

An intuitive and easy-to-use 3D modeling system has become more crucial with the rapid growth of computer graphics in our daily lives. Image-based modeling (IBM) has been a popular alternative to pure 3D modelers (e.g. 3D Studio Max, Maya) since its introduction in the late 1990s. However, IBM techniques are inherently very slow and rarely user friendly. Most IBM techniques require either very extensive manual input and/or multiple images. In this paper, we present an IBM technique that gives high level of detail with 1-2 minutes of manipulation from a novice user using only single, un-calibrated image. Our system modifies a generic part-based model of the object under investigation. User inputs are entered via a simple interface and converted into modifications to the whole 3D model. We demonstrate the effectiveness of our modeler by modeling several vehicles, such as SUVs, sedan/hatchback/coupe cars, minivans, trucks and more.
Octree-based animated geometry compression
Authors: Charles B. Owen
Venue:  (2005)

Geometry compression is the compression of the 3D geometric data that provides a computer graphics system with the scene description necessary to render images. Geometric data is quite large and, therefore, needs effective compression methods to decrease the transmission and storage requirements. A large amount of research has been focused on static geometry compression, but only limited research has addressed animated geometry compression , the compression of temporal sequences of geometric data. The goal of this thesis is to represent 3D animation sequences with a reduced set of motion vectors that take advantage of the large data coherence in space and time. An octree-based motion representation method is proposed. In this approach, a small set of motion vectors are generated for each frame by accessing two consecutive frames at a time. These motion vectors represent the differential motion from the previous frame to the current frame. They are used to predict the vertex positions for each frame. The octree motion representation process generates a hierarchical octree structure for each frame in the sequence. Based on this approach, a hybrid coding method is proposed that combines the octree-based approach and delta coding method. Given the same threshold requirement, the hybrid approach performs better than the octree only approach in terms of compression ratio. Both the octree and hybrid approaches can represent 3D animated sequences with high compression factors while maintaining reasonable quality. These two approaches are easy to implement and have a low cost encoding process and a fast decoding process, which make them very suitable for real time application.
Kode Vicious Unscripted
Authors: George Neville-Neil
Venue: Queue (2005)

Greetings, You know, sometimes I really don't need to read my mail to get going on a subject; sometimes I just need to read a little code. I'm sorry I can't share the code with you, as it is proprietary, but it brings up two more items in the long list of things that Kode Vicious really hates. The more I think about it, the more I realize it is just one big problem with a lot of different faces. The problem? Computers make it too easy to copy data. Yes, that's right, I know you were all expecting me to rail on about the poor quality of comments, or documentation, but, in reality it's just that computers are too good at something they're designed to do. I guess I really shouldn't blame the computers; I ought to blame the idiots behind the keyboards, but it's much more acceptable to take out your anger on machines than on people. After all, you're probably not going to be arrested for chucking a computer out a window, unless it hits someone on the street below, but you can bet that chucking a co-worker out a window, though it might feel good at the time, will have consequences. To shed some light on what I am ranting about, let me tell you a story from my day.
Data Integration for Virtual Enterprise in Cyberworlds
Authors: Cheng Leong Ang, Robert Gay, Olga Sourina
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

Virtual Enterprise enables companies to collaborate through sharing of resources, and therefore allows them to enjoy the benefits of virtual integration. The essence of Virtual Enterprise implementation on the Web lies in data integration. This paper describes key research issues in implementation of data integration in virtual enterprise using semantic web service. The architectural framework of the proposed data integration infrastructure adopts a mediated ontology approach to data integration in which each data source is described by its own ontology and translations between different ontologies are by means of mediation. We also propose to use the concept of an active data warehousing system for virtual enterprise data aggregation. The paper briefly describes the preliminary study for the project proposal.
GCF: a general coupling framework
Authors: R. W. Ford, G. D. Riley, M. K. Bane, C. W. Armstrong, T. L. Freeman
Venue: Concurrency and Computation: Practice Experience (2006)

Coupled modelling is increasingly necessary to make progress in understanding the science of complex physical phenomena and a number of bespoke (&lsquo;custom&rsquo;) coupled solutions to specific scientific challenges have emerged in recent years. These coupled models generally consist of some framework code in which individual models are embedded. The framework code promotes the required interoperation of the models to solve the larger problem being addressed. Bespoke solutions limit the ability of scientists to share models and to couple them together flexibly to produce (efficient) implementations to address new problems. This paper presents an approach, <mono>GCF</mono>, which addresses several of these limitations. Individual model sharing and flexibility in composition and deployment is achieved by imposing some lightweight development rules for single models and capturing information relating to the models themselves, to their composition into coupled models and to their deployment onto computational resources as machine-readable metadata. These metadata can be processed to support the generation of an implementation of the coupled model required by the developer. For example, lean and efficient framework code for the specific coupled model and deployment described by the developer can be generated. Alternatively, <mono>GCF</mono>-compliant models can be automatically adapted for use within other, existing frameworks. This paper presents the design and implementation of a bespoke framework generator to achieve the former, and the flexibility in the composition of <mono>GCF</mono>-compliant models is demonstrated. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Event Notification System for Multi-platfor
Authors: Kyunghee Ji, Nammee Moon, Jaegon Kim
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

Every interaction with multimedia contents in various application domains can be called an Event. Arising from an each Event, there is the opportunity to describe what occurred. However, there are a number of difficulties in providing an accurate report about an Event. Different observers of the Event may have vastly different perspectives, needs, and focuses. They may emphasize certain elements to the detriment of others, or they may describe an Event in a way that others may find confusing. New solutions are required for access, delivery, management, and protection process of different content types in a transparent way to many different users on multi-platform. In this paper, we design and develop Event Notification System(ENS) to support the transparent and augmented use of multimedia resources across a wide range of networks and devices. ENS can be used for monitoring illegal content access, statistical report such as calculating the royalty for copyright and calculating the advertising rate, and technical report in ubiquitous multiplatform environment.
Generating Low Cost Plans under Uncertainty and Temporal Constraints
Authors: B. Baki, M. Bouzid, A. Ligeza
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

The paper describes a new approach to generating partially ordered plans with durative actions. Both cost and duration of any task is defined through probability distribution. We propose a planner that generates a plan represented in the form of a partially ordered set of tasks. Each task has a set of temporal constraints, a set of probabilities and a set of constant costs. The planning system generates admissible plans satisfying temporal constraints and allows to select the plan of lowest expected cost.
A Fuzzy Logic Approach to Search Results' Personalization by Tracking User's Web Navigation Pattern and Psychology
Authors: Sachin Agarwal, Pallavi Agarwal
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

The paper intends to describe a method of personalizing the agglomerated search results from various search engines according to the user interests by making use of the web browsing pattern of the user. The technique used classifies the results from the search engines into pre-defined categories (classes) and ranks the categories according to the user's interests. The results within a class can be ranked further by using the web page look and feel characteristics that appeals to the user. The tracking of the user's interest from his web navigation pattern and then deciding about his change in priorities is made by using sets of fuzzy rules proposed in the paper. These rules are made keeping in mind, user's psychology and web page characteristics that appeal a user. The technique described is implemented on a system and the results of the system have been elucidated in the paper.
Parallel Algorithms for Distance-Based and Density-Based Outliers
Authors: Elio Lozano, Edgar Acuna
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

An outlier is an observation that deviates so much from other observations as to arouse suspicion that it was generated by a different mechanism. Outlier detection has many applications, such as data cleaning, fraud detection and network intrusion. The existence of outliers can indicate individuals or groups that exhibit a behavior that is very different from most of the individuals of the dataset. In this paper we design two parallel algorithms, the first one is for finding out distance-based outliers based on nested loops along with randomization and the use of a pruning rule. The second parallel algorithm is for detecting density-based local outliers. In both cases data parallelism is used. We show that both algorithms reach near linear speedup. Our algorithms are tested on four real-world datasets coming from the Machine Learning Database Repository at the UCI.
Flash Memories for SoC: An Overview on System Constraints and Technology Issues, invited
Authors: L. Larcher, P. Pavan, A. Maurelli
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

Flash memories are today one of the fundamental building blocks in modern electronic systems. Their performance (speed, consumption, alterability, non-volatility) and the increasing importance of system reconfigurability push for Flash memory integration in SoC. Unfortunately, Flash integration introduces new issues both at system and at circuit/technology levels that need to be deeply investigated. From the system point of view, several aspects are involved in the choice of the Flash memory type to be integrated in SoC: the most important ones, depending on the specific applications and requirements (cost, power consumption, reliability and performance requirements), will be illustrated. Also circuit - technology issues specific to Flash integration with high-speed logic will be discussed in depth by analyzing the real case of an embedded 1-T NOR Flash memory.
Instability of Classifiers on Categorical Data
Authors: Arno Siebes, Muhammad Subianto, Ad Feelders
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

In this paper we study the local behaviour of arbitrary classifiers using the instability of that classifier in a data point. Moreover, we introduce two algorithms. The first to find highly unstable points, the second to find islands of stability.
When Computer Security Crashes into Multimedia
Authors: J. D. Tygar
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

A casual glance on the web, or in your local newspaper, will quickly convince a reader that the two of the hottest fields in computer science right now are computer security and multimedia. Unfortunately, these fields often seem at odds with each other. This talk will take two case studies and show how the fields cause problems for each other. First, I discuss how multimedia can cause problems for computer security. I show how we are able to take recordings of a user typing at a keyboard and using only a generic $10 microphone and an assumption that the user is typing English, we can from the recording alone determine the text being typed with 96% accuracy. In fact, after training this system on English text, we can accurately recover passwords typed by the user. (This is joint work with L. Zhuang and F. Zhou [1].) Second, I discuss how security can cause problems for multimedia. Taking the example of filtering for copyright protected content, I discuss a variety of proposed schemes for restricting distribution of audio files. I conclude with an overview of other research areas where the fields computer security and multimedia jointly have significant contributions to make.
Pre-Doppler direct data domain approach to STAP
Authors: Dan Madurasinghe, Paul E. Berry
Venue: Signal Processing (2005)

In the direct data domain (D3) approach to space-time adaptive processing, the data corresponding to each range cell is processed individually for interrogating the presence of a target. The technique assumes no statistical properties for the data or clutter. This paper is intended to enhance the use of data domain approaches by introducing the pre-Doppler concept which allows the maximum potential of the D3 approach to be achieved by increasing the signal-to-interference ratio at the output. In previous related work, this was carried out in an ad hoc form which would not always guarantee a solution. This issue is resolved in this study by establishing a clear mathematical foundation via a vector space-based approach. This enables us to form rules for constructing a set of linearly independent basis vectors to represent the basis for the signal subspace excluding the signal of interest.
A modular correctness proof of IEEE 802.11i and TLS
Authors: Changhua He, Mukund Sundararajan, Anupam Datta, Ante Derek, John C. Mitchell
Venue: Proceedings of the 12th ACM conference on Computer and communications security (2005)

The IEEE 802.11i wireless networking protocol provides mutual authentication between a network access point and user devices prior to user connectivity. The protocol consists of several parts, including an 802.1X authentication phase using TLS over EAP, the 4-Way Handshake to establish a fresh session key, and an optional Group Key Handshake for group communications. Motivated by previous vulnerabilities in related wireless protocols and changes in 802.11i to provide better security, we carry out a formal proof of correctness using a Protocol Composition Logic previously used for other protocols. The proof is modular, comprising a separate proof for each protocol section and providing insight into the networking environment in which each section can be reliably used. Further, the proof holds for a variety of failure recovery strategies and other implementation and configuration options. Since SSL/TLS is widely used apart from 802.11i, the security proof for SSL/TLS has independent interest.
Interface state generation in pFETs with ultra-thin oxide and oxynitride on (100) and (110) Si substrates
Authors: J. H. Stathis, R. Bolam, M. Yang, T. B. Hook, A. Chou, G. Larosa
Venue: Microelectronic Engineering (2005)

The effect of negative bias stress on p-FETs is compared for oxide vs. oxynitride gate dielectric, and for (110) vs. (100) surface orientation. Nitrogen causes increased interface state generation near the conduction band edge and reduced defect generation at mid-gap. For oxynitride grown on (110) surface only slight difference is seen compared to (100). The hole trapping contribution to the Vt shift is greater at room temperature compared to 125°C.
Randomness is nonsense
Authors: Preston C. Hammer
Venue: ACM SIGSIM Simulation Digest (1976)

There exists no known random sequence since each test for randomness rejects sequences generatable "at random" and hence any sequence accepted on such a basis is from a stratified space and is not random. A property (randomness) of a sequence which disappears on testing is not a property of the sequence. Hence there is either no random sequence or all sequence are random. This situation is not avoidable. 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
Noise Analysis of a CMOS Active Pixel Sensor for Tomographic Mammography
Authors: Mohammad Hadi Izadi, Karim S. Karim
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

Crystalline silicon (c-Si) technology is attractive for advanced large area imaging applications because of higher transistor mobility, smaller feature sizes and higher density of integration. In particular, for advanced mammography modalities such as tomosynthesis, c-Si is ideally suited to develop the high performance circuitry required for higher contrast, lower noise, and lower X-ray dose, while providing high resolution pixels. We present a voltage-mediated active pixel sensor (APS) with a focus on large area, diagnostic medical X-ray tomographic mammography. System level noise calculations indicate that CMOS technology can meet the stringent noise and area requirements required for tomographic mammography.
Expecting the unexpected: adaptation for predictive energy conservation
Authors: Jeffrey P. Rybczynski, Darrell D. E. Long, Ahmed Amer
Venue: Proceedings of the 2005 ACM workshop on Storage security and survivability (2005)

The use of access predictors to improve storage device performance has been investigated for both improving access times, as well as a means of reducing energy consumed by the disk. Such predictors also offer us an opportunity to demonstrate the benefits of an adaptive approach to handling unexpected workloads, whether they are the result of natural variation or deliberate attempts to generate a problematic workload. Such workloads can pose a threat to system availability if they result in the excessive consumption of potentially limited resources such as energy. We propose that actively reshaping a disk access workload, using a dynamically self-adjusting access predictor, allows for consistently good performance in the face of varying workloads. Specifically, we describe how our Best Shifting prefetching policy, by adapting to the needs of the currently observed workload, can use 15% to 35% less energy than traditional disk spin-down strategies and 5% to 10% less energy than the use of a fixed prefetching policy.
An On-Chip Diagnosis Methodology for Embedded Cores with Replaceable Modules
Authors: Ramesh C. Tekumalla
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

We propose a design for test and diagnosis architecture that simplifies the process of identifying failures within a failing sub-module, without explicitly identifying the faults responsible for that failure. The extra hardware eliminates the post-processing step needed to process the failure logs from the tester and automatically determines the sub-modules inside a core that must be replaced. The proposed methodology reduces the turnaround time for locating a failing module or sub-module and also facilitates testing and diagnosis at the same time. Experimental results are presented using industrial test-cases to validate the effectiveness of the proposed method.
A new parallel environment for interactive simulations implementing safe multithreading with MPI.
Authors: Eduardo Rocha Rodrigues, Airam Jonatas Preto, Stephan Stephany
Venue: Proceedings of the 17th International Symposium on Computer Architecture on High Performance Computing (2005)

This work presents a new parallel environment for interactive simulations. This environment integrates a MPIbased parallel simulation engine, a visualization module, and a user interface that supports modification of simulation parameters and visualization at runtime. This requires multiple threads, one to execute the simulation or the visualization, and other to receive user input. Since many MPI implementations are not thread-safe, it is proposed a new parallel extension of the Python environment that uses UDP sockets in addition to the calls to the MPI library functions. This approach preserves interactivity, which is required to allow researchers to modify simulation parameters and to visualize results at runtime. The ADKS simulator was chosen as a case study. It is a sequential interactive software for molecular dynamics simulations used in the study of defects in solid materials. The simulation engine was parallelized using non-blocking communication and speedups very close to linear were obtained in the test cases. The proposed approach can be extended to be employed in high performance distributed computing.