ppxscal/embedding_network huggingface dataset:
Transistor level gate modeling for accurate and fast timing, noise, and power analysis
Authors: S. Raja, F. Varadi, M. Becer, J. Geada
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Current source based cell models are becoming a necessity for accurate timing and noise analysis at 65nm and below. Voltage waveform shapes are increasingly more difficult to represent as simple ramps due to highly resistive interconnects and Miller cap effects at receiver gates. Propagation of complex voltage waveforms, and accurate modeling of nonlinear driver and receiver effects in crosstalk noise analysis require accurate cell models. A good cell model should be independent of input waveform and output load, should be easy to characterize and should not increase the complexity of a cell library with high-dimensional look-up tables. At the same time, it should provide high accuracy compared to SPICE for all analysis scenarios including multiple-input switching, and for all cell types and cell arcs, including those with high stacks. It should also be easily extendable for use in statistical STA and noise analysis, and one should be able to simulate it fast enough for practical use in multi-million gate designs. In this paper, we present a gate model built from fast transistor models (FXM) that has all the desired properties. Along with this model, we also present a multithreaded timing traversal approach that allows one to take advantage of the high accuracy provided by the FXM, at traditional STA speeds. Results are presented using a fully extracted 65nm TSMC technology.
Performance analysis of online assessment systems
Authors: Xue Bai, Jordan Cao, Yingjin Cui
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

Web-based online assessment systems have been overwhelmingly accepted by instructors, students, and educational institutions. In order to improve quality of existing systems, our effort aimed at identifying important predictors of students' satisfaction. In this study, the principal component analysis and logistic regression were undertaken to determine the underlying dimensions and the importance of predictors. It was found that "effectiveness of the assessment system", "getting help to use the system in class", "system performance" and "responsiveness" were significant while the predictors "effectiveness of the system and getting help to use the system" had stronger effect on user satisfaction. The survey instrument was tested for reliability and validity.
Monitoring Network Traffic to Detect Stepping-Stone Intrusion
Authors: Jianhua Yang, Byong Lee, Stephen S. H. Huang
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Most network intruders tend to use stepping-stones to attack or to invade other hosts to reduce the risks of being discovered. There have been many approaches that were proposed to detect stepping-stone since 1995. One of those approaches proposed by A. Blum detects stepping-stone by checking if the difference between the number of the send packets of an incoming connection and the one of an out-going connection is bounded. One weakness of this method is in resisting intruders’ evasion, such as chaff perturbation. In this paper, we propose a method based on random walk theory to detect stepping-stone intrusion. Our theoretical analysis shows that the proposed method is more effective than Blum’s approach in terms of resist-ing intruders’ chaff perturbation.
Discrete laplace operator on meshed surfaces
Authors: Mikhail Belkin, Jian Sun, Yusu Wang
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

In recent years a considerable amount of work in graphics and geometric optimization used tools based on the Laplace-Beltrami operator on a surface. The applications of the Laplacian include mesh editing, surface smoothing, and shape interpolations among others. However, it has been shown [13, 24, 26] that the popular cotangent approximation schemes do not provide convergent point-wise (or even L2) estimates, while many applications rely on point-wise estimation. Existence of such schemes has been an open question [13]. In this paper we propose the first algorithm for approximating the Laplace operator of a surface from a mesh with point-wise convergence guarantees applicable to arbitrary meshed surfaces. We show that for a sufficiently fine mesh over an arbitrary surface, our mesh Laplacian is close to the Laplace-Beltrami operator on the surface at every point of the surface. Moreover, the proposed algorithm is simple and easily implementable. Experimental evidence shows that our algorithm exhibits convergence empirically and compares favorably with cotangentbased methods in providing accurate approximation of the Laplace operator for various meshes.
Packet Size Variability in Real Time Transmission of Smoothed MPEG-4 Streams
Authors: Rubem Pereira, Ella Grishikashvili Pereira
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

