ppxscal/embedding_network huggingface dataset:
Knowledge Representation Environments: An Investigation of the CASSMs between Creators, Composers and Consumers
Authors: Ann Blandford, Thomas R. Green, Iain Connell, Tony Rose
Venue: Engineering Interactive Systems: EIS 2007 Joint Working Conferences, EHCI 2007, DSV-IS 2007, HCSE 2007, Salamanca, Spain, March 22-24, 2007. Selected Papers (2008)

Many systems form `chains' whereby developers use one system (or `tool') to create another system, for use by other people. For example, a web development tool is created by one development team then used by others to compose web pages for use by yet other people. Little work within Human-Computer Interaction (HCI) has considered how usability considerations propagate through such chains. In this paper, we discuss three-link chains involving people that we term Creators (commonly referred to as designers), Composers (users of the tool who compose artefacts for other users) and Consumers (end users of artefacts). We focus on usability considerations and how Creators can develop systems that are both usable themselves and also support Composers in producing further systems that Consumers can work with easily. We show how CASSM, an analytic evaluation method that focuses attention on conceptual structures for interactive systems, supports reasoning about the propagation of concepts through Creator-Composer-Consumer chains. We use as our example a knowledge representation system called Tallis, which includes specific implementations of these different perspectives. Tallis is promoting a development culture within which individuals are empowered to take on different roles in order to strengthen the `chain of comprehension' between different user types.
Robustness-set in watermarking embedding systems using codebook classifications
Authors: Wen-Ya Chiang, Shiuh-Jeng Wang, Chi-Yao Weng, Cheng-Hsing Yang
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

In this paper we propose a new watermark technique which combines bit rotation, codebook and coordinate plane division for gray-level image. We embedded binary watermark into the gray-level image successfully by selecting and rotating the pixel bits, classifying codebook and dividing the coordinate plane. Besides that to achieve more robustness, parameter setting is more important. Our scheme is flexible since the user can choose the properties of the stego image, in terms of watermarking size, randomized bit embedding and robustness to avoid frequent image multimedia attacks in computer systems. From the experimental results, it can be visualized that our scheme can extract the identifiable watermark even after image processing attacks such as cropping and JPEG compression. Proposed scheme is better than the recent study of Wu and Chang scheme in terms of robustness.
Efficient and accurate eye diagram prediction for high speed signaling
Authors: Rui Shi, Wenjian Yu, Yi Zhu, Chung-Kuan Cheng, Ernest S. Kuh
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

This paper introduces an accumulative prediction method to predict the eye diagram for high speed signaling systems. We use the step responses of pull-up and pull-down to extract the worst-case eye diagram, including the eye height and jitter. Furthermore, the method produces the input patterns of the worst-case intersymbol interference. The algorithm handles signals of either symmetric or asymmetric rise/fall time. Experimental results demonstrate the accuracy and efficiency of the proposed method.
Internet Governance: The New Frontier of Global Institutions (Routledge Global Institutions), 1 edition
Authors: John Mathiason
Venue:  (2008)

The expansion of the Internet has been called the most revolutionary development in the history of human communications. It is ubiquitous and is changing politics, economics and social relations. Its borderless nature affects the roles of individuals, the magic of the marketplace and the problems of government regulation. As its development has increased apace, contradictions have arisen between existing regulatory regimes, private interests, government concerns, international norms and national interests.Unlike most areas where there are global institutions, and the role of governments is predominant, the Internet is a field where the private sector and civil society each have a role as important - or sometimes more important - than governments. The borderless nature of the Internet (recognized by most analysts) produces particular needs for global institutions and has opened the door for innovative approaches. John Mathiason tells the story of this new frontier, where the linkage between technology, information, individuals, old regulatory regimes and new approaches have led to a great experiment, what a volume produced by the United Nations Information and Communications Technology Task Force called "A Grand Collaboration".
Automatic Trap Detection: A Debugging Mechanism for Abnormal Specification in the IMS Sequencing Controls
Authors: Freya H. Lin, Timothy K. Shih
Venue: IEEE Transactions on Learning Technologies (2008)

