ppxscal/embedding_network huggingface dataset:
NeuroOracle: Integration of Neural Networks into an Object-Relational Database System
Authors: Erich Schikuta, Paul Glantschnig
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

Many different approaches for the modeling of neural networks were presented in the literature (e.g. [4]). Generally the object-oriented approach proved itself as most appropriate. It provides a concise but comprehensive framework for the design of neural networks in terms of its static and dynamic components, i.e. the information structure and its methods in the object-oriented notion.This paper presents a framework for the conceptual and physical integration of neural networks into object-relational database systems. The static components comprise the structural parts of a neural network, as the neurons and connections, higher topological structures as layers, blocks and network systems. The dynamic components are the behavioral characteristics, as the creation, training and evaluation of the network. Finally the implementation of the new NeuroOracle system based on the proposed framework is presented.
Adaptive Congestion Control in Computer Networks
Authors: Magdalena Turowska
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

The congestion control in computer network is a problem of controlling a specific object such as a computer network. Several attempts have been made to develop congestion controllers, mostly using linear control theory. The conventional controller PID generally does not work well for nonlinear, uncertain, and time-delayed systems as computer networks. The paper provides an adaptation mechanism designed to prevent unstable behavior of the system, with fuzzy rules, and with an inference mechanism that identifies the possible sources of nonlinear behavior. The adaptation mechanism is designed to adjust PID controller tuning parameters when oscillatory behavior is detected. Tests in nonlinear and uncertainty conditions are performed.
Toward a model of children's information seeking behavior in using digital libraries
Authors: Dania Bilal, Sonia Sarangthem, Imad Bachir
Venue: Proceedings of the second international symposium on Information interaction in context (2008)

This paper presents an empirical model of Arabic-speaking children's interaction with the International Children's Digital Library (ICDL). The model is based on data collected from ten children ages 6--10 who interacted with the ICDL to find information for assigned and self-generated tasks. Two contexts influenced children's information seeking behavior: 1. the non-naturalistic laboratory environment where they used the ICDL as volunteers rather than as part of their everyday life or as a requirement for an assignment, and 2. the international and multicultural nature of the ICDL that provided access to an Arabic book collection, but did not support analytical searching in Arabic. The model presents 7 modes that characterized children's information seeking behavior and the range of moves associated with them. Underlying the behavior is the children's information need and their affective states that consisted of uncertainty and anxiety in the beginning and certainty and satisfaction upon completing the tasks.
The Natural Truth: The Contribution of Vision and Touch in the Categorisation of "Naturalness"
Authors: T. Aisling Whitaker, Cristina Simões-Franklin, Fiona N. Newell
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

Being able to readily discriminate between natural things and synthetic mimics in our environment is an important ability for many species. Making these judgements relies on the acuity of our different senses. Here, we investigated the relative contribution of visual and tactile cues, alone or in combination, to the categorisation of wood and fabric stimuli as natural or unnatural. For both wood and fabric stimuli we found that natural and unnatural stimuli could be discriminated, although performance varied as a function of modality. Specifically, for the wood stimuli, performance was better when vision and touch were combined, whereas for the fabric stimuli, performance was least accurate when using touch alone, compared to the visual or bimodal conditions, which were quantitatively similar. We concluded that both vision and touch contribute, albeit in qualitatively different ways, to the perception of "naturalness", and that a combination of these modalities facilitates this perception.
Numberings Optimal for Learning
Authors: Sanjay Jain, Frank Stephan
Venue: Proceedings of the 19th international conference on Algorithmic Learning Theory (2008)

This paper extends previous studies on learnability in non-acceptable numberings by considering the question: for which criteria which numberings are optimal, that is, for which numberings it holds that one can learn every learnable class using the given numbering as hypothesis space. Furthermore an effective version of optimality is studied as well. It is shown that the effectively optimal numberings for finite learning are just the acceptable numberings. In contrast to this, there are non-acceptable numberings [3] which are optimal for finite learning and effectively optimal for explanatory, vacillatory and behaviourally correct learning. The numberings effectively optimal for explanatory learning are the K-acceptable numberings. A similar characterization is obtained for the numberings which are effectively optimal for vacillatory learning. Furthermore, it is studied which numberings are optimal for one and not for another criterion: among the criteria of finite, explanatory, vacillatory and behaviourally correct learning all separations can be obtained; however every numbering which is optimal for explanatory learning is also optimal for consistent learning.
Fostering associations in Africa through networking
Venue: Information Polity (1999)

