ppxscal/embedding_network huggingface dataset:
Internet Content Regulation: Is a Global Community Standard a Fallacy or the Only Way Out?
Authors: Abhilash Nair
Venue: International Review of Law, Computers and Technology (2007)

One of the major factors that render it difficult to regulate content on the Internet is its borderless nature. The concept of 'contemporary community standards' was initially seen as unworkable in the Internet context. While the line of argument that if a publisher chooses to send its material into a particular community, it is the publisher's responsibility to abide by that community's standards was the accepted norm in the traditional forms of media, this was considered too harsh an approach to be applied for the Internet. There has been a shift in this rigid position over the years, which was reflected in the US Supreme Court decision in Ashcroft v. ACLU when the court held that reliance on community standards to identify material that is harmful to minors does not by itself render the statute substantially overbroad for purposes of the First Amendment. Protection of children is at the core of all arguments for regulating content, so there has been no dearth for analogies drawn to the considerable uniform standard already achieved in other areas such as child pornography. The article will examine the strength of different arguments in favour of establishing a global community standard for the Internet, and in particular will analyse this in the context of sovereignty of states, free expression rights, and the rights children already enjoy in the offline world but unfortunately not so much in the online world. It is argued that while a global standard is difficult to achieve, it is not impossible and there are factors that are worthy of consideration that should prompt us to look towards this direction.
High performance architectures for Chip-to-Chip Communications on Network Line Cards
Authors: Jacob Engel Taskin Kocak
Venue: Journal of High Speed Networks (2007)

In this paper, we propose two hypercube-based, off-chip interconnect architectures, called 3D-interconnects, to communicate between processing elements and memory modules located on network linecards. Our main goal is to increase the throughput of the memory system since most currently deployed linecard designs reach their maximum transfer rate. Moreover, line rates are constantly increasing while at the same time more data and functionality are embedded in each packet. The 3D-interconnect architectures allow multiple packet processing elements on a linecard to access multiple memory modules. The novelty of the proposed interconnects is their application and implementation as off-chip interconnects on the linecard board. Our interconnects include multiple, highly efficient techniques to route, switch, and control packet flows in order to minimize congestion spots within the interconnects and packet loss. Performance results show that both 3D-interconnects, studied in this paper, achieve high throughput, low latency results surpassing other common interconnects currently deployed. Furthermore, the interconnects were able to sustain high traffic load while keeping low failure rates and high bandwidth utilization levels.
A Design-for-Test Implementation of an Asynchronous Network-on-Chip Architecture and its Associated Test Pattern Generation and Application
Authors: Xuan-Tu Tran, Yvain Thonnart, Jean Durupt, Vincent Beroulle, Chantal Robach
Venue: Proceedings of the Second ACM/IEEE International Symposium on Networks-on-Chip (2008)

Asynchronous design offers an attractive solution to overcome the problems faced by Networks-on-Chip (NoC) designers such as timing constraints. Nevertheless, post-fabrication testing is a big challenge to bring the asynchronous NoCs to the market due to a lack of testing methodology and support. This paper first presents the design and implementation of a Design-for-Test (DfT) architecture, which improves the testability of an asynchronous NoC architec-ture. Then, a simple method for generating test patterns for network routers is described. Test patterns are automatically generated by a custom program, given the network topology and the network size. Finally, we introduce a testing strategy for the whole asynchronous NoC. With the generated test patterns, the testing methodology presents high fault coverage (99.86%) for single stuck-at fault models.
The other skills of the software architect
Authors: Brian Berenbach
Venue: Proceedings of the first international workshop on Leadership and management in software architecture (2008)

The skills that are taught to the software architect in academic programs often leave him or her completely unprepared to assume the role of solution architect on a project with more than four or five developers. Furthermore, the globalization of software development has created a need for architects that can effectively manage multiple teams at multiple locations. Additionally, the lack of qualified architects has resulted in serious difficulties for industry. This position paper provides insight into the 'real' role of the architect on a large project, and examines the gap between what is taught at the university and what skills are needed for success.
Scalable min-register retiming under timing and initializability constraints
Authors: Aaron P. Hurst, Alan Mishchenko, Robert K. Brayton
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

We demonstrate that a maximum-flow-based approach to register-minimization is a useful platform for incorporating varied design constraints. In this work, we extend the flowbased formulation to include timing constraints and to guarantee the existence of an equivalent initial state. Reducing the register count is motivated by positive consequences for physical design, verification, and power consumption, but it is critically necessary for synthesis that these timing and functionality requirements are also met. Our solution is optimum in the number of registers under either or both constraints and also possesses several other distinct advantages: the runtime is significantly faster than comparable techniques, the algorithm is capable of early termination with a timing-feasible solution, and both maximum and minimum path constraints can be specified.
Strategic Planning for Information Security and Assurance
Authors: Daniel Port, Rick Kazman, Ann Takenaka
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

