ppxscal/embedding_network huggingface dataset:
User-interface Design of Web Application Using Object-Z
Authors: Bin Zhu, Huaikou Miao, Bo Song
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

A notation is presented for formally describing Web application’s design of a user-interface. The function of a Web application is given using formal specification language Object-Z and then some generic classes, relationships and system actions are defined to specify user-interface design. In user-interface design, UAN annotations are added to Object-Z notation. The extended Object-Z notation expresses the presentation relationship between the design and the specification. This formal specification and design is useful in documenting a user-interface design and enables the analysis of the usability and safety of a Web application. In particular, it can be used to generate test cases automatically. An example of student information management system is used to illustrate the notation. Task efficiency is analyzed with the example.
Unsupervised Learning of Terrain Appearance for Automated Coral Reef Exploration
Authors: Philippe Giguere, Gregory Dudek, Christopher Prahacs, Nicolas Plamondon, Katrine Turgeon
Venue: Proceedings of the 2009 Canadian Conference on Computer and Robot Vision (2009)

We describe a navigation and coverage system based on unsupervised learning driven by visual input. Our objectiveis to allow a robot to remain continuously moving above a terrain of interest using visual feedback to avoid leavingthis region. As a particular application domain, we are interested in doing this in open water, but the approach makes few domain-specific assumptions. Specifically, our system employed an unsupervised learning technique to train a k-Nearest Neighbor classifier to distinguish between images of different terrain types through image segmentation. A simple random exploration strategy was used with this classifier to allow the robot to collect data while remaining confined above a coral reef, without the need to maintain pose estimates. We tested the technique in simulation, and a live deployment was conducted in open water. During the latter, the robot successfully navigated autonomously above acoral reef during a 20 minutes period.
A Guide to Help Desk Concepts
Authors: Donna Knapp
Venue:  (2009)

"A Guide to Service Desk Concepts: Service Desk and the IT Infrastructure Library, Third Edition, International Edition" discusses the different types of help desks that exist, how they are measured by the organizations they support, the varying roles and skills required within a typical help desk, and the processes and technologies commonly employed to ensure the help desk is operating efficiently and effectively. In the third edition, the author also incorporates the use of ITIL standards, which are becoming increasingly widespread in the help desk field. 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
Geometric variance reduction in Markov chains: application to value function and gradient estimation
Authors: Rémi Munos
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 2 (2005)

We study a sequential variance reduction technique for Monte Carlo estimation of functionals in Markov Chains. The method is based on designing sequential control variates using successive approximations of the function of interest V. Regular Monte Carlo estimates have a variance of O(1/N), where N is the number of samples. Here, we obtain a geometric variance reduction O(ρN) (with ρ < 1) up to a threshold that depends on the approximation error V - AV, where A is an approximation operator linear in the values. Thus, if V belongs to the right approximation space (i.e. AV = V), the variance decreases geometrically to zero. An immediate application is value function estimation in Markov chains, which may be used for policy evaluation in policy iteration for Markov Decision Processes. Another important domain, for which variance reduction is highly needed, is gradient estimation, that is computing the sensitivity ∂α, V of the performance measure V with respect to some parameter α of the transition probabilities. For example, in parametric optimization of the policy, an estimate of the policy gradient is required to perform a gradient optimization method. We show that, using two approximations, the value function and the gradient, a geometric variance reduction is also achieved, up to a threshold that depends on the approximation errors of both of those representations.
Global Connections for Lasting Impressions: Experiential Learning about TCP
Authors: Colin Allison, Alan Miller, Iain Oliver, Thomas Sturgeon
Venue: Proceedings of the 8th International Conference on Advances in Web Based Learning (2009)

"Tell me and I forget, Show me and I remember, Involve me and I understand". This paper discusses the motivation for, and design of, a learning resource which allows students to explore the Transmission Control Protocol (TCP). TCP is responsible for transporting over 80% of the traffic on the Internet --- all web and e-mail for example --- and in addition is the primary means of achieving Internet congestion control. TCP is therefore core to modern life. It is a protocol under constant study with a view to evolution, and it is incumbent on all ICT curricula to provide education at appropriate levels about its dynamics, strengths and weaknesses. There are no shortages of good textbooks which provide information on TCP, but these are no substitute for experiential learning in order to provide a lasting understanding. The TCP Live learning resource allows students to explore the behavior of TCP on the global Internet, and see the wide variety of conditions that the protocol has to cope with, thereby extending their viewpoint outwith the limited scope of their own institutional firewalls.
Multi-layer Based Authoring Tool for Digilog Book
Authors: Jonghee Park, Woontack Woo
Venue: Proceedings of the 8th International Conference on Entertainment Computing (2009)

