ppxscal/embedding_network huggingface dataset:
Discovering Cyber Communities from the WWW
Authors: Xiaohua Hu, Jianchoa Han, Nick Cercone
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

In this paper we present a novel method to discovercyber communities from the WWW. A cybercommunity is a set of highly connected web pages inthe WWW, which share the similar topics or interests.The WWW can be modeled as a huge scale-freenetwork graph. Discovering cyber communities isconverted to trawling the corresponding web graphto search for approximate p-quasi complete graph.The algorithm presented in this paper considers thecharacteristics of the scale-free network graphs andis based on the neighbourhood information of thevertex in the p-quasi complete graph in the webgraph.
Modeling of chiral separations in chromatography by means of molecular mechanics
Authors: W. J. Kowalski, J. Nowak, M. Konior
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

Modeling of enantiomeric separations in chromatography allows a prognosis whether the desired enantiomeric separation in a studied chromatographic system could be achieved and anticipates the elution order of particular enantiomeric analytes. The use of molecular mechanics for chiral chromatography can empower a modification of the available, design new chiral stationary phases and explore various types of interactions in chromatographic systems. Furthermore, an insight into the enantioseparation mechanisms can be obtained.
Signal level fusion for multimodal perceptual user interface
Authors: John W. Fisher, Trevor Darrell
Venue: Proceedings of the 2001 workshop on Perceptive user interfaces (2001)

Multi-modal fusion is an important, yet challenging task for perceptual user interfaces. Humans routinely perform complex and simple tasks in which ambiguous auditory and visual data are combined in order to support accurate perception. By contrast, automated approaches for processing multi-modal data sources lag far behind. This is primarily due to the fact that few methods adequately model the complexity of the audio/visual relationship. We present an information theoretic approach for fusion of multiple modalities. Furthermore we discuss a statistical model for which our approach to fusion is justified. We present empirical results demonstrating audio-video localization and consistency measurement. We show examples determining where a speaker is within a scene, and whether they are producing the specified audio stream.
Fast, Layout-Inclusive Analog Circuit Synthesis using Pre-Compiled Parasitic-Aware Symbolic Performance Models
Authors: Mukesh Ranjan, Wim Verhaegen, Anuradha Agarwal, Hemanth Sampath, Ranga Vemuri, Geoges Gielen
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

We present a new methodology for fast analog circuit synthesis, based on the use of parameterized layout generators and symbolic performance models (SPMs) in the synthesis loop. Fast layout generation is achieved by using efficient parameterized procedural layout generators. Fast performance estimation is achieved by using pre-compiled SPMs, stored asefficient DDD-like structures called Element Coefficient Diagrams. Techniques have been developed to include layout geometry effects in the SPMs. The accuracy and efficiency of theparasitic inclusion technique as well as the proposed methodology have been demonstrated by comparisons to traditional synthesis methods. The proposed methodology is used for thesynthesis of opamps and filters and is demonstrated to achieve effective performance closure.
A fast and efficient algorithm for determining fanout trees in large networks
Authors: Shen Lin, Malgorzata Marek-Sadowska
Venue: Proceedings of the conference on European design automation (1991)

This paper presents a heuristic algorithm to the optimal selection of the fanout tree structures in VLSI circuit design. The algorithm minimizes area of the added buffers under the specified timing constraints. The algorithms described in the literatures [11], [12], [13]solve a simpler problem of minimizing the circuit's timing without taking into account the area increase introduced by the buffers. Experimental results demonstrate that our approach is very fast and efficient, particularly for large examples whose solution spaces are very large.
Contrasting Time Mode and Sensory Modality in the Performance of Computer Mediated Groups Using Asynchronous Videoconferencing
Authors: Kristine L. Nowak, James Watt, Joseph B. Walther, Carrie Pascal, Scott Hill, Michael Lynch
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

This research examined the question of whether perceptions of media as inferior to face to face are socially or technologically determined. It takes advantage of a recently developed asynchronous videoconferencing system to compare the perceptions and outcomes of group projects done in a multi-cue asynchronous media to those of face to face groups. Participants engaged in collaboration over 5 weeks to develop group oral reports. Measures of social presence, conversational involvement, perceived effectiveness, and ratings of group project quality were compared between communication conditions. Results showed significant differences favoring face-to-face communication for several perceptual variables, but not for perceived or actual effectiveness. Results are discussed with respect to their pertinence for several theories, and for their illumination of some historical theoretical and measurement biases in computer-mediated communication research.
A Reference Architecture for Knowledge Management-Based Web Systems
Authors: Alfredo Cuzzocrea, Carlo Mastroianni
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

