ppxscal/embedding_network huggingface dataset:
Eigenvalues and eigenvectors of covariance matrices for closely-spaced signals in multi-dimensional direction finding
Authors: J. Jachner, H. Lee
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

The authors characterize the eigenvalues and eigenvectors of covariance matrices that arise in direction finding scenarios with multiple parameters such as azimuth, elevation and, in some applications, also range (multi-D scenarios). They build upon work by H. Lee (1992) for closely-spaced signals with a single directional parameter (1-D). In multi-D, the limiting (small signal spacing) eigenvalues and eigenvectors can be ascertained from a sequence of constant low-rank matrices N/sub k/ expressed in terms of the generic arrival vector, its spatial derivatives, the source configuration, and the source covariances. The limiting eigenvalues are proportional to delta omega /sup 2(k-1)/, where delta omega is the maximum spacing between sources and k epsilon (1,. . .m). It is shown that for a given number of sources m decreases as parameter dimension increases, hence covariance matrix conditioning is improved in multi-D relative to 1-D settings. The results are applicable to analysis of detection and parameter estimation algorithms in multi-D applications.
Using simulation to evaluate emerging transportation concepts
Authors: Beth Carpenter Kulick
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Recent cargo growth projections for the Port of Los Angeles/Long Beach have the container traffic tripling over the next 10 to 15 years. The majority of these containers will pass through the LA basin via truck or rail and onto the rest of the country. To accommodate the anticipated growth in trade, an inland port has been proposed to be built in the desert region of Southern California. There are numerous physical challenges associated with the transportation infrastructure to move containers from the Port to the inland region and there are public pressures to remove trucks from highways and onto rail to reduce congestion, pollution, and improve safety. Simulation offers the ability to demonstrate and evaluate transportation concepts and is being used to assess the capacity of regional rail infrastructure and to explore the potential capabilities of emerging freight transportation concepts such as a high-speed magnetic levitation (MagLev) technology.
Creating entirely textured 3D models of real objects using surface flattening
Authors: Zsolt Jankó, Géza Kós, Dmitry Chetverikov
Venue: Machine Graphics Vision International Journal (2005)

We present a novel method to create entirely textured 3D models of real objects by combining partial texture mappings using surface flattening (surface parametrisation). Texturing a 3D model is not trivial. Texture mappings can be obtained from optical images, but usually one image is not sufficient to show tile whole object; multiple images are required to cover the surface entirely. Merging partial texture mappings in 3D is difficult. Surface flattening converts a 3D mesh into 2D space preserving its structure. Transforming optical images to flattening-based texture maps allows them to be merged based on the structure of the mesh. In this paper we describe a novel method for merging texture mappings using flattening and show its results on synthetic and real data.
An Architecture for Visualisation and Interactive Analysis of Proteins
Authors: Philip McDermott, James Sinnott, Dave Thorne, Steve Pettifer, Terri Attwood
Venue: Proceedings of the Fourth International Conference on Coordinated & Multiple Views in Exploratory Visualization (2006)

Data sets in the biological domain are often semantically complex and difficult to integrate and visualise. Converting between the file formats required by interactive analysis tools and those used by the global databases is a costly and error prone process. This paper describes a data model designed to enable efficient rendering of and interaction with biological data, and two demonstrator applications from different fields of protein analysis that provide co-ordinated views of data held in the underlying model.
Security in multiagent systems by policy randomization
Authors: Praveen Paruchuri, Milind Tambe, Fernando Ordóñez, Sarit Kraus
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Security in multiagent systems is commonly defined as the ability of the system to deal with intentional threats from other agents. This paper focuses on domains where such intentional threats are caused by unseen adversaries whose actions or payoffs are unknown. In such domains, action randomization can effectively deteriorate an adversary's capability to predict and exploit an agent/agent team's actions. Unfortunately, little attention has been paid to intentional randomization of agents' policies in single-agent or decentralized (PO)MDPs without significantly sacrificing rewards or breaking down coordination. This paper provides two key contributions to remedy this situation. First, it provides three novel algorithms, one based on a non-linear program and two based on linear programs (LP), to randomize single-agent policies, while attaining a certain level of expected reward. Second, it provides Rolling Down Randomization (RDR), a new algorithm that efficiently generates randomized policies for decentralized POMDPs via the single-agent LP method.
An analytical phase noise model of charge pump mismatch in sigma-delta frequency synthesizer
Authors: Xiaojian Mao, Huazhong Yang, Hui Wang
Venue: Analog Integrated Circuits and Signal Processing (2006)