It is desirable for the IP packet size variability of real time traffic classes to be small. This enables the adoption of schedulers such as weighted round robin, which are of low complexity and, under the assumption of approximately constant packet sizes, are suitable to real time traffic. Compressed video exhibits high variability in different time scales, so video smoothing techniques have been developed in order to reduce bit rate variability. This facilitates resource allocation to video streams. In particular, it may lead to schedulers that assume constant bit rate (CBR) on a per interval basis, as most smoothing techniques lead to a sequence of intervals of CBR. One such scheme is a version of weighted Round Robin scheduling. We carry out an experiment using traces of compressed video (MPEG-4) in order to establish how easily they can be packetised into fixed size packets.
Amplification and percolation (probabilistic Boolean functions)
Authors: M. Dubiner, U. Zwick
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The authors extend R.B. Boppana's results (1989) in two ways. They first show that his two lower bounds hold for general read-once formulae, not necessarily monotone, that may even include exclusive-or gates. They are then able to join his two lower bounds together and show that any read-once, not necessarily monotone, formula that amplifies (p-/sup 1///sub n/,p+/sup 1///sub n/) to (2/sup -n/,1-2/sup -n/) has size of at least Omega (n/sup alpha +2/). This result does not follow from Boppana's arguments and it shows that the amount of amplification achieved by L.G. Valiant (1984) is the maximal achievable using read-once formulae.
A new algorithm for RNA secondary structure prediction using improved transiently chaotic neural network
Authors: Yanqiu Che, Zheng Tang, Qiping Cao, Hongwei Dai
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

RNA secondary structure prediction is a computationally feasible and broadly studied problem. It can be considered as the combinatorial optimization problem. In this paper, we propose an improved transiently chaotic neural network (TCNN) for RNA secondary structure prediction. In the improved model, a variable p(t) called the acceptance probability of chaos is introduced into the original TCNN model. Variable p(t) is used to decide if the chaos term will be calculated or not. With variable p(t), the network can be speeded up to converge to a fixed point with fewer iterations. The improved TCNN is analyzed theoretically and evaluated experimentally through predicting RNA secondary structure. The simulation results show that the improved transiently chaotic neural network can reach stable state with fewer steps than the original transiently chaotic neural network.
Economizing Isp Interconnections At Internet Exchange Points
Authors: Jörn Altmann, Deepak Goel
Venue: Journal of Integrated Design Process Science (2006)

The Internet service provider market is very competitive. Small and medium-size Internet service providers (ISPs) are competing for customers, while, at the same time, they are under price pressure from upstream providers. Therefore, these ISPs have to reduce their overall cost of interconnection. In order to address this issue, Internet exchange points (IXPs) have been built up in recent years, which allow small and medium-size ISPs to go into public or private peering with other ISPs. However, those ISPs do not have sufficient information to select the optimal set of ISPs, with which they should go into private peering agreements. In this paper, we describe an approach, which provides ISPs with the information about the most economical interconnections to other ISPs. This approach helps small and medium-size Internet service providers to reduce their interconnection costs for upstream connectivity and to improve network performance for their customers. To achieve that, our approach uses Internet topology information in close neighborhood of the ISP (which is determined by the set of ISPs connected to the IXP), measurement information about the number of bytes transmitted, and traffic pricing schemes. Based on real data, our analysis results demonstrate that our approach provides the necessary information to ISPs for locally optimizing their interconnection agreements (e.g. peering, sibling, transit agreements).
Interactive film and the multiplied self
Authors: Roman Danylak, Ernest Edmonds
Venue: Computers in Entertainment (CIE) (2008)

Interactive film, delivered by computational processes, collapses the self; the singular, personal identity to which we have become accustomed is challenged by the adoption of many selves, transforming our primary experience of identity. The new medium presents us with narrative multiplicity, so that we are no longer just &ldquo;John Smith,&rdquo; our namesake. The combination of separate, unique, historically-evolved representational techniques, defined as counterfeit, production, and simulation, makes the creation of a multiplied self possible in a digitized environment. This paper will focus on Spielberg's film Catch Me if You Can, whose narrative describes the actions of its game-playing protagonist, Frank Abagnale Jr., who exemplifies the emerging digital man. He creates many personas in a predigital world by means of the three techniques of representation. His &ldquo;art&rdquo; is shown to be a precursor of interactive film, turning the world into a game of interchangeable multiple personalities. Manipulating and adopting screen media communication artefacts, Frank Abagnale Jr. creates an analogue of human-computer multimedia interaction. A comparison of similar innovations and their effects in earlier historical periods of media is also included.
Discrete and Lexicographic Helly-Type Theorems
Authors: Nir Halman
Venue: Discrete Computational Geometry (2008)

Helly&#x2019;s theorem says that if every d+1 elements of a given finite set of convex objects in &#x211d; d have a common point, then there is a point common to all of the objects in the set. We define three new types of Helly theorems: discrete Helly theorems&#x2014;where the common point should belong to an a-priori given set, lexicographic Helly theorems&#x2014;where the common point should not be lexicographically greater than a given point, and lexicographic-discrete Helly theorems. We study the relations between the different types of the Helly theorems. We obtain several new discrete and lexicographic Helly numbers.
Analyzing the Structure and Evolution of Massive Telecom Graphs
Authors: Amit Anil Nanavati, Rahul Singh, Dipanjan Chakraborty, Koustuv Dasgupta, Sougata Mukherjea, Gautam Das, Siva Gurumurthy, Anupam Joshi
Venue: IEEE Transactions on Knowledge and Data Engineering (2008)

