ppxscal/embedding_network huggingface dataset:
An Empirical Study on the Impact of Organizational Memory on Organizational Performance in Manufacturing Companies
Authors: Zhang Li, Tian YeZhuang, Qi ZhongYing
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

Knowledge is the important asset in organizations. Effective knowledge management plays a crucial role in organizational development. Organizational memory (OM) integrates all kinds of organizational knowledge. It is regarded as the central prerequisite for IT support of knowledge management. The paper analyzes the knowledge structure of OM in manufacturing company from internal and external sources of organizational knowledge. OM in manufacturing company is composed of four types, that is, managerial OM, technical OM, cultural OM and marketing OM. These four types of OM components enhance organizational development jointly. Based on the data from International Manufacturing Strategy Survey (IMSS), factor analysis is used to test the classification of OM and organizational performance (OP), canonical correlation analysis is conducted on the impact of OM components on OP in manufacturing companies. The results from structural equation modeling suggest that OM is a dynamic factor, OM formed in different time has different impact on OP.
SLOCOP-II: a versatile timing verification system for MOSVLSI
Authors: P. Johannes, P. Das, L. Claesen, H. De Man
Venue: Proceedings of the conference on European design automation (1990)

The new SLOCOP-II timing verification system for the accurate performance analysis of MOSVLSI circuits is being presented. The algorithms in SLOCOP-II solve the serious problem of "false paths" that occur in all existing timing verifiers, by taking into account the logic functionallity of the circuits at hand. To allow this for custom MOSVLSI designs, new event determination algorithms based on binary decision tree (BDT) have been developed and are presented in this paper. The algorithms to avoid the indication of "false longest delay paths" can take a long calculation time. There fore two new techniques have been developed: 1) by preprocessing the constrained event graph, compiled code can be generated that can execute orders of magnitude faster and 2) by exploiting the hierarchy available in circuits. These algorithms have been implemented in the SLOCOP-II timing verification system. Results and comparative cpu-times on parameterised modules in the CATHEDRAL-II library are presented in the paper.
Energy and peak-current per-cycle estimation at RTL
Authors: Subodh Gupta, Farid N. Najm
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2003)

We present novel macromodeling techniques for estimating the energy dissipated and peak-current drawn in a logic circuit for every input vector pair (we call this the energy-per-cycle and peak-current-per-cycle, respectively). The macromodels are based on classifying the input vector pairs on the basis of their Hamming distances and using a different equation-based macromodel for every Hamming distance. The variables of our macromodel are the zero-delay transition counts at three logic levels inside the circuit. We present an automatic characterization process by which such macromodels can be constructed. The energy-per-cycle macromodel provides a transient energy wave-form, and can also be used to estimate the moving average energy over any time window, whereas peak-current-per-cycle macromodel provides peak-current which can be used for studying IR drop problems. Some key features of this technique are: 1) the models are compact (linear in the number of inputs); 2) they can be used for any input sequence; and 3) the characterization is automatic and requires no user intervention. These approaches have been implemented and models have been built and tested for many circuits. The average errors observed in estimating the energy-per-cycle and peak-current-per-cycle are under 20%. The energy-per-cycle model can also be used to measure the long-term average power, with an observed error of under 10% on average.
Study of Main Technology in Rich Media Grid Delivery
Authors: Zhihui Lv, Yiping Zhong, Shiyong Zhang, Jie Wu
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

From some difficulties confronted with edge delivery technologies today, a novel grid delivery solution, rich media grid delivery technology, is introduced in this paper. We study in detail the main key technologies in this field, including time shifting technique, adaptive rate multiserving technique, outer edge caching technique, and grid delivery security, etc. From our researchexperiences and related surveys, we analyze the main challenges in current theory research and application development of this field, and related experimental result. At last, this thesis illustrates the prospective research direction of rich media grid delivery.
Introducing non-computer science undergraduates to Web development: results of an investigative study on student teachers
Authors: Marina Papastergiou
Venue: ACM SIGCSE Bulletin (2003)

In this study, we report on the results of a series of workshops aiming at introducing student teachers to Web development.
Exploiting Crosstalk to Speed up On-Chip Buses
Authors: Chunjie Duan, Sunil P. Khatri
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

