ppxscal/embedding_network huggingface dataset:
Improved user authentication in off-the-record messaging
Authors: Chris Alexander, Ian Goldberg
Venue: Proceedings of the 2007 ACM workshop on Privacy in electronic society (2007)

Instant Messaging software is now used in homes and businesses by a wide variety of people. Many of these users would benefit from additional privacy, but do not have enough specialized knowledge to use existing privacy-enhancing software. There is a need for privacy software to be easy to understand, with complicated cryptographic concepts hidden from the user. We look at improving the usability of Off-the-Record Messaging, a popular privacy plugin for instant messaging software. By using a solution to the Socialist Millionaires' Problem, we are able to provide the same level of privacy and authentication as in older versions of OTR, but we no longer require that the user understand any difficult concepts such as keys or fingerprints.
CINDI Robot: an Intelligent Web Crawler Based on Multi-level Inspection
Authors: Rui Chen, Bipin C. Desai, Cong Zhou
Venue: Proceedings of the 11th International Database Engineering and Applications Symposium (2007)

With the explosion of the Web, focused web crawlers are gaining attention. Focused web crawlers aim at finding web pages related to the pre-defined topic. CINDI Robot is a focused web crawler devoted to finding computer science and software engineering academic documents. We propose a multi-level inspection scheme to discover relevant web pages. Through this multi-level inspection scheme, the text feature of the content contributes to the classification; furthermore other web characteristics, such as URL pattern, anchor text and so on, assist the decision process. The experiment result demonstrates this multi-level inspection method outperforms other traditional methods.
A Bio-Inspired Content Adaptive Approach for Multiresolution-Based Image Watermarking
Authors: Ehsan Vahedi, Caro Lucas, Reza Aghaeizade Zoroofi, Mohsen Shiva
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

In this paper, the authors propose a new procedure for copyright protection by using a bio-inspired wavelet based data hiding approach. The proposed method takes advantage of Human Visual System (HVS) characteristics to provide better watermarked image quality. It also exploits Visual Secret Sharing (VSS) technique to guarantee the security of the procedure. Performance improvement with respect to the existing algorithms is obtained by Genetic Algorithm (GA) optimization. The experimental results show that the proposed algorithm yields a watermark that is invisible to human eyes and is robust to various intentional and unintentional attacks. The experimental results are also compared with the results of some previous works.
CAI in Japan
Authors: Akira Harashima
Venue: ACM SIGCUE Outlook (1973)

The study of CAI in Japan is still in its infancy. Electronic companies which produce computers have developed various kinds of hardware which enable various kinds of programs for CAI to now be in use in technical training and drill programs. However, criticism of the use of computers in science education still exists, with the effect that continuing hesitation may be noticed on the part of educators to adopt CAI in science education. This hesitation seems to be based upon the feeling of many educators that, since CAI programming has not yet been fully developed, too premature use of computers in science education might cause some undesirable effects on the students. 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 Simulation Method for Computer Control Systems
Authors: J. Kontos, G. Papakonstantinou
Venue: IEEE Transactions on Computers (1971)

A computer control system simulation method utilizing two computers is presented. One is a control computer operating under almost actual conditions. The other is a multiprogrammed computer that simulates the plant. The time taken by the control computer to compute the control variables can be a function of the plant state. An optimum control example illustrating the application of the method is given.
A Mixture model with random-effects components for clustering correlated gene-expression profiles
Authors: S. K. Ng, G. J. McLachlan, K. Wang, L. Ben-Tovim Jones, S.-W. Ng
Venue: Bioinformatics (2006)

Motivation: The clustering of gene profiles across some experimental conditions of interest contributes significantly to the elucidation of unknown gene function, the validation of gene discoveries and the interpretation of biological processes. However, this clustering problem is not straightforward as the profiles of the genes are not all independently distributed and the expression levels may have been obtained from an experimental design involving replicated arrays. Ignoring the dependence between the gene profiles and the structure of the replicated data can result in important sources of variability in the experiments being overlooked in the analysis, with the consequent possibility of misleading inferences being made. We propose a random-effects model that provides a unified approach to the clustering of genes with correlated expression levels measured in a wide variety of experimental situations. Our model is an extension of the normal mixture model to account for the correlations between the gene profiles and to enable covariate information to be incorporated into the clustering process. Hence the model is applicable to longitudinal studies with or without replication, for example, time-course experiments by using time as a covariate, and to cross-sectional experiments by using categorical covariates to represent the different experimental classes. Results: We show that our random-effects model can be fitted by maximum likelihood via the EM algorithm for which the E(expectation)and M(maximization) steps can be implemented in closed form. Hence our model can be fitted deterministically without the need for time-consuming Monte Carlo approximations. The effectiveness of our model-based procedure for the clustering of correlated gene profiles is demonstrated on three real datasets, representing typical microarray experimental designs, covering time-course, repeated-measurement and cross-sectional data. In these examples, relevant clusters of the genes are obtained, which are supported by existing gene-function annotation. A synthetic dataset is considered too. Availability: A Fortran program blue called EMMIX-WIRE (EM-based MIXture analysis WIth Random Effects) is available on request from the corresponding author. Contact: gjm@maths.uq.edu.au Supplementary information:. Colour versions of Figures 1 and 2 are available as Supplementary material on Bioinformatics online.
Testing of Changing Requirement in an Agile Environment - A Case Study of Telecom Project
Authors: Dipak S. Pagrut
Venue: Proceedings of the Testing: Academic and Industrial Conference Practice and Research Techniques - MUTATION (2007)

