ppxscal/embedding_network huggingface dataset:
Identification of Japanese and English Script from a Single Document Page
Authors: S. Chanda, U. Pal, F. Kimura
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

In Japanese documents, a single text line of a page may contain both Japanese and English scripts. For the Optical Character Recognition of such a document page it is better to identify Japanese and English script portions at first, and then to use individual OCRs of these two scripts on their respective identified portions to get higher OCR accuracy. In this paper, an automatic technique for identification of Japanese and English script portions from a single line of a printed document page is proposed. To the best of our knowledge this is the first work of its kind. Here, at first, the document is segmented into lines and then lines are segmented into characters. In the proposed scheme, individual scripts are identified using combination of different features obtained from structural shape of characters, pitch information, topological properties, water reservoir concept etc. Based on the experiment on 11304 characters, we obtained 98.79% identification accuracy from the proposed scheme.
Global exponential periodicity and global exponential stability of a class of recurrent neural networks with various activation functions and time-varying delays
Authors: Boshan Chen, Jun Wang
Venue: Neural Networks (2007)

The paper presents theoretical results on the global exponential periodicity and global exponential stability of a class of recurrent neural networks with various general activation functions and time-varying delays. The general activation functions include monotone nondecreasing functions, globally Lipschitz continuous and monotone nondecreasing functions, semi-Lipschitz continuous mixed monotone functions, and Lipschitz continuous functions. For each class of activation functions, testable algebraic criteria for ascertaining global exponential periodicity and global exponential stability of a class of recurrent neural networks are derived by using the comparison principle and the theory of monotone operator. Furthermore, the rate of exponential convergence and bounds of attractive domain of periodic oscillations or equilibrium points are also estimated. The convergence analysis based on the generalization of activation functions widens the application scope for the model design of neural networks. In addition, the new effective analytical method enriches the toolbox for the qualitative analysis of neural networks.
Multimedia Content Transcoding for Displaying Space Synchronization on Web Browser
Authors: Daehyuck Park, Euisun Kang, Younghwan Lim
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

This paper suggests how to convert existing Multimedia Learning Titles into independent Multimedia Learning Title platform by using XML DB. It stores resource information that takes care of large amount of interactive Multimedia Learning resources. In existing Multimedia Learning Titles, that resource information is divided and stored at multiple locations, but it store and manage the information in a database. Also internet browsers are used to play those titles regardless of which platform those are played, so there are no needs for dedicated Multimedia Learning players. As a result of this research, Multimedia Learning Titles can be played in various environments, like local terminal and server, without computer specification limitations.
Artificial intelligence and natural magic
Authors: Noel Sharkey, Amanda Sharkey
Venue: Artificial Intelligence Review (2006)

Robotics with AI is part of a long tradition that has run from ancient times that treated the precursors of robots, the automata, as part of Natural Magic or conjury. Deception is an integral part of AI and robotics; in some ways they form a science of illusion. There are many robot tasks, such as caring for the elderly, minding children, doing domestic chores and being companionable, that involve working closely with humans and so require some illusion of animacy and thought. We discuss how the natural magic of robotics is assisted by the cultural myth of AI together with innate human predispositions such as zoomorphism, the willing suspension of disbelief and a tendency to interpret AI devices as part of the social world. This approach provides a justifiable way of meeting the goals of AI and robotics provided that researchers do not allow themselves to be deceived by their own illusions.
Role of a Historian in a Database Management System
Authors: L. J. Bass
Venue: IEEE Software (1987)

Traditionally, a database manager tracks only transactions an insufficient way to maintain a complete history. This multilevel system tracks three history levels: character, transaction, and global action.
Interval based off-line clock synchronization for wireless mesh networks
Authors: Georg Lukas, André Herms, Daniel Mahrenholz
Venue: ACM SIGMETRICS Performance Evaluation Review (2007)

Wireless mesh networks suffer from various problems like congestion or packet collisions. To identify and overcome these problems an exact global view of the communication is required. However, it is not possible to observe the whole network from a single location. Instead, a distributed monitoring is necessary, which has to include clock synchronization. We present a new interval-based algorithm for the off-line synchronization of passively monitored network events. It calculates the worst-case time interval for every event on a global clock, while considering inaccuracies caused by processing jitter and non-uniform clock drifts. The experimental evaluation on a live mesh network shows an accuracy of better than 130&mu;s over a four-hop distance, which is below the minimum transmission time of data packets. Thereby, our algorithm creates a highly precise global view of the network, which allows a detailed diagnosis of wireless mesh networks.
Algebraic manipulation of scientific datasets
Authors: Bill Howe, David Maier
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

