ppxscal/embedding_network huggingface dataset:
Multiple Scan Chain Design Technique for Power Reduction during Test Application in BIST
Authors: Debjyoti Ghosh, Swarup Bhunia, Kaushik Roy
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

Multiple scan chain has been used in DFT (design for test) architectures primarily to reduce test application time. Since power is an emerging problem, in this paper, we present a design technique for multiple scan chain in BIST (Built-In Self Test) to reduce average power dissipation and test application time, while maintaining the fault coverage. First, we partition the scan chain into a set of smaller chains of similar lengths in such a way, that the total number of scan transitions in the scan chain is minimized. Then, we use a novel scan re-ordering algorithm in each smaller chain to further reduce the transitions. Experiments on ISCAS'89 benchmarks show up to 46.2% (average 24.4%) power reduction using the proposed technique, compared to the scan partitions given in the RTL description. Unlike previous approaches, our solution is computationally efficient and test-set independent and thus, can be effectively applied to large BIST circuitry.
An improved optimal bit allocation method for sub-band coding
Authors: Ze Wang, Yin Lee, Chi-Sing Leung, Tien-Tsin Wong, Yi-Sheng Zhu
Venue: Pattern Recognition Letters (2003)

This paper presents an improved optimal bit allocation method for sub-band coding. To speed up the allocation process, a coarse bit range for each sub-band is firstly obtained using the log-variance method, and then an optimal searching routine is applied to produce the final solution. Good features are showed in the simulations for evaluating the proposed method.
A comparison of access methods for online documentation
Authors: D. Lungu, T. T. Carey, J. Mitterer, B. Nonnecke
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1 (1992)

This paper reports on the progress of the Global Online Information/2 (GOLI/2) project. The major activity on this project has been a controlled experiment to observe and categorize information-seeking tactics of users, and their relation to the access methods provided by the online information environment. The report summarizes the purpose and design of the experiment, the results of both controlled and unrestricted access to the online information and the ongoing activities and impacts on the GOLI/2 work.
E-Business education for everyone: developing and implementing breakthrough strategies (or how can IT practitioners and educators make computer morons surf and steer on e-business space)
Authors: Rumel V. Atienza
Venue: Current issues in IT education (2003)

Since its inception at the close of the past millennium, e-business has rapidly and continuously changed the conduct of business. However, the incoming generation of the Philippine workforce, particularly those who do not have sufficient exposure to computer technology and business, may not be able to cope, due to lack of academic preparation. Information technology practitioners and academicians can turn this threat into an opportunity by adopting a system of breakthrough practices in e-business education based on benchmarking studies in various universities in Asia and North America. The system proved to be highly effective, based on its pilot run.
Observational signatures of the macroscopic formation of strange matter during core collapse supernovae
Authors: Richard N. Boyd
Venue:  (2003)

The consequences of a first order QCD phase transition in the protoneutronstar remnant of a core collapse supernova are presented with a special focus on the effects on neutrino transport. A secondary focus is the detection of these neutrinos in terrestrial detectors. Hybrid stars are constructed such that a coexistence region of QCD-confined and deconfined phases forms in the protoneutronstar interior with possibly a pure deconfined phase in the center. The resulting Coulomb lattice (1D, 2D and 3D) in the coexistence region is shown to crystallize for temperatures relevant in supernova cores seconds after bounce. Droplet deformation modes freeze out in the same range. For the outermost &sim;1 km of the coexistence region, the stability of the 3D lattice to shear stresses falls below the critical range of mechanical energy densities provided by hydrodynamical flow. This can lead to a non-spherical relief structure which, together with the enhanced neutrino opacity of the coexistence lattice; can result in anisotropic neutrino transport and therefore neutron star kicks. A computer model for neutrino diffusion coupled with quasistatic evolution of a solid lattice phase and hydrodynamical treatment of the confined matter envelope was developed to address the kick model and other problems. The state of newly formed hybrid stars is determined using a self-consistent approach of integrating the stellar structure equations with the constraint of heat flow equilibrium, resulting in relatively cool energy spheres (T &sim; 1 MeV) compared to T &sim; 10 MeV in the interior. Typical cooling timescales of hybrid stars are then &tau; &sim; 100 sec. This is shown to result in a statistically significant signal in a Pb-neutron spallation detector. In exploratory calculations, observed kick speeds were reproduced and the presence of a sustainable convective flow pattern to maintain a crater in the coexistence region was verified. The Pb and Fe components of a proposed neutron spallation neutrino detector concept were optimized with respect to cost-efficiency. DAMOCLES, a transport code for neutrons, capture &gamma; rays and scintillation photons was developed for that purpose. The detection efficiency for liberated neutrons for the optimum configurations in both detectors is 38%. The available sensitivity to sparse neutrino signals is &sim;1/(sec &times; kT) for expected radioactive background rates.
Products in Genre Discussion. Enhanced Approach with the Media Reference Model (MRM)
Authors: Salome Schmid-Isler, Thomas Oehninger
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 4 - Volume 4 (2004)

