ppxscal/embedding_network huggingface dataset:
Unsupervised learning on k-partite graphs
Authors: Bo Long, Xiaoyun Wu, Zhongfei (Mark) Zhang, Philip S. Yu
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the research on mining the hidden structures from a k-partite graph is still limited and preliminary. In this paper, we propose a general model, the relation summary network, to find the hidden structures (the local cluster structures and the global community structures) from a k-partite graph. The model provides a principal framework for unsupervised learning on k-partite graphs of various structures. Under this model, we derive a novel algorithm to identify the hidden structures of a k-partite graph by constructing a relation summary network to approximate the original k-partite graph under a broad range of distortion measures. Experiments on both synthetic and real datasets demonstrate the promise and effectiveness of the proposed model and algorithm. We also establish the connections between existing clustering approaches and the proposed model to provide a unified view to the clustering approaches.
Time-domain method for tracking dispersive channels in MIMO OFDM systems
Authors: T. Roman, M. Enescu, V. Koivunen
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

In this paper we address the problem of channel estimation for multiple-input multiple-output OFDM systems for mobile users. Channel tracking and equalization method stemming from Kalman filtering is proposed for time-frequency selective channels. Tracking of MIMO channel matrix is performed in time-domain and equalization in frequency domain. Applying the matrix inversion lemma significantly reduces computational complexity. Simulation results are presented using realistic channel model in typical urban scenarios.
ZettaRAM: A Power-Scalable DRAM Alternative through Charge-Voltage Decoupling
Authors: Ravi K. Venkatesan, Ahmed S. Al-Zawawi, Krishnan Sivasubramanian, Eric Rotenberg
Venue: IEEE Transactions on Computers (2007)

ZettaRAM™ is a nascent memory technology with roots in molecular electronics. It uses a conventional DRAM architecture except that the conventional capacitor is replaced with a new molecular capacitor. The molecular capacitor has a discrete threshold voltage, above which all molecules are charged and below which all molecules are discharged. Thus, while voltage still controls charging/discharging, the fixed charge deposited on the molecular capacitor is voltage-independent. Charge-voltage decoupling makes it possible to lower voltage from one memory generation to the next while still maintaining the minimum critical charge for reliable operation, whereas DRAM voltage scaling is constrained by charge. Voltage can be scaled inexpensively and reliably by engineering new, more favorable molecules. We analyze how three key molecule parameters influence voltage and then evaluate 23 molecules in the literature. Matching DRAM density and speed, the best molecule yields 61 percent energy savings. While the fixed charge is voltage-independent, speed is voltage-dependent. Thus, voltage is padded for competitive latency. We propose dynamically modulating the padding based on criticality of memory requests, further extending ZettaRAM's energy advantage with negligible system slowdown. Architectural management extends the best molecule's energy savings to 77 percent and extracts energy savings from six otherwise uncompetitive molecules.
Chaos in germanium oscillistor
Authors: K. O. Ibragimov, K. M. Aliev, I. K. Kamilov, N. S. Abakarova
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 2 (2003)

Dynamic chaos evolution scenarios of the development of a Kadomtsev-Nedospasov instability in the electron-hole plasma in germanium at 77 and 300 K have been studied experimentally in external electric and magnetic fields at high control parameters. The development of a spatio-temporal chaotic state in the system has been analysed using probe measurements along a sample. It is shown that several attractors, with their own dimensions and power characteristics, may exist simultaneously in the same sample. Scenarios have been found leading to chaos through period doubling, quasi-periodicity and intermittency, depending on the parametric space; transitions of the order-chaos-order type have also been observed.
Adaptive filtering approaches for non-Gaussian stable processes
Authors: O. Arikan, M. Belge, A. E. Cetin, E. Erzin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

A large class of physical phenomenon observed in practice exhibit non-Gaussian behavior. In this paper, /spl alpha/-stable distributions, which have heavier tails than Gaussian distribution, are considered to model non-Gaussian signals. Adaptive signal processing in the presence of such kind of noise is a requirement of many practical problems. Since, direct application of commonly used adaptation techniques fail in these applications, new approaches for adaptive filtering for /spl alpha/-stable random processes are introduced.
Visualization of Non-vectorial Data Using Twin Kernel Embedding
Authors: Yi Guo, Junbin Gao, Paul W. H. Kwan
Venue: Proceedings of the International Workshop on on Integrating AI and Data Mining (2006)

