ppxscal/embedding_network huggingface dataset:
Introduction to the Outsourcing of Information Systems Minitrack
Authors: Benoit Aubert, Suzanne Rivard
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

As a larger number of firms outsource their Information Systems (IS) services, the IS outsourcing landscape is getting more varied with the outsourcing alternatives becoming more numerous, including application services provision (ASP), offshoring, and strategic alliances. For several years, IS outsourcing studies were mainly aimed at explaining outsourcing decisions, so as to better understand the antecedents of an outsourcing decision or of the decision process itself. Recently, researchers' focus has moved towards the management of outsourcing relationships. Some have proposed models that depict the evolution of IT outsourcing relationships while others have attempted to identify drivers for successful relationship management, be they success factors or management mechanisms. All six papers that are included in this year's mini-track on IS outsourcing present the results of studies that were aimed either at better understanding the outsourcing relationship or at proposing approaches for its successful management.
A multiresolution image restoration method for photon imaging systems
Authors: G. Jammal
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

Nuclear medicine imaging systems rely on photon detection as the basis of image formation. One of the major sources of error in these imaging systems is Poisson noise. In this paper, we develop a novel multiscale image restoration procedure for photon imaging systems. It consists in separating in the wavelet-domain data points which belong to structures from those due to the noisy background. The latter are replaced by coefficients obtained by the introduction of a multiresolution regularity constraint. The restored image represents therefore a compromise between fidelity of the data and fidelity of the a priori knowledge on the smoothness of the solution. The performance of the method is assessed with simulated data experiments.
Learning-based approach for vision problems
Authors: Hai Tao
Venue:  (2006)

Learning-based techniques have seen more and more successful application in computer vision. "Learning for vision" is viewed as the next challenging frontier for computer vision. Technical challenges in applying learning-based methods in vision include picking the appropriate representation, model generalization and complexity. This dissertation investigated different vision problems together with the proposed learning algorithms for them. In particular, three vision problems are studied from low-level to high level: stereo, super-resolution and human detection. In the first part, we present a learning-based approach [73, 74] to address the visual correspondence problems when the stereo images have different intensity level. The algorithm first learns the matching behaviors of multiple local-window methods (called experts) using a simple histogram-based method. The learned behaviors are then integrated into a MAP-MRF depth estimation framework and the Metropolis-Hastings algorithm is used to find the MAP solution. Segmentation is also used to accelerate the computation and improve the performance. Qualitative and quantitative experimental results are presented, which demonstrate that, for stereo image pair having different intensity level, the proposed algorithm significantly outperforms the state-of-the-art methods. Using prior knowledge can significantly improve the performance of low-level image processing and vision problems. In the second part, we propose a learning-based approach [72, 71] for video super-resolution. The approach extends previous primal sketch image hallucination method via learning a scene-specific priors using examples. This is achieved by constructing training examples using the high resolution images captured by still camera and use that to increase the low resolution videos. As a result, information from cameras with different spatio-temporal resolutions is combined in our framework. In addition, we use conditional random field (CRF) to enforce smoothness constraint between adjacent super-resolved frames and the video super-resolution is posed as finding the high resolution video that maximize the conditional probability. Extensive experimental results demonstrate that our approach can produce high quality super-resolution videos. In the third part, we explore the problem of human detection and counting using supervised learning [70, 69]. We first propose a solution based on background subtraction and edge detection. A three layer neural network is trained with novel feature representation and used for online human counting. Since the neural network approach works by first segmenting the foreground region, it can not count the static people. To solve this problem, we further propose a detection based approach using Convolutional Neural Network (CNN). This approach applies the detector to every scale and position of the image and collect the total positive responses. Experimental results show that CNN works extremely well for videos where the resolution of human is very low.
Space-time diversity using orthogonal and amicable orthogonal designs
Authors: G. Ganesan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

We consider the utilization of multiple transmitter and receiver antennas for space-time diversity. The optimal SNR scheme, which also provides the best diversity, is outlined. This scheme however involves a reduction in the data rate. Coding schemes are then presented which not only achieve the optimal SNR but also mitigate the reduction of data rate. The proposed schemes are based on the theory of orthogonal designs and amicable orthogonal designs.
Without Knowledge Visualization? Proposing a Deconstructivist Approach to Metaphor, Meaning and Perception
Authors: Stefan Bertschi
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

