ppxscal/embedding_network huggingface dataset:
Formal Specification using Interaction Diagrams
Authors: K. Lano
Venue: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (2007)

Interaction diagrams are a widely-used UML notation, however in contrast to class diagrams or state machines there is a lack of formal semantics for interaction diagrams. We propose a formal semantics for the notation, and consider applications of this semantics for checking the consistency of interaction diagrams with other UML models, and for diagrammatic formal specification of real-time properties.
Explorations on interactive interfaces using cuteness
Authors: Adrian David Cheok, Masahiko Inami, Owen Noel Newton Fernando, Masa Inakage, Tim Robert Merritt
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

The experience of interactive systems can be a rather complex set of events. The perceptions appeal to the user's senses including visual, auditory, tactile, olfactory, and gustatory. Taken from a human factors approach, the sensitivity of the senses can be measured very closely and units of measurement arise from the "just noticeable difference." These differences can be mapped to the physics behind the stimuli and computer controlled systems very accurately provide sensation to the user through various user interfaces. The human mind also plays an important role in making sense of the experience not only from a physiological standpoint, but from a psychological and cultural reference point. Many instinctual impulses can be elicited by interactive media for powerful, immersive experiences. The fight or flight response and sexual attraction have been used extensively in the top selling games, but we are looking beyond these toward the interfaces that aim to bring happiness and comfort. We look at a range of experiences involving the idea of "cuteness" and its related components. From a psychological standpoint, there are cues that are well known that are instilled in us at an instinctual level. An example is the features of babies that bring out a nurturing response. Measuring these reactions however is less discrete and is more qualitative in nature. From a cultural standpoint, the definition of how cute something is and what it drives the user to do in response is not yet fully explored. Toy and game manufacturers are continually striving to hit the "sweet spot" with the consumers in the various markets and sometimes produce a combination that has wide appeal and then due to a long lasting popularity it may also add or modify the cultural perception. Our studies look at what elements are perceived as cute and then understanding the reaction the user has to this. We are working towards a goal of providing the designers with a better understanding of today's interactive media users and developing ways to enhance the effectiveness of interactive media by utilizing the psychological and culturally developed symbols of cuteness. With these lessons learned, the next generation user interfaces can be built to take advantage of the "cuteness" factor and establish more meaningful relationships with the users and encouraging happiness and positive experiences.
Conception of a decision support system and its interface: Application to a teleoperation system
Authors: A. M. Jolly-Desodt, D. Jolly, F. Wawak
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2002)

This paper presents a decision support system and its interface, both based on fuzzy and possibility theories, intended for man-machine systems and that has been realized for a teleoperation system. The kinds of assistance useful to the human operator in man-machine systems are first reviewed: this stresses the contribution of a decision support system in such an organization. The necessity to enclose a specific man-machine interface presenting that aid is showed. Then, the steps of the decision support system design are investigated: due to the context of man machine systems, the efficiency of the Fuzzy and Possibility Theories to modelise the aid is obvious. Finally, the application realized dedicated to the teleoperation field is handled, but the strength of this system is its ability to apply to all man machine systems.
An Automatic Mathematical Expression Understanding System
Authors: Y. Guo, L. Huang, C. Liu, X. Jiang
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

An automatic mathematical expression (ME) understanding system is presented. This system is consisted of three procedures, i.e., pre-processing, symbol segmentation, structure analysis among symbols within the ME. In symbol segmentation procedure, a three-stage segmentation method based on dynamic programming (DP) is introduced to segment symbols in the ME image. In structure analysis procedure, a ME is decomposed into several basic expressions based on reconstructing the ME global structure. Experimental results on about 3268 ME images showed that the presented system worked well. Top-1 ME recognition accuracy reached 78.2%.
R69-2 The Synthesis and Processing of Signals with Discontinuities in the Time Domain
Authors: A. Hausner
Venue: IEEE Transactions on Computers (1969)

