ppxscal/embedding_network huggingface dataset:
Applications of Page Ranking in P Systems
Authors: Michael Muskulus
Venue: Membrane Computing: 9th International Workshop, WMC 2008, Edinburgh, UK, July 28-31, 2008, Revised Selected and Invited Papers (2009)

The page rank of a webpage is a numerical estimate of its authority. In Google's PageRank algorithm the ranking is derived as the invariant probability distribution of a Markov chain random surfer model. The crucial point in this algorithm is the addition of a small probability transition for each pair of states to render the transition matrix irreducible and aperiodic. The same idea can be applied to P systems, and the resulting invariant probability distribution characterizes their dynamical behavior, analogous to recurrent states in deterministic dynamical systems. The modification made to the original P system gives rise to a new class of P systems with the property that their computations need to be robust against random mutations. Another application is the pathway identification problem, where a metabolite graph is constructed from information about biochemical reactions available in public databases. The invariant distribution of this graph, properly interpreted as a Markov chain, should allow to search pathways more efficiently than current algorithms. Such automatic pathway calculations can be used to derive appropriate P system models of metabolic processes.
A new library of HEMET model: Insulin effects on hepatic metabolism
Authors: A. Cutrone, C. De Maria, B. Vinci, F. Vozzi, A. Ahluwalia, G. Vozzi
Venue: Computer Methods and Programs in Biomedicine (2009)

Prediction and simulation of cell culture behaviour, under different chemical and physical stimuli by a mathematical model, represent an innovative way to create a virtual cell laboratory, where it is possible to perform and optimize experimental protocol, saving time and money. In silico experiments permit to reproduce pathological and physiological situations and make toxicological tests. In this paper we introduce a new library of HEMET (HEpatocyte METabolism) software that allows the insulin effects on hepatic metabolism to be simulated. This new set of nonlinear differential equations, derived from biochemical reactions which involve this pancreatic hormone, allows the catabolites concentration in hepatic cell culture after insulin infusion to be predicted. The validation procedures were carried out using data obtained from specifically designed cell experiments and from literature. A user friendly interface allows to easily change model parameters, rate constants and inputs simulating a wide range of physiological and pathological scenarios.
Concept-based optimization
Authors: Xiaolong Tang, Jaakko Järvi
Venue: Proceedings of the 2007 Symposium on Library-Centric Software Design (2007)

Production compilers' optimizers typically operate at low abstraction levels, transformation rules enacting on operations on built-in types only. Transformations at higher levels of abstraction, on operations of types defined in libraries or by the user, are typically not supported. Such high-level optimizations could, however, yield greater benefits than first lowering the abstractions and subjecting the result to low-level transformations. Built-in compiler optimizations can in principle apply to user-defined types, if those types possess properties that guarantee that the optimizing transformations preserve the meaning of the program. The problem is conveying this information to the compiler in a non-disruptive manner. This article describes a framework for specifying and implementing generic "concept-based optimizations." The framework is based on careful categorization, applying the generic programming paradigm, of the algebraic properties that justify particular optimizing transformations. Our framework is built on top of ConceptGCC, a compiler implementing the new language features concept and concept map of the forthcoming standard C++. Concepts describe the syntactic and semantic properties of classes of types, for which generic semantics-preserving transformations can be defined. Concept maps establish memberships to these classes, enabling the generic optimizations for specific user-defined types.
Distributed Control of Multi-robot Formation Based on Spatially Interconnected Model
Authors: Hui Li, Qing-he Wu, Huang Huang
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

This paper addresses the control of multi-robot formation in 2-dimension plane. Dynamic extension is used to linearize the robot’s kinematic model. Since the formation models, which use the error of robots’ real positions and speeds with respect to their desired values as the controlled valuables, are coupled systems, a spatial shift operator is introduced to model them as spatially interconnected systems. Then distributed controllers which have the same structure as the plants and will simplify the computation compared with centralized controllers are designed. The controllers are dynamic output feedback controllers and can not only stabilize the nominal formation system but also robustly stabilize a perturbed version of the system. The design procedure is presented which involve the application of convex optimization tools, i.e. linear matrix inequalities. The experimental results are simulated in MATLAB software and are confirmed with the formation of Team AmigoBot Mobile Robots.
Semantic Modelling of Collaborative Business Processes
Authors: Witold Abramowicz, Konstanty Haniewicz, Monika Kaczmarek, Dominik Zyskowski
Venue: Proceedings of the 2009 International Conference on Information, Process, and Knowledge Management (2009)

