ppxscal/embedding_network huggingface dataset:
Zamin, an Agent Based Artificial Life Model
Authors: Ramin Halavati, Saeed B. Shouraki, Saman H. Zadeh, Pujan Ziaie, Caro Lucas
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

Zamin artificial life model is designed to be a general purpose environment for researches on evolution of learning methods, living strategies and complex behaviors and is used in several studies thus far. As a main target for Zamin's design has been its expandability and ease of problem definition, a new agent based structure for this artificial world is introduced in this paper, which is believed to be much easier to use and extend. In this new model, all control and world running processes are done by agents. Therefore, any change in world processes does not require recoding the main engine and can be done just by altering the behavior of one or some agents. To have an easier interface for the design of new organisms, all creatures' communications with the world level is done through a common message map, thus, a designer just needs to code the required parts and append them to the main system to process the necessary messages. And at last, extending the model can be done with much less effort, as it can be done easily by creating new agents that handle the new tasks. This model is implemented and some coding differences with previous model are presented.
The Josephus Cube: analysis of routing and fault tolerance
Authors: Peter K. K. Loh, Wen Jing Hsu
Venue: Journal of Parallel and Distributed Computing (2005)

We introduce a novel interconnection topology, the Josephus Cube, which supports a degree of fault tolerance as well as a simple, cost-effective routing strategy that is minimal, deadlock-free, and livelock-free. The routing strategy is based on an approach that has been realised in research and commercial routers. In this paper, we provide an analysis of the routing strategy and the structural fault tolerance of the Josephus Cube.
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs
Authors: Dimitris Achlioptas, Aaron Clauset, David Kempe, Cristopher Moore
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

Understanding the structure of the Internet graph is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaining its graph structure is a surprisingly difficult task, as edges cannot be explicitly queried. Instead, empirical studies rely on traceroutes to build what are essentially single-source, all-destinations, shortest-path trees. These trees only sample a fraction of the network's edges, and a recent paper by Lakhina et al. found empirically that the resuting sample is intrinsically biased. For instance, the observed degree distribution under traceroute sampling exhibits a power law even when the underlying degree distribution is Poisson.In this paper, we study the bias of traceroute sampling systematically, and, for a very general class of underlying degree distributions, calculate the likely observed distributions explicitly. To do this, we use a continuous-time realization of the process of exposing the BFS tree of a random graph with a given degree distribution, calculate the expected degree distribution of the tree, and show that it is sharply concentrated. As example applications of our machinery, we show how traceroute sampling finds power-law degree distributions in both δ-regular and Poisson-distributed random graphs. Thus, our work puts the observations of Lakhina et al. on a rigorous footing, and extends them to nearly arbitrary degree distributions.
Land-surface deformation corresponding to seasonal ground-water fluctuation, determining by SAR interferometry in the SW Taiwan
Authors: C. P. Chang, T. Y. Chang, C. T. Wang, C. H. Kuo, K. S. Chen
Venue: Mathematics and Computers in Simulation (2004)

In this study we implement the InSAR technique for identifying the seasonal surface deformation in the SW Taiwan. The focus of our investigation is on the Pingtung plain, a tectonic valley with a high water-pumping rate. Our preliminary results show that the land subsidence occurs specifically in the dry season and even ceases during the wet season. Whereas local land subsidence is usually caused by dewatering of sediments, we compare therefore our InSAR observations with the groundwater data of this area. This comparison shows that the subsidence rate is associated with the descending trend of groundwater level. Based on our research results, we infer that the dewatering during the dry season removes the buoyant support from the sediments and the effect of sediment compaction simultaneously results in local land subsidence. This successful test exhibits that with suitable images, the InSAR is a useful high-resolution tool for monitoring the earth surface deformation and can provide significant information for the issue of natural hazard mitigation.
Configurable string matching hardware for speeding up intrusion detection
Authors: Monther Aldwairi, Thomas Conte, Paul Franzon
Venue: ACM SIGARCH Computer Architecture News (2005)

Signature-based Intrusion Detection Systems (IDSs) monitor network traffic for security threats by scanning packet payloads for attack signatures. IDSs have to run at wire speed and need to be configurable to protect against emerging attacks. In this paper we consider the problem of string matching which is the most computationally intensive task in IDS. A configurable string matching accelerator is developed with the focus on increasing throughput while maintaining the configurability provided by the software IDSs. Our preliminary results suggest that the hardware accelerator offers an overall system performance of up to 14Gbps.
Integrative Architecture Elicitation for Large Computer Based Systems
Authors: Peter Tabeling, Bernhard Grone
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

