ppxscal/embedding_network huggingface dataset:
Visual inference of human emotion and behaviour
Authors: Shaogang Gong, Caifeng Shan, Tao Xiang
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

We address the problem of automatic interpretation ofnon-exaggerated human facial and body behaviours captured in video. We illustrate our approach by three examples. (1) We introduce Canonical Correlation Analysis (CCA) and Matrix Canonical Correlation Analysis (MCCA) for capturing and analyzing spatial correlations among non-adjacent facial parts for facial behaviour analysis. (2) We extend Canonical Correlation Analysis to multimodality correlation for bebaviour inference using both facial and body gestures. (3) We model temporal correlation among human movement patterns in a wider space using a mixture of Multi-Observation Hidden Markov Model for human behaviour profiling and behavioural anomaly detection.
Optimal Piecewise Polynomial L2Approximation of Functions of One and Two Variables
Authors: T. Pavlidis
Venue: IEEE Transactions on Computers (1975)

The problem of piecewise polynomial L2 approximation with variable boundaries is considered. Necdssary and sufficient conditions for local optima are derived. These suggest simple functional iteration, algorithms for locating the boundaries.
Are your citations clean?
Authors: Dongwon Lee, Jaewoo Kang, Prasenjit Mitra, C. Lee Giles, Byung-Won On
Venue: Communications of the ACM (2007)

If they are, only one can refer to a distinct document; if not, many can refer to the same document.
Automatic user preference learning for personalized electronic program guide applications
Authors: Jeongyeon Lim, Sanggil Kang, Munchurl Kim
Venue: Journal of the American Society for Information Science and Technology (2007)

In this article, we introduce a user preference model contained in the User Interaction Tools Clause of the MPEG-7 Multimedia Description Schemes, which is described by a UserPreferences description scheme (DS) and a UsageHistory description scheme (DS). Then we propose a user preference learning algorithm by using a Bayesian network to which weighted usage history data on multimedia consumption is taken as input. Our user preference learning algorithm adopts a dynamic learning method for learning real-time changes in a user's preferences from content consumption history data by weighting these choices in time. Finally, we address a user preference-based television program recommendation system on the basis of the user preference learning algorithm and show experimental results for a large set of realistic usage-history data of watched television programs. The experimental results suggest that our automatic user reference learning method is well suited for a personalized electronic program guide (EPG) application.
A Class of Covering-Based Fuzzy Rough Sets
Authors: William Zhu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Rough set theory and fuzzy set theory are two powerful tools to deal with uncertainty and incompleteness of knowl- edge in information systems. This paper explores a type of covering-based fuzzy rough set theory based on coverings that combine the above two theories. We present basic con- cepts and properties of this kind of fuzzy rough sets.
Studies on the degradation properties of the ZnO-based ceramic film varistors
Authors: S. L. Jiang, T. T. Xie, H. Yu, Y. Q. Huang, H. B. Zhang
Venue: Microelectronic Engineering (2008)

The accelerating-degraded method with ac and dc fields was used to study the degradation properties of the ZnO-based ceramic film varistors. When acted on the dc bias, the J-V curve of the ZnO-based ceramic film varistors shows distinct dissymmetry, and the nonlinearity characteristics of the reverse side of the grain boundaries go severely bad after the degradation .When subjected to the ac bias, however, the J-V curve shows symmetrical metamorphosis and the changes of the nonlinearity characteristics of both sides of the grain boundaries are identical on the whole. The ZnO-based ceramic film varistors possess the properties of higher leakage current density, lower nonlinear voltage and smaller nonlinearity coefficient after the change of the grain boundaries took place caused by the ac or dc bias. It is proposed that the degradation of the ZnO-based film varistors is influenced by both the diffusion of interstitial zinc ion in the depletion layer and the oxygen desorption in the grain boundaries.
Enabling high-throughput data management for systems biology
Authors: Anuj R. Shah, Mudita Singhal, Kyle R. Klicker, Eric G. Stephan, H. Steven Wiley, Katrina M. Waters
Venue: Bioinformatics (2007)

Summary: The Bioinformatics Resource Manager (BRM) is a software environment that provides the user with data management, retrieval and integration capabilities. Designed in collaboration with biologists, BRM simplifies mundane analysis tasks of merging microarray and proteomic data across platforms, facilitates integration of users’ data with functional annotation and interaction data from public sources and provides connectivity to visual analytic tools through reformatting of the data for easy import or dynamic launching capability. BRM is developed using Java™ and other open-source technologies for free distribution. Availability: BRM, sample data sets and a user manual can be downloaded from http://www.sysbio.org/dataresources/brm.stm Contact:anuj.shah@pnl.gov, brm@pnl.gov
High-speed packet classification using binary search on length
Authors: Hyesook Lim, Ju Hyoung Mun
Venue: Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems (2007)

