ppxscal/embedding_network huggingface dataset:
Research Mining using the Relationships among Authors, Topics and Papers
Authors: Ryutaro Ichise, Setsu Fujita, Taichi Muraki, Hideaki Takeda
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

As information technology progress, we are able to obtain much information about the advanced research of others. As a result, researchers and research managers need to track the current research trends amid the information flood. In order to support these efforts to gather knowledge of current research, we propose a research trend mining method. The method utilizes an author-topic model for establishing the relationships between authors, topics, and papers by probabilities, and interactively visualizes the relationships using self-organizing maps. We implemented a research area mapping system and validated it with a case study. In addition, we conducted experiments to show the performance of our system. The experimental results indicate that this system can induce the appropriate relationships for finding research trends.
On the relationship between the Karhunen-Loeve transform and the prolate spheroidal wave functions
Authors: C. L. Fancourt
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

We find a close relationship between the discrete Karhunen-Loeve transform (KLT) and the discrete prolate spheroidal wave functions (DPSWF). We show that the DPSWF form a natural basis for an expansion of the eigenfunctions of the KLT in the frequency domain, and then determine more general conditions that any set of functions must obey to be a valid basis. We also present approximate solutions for small, medium, and large filter orders. The medium order solution suggests that the principal eigenfunction is, to a high degree of approximation, the principal DPSWF modulated so that its center frequency coincides with the peak of maximum energy in the signal spectrum. We then use this result to propose a new basis.
An Approach for Backbone Upgrading Technology Selection Based on Techno-economic Evaluation Model
Authors: Borka Jerman-Blazic, Tomaz Turk
Venue: Proceedings of the First International Conference on the Digital Society (2007)

In this paper comparison and evaluation of the technologies for delivering broadband services at the metro and backbone level is presented In particular, the paper deals with study and techno-economic analysis of two key broadband technologies used for upgrading metropolitan and backbone networks: the SDH and WDM. The study performed is based on calculations of two indexes: CAPEX and OPEX calculations. The studied case is the Telecom Slovenia network which is the incumbent operator in Slovenia. The study is based on the data supplied by the operator.
A learning model that develops students' active learning and reflective practices
Authors: E. L. Haslam
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

As the ABET criteria indicate, undergraduate engineering education is undergoing a radical change to learner-centered pedagogy characterized by student teamwork and integrative curricula. However, this shift will require that faculty understand more about not only how diverse learners construct their knowledge, but also how learners find meaning, develop awareness of how they think and learn, develop intellectual curiosity that is broad-based, and practice their capacity for self-assessment and reflection. In other words, how can faculty help students learn for life? A learning model of three interdependent and mutually reinforcing components is presented that is based on current learning theory, practice and research. Evidence of how these components impact student learning is cited, along with suggestions for faculty development.
"Ring-Ring" Might Soon Mean Ka-Ching
Authors: Greg Goth
Venue: IEEE Distributed Systems Online (2007)

The GSM Association announced two major initiatives in which mobile phones would serve as commercial transaction devices. Carriers, banks, and card issuers have begun pilot projects to test the near-field communication technology that will support the mobile phone as a mobile wallet. Steady progress in the issues that stalled the smart card's promise 10 years ago may have established an ecosystem for the pay-by-mobile phone ecosystem to thrive.
Frigate: an object-oriented file system for ordinary users
Authors: Ted H. Kim, Gerald J. Popek
Venue: Proceedings of the 3rd conference on USENIX Conference on Object-Oriented Technologies (COOTS) - Volume 3 (1997)

Vendors cannot provide all the operating system services that users demand. As a result, there has been a persistent desire to make operating systems more flexible and customizable. It is natural that object-oriented technology would come to bear on this area. However, many solutions have been disappointing when it comes to ease of use. This paper describes the design and implementation of Frigate, an object-oriented file system. The goal of Frigate is to provide a modular, extensible framework. The framework allows new extensions to be "plugged-in" on the fly. Frigate's focus differs from most other file system designs in that it is targeted for use by ordinary users rather than by sophisticated operating system gurus. Thus, ease of use is a very important concern in the design. Frigate is fully implemented and supports a set of example file system extensions.
Optimal rate allocation for video coding and transmission over wireless channels
Authors: Jie Song
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