This paper is focused on before and after changes of agile implementation and describing the successful testing goals of agile implementation in Flow Product Project (Telecom Project). After implementation of agile methodology in Tech Mahindra, team would really gain a drastic change in testing activity, continuous delivery, customer satisfaction and also help to meet challenges of changing requirements and new functionalities.
Validating system properties exhibited in execution traces
Authors: Fangzhe Chang, Jennifer Ren
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Execution traces produced by software systems during their operation can capture important runtime information, and thus are valuable sources for validating software functional properties. Automating the validation of such properties is currently achieved by writing test scripts, where most of the effort focuses on programming operations rather than specifying properties clearly. Improving this practice calls for domain-specific languages that can capture properties exhibited in traces at a higher abstract level. This paper presents a Test Behavior Language (TBL) that uses parameterized patterns as logical predicates to specify and validate trace-based properties abstractly but precisely. TBL has been used to automate the testing of several software systems, including a large telecommunication system. Initial results show that TBL is powerfulfor validating complex properties of these systems in real time, resulting in a big increase in the thoroughness of behavioral analysis and the number of bugs revealed. TBL also reduces the effort of script writing. TBL specifications range from 1/2 to 1/5 the size of their Tcl script counterparts, with a greater benefit realized where thorough trace analysis is needed.
Adaptive and Mobility-predictive Quantization-based Communication Data Management for High Performance Distributed Computing
Authors: In Kee Kim, Sung Ho Jang, Jong Sik Lee
Venue: Simulation (2007)

Communication data management (CDM) is an important issue in high performance distributed computing where a massive amount of data eXchange frequently occurs among geographically distributed components. In this paper, we review eXisting CDM schemes in distributed computing systems and we propose more efficient CDM schemes. Three types of quantization-based CDM schemes are proposed: the fiXed quantization-based CDM (FQ-CDM), the adaptive quantization-based CDM (AQ-CDM), and the mobility-predictive quantization-based CDM (MPQ-CDM). The FQ-CDM applies a basic theory of quantized systems to the distributed computing environment. The AQ-CDM uses a communication object clustering mechanism, which operates a pattern recognition clustering algorithm. The MPQ-CDM predicts the neXt states of communication objects by using past and current data and controls data communication among communication objects. The mobile object location monitoring system (MOLMS), based on High Level Architecture, is designed and developed to apply these CDM schemes to distributed computing. In this paper we conduct eXperiments by comparing these CDM schemes with each other on the MOLMS. The eXperimental results show that the AQ-CDM is the more effective scheme for communication message reduction and the MPQ-CDM is the more suitable scheme for mobile location error reduction.
Logical product models for automated scripting of process-level construction animations
Authors: Vineet R. Kamat
Venue: Advances in Engineering Software (2008)

Animation can add significant value to Discrete-Event Simulation by helping verify, validate, and accredit simulation analyses. This is particularly true in construction where typical decision makers are experts in their domain but are not generally proficient in simulation itself. Existing methods of animating simulated construction processes in 3D have a significant limitation. They require that spatial information about construction workspaces and geometric details of facility components being erected be both captured into simulation models, even though such information is otherwise irrelevant from the process modeling perspective. This cumbersome, time-consuming, and often impossible activity precludes the widespread use of animation in simulation analyses. This research addressed this limitation and studied the applicability of the CIMsteel Integration Standards (CIS/2) in supporting the automated scripting of process-level construction animations. Member geometry, position, and orientation of steel beams and columns were extracted from structural frames described in the CIS/2 format, and were used to automatically generate animation scripting commands. The generated script was input to a kinematically smart crane inside a 3D virtual world to demonstrate the efficacy of logical product models in supporting the automated visualization of simulated construction processes. The designed algorithms and methods were implemented in a software tool called AutoCIS2 that simulation modelers can use to automatically generate animation scripts describing modeled steel erection operations in smooth, continuous, 3D virtual worlds.
Quasi-equilibrium in LQ differential games with bounded uncertain disturbances: robust and adaptive strategies with pre-identification via sliding mode technique
Authors: Manuel Jimenez-Lizarraga, Alex Poznyak
Venue: International Journal of Systems Science (2007)