Business collaboration is a special type of a business process that involves at least two, but typically more partners and usually is described using a choreography model. The complexity of collaborative business processes causes difficulties in modelling them in a user friendly manner and even more difficulties in representing them in a machine understandable form. The main goal of this paper is to discuss the scope of the semantic support that is required for the needs of automation of collaborative business processes as well as possible benefits resulting from machine readable annotation of choreography models.
Digital Television for Mobile Devices
Authors: Jiehan Zhou, Zhonghong Ou, Mika Rautiainen, Timo Koskela, Mika Ylianttila
Venue: IEEE MultiMedia (2009)

A survey of mobile television technologies analyzes technical characteristics for each mobile TV solution, discusses specifications and standards, and presents possible future developments.
A system for teaching web engineering concepts in a supervised way using rich internet applications
Authors: Sara Comai, Juan Carlos Preciado, Marino Linaje, Guadalupe Ortiz, Fernando Sanchez-Figueroa
Venue: International Journal of Learning Technology (2009)

In the past, different methodologies have been proposed to systematise web development processes. Some of them are supported by Computer Aided Software Engineering (CASE) tools that help the user in all or part of the phases of application development. A number of these tools are used with the didactic aim of teaching the development process of web applications. Nevertheless, to our knowledge, the currently available CASE tools neither support the online cooperative design nor allow the modelling of a process with the supervision of a teacher. In this paper, we present a system for teaching web engineering concepts based on Rich Internet Applications (RIAs), i.e., web applications with multimedia, high levels of interactivity and collaborative work support. The proposed tool allows different modellers to design web applications in a cooperative and supervised way, as well as automatically generate its code.
Resiliency in Elemental Computing
Authors: Joseph Hassoun
Venue: Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications (2009)

This presentation describes a new reconfigurable architecture that lends itself to parallelizable applications such as Software-Defined Radio, while providing a new level of reliability, called resiliency. The architecture is called an Elemental Computing Array (ECA). At run time, code is dynamically placed into the ECA elements to work around defects on a device whether they were fabrication defects or came about later due to device wear out. Resiliency extends the useful lifetime of products and allows for graceful system degradation instead of catastrophic failure. The ECA combines four computational styles: sequential, data-flow, message-passing, and DMA in a rapidly-reconfigurable distributed system on a chip.Also covered will be a description of the implementation of key algorithms of Orthogonal Frequency-Division Multiplexing (OFDM) on the new ECA reconfigurable architecture. OFDM is an essential technology for current and next generation standards such as 3G/4G, WiMax, and digital broadcasting standards. The implementation of these kinds of standards on the ECA architecture will be covered, as well as implementation of compute-intensive smart antenna techniques such as beamforming, MIMO, and maximum likelihood (ML) detection. 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
vi(1) Tips,: Essential vi/vim Editor Skills
Authors: Jacek Artymiak
Venue:  (2008)

No Unix-class system administrator or user will get far without learning the basics of vi(1), the widespread visual text-mode editor. Learning it has just gotten easier with "vi(1) Tips," the first book on vi(1) that doesn't scare the reader with unfamiliar terminology. We designed this book to get you up to speed with vi(1) in the least possible amount of time. And yes, the skills you learn in this book can be applied to all vi(1) implementations, including vim.
Wi-Fi based radio map for location sensing by hypothesizing existence of barriers
Authors: Masaaki Kuwabara, Nobuhiko Nishio
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

Location-aware services using mobile devices have become popular and many WiFi-based location systems have been developed. Position estimation algorithms in radio waves often use radio maps in order to achieve accurate positioning. Widespread use of WiFi-based location systems requires radio maps precisely representing the actual radio conditions at low cost. We propose an algorithm for making precise radio maps by hypothesizing the existence of barriers. The algorithm we propose can adopt training data collected by many common training methods. This algorithm combines training data and location information of access points in order to infer accurate radio conditions. We explain how the algorithm works when used with training data obtained from an Autonomous Acquision Mechanism. We evaluated and confirmed the utility of our radio map using a particle filter method.
Applying Modular Decomposition to Parameterized Cluster Editing Problems
Authors: F&#x00e1;bio Protti, Maise Dantas da Silva, Jayme Luiz Szwarcfiter
Venue: Theory of Computing Systems (2008)