The use of electronic communications technology within the developing world context brings forth challenges that may potentially unleash the power of society by fostering networking amoung experts and their organisations. The subject of this paper is a particular form of networking, that of building associations among civil servants involved in public administration reform. The inception of one such association, GOVERNET, an administrative reform network is explored in the context of public administration reform in Africa. This paper concludes with insight into the salient issues driving this form of networking.
Time Orientation Device for Special Education
Authors: José M. Falcó, Álvaro Marco, Ángel Asensio, Rubén Blasco, Roberto Casas, Joaquín Ezpeleta
Venue: Proceedings of the 1st world summit on The Knowledge Society: Emerging Technologies and Information Systems for the Knowledge Society (2008)

Time understanding and its measurement could be a challenge for people with some cognitive impairment. In this paper, a second iteration of a Temporal Orientation Device (TOD) designed for helping that people in understanding the sense of time is showed. TOD is an electronic panel which first version was tested in special education classrooms and the results of the evaluation allowed authors to improve the design. The new concept separates electronic tasks--turning on/off colour leds--from intelligence tasks--scheduling children activities--in order to make it easier to use TOD for teachers with low informatics skills. To be accessible via internet, Google Calendar compatibility has been added.
Self-certified Signatures Based on Discrete Logarithms
Authors: Zuhua Shao
Venue: Proceedings of the 1st international workshop on Arithmetic of Finite Fields (2007)

In the trivial PKI, a digital signature provides the authenticity of a signed message with respect to a public key, while the authenticity of the public key with respect to a signer lies on a certificate provided by a certificate authority. To verify a signature, verifiers have to first verify the corresponding certificate. To avoid this burden, in this paper, we propose a self-certified signature scheme based on discrete logarithms to provide an implicit as well as mandatory verification of public keys. We show that this new scheme can achieve strong unforgeability in the random oracle model.
On the Calibration of Non Single Viewpoint Catadioptric Sensors
Authors: Alberto Colombo, Matteo Matteucci, Domenico G. Sorrenti
Venue: RoboCup 2006: Robot Soccer World Cup X (2006)

A method is proposed for calibrating Catadioptric Omni-directional Vision Systems. This method, similarly to classic camera calibration, makes use of a set of fiducial points to find the parameters of the geometric image formation model. The method makes no particular assumption regarding the shape of the mirror or its position with respect to the camera. Given the camera intrinsic parameters and the mirror profile, the mirror pose is computed using the projection of the mirror border and, eventually, the extrinsic parameters are computed by minimizing distance between fiducial points and back-projected images.
Adaptive Face Recognition System Using Fast Incremental Principal Component Analysis
Authors: Seiichi Ozawa, Shaoning Pang, Nikola Kasabov
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

In this paper, a novel face recognition system is presented in which not only a classifier but also a feature space is learned incrementally to adapt to a chunk of incoming training samples. A distinctive feature of the proposed system is that the selection of useful features and the learning of an optimal decision boundary are conducted in an online fashion. In the proposed system, Chunk Incremental Principal Component Analysis (CIPCA) and Resource Allocating Network with Long-Term Memory are effectively combined. In the experiments, the proposed face recognition system is evaluated for a self-compiled face image database. The experimental results demonstrate that the test performance of the proposed system is consistently improved over the learning stages, and that the learning speed of a feature space is greatly enhanced by CIPCA.
Fast pre-conditioned iterative algorithms for tomographic image reconstruction
Authors: Yibin Zheng
Venue:  (2008)

Tomography has been widely used in medical imaging, electron microscopy, geophysics and many other areas in the past decades. The iterative reconstruction approach is a powerful tool for tomographic imaging especially when analytical solution is not available. We propose pre-conditioning techniques in this research to substantially accelerate traditional additive block-iterative algorithms and achieve better reconstructed image quality. We first generalize a class of existing iterative algorithms to a uniform formulation called the Generalized Simultaneous Algebraic Reconstruction Technique (GSART). With appropriately chosen conditioning matrices, a priori image modeling and system geometric information can be easily incorporated in GSART. Then we propose a more general iterative formula in order to utilize existing but inaccurate analytical solutions as approximate inverse operators in the iteration process to achieve faster convergence and better image quality. An adaptive relaxation coefficient is also introduced to further accelerate the convergence and release tomography reconstruction researchers from trial-and-error search of the best step size. Promising results have been obtained in X-ray CT simulations.Possible applications of the proposed pre-conditioned algorithms in diagnostic imaging modalities are studied. In both half-cone pinhole SPECT and ultrasonic imaging, the pre-conditioned iterative algorithms demonstrate substantial improvement in both reconstruction speed and image quality against traditional methods, proving themselves of great promise for clinical and pre-clinical research applications.
The changing usage of a mature campus-wide wireless network
Authors: Tristan Henderson, David Kotz, Ilya Abyzov
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