A finite time multi-persons linear-quadratic differential game with bounded disturbances and uncertainties is considered. When players cannot measure these disturbances, it is demonstrated that the standard feedback Nash strategies bear to a quasi Nash-equilibrium depending on an uncertainty upper bound that confirms the robustness property of such standard strategies. In the case of periodic disturbances, another concept, namely adaptive concept, containing three different versions is suggested. They are sliding modes, second order sliding modes and window integration. All of them realize the identification of unknown periodic disturbances during an "identification period" when all participants apply the standard feedback Nash strategies with the, so-called, "shifting signal" generated only by a known external exciting signal. After that period the complete standard strategies with "pre-identification" including the recalculated shifting signal are activated. A numerical example dealing with a two participants game shows that the cost functional for each player achieves better values when the adaptive approach is applied.
Victim alignment in crosstalk aware timing analysis
Authors: Ravikishore Gandikota, Kaviraj Chopra, David Blaauw, Dennis Sylvester, Murat Becer, Joao Geada
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Modeling the effect of coupling noise on circuit delay is a key issue in static timing analysis (STA) and involves the "victim-aggressor alignment" problem. As delay-noise depends strongly on the skew between the victim-aggressor input transitions', it is not possible to apriori identify the victim input transition that results in the latest arrival time at the victim. Several approaches that heuristically search for the worst-case victim-aggressor alignment have been proposed in literature. In this paper we present an analytical result that obviates the need to search for the worst-case victim input transition, thereby simplifying the victim-aggressor alignment problem significantly. Using the properties of standard nonlinear CMOS drivers, we show that regardless of the switching of the aggressors, the worst-case victim input transition is the one that switches at the latest point in its timing window. Although this result has been empirically observed in the industry, to the best of our knowledge, this is the first work that provides a rigorous analysis and shows that the result holds for both linear and non-linear drivers. We also show that limiting the alignment of the victim to only the latest victim input transition can significantly reduce the runtime of existing heuristic techniques with no loss of accuracy.
A sequential niche technique for multimodal function optimization
Authors: David Beasley, David R. Bull, Ralph R. Martin
Venue: Evolutionary Computation (1993)

A technique is described that allows unimodal function optimization methods to be extended to locate all optima of multimodal problems efficiently. We describe an algorithm based on a traditional genetic algorithm (GA). This technique involves iterating the GA but uses knowledge gained during one iteration to avoid re-searching, on subsequent iterations, regions of problem space where solutions have already been found. This gain is achieved by applying a fitness derating function to the raw fitness function, so that fitness values are depressed in the regions of the problem space where solutions have already been found. Consequently, the likelihood of discovering a new solution on each iteration is dramatically increased. The technique may be used with various styles of GAs or with other optimization methods, such as simulated annealing. The effectiveness of the algorithm is demonstrated on a number of multimodal test functions. The technique is at least as fast as fitness sharing methods. It provides an acceleration of between 1 and l0p on a problem with p optima, depending on the value of p and the convergence time complexity.
Analysis on Image Symmetry Detection Algorithms
Authors: Zhitao Xiao, Jun Wu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Symmetry exists widely in the real world and plays a remarkable role in perception problems. Fast and effective symmetry detection is still a difficult problem in computer vision. Typical image symmetry detectors are analyzed. From the viewpoint of information used, the literatures on image symmetry detection are analyzed systematically. And symmetry detectors can be categorized to two kinds, that is, gradient-based ones and phase-based ones. Characteristics of each kind are discussed. The key issues of the important symmetry detectors are explained extensively and comprehensively. Based on the survey, some open issues, which needed to be researched further, are presented, and the future research trends are also given.
Understanding Malaysian students as gamers: experience
Authors: Rubijesmin Abdul Latif
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