This paper is designed to examine whether metaphor, meaning and perception are sufficiently dealt with in knowledge visualization. This culminates in the following hypothesis: Because knowledge visualization is a process of construction and reconstruction, the only reasonable approach to evaluate its mechanisms and effectiveness has to be deconstructivist. Such an approach is introduced and examined, leading to primary conclusions and an outlook on a theoretical foundation of an upcoming "scientific discipline'.
Real-time object recognition based on active vision and sequential analysis
Authors: V. Ortmann
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

An image processing system for the real-time object detection and recognition was designed on the principles of active vision and sequential analysis. The real-world visual tasks can be solved due to predictive control of the vision sensor. The sequential analysis allows real-time implementation of the system on low cost DSP hardware. The system was implemented on the DSP TMS320C50 and requires 18-30 ms for the detection and recognition of the object.
Physically Unclonable Function-Based Security and Privacy in RFID Systems
Authors: Leonid Bolotnyy, Gabriel Robins
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications (2007)

Radio Frequency Identification (RFID) is an increasingly popular technology that uses radio signals for object identifi- cation. Tracking and authentication in RFID tags have raised many privacy and security concerns. On the other hand, known privacy and security cryptographic defenses are too hardware- expensive to incorporate into low-cost RFID tags. In this paper, we propose hardware-based approaches to RFID security that rely on physically unclonable functions (PUFs). These func- tions exploit the inherent variability of wire delays and par- asitic gate delays in manufactured circuits, and may be im- plemented with an order-of-magnitude reduction in gate count as compared with traditional cryptographic functions. We de- scribe protocols for privacy-preserving tag identification and secure message authentication codes. We compare PUFs to digital cryptographic functions, address other uses of PUFs to enhance RFID security and suggest interesting directions for future research. The proposed solutions are efficient, practical, and appropriate for low-cost RFID systems.
A performance comparison between stop-the-world and multithreaded concurrent generational garbage collection for Java
Authors: C.-T. D. Lo
Venue: Proceedings of the Performance, Computing, and Communications Conference, 2002. on 21st IEEE International (2002)

The recent popularity of the Java programming language has brought automatic dynamic memory management (a.k.a., the garbage collection) into the mainstream. Traditional garbage collectors suffer from long garbage collection pauses (stop-the-world mark-sweep algorithm) or inability of collecting cyclic garbage (reference counting approach). Generational garbage collection, however, is based only on the weak generational hypothesis that most objects die young. In this paper, the performance evaluation of a new multithreaded concurrent generational garbage collector (MCGC) based on mark-sweep with the assistance of reference counting is reported. The MCGC can take advantage of multiple CPUs in an SMP system and the merits of lightweight processes. Furthermore, the long garbage collection pause can be reduced and the garbage collection efficiency can be enhanced. Measurement results indicate that the MCGC improves the garbage collection pause time up to 96.75% over the traditional stop-the-world mark-sweep garbage collector. Moreover, the MCGC receives minimal time and space penalties as shown in the report of the total execution time, the memory footprint and the sticky reference count rate.
A stream-oriented power management protocol for low duty cycle sensor network applications
Authors: N. Ramanathan, M. Yarvis, J. Chhabra, N. Kushalnagar, L. Krishnamurthy
Venue: Proceedings of the 2nd IEEE workshop on Embedded Networked Sensors (2005)

Most power management protocols are packet-based and optimized for applications with mostly asynchronous (i.e. unexpected) traffic. We present AppSleep, a stream-oriented power management protocol for latency tolerant sensor network applications. For this class of applications, AppSleep demonstrates an over 3/spl times/ lifetime gain over B-MAC and SMAC. AppSleep leverages application characteristics in order to take advantage of periods of high latency tolerance to put the network to sleep for extended periods of time, while still facilitating low latency responses when required. AppSleep also gives applications the flexibility to efficiently and effectively trade latency for energy when desired, and enables energy efficient multi-fragment unicast communication by only keeping the active route awake. We also present Adaptive AppSleep, an application driven addition to AppSleep which supports varying latency requirements while still maximizing energy efficiency. Our evaluation demonstrates that for an overlooked class of applications, stream-oriented power management protocols such as AppSleep outperform packet-based protocols such as B-MAC and S-MAC.
Characterization of the scattering centers of a radar target with polarization diversity using polynomial rooting
Authors: Yide Wang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