In this paper, we propose multi-layer based authoring tool for Digilog Book. The main feature is that a user can author some properties of printed contents of a paper book. Those properties can be utilized for virtual contents authoring. The proposed authoring tool provides an interface to allocate some properties for printed contents. Those properties are utilized in manipulating virtual contents. As a result, users can author a realistic Digilog Book.
Fast Disparity Refinement Algorithm for Client-Oriented Multi-view Video System
Authors: Mei Yu, Tao Qiu, Feng Shao, Gangyi Jiang
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

Compared to traditional multi-view systems, client-oriented multi-view video system could significantly simplify the complexity at the client since part of disparity estimation is left to the sever. This paper proposes a fast disparity refinement algorithm for the client-oriented multi-view video system. Firstly, the coarse disparity map is generated by adopting 8x8 block based disparity estimation based on smoothness restriction at the server, and the 8×8 block based disparity map is transmitted to the client. Then according to the spatial correlation of disparity vectors and disparity discontinuity at the boundary area of objects, pixel-wise disparity map is obtained with a fast disparity refinement algorithm. Experimental results show that, compared with the traditional block-matching based algorithm at the client, the disparity refinement algorithms spend no more than 2% time to generate a pixel-wise disparity map, moreover, the disparity maps are more smoother within the objects. Compared with the previous refinement algorithm, the proposed algorithm not only improves the quality of the reconstructed right view images, but also saves about 20% time for generating of pixel-wise disparity map.
Synchronization analysis of coupled connected neural networks with mixed time delays
Authors: Qiankun Song
Venue: Neurocomputing (2009)

In this paper, the global exponential synchronization of coupled connected neural networks with both discrete and distributed delays is investigated under mild condition, assuming neither the differentiability and strict monotonicity for the activation functions nor the diagonal for the inner coupling matrices. By employing a new Lyapunov-Krasovskii functional, applying the theory of Kronecker product of matrices and the linear matrix inequality (LMI) technique, several delay-dependent sufficient conditions in LMI form are obtained for global exponential synchronization of such systems. Moreover, the decay rate is estimated. The proposed LMI approach has the advantage of considering the difference of neuronal excitatory and inhibitory efforts, which is also computationally efficient as it can be solved numerically using efficient Matlab LMI toolbox, and no tuning of parameters is required. In addition, the proposed results generalize and improve the earlier publications. An example with simulation is given to show the effectiveness of the obtained results.
SSE Implementation of Multivariate PKCs on Modern x86 CPUs
Authors: Anna Inn-Tung Chen, Ming-Shing Chen, Tien-Ren Chen, Chen-Mou Cheng, Jintai Ding, Eric Li-Hsiang Kuo, Frost Yu-Shuang Lee, Bo-Yin Yang
Venue: Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems (2009)

Multivariate Public Key Cryptosystems (MPKCs) are often touted as future-proofing against Quantum Computers. It also has been known for efficiency compared to "traditional" alternatives. However, this advantage seems to erode with the increase of arithmetic resources in modern CPUs and improved algorithms, especially with respect to Elliptic Curve Cryptography (ECC). In this paper, we show that hardware advances do not just favor ECC. Modern commodity CPUs also have many small integer arithmetic/logic resources, embodied by SSE2 or other vector instruction sets, that are useful for MPKCs. In particular, Intel's SSSE3 instructions can speed up both public and private maps over prior software implementations of Rainbow-type systems up to 4×. Furthermore, MPKCs over fields of relatively small odd prime characteristics can exploit SSE2 instructions, supported by most modern 64-bit Intel and AMD CPUs. For example, Rainbow over ${\mathbb F}_{31}$ can be up to 2× faster than prior implementations of similarly-sized systems over ${\mathbb F}_{16}$. Here a key advance is in using Wiedemann (as opposed to Gauss) solvers to invert the small linear systems in the central maps. We explain the techniques and design choices in implementing our chosen MPKC instances over fields such as ${\mathbb F}_{31}$, ${\mathbb F}_{16}$ and ${\mathbb F}_{256}$. We believe that our results can easily carry over to modern FPGAs, which often contain a large number of small multipliers, usable by odd-field MPKCs.
Finding Intrinsic and Extrinsic Viewing Parameters from a Single Realist Painting
Authors: Tadeusz Jordan, David G. Stork, Wai L. Khoo, Zhigang Zhu
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

