ppxscal/embedding_network huggingface dataset:
An Approach for the Administration and Security of IPv6 Transition Mechanisms: An SNMP MIB for 6to4
Authors: Georgios Koutepas, Athanasios Douitsis, Demetris Philippides, Vasilis Maglaris
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

A number of transitional mechanisms are being offered to allow the gradual adoption of IPv6 and prolong the useful operating time of legacy systems and applications. The transition mechanisms perform conversions between versions 4 and 6 of the IP protocol, offer tunnelling functionality and act as connection points between isolated (in the sense of IP versioning) network segments. In this paper we examine IPv6 transition mechanisms (focusing in tunnelling mechanisms) and their management requirements. Specifically, we examine in the most widely used mechanism, 6to4. We present its operational characteristics and identify its main management requirements. These requirements are then used to define corresponding objects for an SNMP Management Information database (MIB). Our aim is to use the SNMP methodology to address the most important IPv6 transition mechanism issues in a unified network administration environment. Our effort has resulted in a working prototype SNMP agent that implements most of our management object suggestions. We briefly describe the implementation challenges we faced and its main operational characteristics.*
Adaptive PID controller for nonlinear systems with H/sup /spl infin// tracking performance
Authors: H. F. Ho, Y. K. Wong, A. B. Rad
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

In this paper, we developed a PID control for a certain class of unknown nonlinear dynamic systems. The three parameters of PID controller are obtained based on Lyapunov approach. Moreover, a H/sup /spl infin// control technique obtained by a is constructed to achieve the H/sup /spl infin// tracking performance for any prescribed level. The simplicity of the scheme provides a new approach for implementing PID controller for a variety of nonlinear problems. Simulation studies have shown that the proposed controller performs well in tracking performance.
Integrating agent based modeling into a discrete event simulation
Authors: Benjamin Dubiel, Omer Tsimhoni
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Movement of entities in discrete event simulation typically requires predefined paths with decision points that dictate entity movement. Human-like travel is difficult to model correctly with these constraints because that is not how people move and large individual differences exist in capabilities and strategies. Agent based modeling is considered a better way to simulate the real-time interaction of people with their environment. In this paper we propose to integrate agent based modeling with discrete event simulation to simulate the movement of people in a discrete event system. An agent based module was constructed within the AutoMod simulation package, and a test case was modeled in which people (agents) at a theme-park interact with objects and people in their environment to get directions and then walk or take a tram to their final destination. We explain the details of model implementation and describe the verification and initial validation of the model.
Integration on finite sets: Research Articles
Authors: Zhenyuan Wang, Kwong-Sak Leung, George J. Klir
Venue: International Journal of Intelligent Systems (2006)

Various types of integrals with respect to signed fuzzy measures on finite sets with cardinality n can be presented as corresponding rules for partitioning the integrand. The partition can be expressed as an n-dimensional vector, whereas the signed fuzzy measure is also an n-dimensional vector. Thus, the integration value is the inner product of these two vectors. Two pairs of extremes, the Lebesgue-like integral versus the Choquet integral and the upper integral versus the lower integral, are discussed in detail. &copy; 2006 Wiley Periodicals, Inc. Int J Int Syst 21: 1073&ndash;1092, 2006.
Peer to peer networks for defense against internet worms
Authors: Srinivas Shakkottai, R. Srikant
Venue: Proceedings from the 2006 workshop on Interdisciplinary systems approach in performance evaluation and design of computer & communications sytems (2006)

Internet worms, which spread in computer networks without human mediation, pose a severe threat to computer systems today. The rate of propagation of worms has been measured to be extremely high and they can infect a large fraction of their potential hosts in a short time. We study two different methods of patch dissemination to combat the spread of worms. We first show that using a fixed number of patch servers performs woefully inadequately against Internet worms. We then show that by exploiting the exponential data dissemination capability of P2P systems, the spread of worms can be halted very effectively. We compare the two methods by using fluid models to compute two quantities of interest: the time taken to effectively combat the progress of the worm and the maximum number of infected hosts. We validate our models using simulations.
Humble beginnings, uncertain end: getting the internet to provide performance guarantees
Authors: Domenico Ferrari
Venue: ACM SIGCOMM Computer Communication Review (2006)

One of the pioneering efforts to obtain guaranteed performance from the Internet was born out of sheer curiosity. The question "Can it be done, and, if so, how?" came unexpectedly to the mind of a researcher who had never been active in the field of networking, and kept tormenting him until it became a personal challenge. Also due to many other researchers (with a lot more networking credentials), the topic was for several years quite a popular one in the community, and various protocols were designed, some even implemented, to incarnate some of the results of research. Will any of those protocols ever be deployed on the Internet? Only the future will tell.
Four nightmares for net neutrality
Authors: Shane Greenstein
Venue: IEEE Micro (2006)