With ever growing competition in telecommunications markets, operators have to increasingly rely on business intelligence to offer the right incentives to their customers. Existing approaches for telecom business intelligence have almost solely focused on the individual behavior of customers. In this paper, we use the Call Detail Records of a mobile operator to construct Call graphs, that is, graphs induced by people calling each other. We determine the structural properties of these graphs and also introduce the {\sl Treasure-Hunt} model to describe the shape of mobile call graphs. We also determine how the structure of these call graphs evolve over time. Finally, since Short Messaging Service (SMS) is becoming a preferred mode of communication among many sections of the society we also study the properties of the SMS graph. Our analysis indicates several interesting similarities as well as differences between the SMS graph and the corresponding call graph. We believe that our analysis techniques can allow telecom operators to better understand the social behavior of their customers, and potentially provide major insights for designing effective incentives.
Student perceptions of computer science: a retention study comparing graduating seniors with cs leavers
Authors: Maureen Biggers, Anne Brauer, Tuba Yilmaz
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

Students who develop a strong interest in another field can hardly be fair target for retention efforts. There are others, however, who might do very well in this field but who leave computer science because of misunderstandings about and a negative experience in this academic major. Retention literature suggests and provides numerous examples of initiatives that improve student retention. To determine how best to impact student retention in your computer science department, a comprehensive understanding of the student experience of your major is essential. Not only is it important to know why students leave your major, but an understanding of why they stay can be useful in developing high impact initiatives. The current study involves a comparative examination of students who graduated from the computer science (CS) major at Georgia Institute of Technology in Atlanta, Georgia (Stayers) with students who chose to leave the major (Leavers). Specifically, perceptions and experiences of computer science as a field in general and the climate of the major were studied. Comparative data collected provided insights into reasons why they entered into the major, about belief of adequate preparation and confidence going into the major, definitions of CS and other related factors. Results were analyzed to identify potential target areas and concrete implementation strategies are suggested for improved retention in the computer science major at this institution.
An outranking approach for information retrieval
Authors: Mohamed Farah, Daniel Vanderpooten
Venue: Information Retrieval (2008)

Over the last three decades, research in Information Retrieval (IR) shows performance improvement when many sources of evidence are combined to produce a ranking of documents. Most current approaches assess document relevance by computing a single score which aggregates values of some attributes or criteria. They use analytic aggregation operators which either lead to a loss of valuable information, e.g., the min or lexicographic operators, or allow very bad scores on some criteria to be compensated with good ones, e.g., the weighted sum operator. Moreover, all these approaches do not handle imprecision of criterion scores. In this paper, we propose a multiple criteria framework using a new aggregation mechanism based on decision rules identifying positive and negative reasons for judging whether a document should get a better ranking than another. The resulting procedure also handles imprecision in criteria design. Experimental results are reported showing that the suggested method performs better than standard aggregation operators.
NEMO based P2P file discovery scheme
Authors: Yi-Chang Lin, Long-Sheng Li
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

Peer-to-Peer systems become very popular applications in this day. Most P2P systems are based on the wired network environment. But the mobile devices grow up day by day in an enormous rate. Therefore, most current P2P systems have poor performance in the wireless environment. This paper is based on the wireless environment under Network Mobility (NEMO) architecture, proposing one wireless P2P architecture works on NEMO. In order to fulfill the characteristic of the wireless and roaming scenario, a scheme is used to search the location of file or service in the nearby Mobile Network. The proposed approach can avoid tunnel in tunnel problem, unnecessary bandwidth loading and messages passing, and adopting the broadcast in MANET for solving this problem, and expect testing and verify using experiments finally.
Protein Conformational Search Using Bees Algorithm
Authors: Hesham Awadh Abdallah Bahamish, Rosni Abdullah, Rosalina Abdul Salam
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Proteins perform many biological functions in the human body. The structure of the protein determines its function. In order to predict the protein structure computationally, protein must be represented in a proper representation. To this end, an energy function is used to calculate its energy and a conformational search algorithm is used to search the conformational search space to find the lowest free energy conformation. In this paper, the Bees Algorithm, i.e. a Swarm Intelligence based algorithm inspired by the foraging behaviour of honey bees colony, is adapted to search the protein conformational search space. The algorithm was able to find the lowest free energy conformation of Met enkephaline using ECEPP/2 force fields.
Triple layer data security
Authors: Swarnendu Mukherjee, Swarnendu Bhattacharya, Amlan Chaudhury
Venue: Ubiquity (2008)