Documents are artifacts, based on an idea and following a plan produced by human beings. From a management point of view they are the results of a design - an engineering, manufacturing, and communication process. This paper presents and discusses a methodical approach, which is based on the thesis that genre theory and the fundamental analysis and managed application of genres is of the utmost importance in the new product developmentprocess. Furthermore, we assume that a new digital product can only be implemented successfully with an adequate communication strategy based on common and shared knowledge - a common logical system - between consumers and producers. We present the Media Reference Model (MRM) as an enhanced approach to genre theory. Research regarding digital genres and the further development of digital genres profit from this methodical approach, since each design area can be examined from different view points. The MRM's potential for digital genre research is illustrated by the analysis of an innovative web application product.
An implementation of Newton-like methods on nonlinearly constrained networks
Authors: E. Mijangos
Venue: Computers and Operations Research (2004)

The minimization of a nonlinear function with linear and nonlinear constraints and simple bounds can be performed by minimizing an augmented Lagrangian function, including only the nonlinear constraints. This procedure is particularly interesting when the linear constraints are flow conservation equations, as there exist efficient techniques for solving nonlinear network problems. It is then necessary to estimate their multipliers, and variable reduction techniques can be used to carry out the successive minimizations. This work analyzes the possibility of estimating the multipliers of the nonlinear constraints using Newton-like methods. Also, an algorithm is designed to solve nonlinear network problems with nonlinear inequality side constraints, which combines first and superlinear-order multiplier methods. The computational performance of this method is compared with that of MINOS 5.5.
Note: Optimality Conditions for an (s, S) Policy with Proportional and Lump-Sum Penalty Costs
Authors: Sila Çetinkaya, Mahmut Parlar
Venue: Management Science (2002)

We consider the optimality of the ( s,S) policy for a periodic-review stochastic inventory problem with two types of shortage costs. The problem may arise in a rush-order application at a bank branch where the emergency provision costs during a foreign currency stockout are represented by proportional and lump-sum penalties. Aneja and Noori (1987) analyzed this problem and presented a set of conditions for the convexity of a particular function and made a claim about theK-convexity of another function to prove the optimality of the ( s,S) policy. We show that because the function that is claimed to beK-convex is actually concave over a subset of its domain, Aneja and Noori's arguments cannot be used to prove the optimality of the ( s,S) policy. However, we argue that Aneja and Noori's problem is equivalent to the typical lost-sales problem, and using this equivalence, we .nd a simple convexity condition that assures the optimality of the ( s,S) policy.
Talking with Ben Chi of NYSERNet
Authors: Ubiquity staff
Venue: Ubiquity (2003)

How the Internet began in New York State, the current state of Internet2, and the remote possibility of Internet3
The Russell&ndash;Prawitz modality
Authors: Peter Aczel
Venue: Mathematical Structures in Computer Science (2001)

In his 1903, Principles of Mathematics, Bertrand Russell mentioned possible definitions of conjunction, disjunction, negation and existential quantification in terms of implication and universal quantification, exploiting impredicative universal quantifiers over all propositions. In his 1965 Ph.D. thesis Dag Prawitz showed that these definitions hold in intuitionistic second order logic. More recently, these definitions have been used to represent logic in various impredicative type theories. This treatment of logic is distinct from the more standard Curry&ndash;Howard representation of logic in a dependent type theory.The main aim of this paper is to compare, in a purely logical, non type-theoretic setting, this Russell&ndash;Prawitz representation of intuitionistic logic with other possible representations. It turns out that associated with the Russell&ndash;Prawitz representation is a lax modal operator, which we call the Russell&ndash;Prawitz modality, and that any lax modal operator can be used to give a translation of intuitionistic logic into itself that generalises both the double negation interpretation, double negation being a paradigm example of a lax modality, and the Russell&ndash;Prawitz representation.
Mu-depth 3 is more than 2: a game-theoretic proof
Authors: Giacomo Lenzi
Venue: Mathematical Structures in Computer Science (2001)

We consider the propositional modal mu-calculus, a logic proposed by Kozen in 1983. In this logic two operators &mu; and v are present, which express the least and greatest fixpoints of monotone operators on sets. Bradfield in 1998 proved for any n the existence of a mu-calculus formula that requires n alternations of &mu; and v. In this paper we consider the particular case n = 3 and we exhibit a new formula requiring 3 alternations. Our proof is independent of the technique of Bradfield, and is based on a new kind of game on infinite trees.
Redesigning introductory computer programming with HTML, JavaScript, and Java
Authors: Qusay H. Mahmoud, Wlodek Dobosiewicz, David Swayne
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