Dealing with risk is critical to the success of any information security and assurance endeavor. With society’s ever-increasing dependence on large-scale information systems, dealing with security risk is a topic of considerable importance and attention. It is generally infeasible to provide “total security” for any information system. As a result, successful risk management must be strategically planned with regard to desired assurance levels and costs. In this paper we define the practices associated with strategic planning for managing information security and assurance. We provide a concrete and practical approach for generating such strategic plans that is provably optimal and robust.
Towards multipurpose autonomous manipulation with the uji service robot
Authors: M. Prats, P. j. Sanz, A. p. Del pobil, E. Martínez, R. Marín
Venue: Robotica (2007)

This paper presents a modular control architecture that enables a mobile manipulator to be compliant and perform manipulation tasks in partially known everyday human environments. An impedance velocity/force controller that allows the execution of a great variety of tasks under the Task Frame Formalism (TFF) is implemented. Tasks are represented as a net of basic abilities which are performed by the robot using the impedance controller. Mechanisms for switching between abilities according to the robot's perceptual state are defined. We show the validity of our approach on the UJI Service Robot, making it to perform a common daily task such as opening a door. Finally, we apply this framework to make progress on the new version of the UJI Librarian Robot, making a great step forward in the way the robot manipulates books.
Conservative upwind difference schemes for compressible flows in a duct
Authors: P. Glaister
Venue: Computers Mathematics with Applications (2008)

Numerical results are presented, and compared, for four conservative upwind difference schemes for the Euler equations representing the compressible flow of a gas in a duct of variable cross-section. The schemes are applied to a problem involving the interaction and reflection of a converging cylindrical shock. The schemes vary in their treatment of the flux balance, including treating part of it as a source, as well as in the averaging of flow variables, and whether the source term arising out of the geometry of the problem is handled using upwinding or treated as a point source. The schemes are shown to give similar results while being different in construction and implementation, and each having different approximate Jacobians and treatment of the source.
Analyzing web text association to disambiguate abbreviation in queries
Authors: Xing Wei, Fuchun Peng, Benoit Dumoulin
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

We introduce a statistical model for abbreviation disambiguation in Web search, based on analysis of Web data resources, including anchor text, click log and query log. By combining evidence from multiple sources, we are able to accurately disambiguate the abbreviation in queries. Experiments on real Web search queries show promising results.
Application of the set-theoretic approach to accounting of uncertainties in the solution of vector optimization problems
Authors: V. S. Brusov, A. L. Suzdal'Tsev
Venue: Automation and Remote Control (2008)

The problem of optimization of a complex system by the vector criterion is considered in terms of the set theory. The suggested approach to its solution is based on the formal description of a set of the weight factors of partial indices of effectiveness by the system of inequalities proceeding from the nonstrict and incomplete system of preferences of the decision-maker (DM), which enables us to reduce the calculation of values of both the integral and the guaranteeing criterion of optimality to the solution of a simple geometric problem
Quantum mechanical simulation for ultra-thin high-k gate dielectrics metal oxide semiconductor field effect transistors
Authors: Shih-Ching Lo, Yiming Li, Jyun-Hwei Tsai
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

High-k dielectric materials are being considered as replacement for SiO2 as the gate dielectric while retaining the low equivalent oxide thickness (EOT) required next generation metal oxide semiconductor field effect transistors (MOSFETs). In this paper, we simulate the capacitance - voltage (C-V) of n-type MOSFET devices with different high-k dielectric insulator numerically. According to the results, high-k dielectric materials maintain the capacitance and provide a robust physical thickness preventing tunneling current. Quantum mechanism must be considered in the simulation or a 9.3% overestimation of capacitance will be observed in an extreme case. Capacitance of high-k dielectrics couldn't be estimated by capacitance of insulator with EOT directly because a 13% difference is observed. To obtain an accurate result, a self-consistent Schrödinger - Poisson equation should be solved.
LQG/LIR controller with fault detection method based on genetic algorithms
Authors: Luis Garcia, Manuel J. Lopez
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

