ppxscal/embedding_network huggingface dataset:
Video Corpus Construction and Analysis
Authors: Takashi Satou, Akihito Akutsu, Yoshinobu Tonomura
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

This paper proposes video corpus analysis as a new approach to video handling. The purpose of this approach is to discover frequent and characteristic video expressions from a large amount of video data. A video corpus has been built and currently consists of about 180 hours of MPEG-2 encoded video data, automatically extracted characteristics, and manually tagged attributes. These data include shot boundaries, camera operations, transition time and types between shots, text appearance in video, and thumbnail video frame images. Various tools are developed to enter, analyze, and visualize the video data and attributes. This paper mentions early results; analysis of the video corpus using N-gram statistics of the frame images, probabilities of attributes, and distribution of text appearance timing, reveals some interesting video expressions and usages that can be adopted for video handling.
Computing dynamic clusters
Authors: Philippe Dugerdil, Sebastien Jossi
Venue: Proceedings of the 2nd India software engineering conference (2009)

When trying to reverse engineer software, execution trace analysis is increasingly used. Though, by using this technique we are quickly faced with an enormous amount of data that we must process. While many solutions have been proposed that consist of summarizing, filtering or compressing the trace, the lossless techniques are seldom able to cope with millions of events. Then, we developed a dynamic clustering technique, based on the segmentation of the execution trace that can losslessly process such a large quantity of data. In order to compute the clusters of classes we use a maximal clique computing algorithm. After having presented our technology we show experimental results highlighting that it is robust with respect to the segmentation parameters. Finally we present the tool we developed to compute dynamic clusters from execution traces.
Aerodynamic optimization via multi-objective micro-genetic algorithm with range adaptation, knowledge-based reinitialization, crowding and ε-dominance
Authors: András Szlls, Miroslav Šmíd, Jaroslav Hájek
Venue: Advances in Engineering Software (2009)

In this study, an optimization of the airfoil of a sailplane is carried out by a recently developed multi-objective genetic algorithm based on microevolution, containing crowding, range adaptation, knowledge-based reinitialization and @e-dominance. Its efficiency was tested on a set of test problems. The results are encouraging, suggesting that very small populations can be used effectively to solve real-world multi-objective optimization problems in many cases of interest.
Overlapping Coalition Formation
Authors: Georgios Chalkiadakis, Edith Elkind, Evangelos Markakis, Nicholas R. Jennings
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

In multiagent domains, agents form coalitions to perform tasks. The usual models of cooperative game theory assume that the desired outcome is either the grand coalition or a coalition structure that consists of disjoint coalitions (i.e., a partition of the set of agents). However, in practice an agent may be involved in executing more than one task, and distributing his resources between several (not necessarily disjoint) coalitions. To tackle such scenarios, we introduce a model for cooperative games with overlapping coalitions. We then focus on concepts of stability in this setting. In particular, we define and study a notion of the core, which is a generalization of the corresponding notion in the traditional models of cooperative game theory. Under some quite general conditions, we characterize the elements of core. As a corollary, we also show that any element of the core maximizes the social welfare. We then introduce a concept of balancedness for overlapping coalitional games, and use it to characterize coalition structures that can be extended to elements of the core. Furthermore, we generalize the notion of convexity to our setting, and show that under some natural assumptions convex games have a non-empty core. To the best of our knowledge, this is the first paper to provide a generic model for overlapping coalition formation, along with a theoretical treatment of stability in this setting.
Investigations of photo-assisted conductive atomic force microscopy on III-nitrides
Authors: Mao-Nan Chang, Ruo-Syuan Lin, Hsueh-Hsing Liu, Hung-Min Lin, Hung-Cheng Lin, Jen-Inn Chyi
Venue: Microelectronics Journal (2009)

We have employed photo-assisted conductive atomic force microscopy (PA-CAFM) to obtain high-resolution current images on III-nitride surfaces. From the statistical results of current distribution, it is revealed that the full-width at half-maximum (FWHM) value is very sensitive to the dislocation density of III-nitride films even if the dislocation density is very low (~10^8cm^-^2), suggesting that the FWHM value of current statistics can be an indicator of III-nitride quality. The results acquired by PA-CAFM are consistent with those obtained from etching-pit density and X-ray diffraction measurements. In addition, it is also revealed that PA-CAFM can observe the current distribution of InN dots without external bias influences, directly indicating the dependence of InN dots and dislocations. Our experimental results indicate that PA-CAFM is a promising method for investigating the electrical and structural properties of a nanometric area in III-nitride materials.
A minicomputer system for audio-animatronics show data generation
Authors: Philip C. Stover, R. David Snyder
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