Although some papers have qualitatively analyzed the effect of charge pump mismatch on phase noise and spurs in sigma-delta fractional-N frequency synthesizer, few of them have addressed this topic quantitatively. An analytical model is proposed in this paper to describe the behavior of charge pump mismatch and the corresponding phase noise. Numerical simulation shows that this model is of high accuracy and can be applied to the analysis of in-band phase induced by the charge pump mismatch in sigma-delta fractional-N PLL frequency synthesizer. Most importantly, this model discloses that 6 dB reduction of in-band phase noise due to charge pump mismatch can be achieved by halving the charge pump mismatch ratio. After studying the typical topologies of sigma-delta modulators (SDM), we proposed some strategies on the selection of SDM in frequency synthesizer design. Our analytical model also indicates that eliminating the charge pump mismatch is one major path towards the in-band phase noise reduction of the sigma-delta frequency synthesizer.
A real-time prototype for small-vocabulary audio-visual ASR
Authors: J. H. Connell, N. Haas, E. Marcheret, C. Neti, G. Potamianos, S. Velipasalar
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

We present a prototype for the automatic recognition of audio-visual speech, developed to augment the IBM ViaVoice/spl trade/ speech recognition system. Frontal face, full frame video is captured through a USB 2.0 interface by means of an inexpensive PC camera, and processed to obtain appearance-based visual features. Subsequently, these are combined with audio features, synchronously extracted from the acoustic signal, using a simple discriminant feature fusion technique. On the average, the required computations utilize approximately 67% of a Pentium/spl trade/ 4, 1.8 GHz processor, leaving the remaining resources available to hidden Markov model based speech recognition. Real-time performance is there- fore achieved for small-vocabulary tasks, such as connected-digit recognition. In the paper, we discuss the prototype architecture based on the ViaVoice engine, the basic algorithms employed, and their necessary modifications to ensure real-time performance and causality of the visual front end processing. We benchmark the resulting system performance on stored videos against prior research experiments, and we report a close match between the two.
Faculty integration of computer technology into instruction and students' perceptions of computer use to improve their learning
Authors: David Hofmeister
Venue:  (2006)

The purpose of the study was to determine the nature of the relationship between faculty integration of computer technology into instruction and students' perceptions of computer technology use to improve their learning. Three major questions were investigated in this study: (1) What is the frequency of faculty integration of computer technology into classroom instruction? (2) To what extent does the frequency of faculty integration of computer technology, students' computer proficiency levels for personal activities, and students' computer proficiency levels for instructional activities predict the students' perceptions of the effect of computer technology use to improve their learning? (3) Do differences exist across gender and course levels in the students' perceptions of the effect of computer use to improve their learning? The study population involved undergraduate students attending a medium-sized public university in Indiana (N = 837). A survey instrument was designed to the measure the variables that were investigated in the study such as faculty integration of computer technology into classroom instruction, students' computer proficiency skills for personal as well as instructional activities, and students' perceptions of the effect of computer technology use to improve their learning. Four hypotheses were tested in this study. A simultaneous regression analysis with all three predictor variables was conducted to test the first hypothesis. This analysis produced a significant model with the value of R 2 = 0.039; a statistically significant relationship was found between the predictor variables and the criterion---students' perceptions of the effect of computer technology use to improve their learning. A Two-Way ANOVA analysis was used to test the remaining three hypotheses; non-significant results were obtained for the comparison in the students' perceptions of the effect of computer technology use to improve their learning between males and females, and across the four course levels. Evidence from the study suggests that students need to have direct instruction to effectively and efficiently use computer technology applications such as authoring and sophisticated hypermedia. These programs provide computer skills in advanced computer technology applications that will enable faculty to expect more discipline-specific computer-based projects such as developing a webquest in a web editor.
Design procedure of minimum phase affine systems
Authors: A. P. Krishchenko
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

Conceptions of relative degree and minimum phase are connected to many control problems. To apply it, one needs to know an input which renders an affine system minimum phase. We present necessary and sufficient conditions of the existence of such outputs and discuss its relations with backstepping method of stabilization. In the case of more than one relative degree, the obtained conditions result in the new setting of the stabilization problem. 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
Environment Lighting for Point Sampled Geometry
Authors: Feng Liu, Sushil Bhakar, Thomas Fevens, Sudhir Mudur
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