The growth of high speed computer networks and that of Internet, in particular, has hiked the ease of Data Communication. But in the other hand this growth is also responsible for the snooping of Data at the same time. The ease, by which digital information can be duplicated and distributed, has led to the need for effective protection tools. Various encryption techniques like cryptography, digital watermarking, steganography etc have already been introduced in attempt to address these growing concerns. In this paper, an algorithmic approach is proposed in which along with the combination of cryptography and steganography (taken as security layers), an extra layer of security has been imposed in between them to obtain a completely secured data transmission scheme.
Fast reconfiguration algorithms for time, space, and wavelength dilated optical Benes networks
Authors: Enyue Lu, S. Q. Zheng
Venue: International Journal of Parallel, Emergent and Distributed Systems (2007)

Benes networks are rearrangeable nonblocking networks and are among the most efficient switching architectures in terms of the number of [image omitted]  switching elements (SEs) used. In optical Benes networks, if two I/O connecting paths with the same (close) wavelength(s) share a common SE, crosstalk occurs. In order to reduce the crosstalk effect, three approaches, time, space and wavelength dilations have been proposed. In this paper, we present polylogarithmic-time reconfiguration algorithms for realizing any (partial) permutation in time, space and wavelength dilated optical Benes networks using a linear number of processors. Our algorithms are based on a logarithmic-time permutation decomposition algorithm and apply graph coloring techniques such as edge coloring, equitable coloring and vertex coloring.
The rise and fall of CORBA
Authors: Michi Henning
Venue: Communications of the ACM (2008)

There's a lot we can learn from CORBA's mistakes.
Full-system chip multiprocessor power evaluations using FPGA-based emulation
Authors: Abhishek Bhattacharjee, Gilberto Contreras, Margaret Martonosi
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

The design process for chip multiprocessors (CMPs) requires extremely long simulation times to explore performance, power, and thermal issues, particularly when operating system (OS) effects are included. In response, our novel FPGA-based emulation methodology models a full CMP design including applications and an OS. Activity counters programmed into the cores feed per-component microarchitectural power models. These models achieve under 10% error compared to detailed gate-level simulations. Our method retains software flexibility, but offers up to 35x speedup compared to corresponding full-system software simulations. We present our approach by emulating a 2-core Leon3 cache-coherent multiprocessor running Linux and parallel benchmarks. In an example case study, our emulated system uses activity counts (a proxy for temperature) to guide process migration between the CMP cores. Overall, this paper's methodology makes possible detailed power and thermal studies of CMPs and their operating systems.
Circuit development using biological components: Principles, models and experimental feasibility
Authors: Rajesh Krishnan, Carla C. Purdy
Venue: Analog Integrated Circuits and Signal Processing (2008)

Today most VLSI circuits are built in silicon using CMOS transistors. Developments in design automation and process fabrication have resulted in the progressive increase of the number of transistors per chip and decrease in the size of the transistors. But transistor designers are fast approaching fundamental physical barriers to further size reduction. Thus engineers are looking at alternate technologies such as nano-devices and bio-circuits for next-generation circuits. In our research, we concentrate on the development of bio-circuits and their applications. Our eventual goal is the design and simulation of complete systems integrating bio-circuits and VLSI technology appropriately. Bio-circuits are circuits developed in vivo or in vitro, using DNA and proteins. A biological process such as glycolysis or bioluminescence can be viewed as a genetic regulatory circuit, a complex set of bio-chemical reactions regulating the behavior of genes, operons, DNA, RNA, and proteins. Similar to voltage in an electrical circuit, a genetic regulatory circuit produces an output protein in response to an input stimulus. We can engineer bio-circuits to meet design specifications, using genetic engineering. Our aim is to build a library of in vitro bio-circuits representing the Boolean functions. The bio-circuits from this library can be further cascaded to form larger circuits. In this paper, we review the feasibility of building bio-circuits. We discuss the construction of Boolean logic gates such as NOT, AND, and OR and their verification by simulation. We also address important aspects such as cascading of the bio-circuits and practical implementation. In addition, we describe an algorithm "Box" that can help to control bio-circuit characteristics such as gain and switching behavior. This approach is similar to design space exploration in traditional VLSI, but takes into account biological knowledge obtained through experiments. We also provide insight into the robustness of bio-circuits in the presence of noise. This paper is intended to pave the pathway for electrical engineers to start exploring the field of bio-circuits.