ppxscal/embedding_network huggingface dataset:
Data Security Issues Arising from Integration of Wireless Access into Healthcare Networks
Authors: John C. Frenzel
Venue: Journal of Medical Systems (2003)

The versatility of having Ethernet speed connectivity without wires is rapidly driving adoption of wireless data networking by end users across all types of industry. Designed to be easy to configure and work among diverse platforms, wireless brings online data to mobile users. This functionality is particularly useful in modern clinical medicine. Wireless presents operators of networks containing or transmitting sensitive and confidential data with several new types of security vulnerabilities, and potentially opens previously protected core network resources to outside attack. Herein, we review the types of vulnerabilities, the tools necessary to exploit them, and strategies to thwart a successful attack.
Power-/Energy Efficient BIST Schemes for Processor Data Paths
Authors: Nektarios Kranitis, Dimitris Gizopoulos, Antonis Paschalis, Mihalis Psarakis, Yervant Zorian
Venue: IEEE Design Test (2000)

Power in processing cores (embedded processors, DSPs) is primarily consumed in the datapath part which consists of high activity functional modules. In this paper, we propose low power/energy BIST schemes for datapath architectures built around the most common combinations of multipliers, adders, ALUs and shifters. The proposed BIST schemes are based on deterministic regular test sets. Different alternatives are proposed depending on whether the target is low total energy dissipation during an entire BIST session or low power dissipation (i.e. average energy dissipation between successive test vectors). The proposed BIST schemes are more efficient than pseudorandom BIST in terms of power/energy consumption for the same high fault coverage targets as shown by a comprehensive set of experiments performed using commercial power analysis tools. This fact is due to much lower circuit activity of the proposed deterministic BIST schemes compared to the circuit activity of classical pseudorandom BIST schemes.
Mining the Web's Link Structure
Authors: Soumen Chakrabarti, Byron E. Dom, S. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins, David Gibson, Jon Kleinberg
Venue: Computer (1999)

The Web is a hypertext body of approximately 300 million pages that continues to grow at roughly a million pages per day. Page variation is more prodigious than the data's raw scale: Taken as a whole, the set of Web pages lacks a unifying structure and shows far more authoring style and content variation than that seen in traditional text-document collections. This level of complexity makes an "off-the-shelf" database-management and information-retrieval solution impossible. To date, index-based search engines for the Web have been the primary tool by which users search for information. Such engines can build giant indices that let you quickly retrieve the set of all Web pages containing a given word or string. Experienced users can make effective use of such engines for tasks that can be solved by searching for tightly constrained keywords and phrases. These search engines are, however, unsuited for a wide range of equally important tasks. In particular, a topic of any breadth will typically contain several thousand or million relevant Web pages. How then, from this sea of pages, should a search engine select the correct ones-those of most value to the user?
The BT Intranet: Information by Design
Authors: Mark Norris, Paul Muschamp, Steve Sim
Venue: Computer (1999)

British Telecom's intranet hosts an array of information products that are an integral part of the way its employees do business. The authors provide a glimpse of how BT uses concepts like media engineering to develop usable and maintainable information products- information by design. As in any large organization, BT's 120,000 employees at 3,500 sites world-wide rely on effective internal communications to operate efficiently. The company's global expansion over the past few years had stretched long-established techniques, and it needed to recognize a new way of working. Investment in information technology had equipped BT with a sound communication infrastructure and a companywide mail system. In turn, these capabilities fueled a rapid expansion in the amount of online information. BT employees now handle a significant amount of process and project data and numerous internal processes using the company intranet. The authors look in some detail at several of the information products that help an organization to function efficiently as a global operator.
BIST Test Pattern Generators for Two-Pattern Testing-Theory and Design Algorithms
Authors: Chih-Ang Chen, Sandeep K. Gupta
Venue: IEEE Transactions on Computers (1996)