Audio-Animatronics&reg; shows have been produced by Disney since the introduction of several attractions at the 1964 New York World's Fair. Since then a variety of shows have been permanently installed at both Disneyland and Walt Disney World. They typically consist of a stage, or some enclosed show area, and a variety of special lighting effects, mechanized characters and other movable stage equipment. Some of the shows include: "Great Moments with Mr. Lincoln," "The Country Bear Jamboree," and "Pirates of the Caribbean."
On the Architecture of Pānini's Grammar
Authors: Paul Kiparsky
Venue: Sanskrit Computational Linguistics: First and Second International Symposia Rocquencourt, France, October 29-31, 2007 Providence, RI, USA, May 15-17, 2008 Revised Selected and Invited Papers (2009)

The descriptive technique of Pānini's Aṣṭ ādhyā yī has deeply influenced modern linguistic theory and practice. Pānini's had no predetermined "theory of grammar". The rich array of formal devices and categories of his analysis emerge from nothing more than rigorously making it as short as possible. I review the overall organization of his grammar, the types of rules and the categories that they apply to, and the principles which govern their application and interaction in the system. I present in outline Pānini's treatment of the major topics of Sanskrit grammar: syntax, word-formation (primary and secondary derivation, compounding), nominal and verbal inflection, and phonology. The analysis reveals that central aspects of what linguistics ascribes to Universal Grammmar, including levels of representation, thematic roles, and rule ordering, are motivated within the Aṣṭ ādhyā yī merely by the goal of achieving maximum compression. This finding is itself of considerable theoretical interest.
Error Spreading: Reducing Bursty Errors in Continuous Media Streaming
Authors: Hung Q. Ngo, Srivatsan Varadarajan, Jaideep Srivastava
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

With the growing popularity of the Internet, there is increasing interest in using it for audio and video transmission. Periodic network overloads, leading to bursty packet losses, have always been a key problem for network researchers. In a long-haul, heterogeneous network like the Internet, handling such an error becomes especially difficult. Perceptual studies of audio and video viewing have shown that bursty losses have the most annoying effect on people, and hence are critical issues to be addressed for applications such as Internet phone, video conferencing, distance learning, etc. Classical error handling techniques have focused on applications like FTP, and are geared towards ensuring that the transmission is correct, with no attention to timeliness. For isochronous traffic like audio and video, timeliness is a key criterion, and given the high degree of content redundancy, some loss of content is quite acceptable. In this paper we introduce the concept of "error spreading", which is a transformation technique that takes the input sequence of packets (from an audio or video stream) and scrambles its packets before transmission. The packets are unscrambled at the receiving end. The transformation is designed to ensure that bursty losses in the transformed domain get spread all over the sequence in the original domain. Perceptual studies have shown that users are much more tolerant of a uniformly distributed loss of low magnitude. We next describe a continuous media transmission protocol based on this idea, and validate its performance through an experiment performed on the Internet.
Image description with features that summarize
Authors: J. J. Corso, G. D. Hager
Venue: Computer Vision and Image Understanding (2009)

We present a new method for describing images for the purposes of matching and registration. We take the point of view that large, coherent regions in the image provide a concise and stable basis for image description. We develop a new algorithm for feature detection that operates on several projections (feature spaces) of the image using kernel-based optimization techniques to locate local extrema of a continuous scale-space of image regions. Descriptors of these image regions and their relative geometry then form the basis of an image description. The emphasis of the work is on features that summarize image content and are highly robust to viewpoint changes and occlusion yet remain discriminative for matching and registration. We present experimental results of these methods applied to the problem of image retrieval. We find that our method performs comparably to two published techniques: Blobworld and SIFT features. However, compared to these techniques two significant advantages of our method are its (1) stability under large changes in the images and (2) its representational efficiency.
Using programming to help students understand the value of diversity
Authors: Michael R. Wick
Venue: Proceedings of the 40th ACM technical symposium on Computer science education (2009)

This paper describes an entry-level programming assignment that can be used to help students learn the value of diversity through computer programming. The assignment was given as part of a preliminary experiment to establish the impact of a student programming assignment on student attitudes toward cultural diversity. The results provide suggestive evidence that students learn to value diversity via the given programming assignment.
An Architecture Framework for Process-PersonalizedComposite Services: Service-oriented Architecture, Web Services, Business-Process Engineering, and Human InteractionManagement
Authors: Rajani Shankar Sadasivam
Venue:  (2008)