In this paper we studied the geometry of a three-dimensional tableau from a single realist painting --- Scott Fraser's Three way vanitas (2006). The tableau contains a carefully chosen complex arrangement of objects including a moth, egg, cup, and strand of string, glass of water, bone, and hand mirror. Each of the three plane mirrors presents a different view of the tableau from a virtual camera behind each mirror and symmetric to the artist's viewing point. Our new contribution was to incorporate single-view geometric information extracted from the direct image of the wooden mirror frames in order to obtain the camera models of both the real camera and the three virtual cameras. Both the intrinsic and extrinsic parameters are estimated for the direct image and the images in three plane mirrors depicted within the painting.
The Research on Adaptive Process for Emotion Recognition by Using Time-Dependent Parameters of Autonomic Nervous Response
Authors: Jonghwa Kim, Mincheol Whang, Jincheol Woo
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part I: New Trends (2009)

This study is to propose new method, called by TDP (time dependenet parameter) anlaysis, of physiological signal processing for emoiton recognition. TDP consised of delay, activation, half recovery and full recovery. TDP was determined from running average and normalization of physiological signals for finding tonic and phasic reponse according to emotion at entire time range from stimulating emotion to recovery. As the results of this study, TDP analysis and adaptive TDP analysis enhanced accuracy of emotion recognition in the comparison with tonic analysis. Speciallly, TDP analysis enhanced the accuracy while adaptive TDP analysis reduced the individual difference of the accuracy.
Charts, interaction-free grammars, and the compact representation of ambiguity
Authors: Marc Dymetman
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

Recently researchers working in the LFG framework have proposed algorithms for taking advantage of the implicit context-free components of a unification grammar [Maxwell and Kaplan, 1996]. This paper clarifies the mathematical foundations of these techniques, provides a uniform framework in which they can be formally studied and eliminates the need for special purpose runtime datastructures recording ambiguity. The paper posits the identity: Ambiguous Feature Structures = Grammars, which states that (finitely) ambiguous representations are best seen as unification grammars of a certain type, here called "interactionfree" grammars, which generate in a backtrackfree way each of the feature structures subsumed by the ambiguous representation. This work extends a line of research [Billot and Lang, 1989; Lang, 1994] which stresses the connection between charts and grammars: a chart can be seen as a specialization of the reference grammar for a given input string. We show how this specialization grammar can be transformed into an interaction-free form which has the same practicality as a listing of the individual solutions, but is produced in less time and space.
A New Scrambling Method Based on Arnold and Fermat Number Transformation
Authors: Zhang Yanqun, Wang Qianping
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

In the preprocessing of digital image information hiding, the common scrambling method Arnold based on locational space can’t change the statistical character of an image. Because of using fixed form matrix, the image is detected and attacked easily. Combining with the Fermat number transformation matrix changeable, the fast algorithm like FFT and solving the inverse matrix simply, this paper presents a new secondary scrambling method based on color space and locational space. Experiments show this method based on Arnold can reach ideally scrambling effect after only one time Fermat number transformation, and it is robust to cropping attack, so it is very useful in digital image information hiding.
Sketch2Photo: internet image montage
Authors: Tao Chen, Ming-Ming Cheng, Ping Tan, Ariel Shamir, Shi-Min Hu
Venue: ACM Transactions on Graphics (TOG) (2009)

We present a system that composes a realistic picture from a simple freehand sketch annotated with text labels. The composed picture is generated by seamlessly stitching several photographs in agreement with the sketch and text labels; these are found by searching the Internet. Although online image search generates many inappropriate results, our system is able to automatically select suitable photographs to generate a high quality composition, using a filtering scheme to exclude undesirable images. We also provide a novel image blending algorithm to allow seamless image composition. Each blending result is given a numeric score, allowing us to find an optimal combination of discovered images. Experimental results show the method is very successful; we also evaluate our system using the results from two user studies.
Evaluating a Tangible Game Video Console for Kids
Authors: Javier Marco, Eva Cerezo, Sandra Baldassarri
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

Tangible and tabletop interaction can be suitable for kindergarten children as educational material, expressive tool, or merely for fun. But only playfully interactive experiences will happen if technologies include aspects that are relevant to the child's development, incorporating social experiences and easy control. Observation of children using these technologies is an important feedback to improve designs but an appropriated method has to be used in the evaluations. The Structured Expert Evaluation Method (SEEM) not only assesses technologies' usability but also fun aspects. This paper presents our research about the design and evaluation of a tabletop prototype oriented to children between 3 and 6 years, and the analysis of observations of children using our games.
Story of a Video Game Workshop: "Ico", an Interactive Fairy Tale for Children Less Interaction
Authors: Michael Stora
Venue: Proceedings of the 8th International Conference on Entertainment Computing (2009)