Visualization of non-vectorial objects is not easy in practice due to their lack of convenient vectorial representation. Representative approaches are Kernel PCA and Kernel Laplacian Eigenmaps introduced recently in our research. Extending our earlier work, we propose in this paper a new algorithm called Twin Kernel Embedding (TKE) that preserves the similarity structure of input data in the latent space. Experimental evaluation on MNIST handwritten digit database verifies that TKE outperforms related methods.
Mining Single Sequence at Once Using Disjunctive Tree Patterns
Authors: Kazuhiro Shimizu, Takao Miura
Venue: Proceedings of the Sixth International Conference on Hybrid Intelligent Systems (2006)

Frequent disjunctive patterns is known to be a sophisticated method of text mining in a single document that satisfies anti-monotonicity, by which we can discuss efficient algorithms such as APRIORI. In this work, we propose a new technique for mining frequent disjunctive tree patterns based on Online analysis approach, by which we can improve mining a collection of single sequences in parallel, and discuss some experimental results.
Bridging the gap: augmenting centralized systems with P2P technologies
Authors: Jay A. Patel, Indranil Gupta
Venue: ACM SIGOPS Operating Systems Review (2006)

The last few years have seen a burgeoning of p2p designs, but also a worrisome push back and skeptical resistance against much of this research (and development). We propose a new research direction that seeks to find common ground between the purely centralized architecture and the p2p systems. We propose a new class of systems called "P2P-izers", which incentivize existing centralized infrastructures to utilize p2p solutions. A P2P-izer ensures that p2p technologies compliment existing centralized solutions. Finally, we show the feasibility of this direction by experimentally quantifying the advantages of a simple proof of concept P2P-izer solution for website hosting.
Design and optimization of a torque controller for a switched reluctance motor drive for electric vehicles by simulation
Authors: David Cajander, Hoang Le-Huy
Venue: Mathematics and Computers in Simulation (2006)

This paper presents a study on an optimized controller for a switched reluctance motor drive intended for electric vehicle and hybrid electric vehicle applications. The proposed optimization approach using simulation is described. Simulation results obtained with an 8/6 switched reluctance motor drive are presented and exploited in the optimization process. The performance of the optimized controller is evaluated and validated by simulation.
Authorizing Remote Job Execution Based on Job Properties
Authors: Sang-Min Park, Glenn Wasson, Marty Humphrey
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

E-Science often requires access to remote Grid computing platforms. Current authorization systems on these remote systems have largely based decisions solely on the identity of the submitter -- the job is permitted to execute on the local resource if the job originates from an authenticated and authorized end-user. The problem with this approach is that there is no consideration to what the job will/should do when executed, so an errorful or malicious job -- even from what purports to be a trusted user -- can create significant damage before an operator notices and can kill or suspend the job. This paper presents a novel end-to-end job execution framework in which the properties (behavior) of the job are taken into account for the authorization decision. Experimental results show the duration to perform the authorization and to establish a subsequent restrictive execution context is sufficiently low -- our observed overhead of 253.1 ms on commodity hardware is an acceptable cost for most Grid applications to pay to achieve this more secure execution environment.
What Might We Mean By "Secure Code" and How Might We Teach What We Mean?
Authors: Cynthia E. Irvine
Venue: Proceedings of the 19th Conference on Software Engineering Education and Training Workshops (2006)

To add precision to the term "secure code," several concepts from the area of high assurance system development are introduced. These allow the cost, in terms of organizational damage, to information asset owners of the lack of various forms of protection to be explored. The notion of system assurance levels is introduced as a solution to the combinatorial explosion of damage classes. Our approach to ensuring that students know how to construct evaluatable components, and as a by-product, "secure code," is discussed.
Automatic Capture of Significant Points in a Computer Based Presentation
Authors: Paul Dickson, W. Richards Adrion, Allen Hanson
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

We describe an automatic classroom capture system that detects and records significant (stable) points in lectures by sampling and analyzing a sequence of screen capture frames from a PC used for presentations, application demonstrations, etc. The system uses visual inspection techniques to scan the screen capture stream to identify points to store. Unlike systems that only detect and store slide presentation transitions, this system detects and stores significant frames in any style of lecture using any program. The system is transparent to the lecturer and requires no software or training. It has been tested extensively on lectures with multiple applications and pen-based annotations and has successfully identified "significant" frames (frames that represent stable events such as a new slide, bullet, figure, inked comment, drawing, code entry, application entry etc.). The system can analyze over 20000 frames and typically identifies and stores about 100 significant frames within minutes of the end of a lecture. A time stamp for each saved frame is recorded and will in the future be used to compile these frames into a jMANIC [16] multimedia record of the class.
Service-Oriented Science: Scaling eScience Impact
Authors: Ian Foster
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