Testing for delay and CMOS stuck-open faults requires two-pattern tests, and typically a large number of two pattern tests are needed. Built-in self-test (BIST) schemes are attractive for comprehensive testing of such faults. BIST test pattern generators (TPGs) for two-pattern testing, should be designed to ensure high transition coverage. In this paper, necessary and sufficient conditions to ensure complete/maximal transition coverage for linear feedback shift register (LFSR) and cellular automata (CA) have been derived. The theory developed here identifies all LFSR/CA TPGs that maximize transition coverage under any given TPG size constraint. It is shown that LFSRs with primitive feedback polynomials with large number of terms are better for two-pattern testing. Also, CA are shown to be better TPGs than LFSRs for two pattern testing, independent of their feedback rules. Based on the necessary sufficient conditions, efficient algorithms to design optimal TPGs for two-pattern testing have been developed. Experiments on benchmark circuits indicate that TPGs designed using the procedures outlined in this paper obtain high robust path delay fault coverage in short test lengths.
The interval number of dense graphs
Authors: József Balogh, András Pluhár
Venue: Discrete Mathematics (2002)

The interval number of a graph G, denoted by i(G), is the least natural number t such that G is the intersection graph of sets, each of which is the union of at most t closed intervals. Most known bounds on i(G) are grossly excessive when G has more than half of the possible edges. A plausible remedy is to develop bounds on i(G) that are monotone decreasing in G. Here we bound i(G) in terms of e(G), the number of edges in the complement of G. We prove that i(G) ≤ ⌈½√e(G)⌉ + O(n/logn).
Manifestation of Berry's phase in Aharonov---Bohm oscillations in a 2D system with spin-orbit interaction
Authors: Jeng-Bang Yau, E. P. De Poortere, M. Shayegan
Venue: Microelectronic Engineering (2002)

Fourier spectra of the Aharonov-Bohm oscillations, measured in GaAs two-dimensional holes with a strong spin-orbit interaction, reveal side peaks in addition to the center peak whose frequency corresponds to the radius of the ring. A comparison of the experimental data with results of simulations demonstrates that the origin of the side peaks is the Berry's phase.
Embedding Star Networks into Hypercubes
Authors: Saïd Bettayeb, Bin Cong, Mike Girou, I. Hal Sudborough
Venue: IEEE Transactions on Computers (1996)

The star interconnection network has recently been suggested as an alternative to the hypercube. As hypercubes are often viewed as universal and capable of simulating other architectures efficiently, we investigate embeddings of star network into hypercubes. Ourt embeddings exhibit a marked trade-off between dilation and expansion. For the n-dimensional star network we exhibit: 1) a dialtion N¿ 1 embedding of Sn into HN, where $N=\left\lceil {\log _2(n! )} \right\rceil $, 2) a dilation 2(d + 1) embedding of Sn into $H_{2d+n-1}$, where $d=\left\lceil {\log _2(\left\lceil {{n \mathord{\left/ {\vphantom {n 2}} \right. \kern-\nulldelimiterspace} 2}} \right\rceil !)} \right\rceil $, 3) a dilation 2d + 2i embedding of $S_{2^im}$ into $H_{2^i\,d+i2^i\,m-2i+1}$, where $d=\left\lceil {\log _2(m\ !)} \right\rceil $, 4) a dilation L embedding of Sn into Hd, where $L=1+\left\lfloor {\log _2(n\ !)} \right\rfloor $, and d = (n¿ 1)L, 5) a dilation $(k+1){{(k+2)} \mathord{\left/ {\vphantom {{(k+2)} 2}} \right. \kern-\nulldelimiterspace} 2}$ embedding of Sn into $H_{n(k+1)-2^{k+1}\,+1}$, where $k=\left\lfloor {\log _2(n-1)} \right\rfloor $, 6) a dilation 3 embedding of $S_{2k+1}$ into $H_{2k^2\,+k}$, and 7) a dilation 4 embedding of $S_{3k+2}$ into $H_{3k^2\,+3k+1}$.Some of the embeddings are, in fact, optimum, in both dilation and expansion for small values of n. We also show that the embedding of Sn into its optimum hypercube requires dilation $\Omega (\log _2n)$.
AttrActive windows: active windows for pervasive computing applications
Authors: Les Nelson, Laurent Denoue, Elizabeth Churchill
Venue: Proceedings of the 8th international conference on Intelligent user interfaces (2003)