In modern VLSI processes, the cross-coupling capacitance between adjacent neighboring wires on the same metal layer is a very large fraction of the total wire capacitance. This leads to problems of delay variation due to crosstalk and reduced noise immunity, arguably one of the biggest obstacles in the design of ICs in recent times.This problem is particularly severe in long on-chip buses, since bus signals are routed at minimum pitch for long distances. In this work, we propose to solve this problem by the use of crosstalk canceling CODECs. We only utilize memoryless CODECs, to reduce the logical complexity and enhance the robustness of our techniques.Bus data patterns can be classified (as 4 ¿ C, 3 ¿ C, amount of crosstalk that they can exhibit. Crosstalk avoidance CODECs which eliminate 4 ¿ C and 3 ¿ C patterns have been reported. In this paper, we describe crosstalk avoidance techniques which eliminate 2 ¿ C and 1 ¿ C patterns. We describe an analytical methodology to accurately characterize the bus area overhead 2 ¿ C pattern CODECs. Using these results, we characterize the area overhead versus crosstalk immunity achieved. A similar exercise is performed for 1 ¿ C patterns.Our experimental results show that by using 2 ¿ C crosstalk canceling techniques, buses can be sped up by up to a factor of 6 with an area overhead of about 200%, and that 1 ¿ C techniques are not very robust.
Detecting region outliers in meteorological data
Authors: Jiang Zhao, Chang-Tien Lu, Yufeng Kou
Venue: Proceedings of the 11th ACM international symposium on Advances in geographic information systems (2003)

Spatial outliers are the spatial objects with distinct features from their surrounding neighbors. Detection of spatial outliers helps reveal important and valuable information from large spatial data sets. In the field of meteorology, for example, spatial outliers can be associated with disastrous natural events such as tornadoes, hurricane, and forest fires. Previous study of spatial outlier mainly focuses on point data. However, in the meteorological data or other applications, spatial outliers are frequently represented in region, i.e., a group of points, with two dimensions or even three dimensions, and the previous point-based approaches may not be appropriate to be used. As region outliers are commonly multi-scale objects, wavelet analysis is an effective tool to study them. In this paper, we propose a wavelet analysis based approach to detect region outliers. We discuss the region outlier detection problem and design a suite of algorithms to effectively discover them. The algorithms were implemented and evaluated with a real-world meteorological data set.
Probabilistic routing in intermittently connected networks
Authors: Anders Lindgren, Avri Doria, Olov Schelén
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2003)

We consider the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exist at any time, rendering traditional routing protocols unable to deliver messages between hosts. We propose a probabilistic routing protocol for such networks.
Design and implementation of the HiperLan/2 protocol
Authors: E. P. Vasilakopoulou, G. E. Karastergios, G. D. Papadopoulos
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2003)

In recent years, wireless communication systems have experienced an enormous development, leading to the emergence of various wireless networks standards. These standards are characterized by different properties, such as their coverage, data rates, mobility and QoS support. Among them the HiperLan/2 standard is distinguished of its performance, supporting the provision of high-speed integrated services. Its centralized Medium Access Control protocol though is the most critical and complex functional entity, enabling the management of the air-interface in real time and the efficient allocation of the bandwidth resources to the users. In this paper we will present the architecture and implementation of the HiperLan/2 MAC protocol, placing special emphasis on its timing requirements that define the hardware/software partitioning scheme of the developed system. The proposed architecture relieves the network upper layers of processing time critical events, enforcing the emergence of HiperLan/2 commercial products.
Lagrangean based methods for solving large-scale cellular network design problems
Authors: Filipe F. Mazzini, Geraldo R. Mateus, James Macgregor Smith
Venue: Wireless Networks (2003)

The cellular network design (CND) problem is formulated as a comprehensive linear mixed integer programming model integrating the base station location (BSL) problem, the frequency channel assignment (FCA) problem and the topological network design (TND) problem. A solution algorithm based on Lagrangean relaxation is proposed for solving this complex cellular network design problem. Pursuing the optimum solution through exact algorithms to this problem appears to be unrealistic considering the large scale nature and NP-hardness of the problem. Therefore, the solution algorithm strategy consists in computing effective lower and upper bounds for the problem. Lower bounds are evaluated through a Lagrangean relaxation technique and subgradient method. A Lagrangean heuristic is developed to compute upper bounds based on the Lagrangean solution. The bounds are improved through a customized branch and bound algorithm which takes in account specific knowledge of the problem to improve its efficiency. Thirty two random test instances are solved using the proposed algorithm and the CPLEX optimization package. The results show that the duality gap is excessive, so it cannot guarantee the quality of the solution. However, the proposed algorithm provides optimal or near optimal solutions for the problem instances for which CPLEX also provides the optimal solution. It further suggests that the proposed algorithm provides optimal or near optimal solutions for the other instances too. Finally, the results demonstrate that the proposed algorithm is superior to CPLEX as a solution approach for the CND problem.
E-democracy: a critical evaluation of the ultimate e-dream
Authors: Jarl K. Kampen, Kris Snijkers
Venue: Social Science Computer Review (2003)

