ppxscal/embedding_network huggingface dataset:
Stochastic dynamics of a finite-size spiking neural network
Authors: Hédi Soula, Carson C. Chow
Venue: Neural Computation (2007)

We present a simple Markov model of spiking neural dynamics that can be analytically solved to characterize the stochastic dynamics of a finite-size spiking neural network. We give closed-form estimates for the equilibrium distribution, mean rate, variance, and autocorrelation function of the network activity. The model is applicable to any network where the probability of firing of a neuron in the network depends on only the number of neurons that fired in a previous temporal epoch. Networks with statistically homogeneous connectivity and membrane and synaptic time constants that are not excessively long could satisfy these conditions. Our model completely accounts for the size of the network and correlations in the firing activity. It also allows us to examine how the network dynamics can deviate from mean field theory. We show that the model and solutions are applicable to spiking neural networks in biophysically plausible parameter regimes.
Convergence of Telecommunication Network and Grid Network in Service
Authors: Peng Gao, Tao Liu, Chen Zhang, Lin Zhang
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

The diversification of data services requires the service providing of the telecom network transfers from centralization to distribution. The development of the grid network leads to the business applications of grid services. The two networks will be inevitably converged and the key of the convergence is the service integration. The concept of service was redefined according to the definition of service in the grid and the telecom fields; the service model with features of the two networks combined was proposed; the business process in the future converged environment was analyzed based on the above discussion; and an optimal convergence form---Operable TeleGrid Service Network was proposed.
Programmable Logic BIST for At-speed Test
Authors: Yu Huang, Xijiang Lin
Venue: Proceedings of the 16th Asian Test Symposium (2007)

In this paper, we propose a novel programmable logic BIST controller that can facilitate at-speed test for the design with multiple clock domains and multiple clock frequencies. Moreover, a static analysis method is also proposed to optimize the BIST test pattern allocation for testing the timing faults in different intra/inter clock domains when the maximum number of applied BIST test patterns is specified. Experimental results show the effectiveness of the proposed method on achieving higher test coverage than the method with test patterns evenly distributed among different test sessions.
A framework for pricing government e-services
Authors: Craig L. Johnson
Venue: Electronic Commerce Research and Applications (2007)

Governments are in the early stages of providing constituents with information and services online over the Internet. E-government service decisions should be rooted in solid finance principles, such as efficiency, equity and revenue adequacy. Pricing decisions should be tailored to meet the demands of particular constituent groups and the revenue needs of government. By so doing, governments can more quickly and broadly expand online service delivery and increase the net benefits to stakeholders. By segmenting e-services into government-to-citizen (G2C) and government-to-business (G2B) transactions and applying different pricing schedules for e-services with different demand elasticity's, governments can increase overall consumer surplus, while generating additional revenue.
Approximating partial derivatives of first and second order by quadratic spline quasi-interpolants on uniform meshes
Authors: Françoise Foucher, Paul Sablonnière
Venue: Mathematics and Computers in Simulation (2008)

Given a bivariate function f defined in a rectangular domain @W, we approximate it by a C^1 quadratic spline quasi-interpolant (QI) and we take partial derivatives of this QI as approximations to those of f. We give error estimates and asymptotic expansions for these approximations. We also propose a simple algorithm for the determination of stationary points, illustrated by a numerical example.
An Operational Approach to Requirements Specification for Embedded Systems
Authors: P. Zave
Venue: IEEE Transactions on Software Engineering (1982)

The approach to requirements specification for embedded systems described in this paper is called "operational" because a requirements specification is an executable model of the proposed system interacting with its environment. The approach is embodied by the language PAISLey, which is motivated and defined herein. Embedded systems are characterized by asynchronous parallelism, even at the requirements level; PAISLey specifications are constructed by interacting processes so that this can be represented directly. Embedded systems are also characterized by urgent performance requirements, and PAISLey offers a formal, but intuitive, treatment of performance.
Constructing the Call Graph of a Program
Authors: B. G. Ryder
Venue: IEEE Transactions on Software Engineering (1979)

The proliferation of large software systems written in high level programming languages insures the utility of analysis programs which examine interprocedural communications. Often these analysis programs need to reduce the dynamic relations between procedures to a static data representation. This paper presents one such representation, a directed, acyclic graph named the call graph of a program. We delineate the programs representable by an acyclic call graph and present an algorithm for constructing it using the property that its nodes may be linearly ordered. We prove the correctness of the algorithm and discuss the results obtained from an implementation of the algorithm in the PFORT Verifier [1].
CLASCN: candidate network selection for efficient top-k keyword queries over databases
Authors: Jun Zhang, Zhao-Hui Peng, Shan Wang, Hui-Jing Nie
Venue: Journal of Computer Science and Technology (2007)