An integrated framework of optimal rate allocation for video coding is presented in the case of transmission over wireless channels without feedback channels. For a fixed channel bit rate and finite number of channel coding rate, the proposed scheme can find the optimal source and channel coding pair and corresponding robust video coding scheme such that the expected end-to-end distortion of video signals can be minimized. With the, assumption that encoder has the stochastic channel information, the proposed scheme takes into account robust video coding, channel coding and packetization, error concealment techniques altogether. Simulation results show the accuracy and optimality of the proposed method.
Memory-Efficient Image Codec Using Line-based Backward Coding of Wavelet Trees
Authors: Linning Ye, Jiangling Guo, Brian Nutter, Sunanda Mitra
Venue: Proceedings of the 2007 Data Compression Conference (2007)

Wavelet tree-based image compression algorithms have excellent rate distortion performance. However, they have a major drawback in their memory consumption. A new approach based on backward coding of wavelet trees (BCWT) has been recently developed. Although the BCWT algorithm itself uses much less memory than the SPIHT algorithm, the total system memory usage in BCWT coding is still high due to the large memory consumption of the wavelet transform. In this paper, the line-based BCWT algorithm is presented, which utilizes the line-based wavelet transform to achieve BCWT coding. Due to the backward coding feature of the BCWT algorithm, the line-based BCWT algorithm can significantly reduce the overall system memory usage. Depending upon the image size, the memory usage of the line-based BCWT algorithm can be less than 1% of the memory usage of the SPIHT algorithm. Compared with the original BCWT algorithm, the line-based BCWT algorithm can use less than 2% of the memory that the BCWT algorithm consumes, thus making this algorithm extremely suitable for implementation on resource-limited platforms.
Letters: Recurrent network simulations of two types of non-concentric retinal ganglion cells
Authors: Wang-Qiang Niu, Jing-Qi Yuan
Venue: Neurocomputing (2007)

Recurrent network models are widely used to characterize the behaviors of neurons in the visual cortex. However, they are seldom used to simulate neurons in the retina. In this study, two slightly different recurrent network models are introduced to describe two types of non-concentric ganglion cells, i.e., the impressed-by-contrast cell and the suppressed-by-contrast cell in the cat retina. By simulations, it is found that the additive recurrent network is able to describe qualitatively the behavior of the impressed-by-contrast cell, while the other additive recurrent network with saturation rectification is able to describe qualitatively the behavior of the suppressed-by-contrast cell.
Pre-steering derivative constraints for robust broadband antenna arrays
Authors: Z. Shutao
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

The weights of an optimum PB (Pre-steered broadband) antenna array processor are often obtained by solving a LCMV (linearly constrained minimum variance) problem. The objective function is the mean output power (variance) and the constraints space is a set of linear equations which ensure a constant gain in a fixed direction known as the look direction. However, errors in a practical scenario could degrade the performance of the LCMV processor significantly, namely, mismatches between the look direction and the actual DOA (direction of arrival) of the desired signal, positional errors in the sensors and quantization errors in the pre-steered front end of the broadband processor. The main contribution of this paper is the derivation of a new set of constraints, referred to as the Pre-steering derivative constraints, which is able to maintain the processor robustness in the general 3D (three dimensional) space scenario with all the errors mentioned above.
The spring object model
Authors: Sanjay R. Radia, Graham Hamilton, Peter B. Kessler, Michael L. Powell
Venue: Proceedings of the USENIX Conference on Object-Oriented Technologies on USENIX Conference on Object-Oriented Technologies (COOTS) (1995)

The Spring Object Model provides a basis for building operating systems, applications, and other software components for a modern distributed computing environment. All services and abstractions--whether local or remote; system, extension, or user; library or server--are structured as objects. Objects have strongly typed interfaces specified in an interface definition language. Spring forces a clear separation of interface and implementation; no implementation properties are allowed in the interface. It supports multiple interface inheritance, which is used to structure the system abstractions and provides the basis of extending and evolving them. Interfaces are used to define boundaries of software components which can be mapped to different address space and machine boundaries. The model provides parameter passing modes that are especially useful for distributed computing but which can be optimized for the local case. This allows one to construct microkernels with the option of configuring components in the same address space for improved performance. Objects are instances of interfaces, on which clients can perform operations. A client of an object is generally unaware of the location of the object's implementation, and can perform operations on the object and pass the object around freely. The representation of a Spring object is not a fixed piece of information such as a unique identifier; instead, it can be tailored to meet different needs using the subcontract abstraction.
Image classification by a two dimensional hidden Markov model
Authors: Jia Li
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