Wireless Local Area Networks (WLANs) are now commonplace on many academic and corporate campuses. As ''Wi-Fi'' technology becomes ubiquitous, it is increasingly important to understand trends in the usage of these networks. This paper analyzes an extensive network trace from a mature 802.11 WLAN, including more than 550 access points and 7000 users over seventeen weeks. We employ several measurement techniques, including syslog messages, telephone records, SNMP polling and tcpdump packet captures. This is the largest WLAN study to date, and the first to look at a mature WLAN. We compare this trace to a trace taken after the network's initial deployment two years prior. We found that the applications used on the WLAN changed dramatically, with significant increases in peer-to-peer and streaming multimedia traffic. Despite the introduction of a Voice over IP (VoIP) system that includes wireless handsets, our study indicates that VoIP has been used little on the wireless network thus far, and most VoIP calls are made on the wired network. We saw greater heterogeneity in the types of clients used, with more embedded wireless devices such as PDAs and mobile VoIP clients. We define a new metric for mobility, the ''session diameter''. We use this metric to show that embedded devices have different mobility characteristics than laptops, and travel further and roam to more access points. Overall, users were surprisingly non-mobile, with half remaining close to home about 98% of the time.
Shape Learning with Function-Described Graphs
Authors: Gerard Sanromà, Francesc Serratosa, René Alquézar
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

A new method for shape learning is presented in this paper. This method incorporates abilities from both statistical and structural pattern recognition approaches to shape analysis. It borrows from statistical pattern recognition the capability of modelling sets of point coordinates, and from structural pattern recognition the ability of dealing with highly irregular patterns, such as those generated by points missingness. To that end we use a novel adaptation of Procrustes analysis, designed by us to align sets of points with missing elements. We use this information to generate sets of attributed graphs (AGs). From each set of AGs we synthesize a function-described graph (FDG), which is a type of compact representation that has the capability of probabilistic modelling of both structural and attribute information. Multivariate normal probability density estimation is used in FDGs instead of the originally used histograms. Comparative results of classification performance are presented of structural vs. attributes + structural information.
Power/thermal modeling and dynamic thermal management for sram structure
Authors: Jun Yang, Sheldon X.-D. Tan
Venue:  (2008)

As the technology scaling approaches to the nanometer scale, high performance micro-processors evolution are hindered by many challenges. Among them, the large leakage power and high run-time temperature are major issues for designers to deal with. Large power density increases the temperature dramatically, and high temperature will increase the leakage power in exponential rate in return. Without efficiently control the temperature, the processor will soon be shut down to avoid permanent physical damage. Further more, the process variation due to the inability to control the fabrication process has put an extra burden for designer to correctly estimate their optimization. This dissertation proposes to provide a power/thermal evaluation platform for modern microprocessors at the micro-architecture level. And it also proposes to provide two low power, low temperature and high reliability solutions for SRAM structures. As these function units are found to be power hungry and thermal dangerous in the chip. In particular, this dissertation presents the following studies and designs. On a real Pentium 4 processor, a set of methodology is presented to evaluate the run-time power consumption and temperature distribution of the CPU. By using this method, we presents extensive thermal profiles on 22 SPEC2K benchmarks. Our observations uncover some interesting new thermal features that were difficult to obtain before. Based on our observations, we proposes two dynamic management techniques to improve the power/thermal problems of two SRAM structures, one is the integer register file, and the other is level one cache. The low power register file design we proposed can reduce the leakage current on the read bitline without sacrificing the CPU performance. For the cache, we propose a dynamic subarray permutation scheme to swap the workload on a hot subarray to a cold subarray, such that the peak temperature can be reduced, and cache reliability increased as well.
Fast Code Detection Using High Speed Time Delay Neural Networks
Authors: Hazem M. El-Bakry, Nikos Mastorakis
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

This paper presents a new approach to speed up the operation of time delay neural networks for fast code detection. The entire data are collected together in a long vector and then tested as a one input pattern. The proposed fast time delay neural networks (FTDNNs) use cross correlation in the frequency domain between the tested data and the input weights of neural networks. It is proved mathematically and practically that the number of computation steps required for the presented time delay neural networks is less than that needed by conventional time delay neural networks (CTDNNs). Simulation results using MATLAB confirm the theoretical computations.
A Reorganization Strategy to Build Fault-Tolerant Multi-Agent Systems
Authors: Sehl Mellouli
Venue: Proceedings of the 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence (2007)