Computer games are very popular among children, teenager as well as adults. For that matter, computer games should be exploited as medium of teaching and learning. We intended to investigate the possibilities of exploring the idea of adapting computer games for Science learning in class. However, we first need to understand the background and experiences among the users in order to study how computer games might benefit them in learning. 341 students from Selangor Darul Ehsan, Malaysia were involved in this study. The result shows that majority of these students are familiar with playing computer games, gender differences between reasons, preferences and needs for playing computer games. More importantly, one of the finding is playing computer games at school encourages social skills among Malaysian students.
Packet Reversed Packet Combining Scheme
Authors: Chandan Tilak Bhunia
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

defined simple error correction scheme with erroneous copies at the receiver. It offers higher throughput combined with ARQ protocols in networks than that of basic ARQ protocols. But packet combining scheme fails to correct errors when occur in the same bit locations of two erroneous copies. In the present work, we propose a scheme that will correct error if occurs at the same bit location of the erroneous copies. The proposed scheme when combined with ARQ protocol will offer higher throughput. Indexed terms: Packet Combining, Multiple Packet Combining, Packet Reversed Packet Combining, Bit Error Correction, Same location
Easily Testable Cellular Realizations for the (Exactly P)-out-of n and (p or More)-out-of n Logic Functions
Authors: S. M. Reddy
Venue: IEEE Transactions on Computers (1974)

Networks to realize all n-variable symmetric threshold functions and elementary symmetric functions are given. It is also shown that only 2n test inputs are necessary and sufficient to test any number of faults in these networks.
Model management and schema mappings: theory and practice
Authors: Philip A. Bernstein, Howard Ho
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

We present an overview of a tutorial on model management---an approach to solving data integration problems, such as data warehousing, e-commerce, object-to-relational mapping, schema evolution and enterprise information integration. Model management defines a small set of operations for manipulating schemas and mappings, such as Match, Compose, Inverse, and Merge. The long-term goal is to build generic implementations of the operations that can be applied to a wide variety of data integration problems.
On the Design of Universal Boolean Functions
Authors: F. P. Preparata
Venue: IEEE Transactions on Computers (1971)

A Boolean function U( z1,...,zm) is universal for given n=1 and a set I of variables if it realizes all Boolean functions f(x1,..., xn) by substituting for each zj a variable of I. Designs of universal Boolean functions for various specifications of I are considered for the practical cases of n
Top 5 Issues in Practical Testing of High-Speed Interface Devices
Authors: Takahiro J. Yamaguchi
Venue: Proceedings of the 16th Asian Test Symposium (2007)

Problem Statement. Everyone will agree that a key issue in manufacturing high-speed interface devices is testing for jitter performance. To characterize jitter performance, do you measure timing jitter or period jitter of the device? Should the Bit Error Rate performance of the device also be tested? Is there any way to shorten the overall test time so that device testing can be done in an HV production testing environment? Furthermore, is it appropriate to reduce the test equipment cost by adding test resources onchip?
Empirical research methods for software engineering
Authors: Steve Easterbrook
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

This full day tutorial introduces the use of empirical methods appropriate to research in automated software engineering. Using a blend of lecture and discussion, it aims to provide ASE researchers and practitioners with a foundation for conducting and critiquing empirical studies. The tutorial covers of the principal methods applicable to ASE: controlled experiments, quasi-experiments, case studies, survey research, ethnographies, and action research and relates these methods to relevant metatheories in the philosophy and sociology of science. The tutorial presents techniques applicable to each of the steps of a research project, including formulating research questions, theory building, data analysis (using both qualitative and quantitative methods), building evidence, assessing validity, and publishing. The tutorial is relevant for researchers, who will be able to conduct and write more credible empirical studies; for reviewers who will be able to provide qualified judgments of papers; and for practitioners, who will be able to more effectively interpret published results within the context of their own organizations
On the robustness of stability of fuzzy control systems
Authors: C. W. Tao, J. S. Taur
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2000)

In this paper, the robustness of stability of fuzzy control systems is discussed. Sufficient conditions for fuzzy control systems to be stable in the sense of bounded-input bounded-output stability are provided based on the concepts of the Lyapunov direct method. The robustness of stability to parameter variations of the fuzzy control systems is studied. And finally simulation examples are included to support the presented propositions.
Software Process Improvement: The Competisoft Project
Authors: Hanna Oktaba, Félix García, Mario Piattini, Francisco Ruiz, Francisco J. Pino, Claudia Alquicira
Venue: Computer (2007)

Competisoft provides the Latin American software industry with a reference framework for improvement and certification of its software processes. The project is based on proven solutions, including the MoProSoft model that four Mexican software companies applied to increase their processes' capacity level. This article includes an authored sidebar "Standards Application in Very Small Enterprises," by Claude Y. Laporte, École de Technologie Supérieure.