The authors consider generating (with integrators) a discontinuous function f(t) for use on an analog computer. It is assumed that f(t) is continuous on each of m subintervals tjj+i, j=0, * , m-1, and that within each subinterval, f can be approximated by a polynomial of degree n: In (1), the ai, are constant for t tjj+i, but change at each transition time tj+i. With the definition (1) satisfies the differential system only if the output of each ft undergoes abrupt jumps at tj+i, From (1), the jumps sk,jare found to be These jumps cannot be represented directly in (3); integrator outputs must be continuous. The way around this difficulty is to transform the integrator outputs to continuous variables gk. Let Now, since fk=gk, we have by direct substitution This gives rise to a circuit with n integrators, m-1 double-pole single-throw switches (to switch the positive and negative reference needed for obtaining Sk+1,jwith potentiometers), and one summer (to implement fo=go+so,j). The authors derive (6) in an alternate manner using the Laplace transform and slightly different notation. 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
Data Persistence in Structured P2P Networks with Redundancy Schemes
Authors: Hongxing LI, Guihai Chen
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Data service is the principle application in structured P2P networks. And in many cases, we need the data to persist for a long time. So how to persist the data service and how long it can persist in the highly unstable P2P networks are interesting topics. To answer the first question, we have already got a number of redundancy schemes to compensate the loss of data caused by the churn of the networks. In this paper, we mainly focus on the second question: how long can data services persist with these redundancy schemes. We analyze the application model and generate several formulas to calculate the data persistence for different redundancy schemes using Markov chain. Then a performance evaluation among these redundancy schemes is conducted. We conclude that erasure coding scheme and the hybrid scheme get better data persistence than the replication scheme does in most cases except when the network churn rate is high and the average node availability is low. We also distinguish the temporary leave of a node from the permanent leave and demonstrate that data availability is also a crucial factor to determine the data persistence.
On listing list prefixes
Authors: Olivier Danvy
Venue: ACM SIGPLAN Lisp Pointers (1989)

The Lisp Puzzles feature in Lisp Pointers, Volume 1, Number 6 proposed the following exercise: given a list, compute the list of its prefixes. Surprisingly, the solutions proposed in later issues all used intermediary copies and/or traversed the original list repeatedly. This note presents a higher-order solution that does not use copies and that traverses the original list only once. Further, this solution can be simply expressed by abstracting control procedurally.
Sowing the seeds of self: a socio-pragmatic penetration of the web artefact
Authors: Pär J. Ågerfalk, Jonas Sjöström
Venue: Proceedings of the 2nd international conference on Pragmatic web (2007)

This paper analyses the concept of the information technology artefact in a pragmatic web context with a special focus on its user interface. Assuming a communicative socio-pragmatic view of the use of Web artefacts, a distinction is made between explicit performance of essential communication actions and "give offs"; our sometimes unintentional traces left on the Web, which we may even be unaware of. It is argued that both aspects are key to understanding the role of IT artefacts and user interfaces in the Web context.
Prediction of Transmembrane Helix Using a Compound Neural Network
Authors: Bodong Li, Xieping Gao, Fen Xiao
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

In this paper, a novel method was proposed for the prediction of transmembrane helices--one of the key issues in the structure prediction of membrane protein. Concretely, the membrane protein sequence was mapped into propensity factor sequence, which then yeilds J detail sequences through J levels of discrete wavelet transform (DWT). Lastly, the original sequence and a subset of the J detail sequences were assembled and put into ScaleNet, a compound neural network which outputs the transmembrane helices sequence. The experiments show that, our method outperforms the DWT-peak-extension method, one of the perfect methods.
Intelligent Forecast for Cucumber Fusarium Wilt Combining Case-based Reasoning With Self-organizing Maps
Authors: Zhengang Yang, Feiqi Deng, Weizhang Liu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

Combining self-organizing maps (SOM) with case- based reasoning (CBR), a hybrid intelligent forecast method for CFW (Cucumber Fusarium Wilt) is presented. Different from the traditional similar case retrieval, this method performs case classification with trained SOM network and then figures out a similar case set using a proposed case similarity metric. A classification accuracy of 97.22% was achieved by the integrated SOM network in the classification performance test. From CFW forecast experiments, the optimal interval of dissimilarity threshold R for this method is inferred. Comprehensive analysis shows that this hybrid forecast method can effectively provide reliable reasoning data for CFW forecast and assist decision-making of CFW prevention and treatment measures.
Peer assisted VoD for set-top box based IP network
Authors: Vaishnav Janardhan, Henning Schulzrinne
Venue: Proceedings of the 2007 workshop on Peer-to-peer streaming and IP-TV (2007)

IP-enabled set-top boxes are becoming key devices in home entertainment networks. In addition to providing TV signals, STBs have been providing pay-per view service for a long time. But this service suffers from bandwidth requirements at the source server and has scaling problems. We propose a new design for providing a peer-assisted VoD service where peers co-operate in delivering the content to other peers. This design uses a Bittorrent like protocol for peer-to-peer topology management and DHT for data retrieval with low startup time, provision for VCR operation and admission control to guarantee QoS for subscribers. It utilizes the large storage of STBs for better viewing experience with reduced jitter and the underlying network architecture to do a location aware content fetching and reduce the expensive cross AS traffic over the Internet.
A Correctness Criterion for Transaction Management in Loosely Coupled System
Authors: Yubin Guo, Jianqing Xi, Deyou Tang, Ximing Li
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