We propose a new high resolution method with polarization diversity for the characterization of the scattering centers of a radar target, using a stepped-frequency radar system. The proposed method is based on the polynomial rooting technique. It allows one to optimally use the information contained in the polarization of the received wave while keeping the calculation cost moderate. Moreover, it can estimate the range and the polarization parameters of each scattering center in only one step. Simulation results are presented to show the performance of the algorithm.
Every Monotone $3$-Graph Property is Testable
Authors: Christian Avart, Vojte&caron;ch Ro&uml;dl, Mathias Schacht
Venue: SIAM Journal on Discrete Mathematics (2007)

Recently Alon and Shapira [Every monotone graph property is testable, New York, Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, ACM Press, 2005, pp. 128-137] have established that every monotone graph property is testable. They raised the question whether their results can be extended to hypergraphs. The aim of this paper is to address this problem. Based on the recent regularity lemma of Ro&uml;dl and Schacht [Regular partitions of hypergraphs, Combin. Probab. Comput., to appear], we prove that any monotone property of 3-uniform hypergraphs is testable answering in part the question of Alon and Shapira. Our approach is similar to the one developed by Alon and Shapira for graphs. We believe that based on the general version of the hypergraph regularity lemma the proof presented in this article extends to $k$-uniform hypergraphs.
Adaptive Real-Time Grid Generation from 3D Line Scans for fast Visualization and Data Evaluation
Authors: Christian Teutsch, Dirk Berndt, Erik Trostmann, Bernhard Preim
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

This paper presents a method for the real-time genera- tion of grids from 3D line scan data for in-line scan pre- views and the evaluation of large point clouds derived from different 3D-scanners. By exploiting the underlying mea- suring principles, we generate regular grids for each scan operation even if the sensor movement is non-linear. These grids are finally used for NURBS patch approximations, which enable the determination of higher order features, e.g. curvature and quality evaluations. Experimental re- sults at the example of different point clouds illustrate the effectiveness of our methods in practice.
Experimental investigation on the cycle nature of pressure time history in the compression chamber of a domestic refrigeration compressor
Authors: C. Ozturk
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

The cyclic nature of the pressure time history in the compression chamber of compressor may produce equivalent pressure pulsation effects at the pumping frequency and its higher harmonics. Due to the flow restrictions that appear at the suction and discharge valves, pressure time history can not stay on true sinusoidal shape, and may produce a significant number of higher harmonics. The pressure fluctuations, caused by fluttering discharge valves during discharge process, might provide oscillations in nature. These excitations of higher frequency harmonics when transmitted to the shell on variety of paths exist in the shell, cause further coincidence problems. This study summarizes how time frequency analysis techniques could be an efficient tool for the further analysis of vibration and acoustic based diagnostic signals. The time frequency analysis may provide the information that cannot be available from time or frequency domain analyses alone. 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
Building a prototype for network measurement virtual observatory
Authors: Peter Matray, Istvan Csabai, Peter Haga, Jozsef Steger, Laszlo Dobos, Gabor Vattay
Venue: Proceedings of the 3rd annual ACM workshop on Mining network data (2007)

Online sharing of scientific information has accelerated the research activity in various different domains of science. This fact inspires us to initiate this kind of approach in the field of network research and review some projects pointing towards this direction. Using the experiences of similar efforts in other domains of sciences we are building a prototype node for Network Measurement Virtual Observatory. The goal of the observatory is to stimulate network research through sharing available measurement data along with analysis results and providing easy-to-use "online" network data analysis tools for network research and management purposes. We would also like to initiate discussion about standardization of network measurement data and to motivate other researchers to publish their own data and tools. In this paper we sketch the basic concept of Virtual Observatories and present a prototype system developed to share measurement data and tools associated with the ETOMIC measurement infrastructure.
RFID Assimilation Hierarchy
Authors: Bill C. Hardgrave, Deborah J. Armstrong, Cynthia K. Riemenschneider
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

While much research has been conducted on the adoption of complex technologies, relatively little has addressed the post-adoption deployment of that technology. This research presents a hierarchy of RFID assimilation which proposes that the creation of supplier business value is dependent upon the depth of assimilation (extent of use). The hierarchy is grounded in industry observations of the difficulty of early adopters to fully realize the benefits of RFID assimilation. At the base level of the hierarchy is Technology Deployment, with the next level of Data Understanding, and, lastly, at the top of the hierarchy is Business Value Creation. Each level of the hierarchy is explored and organizational examples are provided to illustrate the three developmental levels. The paper concludes by presenting four potential areas for future RFID assimilation research.
Signal processing and architecture in the lower division electrical engineering core
Authors: S. L. Wood
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