Large and complex computer based systems are the result of an evolutionary process which may take many years. Heterogeneity is an important characteristic of such systems; it applies to the technology and products used as well as to the different forms and sources of information about the system. To support the development of large systems, this information has to be collected and integrated into architectural models. Hence, architecture elicitation of a large computer based system has to cope with the heterogeneity of technology and information sources. Some information can be extracted and prepared by tools, but the majority is usually inside documents and the heads of the developers. Therefore, in addition to tool support, this task requires a lot of abstraction which can only be done by humans. This paper presents concepts and abstractions for integrative modeling, based on the Fundamental Modeling Concepts. The approach reflects experiences from many architecture elicitation projects. It provides the necessary abstractions to combine the information about the different system components, including third-party products and hardware, into one integrated architecture model. It covers modeling patterns and typical abstractions, supported by guidelines for the elicitation process. The terminology and notation focuses on the communication about technical systems between persons being involved in system development. As a benefit, integrative models foster the efficient evolution of large systems, the introduction of new developers, or the handing over of a project.
A Novel Fuzzy Approach to Speech Recognition
Authors: Ramin Halavati, Saeed Bagheri Shouraki, Mahsa Eshraghi, Milad Alemzadeh, Pujan Ziaie
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

This paper presents a novel approach to speech recognition using fuzzy modeling. The task begins with conversion of speech spectrogram into a linguistic description based on arbitrary colors and lengths. While phonemes are also described using these fuzzy measures, and recognition is done by normal fuzzy reasoning, a genetic algorithm optimizes phoneme definitions so that to classify samples into correct phonemes. The method is tested over a standard speech data base and the results are presented.
An efficient technology mapping algorithm targeting routing congestion under delay constraints
Authors: Rupesh S. Shelar, Prashant Saxena, Xinning Wang, Sachin S. Sapatnekar
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

Routing congestion has become a serious concern in today's VLSI designs. In this paper, we propose a technology mapping algorithm that minimizes routing congestion under delay constraints. The algorithm employs a dynamic programming framework in the matching phase to generate probabilistic congestion maps for all the matches. These congestion maps are then utilized to minimize routing congestion during the covering, which preserves the delay-optimality of the solution using the notion of slack. Experimental results on benchmark circuits in a 100 nm technology show that the algorithm can improve track overflows by 44%, on an average, as compared to the conventional technology mapping while satisfying delay constraints.
Education
Authors: Andrew J. Bernoff, Section Editor
Venue: SIAM Review (2005)

In mathematics, problems with exact solutions are like gold nuggets. They often allow one to illustrate the fundamental behavior of a class of problems with elegance and simplicity, and at a level the neophyte can understand. One such nugget is described in this issue's Education paper, "Critical Percolation on a Bethe Lattice Revisited" by Braga, Sanchis, and Schieber. Percolation theory lives at the intersection of graph theory and probability. The following is a typical percolation theory question: Given a porous material (such as a sponge) with a set of pores connected by channels that are randomly chosen to be open or closed, what is the probability that a pore in the center is connected to the outside boundary? (That is, what is the probability that fluid can percolate from the outside boundary to the central pore?) Questions of this type arise in numerous applications, including modeling the spread of an epidemic or a forest fire, the flow of groundwater, and the formation of polymer networks. Our paper considers percolation theory on a Bethe lattice (of which a binary tree is perhaps the most familiar example). The authors build the theory from the ground up and describe a beautiful example of what physicists call a phase transition and the associated concepts of critical probability and critical exponents. Moreover, in this model the authors describe how to compute these quantities exactly. The paper also illustrates how percolation theory can become particularly subtle as the domain size becomes infinite. This material could naturally be introduced into the undergraduate curriculum as a case-study in a discrete mathematics or a graph theory course. The paper also may kindle interest in what is an active and applied area of graduate study and research. On a more personal note, this issue commences my term as Editor of the Education section. Fortunately, my predecessor, Bobby Schnabel, is not far away---I wish him every success in his new role as Editor-in-Chief of SIAM Review.
Industrial controller with built in tester
Authors: Peyo Zlatanov, Mitko Kolarov
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

There the author presents an industrial controller on the base of 2 microprocessors - MC6800 and 18051. The general idea is to use a test keyboard like a service device and like a customer keyboard. It isn't necessary to use special test instruments. All service activities are included in the system PROM.
An efficient bottom-up extraction approach to build accurate PLL behavioral models for SOC designs
Authors: Chin-Cheng Kuo, Yu-Chien Wang, Chien-Nan Jimmy Liu
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