We introduce the AttrActive Windows user interface, a novel approach for presenting interactive content on large screen, interactive, digital, bulletin boards. Moving away from the desktop metaphor, AttrActive Windows are dynamic, non-uniform windows that can appear in different orientations and have autonomous behaviours to attract passers-by and invite interactions.
Maintaining security and timeliness in real-time database system
Authors: Quazi N. Ahmed, Susan V. Vrbsky
Venue: Journal of Systems and Software (2002)

Real-time database systems can have security constraints in addition to timing constraints. Such real-time systems are typically contained in environments that exhibit hierarchical propagation of information, where mandatory access control for security is required. Conventional multilevel secure (MLS) database models that implement mandatory access control are inadequate for time-critical applications and conventional real-time database models do not address security constraints. The objective of this work is to incorporate security constraints in real-time database systems in such a way that not only is security achieved, but achieving security does not degrade real-time performance significantly in terms of deadlines missed. We present two concurrency control algorithms for secure real-time databases: the Secure two-phase locking high priority (2PLHP) algorithm is based on a two-phase locking protocol and the Secure optimistic concurrency control (OPT) algorithm uses the properties of an optimistic concurrency protocol. We implement the two algorithms and study their performance using a real-time database system simulation model. Our study covers both soft and firm real-time databases. Results show that both the algorithms perform fairly well in terms of security and timeliness compared to non-secure algorithms. We show that achieving increased security does not necessarily mean an increased sacrifice in real-time performance.
Database Support for Knowledge-Based Engineering Environments
Authors: Gail E. Kaiser, Naser S. Barghouti, Peter H. Feiler, Robert W. Schwanke
Venue: IEEE Expert: Intelligent Systems and Their Applications (1988)

The authors discuss Marvel, a knowledge-based engineering environment that can be instantiated with the entities and tools for a specific engineering project, together with rules regulating (technical) conduct of the project. The resulting environment maintains database representations of entities and carries out menial chores through controlled automation. The authors concentrate on the details of MSL (Marvel Strategy Language) and tool envelopes, including the algorithms used in the various parts of the Marvel system. These algorithms are different from those used for other expert systems because of Marvel's requirement for large-scale entities, the ability to load and unload strategies with different behavior and views of the database structure, and the overhead of tool processing effectively prohibiting 'undo' during backtracking.
Parallel Rule-Based Fuzzy Inference on Mesh-Connected Systolic Arrays
Authors: M. A. Eshera, X. C. Barash
Venue: IEEE Expert: Intelligent Systems and Their Applications (1989)

The authors describe a scheme for performing fuzzy-reasoning and fuzzy-inference operations in parallel on mesh-connected array processors such as the geometric arithmetic parallel processor (GAPP) and the advanced systolic array processor (ASAP). The reasoning mechanism is a general, fuzzy, rule-based inference network. The array is configured into stages, and the scheme operates in a pipeline configuration, where different sets of data move sequentially between the stages. The authors investigated the tradeoff between space and time complexity of the proposed technique and achieved a fast, space-efficient implementation of the approach. Before presenting the proposed system, they review briefly the concepts of inexact reasoning, fuzzy inference, and mesh-connected fine-grain parallel computer architecture.
US Electoral Reform: The Obvious Obligation
Authors: Neville Holmes
Venue: Computer (2001)

Flaws in the US electoral system, if left uncorrected, could imperil democracy worldwide.
Difficulties in Integrating Multiview Development Systems
Authors: Scott Meyers
Venue: IEEE Software (1991)

Drawbacks of current approaches to integrating multiple perspectives in a development environment are discussed. An integrated environment is defined as one in which a dynamic collection of tools can work together on a single system so that changes made to the system by one tool can be seen by other tools, and integration criteria are set forth. Five representative approaches to systems integration-shared file systems, selective broadcasting, simple databases, view-oriented databases, and canonical representation-are examined, and their relative strengths and weaknesses are summarized. None of the integration mechanisms is shown to be uniformly superior to the others. The issue of environment evolution and its effect on integration is addressed.
Hierarchical Discretized Pursuit Nonlinear Learning Automata with Rapid Convergence and High Accuracy
Authors: G. I. Papadimitriou
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