Point sampled geometry has recently gained significant interest due to the tremendous advances in the technology of 3D scanning and the representational simplicity afforded by avoiding any need for explicit connectivity information. Their use in creating highquality rendered images is however still limited. Till date, most renderings of point sampled surfaces use the Phong illumination model. In this paper we consider the rendering of point sampled surfaces with both diffuse and specular material properties under distant illumination, as specified using an environment map. For this, we have combined two of the earlier works for continuous surfaces, spherical harmonic representations of irradiance environment maps and glossy reflection, and programmed it on the GPU using vertex and fragment shaders. This hardware accelerated implementation has been incorporated into a public domain point based renderer enabling us to efficiently produce high quality images of point sampled geometry.
Discrete Graphic Markov Model Selection by Multiobjective Genetic Algorithm (GMS-MGA)
Authors: Eunice Esther Ponce de Leon Senti, Elva Diaz Diaz
Venue: Proceedings of the 15th International Conference on Computing (2006)

The problem of Graphic Markov Model Selection (GMS) is considered as a multiobjective one, where the objectives are : (1) best fitting of the model to the sample data and, (2) least possible number of edges, and the fitting criteria function is the Kullback-Leibler. The multiobjective strategy is to obtain an approximate Pareto front using a multi-starting Multiobjective Genetic Algorithm (MGA). To test the performance of the algorithm, 48 samples of 6 different model complexities are generated using a Markov Model Random Sampler (MMRS) and used as benchmarks. The performance is assessed through the times that the Pareto front contains the true model. As results the algorithm obtains the true models in 93% of the cases, the complexity of the model made a difference in the performance of the algorithm. The mean time of execution is least or equal to 2 minutes for 10 binary variables in a PC.
Codd's Relational Model of Data and Fuzzy Logic: Comparisons, Observations, and Some New Results
Authors: Radim Belohlavek, Vilem Vychodil
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

The present paper deals with Codd's relational model of data. In particular, we deal with fuzzy logic extensions of the relational model. Our main purpose is to examine relationships between some of the models which have been proposed in the literature. We concentrate on functional dependencies which is the most studied part of the relational model within fuzzy logic extensions. In addition to the observations on relationships between fuzzy logic extensions of the relational model, our paper brings up several new technical results.
Flexible Tracking of Object Contours Using LR-Traversing Algorithm
Authors: Russel Ahmed Apu, Marina L. Gavrilova
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

Tracing the contour of an object in an image is an important problem in computer vision. This paper presents a new contour detection algorithm using an adaptive vision framework. The proposed method is different from conventional algorithms in several ways. First, we introduce a new adaptive tracking algorithm called LR-traversing. LRtraversing is unique as it progressively adapts to the thickness of an edge while tracking the contour of an object with variable sharpness. Secondly, the method employs adaptive selection process that can optimally extract features based on an error metric. By utilizing this flexible run-time technique our method can detect and track object contours in realtime. Experiments demonstrate that the method is significantly faster than other algorithms that can achieve similar result.
Interactive Tree Of Life (iTOL): an online tool for phylogenetic tree display and annotation
Authors: Ivica Letunic, Peer Bork
Venue: Bioinformatics (2007)

Summary: Interactive Tree Of Life (iTOL) is a web-based tool for the display, manipulation and annotation of phylogenetic trees. Trees can be interactively pruned and re-rooted. Various types of data such as genome sizes or protein domain repertoires can be mapped onto the tree. Export to several bitmap and vector graphics formats is supported. Availability: iTOL is available at http://itol.embl.de Contact: bork@embl.de
A Novel Partitioning-Based Clustering Method and Generic Document Summarization
Authors: Ramiz M. Aliguliyev
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

In this paper is proposed the generic summarization method that extracts the most relevance sentences from the source document to form a summary. This method based on clustering of sentences. The specificity of this approach is that the generated summary can contain the main contents of different topics as many as possible and reduce its redundancy at the same time. The clustering method satisfies as much homogeneity within each cluster as well as much separability between the clusters as possible.
A Component-Based Architecture for Multi-Agent Systems
Authors: KaiYu Wan, Vasu Alagar
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