Knowledge Management-based Web Systems (KMbWS) are a novel class of Web Information Systems whose main goal is to adapt contents and presentations with respect to user needs and backgrounds through the execution of Knowledge Management processes. KMbWS involve complex issues such as knowledge representation, classification and clustering, reasoning, and, more recently, ontologies and semantic Web. In this paper we present a methodology for the designing and developing of KM-bWS, starting from the application domain analysis. We also provide a reference multi-layer architecture for KM-bWS. In our opinion, a KM-bWS can be considered as an "intelligent knowledge hub" because it makes distributed Web resources available by means of Knowledge Management techniques such as classification and clustering. Finally, we present a reference model for developing a KM-bMS authoring tool able to support our methodology.
Robust Real-Time Face Detection
Authors: Paul Viola, Michael J. Jones
Venue: International Journal of Computer Vision (2004)

This paper describes a face detection framework that is capable of processing images extremely rapidly while achieving high detection rates. There are three key contributions. The first is the introduction of a new image representation called the &ldquo;Integral Image&rdquo; which allows the features used by our detector to be computed very quickly. The second is a simple and efficient classifier which is built using the AdaBoost learning algorithm (Freund and Schapire, 1995) to select a small number of critical visual features from a very large set of potential features. The third contribution is a method for combining classifiers in a &ldquo;cascade&rdquo; which allows background regions of the image to be quickly discarded while spending more computation on promising face-like regions. A set of experiments in the domain of face detection is presented. The system yields face detection performance comparable to the best previous systems (Sung and Poggio, 1998; Rowley et al., 1998; Schneiderman and Kanade, 2000; Roth et al., 2000). Implemented on a conventional desktop, face detection proceeds at 15 frames per second.
Exponential stability and universal attractors for the Navier-Stokes equations of compressible fluids between two horizontal parallel plates in R3
Authors: Yuming Qin, Jaime E. Muñoz Rivera
Venue: Applied Numerical Mathematics (2003)

In this paper we establish the exponential stability of solutions and existence of universal attractors for the Navier-Stokes equations of a compressible viscous heat-conductive fluid between two horizontal parallel plates in R3.
The multidisciplinary combinatorial approach (MCA) and its applications in engineering
Authors: Offer Shai
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2001)

The current paper describes the Multidisciplinary Combinatorial Approach (MCA), the idea of which is to develop discrete mathematical representations, called &ldquo;Combinatorial Representations&rdquo; (CR) and to represent with them various engineering systems. During the research, the properties and methods embedded in each representation and the connections between them were investigated thoroughly, after which they were associated with various engineering systems to solve related engineering problems. The CR developed up until now are based on graph theory, matroid theory, and discrete linear programming, whereas the current paper employs only the first two. The approach opens up new ways of working with representations, reasoning and design, some of which are reported in the paper, as follows: 1) Integrated multidisciplinary representation&mdash;systems which contain interrelating elements from different disciplines are represented by the same CR. Consequently, a uniform analysis process is performed on the representation, and thus on the whole system, irrespective of the specific disciplines, to which the elements belong. 2) Deriving known methods and theorems&mdash;new proofs to known methods and theorems are derived in a new way, this time on the basis of the combinatorial theorems embedded in the CR. This enables development of a meta-representation for engineering as a whole, through which the engineering reasoning becomes convenient. In the current paper, this issue is illustrated on structural analysis. 3) Deriving novel connections between remote fields&mdash;new connections are derived on the basis of the relations between the different combinatorial representations. An innovative connection between mechanisms and trusses, shown in the paper, has been derived on the basis of the mutual dualism between their corresponding CR. This new connection alone has opened several new avenues of research, since knowledge and algorithms from machine theory are now available for use in structural analysis and vice versa. Furthermore, it has opened opportunities for developing new design methods, in which, for instance, structures with special properties are developed on the basis of known mechanisms with special properties, as demonstrated in this paper. Conversely, one can use these techniques to develop special mechanisms from known trusses.
Enriching online learning resources with "explanograms"
Authors: Arnold N. Pears, Carl Erickson
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

This paper introduces a new learning resource for traditional and distance education. Explanograms are explanatory text and diagrams captured and stored as they are developed over time. Explanograms offer a new twist on an ancient means of communication by preserving the chronology of their creation. Teachers can develop explanograms as easily as capturing an explanation offered during lecture or office hours. We invented the explanogram as a learning aid for students, and as a means for improving our productivity as teachers. In this paper we describe the technology behind explanograms, how we plan to use them, and our approach to evaluating their effectiveness. A demonstration of the technology will be presented at the conference, where we hope to engage a broad spectrum of experts for suggestions and perspectives on the use of explanograms.
A computer terminal for a quadriplegic
Authors: David Hagelbarger, Robert Anderson, Peter Kubik
Venue: Issue 24 (October 1978) (1978)