Packet classification is one of the major challenges for next generation routers since it involves complicated multi-dimensional search as well as it should be performed in wire-speed for all incoming packets. Area-based quad-trie is an excellent algorithm in the sense that it constructs a two-dimensional trie using source and destination prefix fields for packet classification. However, it does not achieve good search performance since search is linearly performed for prefix length. In this paper, we propose a new packet classification algorithm which applies binary search on prefix length to the area-based quad-trie. In order to avoid the pre-computation required in the binary search on length, the proposed algorithm constructs multiple disjoint tries depending on relative levels in rule hierarchy. We also propose two new optimization techniques considering rule priorities. For different types of rule sets having about 5000 rules, performance evaluation result shows that the average number of memory accesses is 18 to 67 and the memory consumption is 22 to 41 bytes per rule.
Genetic Algorithm with Local Search for Advanced Planning and Scheduling
Authors: Pu Yan, Dayou Liu, Donghui Yuan, Ji Yu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

In this paper, a genetic algorithm approach with a novel mutation operator based on perturbation and local search has been proposed to solve an advanced planning and scheduling (APS) model in manufacturing supply chain, in which each customer order has a due date, each operation could be performed on alternative machines. The objective is to minimize the makespan of each customer order while ensuring the due date constraints. Various sizes of numerical experiments were carried out to demonstrate the efficiency of the proposed GA and the results indicate that the presented algorithmperforms much better than previous work especially in large size problems.
Perfect Concurrent Signature Protocol
Authors: Zhenjie Huang, Rufen Huang, Xuanzhi Lin
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

The concept of concurrent signatures was introduced by Chen, Kudla and Paterson in their seminal paper in Eurocrypt 2004 which allows two entities to produce two signatures in such a way that, the signer of each signature is ambiguous from any third party's point of view until the release of a secret, known as the keystone. Once the keystone is released, both signatures become binding to their respective signers concurrently. Later, a stronger notion called perfect concurrent signatures with two concrete schemes was proposed by Susilo, Mu and Zhang. In perfect concurrent signatures, although both signers are known to be trustworthy, the two signatures are still ambiguous to any third party. Unfortunately, Susilo et al.'s schemes are unfair. In this paper, we first show that in their schemes the initial signer can cheat the matching signer by carefully choosing some communication value and then propose fair perfect concurrent signature protocol to fix our attacks.
A Task Scheduling Algorithm of Single Processor Parallel Test System
Authors: Jiajing Zhuo, Chen Meng, Minghu Zou
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

The purpose of this paper is to implement parallel test in the single processor auto test system and to improve the test efficiency with a lower test cost. The main factor that impacts the test efficiency of test system is the performance of the parallel task scheduling algorithm. This paper puts forward a heuristic parallel task scheduling algorithm: Scheduling-Q which can meet the characteristics of the auto test system. Every test tasks uses some resources to put test the units under test. So, we can use the multi-threading technique to implement single processor parallel test. In test system some test tasks can be executed with different resource allocations. The task scheduling algorithm: Scheduling-Q adapts well to this characteristic. It schedules the test tasks according to the task's earliest starting time and the test generalized resource loading. The generalized resource loading is embodied as task resources set loading based on resources allocation mode and task resources set loading based on task's starting time. The test resources with bigger loading have more opportunities to obtain task and are always in a busy state. Thus resources loadings can be balanced to a degree. So the parallel performance of test system can be improved with the algorithm. In addition, the algorithm adopts the strategy of heuristic local optimum search. The time complexity of the algorithm is decreased obviously.
A fuzzy linear programming approach to the load shedding and generation reallocation problem
Authors: R. Hooshmand, V. Tahani, H. Seifi
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1998)

In this article, an effective method to control a power system during emergency conditions is presented. Based on Fuzzy Linear Programming (FLP), a new technique is developed to solve the Load Shedding and Generation Reallocation (LSGR) optimization problem. The objective function consists of terms of load curtailments and deviations in generation schedules. The constraints are power system variables limitations. The objective function and constraints coefficients are uncertain, which are represented by fuzzy numbers. Thus a fuzzy environment is prepared and a FLP approach is developed to solve more realistically and successfully the LSGR optimization problem. The method is successfully applied on a test system, where the load curtailments and deviations from the nominal states are to be minimized. The results of various cases of fuzzy and crisp modes of the problem are demonstrated.
Passivity Analysis of Uncertain Discrete-Time Fuzzy Systems with Delays
Authors: Xingwen Liu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