At present, most distributed system are loosely coupled. They are usually composed of components by invocation temporarily. Their components are often autonomic and execute independently. As to concurrency control, parallelism in there systems are more than in traditional distributed ones. So that serializability is too strict a correctness criterion to them. This paper divided transactions into atomic units according to semantic information. And interleaving between atomic units of different transactions is permitted to heighten parallelism. This newly proposed correctness criterion is named as weakly serializability. Weakly serializable schedule is nonserializable, but preserves data consistency at a higher level of semantics. Necessary and sufficient Condition of Weakly serializable schedule is presented and proved. Accordingly a distributed algorithm for concurrency control is given also.
SVM Approximate Based Comprehensive Nonlinear Control Strategy for TCSC and Generator Governor
Authors: Yongjun Li, Xiaofang Yuan
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

A novel decoupling controller based on support vec- tor machines (SVM) modeling is proposed for thyristor- controlled series compensation (TCSC) and generator gov- ernor. The decoupling control law can be derived directly via Taylor expansion and is implemented straightforwardly using SVM modeling. Only general SVM identification tech- nique is involved in both model development and controller design without extra training. The robustness of the stability and the performance of the controller is rigorously estab- lished by using Lyapunov method. Simulations demonstrate the effectiveness of the proposed control scheme.
Status Report on New Standards for DTE/DCE Interface Protocols
Authors: H. C. Folts
Venue: Computer (1979)

Activity in a number of organizations and countries is leading to a new generation of interface standards for public data networks. 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
Adaptive learning of process control and profit optimization using a classifier system
Authors: A. H. Gilbert, Frances Bell, Christine L. Valenzuela
Venue: Evolutionary Computation (1995)

A classifier system is used to learn control and profit optimization of a batch chemical reaction. Ability to learn different market conditions and changes to reaction parameters is demonstrated. The profit sharing algorithm is used for apportionment of credit. The greater effectiveness of the use of the genetic algorithm over apportionment of credit alone or the random replacement of low strength rules is also shown. The classifier system is unusual in having more than one action per rule.
Reliable Loop Topologies for Large Local Computer Networks
Authors: C. S. Raghavendra
Venue: IEEE Transactions on Computers (1985)

Single-loop networks tend to become unreliable when the number of nodes in the network becomes large. Reliability can be improved using double loops. In this paper a highly reliable and efficient double-loop network architecture is proposed and analyzed. This network is based on forward loop backward hop topology, with a loop in the forward direction connecting all the neighboring nodes, and a backward loop connecting nodes that are separated by a distance ?vN?where N is the number of nodes in the network. It is shown that this topology is optimal, among this class of double-loop networks, in terms of diameter, average hop distance, processing overhead, delay, throughput, and reliability. The paper includes derivation of closed form expressions for diameter and average hop distance, throughput, and number of distinct routes between two farthest nodes. For fault-tolerance study, the effect of node and link failures on the performance of the network is analyzed. A simple distributed routing algorithm for reliable loop network operation is also presented.
Assisting potentially-repetitive small-scale changes via semi-automated heuristic search
Authors: Mark M. McIntyre, Robert J. Walker
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

When a software system undergoes modification, a given change might need to be repeated throughout the codebase. While the change itself may not be difficult to implement, discovering other locations where this change should be applied (if any exist) can be onerous. Syntactic differences in otherwise semantically similar code can render traditional search techniques ineffective. This paper describes a heuristic search technique to help find the locations required to complete a repetitive small-scale change (RSC). By observing the developer perform a change once, it is possible to infer semantic information about that change and to automatically suggest locations where the same change ought to be made
Implicit representation in genetic algorithms using redundancy
Authors: Anne M. Raich, Jamshid Ghaboussi
Venue: Evolutionary Computation (1997)