A graph G is said to be a bicluster graph if G is a disjoint union of bicliques (complete bipartite subgraphs), and a cluster graph if G is a disjoint union of cliques (complete subgraphs). In this work, we study the parameterized versions of the NP-hard Bicluster Graph Editing and Cluster Graph Editing problems. The former consists of obtaining a bicluster graph by making the minimum number of modifications in the edge set of an input bipartite graph. When at most k modifications are allowed (Bicluster(k) Graph Editing problem), this problem is FPT, and can be solved in O(4 k nm) time by a standard search tree algorithm. We develop an algorithm of time complexity O(4 k +n+m), which uses a strategy based on modular decomposition techniques; we slightly generalize the original problem as the input graph is not necessarily bipartite. The algorithm first builds a problem kernel with O(k 2) vertices in O(n+m) time, and then applies a bounded search tree. We also show how this strategy based on modular decomposition leads to a new way of obtaining a problem kernel with O(k 2) vertices for the Cluster(k) Graph Editing problem, in O(n+m) time. This problem consists of obtaining a cluster graph by modifying at most k edges in an input graph. A previous FPT algorithm of time O(1.92 k +n 3) for this problem was presented by Gramm et&#x00a0;al. (Theory Comput. Syst. 38(4), 373&#x2013;392, 2005, Algorithmica 39(4), 321&#x2013;347, 2004). In their solution, a problem kernel with O(k 2) vertices is built in O(n 3) time.
The use of computer technology in Magicam slave camera systems
Authors: Dan Slater, Rob King, John Gale
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

With both the complexity of motion picture scenery and costs increasing, the motion picture industry is looking for cost effective methods to produce the desired film images. One approach is to inset actors into miniature sets. Maintaining correct perspective relationships between the scene components is critical to the illusion. Magicam has developed a unique system which automatically maintains a real time perspective match between scene components under dynamic conditions. This unit in essence simulates a 6 degree of freedom pantograph coupling 2 cameras at different scene scale factors.
Innovative applications of computer science
Authors: Bertram Raphael
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