Keyword Search Over Relational Databases (KSORD) enables casual or Web users easily access databases through free-form keyword queries. Improving the performance of KSORD systems is a critical issue in this area. In this paper, a new approach CLASCN (Classification, Learning And Selection of Candidate Network) is developed to efficiently perform top-k keyword queries in schema-graph-based online KSORD systems. In this approach, the Candidate Networks (CNs) from trained keyword queries or executed user queries are classified and stored in the databases, and top-k results from the CNs are learned for constructing CN Language Models (CNLMs). The CNLMs are used to compute the similarity scores between a new user query and the CNs from the query. The CNs with relatively large similarity score, which are the most promising ones to produce top-k results, will be selected and performed. Currently, CLASCN is only applicable for past queries and New All-keyword-Used (NAU) queries which are frequently submitted queries. Extensive experiments also show the efficiency and effectiveness of our CLASCN approach.
Geometric crossovers for multiway graph partitioning
Authors: Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon, Byung-Ro Moon
Venue: Evolutionary Computation (2007)

Geometric crossover is a representation-independent generalization of the traditional crossover defined using the distance of the solution space. By choosing a distance firmly rooted in the syntax of the solution representation as a basis for geometric crossover, one can design new crossovers for any representation. Using a distance tailored to the problem at hand, the formal definition of geometric crossover allows us to design new problem-specific crossovers that embed problem-knowledge in the search. The standard encoding for multiway graph partitioning is highly redundant: each solution has a number of representations, one for each way of labeling the represented partition. Traditional crossover does not perform well on redundant encodings. We propose a new geometric crossover for graph partitioning based on a labeling-independent distance that filters out the redundancy of the encoding. A correlation analysis of the fitness landscape based on this distance shows that it is well suited to graph partitioning. A second difficulty with designing a crossover for multiway graph partitioning is that of feasibility: in general recombining feasible partitions does not lead to feasible offspring partitions. We design a new geometric crossover for permutations with repetitions that naturally suits partition problems and we test it on the graph partitioning problem. We then combine it with the labeling-independent crossover and obtain a much superior geometric crossover inheriting both advantages.
Boon Thau Loo speaks out: on his SIGMOD dissertation award, better networking through datalog, life as an assistant professor, and more
Authors: Marianne Winslett
Venue: ACM SIGMOD Record (2007)

Welcome to this installment of ACM SIGMOD Record's series of interviews with distinguished members of the database community. I'm Marianne Winslett, and today we are in Alexandria, Virginia. I have here with me Boon Thau Loo, who is an Assistant Professor of Computer and Information Science at the University of Pennsylvania. Boon is the recipient of the 2007 ACM SIGMOD Dissertation Award for his thesis entitled "The Design and Implementation of Declarative Networks." Boon's PhD is from the University of California at Berkeley, where his advisors were Joe Hellerstein and Ion Stoica. So, Boon, welcome!
Spam filtering for short messages
Authors: Gordon V. Cormack, José María Gómez Hidalgo, Enrique Puertas Sánz
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

We consider the problem of content-based spam filtering for short text messages that arise in three contexts: mobile (SMS) communication, blog comments, and email summary information such as might be displayed by a low-bandwidth client. Short messages often consist of only a few words, and therefore present a challenge to traditional bag-of-words based spam filters. Using three corpora of short messages and message fields derived from real SMS, blog, and spam messages, we evaluate feature-based and compression-model-based spam filters. We observe that bag-of-words filters can be improved substantially using different features, while compression-model filters perform quite well as-is. We conclude that content filtering for short messages is surprisingly effective.
IR Target Detection Based on Kernel PCA and Quadratic Correlation Filters
Authors: Wei Kun, Zhao Yongqiang, Pan Quan, Zhang Hongcai
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

In this paper a novel approach for infrared target detection based on kernel principal component analysis (KPCA) and quadratic correlation filters (QCF) is proposed. The feature extraction for training images and detecting IR image are first implemented using KPCA, and then QCF based on the Fukunaga Koonz transform is applied to the extracted principal component vectors, the detecting sub-images segmented from detecting IR image corresponding to the output of QCF above a given threshold are considered as required IR target. The proposed method has a good ability to restrain IR target noise so as to improve detecting accuracy. Experiments on the real-world IR images show that the proposed approach is effective and efficient.
An Automatic-Controller Description Language
Authors: H. Takahashi
Venue: IEEE Transactions on Software Engineering (1980)

