ppxscal/embedding_network huggingface dataset:
Subthreshold slope modulation in G4-FET transistor
Authors: B. Dufrene, B. Blalock, S. Cristoloveanu, K. Akarvardar, T. Higashino, M. Mojarradi
Venue: Microelectronic Engineering (2004)

We describe the operation of the novel SOI four-gate transistor (G4-FET) in the subthreshold region. The subthreshold slope, which may be defined with respect to either the junction gates or MOS gates, is adjustable using the remaining gates. A comparison of conventional MOSFET swings and G4-FET swings shows improved subthreshold slope. Systematic experimental data and simulations show the bias conditions for optimized performance.
Scheduling Communication in Real-Time Sensor Applications
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

We consider a class of wireless sensor applications-such as mobile robotics-that impose timeliness constraints. We assume that these applications are built usingcommodity 802.11 wireless networks and focus on theproblem of providing qualitatively-better QoS during networktransmission of sensor data. Our techniques are designedto explicitly avoid network collisions and minimizethe completion time to transmit a set of sensor messages. Weargue that this problem is NP-complete and present threeheuristics, based on edge coloring, to achieve these goals.Our simulations results show that the minimum weight colorheuristic is robust to increases in communication densityand yields results that are close to the optimal solution.
From information processing to dialogical meaning making: an experiential approach to cognitive ergonomics
Authors: John McCarthy, Peter Wright, Michael Cooke
Venue: Cognition, Technology and Work (2004)

In this paper, we argue that modelling human action as the execution of predetermined goals and cognition as information processing does not account for people&#x2019;s experience with emerging technologies, which is as much about values, trust and identity as about executing tasks. We offer a complementary approach to information processing within cognitive ergonomics, which builds on Bruner&#x2019;s characterisation of cognition as meaningmaking, and which sees human action as simultaneously creating and executing goals and human cognition as dialogical meaning making. An analysis of field work carried out in two ambulance control centres is employed to exemplify aspects of the creativity and responsivity of work activity that are central to our approach. Finally, in this context, we briefly consider how technological artefacts could be conceptualised as centres of value in an approach to cognitive ergonomics that attempts to accommodate the intellectual, emotional and valuative aspects of work activity.
Where the bugs are
Authors: Thomas J. Ostrand, Elaine J. Weyuker, Robert M. Bell
Venue: Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis (2004)

The ability to predict which files in a large software system are most likely to contain the largest numbers of faults in the next release can be a very valuable asset. To accomplish this, a negative binomial regression model using information from previous releases has been developed and used to predict the numbers of faults for a large industrial inventory system. The files of each release were sorted in descending order based on the predicted number of faults and then the first 20% of the files were selected. This was done for each of fifteen consecutive releases, representing more than four years of field usage. The predictions were extremely accurate, correctly selecting files that contained between 71% and 92% of the faults, with the overall average being 83%. In addition, the same model was used on data for the same system's releases, but with all fault data prior to integration testing removed. The prediction was again very accurate, ranging from 71% to 93%, with the average being 84%. Predictions were made for a second system, and again the first 20% of files accounted for 83% of the identified faults. Finally, a highly simplified predictor was considered which correctly predicted 73% and 74% of the faults for the two systems.
Physical And Reduced-Order Dynamic Analysis of MEMS
Authors: S. K. De, N. R. Aluru
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

In this paper, we first present an efficient physical level simulationmethod for the dynamic analysis of electrostatic micro-electro-mechanicalsystems (MEMS). This method is then used to analyzeMEMS dynamics. Stiffness hardening or softening of MEM structureshas been shown to depend both on the applied voltage andthe geometry. The existence of multiple resonant peaks in the frequencyresponse diagram has been presented. We have shown thata DC bias along with an appropriate AC bias can give fast switchingat a considerably less peak power requirement. Finally, a reducedorder model has been developed based on Karhunen-Loèvedecomposition for the dynamic simulation of MEMS. Reduced ordermodels are cheap in terms of memory and computational timeand are needed to perform fast and efficient system-level compositecircuit and micro-mechanical simulations.
Concurrent open shop scheduling to minimize the weighted number of tardy jobs
Authors: C. T. Ng, T. C. E. Cheng, J. J. Yuan
Venue: Journal of Scheduling (2003)