In this paper we describe our experience in the design and teaching of a new evolutionary introductory programming course in a new Distributed Computing and Communications Systems Technology program at the University of Guelph-Humber. This course is evolutionary and innovative because it integrates the use of HTML, JavaScript, and Java in a one-semester introductory computer programming course. This is a marked departure from the use of a single conventional, general purpose, programming language such as Java or C++. The course is designed with two goals in mind: to improve the students experience in their first computer programming; and to achieve retention in the new program.
Test scheduling and controller synthesis in the CADDY-system
Authors: Martin Rudolph, Michael Nether, Wolfgang Rosenstiel
Venue: Proceedings of the conference on European design automation (1991)

In this paper a new test scheduling problem is described and an algorithm for its solution is presented. Hardware overhead and test application time is saved by executing tests in parallel, when BIST (Built-In Self-Test) structures are integrated on the chip. We achieve a reduction in the bit width of the control signals and the global area of the controller by merging the test control graph and the control graph for the data path into one control graph. This control graph can be globally optimized by the controller synthesis system CASTOR.
On the computational power of insertion-deletion systems
Authors: Akihiro Takahara, Takashi Yokomori
Venue: Natural Computing: an international journal (2003)

Gene insertion and deletion are basic phenomena found in DNA processing or RNA editing in molecular biology. The genetic mechanism and development based on these evolutionary transformations have been formulated as a formal system with two operations of insertion and deletion, called insertion-deletion systems (Kari and Thierrin, 1996; Kari et al., 1997). We investigate the generative power of insertion-deletion systems (InsDel systems), and show that the family INS11 DEL11 is equal to the family of recursively enumerable languages. This gives a positive answer to an open problem posed in Kari et al. (1997) where it was conjectured contrary.
Magnetic and magnetooptical properties of nanoheterostructures containing FeNi and SiC layers
Authors: V. E. Buravtsova, E. A. Gan'shina, V. S. Guschin, S. I. Kasatkin, A. M. Muravyev, F. A. Pudonin
Venue: Microelectronic Engineering (2003)

Spin-tunnel magnetoresistive nanoheterostructures in different combinations with FeNi, SiC and Ti layers were deposited by magnetron sputtering and studied using the induction method and the transversal Kerr effect.
Augmenting user interfaces with adaptive speech commands
Authors: Peter Gorniak, Deb Roy
Venue: Proceedings of the 5th international conference on Multimodal interfaces (2003)

We present a system that augments any unmodified Java application with an adaptive speech interface. The augmented system learns to associate spoken words and utterances with interface actions such as button clicks. Speech learning is constantly active and searches for correlations between what the user says and does. Training the interface is seamlessly integrated with using the interface. As the user performs normal actions, she may optionally verbally describe what she is doing. By using a phoneme recognizer, the interface is able to quickly learn new speech commands. Speech commands are chosen by the user and can be recognized robustly due to accurate phonetic modelling of the user's utterances and the small size of the vocabulary learned for a single application. After only a few examples, speech commands can replace mouse clicks. In effect, selected interface functions migrate from keyboard and mouse to speech. We demonstrate the usefulness of this approach by augmenting jfig, a drawing application, where speech commands save the user from the distraction of having to use a tool palette.
Post-September 11: Computers, ethics and war
Authors: Richard T. De George
Venue: Ethics and Information Technology (2004)

This paper considers the moral responsibility of computer scientists with respect to weapons development in post-911 America. It does so by looking at the doctrine of jus in bello as exemplified in four scenarios. It argues that the traditional doctrine should be augmented by a number of principles, including the Principle of a Morally Obligatory Smart Arms Race, the Principle of Assistance to One's Enemies, the Principle of Public Debate on Weapons of Mass Disruption, and the Principle of the Moral Unjustifiability of Private Wars.
Deception Detection under Varying Electronic Media and Warning Conditions
Authors: Joey F. George, Kent Marett, Patti Tilley
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