MAS failures are not only due to programming exceptions; they may originate from other sources such as the environment of the MAS which may influence the MAS' behavior. Furthermore, MAS fault-tolerant techniques based on agent replication cannot always be applied to a MAS. For example, it is not always possible to replicate a costly robot in a robotic MAS application. In this paper, we propose a reorganization strategy, based on both task and agent replication, to enable a MAS to detect and recover from its failures. Our strategy is different from those presented in the literature, which are based on agent replication, since it does not deal with programming faults but with failures originating from the MAS environment, and it is based on task and agent replication and not only on agent replication. Our strategy is scalable and is robust in detecting agents failure.
Industrial Realities of Program Comprehension (IRPC 2008)
Authors: Thomas Dean, Joost Visser
Venue: Proceedings of the 2008 The 16th IEEE International Conference on Program Comprehension (2008)

In the working session on Industrial Realities of Program Comprehension (IRPC 2008), experience and ideas are shared regarding the challenges and opportunities of industrial application of program comprehension techniques. Participants work together to formulate a set of useful guidelines for introducing new program comprehension techniques into industrial practice as well as consolidating and increasing their use.
On the Physical Basics of Information Flow
Authors: Carl Adam Petri
Venue: Proceedings of the 29th international conference on Applications and Theory of Petri Nets (2008)

For three years Konrad Zuse (1910 - 1995) and me, we collaborated on the idea of a Computing Universe. We both agreed that some of the main tenets of modern physics would have to be expressed, at least those of quantum mechanics and of special relativity. Discussing which tenets should be tackled, Zuse said "those which can be understood by an engineer". But many years passed before the deterministic approach of Gerard't Hooft (2002) made a complete elaboration of the originally conceived ideas possible. We follow the principles of combinatorial modelling, which is a proper synthesis of continuous and discrete modelling.
Flow shop scheduling and its extension to fuzzy processing times
Authors: Miloš Šeda
Venue: Proceedings of the 9th WSEAS International Conference on Fuzzy Systems (2008)

In this paper, two different approaches to permutation flow shop scheduling problem are investigated. The first one is based on a mixed integer programming model and is solved by an optimization package GAMS. As the problem belongs to NP-complete problems, this approach is limited to smaller instances, its reasonable bounds are indicated using benchmarks from OR-Library. For large instances, an approach using genetic algorithm is proposed including its appropriate parameter settings. Finally, a modification of the problem using uncertain processing times of jobs is presented.
Abstract Reachability Graph for Verifying Web Service Interfaces
Authors: Xutao Du, Chunxiao Xing, Lizhu Zhou
Venue: Proceedings of the 10th international conference on Software Reuse: High Confidence Software Reuse in Large Systems (2008)

Web Service Interface Control Flow Automata(WCFA) is presented to model web service interfaces. An Abstract Reachability Graph(ARG) is constructed for the composite web service based on available WCFAs. Nodes in ARG are equipped with a state formula which is an overestimation of the concrete reachable state properties. The algorithm we present to compute the ARG is a variation of the depth first search algorithm. State formulas are computed at the same time with the construction of ARG. Assertions can be made at control points(nodes)to express certain properties. A SAT solver is used to check whether assertions are logical consequences of the state formulas. Then the answer(valid or invalid) will give designers enough information to decide whether the composite web service works as intended.
Forward-Secure Proxy Signature Scheme for Multiple Proxy Signers Using Bellare-Miner Scheme with Proxy Revocation
Authors: N. R. Sunitha, B. B. Amberker
Venue: Proceedings of the 2008 The Fourth International Conference on Information Assurance and Security (2008)

A proxy signature scheme allows one user to delegate his/her signing capability to another user called a proxy signer in such a way that the latter can sign messages on behalf of the former. After verification the verifier is convinced of the original signer's agreement on the signed message. Forward-Secure signatures enable the signer to guarantee the security of messages signed in the past even if his secret key is exposed today. We propose a forward secure proxy signature scheme based on the popular Bellare-Miner Forward-secure scheme. Compared to existing schemes, the special feature of our scheme is that an original signer can delegate his signing capability to any number of proxy signers in varying time periods. Though the original signer gives proxy information to all the proxy signers at the beginning of the protocol, the proxy signers will be able to generate proxy signatures only in their allotted time periods. Further, the proxy signatures are made forward-secure. Moreover, our scheme meets the basic requirements of a proxy signature scheme along with proxy revocation. Both on-demand proxy revocation i.e. whenever the original signer wants to revoke the proxy signer and automatic proxy revocation i.e.immediate revocation after the expiry of the time period of the proxy signer, is provided. Additional properties of our scheme are as follows: identity of the proxy signer is available in the information sent by original signer to proxy signer, original signer need not send the information to proxy signer through a secure channel, warrant on the delegated messages can be specified, original signer cannot play the role of proxy signer, and verifier can determine when the proxy signature was generated.