The integration of large systems remains problematicin spite of advances in composite servicesapproaches. Current composite services approaches caneffectively address only the integration ofmechanistic processes. Processes with humaninteraction, abundant in large systems, areintegrated in an ad hoc manner. As a result, aprocess gap occurs between user needs and implementedsystems. The lack of support for human interactionwith processes in large systems is referred to as thecomposite process-personalization (CPP) challenge. Anarchitecture framework is presented that cansystematically address the lack of CPP in currentcomposite services approach. The framework isvalidated with two case studies, one in thebiomedical informatics domain.
3D configuration caching for 2D FPGAs
Authors: Alessandro Cevrero, Panagiotis Athanasopoulos, Hadi Parandeh-Afshar, Philip Brisk, Yusuf Lebebici, Paolo Ienne, Maurizio Skerlj
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

This poster proposes the use of 3D integration technology to enable low-overhead reconfigurable computing. In our scheme, a 64 Megabyte DRAM array is stacked on top of an FPGA using face-to-face bonding, and caches up to 289 future configurations which can be quickly loaded onto the FPGA. Past DRAMs have been designed for off-chip communication, a bottleneck that 3D stacking eliminates; hence, the DRAM array is redesigned. To reconfigure the FPGA, a configuration is read from the DRAM into a latch array while the FPGA executes; then, the configuration is loaded from the latch array into the FPGA in 5 cycles (60ns). The minimum latency between reconfigurations, 8.42s, is dominated by the time to load data from the DRAM into the latch array. The benefits, area cost, and performance of the proposed system are evaluated on three previously published FPGA implementations of multimedia applications: MP3 and MPEG-4 decoders, and JPEG compression, and are evaluated under three scenarios: No Dynamic ReConfiguration (NDRC), Off-chip Dynamic ReConfiguration (ORDC), and 3D Configuration Caching (3DCC). Our experiments demonstrate that 3D configuration caching works best when used in conjunction with FPGA-based accelerators, rather than pure FPGA-based systems; in these systems, the reconfiguration latency can easily be hidden behind software execution on the processor controlling the accelerator. This significantly reduces the amount of silicon area that must be dedicated to the accelerator, while imposing virtually no performance penalty compared to significantly larger accelerators that do not require reconfiguration.
Interactive graphics
Authors: Donald C. Lincicome
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

The two computer graphic sessions are to a high degree End User oriented. The kinds of people who will find the "Data Base" session of interest are Application Analysts and End Users who with an Applications Analyst's interest is seeking new methods of data representation of physical models where the volume of data can grow quite large while access must remain rapid even though the access trail cannot be predicted or predetermined. The kinds of people interested in the "Economics of C.G." session are End Users and managers who must understand the areas of costs and productivity improvement measures that result from Operational Computer Graphics, and who want to learn from other Users experiences methods of economic justification and measures to ensure economic success of the necessary capital investment. 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
A Deep Monotone Approximation Operator Based on the Best Quadratic Lower Bound of Convex Functions
Authors: Masao Yamagishi, Isao Yamada
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This paper presents a closed form solution to a problem of constructing the best lower bound of a convex function under certain conditions. The function is assumed (I) bounded below by -ρ, and (II) differentiable and its derivative is Lipschitz continuous with Lipschitz constant L. To construct the lower bound, it is also assumed that we can use the values ρ and L together with the values of the function and its derivative at one specified point. By using the proposed lower bound, we derive a computationally efficient deep monotone approximation operator to the level set of the function. This operator realizes better approximation than subgradient projection which has been utilized, as a monotone to level sets of differentiable convex functions as well as nonsmooth convex functions. Therefore, by using the proposed operator, we can improve many signal processing algorithms essentially based on the subgradient projection.
Verifying the design of a cellular manufacturing system
Authors: Benny Tjahjono, Rossella Stama
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