This paper presents a method for tuning Linear Quadratic Gaussian/Loop-Transfer Recovery (LQG/LTR) controller combined with a fault detection and isolation (FDI) filter design, which is applied and tested for F-16 aircraft by simulation. LQG/LTR controller is adjusted for design specifications, aided with a procedure where genetic algorithms are used for parameters tuning. The FDI filter is based on robust residual generator design via multi-objective optimization and genetic algorithms (MOO-GA), and it is made sensitive to roll and sideslip sensors. A systematic design procedure is proposed composed with two phases for LQG/LTR controller and for FDI respectively, by means of which design specifications are satisfied.
Limits of parallel marking garbage collection
Authors: Fridtjof Siebert
Venue: Proceedings of the 7th international symposium on Memory management (2008)

More and more, parallel multicore systems will be used even in low-end devices such as embedded controllers that require realtime guarantees. When garbage collection is used in these systems, parallel or concurrent garbage collection brings important performance advantages. In the context of realtime systems, it has to be shown that a parallel garbage collector implementation not only performs well in most cases, but guarantees on its performance in the worst case are required. This paper analyses the difficulties a parallel mark-and-sweep garbage collector faces during a parallel mark phase. The performance of such a garbage collector degrades when only some of the available processors can perform scanning work in the mark phase. Whenever the grey set contains fewer elements than the number of available processors, some processors may be stalled waiting for new objects to be added to the grey set. This paper gives an upper bound for the number of stalls that may occur as a function of simple properties of the memory graph. This upper bound is then determined for the Java applications that are part of the SPECjvm98 benchmark suite and the theoretical worst-case scalability of a parallel mark phase is analysed. The presented approach is then applied to a Java virtual machine that has uniform mark steps, which at first results in poor worst-case scalability. A small change in the implementation is then proposed and analysed to achieve good scalability even in the worst case.
The probabilistic method yields deterministic parallel algorithms
Authors: R. Motwani, J. Naor
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

A method is provided for converting randomized parallel algorithms into deterministic parallel algorithms. The approach is based on a parallel implementation of the method of conditional probabilities. Results obtained by applying the method to the set balancing problem, lattice approximation, edge-coloring graphs, random sampling, and combinatorial constructions are presented. The general form in which the method of conditional probabilities is applied sequentially is described. The reason why this form does not lend itself to parallelization are discussed. The general form of the case for which the method of conditional probabilities can be applied in the parallel context is given.
Using X3D for medical training simulations
Authors: Yvonne Jung, Ruth Recker, Manuel Olbrich, Ulrich Bockholt
Venue: Proceedings of the 13th international symposium on 3D web technology (2008)

Nowadays medical training simulators play an important role in education and further training of surgeons. With Virtual Reality based training systems it is possible to simulate a surgery under realistic conditions. Input data for the visualization of anatomic structures is tomographic image data. For the visualization of medical datasets direct volume rendering is the method of choice. In this paper we introduce a system based on the new X3D extension proposal of the Medical Working Group for a volume rendering component, with some extensions for controlling the speed vs. quality trade-off. For a convincing and instructive training simulation, our implementation delivers high performance combined with high quality visualization of medical datasets. Furthermore, it integrates haptic force-feedback devices to assure realistic interactions.
Regularized Reconstruction of Shapes with Statistical a priori Knowledge
Authors: Matthias Fuchs, Otmar Scherzer
Venue: International Journal of Computer Vision (2008)

The reconstruction of geometry or, in particular, the shape of objects is a common issue in image analysis. Starting from a variational formulation of such a problem on a shape manifold we introduce a regularization technique incorporating statistical shape knowledge. The key idea is to consider a Riemannian metric on the shape manifold which reflects the statistics of a given training set. We investigate the properties of the regularization functional and illustrate our technique by applying it to region-based and edge-based segmentation of image data. In contrast to previous works our framework can be considered on arbitrary (finite-dimensional) shape manifolds and allows the use of Riemannian metrics for regularization of a wide class of variational problems in image processing.
Non-parametric statistical static timing analysis: an SSTA framework for arbitrary distribution
Authors: Masanori Imai, Takashi Sato, Noriaki Nakayama, Kazuya Masu
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

We present a new statistical STA framework based on Monte Carlo analysis that can deal with arbitrary statistical distribution and delay models. Order statistics (non-parametrics) is consistently adopted by which the timing analysis and criticality calculation become distribution-independent. To make Monte Carlo process computationally practical, delays are handled as vectors so that iterations are eliminated. The vector dimension or required number of Monte Carlo iterations which guarantees no timing violation at any user-specified probability is analytically determined. A path criticality metric using order statistics is also defined. Experimental results using various delay models show the validity and usefulness of our proposed algorithm.
GECCO-2007 highlights: petroleum applications of evolutionary computation workshop
Authors: Alexandre Castellini, Charles Guthrie, Burak Yeten, Tina Yu
Venue: ACM SIGEVOlution (2007)