A Multi-agent system (MAS) is an open distributed system of agents. The agents in a MAS may form certain specific groups, where agents in each group jointly engage in solving a specific problem. Since problem solving in a specific domain requires agents to have the BDI set that is specific to that application domain, and several groups of agents with each group inheriting one set of BDI, may exist in a large system, the MAS is not only heterogeneous but also has a heavy overhead on the system execution. This complexity must be resolved at the architecture level so that in an implementation the complexity does not arise. In this paper we introduce a formal multi-layered component-based architecture towards developing a dependable MAS. Agent communication and configurations are also discussed. To illustrate our approach, we discuss a solution to a travel planning example using the techniques presented in this paper.
Aggregating Subjective and Objective Measures of Web Search Quality using Modified Shimura Technique
Authors: Rashid Ali, M. M. Sufyan Beg
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

Web Searching is perhaps the second most popular activity on Internet. Millions of users search the web daily for their purpose. But as there are a number of search engines available, there must be some procedure to evaluate them. In this paper, we try to present an effort in this regard. For subjective measure, we are taking into account the "satisfaction" a user gets when presented with search results. The feedback of the user is inferred from watching the actions of the user on the search results presented before him in response to his query. For objective measures, we use Vector space model and Boolean similarity measures. All the three measures are aggregated using Modified Shimura technique of Rank aggregation. The aggregated ranking is then compared with the original ranking given by the search engine. The correlation coefficient thus obtained is averaged for a set of queries. We show our experimental results pertaining to seven public search engines and fifteen queries.
Using a software testing technique to identify registers for partial scan implementation
Authors: Margrit R. Krug, Marcelo S. Moraes, Marcelo S. Lubaszewski
Venue: Proceedings of the 19th annual symposium on Integrated circuits and systems design (2006)

Scan design has been widely used to ease test generation process for digital circuits. Although full scan approach results in high fault coverage while reducing ATPG effort, it introduces area and performance overheads that are most times unacceptable. Hence, partial scan is a commonly used technique to improve testability of sequential circuits while respecting design constraints. In this paper, we present a method to select sequential elements (flip-flops) to compose a partial scan chain. We use a software engineering technique to identify internal variables or signals of the circuit's behavioral description that have low observability. Experiments demonstrate that our approach achieves a high fault coverage including few flip-flops in the scan chain. Moreover, comparative results show that, for complex circuits, proposed technique is more efficient than some classical methods in selecting flip-flops to compose partial scan.
In search of query patterns: a case study of a university OPAC
Authors: Eng Pwey Lau, Dion Hoe-Lian Goh
Venue: Information Processing and Management: an International Journal (2006)

A transaction log analysis of the Nanyang Technological University (NTU) OPAC was conducted to identify query and search failure patterns with the goal of identifying areas of improvement for the system. One semester's worth of OPAC transaction logs were obtained and from these, 641, 991 queries were extracted and used for this work. Issues investigated included query length, frequency and type of search options and Boolean operators used as well as their relationships with search failure. Among other findings, results indicate that a majority of the queries were simple, with short query lengths and a low usage of Boolean operators. Failure analysis revealed that on average, users had an almost equal chance of obtaining no records or at least one record to a submitted query. We propose enhancements and suggest future areas of work to improve the users' search experience with the NTU OPAC.
Simulation Study of Language Specific Web Crawling
Authors: Kulwadee Somboonviwat, Masaru Kitsuregawa, Takayuki Tamura
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

The Web has been recognized as an important part of our cultural heritage. Many nations started archiving national web spaces for future generations. A key technology for data acquisition employed by these archiving projects is web crawling. Crawling cultural and/or linguistic specific resources from the borderless Web raises many challenging issues. In this paper, we propose the language specific web crawling and evaluate the language specific crawling strategies on the web crawling simulator.
Invariant content-based image retrieval by wavelet energy signatures
Authors: Chi-Man Pun
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

An effective rotation and scale invariant log-polar wavelet texture feature for image retrieval was proposed. The feature extraction process involves a log-polar transform followed by an adaptive row shift invariant wavelet packet transform. The log-polar transform converts a given image into a rotation and scale invariant but row- shifted image, which is then passed to the adaptive row shift invariant wavelet packet transform to generate adaptively some subbands of rotation and scale invariant wavelet coefficients with respect to an information cost function. An energy signature is computed for each subband of these wavelet coefficients. In order to reduce feature dimensionality, only the most dominant log-polar wavelet energy signatures are selected as feature vector for image retrieval. The whole feature extraction process is quite efficient and involves only O (n/spl middot/log n) complexity. Experimental results show that this rotation and scale invariant texture feature is effective and outperforms the traditional wavelet packet signatures.