A new representation combining redundancy and implicit fitness constraints is introduced that performs better than a simple genetic algorithm (GA) and a structured GA in experiments. The implicit redundant representation (IRR) consists of a string that is over-specified, allowing for sections of the string to remain inactive during function evaluation. The representation does not require the user to prespecify the number of parameters to evaluate or the location of these parameters within the string. This information is obtained implicitly by the fitness function during the GA operations. The good performance of the IRR can be attributed to several factors: less disruption of existing fit members due to the increased probability of crossovers and mutation affecting only redundant material; discovery of fit members through the conversion of redundant material into essential information; and the ability to enlarge or reduce the search space dynamically by varying the number of variables evaluated by the fitness function. The IRR GA provides a more biologically parallel representation that maintains a diverse population throughout the evolution process. In addition, the IRR provides the necessary flexibility to represent unstructured problem domains that do not have the explicit constraints required by fixed representations.
From technology engineering to social engineering: 15 years of research on virtual worlds
Authors: Mikko Jäkälä, Samuli Pekkola
Venue: ACM SIGMIS Database (2007)

Virtual worlds have a long history, and it also includes various technologies. Yet research interest towards them has diverged over the years. It seems that nowadays they are on focus again with the evolution of socially oriented and community-supporting virtual worlds. Instead of technical factors, human factors and the motivation behind the use are highlighted. In this paper, we will briefly review the research efforts made in the 90's, and derive a set of themes that were of interest back then. Next, we will expand the set by arguing for newer themes, identified in the latest information systems literature. These two sets of themes form a basis of a research agenda for studying virtual worlds in the next five years. The sets also compose N-dimensional space for further theorizing and developing new virtual worlds or virtual places for work and pleasure. Hence, the paper presents and argues for a transition from technology engineering to social engineering.
Media-Handover-Aware TCP: Preventing Quality Degradation on Co-existing Real-Time Communications
Authors: Hiroki Baba, Hiroyuki Koga, Katsuyoshi Iida, Katsunori Yamaoka, Yoshinori Sakai
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

Multi-homed networks are currently expanding and their access areas are overlapping. The benefit of multi-homed networks is to improve the Quality-of-Service (QoS) of communications through dynamically selecting appropri- ate communications media. Multi-homed networks can im- prove long-term QoS through dynamically switching appro- priate media. However, the instantaneous effect of media switching will degrade short-term QoS. Media handover de- grades the QoS not only of the handover flow itself but also of the flows to be merged. A real-time flow in narrow band- width communications media will particularly be affected by the media handover of a TCP flow with a large win- dow. Therefore, we propose media-handover-aware TCP mechanisms to attain high-quality real-time communica- tions, which adjust the size of the TCP's transmission win- dow corresponding to the change in bandwidth using a sig- nal to notify of media handover. Through simulations, we evaluated and analyzed our proposed mechanisms.
Transmission friction in an electric mining shovel: Field Reports
Authors: Kevin J. Austin, P. Ross McAree
Venue: Journal of Field Robotics (2007)

Friction is a phenomenon present in all mechanical systems and is undesirable in estimation and control tasks. This paper explores the characteristics of friction in the transmission of an electric mining shovel, with a view to compensating for them. Experiments suggest that the transmission friction can be described by a Coulomb friction model with associated uncertainty on the friction force. The Kalman Inverse Filter is evaluated as a method for adaptively estimating the friction for motion of the bucket through free-space. The friction estimates are consistent with experimental results. &copy; 2007 Wiley Periodicals, Inc.
Model-based assurance of security controls
Authors: Yolanta Beres, Adrian Baldwin, Simon Shiu
Venue: Proceedings of the 2007 ACM workshop on Quality of protection (2007)

We present an innovative way to assess the effectiveness of security controls where measurable aspects of controls are first captured in models and then the models are used to analyze the security data gathered from the IT environment. The aim is to lift the risk and security control assessment lifecycle from a series of people based processes to one where model based technology enhances and automates the process.
Incentives for Resource Sharing and Cooperation in Grid Computing System
Authors: Johnson Iyilade, Adesola Aderounmu, Matthew Adigun
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

The main idea behind Grid computing is coordinated resource sharing and problem solving in dynamic, multi-institutional virtual organizations. This idea is premised on the assumptions that resource providers are cooperative and that participants can not exploit the community for selfish-end. But as the vision of Grid expands from research and scientific domain to the commercial world, we know that these assumptions may no longer hold. There is thus the need for suitable incentives for resource sharing and cooperation on the Grid without which the rational strategy of all peer organizations would be to "freeride" on other's effort. In this paper, we propose various incentives for Grid resource sharing and cooperation. We particularly focus on two key issues: incentives for resource providers and incentives for negotiating execution of deadline-driven jobs. Through simulation, we show that the Grid performance is enhanced with the introduction of incentive for negotiating execution of deadline jobs than when there is no incentive.