The GECCO conference is the largest annual conference in the field of Genetic and Evolutionary Computation. Workshops on specific topics are organized every year. In July 2007, Chevron and Tina Yu from the University of Newfoundland organized the first workshop on Petroleum Applications. Speakers from industry and academia shared their recent work on a variety of subjects and a panel discussion addressed the gaps and opportunities for Oil and Gas companies.
Predicting defect-prone software modules using support vector machines
Authors: Karim O. Elish, Mahmoud O. Elish
Venue: Journal of Systems and Software (2008)

Effective prediction of defect-prone software modules can enable software developers to focus quality assurance activities and allocate effort and resources more efficiently. Support vector machines (SVM) have been successfully applied for solving both classification and regression problems in many applications. This paper evaluates the capability of SVM in predicting defect-prone software modules and compares its prediction performance against eight statistical and machine learning models in the context of four NASA datasets. The results indicate that the prediction performance of SVM is generally better than, or at least, is competitive against the compared models.
An Automated Bacterial Colony Counting System
Authors: Chengcui Zhang, Wei-Bang Chen, Wen-Lin Liu, Chi-Bang Chen
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

Bacterial colony enumeration is an essential tool for many widely used biomedical assays. However, bacterial colony enumerating is a low throughput, time consuming and labor intensive process since there might exist hundreds or thousands of colonies on a Petri dish, and the counting process is often manually performed by well-trained technicians. In this paper, we introduce a fully automatic yet cost-effective bacterial colony counter. Our proposed method can recognize chromatic and achromatic images and thus can deal with both color and clear medium. In addition, our proposed method can also accept general digital camera images as its input. The whole process includes detecting dish/plate regions, identifying colonies, separating aggregated colonies, and finally reporting consistent and accurate counting results. Our proposed counter has a promising performance in terms of both precision and recall, and is flexible and efficient in terms of labor- and time-savings.
Automatically detecting pointing performance
Authors: Amy Hurst, Scott E. Hudson, Jennifer Mankoff, Shari Trewin
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

Since not all persons interact with computer systems in the same way, computer systems should not interact with all individuals in the same way. This paper presents a significant step in automatically detecting characteristics of persons with a wide range of abilities based on observing their user input events. Three datasets are used to build learned statistical models on pointing data collected in a laboratory setting from individuals with varying ability to use computer pointing devices. The first dataset is used to distinguish between pointing behaviors from individuals with pointing problems vs. individuals without with 92.7% accuracy. The second is used to distinguish between pointing data from Young Adults and Adults vs. Older Adults vs. individuals with Parkinson's Disease with 91.6% accuracy. The final data set is used to predict the need for a specific adaptation based on a user's performance with 94.4% accuracy. These results suggest that it may be feasible to use such models to automatically identify computer users who would benefit from accessibility tools, and to even make specific tool recommendations.
Massively parallel electrical-conductivity imaging of hydrocarbons using the IBM Blue Gene/L supercomputer
Authors: M. Commer, G. A. Newman, J. J. Carazzone, T. A. Dickens, K. E. Green, L. A. Wahrmund, D. E. Willen, J. Shiu
Venue: IBM Journal of Research and Development (2008)

Large-scale controlled-source electromagnetic (CSEM) three-dimensional (3D) geophysical imaging is now receiving considerable attention for electrical-conductivity mapping of potential off shore oil and gas reservoirs. To cope with the typically large computational requirements of the 3D CSEM imaging problem, our strategies exploit computational parallelism and optimized finite-difference meshing. We report on an imaging experiment utilizing 32,768 tasks (and processors) on the IBM Blue Gene/L™ (BG/L) supercomputer at the IBM T. J. Watson Research Center. Over a 24-hour period, we were able to image a large-scale marine CSEM field dataset that previously required more than 4 months of computing time on distributed clusters utilizing 1,024 tasks on an InfiniBand® fabric. The total initial data-fitting errors (i.e., "misfits") could be decreased by 67% within 72 completed inversion iterations, indicating the existence of an electrically resistive region in the southern survey area below a depth of 1,500 m underneath the seafloor. The major part of the residual misfit stems from transmitter-parallel receiver components that have an offset from the transmitter sail line (broadside configuration). Modeling confirms that improved broadside data fits can be achieved by considering anisotropic electrical conductivities. While delivering a satisfactory gross-scale image for the depths of interest, the experiment provides important evidence for the necessity of discriminating between horizontal and vertical conductivities for maximally consistent 3D CSEM inversions.