We consider a relaxed version of the open shop scheduling problem--the "concurrent open shop" scheduling problem, in which any two operations of the same job on distinct machines are allowed to be processed concurrently. The completion time of a job is the maximum completion time of its operations. The objective is to schedule the jobs so as to minimize the weighted number of tardy jobs, with 0-1 operation processing times and a common due date d. We show that, even when the weights are identical, the problem has no (1-ε)ln m-approximation algorithm for any ε > 0 if NP is not a subset of DTIME(nlog log n), and has no c ċ ln m-approximation algorithm for some constant c > 0 if P ≠ NP, where m is the number of machines. This also implies that the problem is strongly NP-hard. We also give a (1+d)- approximation algorithm for the problem.
Declarative specification of Web applications exploiting Web services and workflows
Authors: Marco Brambilla, Stefano Ceri, Sara Comai, Marco Dario, Piero Fraternali, Ioana Manolescu
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

This demo presents an extension of a declarative language for specifying data-intensive Web applications. We demonstrate a scenario extracted from a real-life application, the Web portal of a computer manufacturer, including interactions with third-party service providers and enabling distributors to participate in well-defined business processes. The crucial advantage of our framework is the high-level modeling of a complex Web application, extended with Web service and workflow capabilities. The application is automatically verified for correctness and the code is automatically generated and deployed.
Clustering objects on a spatial network
Authors: Man Lung Yiu, Nikos Mamoulis
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Clustering is one of the most important analysis tasks in spatial databases. We study the problem of clustering objects, which lie on edges of a large weighted spatial network. The distance between two objects is defined by their shortest path distance over the network. Past algorithms are based on the Euclidean distance and cannot be applied for this setting. We propose variants of partitioning, density-based, and hierarchical methods. Their effectiveness and efficiency is evaluated for collections of objects which appear on real road networks. The results show that our methods can correctly identify clusters and they are scalable for large problems.
Learning Functions Using Randomized Genetic Code-Like Transformations: Probabilistic Properties and Experimentations
Authors: Hillol Kargupta
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

Inductive learning of nonlinear functions plays an important role in constructing predictive models and classifiers from data. This paper explores a novel randomized approach to construct linear representations of nonlinear functions proposed elsewhere [CHECK END OF SENTENCE], [CHECK END OF SENTENCE]. This approach makes use of randomized codebooks, called the Genetic Code-Like Transformations (GCTs) for constructing an approximately linear representation of a nonlinear target function. This paper first derives some of the results presented elsewhere [CHECK END OF SENTENCE] in a more general context. Next, it investigates different probabilistic and limit properties of GCTs. It also presents several experimental results to demonstrate the potential of this approach.
From Sequence to Structure Using PF2: Improving Methods for Protein Folding Prediction
Authors: Saleem Hussain
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

Projects dependent on proteomic data are challenged not by the lack of methods to analyzethis information, but by the lack of means to capture and manage the data. A few primaryplayers in the bioinformatics realm are promoting the use of selected standardized technologies to access biological data. Many organizations exposing bioinformatics tools, however, do not have the resources required for utilizing these technologies. In order to provide interfaces for non-standardized bioinformatics tools, open-source projects have led to the development of hundreds of software libraries. These tools lack architectural unity, making it difficult to script bioinformatics research projects, such as protein structure prediction algorithms, which involve the use of multiple tools in varying order and number.As a solution, we have focused on building a software model, named the Protein FoldingPrediction Framework (PF2), which provides a unifying method for the addition and usage ofconnection modules to bioinformatics databases exposed via web-based tools, software suites, or e-mail services. The framework provides mechanisms that allow users to create and add new connections without supplementary code as well as to introduce entirely new logical scenarios. In addition, PF2 offers a convenient interface, a multi-threaded execution-engine, and a built-in visualization suite to provide the bioinformatics community with an end-to-end solution for performing complex genomic and proteomic inquiries.
Achieving Design Closure Through Delay Relaxation Parameter
Authors: Ankur Srivastava, Seda Ogrenci Memik, Bo-Kyung Choi, Majid Sarrafzadeh
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Current design automation methodologies are becoming incapableof achieving design closure especially in the presence of deep submicroneffects. This paper addresses the issue of design closure from ahigh level point of view. A new metric called delay relaxation parameter(DRP) for RTL (Register Transfer Level) designs is proposed. DRPessentially captures the degree of delay relaxation that the design cantolerate without violating the clock constraint. This metric when optimizedresults in quicker design flow. Algorithms to optimize DRP areformulated and their optimality are investigated. Experimental resultsare conducted using a state of the art design flow with Synopsys DesignCompiler followed by Cadence Place and Route. Our approachof optimizing DRP resulted in lesser design iterations and faster designclosure as compared to designs generated through Synopsys BehavioralCompiler and a representative academic design flow.
TWISTER: An Immersive Autostereoscopic Display
Authors: Kenji Tanaka, Junya Hayashi, Masahiko Inami, Susumu Tachi
Venue: Proceedings of the IEEE Virtual Reality 2004 (2004)