Adaptive learning is a challenge trend to distance education. In order to adapt diversified teaching in accordance with individual abilities, educators emphasize on constructing personalized courseware as an Internet-based application. To cope with the drawback of non-supervised blind spot on dynamic navigation of learners, the SCORM 2004 specification adds the concept of sequences into its content delivery. Sequencing rules describe how individual navigation is invoked, what learning objects are delivered during the navigation process, and the potential outputs of the process. However, there is a potential leak of using sequence specification. A sequencing trap results from improper sequence composition, which may block learning activities from a normal navigation. Although the problem can be manually checked with an ordinary SCORM presentation tool, non-systematic debugging can be an unsound solution and time consuming job, since complexity of courseware is usually proportional to the occurrences of traps. We point out the sequencing trap problem and its solution by using a fully automatic mechanism for trap detection. Petri net is used in the computation of sequencing traps. Contribution of this paper can be used as the first technique for automatic sequencing testing in the IMS Simple Sequence Specification and the SCORM 2004.
A lightweight key renewal scheme for clustered sensor networks
Authors: Gicheol Wang, Deokjai Choi, Daewook Kang
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

In sensor networks, sensors are prone to be captured by attackers because they are usually deployed in unattended surroundings. If an adversarial compromises a sensor, he/she uses the keys from the compromised sensor to uncover the keys of others sensors. Therefore, it is very important to renew the keys of sensors in a periodic or reactive manner. Even though many group key renewal schemes for distributed key renewals have been proposed, they expose some flaws. First, they employ a single group key in a cluster so that the compromise of one sensor discloses the group key. Second, they evict the compromised nodes by updating the compromised keys with non-compromised keys. This eviction scheme is useless when the non-compromised keys are exhausted due to the increase of compromised nodes. In this paper, we propose a lightweight key renewal scheme, which evicts the compromised nodes clearly by reforming clusters without compromised nodes. Besides, in a cluster, each member employs a pairwise key for communication with its CH (Cluster Head) so that our scheme is tolerable against sensor compromise. Our simulation results prove that the proposed scheme is more tolerable against the compromise of sensors and it is more energy-saving than the group key renewal schemes.
Mahalanobis Taguchi System based criteria selection for shrimp aquaculture development
Authors: P. Mahalakshmi, K. Ganesan
Venue: Computers and Electronics in Agriculture (2009)

Aquaculture development suitable location is not formulated from one criterion but from multiple criteria. A list of criteria was selected by reviewing the literature and consultation with aquaculture experts and then classified into five categories namely; water, soil, support, infrastructure and risk factor. Using these criteria a Mahalanobis Taguchi System (MTS) based tool was developed to facilitate the selection of prime set of criteria, which is a subset of the original criteria for suitable aquaculture site identification. Mahalanobis Distance (MD) was used for constructing a measurement scale for the aquaculture system. The principles of Taguchi method was used for screening the important criteria in the system. The information required to make an assessment was entered into the computer program. The computer program then processes the information and produces the prime set of criteria for each category. The software program is a valuable tool for the identification of prime set of criteria within each category. One can use these prime set of criteria within each category instead of all criteria for the identification of optimal location in shrimp aquaculture.
Low-Complexity Watermarking Based on Entropy Coding in H.264/AVC
Authors: Young-Ho Seo, Hyun-Jun Choi, Chang-Yeul Lee, Dong-Wook Kim
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This paper is to propose a digital watermarking to protect the ownership of a video content which is compressed by H.264/AVC main profile. This scheme intends to be performed during the CABAC (Context-based Adaptive Binary Arithmetic Coding) process which is the entropy coding of the main profile. It uses the contexts extracted during the context modeling process of CABAC to position the watermark bits by simply checking the context values and determining the coefficients. The watermarking process is also as simple as replacing the watermark bit with the LSB (Least Significant Bit) of the corresponding coefficient to be watermarked. Experimental results from applying this scheme and attacking in various ways such as blurring, sharpening, cropping, Gaussian noise addition, and geometrical modification showed that the watermark embedded by this scheme has very high imperceptibility and robustness to the attacks. Thus, we expect it to be used as a good watermarking scheme, especially in the area that the watermarking should be performed during the compression process with requiring minimal amount of process for watermarking.
Solving House Allocation Problems with Risk-Averse Agents
Authors: Tommy Andersson, Christer Andersson
Venue: Computational Economics (2009)

This paper solves the fair and optimal house allocation problem (Sun and Yang, Econ Lett 81:73---79, 2003) when the agents preferences are represented by nonlinear utility functions using techniques for global mixed integer nonlinear optimization. A small simulation study indicates that if quasi-linear specifications are adopted as approximations to nonlinear utility functions and if the fair and optimal allocation is identified based on this approximation, then the prices are typically higher on average and the resulting allocation is typically non-fair.
A Bayesian approach to information fusion for evaluating the measurement uncertainty
Authors: Klaus-Dieter Sommer, Olaf Kühn, Fernando Puente León, Bernd R. L. Siebert
Venue: Robotics and Autonomous Systems (2009)