This paper addresses the passivity problem of uncertain discrete-time fuzzy systems with time delays. Based on Lya- punov method, passivity conditions are proposed which are expressed in terms of linear matrix inequalities and can be verified easily and conveniently. A numerical example is provided to show the effectiveness of our theoretical results.
A Redundancy-Based Measure of Dissimilarity among Probability Distributions for Hierarchical Clustering Criteria
Authors: Kazunori Iwata, Akira Hayashi
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2008)

We introduce novel dissimilarity into a probabilistic clustering task to properly measure dissimilarity among multiple clusters when each cluster is characterized by a subpopulation in the mixture model. This measure of dissimilarity is called redundancy-based dissimilarity among probability distributions. From aspects of both source coding and a statistical hypothesis test, we shed light on several of the theoretical reasons for the redundancy-based dissimilarity among probability distributions being a reasonable measure of dissimilarity among clusters. We also elucidate a principle in common for the measures of redundancy-based dissimilarity and Ward’s method in terms of hierarchical clustering criteria. Moreover, we show several related theorems that are significant for clustering tasks. In the experiments, properties of the measure of redundancy-based dissimilarity are examined in comparison with several other measures.
Disambiguating speech commands using physical context
Authors: Katherine M. Everitt, Susumu Harada, Jeff Bilmes, James A. Landay
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

Speech has great potential as an input mechanism for ubiquitous computing. However, the current requirements necessary for accurate speech recognition, such as a quiet environment and a well-positioned and high-quality microphone, are unreasonable to expect in a realistic setting. In a physical environment, there is often contextual information which can be sensed and used to augment the speech signal. We investigated improving speech recognition rates for an electronic personal trainer using knowledge about what equipment was in use as context. We performed an experiment with participants speaking in an instrumented apartment environment and compared the recognition rates of a larger grammar with those of a smaller grammar that is determined by the context.
Peer-to-peer botnets: overview and case study
Authors: Julian B. Grizzard, Vikram Sharma, Chris Nunnery, Brent ByungHoon Kang, David Dagon
Venue: Proceedings of the first conference on First Workshop on Hot Topics in Understanding Botnets (2007)

Botnets have recently been identified as one of the most important threats to the security of the Internet. Traditionally, botnets organize themselves in an hierarchical manner with a central command and control location. This location can be statically defined in the bot, or it can be dynamically defined based on a directory server. Presently, the centralized characteristic of botnets is useful to security professionals because it offers a central point of failure for the botnet. In the near future, we believe attackers will move to more resilient architectures. In particular, one class of botnet structure that has entered initial stages of development is peer-to-peer based architectures. In this paper, we present an overview of peer-to-peer botnets. We also present a case study of a Kademlia-based Trojan.Peacomm bot.
Voice quality measurement in a typical router-based network
Authors: A. Azarfar, A. H. Jahangir
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

In this paper, we introduce novel mechanisms for measuring and evaluating the performance of a network and its devices, configured especially for Voice over IP (VoIP). We study the effects of different configurations on final voice quality by enabling or changing the related equipment features. In our study we quantify quality changes based on different router configurations and discuss precisely to what extent and how much this quality is improved versus features or special configurations of network devices. These results can be used for two purposes: compare and benchmark different routers in order to know which one is proper for a typical VoIP network, and select the best configurations. We demonstrate that the highest final quality of voice is achieved in packet remarking configurations with IP precedence and DSCP.
Automatic Test-Data Generation: An Immunological Approach
Authors: Konstantinos Liaskos, Marc Roper
Venue: Proceedings of the Testing: Academic and Industrial Conference Practice and Research Techniques - MUTATION (2007)

In previous research, we presented an approach to automatically generate test-data for object-oriented software exploiting a Genetic Algorithm (GA) to achieve high levels of data-flow coverage. The experimental results from testing six Java classes helped us identify a number of problematic test targets, and suggest that in the future full data-flow coverage with a reasonable computational cost may be possible if we overcome these obstacles. To this end, the investigation of Artificial Immune System (AIS) algorithms was chosen. This paper provides a brief summary of our previous work and an introduction to both Human and Artificial Immune System. We then suggest a framework for the application of AIS algorithms to the problem of automated testing, followed by some thoughts on why and how these algorithms can be beneficial in our effort to improve the performance of our previously implemented GA. Finally, our preliminary results from a proof-ofconcept implementation are presented.
Browsing and searching in a faceted information space: A naturalistic study of PubMed users' interaction with a display tool
Authors: Muh-Chyun Tang
Venue: Journal of the American Society for Information Science and Technology (2007)