What is the economic substance behind arguments for and against net neutrality? Shane Greenstein analyzes the economic bases of four "nightmare scenarios" frequently cited by advocates of net neutrality--inequity, corporate bureaucracy, bad incentives, and less innovative content.
Development of a Multi-train Operation Simulator with Interactive Human Computer Interfaces
Authors: Hyun-Kyu Jun, Sung-Kyou Choi
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

Owing to the technology development in railway industry, driverless automated operation systems have been incorporated in railway operation. Therefore new control concepts are needed to prove the safety of railway operation. In this paper, we suggested a development strategy of a multi-train operation simulator to support R&D works for future railway system. For this purpose, we designed computer-based simulation models of train, station, rail and railway operation system as an agent, respectively, based on their functions. And then we developed an integrated railway environment to simulate railway operation. The simulation results were displayed on wide screen constructed with three 42 plasma display panels and a head mounted- display device with motion tracking system, in real time. When a simulation began, trains were dispatched and driven on given railway one by one following the train performance analysis results. The interactive operation in virtual environment, which is the special feature incorporated in this study, shows distinguished advantages because it makes easier understand of physical phenomenon by giving realistic simulation environment.
Ontology based IT-security planning
Authors: Stefan Fenz, Edgar Weippl
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

IT-security has become a much diversified field and small and medium sized enterprises (SMEs), in particular, do not have the financial ability to implement a holistic IT-security approach. We thus propose a security ontology, to provide a solid base for an applicable and holistic IT-security approach for SMEs, enabling low-cost risk management and threat analysis.
Comparing the Performance of a 64-bit Fully-Asynchronous Superscalar Processor versus its Synchronous Counterpart
Authors: J. M. Colmen, O. Garnica, J. Lanchares, J. I. Hidalgo, G. Minana, S. Lopez
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

Nowadays, synchronous processor designers have to deal with severe problems related to the distribution of a complex clock network like skew reduction, high powerconsumption, synchronization of clocks, etc. Asynchronous or self-timed architectures are becoming an interesting design alternative because they usually avoid these drawbacks, and they are able to achieve high performance at a low power consumption cost. However, on the first steps of the design process, the evaluation of the performance of such architectures through simulations is much more complicated due to the requirement of modeling the datadependant timing of each system module. The aim of this paper is to evaluate the performance of a 64-bit fully-asynchronous superscalar processor microarchitecture with dynamically scheduled instruction flow, outof- order speculative execution of instructions and advanced branch prediction. To tackle this goal we have described the asynchronous microarchitecture solving the synchronization between structures through a four-phase handshake protocol. Then, we have used a modification of the SimpleScalar suite to model the asynchronous microarchitecture in order to run Alpha programs on it. Finally, we have compared the performance of this fully-asynchronous processor with the performance obtained from its synchronous counterpart by running architectural simulations of the SPEC2000 benchmarks on both models.423-432
P Transducers
Authors: Gabriel Ciobanu, Gheorghe Paun, Gheorghe Stefanescu
Venue: New Generation Computing (2006)

We introduce in this paper four classes of P transducers: arbitrary, initial, isolated arbitrary, isolated and initial. The first two classes are universal, they can compute the same word functions as Turing machines, the latter two are incomparable with finite state sequential transducers, generalized or not. We study the effect of the composition, and show that iteration increases the power of these latter classes, also leading to a new characterization of recursively enumerable languages. The "Sevilla carpet" of a computation is defined for P transducers, giving a representation of the control part for these P transducers.
Fingerprint Authentication Device Based on Optical Characteristics Inside a Finger
Authors: Emiko Sano, Takuji Maeda, Takahiro Nakamura, Masahiro Shikai, Koji Sakata, Masahito Matsushita, Koichi Sasakawa
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

Fingerprint is the most popular modality that is widely used in various authentication applications; PC logon, gate access control systems, and so on. The reason can be considered that fingerprint can achieve the best balance among authentication performance, cost, size of device, and ease of use. However, most of fingerprint authentication devices have some problems to be solved. One is that captured images are easily affected by the condition of finger surface and it can degrade authentication performance. The other is that the problem of impersonation by artificial gummy fingers has been pointed out. To solve those problems, we developed a new fingerprint authentication device that has a novel sensing principle. This device forms a image of fingerprint pattern based on optical characteristics of a finger's interior by scattered transmission light. The images so obtained are unaffected by the condition of finger surface such as dry or moist fingers or operating environment, and enable stable authentication processes. And it can differentiate between real fingers and fake gummy fingers made from gelatin or other material using optical characteristics. Because this device utilizes the optical characteristics inside a finger, it has possibility to achieve higher authentication performance by combining multiple characteristics of a finger's interior as a modality. In this paper, we describe the sensing principle and process algorithm of this device.
An olap-gis system for numerical-spatial problem solving in community health assessment analysis
Authors: Bambang Parmanto
Venue:  (2006)