The Bayesian approach to uncertainty evaluation is a classical example of the fusion of information from different sources. Basically, it is founded on both the knowledge about the measurement process and the influencing quantities and parameters. The knowledge about the measurement process is primarily represented by the so-called model equation, which forms the basic relationship for the fusion of all involved quantities. The knowledge about the influencing quantities and parameters is expressed by their degree of belief, i.e. appropriate probability density functions that usually are obtained by utilizing the principle of maximum information entropy and the Bayes theorem. Practically, the Bayesian approach to uncertainty evaluation is put into effect by employing numerical integration techniques, preferably Monte-Carlo methods. Compared to the ISO-GUM procedure, the Bayesian approach does not have any restrictions with respect to nonlinearities and calculation of confidence intervals.
K nearest neighbours with mutual information for simultaneous classification and missing data imputation
Authors: Pedro J. García-Laencina, José-Luis Sancho-Gómez, Aníbal R. Figueiras-Vidal, Michel Verleysen
Venue: Neurocomputing (2009)

Missing data is a common drawback in many real-life pattern classification scenarios. One of the most popular solutions is missing data imputation by the K nearest neighbours (KNN) algorithm. In this article, we propose a novel KNN imputation procedure using a feature-weighted distance metric based on mutual information (MI). This method provides a missing data estimation aimed at solving the classification task, i.e., it provides an imputed dataset which is directed toward improving the classification performance. The MI-based distance metric is also used to implement an effective KNN classifier. Experimental results on both artificial and real classification datasets are provided to illustrate the efficiency and the robustness of the proposed algorithm.
Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
Authors: J. Joseph Fowler, Michael Jünger, Stephen Kobourov, Michael Schulz
Venue: Graph-Theoretic Concepts in Computer Science: 34th International Workshop, WG 2008, Durham, UK, June 30 --- July 2, 2008. Revised Papers (2008)

A set of planar graphs share a simultaneous embedding if they can be drawn on the same vertex set V in the Euclidean plane without crossings between edges of the same graph. Fixed edges are common edges between graphs that share the same simple curve in the simultaneous drawing. Determining in polynomial time which pairs of graphs share a simultaneous embedding with fixed edges (SEFE) has been open.We give a necessary and sufficient condition for whether a SEFE exists for pairs of graphs whose union is homeomorphic to K 5 or K 3,3. This allows us to characterize the class of planar graphs that always have a SEFE with any other planar graph. We also characterize the class of biconnected outerplanar graphs that always have a SEFE with any other outerplanar graph. In both cases, we provide efficient algorithms to compute a SEFE. Finally, we provide a linear-time decision algorithm for deciding whether a pair of biconnected outerplanar graphs has a SEFE.
Amagatana + Fula
Authors: Yuichiro Katsumoto, Masa Inakage
Venue: ACM SIGGRAPH ASIA 2008 artgallery: emerging technologies (2008)

A set of daily objects that combine physical and ubiquitous computing to allow users to live their daily lives playfully. Amagatana, an umbrella, makes clashing sword noises when swung around, and Fula, a muffler, flutters and billows by itself in response to the user's motor-action potentials. This project is supported by CREST, JST.
Do students differentiate between computing disciplines?
Authors: Jill Courte, Cathy Bishop-Clark
Venue: ACM SIGCSE Bulletin (2009)

We are in a time where computing programs are seeking to differentiate themselves. The ACM suggests that there are five distinct computing disciplines -- Computer Science (CS), Information Technology (IT), Information Systems (IS), Computer Engineering (CE), and Software Engineering (SE). In practice, it seems that there can be extensive overlap between these disciplines. For example, IS is defined by the ACM as computing in an organization context, typically in business while IT is defined as focusing on computing infrastructure and needs of individual users. If each of the different types of programs wishes to identify and attract interested students, it is important to understand if students perceive differences between them. This paper presents the results of a survey to determine if students differentiate between these five disciplines. Computing majors and non-majors were presented with several task descriptions commonly associated with each discipline and asked to identify them as belonging to one of the five disciplines. Data was collected from over 300 students at several different institutions and from a variety of different majors and computing disciplines. The results of the survey are presented along with comparisons of the perceptions of majors and non-majors.
Innovations in the operation of future computers
Authors: Frederic G. Withington
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

Not many years ago the standard way of operating computers was in a single stream batch mode. The operator completely controlled the computer resource, setting up each job before its initiation, mounting the appropriate tapes and I/O media, initializing the machine, putting the appropriate program deck in the cardreader and so forth. The user interacted with the operator most often in a "closed shop" mode, giving the operator a run request from a card deck and tapes as needed, and leaving it to him to take care of applying the resources to the job. 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
Videotex and teletext in the business/consumer marketplace
Authors: Larry T. Pfister
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