Traditional block-based image classification algorithms, such as CART and VQ based classification, ignore the statistical dependency among image blocks. Consequently, these algorithms often suffer from over-localization. In order to benefit from the inter-block dependency, an image classification algorithm based on a hidden Markov model (HMM) is developed. An HMM for image classification, a two dimensional extension from the one dimensional HMM used for speech recognition, has transition probabilities conditioned on the states of neighboring blocks from both directions. Thus, the dependency in two dimensions can be reflected simultaneously. The HMM parameters are estimated by the EM algorithm. A two dimensional version of the Viterbi algorithm is also developed to classify optimally an image based on the trained HMM. An application of the HMM algorithm to document image and aerial image segmentation shows that the algorithm performs better than CART.
Tool and Products
Venue: IEEE Computer Graphics and Applications (2007)

In this issue, Tools and Products provides information about Microtek's high-definitionflat-panel TVs, Matrox's DualHead2Go, Displaytech's LightView VGA, WVGA, nad SVGA,Addlogix PC2TV, Infortrend's EonStar S12F-G1420, Kinoshi Informatics GLBenchmark 1.0,Cables to Go RapidRun Digital system, Bunkspeed HyperShot, Moko Interactive CreativePainter, PictoColor CorrectPhoto 20.0, MultiMedia Card Association and Jedec Solid StateTechnology Association's adoption of eMMC, and Adobe's release of the full PortableDocument Format (PDF) 1.7 specification.
Prediction of coefficients from coarse to fine scales in the complex wavelet transform
Authors: T. H. Reeves
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

Prediction of fine scale DWT coefficients from coarser scales is not generally possible. On the other hand, the redundancy of the shift-invariant complex wavelet transform (CWT) should allow good coarse-to-fine scale prediction. The CWT's magnitude and phase step responses are well-behaved functions of a coefficient's normal distance to an edge. We present a coefficient prediction algorithm which assumes an edge-based image model. The algorithm infers information about local edges from coarse scale coefficients, and predicts the effect of these edges on the magnitudes and phases of finer level coefficients. Accurate coarse-to-fine prediction of coefficients has important potential benefits for image coding and resolution enhancement systems.
An Intelligent Error Detection Model for Reliable QoS Constraints Running on Pervasive Computing
Authors: Eung Nam Ko, Kee Chun Bang
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

We propose an intelligence predictive model for reliable QoS constraints running on pervasive computing. FTA is a system that is suitable for detecting and recovering software error based on pervasive computing environment as RCSM(Reconfigurable Context-Sensitive Middleware) by using software techniques. One of the methods to detect error for session's recovery inspects process database periodically. But this method has a weak point of inspecting all processes without regard to session. Therefore, we propose FTA. This method detects error by inspecting by hooking method. If an error is found, FTA informs GSM of the error. GSM informs Daemon or SA-SMA of the error. Daemon creates SA-SMA and so on. SA-SMA creates Video Service Provide Instance and so on.
Multiple-Tiered Security Hierarchy for Web Applications Using Central Authentication and Authorization Service
Authors: Hisashi Naito, Shoji Kajita, Yasushi Hirano, Kenji Mase
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

The Central Authentication Service (CAS) is a middleware for constructing a Single Sign On infrastructure for Web applications and has been developed by JA-SIG. In this paper, we investigate a multiple-tiered security hierarchy infrastructure for Web applications, by extending CAS to the Central Authentication and Authorization Service (CAS^2). Since the new version of CAS (CAS3) supports the X.509 client certificate authentication, we use it as leverage to realize our multiple-tiered security hierarchy mechanism. As a result, CAS^2 uses X.509 client certification for not only authentication, but also authorization.
Challenges in executing large parameter sweep studies across widely distributed computing environments
Authors: Edward Walker, Chona Guiang
Venue: Proceedings of the 5th IEEE workshop on Challenges of large applications in distributed environments (2007)

Large parameter sweep studies are common in a broad range of scientific disciplines. However, many challenges exist in supporting this type of computation in a widely distributed computing environment. These challenges exist because contributing sites in a federated distributed computing environment usually expose only a very narrow resource-sharing interface. This paper looks at the challenges encountered by parameter sweep studies using two concrete application examples. The paper also shows how a system for building personal clusters on demand has been developed to solve many of these problems.
Validation of blind region learning and tracking
Authors: J. Black, D. Makris, T. Ellis
Venue: Proceedings of the 14th International Conference on Computer Communications and Networks (2005)