A core course introducing aspects of digital signal processing in a sophomore level architecture course can be used in a variety of undergraduate curriculum structures as an alternative to a "first" DSP course with a systems perspective. An early basic course in logic design with FPGA implementations is common to most university electrical engineering programs, and a course on machine organization and architectures using assembly language instructions follows naturally. Such a course can also introduce students to concepts of DSP while teaching processor structure and organization using a digital signal processing microprocessor and FPGAs. Real time audio signal processing makes the course more interesting to lower division students and reinforces concepts of filtering, modulation, and sampling. This paper describes a "DSP second" course structured in this way. Since there is no linear systems prerequisite, this course is suitable for diverse undergraduate programs. Upper division elective signal processing courses which include traditional DSP topics can cover more material if students already have been introduced to basic DSP concepts and implementations in the sophomore year.
Limits on linear detector performance for close users in a wireless multipath environment
Authors: H. M. Jones
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

In multiuser wireless systems using multiple antennas in a multipath environment it has been asserted that whenever users are at least a distance of /spl lambda//2 apart, it is possible to recover their respective signals with appropriate signal-processing (Winters 1984). This paper significantly strengthens this remarkable assertion by: 1) showing explicitly that separability of the users' signals is possible using the simplest class of linear detectors; 2) showing that the /spl lambda//2 rule of thumb can be quite conservative with meaningful signal separability achievable at separations around /spl lambda//10; and 3) identifying critical geometrical properties, such as position of users and multipath geometry that permit the best separability.
An Analytical Model for Reliability Evaluation of NoC Architectures
Authors: Atefe Dalirsani, Mohammad Hosseinabady, Zainalabedin Navabi
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

This paper proposes an analytical model to assess Reliability Factor of an NoC based System-on-Chip design. Reliability Factor is the probability that faults in the NoC infrastructure can be recovered without any effect on system functionality. The proposed method classifies switch faults of an NoC according to their impact on system functionality. Based on this classification, the contribution of each transient fault lowering the reliability of the NoC is calculated. This model can be used to decide which fault tolerant techniques cause more improvement on system reliability.
A PKI Approach Targeting the Provision of a Minimum Security Level within Internet
Authors: Maryline Laurent-Maknavicius
Venue: Proceedings of the Fourth European Conference on Universal Multiservice Networks (2007)

After decades of expansion, Internet became an essential tool useful for professionals and private individuals providing a large range of services like emailing, management of bank accounts, reservation of hotels, train time schedules, real time traffic information, Internet search... If not targeted at the beginning, Information System Security became rapidly a key challenge for professionals and strong security solutions emerged on the market mainly for professionals. Internet security is thus today two-speed: pretty strong security for professionals or private individuals anxious to protect their computer equipments and no security for professionals or private individuals who can not afford security products and do no have sufficient technical expertise to set up cheap solutions by themselves. In this context, this paper targets the provision of a minimum security level within Internet by defining a PKI solution based on LDAP and DNS (extended with DNSSEC). The originality of the paper is related to the design of the chain of trust that is built over both LDAP and DNSSEC PKIs, the certificate verification method, and indications to extend those concepts to the secure emailing application.
Dynamic buffer cache management scheme based on simple and aggressive prefetching
Authors: H. Seok Jeon, Sam H. Noh
Venue: Proceedings of the 4th annual Linux Showcase & Conference - Volume 4 (2000)

Many replacement and prefetching policies have recently been proposed for buffer cache management. However, many real operating systems, including GNU/Linux, generally use the simple Least Recently Used (LRU) replacement policy with prefetching being employed in special situations such as when sequentiality is detected. In this paper, we propose the SAW 2R scheme that integrates buffer management and prefetching, where prefetching is done constantly in aggressive fashion. The scheme is simple to implement making it a feasible solution in real systems. In its basic form, for buffer replacement, it uses the LRU policy. However, its modular design allows for any replacement policy to be incorporated into the scheme. For prefetching, it uses the LRU-One Block Lookahead (LRU-OBL) approach, eliminating any extra burden that is generally necessary in other prefetching approaches. Implementation studies based on the GNU/Linux kernel version 2.2.14 show that the SA-W2R performs better than the current version of GNU/Linux with a maximum increases of 23 % for the workloads considered.