The Since several years, I use the video game as a therapeutic object. This new mediation seems pertinent for children that we qualified "limit". Those children are more in the game in the gambling sense, than in the Winnicot's play. The video game is relevant in a clinic sense for two reasons essential. The first reason is that mediation is in picture and children and adolescents have an intimate attachment to these who have the power to do emerge affects and words that in generally are repressed. The second reason is this meeting between narcissism pathology and the use of video game as a place of virtue's passage in act. The acting becomes symbolic and the conflict showed by the narration of the video game is in a dynamic point between drive and narcissism.The Author. After my education as a film-maker, I became a clinical psychologist, and, ever since I am constantly preoccupied by the unconscious links between human being and images. In 2000, I created a Partnership Association named: "Observatory of Digital World in Human Studies", for developing new theories on Interactivity, this new connection to images. I, moreover, used video games as a therapeutic tool for children with violent behaviour troubles. In 2008, I launched the Company "Implicit Game" with the aim of creating video games for healing. I am currently working on a project of an on-line game for youngs adutls and teen agers suffering of cancer. 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
Science and Engineering in the Petascale Era
Authors: Thom H. Dunning,  Jr., Klaus Schulten, Jeroen Tromp, Jeremiah P. Ostriker, Kelvin Droegemeier, Ming Xue, Paul Fussell
Venue: IEEE Design Test (2009)

What breakthrough advances will petascale computing bring to various science and engineering fields? Experts in everything from astronomy to seismology envision the opportunities ahead and the impact they'll have on advancing our understanding of the world.
Research on Knowledge-Reuse-Based Windshield Inspection Gauge Design System
Authors: Bin Wang, Defang Liu, Ning Zhou, Linzhen Zhou
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

A vehicle windshield inspection gauge digital design system was developed through the integration betweenknowledge-engineering-related technology and product parametric design technology, based on Siemens PLM Software NX development platform and with the application of software tools such as UG/Open API, UF, UIStyler, MenuScript. Some key technologies such as Knowledge mining and classification, automatic design of transform structures and establishing model database further studied in the paper.
Research of Fault Diagnosis Method Based on Immune Neural Network
Authors: Zongyan Yu
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

A fault diagnosis method based on immune neural network is proposed in this paper. In this method the weights of neural network is encoded as the antibody, and the network error is considered as the antigen. Firstly the weights of the network are searched globally using immune algorithm, then searched locally using BP algorithm. The simulation is done through the experiment of the pump-jack, and the diagnosis method proposed in this paper is compared with the fault diagnosis method based on BP neural network. The result shows that the fault diagnosis method based on immune neural network has the capability in escaping local minimum and improving the algorithm speed.
Strongly Secure Certificateless Key Agreement
Authors: Georg Lippold, Colin Boyd, Juan Gonzalez Nieto
Venue: Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography (2009)

We introduce a formal model for certificateless authenticated key exchange (CL-AKE) protocols. Contrary to what might be expected, we show that the natural combination of an ID-based AKE protocol with a public key based AKE protocol cannot provide strong security. We provide the first one-round CL-AKE scheme proven secure in the random oracle model. We introduce two variants of the Diffie-Hellman trapdoor introduced by [4]. The proposed key agreement scheme is secure as long as each party has at least one uncompromised secret. Thus, our scheme is secure even if the key generation centre learns the ephemeral secrets of both parties.
On Node-Fault-Injection Training of an RBF Network
Authors: John Sum, Chi-Sing Leung, Kevin Ho
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

While injecting fault during training has long been demonstrated as an effective method to improve fault tolerance of a neural network, not much theoretical work has been done to explain these results. In this paper, two different node-fault-injection-based on-line learning algorithms, including (1) injecting multinode fault during training and (2) weight decay with injecting multinode fault, are studied. Their almost sure convergence will be proved and thus their corresponding objective functions are deduced.
Nearest Neighbor Tour Circuit Encryption Algorithm Based Random Isomap Reduction
Authors: Wei Lu, Zheng-An Yao
Venue: Proceedings of the 5th International Conference on Advanced Data Mining and Applications (2009)

This paper presents nearest neighbor tour circuit encryption algorithm based random Isomap reduction. In order to be suited for privacy-preserving classification, we first alter the selection fashion of the parameters nearest neighbor number k and embedded space dimension d of Isomap reduction algorithm. Further we embed the tourists' sensitive attribution into random dimension space using random Isomap reduction, thus the sensitive attributes are encrypted and protected. Because the transformed space dimension d and nearest neighbor number k are both random, this algorithm is not easily be breached. In addition, Isomap can keep geodesic distance of two points of dataset, so the precision change of classification after encryption can be controlled in a small scope . The experiment show that if we select appropriate parameters, then nearest neighbors of every point may be completely consistent. The present algorithm can guarantee that the security and the precision both achieve the requirements.