This paper reports a simulation study to evaluate the design of a cellular layout for the production of low volume, high variety of products. The study aims to better understand the production capacity and the potential problems that may arise in the future when more products variety are introduced at smaller quantities. The model was built using a commercial tool but the simulation parameters are stored in a spreadsheet allowing much simpler coding of the routing logic and the data input. The experiments were carried out to reduce bottleneck and to investigate the effect of different batch sizes, machine breakdown and scrap, to the performance of the cellular layout.
Acoustic OFDM System and Performance Analysis
Authors: Hosei Matsuoka, Yusuke Nakashima, Takeshi Yoshimura
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This paper presents a technology for short-range communications using sound wave, in which the modulated data signal can be transmitted in parallel with regular audio without significantly degrading the quality of the sound. The technology, which we call Acoustic OFDM, replaces the high frequency band of the audio signal with OFDM carriers, each of which is power-controlled according to the spectrum envelope of the original audio signal. It can provide data transmission of several hundreds bps. The implemented Acoustic OFDM system enables the transmission of short text messages from loud speakers to mobile devices at a distance of around 3 m.
Application of simulation modeling for air force enterprise IT transformation initiatives
Authors: Lisa M. Fitzgerald, Tiffany J. Harper
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Simulation modeling can be a key enabler and method for mitigating risk within the Department of Defense's Enterprise Transformation, especially in the area of the IT systems that enable transformation. This paper provides a brief overview of the Air Force's approach to enterprise architecture development and demonstrates how modeling and simulation (M&S) can be used to optimize Enterprise IT architecture design to meet the needs of operational end users.
Artificial agency, consciousness, and the criteria for moral agency: what properties must an artificial agent have to be a moral agent?
Authors: Kenneth Einar Himma
Venue: Ethics and Information Technology (2009)

In this essay, I describe and explain the standard accounts of agency, natural agency, artificial agency, and moral agency, as well as articulate what are widely taken to be the criteria for moral agency, supporting the contention that this is the standard account with citations from such widely used and respected professional resources as the Stanford Encyclopedia of Philosophy, Routledge Encyclopedia of Philosophy, and the Internet Encyclopedia of Philosophy. I then flesh out the implications of some of these well-settled theories with respect to the prerequisites that an ICT must satisfy in order to count as a moral agent accountable for its behavior. I argue that each of the various elements of the necessary conditions for moral agency presupposes consciousness, i.e., the capacity for inner subjective experience like that of pain or, as Nagel puts it, the possession of an internal something-of-which-it is-is-to-be-like. I ultimately conclude that the issue of whether artificial moral agency is possible depends on the issue of whether it is possible for ICTs to be conscious.
New trends in efficient production and distribution of electrical energy
Authors: Mihai Octavian Popescu, Claudia Laurenta Popescu
Venue: Proceedings of the 7th conference on Data networks, communications, computers (2008)

Electrical energy is absolutely necessary for an advanced society. In this context use of classical combustibles (coal, petroleum, nuclear) is limited, e.g. by sources exhaustion. Some other undesired phenomena are commented and the solution - use of renewable energies is discussed. At the European level strategic objectives are presented for each case, even the cost target for 2015. In the same time distribution of electrical energy is subject to modernization with intensive promotion of information technologies. Some new ideas are presented, related with numerical treatment of information in new systems with multiple and distributed sources.
MarcoPolo: a community system for sharing and integrating travel information on maps
Authors: Yueguo Chen, Su Chen, Yu Gu, Mei Hui, Feng Li, Chen Liu, Liangxu Liu, Beng Chin Ooi, Xiaoyan Yang, Dongxiang Zhang, Yuan Zhou
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

The tagging technique has been widely applied in existing Web 2.0 systems, where users label resources with tags for effective classification and efficient retrieval of resources. Location-aware geographical tags (geo-tags) are required if users want to mark location-sensitive resources to digital maps. Large volumes of different kinds of user-created tags pose challenges to the effective organization of community resources using tags. Issues such as guaranteeing the quality of tags and supporting various tag-based queries emerge. In this demo, we present MarcoPolo, a Web 2.0 community system that allows users to define the hierarchical textual geo-tags and mark resources to a map using geo-tags. Statistical and feedback mechanisms are applied to guarantee the quality of tags (including geo-tags). The MarcoPolo system provides two effective interfaces for users to browse and search resources: one is the keyword-based interface and the other is the map-based interface.
Competitive Hopfield Neural Network with Periodic Stochastic Dynamics for Partitional Clustering
Authors: Zhanghui Kuang, Wei Bi, Jiahai Wang
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

A novel competitive Hopfield network with periodic stochastic dynamics is proposed for the NP-hard partitional clustering problem in this paper. Clustering technique has been applied to a wide range of problems, such as pattern recognition and machine learning. The aim of partitional clustering is to obtain a specified number of data sets from the original data according to certain criteria. The proposed algorithm introduces periodic stochastic dynamics, which helps the neural network escape from local minima and search a possible better solution based on the solution which is obtained in the latest period. The performance is evaluated through several benchmark data sets. The simulation results show that the proposed algorithm outperforms previous approaches, such as k -means, genetic algorithm, particle swarm optimization, differential evolution, combinatorial particle swarm optimization and tabu search.