The study adopts a naturalistic approach to investigate users' interaction with a browsable MeSH (medical subject headings) display designed to facilitate query construction for the PubMed bibliographic database. The purpose of the study is twofold: first, to test the usefulness of a browsable interface utilizing the principle of faceted classification; and second, to investigate users' preferred query submission methods in different problematic situations. An interface that incorporated multiple query submission methods&mdash;the conventional single-line query box as well as methods associated the faceted classification display was constructed. Participants' interactions with the interface were monitored remotely over a period of 10 weeks; information about their problematic situations and information retrieval behaviors were also collected during this time. The traditional controlled experiment was not adequate in answering the author's research questions; hence, the author provides his rationale for a naturalistic approach. The study's findings show that there is indeed a selective compatibility between query submission methods provided by the MeSH display and users' problematic situations. The query submission methods associated with the display were found to be the preferred search tools when users' information needs were vague and the search topics unfamiliar. The findings support the theoretical proposition that users engaging in an information retrieval process with a variety of problematic situations need different approaches. The author argues that rather than treat the information retrieval system as a general purpose tool, more attention should be given to the interaction between the functionality of the tool and the characteristics of users' problematic situations. &copy; 2007 Wiley Periodicals, Inc.
Framed temporal logic programming
Authors: Zhenhua Duan, Xiaoxiao Yang, Maciej Koutny
Venue: Science of Computer Programming (2008)

A Projection Temporal Logic is discussed and some of its laws are given. After that, an executable temporal logic programming language, called Framed Tempura, is formalized. A minimal model-based approach for framing in temporal logic programming is presented. Since framing destroys monotonicity, canonical models-used to define the semantics of non-framed programs-are no longer appropriate. To deal with this, a minimal model theory is developed, using which the temporal semantics of framed programs is captured. The existence of a minimal model for a given framed program is demonstrated. A synchronous communication mechanism for concurrent programs is provided by means of the framing technique and minimal model semantics.
Evaluating IT Investment Using a Hybrid Approach of Fuzzy Risk Analysis and Real Options
Authors: Tao Chen, Yurong Zeng, Lin Wang, Jinlong Zhang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Real option valuation is a useful alternative approach for evaluating IT investment in uncertain environment. However, utilizing this method in practice would be a challenging task, because it is usually difficult to obtain a precise estimation on several required parameters. This paper develops a new methodology for valuating IT investment based on real options and fuzzy risk analysis. Fuzzy sets theory is able to well formulate the uncertainty of the expected payoffs from an investment, and then help decision makers make better valuation and justification of the target investment without complex mathematical calculation.
The Simplification of Sequential Machines with Input Restrictions
Authors: Joonki Kim
Venue: IEEE Transactions on Computers (1972)

A procedure is presented for simplifying the flow table of a sequential machine M when, in addition to the given flow table, it is specified that certain input sequences cannot occur. It is assumed that M receives its input from the output of another machine M, and that the restricted sequences are therefore those sequences that M, cannot generate.
Memory-Aware and Efficient Ray-Casting Algorithm
Authors: Saulo Ribeiro, Andre Maximo, Cristiana Bentes, Antonio Oliveira, Ricardo Farias
Venue: Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing (2007)

Ray-casting implementations require that the connectivity between the cells of the dataset to be explicitly computed and kept in memory. This constitutes a huge obstacle for obtaining real-time rendering for very large models. In this paper, we address this problem by introducing a new implementation of the ray-casting algorithm for irregular datasets. Our implementation optimizes the memory usage of past implementations by exploring ray coherence. The idea is to keep in main memory the information of the faces traversed by the ray cast through every pixel under the projection of a visible face. Our results show that exploring pixel coherence reduces considerably the memory usage, while keeping the performance of our algorithm competitive with the fastest previous ones.
Microprogramming in the computer science curriculum
Authors: C. W. Hemming
Venue: ACM SIGMICRO Newsletter (1972)

The expansion of computer technology in recent years has presented many new and different concepts which are of utmost importance to the computer scientist. The incorporation of these into a computer science curriculum has, in many cases, caused a proliferation of topics with the inherent confusion of the student. Furthermore, the traditional techniques used to introduce the student to computer science are rapidly becoming obsolete. A detailed study of the architecture of a particular machine and expertise in its instruction set are no longer adequate for appreciation of the diversity of current hardware and software techniques, much less a firm foundation. 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