Computational approaches to problem solving have proven their worth in many fields of science, allowing the collection and analysis of unprecedented quantities of data, and the exploration via simulation of previously obscure phenomena. New "systems" approaches in fields as diverse as biology [12], earthquake science [11], and environmental science [3] are enabled by, and are spurring the further development of, such computational approaches. But as computational and system-level science methods become increasingly sophisticated, we must ask: how do we scale their impact, from the specialist to entire communities [7]?
Barriers and solutions to the development of online advertising in China
Authors: Bao Xin Ren, Ding Li Ying
Venue: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet (2006)

This paper aims to investigate the barriers and solutions to the development of online advertising in China so as to help online advertisers and companies to enhance the effect of their advertisements. Through the analysis of the latest 16th CNNIC report, this paper researches into five barriers against the development of online advertising in China and point out the harm of infringing ads. Based on the latest trend of online advertising in the country, this paper puts forth five solutions to the development of online advertising, especially the interactive, humanistic and online game solutions.
A Descriptive Markup Approach to Facilitate the Production of e-Learning Contents
Authors: Pablo Moreno-Ger, Ivan Martinez-Ortiz, Jose Luis Sierra, Baltasar Fernandez-Manjon
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

In this paper we show how descriptive markup technologies can help teachers in the production of learning content that later could be used for many different purposes with different pedagogical approaches and for many different platforms. Our approach is illustrated using a manual-writing metaphor for the production of learning contents in the Computer Science domain.
Convergence properties of some block Krylov subspace methods for multiple linear systems
Authors: R. Bouyouli, K. Jbilou, R. Sadaka, H. Sadok
Venue: Journal of Computational and Applied Mathematics (2006)

In the present paper, we give some convergence results of the global minimal residual methods and the global orthogonal residual methods for multiple linear systems. Using the Schur complement formulae and a new matrix product, we give expressions of the approximate solutions and the corresponding residuals. We also derive some useful relations between the norm of the residuals.
Static typing for a faulty lambda calculus
Authors: David Walker, Lester Mackey, Jay Ligatti, George A. Reis, David I. August
Venue: ACM SIGPLAN Notices (2006)

A transient hardware fault occurs when an energetic particle strikes a transistor, causing it to change state. These faults do not cause permanent damage, but may result in incorrect program execution by altering signal transfers or stored values. While the likelihood that such transient faults will cause any significant damage may seem remote, over the last several years transient faults have caused costly failures in high-end machines at America Online, eBay, and the Los Alamos Neutron Science Center, among others [6, 44, 15]. Because susceptibility to transient faults is proportional to the size and density of transistors, the problem of transient faults will become increasingly important in the coming decades.This paper defines the first formal, type-theoretic framework for studying reliable computation in the presence of transient faults. More specifically, it defines λzap, a lambda calculus that exhibits intermittent data faults. In order to detect and recover from these faults, λzap programs replicate intermediate computations and use majority voting, thereby modeling software-based fault tolerance techniques studied extensively, but informally [10, 20, 30, 31, 32, 33, 41].To ensure that programs maintain the proper invariants and use λzap primitives correctly, the paper defines a type system for the language. This type system guarantees that well-typed programs can tolerate any single data fault. To demonstrate that λzap can serve as an idealized typed intermediate language, we define a type-preserving translation from a standard simply-typed lambda calculus into λzap.
Multi-agent Based Semantic E-government Web Service Architecture Using Extended WSDL
Authors: Muhammad Anwar Usman, Muhammad Nadeem, M. Zeeshan Ali Ansari, Sajjad Raza
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

The paramount of e-government is seamless integration of services across organizational boundaries. This requires interoperation of heterogeneous services for which web services are being used currently. However there are several limitations of web services. Due to the absence of some important characteristics web services cannot overcome these limitations. Therefore to eliminate them the paper presents an architecture that augments web services with multi-agent technology and uses OWLS (Web Ontology Language for Services) for semantic description, thus paving the path for seamless integration of government services. The paper also discusses the implementation of the proposed architecture and a critical evaluation which resulted in the identification of reasons behind slow adoption of semantic web services. In addition to this a solution is proposed that is believed to increase the adoption rate due to its simplicity. The solution recommends extending WSDL (Web Service Description Language) to represent semantic information
Developing Gestural Input
Authors: Matthias Kranz, Stefan Freund, Paul Holleis, Albrecht Schmidt, Holger Arndt
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