In this paper, an efficient bottom-up extraction approach is presented to generate accurate behavioral models of PLL circuits more quickly by using Verilog-AMS language. Not only top-down applications but also bottom-up applications can be supported by using our PLL models. The main idea is to use a special "characterization mode" to get critical circuit parameters. In the characterization mode, only two input patterns are enough to get circuit properties with parasitic effects. In the experimental results, we will build an accurate PLL behavioral models for demonstration compared to the HSPICE results and typical behavioral models.
Scalable multiple description coding and distributed video streaming in 3G mobile communications: Research Articles
Authors: Ruobin Zheng, Weihua Zhuang, Hai Jiang
Venue: Wireless Communications Mobile Computing (2005)

This paper proposes a distributed multimedia delivery mobile network for video streaming in 3rd generation (3G) mobile communications. The joint design of layered coding (LC) and multiple description coding (MDC) is employed to address the bandwidth fluctuations and packet loss problems in the wireless network and to further enhance the error resilience tools in MPEG-4. A new Internet protocol (IP) differentiated services (DiffServ) video marking algorithm is presented to support an unequal error protection of the LC components. Both intra-RAN (radio access network) handoff and inter-RAN handoff procedures are discussed, which provide path diversity to combat streaming video outage due to handoff in the universal mobile telecommunications system (UMTS). Computer simulation results demonstrate that: (1) the newly proposed IP DiffServ video marking algorithm is more suitable for video streaming in an IP mobile network as compared with the previously proposed algorithm, and (2) the proposed handoff procedures have better performance in terms of handoff latency, end-to-end delay and handoff scalability than that in UMTS. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Generic Groups, Collision Resistance, and ECDSA
Authors: Daniel R. Brown
Venue: Designs, Codes and Cryptography (2005)

Proved here is the sufficiency of certain conditions to ensure the Elliptic Curve Digital Signature Algorithm (ECDSA) existentially unforgeable by adaptive chosen-message attacks. The sufficient conditions include (i) a uniformity property and collision-resistance for the underlying hash function, (ii) pseudorandomness in the private key space for the ephemeral private key generator, (iii) generic treatment of the underlying group, and (iv) a further condition on how the ephemeral public keys are mapped into the private key space. For completeness, a brief survey of necessary security conditions is also given. Some of the necessary conditions are weaker than the corresponding sufficient conditions used in the security proofs here, but others are identical. Despite the similarity between DSA and ECDSA, the main result is not appropriate for DSA, because the fourth condition above seems to fail for DSA. (The corresponding necessary condition is plausible for DSA, but is not proved here nor is the security of DSA proved assuming this weaker condition.) Brickell et al. [Vol. 1751 of Lecture Notes in computer Science, pp. 276--292], Jakobsson et al. [Vol. 1976 of Lecture Notes in computer Science, pp. 73--89] and Pointcheval et al. [Vol. 13 of Journal of Cryptology, pp. 361--396] only consider signature schemes that include the ephemeral public key in the hash input, which ECDSA does not do, and moreover, assume a condition on the hash function stronger than the first condition above. This work seems to be the first advance in the provable security of ECDSA.
Stencils-based tutorials: design and evaluation
Authors: Caitlin Kelleher, Randy Pausch
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

Users of traditional tutorials and help systems often have difficulty finding the components described or pictured in the procedural instructions. Users also unintentionally miss steps, and perform actions that the documentation's authors did not intend, moving the application into an unknown state. We introduce Stencils, an interaction technique for presenting tutorials that uses translucent colored stencils containing holes that direct the user's attention to the correct interface component and prevent the user from interacting with other components. Sticky notes on the stencil's surface provide necessary tutorial material in the context of the application. In a user study comparing a Stencils-based and paper-based version of the same tutorial in Alice, a complex software application designed to teach introductory computer programming, we found that users of a Stencils-based tutorial were able complete the tutorial 26% faster, with fewer errors, and less reliance on human assistance. Users of the Stencils-based and paper-based tutorials attained statistically similar levels of learning.
CompChall: Addressing Password Guessing Attacks
Authors: Vipul Goyal, Virendra Kumar, Mayank Singh, Ajith Abraham, Sugata Sanyal
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Even though passwords are the most convenient means of authentication, they bring along themselves the threat of dictionary attacks. Dictionary attacks may be of two kinds: online and offline. While offline dictionary attacks are possible only if the adversary is able to collect data for a successful protocol execution by eavesdropping on the communication channel and can be successfully countered using public key cryptography, online dictionary attacks can be performed by anyone and there is no satisfactory solution to counter them. This paper presents a new authentication protocol which is called CompChall (computational challenge). The proposed protocol uses only one way hash functions as the building blocks and attempts to eliminate online dictionary attacks by implementing a challenge-response system. This challenge-response system is designed in a fashion that it does not pose any difficulty to a genuine user but is time consuming and computationally intensive for an adversary trying to launch a large number of login requests per unit time as in the case of an online dictionary attack. The protocol is stateless and thus less vulnerable to DoS (Denial of Service) attacks.
Designing a distributed algorithm for bandwidth allocation with a genetic algorithm
Authors: Hidehiro Kobayashi, Masaharu Munetomo, Kiyoshi Akama, Yoshiharu Sato
Venue: Systems and Computers in Japan (2004)