We investigate algebraic processing strategies for large numeric datasets equipped with a possibly irregular grid structure. Such datasets arise, for example, in computational simulations, observation networks, medical imaging, and 2-D and 3-D rendering. Existing approaches for manipulating these datasets are incomplete: The performance of SQL queries for manipulating large numeric datasets is not competitive with specialized tools. Database extensions for processing multidimensional discrete data can only model regular, rectilinear grids. Visualization software libraries are designed to process gridded datasets efficiently, but no algebra has been developed to simplify their use and afford optimization. Further, these libraries are data dependent - physical changes to data representation or organization break user programs. In this paper, we present an algebra of grid-fields for manipulating both regular and irregular gridded datasets, algebraic optimization techniques, and an implementation backed by experimental results. We compare our techniques to those of spatial databases and visualization software libraries, using real examples from an Environmental Observation and Forecasting System. We find that our approach can express optimized plans inaccessible to other techniques, resulting in improved performance with reduced programming effort.
Methodology for long-term prediction of time series
Authors: Antti Sorjamaa, Jin Hao, Nima Reyhani, Yongnan Ji, Amaury Lendasse
Venue: Neurocomputing (2007)

In this paper, a global methodology for the long-term prediction of time series is proposed. This methodology combines direct prediction strategy and sophisticated input selection criteria: k-nearest neighbors approximation method (k-NN), mutual information (MI) and nonparametric noise estimation (NNE). A global input selection strategy that combines forward selection, backward elimination (or pruning) and forward-backward selection is introduced. This methodology is used to optimize the three input selection criteria (k-NN, MI and NNE). The methodology is successfully applied to a real life benchmark: the Poland Electricity Load dataset.
Designing Security Protocols Using Novel Neural Network Model
Authors: Tieming Chen, Rongrong Jiang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Two neural networks with the common input vector can finally synchronize their weight vectors by output-based mutual learning. It can be well utilized to negotiate secure information over a public channel. Designing security protocols based on such synchronized neural network model is quite advantageous for its low-cost and high-performance. In this paper, we at first analyze and optimize the interacting network neurl, then present a cryptography-oriented secure parity model and implement the performance simulations. As an instance, a novel key agreement protocol design scenario is finally proposed.
Response Inversion Scan Cell (RISC): A Peak Capture Power Reduction Technique
Authors: Bo-Hua Chen, Wei-Chung Kao, Bing-Chuan Bai, Shyue-Tsong Shen, James C. -M. Li
Venue: Proceedings of the 16th Asian Test Symposium (2007)

This paper presents a Response Inversion Scan Cell (RISC) technique to reduce the peak capture power in test mode. The RISC technique inverts the data input of selected scan cells so that peak capture power is reduced. According to the experimental data on ISCAS'89 benchmark circuits, the RISC technique effectively reduces the peak capture power by 45% at a cost of 7.6% area overhead. The presented technique requires minimum change in the existing design for testability (DFT) methodology and it does not degrade fault coverage. The RISC technique is validated by a chip experiment on a 0.18 ìm low power design.
Solving a system of the nonlinear equations by iterative dynamic programming
Authors: S. Effati, H. Roohparvar
Venue: Journal of Applied Mathematics and Computing (2007)

In this paper we use iterative dynamic programming in the discrete case to solve a wide range of the nonlinear equations systems. First, by defining an error function, we transform the problem to an optimal control problem in discrete case. In using iterative dynamic programming to solve optimal control problems up to now, we have broken up the problem into a number of stages and assumed that the performance index could always be expressed explicitly in terms of the state variables at the last stage. This provided a scheme where we could proceed backwards in a systematic way, carrying out optimization at each stage. Suppose that the performance index can not be expressed in terms of the variables at the last stage only. In other words, suppose the performance index is also a function of controls and variables at the other stages. Then we have a nonseparable optimal control problem. Furthermore, we obtain the path from the initial point up to the approximate solution.
Dynamic Conditional Random Fields: Factorized Probabilistic Models for Labeling and Segmenting Sequence Data
Authors: Charles Sutton, Andrew McCallum, Khashayar Rohanimanesh
Venue: The Journal of Machine Learning Research (2007)