A computer terminal has been modified for use by a quadriplegic with no limb control; all operations are done with a mouth stick. A new keyboard was built and logic circuits were added to permit using the "shift" and "control" functions with only one "finger".
Exact Schema Theory and Markov Chain Models for Genetic Programming and Variable-length Genetic Algorithms with Homologous Crossover
Authors: Riccardo Poli, Nicholas Freitag McPhee, Jonathan E. Rowe
Venue: Genetic Programming and Evolvable Machines (2004)

Genetic Programming (GP) homologous crossovers are a group of operators, including GP one-point crossover and GP uniform crossover, where the offspring are created preserving the position of the genetic material taken from the parents. In this paper we present an exact schema theory for GP and variable-length Genetic Algorithms (GAs) which is applicable to this class of operators. The theory is based on the concepts of GP crossover masks and GP recombination distributions that are generalisations of the corresponding notions used in GA theory and in population genetics, as well as the notions of hyperschema and node reference systems, which are specifically required when dealing with variable size representations.In this paper we also present a Markov chain model for GP and variable-length GAs with homologous crossover. We obtain this result by using the core of Vose's model for GAs in conjunction with the GP schema theory just described. The model is then specialised for the case of GP operating on 0/1 trees: a tree-like generalisation of the concept of binary string. For these, symmetries exist that can be exploited to obtain further simplifications.In the absence of mutation, the Markov chain model presented here generalises Vose's GA model to GP and variable-length GAs. Likewise, our schema theory generalises and refines a variety of previous results in GP and GA theory.
A Game Theoretic Approach to Low Energy Wireless Video Streaming
Authors: Ali Iranli, Kihwan Choi, Massoud Pedram
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

This paper presents a dynamic energy management policy for a wireless video streaming system, consisting of battery-powered client and server. The paper starts from the observationthat the video quality in wireless streaming is a function of three factors: encoding aptitude of the server, decoding aptitude of the client, and the wireless channel. Based on this observation, the energy consumption of a wireless video streaming system is modeled and analyzed. Using the proposed model, the optimal energy assignment to each video frame is done such that the maximum system lifetime is achieved while satisfying a given minimum video quality requirement. Experimental results show that the proposed policy increases the system lifetime by 20%.
A new IIR-type digital fractional order differentiator
Authors: YangQuan Chen, Blas M. Vinagre
Venue: Signal Processing (2003)

A new infinite impulse response (IIR)-type digital fractional order differentiator (DFOD) is proposed by using a new family of first-order digital differentiators expressed in the second-order IIR filter form. The integer first-order digital differentiators are obtained by the stable inversion of the weighted sum of Simpson integration rule and the trapezoidal integration rule. The distinguishing point of the proposed DFOD lies in an additional tuning knob to compromise the high-frequency approximation accuracy.
New Factorizable Discretizations for the Euler Equations
Authors: Boris Diskin, James L. Thomas
Venue: SIAM Journal on Scientific Computing (2003)

A multigrid method is defined as having textbook multigrid efficiency (TME) if solutions to the governing system of equations are attained in a computational work that is a small (less than 10) multiple of the operation count in one target-grid residual evaluation. A way to achieve TME for the Euler and Navier--Stokes equations is to apply the distributed relaxation method, thereby separating the elliptic and hyperbolic partitions of the equations. Design of a distributed relaxation scheme can be significantly simplified if the principal linearization of the target discretization possesses two properties: (1) factorizability and (2) consistent approximations for the separate factors. The first property implies that the discrete system determinant can be represented as a product of discrete factors, each of them approximating a corresponding factor of the determinant of the differential equations. The second property requires that the discrete factors reflect the physical anisotropies, be stable, and be easily solvable.This paper presents an approach to the derivation of discretization schemes for which TME can be achieved by multigrid solvers with distributed relaxation. In particular, discrete schemes for the nonconservative Euler equations possessing properties (1) and (2) have been derived and analyzed. The accuracy of these scheme has been tested for subsonic flow regimes and compared with accuracy of standard schemes. TME has been demonstrated in solving fully subsonic quasi--one-dimensional flow in a convergent/divergent channel.
TOSSIM: accurate and scalable simulation of entire TinyOS applications
Authors: Philip Levis, Nelson Lee, Matt Welsh, David Culler
Venue: Proceedings of the 1st international conference on Embedded networked sensor systems (2003)