A new absorbing multiaction learning automaton that is epsilon-optimal is introduced. It is a hierarchical discretized pursuit nonlinear learning automaton that uses a new algorithm for positioning the actions on the leaves of the hierarchical tree. The proposed automaton achieves the highest performance (speed of convergence, central processing unit (CPU) time, and accuracy) among all the absorbing learning automata reported in the literature up to now. Extensive simulation results indicate the superiority of the proposed scheme. Furthermore, it is proved that the proposed automaton is epsilon-optimal in every stationary stochastic environment.
Partial Smoothing Splines for Noisy +Boundaries with Corners
Authors: M. H. Chen, R. T. Chin
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

Investigates the estimation of 2-D boundary functions from sampled data sets where both noise and corners are present. The approach is based on the partial smoothing spline in which the estimated boundary function consists of an ordinary smoothing spline and a parametric function that describes the discontinuities (i.e., corners of the boundary). Prior knowledge about the boundary, such as the number of corners, their locations, noise levels, and the amount of smoothness, is not required for the boundary estimate. The smoothing parameter and the corner locations of the spline, which are parts of the estimate, are determined by the generalized cross-validation method whereby statistical properties are gathered from the input sampled data rather than specified a priori. This approach enables the smoothing of a noisy boundary while retaining an accurate description of the boundary corners. Extensive experiments were conducted to verify its ability to smooth noise while retaining a good representation of boundary corners, and do not rely on any prior information.
A Novel Sampling Approach to Combinatorial Optimization Under Uncertainty
Authors: Urmila M. Diwekar
Venue: Computational Optimization and Applications (2003)

The generalized approach to stochastic optimization involves two computationally intensive recursive loops: (1) the outer optimization loop, (2) the inner sampling loop. Furthermore, inclusion of discrete decision variables adds to the complexity. The focus of the current endeavor is to reduce the computational intensity of the two recursive loops. The study achieves the goals through an improved understanding and description of the sampling phenomena based on the concepts of fractal geometry and incorporating the knowledge of the accuracy of the sampling (fractal model) in the stochastic optimization framework thereby, automating and improving the combinatorial optimization algorithm. The efficiency of the algorithm is presented in the context of a large scale real world problem, related to the nuclear waste at Hanford, involving discrete and continuous decision variables, and uncertainties. These new developments reduced the computational intensity for solving this problem from an estimated 20 days of CPU time on a dedicated Alpha workstation to 18 hours of CPU time on the same machine.
Analysis of Range Queries and Self-Spatial Join Queries on Real Region Datasets Stored Using an R-Tree
Authors: Guido Proietti, Christos Faloutsos
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

In this paper, we study the node distribution of an R-tree storing region data, like, for instance, islands, lakes, or human-inhabited areas. We will show that real region datasets are packed in an R-tree into minimum bounding rectangles (MBRs) whose area distribution follows the same power law, named REGAL (REGion Area Law), as that for the regions themselves. Moreover, these MBRs are packed in their turn into MBRs following the same law, and so on iteratively, up to the root of the R-tree. Based on this observation, we are able to accurately estimate the search effort for range queries, using a small number of easy-to-retrieve parameters. Furthermore, since our analysis exploits, through a realistic mathematical model, the proximity relations existing among the regions in the dataset, we show how to use our model to predict the selectivity of a self-spatial join query posed on the dataset. Experiments on a variety of real datasets (islands, lakes, human-inhabited areas) show that our estimations are accurate, enjoying a geometric average relative error ranging from 22 percent to 32 percent for the search effort of a range query, and from 14 percent to 34 percent for the selectivity of a self-spatial join query. This is significantly better than using a naive model based on uniformity assumption, which gives rise to a geometric average relative error up to 270 percent and up to 85 percent for the two problems, respectively.
Removal of Redundant Dependences in DOACROSS Loops with Constant Dependences
Authors: V. P. Krothapalli, P. Sadayappan
Venue: IEEE Transactions on Parallel and Distributed Systems (1991)