Community health assessment (CHA) professionals who use information technology need a complete system that is capable of supporting numerical-spatial problem solving. On-Line Analytical Processing (OLAP) is a multidimensional data warehouse technique that is commonly used as a decision support system in standard industry. Coupling OLAP with Geospatial Information System (GIS) offers the potential for a very powerful system. For this work, OLAP and GIS were combined to develop the Spatial OLAP Visualization and Analysis Tool (SOVAT) for numerical-spatial problem solving. In addition to the development of this system, this dissertation describes three studies in relation to this work: a usability study, a CHA survey, and a summative evaluation. The purpose of the usability study was to identify human-computer interaction issues. Fifteen participants took part in the study. Three participants per round used the system to complete typical numerical-spatial tasks. Objective and subjective results were analyzed after each round and system modifications were implemented. The result of this study was a novel OLAP-GIS system streamlined for the purposes of numerical-spatial problem solving. The online CHA survey aimed to identify the information technology currently used for numerical-spatial problem solving. The survey was sent to CHA professionals and allowed for them to record the individual technologies they used during specific steps of a numerical-spatial routine. In total, 27 participants completed the survey. Results favored SPSS for numerical-related steps and GIS for spatial-related steps. Next, a summative within-subjects crossover design compared SOVAT to the combined use of SPSS and GIS (termed SPSS-GIS) for numerical-spatial problem solving. Twelve individuals from the health sciences at the University of Pittsburgh participated. Half were randomly selected to use SOVAT first, while the other half used SPSS-GIS first. In the second session, they used the alternate application. Objective and subjective results favored SOVAT over SPSS-GIS. Inferential statistics were analyzed using linear mixed model analysis. At the .01 level, SOVAT was statistically significant from SPSS-GIS for satisfaction and time (p < .002). The results demonstrate the potential for OLAP-GIS in CHA analysis. Future work will explore the impact of an OLAP-GIS system in other areas of public health.
On the Stretch Factor of the Constrained Delaunay Triangulation
Authors: Prosenjit Bose, J. Mark Keil
Venue: Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering (2006)