Accurate and scalable simulation has historically been a key enabling factor for systems research. We present TOSSIM, a simulator for TinyOS wireless sensor networks. By exploiting the sensor network domain and TinyOS's design, TOSSIM can capture network behavior at a high fidelity while scaling to thousands of nodes. By using a probabilistic bit error model for the network, TOSSIM remains simple and efficient, but expressive enough to capture a wide range of network interactions. Using TOSSIM, we have discovered several bugs in TinyOS, ranging from network bit-level MAC interactions to queue overflows in an ad-hoc routing protocol. Through these and other evaluations, we show that detailed, scalable sensor network simulation is possible.
Detail-on-demand hypervideo
Authors: John Doherty, Andreas Girgensohn, Jonathan Helfman, Frank Shipman, Lynn Wilcox
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

We demonstrate the use of detail-on-demand hypervideo in interactive training and video summarization. Detail-on-demand video allows viewers to watch short video segments and to follow hyperlinks to see additional detail. The player for detail-on-demand video displays keyframes indicating what links are available at each point in the video. The Hyper-Hitchcock authoring tool helps users create hypervideo by automatically dividing video into clips that can be combined in a direct manipulation interface. Clips can be grouped into composites and hyperlinks can be placed between clips and composites. A summarization algorithm creates multi-level hypervideo summaries from linear video by automatically selecting clips and placing links between them.
Making Recommendations Based on Profitability Analysis in a Hybrid System
Authors: Jing Qiu, Min Xu, Yuhui Qiu
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

The study on recommender systems alwaysblinds to the profitability difference amongcustomers. In our research, we have extendedour previous work of segmenting customersbased on their contributions by proposing ahybrid recommendation system which usesmulti-agent system, collaborative filteringtogether to serve the customers with highprofitability, while using simplified top-N togenerate high efficient recommendations for thelower profitability customers. Also,agent-based recommendation strategy selectionarchitecture has been proposed and examined inthe hybrid recommendation system.
ACM SIGACT news distributed computing column 13
Authors: Sergio Rajsbaum
Venue: ACM SIGACT News (2003)

The Distributed Computing Column covers the theory of systems that are composed of a number of interacting computing elements. These include problems of communication and networking, databases, distributed shared memory, multiprocessor architectures, operating systems, verification, Internet, and the Web.This issue describes the PODC 20th anniversary Special Issue published by Distributed Computing journal.
Automated annotation of human faces in family albums
Authors: Lei Zhang, Longbin Chen, Mingjing Li, Hongjiang Zhang
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

Automatic annotation of photographs is one of the most desirable needs in family photograph management systems. In this paper, we present a learning framework to automate the face annotation in family photograph albums. Firstly, methodologies of content-based image retrieval and face recognition are seamlessly integrated to achieve automated annotation. Secondly, face annotation is formulated in a Bayesian framework, in which the face similarity measure is defined as maximum a posteriori (MAP) estimation. Thirdly, to deal with the missing features, marginal probability is used so that samples which have missing features are compared with those having the full feature set to ensure a non-biased decision. The experimental evaluation has been conducted within a family album of few thousands of photographs and the results show that the proposed approach is effective and efficient in automated face annotation in family albums.
General sound classification and similarity in MPEG-7
Authors: Michael Casey
Venue: Organised Sound (2001)

We introduce a system for generalised sound classification and similarity using a machine-learning framework. Applications of the system include automatic classification of environmental sounds, musical instruments, music genre and human speakers. In addition to classification, the system may also be used for computing similarity metrics between a target sound and other sounds in a database. We discuss the use of hidden Markov models for representing the temporal evolution of audio spectra and present results of testing the system on classification and retrieval tasks. The system has been incorporated into the MPEG-7 international standard for multimedia content description and is therefore publicly available in the form of a set of standardised interfaces and software reference tools for developers and researchers.
Assuring Fair Allocation of Excess Bandwidth in Reservation Based Core-Stateless Networks
Authors: Avadora Dumitrescu, Jarmo Harju
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

Assuring guaranteed services and providing fairbandwidth sharing are much sought characteristics in thecurrent network architecture research. The IntServapproaches achieve those characteristics but only at theexpense of using per-flow states and signaling, which arenot scalable and difficult to implement. Alternatively, thestateless approaches proposed up to now are focusedeither on providing guaranteed services similar to thoseoffered by IntServ or on ensuring a reasonably fairbandwidth allocation. In this paper we propose a statelessarchitecture - the Fair Bandwidth Allocation Control(Fair-BAC) - that ensures both the adherence to the giventhroughput guarantees and a fair allocation of theremaining bandwidth between the flows that do not haveany reservation and the out-of-profile fraction of the flowswith reservation. The capabilities of Fair-BAC aredemonstrated in a set of simulations performed forvarious degrees of congestion and using sources withdifferent conformance levels.