An efficient algorithm to remove redundant dependences in simple loops with constant dependences is presented. Dependences constrain the parallel execution of programs and are typically enforced by synchronization instructions. The synchronization instructions represent a significant part of the overhead in the parallel execution of a program. Some program dependences are redundant because they are covered by other dependences. It is shown that unlike with single loops, in the case of nested loops, a particular dependence may be redundant at some iterations but not redundant at others, so that the redundancy of a dependence may not be uniform over the entire iteration space. A sufficient condition for the uniformity of redundancy in a doubly nested loop is developed.
Distributed Artificial Intelligence for Runtime Feature-Interaction Resolution
Authors: Hugo Velthuijsen
Venue: Computer (1993)

The feature-interaction problem has many different instances. It is argued that some instances lend themselves to a distributed artificial intelligence (DAI) approach. The use of DAI techniques in current telecommunications systems appears quite natural in light of two trends in the way these systems are designed: the distribution of functionality and the incorporation of intelligence. The author illustrates the relevance of DAI techniques to the feature-interaction problem by discussing existing work (lodes, team-CPS, multistage negotiation, and negotiating agents) that address one or more instances of the problem. He further identifies the kind of cooperation and coordination that the feature-interaction problem requires and the interesting research problems it poses to distributed artificial intelligence.
Shared Red Bricks
Venue: IEEE Design Test (2002)

(available without subscription)No abstract available.
Making money selling content that others are giving away
Authors: Alan H. Karp
Venue: Communications of the ACM (2003)

Attempts to protect existing business models will only serve to delay, or even prevent, the arrival of new content-delivery approaches.
Lessons in Global Information Technology Sourcing
Authors: Mary Lacity
Venue: Computer (2002)

Research firms estimate the current global outsourcing market to be ashigh as US$500 billion, with the number of external IT outsourcing suppliersswelling into the thousands. Most notable, however, is how well customershave learned to exploit the IT services market. The author and her colleagues studiedsourcing practices in 543 large and small organizations worldwide, measuringactual outcomes against expected out-comes to draw conclusions about practicesassociated with success and failure. The lessons from this IT sourcingresearch should help both customers and suppliers avoid sourcing pitfalls, allowingthem to establish contracts and develop relationship management capabilitiesthat will benefit both parties.
Practical perspectives on software architectures, high-level design, and evolution
Authors: Tommi Mikkonen, Peeter Pruuden
Venue: Proceedings of the 4th International Workshop on Principles of Software Evolution (2001)

Evolving software gets more complex in each increment. As real-life increments tend to be additive rather than upgrades with more fundamental purpose, the underlying code base keeps extending. With such increments, the associated core architecture of the system gets more and more difficult to modify, because an increasing number of functions are attached to it. Therefore, only the first versions of systems can be properly architected, whereas later versions rely on an already existing architecture into which new features are reflected as change requests. Due to this reason, architecture and high-level design in the scope of evolved software systems becomes primarily impact analysis and reengineering, and only secondarily design of new software artifacts, especially when considering large systems that have a long history. Every now and then, however, it may be possible to upgrade very core structures of a system, resulting in a new generation of the system. Understanding of these basic phenomena gives rise to practices that compensate the increase of complexity of software during software evolution.
How Liable Are You for Your Software?
Venue: IEEE Software (1991)

The applicability of product-liability law to software is examined, using a hypothetical case to illustrate the difficulties. Product liability is reviewed, and the issue of whether software is a product is explored. The question of what standard of care to use in judging the developer's conduct is considered. Some guidelines for assessing exposure to liability are provided.
On Sufficient Conditions for the Existence of a Fuchsian Equation with Prescribed Monodromy
Authors: A. A. Bolibrukh
Venue: Journal of Dynamical and Control Systems (1999)

Recent sufficient conditions for positive solvability of the Riemann&ndash;Hilbert problem, known and new, are presented.