With an increasing amount of business-related tasks and decisions being supported by communication technology, it is important to understand and explore the vulnerabilities that may result from its use. One of these weaknesses is the transmission of deceptive information. Very little research investigating mediated deception and its detection exists, however. This paper reports the results of one such investigation. An experiment was conducted involving an interactive interview of deceitful applicants for a fictitious scholarship, using one of three different computer-based media. Results showed that people were extremely successful atdeceiving others no matter what medium was used, and the only recipients of lies that had a realistic chance at uncovering lies were those who were warned beforehand. There were no differences in the number of false alarms issued by warned and unwarned receivers. Warned receivers also rated their electronic medium poorly. Possible implications of this study are offered.
Algorithms for estimating relative importance in networks
Authors: Scott White, Padhraic Smyth
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis---examples include social networks, Web graphs, telecommunication networks, and biological networks. In interactive analysis of such data a natural query is "which entities are most important in the network relative to a particular individual or set of individuals?" We investigate the problem of answering such queries in this paper, focusing in particular on defining and computing the importance of nodes in a graph relative to one or more root nodes. We define a general framework and a number of different algorithms, building on ideas from social networks, graph theory, Markov models, and Web graph analysis. We experimentally evaluate the different properties of these algorithms on toy graphs and demonstrate how our approach can be used to study relative importance in real-world networks including a network of interactions among September 11th terrorists, a network of collaborative research in biotechnology among companies and universities, and a network of co-authorship relationships among computer science researchers.
Technology implementation for telemedicine programs
Authors: Patrick Y. K. Chau, Paul Jen-Hwa Hu
Venue: Communications of the ACM (2004)

Lessons learned in Hong Kong highlight important issues and common pitfalls in telemedicine technology implementation.
Distributed query adaptation and its trade-offs
Authors: Henrique Paques, Ling Liu, Calton Pu
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Adaptive query processing in large distributed systems has seen increasing importance due to the rising environmental fluctuations in a growing Internet. We describe Ginga, an adaptive query processing engine that combines proactive (compile-time) alternative query plan generation with reactive (run-time) monitoring of network delays. The core of Ginga approach is the notion of adaptation space and mechanisms for coordinating and integrating different kinds of query adaptation. An adaptation space consists of a set of adaptation triggers and a set of adaptation cases associated with the triggers. Each adaptation case describes a specific adaptation opportunity of the query execution when changes to the runtime environment are detected. Our experimental results show that Ginga query adaptation can achieve significant performance improvements (up to 40% of response time gain) for processing distributed queries over the Internet.
Technological teleology and the theory of technology enactment: the case of the international trade data system
Authors: G. David Garson
Venue: Social Science Computer Review (2003)

Jane Fountain's book, Building the Virtual State: Information Technology and Institutional Change, uses the International Trade Data System (ITDS) as its leading case in support of technology enactment theory and in refutation of technological determinist theory. An examination of the ITDS case in the years since the termination of Fountain's coverage in 1999 shows the case to be of a different nature than presented in the book. The weaknesses of technology enactment as social science theory are compensated by its descriptive/prescriptive uses for practitioners and researchers interested in public sector information technology implementation.
The High Accurate Block-Grid Method for Solving Laplace's Boundary Value Problem with Singularities
Authors: A. A. Dosiyev
Venue: SIAM Journal on Numerical Analysis (2004)

A high accurate difference-analytical method is introduced for the solution of the mixed boundary value problem for Laplace's equation on graduated polygons. The polygon can have broken sections and be multiply connected. The uniform estimate of the error of the approximate solution is of order O(h6), whereas it is of order $O(h^{6}/r_{j}^{p-\lambda _{j}})$ for the errors of p-order derivatives (p=1,2,. . .) in a finite neighborhood of reentry vertices; here, h is the mesh step, rj is the distance from the current point to the vertex in question, $\lambda _{j}=1/(a\alpha _{j})$, and a=1 or 2 depending on the types of boundary conditions. Further, $\alpha _{j}\pi $ is the value of the interior angle at the considered vertex. Numerical experiments are illustrated in section \ref{sec8} to support the analysis made.
Enabling Network Measurement Portability Through a Hierarchy of Characteristics
Authors: Bruce B. Lowekamp, Brian Tierney, Les Cottrell, Richard Hughes-Jones, Thilo Kielmann, Martin Swany
Venue: Proceedings of the 4th International Workshop on Grid Computing (2003)

Measurement and prediction of network resources arecrucial so that adaptive applications can make use of Gridenvironments. Although a large number of systems andtools have been developed to provide such measurementservices, the diversity of Grid resources and lack of central control prevent the development of a single monitoringsystem that can be deployed to answer every application'sresource queries for connections between any pair of machines it can use. We propose a standard for representingnetwork entities and measurements of their properties. Ourstandard enables the exchange of measurements and willallow applications to function even in environments without the particular measurement system for which they weredeveloped. We present an overview of our measurementrepresentation and evaluate its usefulness. We have usedthe characteristics hierarchy to store and exchange measurement data between several systems, and we discuss itsusefulness in comparing the output of several measurementtools.