This paper describes in detail the design, development,and evaluation of the TWISTER III (Telexistence Wide-angleImmersive STEReoscope) and demonstrates how thissystem can display immersive three-dimensional full-colorand live motion pictures without the need for special eye-wear.The device works as a cylindrical display by rotating30 display units around an observer and presentingtime-varying patterns, while immersive autostereoscopic visionis achieved by employing a "rotating parallax barrier"method.After explaining the principle, we discuss the designsand implementations for maximum performance invarious aspects of the display.We also evaluate the display.
An Energy-Efficient Network-on-Chip for a Heterogeneous Tiled Reconfigurable Systems-on-Chip
Authors: Nikolay Kavaldjiev, Gerard J. M. Smit
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

This paper proposes a Network-on-Chip architecture that offers high flexibility and performance.It is used in a System-on-Chip platform for future multimedia mobile devices.The network is packet switching wormhole network with virtual-channel flow control and source routing.The initial implementation results for a network router show its feasibility and size comparable with other available solutions.
Heuristic Contention-Free Broadcast in Heterogeneous Networks of Workstations with Multiple Send and Receive Speeds
Authors: Chao Lin
Venue: The Journal of Supercomputing (2004)

This paper presents three efficient contention-free algorithms for broadcasting on heterogeneous networks of workstations (HNOW). In an HNOW, many different speed types of workstations can have distinct send and receive overhead. Previous research has shown that finding an optimal routing scheme in an HNOW is not easy [2,12], because properly arranging all workstations in the scheduling tree is difficult. Therefore, this investigation focuses mainly on enhancing the performance of an HNOW by properly arranging fastest nodes into the internal nodes of upper levels in the scheduling tree. Fastest node first is fundamental in designing an efficient algorithm. This paper presents three schemes called EBS, VBBS, and VBBSWF. All of these three schemes can be executed in O(n log(n)) time, where n is the number of workstations. They are all contention-free when broadcasting in an HNOW. Based on the simulation result, the proposed schemes outperform the broadcast with minimal steps [13] and the scheduling tree [22] generated by dynamic programing in an HNOW.
Improving System Dependability with Functional Alternatives
Authors: Charles P. Shelton, Philip Koopman
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

We present the concept of alternative functionality forimproving dependability in distributed embedded systems.Alternative functionality is a mechanism that complementstraditional performability and graceful degradationtechniques. Rather than providing reduced performanceor functionality when components or subsystems fail,alternative functionality replaces a lost feature withanother existing system function that can substitute for thelost service. This can provide improved systemdependability when it is not feasible to allocate dedicatedbackup systems for fault tolerance. We show howalternative functionality can be applied to enhance systemdependability with a case study of an elevator controlsystem. In simulation, an elevator design that implementedalternative functionality in some of its subsystems toleratedmany combinations of component failures that causedsystem failures in the original design.
On Iterative Learning Control
Authors: Toshiharu Sugie
Venue: Proceedings of the International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2004)

This paper describes a new type of iterative learningcontrol (ILC) which seeks the desired input in an appropriatefinite dimensional input subspace. The method achievesperfect tracking for a class of uncertain systems without usingtime derivative of tracking error signals in the learninglaw. Its effectiveness is demonstrated by experiments. In addition,an application of the ILC method to continuous-timemodel identification is shown.
Alternative strategies for Performing Spatial Joins on Web Sources
Authors: Cyrus Shahabi, Mohammad R. Kolahdouzan, Maytham Safar
Venue: Knowledge and Information Systems (2004)

With the current information explosion on the Web, numerous applications require access to a collection of different but related pieces of distributed geospatial data. In this paper, we focus on one set of such applications that requires efficient support of spatial operations (specifically, spatial join) on distributed non-database sources. The main challenge with this environment is that remote sources are usually read-only and/or do not support spatial queries. Moreover, several of these Web-based applications can tolerate either some level of inaccuracy or progressively filtered (or polished) results. Therefore, conventional distributed spatial join strategies are not applicable or efficient in this environment. To address these challenges, we first break down the process of distributed spatial join operation into three steps: (1) local to remote transfer, (2) remote spatial selection, and (3) local refinement. Then, for each step, we propose and study alternative techniques and by varying their combinations, we generate several query plans. Each plan strives to strike a compromise between efficiency and accuracy. Since the techniques proposed for the first step have significant impact on the overall performance of the query, we specially focus our attention on this step. We propose two heuristics for the first step to reduce either the number of selection queries or the area covered by each selection query. Within a realistic experimental set-up, we show that one heuristic is more appropriate with fast networks and a powerful local server, while the other one is superior in the opposite situation. Our experiments also show that both heuristics outperform approaches based on transmitting either the actual spatial objects or their bounding boxes. Note that the intention of this paper is not to propose a query optimizer to choose one plan over the others. Instead, it serves as a first step towards the design of such an optimizer by concentrating on the design and evaluation of several alternative plans within a realistic experimental set-up.
Requirements Driven Software Evolution
Venue: Proceedings of the 12th IEEE International Workshop on Program Comprehension (2004)