In sequence modeling, we often wish to represent complex interaction between labels, such as when performing multiple, cascaded labeling tasks on the same sequence, or when long-range dependencies exist. We present dynamic conditional random fields (DCRFs), a generalization of linear-chain conditional random fields (CRFs) in which each time slice contains a set of state variables and edges---a distributed state representation as in dynamic Bayesian networks (DBNs)---and parameters are tied across slices. Since exact inference can be intractable in such models, we perform approximate inference using several schedules for belief propagation, including tree-based reparameterization (TRP). On a natural-language chunking task, we show that a DCRF performs better than a series of linear-chain CRFs, achieving comparable performance using only half the training data. In addition to maximum conditional likelihood, we present two alternative approaches for training DCRFs: marginal likelihood training, for when we are primarily interested in predicting only a subset of the variables, and cascaded training, for when we have a distinct data set for each state variable, as in transfer learning. We evaluate marginal training and cascaded training on both synthetic data and real-world text data, finding that marginal training can improve accuracy when uncertainty exists over the latent variables, and that for transfer learning, a DCRF trained in a cascaded fashion performs better than a linear-chain CRF that predicts the final task directly.
Tracing variations in software product families
Authors: Kannan Mohan, Balasubramaniam Ramesh
Venue: Communications of the ACM (2007)

When one size doesn't fit all, what type of knowledge best helps manage variability in product family engineering?
Cognitive Social Simulation Incorporating Cognitive Architectures
Authors: Ron Sun
Venue: IEEE Intelligent Systems (2007)

Agent-based social simulation with multiagent systems--an important aspect of social computing--can benefit from incorporating cognitive architectures, which provide a realistic basis for modeling individual agents and therefore their social interactions. A cognitive architecture is a domain-generic computational cognitive model that may be used for a broad (multiple-domain) analysis of individual behavior. This article gives an example of a cognitive architecture called Clarion and presents three case studies demonstrating its application to social simulation. This article is part of a special issue on social computing.
Comparison of Structural Test Coverage Metrics
Authors: M. D. Weiser
Venue: IEEE Software (1985)

Empirically comparing structural test coverage metrics reveals that test sets that satisfy one metric are likely to satisfy metric as we.
Designing usable interface for navigating mobile chat messages
Authors: Daniel Kuen Seong Su, Victoria Siew Yen Yee
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

There has been little design consideration given to ease the navigation through a long chat archive in a limited screen display. By incorporating graphical and user-centered design, messages can be presented in logical grouping for navigation ease and efficient tracking of specific messages in a long chat archive. This paper explores usable interface design for mobile group chat systems via navigation and visualisation to track messages that results in minimal key-pressed and fast message retrieval. Additionally, we incorporate avatars and emoticon in user identification and human embodiment to facilitate ease of understanding of the messages' contents
An approach to developing complex database schemas using form types
Authors: Ivan Luković, Pavle Mogin, Jelena Pavićević, Sonja Ristić
Venue: Software&mdash;Practice Experience (2007)

In this paper we consider an approach to developing complex database schemas. Apart from the theoretical model of the approach, we also developed a CASE tool named Integrated Information Systems*Case, R.6.2 (IIS*Case) that supports the practical application of the approach. In this paper the basis of our approach to the design and integration of database schemas and ways of using IIS*Case is outlined. The main features of a new version of IIS*Case, developed in Java, are described. IIS*Case is based on the concept of &lsquo;form type&rsquo; and supports the conceptual modelling of a database schema, generating subschemas and integrating them into a relational database schema in 3NF. IIS*Case provides an intelligent support for complex and highly formalized design and programming tasks. Having an advanced knowledge of information systems and database design is not a compulsory prerequisite for using IIS*Case. IIS*Case is based on a methodology of gradual integration of independently designed subschemas into a database schema. The process of independent subschema design may lead to collisions in expressing real-world constraints. IIS*Case uses specialized algorithms for checking the consistency of constraints embedded in a database schema and its subschemas. This paper briefly outlines the application of the process of detecting collisions, and actions the designer may take to resolve them. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Adding Value to TCP/IP Based Information exchange Security by Specialized Hardware
Authors: Vuka!sin Pejovic, Slobodan Bojanic, Carlos Carreras
Venue: Proceedings of the The International Conference on Emerging Security Information, Systems, and Technologies (2007)