In this article, the authors examine the possibilities of information communication technology and e-government to enhance democracy. The authors summarize the known problems of representative democracy and direct democracy and inquire whether e-government potentially can offer solutions to these problems. The authors conclude that a lot of problems in both representative and direct democracies remain unsolved and that e-government even can create new problems.
Extending client-server infrastructure using middleware components
Authors: Qiyang Chen, John Wang
Venue: Managing e-commerce and mobile computing technologies (2003)

Embracing inapt infrastructure technology is a major threat in developing extensive and efficient Web-based systems. The architectural strength of all business models demands an effective integration of various technological components. Middleware, the center of all applications, becomes the driver-- everything works if middleware does. In the recent times, the client/server environment has experienced sweeping transformation and led to the notion of the "Object Web." Web browser is viewed as a universal client that is capable of shifting flawlessly and effortlessly between various applications on the Internet. This paper attempts to investigate middleware and the facilitating technologies, and point toward the latest developments, taking into account the functional potential of the on-market middleware solutions, as well as their technical strengths and weaknesses. The paper would describe various types of middleware, including database middleware, Remote Procedure Call (RPC), application server middleware, message-oriented middleware (MOM), Object Request Broker (ORB), transaction-processing monitors and Web middleware, etc., with on-market technologies.
Learning methods to combine linguistic indicators: improving aspectual classification and revealing linguistic insights
Authors: Eric V. Siegel, Kathleen R. McKeown
Venue: Computational Linguistics (2000)

Aspectual classification maps verbs to a small set of primitive categories in order to reason about time. This classification is necessary for interpreting temporal modifiers and assessing temporal relationships, and is therefore a required component for many natural language applications.A verb's aspectual category can be predicted by co-occurrence frequencies between the verb and certain linguistic modifiers. These frequency measures, called linguistic indicators, are chosen by linguistic insights. However, linguistic indicators used in isolation are predictively incomplete, and are therefore insufficient when used individually.In this article, we compare three supervised machine learning methods for combining multiple linguistic indicators for aspectual classification: decision trees, genetic programming, and logistic regression. A set of 14 indicators are combined for classification according to two aspectual distinctions. This approach improves the classification performance for both distinctions, as evaluated over unrestricted sets of verbs occurring across two corpora. This demonstrates the effectiveness of the linguistic indicators and provides a much-needed full-scale method for automatic aspectual classification. Moreover, the models resulting from learning reveal several linguistic insights that are relevant to aspectual classification. We also compare supervised learning methods with an unsupervised method for this task.
What Makes a Code Review Trustworthy?
Authors: Stacy Nelson, Johann Schumann
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

Code review is an important step during the process of certifying safety-critical software because only code that passes review can be implemented. Reviews are performed by review boards composed of highly skilled and experienced computer scientists, engineers and analysts who generally rely upon a checklist of properties ranging from high-level requirements to minute language details. While many checklists and coding standards exist, the actual decision of which properties are most important is generally based on the experience of the person in charge.This paper addresses the questions: How can code review ensure certification of trustworthy code? and Is code review trustworthy? We surveyed technical leaders at NASAand the Aerospace industry to find out which properties are most important during the code review. To make analyze easier, the most common properties have been classified along different "views", ranging from a standards-oriented view (defined as the properties needed to satisfy a specific standard) to a tool-oriented view.In this paper, we present this classification together with a summary of findings and feed-back from the survey. We also discuss how a more uniform view on properties of codereview and tool capabilities can result in increased trust for safety-critical software.
Adaptive Rate Control Scheme for Video Streaming Over Wireless Channels
Authors: Marwan M. Krunz, Mohamed Hassan
Venue: Proceedings of the Conference on Data Compression (2004)

Providing continuous video playback with graceful quality degradation over wirelesschannels is fraught with challenges. Video applications require stringent delay guarantees and a relatively high throughput. Wireless channels are error prone, time varying,and bandwidth limited. To improve the reliability of the wireless link, forward errorcorrection (FEC) and automatic repeat request (ARQ) are often used. If designed forthe worst channel conditions, FEC can provide constant throughput and bounded delay. However, this causes unnecessary overhead and reduces the maximum achievablethroughput when the channel is in good conditions. On the other hand, it is difficult toachieve strict delay guarantees using ARQ schemes alone, especially when the channelis in deep fading. Playback buffer occupancy plays a major role in the target videoquality. The retransmission of erroneous packets and the reduction in throughput dueto FEC overhead can lead to playback buffer starvation as well as transmitter bufferfullness. Therefore, it is desirable to reduce the bit rate of the transmitted video signaland increase error protection when the channel is anticipated to be bad or the receiverplayback buffer starvation is predicted. In this study, we introduce a scalable andadaptive source-channel rate control scheme for video transmission over wireless packetnetworks. In this scheme, the level of adaptiveness is optimized to reduce the bandwidth requirement while guaranteeing delay and loss bounds. Simulation and numericalinvestigations are carried out to study the interactions among various key parametersand verify the adequacy of the analysis.
Bridging the Gap: A Genre Analysis of Weblogs
Authors: Susan C. Herring, Lois Ann Scheidt, Sabrina Bonus, Elijah Wright
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 4 - Volume 4 (2004)