Given a set P of n points in the plane and a set S of non-crossing line segments whose endpoints are in P, let CDT(P, S) be the constrained Delaunay triangulation of P with respect to S. Given any two visible points p, q \in P, we show that there exists a path from p to q in CDT(P, S), denoted SPCDT(p, q), such that every edge in the path has length at most |pq| and the ratio |SP CDT(p, q)|/|pq| is at most \frac{{4\pi \sqrt 3 }}{9}( \approx 2.42), thereby improving on the previously known bound of \frac{{\pi (1 + \sqrt 5 }}{2}( \approx 5.08).
Development of Sensitivity to Texture and Contour Information in the Human Infant
Authors: Anthony M. Norcia, Francesca Pei, Yoram Bonneh, Chuan Hou, Vanitha Sampath, Mark W. Pettet
Venue: Journal of Cognitive Neuroscience (2005)

Texture discrimination and bounding contour extraction are essential parts of the object segmentation and shape discrimination process. As such, successful texture and contour processing are key components underlying the development of the perception of both objects and surfaces. By recording visual-evoked potentials, we investigate whether young infants can detect orientation-defined textures and contours. We measured responses to an organized texture comprised of many Gabor patches of the same orientation, alternated with images containing the same number of patches, but all of random orientation. These responses were compared with a control condition consisting of the alternation between two independently random configurations. Significant difference potentials were found as early as 2&ndash;5 months, as were significant odd harmonics in the test conditions. Responses were also measured to Gabor patches organized either as circles (all patches tangent to an imaginary circular path) alternated with pinwheels (all patches having a fixed orientation offset from the path). Infants between 6 and 13 months also showed sensitivity to the global organization of the elements along contours. Differential responses to our texture and contour stimuli and their controls could only have been generated by mechanisms that are capable of comparing the relative orientation of 2 or more patches, as no local information at a single patch distinguished the random and organized textures or the circle and pinwheel configurations.
Conductor inequalities and criteria for Sobolev type two-weight imbeddings
Authors: Vladimir Maz'ya
Venue: Journal of Computational and Applied Mathematics (2006)

A typical inequality handled in this article connects the Lp-norm of the gradient of a function to a one-dimensional integral of the p-capacitance of the conductor between two level surfaces of the same function. Such conductor inequalities lead to necessary and sufficient conditions for multi-dimensional and one-dimensional Sobolev type inequalities involving two arbitrary measures. Compactness criteria and two-sided estimates for the essential norm of the related imbedding operator are obtained. Some counterexamples are presented to illustrate the peculiarities arising in the case of higher derivatives. Criteria for two-weight inequalities with fractional Sobolev norms of order l <2 are found.
Using neural networks to develop a new model to screen applicants for apartment rentals
Authors: Maxine Cohen
Venue:  (2006)

Credit scoring is a mathematical means of summarizing a consumer's credit and financial history into a three-digit number. This number provides an easy means of identifying and sorting consumer behavior into categories based on their financial history. To select applicants for loans and to set interest rates on loans, banks and financial institutions routinely use credit scoring. Auto insurance companies also use scoring to decide which consumers will be offered auto insurance and to set the price for auto insurance. Despite success in these two industries, scoring does not appear to be effective in the apartment rental industry in picking desirable applicants for apartment rental. The first phase of this research analyzed the results of using six commercially available credit scores applied in one apartment complex to the task of selecting applicants. This part of the analysis answered the research question: How effective are commercially available credit scores in predicting applicant financial behavior when renting an apartment? This research determined that these six scores are not predictive and possible explanations are given. Phase two of this research used neural networks to develop a new model using both credit data and other lifestyle data about the applicant. The hypothesis was that the addition of this lifestyle data would improve accuracy in selecting apartment rental applicants over currently available models based only on credit data. This part of the analysis answered the research question: How is the prediction accuracy of a new neural network based credit scoring model improved by adding lifestyle data to the credit report data? This research indicates that accuracy is greatly improved. Three variables were found to be most predictive for the apartment rental decision and these were (a) percentage of satisfactory accounts in the applicant's credit file, (b) total applicant income, and (c) driving record of the applicant. Four areas were suggested for future study and these are (a) understanding the underlying human behavior differences that influence apartment financial decisions, (b) addition of "fuzzy logic" techniques to the neural network, (c) expanding the number of commercial credit models tested and size of the data set, and (d) effect of geography on model prediction accuracy. This dissertation also examined U.S. information policy and addressed consumer privacy considerations when using non-credit data to select applicants.
Grid Computing Gets Small
Authors: Greg Goth
Venue: IEEE Distributed Systems Online (2006)

While supercomputing research centers around the world continue their breakthroughs in high-end grid computing technologies, regional governments and private enterprises have started making their own headlines. The change may reflect a broadening technological base for the field's future.
Overall Blocking Behavior Analysis of General Banyan-Based Optical Switching Networks
Authors: Chen Yu Xiaohong Jiang, Susumu Horiguchi, Minyi Guo
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

Banyan networks are attractive for serving as the optical switch architectures due to their nice properties of small depth and absolutely signal loss uniformity. Combining the horizontal expansion and vertical stacking of optical banyan networks is a general scheme for constructing banyan-based optical switching networks. The resulting horizontally expanded and vertically stacked optical banyan (HVOB) networks usually take either a high hardware cost or a large network depth to guarantee the nonblocking property. Blocking behavior analysis is an effective approach to studying network performance and finding a graceful compromise among hardware cost, network depth, and blocking probability; however, little has been done to analyze the blocking behavior of general HVOB networks. In this paper, we study the overall blocking behavior of general HVOB networks, where an upper bound on the blocking probability of a HVOB network is developed with respect to the number of planes (stacked copies) and the number of stages. The upper bound accurately depicts the overall blocking behavior of a HVOB network as verified by an extensive simulation study, and it agrees with the strictly nonblocking condition of the network. The derived upper bound is significant because it reveals the inherent relationship among blocking probability, network depth, and network hardware cost, so that a desirable tradeoff can be made among them. In particular, our bound gives network developers an effective tool to estimate the maximum blocking probability of a HVOB network, in which different routing strategies can be applied with a guaranteed performance in terms of blocking probability, hardware cost and network depth. Our upper bound model predicts some unobvious qualitative behaviors of HVOB networks, and it draws an important conclusion that a very low blocking probability (e.g., less than 0.001 percent) can be achieved in a HVOB network without introducing either a significantly high hardware cost or a large network depth.