In this paper, we present the Gesture Cube, a digitally augmented cube for human-computer interaction. The Gesture Cube is designed to be an unobtrusive and playful interaction device for controlling media appliances. In an explorative user study, we analyzed user requirements; in particular we were interested in the set of meaningful gestures that users would think of. Based on this, a digitally augmented cube for controlling home appliances and computer applications has been designed. Gestures are used as the main form of input for interaction with the system. To illustrate the feasibility of our user interface, we present two applications, a 3D visualization of the cube's state and an MP3 player. These applications were evaluated and showed that gesture interfaces can provide a playful and yet efficient means for interaction with everyday devices.
An efficient and robust algorithm for 3D mesh segmentation
Authors: Lijun Chen, Nicolas D. Georganas
Venue: Multimedia Tools and Applications (2006)

This paper presents an efficient and robust algorithm for 3D mesh segmentation. Segmentation is one of the main areas of 3D object modeling. Most segmentation methods decompose 3D objects into parts based on curvature analysis. Most of the existing curvature estimation algorithms are computationally costly. The proposed algorithm extracts features using Gaussian curvature and concaveness estimation to partition a 3D model into meaningful parts. More importantly, this algorithm can process highly detailed objects using an eXtended Multi-Ring (XMR) neighborhood based feature extraction. After feature extraction, we also developed a fast marching watershed-based segmentation algorithm followed by an efficient region merging scheme. Experimental results show that this segmentation algorithm is efficient and robust.
Automatic generation of document semantics for the e-science knowledge grid
Authors: Hai Zhuge, Xiangfeng Luo
Venue: Journal of Systems and Software (2006)

This paper proposes an approach to automatically generate semantics for scientific e-documents, and presents its applications in e-document understanding, question answering and question refinement. The approach uses not only keywords and their relations in e-documents, but also the implied meaning of co-occurred keywords that is hard to be exploited, represented and derived by previous semantic representation approaches. The proposed approach facilitates automatic construction, composition, decomposition and derivation of semantics at different granularity levels, which lay the basis for realizing intelligent services of the e-science Knowledge Grid.
A time-to-live based reservation algorithm on fully decentralized resource discovery in grid computing
Authors: Sanya Tangpongprasit, Takahiro Katagiri, Kenji Kise, Hiroki Honda, Toshitsugu Yuba
Venue: Parallel Computing (2005)

We present an alternative algorithm of fully decentralized resource discovery in Grid computing, which enables the sharing, selection, and aggregation of a wide variety of geographically distributed computational resources. Our algorithm is based on a simply unicast request transmission that can be easily implemented. The addition of a reservation algorithm is enable resource discovery mechanism to find more available matching resources. The deadline for resource discovery time is decided with time-to-live value. With our algorithm, the only one resource is automatically decided for any request if multiple available resources are found on forward path of resource discovery, resulting in no need to ask user to manually select the resource from a large list of available matching resources.We evaluated the performance of our algorithms by comparing with first-found-first-served algorithm. The experiment results show that the percentages of request that can be supported by both algorithms are not different. However, it can improve the performance of either resource utilization or turnaround time, depending on how to select the resource. The algorithm that finds the available matching resource whose attributes are closest to the required attribute can improve the resource utilization, whereas another one that finds the available matching resource which has the highest performance can improve the turn-around time.However, it is found that the performance of our algorithm relies on the density of resource in the network. Our algorithm seems to perform well only in the environment with enough resources, comparing with the density of requests in the network.
Foundations of validating reusable behavioral models in engineering design problems
Authors: Richard J. Malak,  Jr., Christiaan J. J. Paredis
Venue: Proceedings of the 36th conference on Winter simulation (2004)

We present a conceptual framework for validating reusable behavioral models. The setting for this work is a modern product development environment in which design is performed by teams of specialists that collaborate through model reuse. The various modes of model reuse separate validation-relevant knowledge from the tasks for which it is needed. To enable efficient and effective transfer of this knowledge to the tasks for which it is needed, we propose a framework for validating reusable behavioral models based on formal representations of validation-relevant knowledge. The framework defines the abstract knowledge representation as well as an abstract process for applying this knowledge to validate reusable behavioral models. Although this framework is not a complete solution to the validation problem in design, it forms a foundation for understanding and solving the problem and represents a starting point for future investigation.