Complexity of the attack space existent within the scope TCP/IP based communications makes the security problem extremely wide. Most of the transmitted data has to be processed on a daily basis by firewalls, IDSes and/or other security enforcing technologies. It is possible, however, to divide the complex security threat space and provide fast and efficient solutions to deal with some subspaces. This would reallocate the processing into specialised devices and would take some processing burden off the stated conventional technologies. A specialised hardware architecture capable of sustaining high throughput rates of up to 40 Gbps when implemented in an FPGA platform will serve as one such example. In its current development phase the hardware solution presented processes and verifies the TCP/IP specific reassembly mechanism. The misuse of the reassembly mechanism has historically led to different types of security breaches while new instances can arise unexpectedly. The presented work can be seen as a systemic solution for the monitoring of the misuse of the reassembly mechanism for preventive perspective.
CASS: A Context-Aware Simulation System for Smart Home
Authors: JoonSeok Park, Mikyeong Moon, Seongjin Hwang, Keunhyuk Yeom
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Ubiquitous computing (ubicomp) environments provide access to information and computing resources for users at any time and anywhere. In the approaching ubiquitous ear, many self-adaptive applications are emerging. These can be made to adapt to the environment within which the application operates. Context information is the key to producing self-adaptive applications in ubicomp environments. However, the supporting infrastructure that generates context information can be made dynamically responsive to the environment. Therefore, for the development of self-adaptive applications, it is necessary to demonstrate that valid context information can be created by virtual sensors instead of physical sensors. In this paper we present a context aware simulation system called CASS. In particular, it generates the context information associated with virtual sensors and virtual devices in a smart home domain. By using CASS, the self-adaptive application developer can immediately detect rule conflict in context information and determine optimal sensors and devices in a smart home.
Tutorial Series 9 Operating Systems
Authors: D. A. Anderson
Venue: Computer (1981)

Research during the last decade has revealed techniques by which future operating systems can avoid the problems associated with previous and present systems.
An automated model-based debugging approach
Authors: Cemal Yilmaz, Clay Williams
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Program debugging is a difficult and time-consuming task. Our ultimate goal in this work is to help developers reduce the space of potential root causes for failures, which can, in turn, improve the turn around time for bug fixes. We propose a novel and very different approach. Rather then focusing on how a program behaves by analyzing its source code and/or execution traces, we concentrate on how it should behave with respect to a given behavioral model. We identify and verify slices of the behavior model, that, once implemented wrong in the program, can potentially lead to failures. Not only do we identify functional differences between the programand its model, but we also provide a ranked list of diagnoses which might explain (or be associated with) these differences. Our experiments suggest that the proposed approach can be quite effective in reducing the search space for potential root causes for failures
Structuring Software Cities A Multidimensional Approach
Authors: Andreas Hess, Bernhard Humm, Markus Voss, Gregor Engels
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

Software cities alias application landscapes of large enterprises comprise tens or even hundreds of IT applications. Structuring software cities into domains is an important task of enterprise architects. The quality of the resulting domain model is crucial for the success of enterprise architecture management and an important tool for the governance of the development of an enterprise's application landscape. This paper presents a novel method for constructing domain models based on business services, business objects, and business dimensions. The method has been validated in numerous industrial projects.
Experiences with a Grid Gateway Architecture Using Virtual Machines
Authors: David Bannon, Rajesh Chhabra, Paul Coddington, Daniel Cox, Frank Crawford, Rhys Francis, Gerson Galang, Graham Jenkins, Marco La Rosa, Steve McMahon, Terry Rankine, Robert Woodcock, Ashley Wright
Venue: Proceedings of the 2nd International Workshop on Virtualization Technology in Distributed Computing (2006)

The Australian Partnership for Advanced Computing (APAC) began developing the APAC National Grid in 2004. The APAC Grid integrates several partner sites, most of which have multiple compute resources. Different APAC grid application projects require different grid middleware systems, including GT2, GT4 and LCG. In order to provide these different systems to interface to different resources at each site, it was decided to provide a single, standard grid gateway machine at each site, and to use Xen to provide a number of virtual machines to run the different grid middleware stacks, as well as other services such as grid portals and data management. In this paper we discuss the design of this system, and our experiences in deploying and using virtual machines on a single grid gateway machine for interfacing to multiple clusters at a site.
Research on Information Retrieval Based on Keywords Relationship and Past Retrieval Records in P2P Networks
Authors: Xianfu Meng, Yue Gong
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Due to the inability of traditional keyword-based retrieval using semantic meaning in Peer-to-Peer networks, large bandwidth is wasted; meanwhile desirable information is still far beyond the search results most algorithms could gain. How to locate the needed peer accurately and how to obtain requested information rapidly are important issues. In this paper, through an automatic study mechanism toward a series of keywords inputted by user's operation and past retrieval information tracking, an algorithm used to dynamically build the keyword semantic relationship table and to generate the index table of the keywords and their corresponding peers is proposed. The utilization of these tables promotes the accuracy in locating the needed peers and the efficiency in retrieving information. By assistance of feedback mechanism, knowledge is advanced to share within the interest domain. We also present the experiment and results prove efficiency and low-cost of the algorithm.