This paper proposes a control-oriented Algol-like nonprocedural language called Condor. Automatic controller theory, in company with computer science, underlies many industrial fields. Sequential control is especially important. So far, sequential-controller description methods have by and large been lmited to graphic ones, which are unreadable in the case of large controllers. A higher-level linguistic approach has been considered unlikely. This paper proposes a language widely suitable for controller architecture description. A controller, in its nature, consists of many subsystems which work in a parallel manner, interacting with one another. This paper deems that a basic component is not a process, but a response. A controller is considered to be a responding system in which every reactor works together, having a relation and communication to one another. A Condor program is a role assignment list for the reactors; it is Algol-like and nonprocedural. All the statements work at all times, interacting with one another.
Intelligent bush fire spread prediction using fuzzy cellular automata
Authors: Miha Mraz, Nikolaj Zimic, Jernej Virant
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1999)

In this paper, we wish to present a practical approach to modelling the shape of a wild bush fire using fuzzy logic and cellular automata (CA). In this way, the time consuming measurements, which are used as input data for the statistical modelling approach, could be exchanged with uncertain knowledge built in to the decision structure.
Student errors in concurrent programming assignments
Authors: Jan Lönnberg
Venue: Proceedings of the 6th Baltic Sea conference on Computing education research: Koli Calling 2006 (2006)

This poster abstract describes the ongoing work at Helsinki University of Technology on observing defects in concurrent programming assignment submissions and examining the underlying causes of these errors and the methods used to find them. The work is part of a larger endeavour to find problematic aspects of debugging concurrent programs and develop approaches to aid programmers in this task.
Optimal recovery of solutions of the generalized heat equation in the unit ball from inaccurate data
Authors: K. Yu. Osipenko, E. V. Wedenskaya
Venue: Journal of Complexity (2007)

We consider the problem of optimal recovery of solutions of the generalized heat equation in the unit ball. Information is given at two time instances, but inaccurate. The solution is to be constructed at some intermediate time. We provide the optimal error and present an algorithm which achieves this error level.
Using AHP and TOPSIS approaches in customer-driven product design process
Authors: Ming-Chyuan Lin, Chen-Cheng Wang, Ming-Shi Chen, C. Alec Chang
Venue: Computers in Industry (2008)

Customer-driven product design process is critically an important part of concurrent engineering (CE). Many new principles and approaches, such as quality function deployment (QFD) and axiomatic design, have been introduced to help designers identify the relationship between customer requirements and design characteristics. However, identification of customer requirements and evaluation of design alternatives are still heavily reliant on designer's experience and knowledge. This will affect the efficiency and effectiveness of the customer-driven design process and even make the development of design automation become more difficult. This paper presents a framework that integrates the analytical hierarchy process (AHP) and the technique for order preference by similarity to ideal solution (TOPSIS) to assist designers in identifying customer requirements and design characteristics, and help achieve an effective evaluation of the final design solution. The proposed approach starts with applying the AHP method to evaluate the relative overall importance of customer requirements and design characteristics. The TOPSIS method is then used to perform competitive benchmarking. Finally, a search strategy is employed to set target values for design characteristics of the recommended design alternative. The performance of the proposed approach is illustrated and validated using a personal digital assistant (PDA) design example. The results show that the proposed approach is capable of helping designers to systematically consider relevant design information and effectively determine the key design objectives and optimal conceptual alternatives.
Handwritten Chinese Character Recognition Using Modified LDA and Kernel FDA
Authors: D. Yang, L. Jin
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

The effectiveness of kernel fisher discrimination analysis (KFDA) has been demonstrated by many pattern recognition applications. However, due to the large size of Gram matrix to be trained, how to use KFDA to solve large vocabulary pattern recognition task such as Chinese Characters recognition is still a challenging problem. In this paper, a two-stage KFDA approach is presented for handwritten Chinese character recognition. In the first stage, a new modified linear discriminant analysis method is developed to get the recognition candidates. In the second stage, KFDA is used to determine the final recognition result. Experiments on 1034 categories of Chinese character from 120 sets of handwriting samples shows that a 3.37% improvement of recognition rate is obtained, which suggests the effectiveness of the proposed method.
Interprocess Communication in Charlotte
Authors: Y. Artsy
Venue: IEEE Software (1987)

The unique system provides powerful interprocess communication that uses duplex links, does not buffer messages in the kernel, and does not block on communication requests.
Completeness Estimation of Range Queries in Structured Overlays
Authors: Marcel Karnstedt, Kai-Uwe Sattler, Roman Schmidt
Venue: Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing (2007)