When stream communications which requires a certain bandwidth during a certain time is to be realized on an existing network, a bandwidth allocation algorithm that efficiently allocates network resources is crucial to satisfying user service requirements. In the optimization of allocation in a small-scale network, the most efficient approach is to have one node manage network information and perform allocation in a concentrated scheme. However, in bandwidth allocation the computation time required for optimization increases in proportion to the network scale, and distribution of the algorithm becomes necessary in the implementation. Another advantage of the distributed scheme is that allocations can be continued even if a fault arises in the network, which improves the fault tolerance of the algorithm. This paper investigates distribution of the bandwidth allocation algorithm by using a genetic algorithm. An improved algorithm is proposed which can cope with the fault when it occurs in the network by the reallocation of all communications. The proposed algorithm includes both local optimization to optimize the allocation at each node to reduce the computation time, and global optimization to optimize the whole network by the tournament method while performing local optimization in each node. Simulation experiments comparing the performance of the concentrated algorithm and the proposed algorithm are described. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(3): 37&ndash;45, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10350
Knowledge for communication: Universita Degli Studi Di Milano, Italy
Authors: Gabriella Airenti, Bruno G. Bara, Marco Colombetti
Venue: Issue 79 (January 1982) (1982)

The aim of our work is to develop a theory of the mental processes underlying the communication activity of a number of subjects in a given relational context. The start point in this direction is the proposal of a knowledge representation based on the distinction between conceptual and episodic knowledge (Airenti, Bara, Colombeti 1980 a, c). Referring to paradigms of mathematical logic one can say that conceptual knowledge plays the role of a theory of the external world: It is constituted by a conceptual system, K-theory, describing entities of the external world with their general properties, mutual relations, transformation rules, etc. The relation of K-theory to the external world may be viewed as that of a theory to one of its models. From a psychological point of view, however, K-theory does not deal with the external world but with a mental representation of it. Such a representation is the actual model of K-theory and constitutes th episodic knowledge, K-model. It contains representations and mutual correlations of individuals, objects and specific facts and events. To represent change in the external world, K-model is structured into a number of temporarily correlated representations.
A MIMO Parameter Estimation Model Taking Ricean Fading Channel and Stochastically Uncorrelated Signals into Account " Part I: Inherent Accuracy Limitations
Authors: Bamrung Tau Sieskul, Somchai Jitapunkul
Venue: Proceedings of the 3rd Annual Communication Networks and Services Research Conference (2005)

In this paper, a MIMO channel model accounted for Ricean fading and stochastically uncorrelated signals is proposed for the problem of estimating three important parameters of wireless channel, such as the nominal direction, the angular spread and the Ricean factor. Although such a problem formulation captures so many physical scattering features into a parametric channel model, we elaborate the second-order statistic in such a way that the array co-variance matrix depends on five parameters. To inspect the achievable performance of parameter estimation, we derive all necessary derivatives of complex gradient matrix to compute the inherent accuracy limitation based on the Cramér-Rao bound. Herein, the estimation possibility and theoretical analysis are pictorially illustrated and therefore able to reflect various relationships.
Approximate regular expression searching with arbitrary integer weights
Authors: Gonzalo Navarro
Venue: Nordic Journal of Computing (2004)

We present a bit-parallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn/logk s), where s is the amount of main memory that can be allocated. The algorithm permits arbitrary integer weights and matches the complexity of the best previous techniques, but it is simpler and faster in practice. In our way, we define a new recurrence for approximate searching where the current values depend only on previous values. Interestingly, our algorithm turns out to be a relevant option also for simple approximate string matching with arbitrary integer weights.