For many years much of the research frontier of computer science as represented, for example, by the activities of artificial intelligence laboratories, seemed preoccupied with esoteric mathematical studies (such as self organizing systems, algebraic theory of machines, or resolution theorem proving), "toy" systems (such as games, puzzles, children's blocks), or far-out science fiction goals (such as robots for space exploration). Now many of these same laboratories are applying the techniques they have developed in the past to important, short term, real world tasks---and uncovering significant new research problems in the process. By working in new interdisciplinary teams, the computer scientists and the applications specialists have begun to develop an evolving series of novel systems whose potential value to our society is tremendous.
Personalized MTV Affective Analysis Using User Profile
Authors: Shiliang Zhang, Qingming Huang, Qi Tian, Shuqiang Jiang, Wen Gao
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

At present, MTV has become an important favorite pastime to people. Affective analysis which can extract the affective states contained in MTVs could be a potential and promising solution for efficient and intelligent MTV access. One of the most challenging and insufficiently covered problems of affective analysis is that affective understanding is personal and various among users. Consequently, it is meaningful to develop personalized affective modeling technique. Because user's feedbacks and descriptions about affective sates provide valuable and relatively reliable clues about user's personal affective understanding, it is supposed to be reasonable to conduct personalized affective modeling by analyzing the affective descriptions recorded in user profile. Utilizing the user profile, we propose a novel approach combining support vector regression and psychological affective model to achieve personalized affective analysis. The experimental results including both user study and comparisons between current approaches illustrate the effectiveness and advantages of our proposed method.
A Domain-Based Trust Model in Peer-to-Peer Environment
Authors: Fen Xu, Yajun Guo
Venue: International Journal of Distributed Sensor Networks (2009)

In large scale peer-to-peer networks, it is difficult to establish the trust relationship between peers as it is less likely that repeatable interactions will occur with the same peer. So the network is vulnerable to malicious peers. In order to settle the problem, a novel domain-based trust model is proposed in this paper. This model can be used to deal with trust relationship between the entities in peer-to-peer environment and help peer-to-peer entities make trust choice. Select a node whose performance is the optimal as a super-node in each domain of nodes. Some information of nodes in this domain is stored in super-nodes. There are a lot of this kind of domains in the whole peer-to-peer structure, and super-nodes in each domain are connected in the form of the pure peer-to-peer structure in the overall structure. This model divides the trust relationships between entities into a trust relationship in domain and the trust relationship between domains which are dealt with in a different way. This model can evaluate the trust relationship between the entities more accurately, thus can solve security issues more effectively in the peer-to-peer environment. We present the implementing process of this model, and propose several formulae to respectively calculate the trust value in the domain and the trust value between domains. Furthmore, the simulation and analyses show that this model can get more real trust value at the small price, and the advantages of the model are simple structure and high reliability. In conclusion, we propose a novel domain-based trust model based on the super-node network architecture. The structure of this model is very simple. The model is very easy to be accepted by users and is suitable for many kinds of peer-to-peer application environments. The trust relationships between entities are divided into trust relationship in the domain and a trust relationship between domains in the model. For the different trust relationships, we use the different calculation method to assure the real-time performance, accuracy, integrity, and calculation efficiency of the trust value. In future, we will make much more specific definition and description for this model such as updating the strategy of the trust value and so on. We will also incorporate intrusion tolerant intelligence in this model, so that nodes are able to detect false information sent by any malicious node.
Memetic Simulated Annealing for the GPS Surveying Problem
Authors: Stefka Fidanova, Enrique Alba, Guillermo Molina
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

In designing Global Positioning System (GPS) surveying network, a given set of earth points must be observed consecutively (schedule). The cost of the schedule is the sum of the time needed to go from one point to another. The problem is to search for the best order in which this observation is executed. Minimizing the cost of this schedule is the goal of this work. Solving the problem for large networks to optimality requires impractical computational times. In this paper, several Simulated Annealing (SA) algorithms are developed to provide near-optimal solutions for large networks with bounded computational effort.
Parakeet: a demonstration of speech recognition on a mobile touch-screen device
Authors: Keith Vertanen, Per Ola Kristensson
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

We demonstrate Parakeet -- a continuous speech recognition system for mobile touch-screen devices. Parakeet's interface is designed to make correcting errors easy on a handheld device while on the move. Users correct errors using a touch-screen to either select alternative words from a word confusion network or by typing on a predictive software keyboard. Our interface design was guided by computational experiments. We conducted a user study to validate our design. We found novices entered text at 18 WPM while seated indoors and 13 WPM while walking outdoors.
Replenishment policy based on modified ant colony optimisation and statistical analysis under the pre-order penetration point
Authors: Jui-Tsung Wong, Chwen-Tzeng Su, Kuei-Hsien Chen
Venue: International Journal of Computer Mathematics (2009)

In the supply chain, most businesses in the pre-order penetration point (pre-OPP) operate under the forecast-driven mode, so that the decisions regarding inventory are made in accordance with the forecast and replenishment planning. This paper considers the stochastic dynamic lot-sizing problem of the two-phased transportation cost, service level constraint, and cash flow under a non-deterministic demand. This problem includes a nonlinear integer programming sub-problem. Therefore, this paper proposes an optimisation replenishment policy method based on modified ant colony optimisation (ACO) and response surface methodology. The main differences between the modified ACO and the traditional ACO lie in the modified update of pheromone intensity and the dynamic mutation operator. The experimental result shows that when the demand is normal distribution, the proposed approach, successfully finds the stationary point of minimum response. Besides, in the test of the algorithm solution quality, the modified ACO is better than the traditional ACO in all scenarios.
The research of heterogeneous database middleware model
Authors: Ye Xiao-Tong
Venue: Proceedings of the 3rd WSEAS international conference on Computer engineering and applications (2009)

In this paper, we present a database middleware with Agent characteristics. The middleware inherited the Agent's self-studying nature, cooperating characteristics and so on. Data query and data sharing among heterogeneous database could be achieved by the database middleware cooperation, the heterogeneous data source could be dynamically expanded and "plug and play". The middleware has been applied in the "Court Related Case Search System", and the result demonstrated it worked well.
One-round key exchange in the standard model
Authors: Colin Boyd, Yvonne Cliff, Juan M. Gonzalez Nieto, Kenneth G. Paterson
Venue: International Journal of Applied Cryptography (2009)

We consider one-round key exchange protocols secure in the standard model. The security analysis uses the powerful security model of Canetti and Krawczyk and a natural extension of it to the ID-based setting. It is shown how Key-Encapsulation Mechanisms (KEMs) can be used in a generic way to obtain two different protocol designs with progressively stronger security guarantees. A detailed analysis of the performance of the protocols is included; surprisingly, when instantiated with specific KEM constructions, the resulting protocols are competitive with the best previous schemes that have proofs only in the Random Oracle Model.