Range queries are a very powerful tool in a wide range of data management systems and are vital to a multitude of applications. The hierarchy of structured overlay systems can be utilized in order to provide efficient techniques for processing them, resulting in the support of applications and techniques based on range queries in large-scale distributed information systems. But, due to the limited knowledge and the usually best-effort characteristics, deciding about the completeness of query results, e.g., getting an idea when a query is finished or what amount of results is still missing, is very challenging. There is not only an urgent need to provide this information to the user issuing queries, but also for implementing sophisticated and efficient processing techniques based on them. In this work, we propose a method for solving this task. We discuss the applicability and quality of our estimations, present an implementation and evaluation for the P-Grid system and show how to adapt the technique to other overlays.
Policy-based Management: A Historical Perspective
Authors: Raouf Boutaba, Issam Aib
Venue: Journal of Network and Systems Management (2007)

This paper traces the history of policy-based management and how it evolved from the first security models dating back to the late 1960's until today's more elaborate frameworks, languages, and policy-based management tools. The focus will be on providing a synthesized chronicle of the evolution of ideas and research trends rather than on surveying the various specification formalisms, frameworks, and application domains of policy-based management.
Compositional gossip: a conceptual architecture for designing gossip-based applications
Authors: Étienne Rivière, Roberto Baldoni, Harry Li, José Pereira
Venue: ACM SIGOPS Operating Systems Review (2007)

Most proposed gossip-based systems use an ad-hoc design. We observe a low degree of reutilization among this proposals. We present how this limits both the systematic development of gossip-based applications and the number of applications that can benefit from gossip-based construction. We posit that these reinvent-the-wheel approaches poses a significant barrier to the spread and usability of gossip protocols. This paper advocates a conceptual design framework based upon aggregating basic and predefined building blocks (B2). We show how to compose building blocks within our framework to construct more complex blocks to be used in gossip-based applications. The concept is further depicted with two gossip-based applications described using our building blocks.
The Probability of a Correct Output from a Combinational Circuit
Authors: R. C. Ogus
Venue: IEEE Transactions on Computers (1975)

The paper discusses two methods to evaluate the signal reliability of the output of logical circuits. It is known that faults present in a circuit will not always cause the output of the circuit to be incorrect. Given the probability of faults occurring in the circuit and the probabilities of the input combinations, it is possible to determine the likelihood of the output being correct. The signal reliability of the output is thus defined as the probability that the circuit output is correct. The first method evaluates the contribution of each fault to the reliability of the circuit and requires the enumeration of the behavior of each fault in the entire fault set. The use of McCluskey and Clegg's characterization of faulty networks by evaluating the functional equivalence classes of the network is a way to reduce the amount of computation involved. Lower bounds can be obtained by considering a restricted fault set, for example, the single fault set. The second method uses a probabilistic model of logical circuits and consists of straightforward operations which can easily be automated. The method also yields the signal reliability and has the capability of very easily specifying the individual fault probabilities of all the circuit lines independently.
Certification Testing: A Procedure to Improve the Quality of Software Testing
Authors: A. R. Sorkowitz
Venue: Computer (1979)

Here is a presently operational plan to improve the quality of program testing. After all programs are tested alone, an independent quality control staff uses automated tools to certify that minimum testing criteria have been met.
On a New Approach for Finding All the Modified Cut-Sets in an Incompatibility Graph
Authors: S. R. Das
Venue: IEEE Transactions on Computers (1973)

The compatibility relation occurs in many different disciplines in science and engineering. When a compatibility relation exists between pairs of elements in a set, an important problem is to derive the collection of aU those elements that form maximal compatibles. If the set of elements with the compatibility relation can be visualized as a compatibility graph of which the different nodes represent the elements of the set, the only edges of the graph being the nonoriented lines joining pairs of elements with the compatibility relation, then the problem of deriving the maximal compatibles becomes identical to the graph theory problem of finding all the maximal complete subgraphs in a symmetric graph. Recently, in connection with simplifying incompletely specified sequential machines, where a kind of compatibility relation also exists between pairs of internal states, Das and Sheng proposed a method for deriving the different maximal compatibles through finding all of the modified cut-sets of the incompatibility graph of the machine. This paper, without confining itself to only incompletely specified machines, considers the problem involving the compatibility relation in a broader perspective and suggests a new approach for finding aU the modified cut-sets of the incompatibility graph of a set having a compatibility relation between its different pairs of elements.