Software evolution is an integral part of the software lifecycle. Furthermore in the recent years the issue of keepinglegacy systems operational in new platforms has becomecritical and one of the top priorities in IT departmentsworldwide. The research community and the industryhave responded to these challenges by investigating andproposing techniques for analyzing, transforming, integrating,and porting software systems to new platforms, languages,and operating environments.In this working session, we plan to assess the state ofthe art in these areas, discuss on-going work, and identifyfurther research issues.
Fast Computation of Iceberg Dwarf
Authors: Xiang Longgang, Feng Yucai
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

Iceberg Dwarf (IceDwarf for short) combines thestrength of Iceberg-Cube and Dwarf. It exploits the elegantDwarf structure for cube tuple store and eliminates thoseunsatisfied sub-dwarfs. By only storing nontrivial cubetuples, IceDwarf reduces the size of a dwarf significantly;even Dwarf itself compresses the data cube effectively.We studied how to efficiently compute icedwarfs, anddeveloped a straightforward algorithm (PAC). To furtherimprove the performance, we explored the structure ofDwarf and presented four nice lemmas. Based on theseobservations, we proposed a new algorithm called PWC. Itbuilds the IceDwarf by bottom-up computing all thepartitions of a fact table and inserting them into the Dwarfstructure, enabling Apriori-like pruning and single tuplepartition optimization, and facilitating the detection ofsuffix redundancies. Our performance study showed thatPWC is highly efficient and runs much faster than PAC foricedwarfs, even for computing full dwarfs.
A database model of debugging
Authors: Michael L. Powell, Mark A. Linton
Venue: ACM SIGSOFT Software Engineering Notes (1983)

Debugging a program can be viewed as performing queries and updates on a database that contains both program source and execution state information. This model of debugging simplifies a "debugger" to a database interface for runtime information and allows the debugger to be easily integrated into a programming environment. We are currently designing a programming environment in which all program information is stored in a relational database system. This system will include debugging capabilities to provide the programmer a simple yet powerful mechanism for describing debugging requests
Using Active Learning in Intrusion Detection
Authors: Magnus Almgren, Erland Jonsson
Venue: Proceedings of the 17th IEEE workshop on Computer Security Foundations (2004)

Intrusion Detection Systems (IDSs) have become an importantpart of operational computer security. They are thelast line of defense against malicious hackers and help detectongoing attacks as well as mitigate their damage. However,intrusion detection systems are not turnkey solutionsbut are heavily dependent on expensive and scarce securityexperts for successful operation. By emphasizing self-learningalgorithms, we can reduce dependence on the domainexpert but instead require massive amounts of labeledtraining data, another scarce resource in intrusion detection.In this paper we investigate whether an active learningalgorithm can perform on a par with a traditional self-learningalgorithm in terms of detection accuracy but usingsignificantly less labeled data. Our preliminary findingsindicate that the active learning algorithm generally performsbetter than the traditional learning algorithm giventhe same amount of training data. Moreover, the reductionof labeled data needed can be as much as 80 times, shownby comparing an active learner with a traditional learnerwith similar detection accuracy. Thus, active learning algorithmsseem promising in that they can reduce the dependenceon security experts in the development of new detectionrules by better leveraging the knowledge and time of the expert.
A conjecture concerning the Smarandache dual function
Authors: Maohua Le
Venue: Smarandache Notions Journal (2004)

In this paper we verify a conjecture concerning the Smarandache dual function.
Natural Inspiration for Self-Adaptive Systems
Authors: Richard John Anthony
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

The emergent behaviour of autonomic systems, together with the scale of their deployment, impedes prediction of the full range of configuration and failure scenarios; thus it is not possible to devise management and recovery strategies to cover all possible outcomes. One solution to this problem is to embed self-managing and self-healing abilities into such applications. Traditional design approaches favour determinism, even when unnecessary. This can lead to conflicts between the non-functional requirements. Natural systems such as ant colonies have evolved cooperative, finely tuned emergent behaviours which allow the colonies to function at very large scale and to be very robust, although non-deterministic. Simple pheromone-exchange communication systems are highly efficient and are a major contribution to their success. This paper proposes that we look to natural systems for inspiration when designing architecture and communications strategies, and presents an election algorithm which encapsulates non-deterministic behaviour to achieve high scalability, robustness and stability.