The impact of interactive television in the marketplace will change our perception of the home television set from that of an entertainment medium to that of an informational mechanism at both the consumer and business levels. A review of the development of videotex and teletext in the United States and abroad highlights significant contributions of the various technologies shaping this rapidly evolving industry. As reflected by the rapid growth of the U.S. Videotex Industry Association, the potential of videotex is being tracked by a broad spectrum of interested parties---from the individual PC user to the corporate board at AT&T. The videotex revolution will profoundly change our lifestyles and will bring instant information-on-demand into our homes and offices. 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 prototype low-cost wakeup radio for the 868 MHz band
Authors: Bas Van der Doorn, Winelis Kavelaars, Koen Langendoen
Venue: International Journal of Sensor Networks (2009)

In many wireless sensor network scenarios, battery-powered nodes must operate for years, which necessitate the need for advanced power management of the radio. In this paper, we pursue the idea of using a second, ultra low-power radio that can be used to trigger a remote interrupt, so that a receiver can fire up its primary radio to engage in efficient high-speed communication with the sender. Wakeup radio avoids the complex bookkeeping associated with energy-efficient MAC protocols, but at the price of additional hardware. We present the first design of a low-cost wakeup radio made out of standard components. Our working prototype implementation operates in the European license-free 868 MHz band, and includes a specialised low-power microcontroller filtering out interference (e.g. GSM signals), which makes it practical for use in many real-world settings.
Fractals, Visualization and J
Authors: Clifford Reiter
Venue:  (2007)

An introduction to mathematical visualization including many fractals and using the J programming language. Designed for classroom use or individual learning. J is freely available and no prior experience with J is required. Experiments are hands on explorations that readers can duplicate. Topics include fractals, time series, iterated function systems, chaos and symmetry, cellular automata, complex dynamics, image processing, ray tracing and Open GL.
A Palmprint Verification System Based on Phase Congruency Features
Authors: Vitomir Štruc, Nikola Pavešić
Venue: Biometrics and Identity Management: First European Workshop, BIOID 2008, Roskilde, Denmark, May 7-9, 2008. Revised Selected Papers (2008)

The paper presents a fully automatic palmprint verification system which uses 2D phase congruency to extract line features from a palmprint image and subsequently performs linear discriminant analysis on the computed line features to represent them in a more compact manner. The system was trained and tested on a database of 200 people (2000 hand images) and achieved a false acceptance rate (FAR) of 0.26% and a false rejection rate (FRR) of 1.39% in the best performing verification experiment. In a comparison, where in addition to the proposed system, three popular palmprint recognition techniques were tested for their verification accuracy, the proposed system performed the best.
Construction of a multirate RODAS method for stiff ODEs
Authors: V. Savcenco
Venue: Journal of Computational and Applied Mathematics (2009)

Multirate time stepping is a numerical technique for efficiently solving large-scale ordinary differential equations (ODEs) with widely different time scales localized over the components. This technique enables one to use large time steps for slowly varying components, and small steps for rapidly varying ones. Multirate methods found in the literature are normally of low order, one or two. Focusing on stiff ODEs, in this paper we discuss the construction of a multirate method based on the fourth-order RODAS method. Special attention is paid to the treatment of the refinement interfaces with regard to the choice of the interpolant and the occurrence of order reduction. For stiff, linear systems containing a stiff source term, we propose modifications for the treatment of the source term which overcome order reduction originating from such terms and which we can implement in our multirate method.
Protection of Sensitive Security Parameters in Integrated Circuits
Authors: Dejan E. Lazich, Micaela Wuensche
Venue: Mathematical Methods in Computer Science: Essays in Memory of Thomas Beth (2008)

To protect sensitive security parameters in the non-volatile memory of integrated circuits, a device is designed that generates a special secret key (called IC-Eigenkey) to symmetrically encrypt this data. The IC-Eigenkey is generated by the integrated circuit itself and therefore unknown to anybody else. The desired properties of such an IC-Eigenkey are postulated and a theoretical limit on the distribution of IC-Eigenkeys over an IC-production series is derived. The design of the IC-Eigenkey generator is based on silicon physical uncloneable functions. It exploits the marginal random variations of the propagation delays of gates and wires in an integrated circuit. A method is introduced that uses codewords of error control codes to configure the IC-Eigenkey generator in a way that the generated bits are as statistically independent of each other as possible.