Multi view tracking systems enable an object's identity to be preserved as it moves through a wide area surveillance network of cameras. One limitation of these systems is an inability to track objects between blind regions, i.e. pans of the scene that are not observable by the network of cameras. Recent interest has been shown in blind region learning and tracking but not much work has been reported on the systematic performance evaluation of these algorithms. The main contribution of this paper is to define a set of novel techniques that can be employed to validate a camera topology model, and a blind region multi view tracking algorithm.
Comparison of Mesh and Hierarchical Networks for Multiprocessors
Authors: V. Carl Hamacher, Hong Jiang
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

Upper bounds on message delay and throughput are developed for two networks that have been used in recent multiprocessor systems. Two-dimensional mesh networks with bidirectional links and no end-around connections are compared to bus-type hierarchical networks that use segmented rings for the interconnection paths at each level of the hierarchy. Wormhole routing of short, fixed-length messages is used in the mesh networks, while a complete message can be switched between ring segments in one switch time in the hierarchical networks. It is found that three-level hierarchical systems perform somewhat better than mesh systems with respect to the basic bounds criteria that are developed.
Towards A Process-Oriented Software Architecture Reconstruction Taxonomy
Authors: Damien Pollet, Stephane Ducasse, Loic Poyet, Ilham Alloui, Sorana Cimpan, Herve Verjus
Venue: Proceedings of the 11th European Conference on Software Maintenance and Reengineering (2007)

To maintain and understand large applications, it is crucial to know their architecture. The first problem is that unlike classes and packages, architecture is not explicitly represented in the code. The second problem is that successful applications evolve over time, so their architecture inevitably drifts. Reconstructing the architecture and checking whether it is still valid is therefore an important aid. While there is a plethora of approaches and techniques supporting architecture reconstruction, there is no comprehensive state of the art and it is often difficult to compare the approaches. This article presents a state of the art on software architecture reconstruction approaches.
Creating Vulnerability Signatures Using Weakest Preconditions
Authors: David Brumley, Hao Wang, Somesh Jha, Dawn Song
Venue: Proceedings of the 20th IEEE Computer Security Foundations Symposium (2007)

Signature-based tools such as network intrusion detection systems are widely used to protect critical systems. Automatic signature generation techniques are needed to enable these tools due to the speed at which new vulnerabilities are discovered. In particular, we need automatic techniques which generate sound signatures -- signatures which will not mistakenly block legitimate traffic or raise false alarms. In addition, we need signatures to have few false negatives and will catch many different exploit variants. We investigate new techniques for automatically generating sound vulnerability signatures with fewer false negatives than previous research using program binary analysis. The key problem to reducing false negatives is to consider as many as possible different program paths an exploit may take. Previous work considered each possible program path an exploit may take separately, thus generating signatures that are exponential in the size of the number of branches considered. In the exact same scenario, we show how to reduce the overall signature size and the generation time from exponential to polynomial. We do this without requiring any additional assumptions, or relaxing any properties. This efficiency gain allows us to consider many more program paths, which results in reducing the false negatives of generated signatures. We achieve these results by creating algorithms for generating vulnerability signatures that are based on computing weakest preconditions (WP). The weakest precondition for a program path to a vulnerability is a function which matches all exploits that may exploit the vulnerability along that path. We have implemented our techniques and generated signatures for several binary programs. Our results demonstrate that our WP-based algorithm generates more succinct signatures than previous approaches which were based on forward symbolic execution.
Blind source separation without optimization criteria?
Authors: V. Zarzoso
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

Blind source separation aims to extract a set of independent signals from a set of observed linear mixtures. After whitening the sensor output, the separation is achieved by estimating an orthogonal transformation, which in the real-mixture two-source two-sensor case is entirely characterized by a single rotation angle. This contribution studies an estimator of such an angle. Even though it is derived from geometric notions based on the scatter-plots of the signals involved, it is found, empirically, to exhibit a performance clearly up to the mark of other methods based on optimality criteria and, theoretically, to improve and generalize one of such procedures. The simplicity of the suggested estimator results in a straightforward adaptive version, which converges regardless of the source distribution, for quite mild conditions, and whose asymptotic analysis is easy to carry out. The applicability of the estimator in a full separation system is also illustrated.
Visualizing the activity of a web-based collaborative platform
Authors: Benoit Otjacques, Monique Noirhomme, Xavier Gobert, Pierre Collin, Fernand Feltz
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

This paper describes a prototype that offers visualization features for monitoring a web-based collaborative platform. The data displayed supports workplace awareness by providing an overview of the activities carried out on the platform. The prototype focuses on the information structured as hierarchical data. Three views are included: a classic vertical tree, a treemap view and an original new layout called ellimap. The system has been implemented on a real case in the domain of the support to innovation.