Weblogs (blogs) -- frequently modified web pages in which dated entries are listed in reverse chronological sequence -- are the latest genre of Internet communication to attain widespread popularity, yet their characteristics have not been systematically described. This paper presents the results of a content analysis of 203 randomly-selected weblogs,comparing the empirically observable features of the corpus with popular claims about the nature of weblogs, and finding them to differ in a number of respects. Notably, blog authors, journalists and scholars alike exaggerate the extent to which blogs are interlinked, interactive,and oriented towards external events, and under-estimate the importance of blogs as individualistic, intimate forms of self-expression. Based on the profile generated by the empirical analysis, we consider the likely antecedents of the blog genre, situate it with respect to the dominant forms of digital communication on the Internet today, and advance predictions about its long-term impacts.
Classification of Defective Analog Integrated Circuits Using Artificial Neural Networks
Authors: V. Stopjaková, P. Malošek, D. Mičušík, M. Matej, M. Margala
Venue: Journal of Electronic Testing: Theory and Applications (2004)

This paper presents a new approach for detecting defects in analog integrated circuits using the feed-forward neural network trained by the resilient error back-propagation method. A feed-forward neural network has been used for detecting catastrophic faults randomly injected in a simple analog CMOS circuit by classification the differences observed in supply current responses of good and faulty circuit. The experimental classification was performed for time and frequency domain, followed by a comparison of results achieved in both domains. It was shown that neural networks might be very efficient and versatile approach for test of analog circuits since an arbitrary fault class or circuit's parameter can be analyzed. Considered defect types and their successful detection by the neural network&semi; and a possible off-chip hardware implementation of the proposed technique are discussed as well. Moreover, optimized hardware architecture of the selected neural network type was designed using VHDL for FPGA realization.
TinyGALS: a programming model for event-driven embedded systems
Authors: Elaine Cheong, Judy Liebman, Jie Liu, Feng Zhao
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Networked embedded systems such as wireless sensor networks are usually designed to be event-driven so that they are reactive and power efficient. Programming embedded systems with multiple reactive tasks is difficult due to the complex nature of managing the concurrency of execution threads and consistency of shared states. This paper describes a globally asynchronous and locally synchronous model (TinyGALS) for programming event-driven embedded systems. Software components are composed locally through synchronous method calls to form modules, and asynchronous message passing is used between modules to separate the flow of control. In addition, a guarded yet synchronous model (TinyGUYS) is designed to allow thread-safe sharing of global state by multiple modules without explicitly passing messages. This programming model is structured such that all asynchronous message passing code and module triggering mechanisms can be automatically generted from a high-level specification. We have implemented the programming model and code generation facilities on a wireless sensor network platform known as the Berkeley motes. As an example, we have redesigned a multi-hop ad hoc communication protocol using the TinyGALS model.
Effective drug-allergy checking: methodological and operational issues
Authors: Gilad J. Kuperman, Tejal K. Gandhi, David W. Bates
Venue: Journal of Biomedical Informatics (2003)

Adverse drug events cause a large number of injuries, and adverse events caused by medications administered in the face of known allergies represent an important preventable cause of patient harm. Computerized systems can effectively prevent reactions due to known allergies, but building an effective allergy prevention feature is challenging and presents many interesting informatics issues that have both methodological and operational implications. In this paper, we present the experiences from one large delivery system in delivering allergy-related decision support, discuss some of the different approaches that we have used, and then propose a future approach. We also discuss the methodological, behavioral, and operational issues that have arisen which have a major impact on success. Key factors in drug-allergy checking include storing patient allergy data in a single common repository, representing allergy data using suitable terminologies and creating groups of allergies for inferencing purposes, being judicious about which allergy warnings to display, conveying the reaction that the patient has experienced when exposed to the drug to inform the provider of the importance of the warning, and perhaps most important, implementing strategies to optimize the likelihood that allergy information will be entered.