ppxscal/embedding_network huggingface dataset:
A numerical procedure simulating RC structures reinforced with FRP using the serial/parallel mixing theory
Authors: Xavier Martinez, Sergio Oller, Fernando Rastellini, Alex H. Barbat
Venue: Computers and Structures (2008)

The use of fiber reinforced polymers (FRP) to reinforce and retrofit reinforced concrete (RC) structures has become one of the main applications of composites in civil engineering. This paper describes a procedure, based on a finite element formulation, that can be used to perform numerical simulations of RC structures reinforced with FRP. Composites are treated using the serial/parallel mixing theory, which deduces the composite behavior from the constitutive equations of its components. A new construction-stages algorithm is developed for simulating retrofitted structures. The performance of the proposed formulation is proved comparing numerical and experimental results. Finally, the developed code is used to obtain the optimum FRP reinforcement configuration for a RC frame structure.
A survey of what customers want in a cell phone design
Authors: Chen Ling, Wonil Hwang, Gavriel Salvendy
Venue: Behaviour & Information Technology (2007)

The cell phone is an information appliance that has been widely used. It provides instant access to information and makes people more 'connected'. The objective of our study is to investigate the relationship among the design features of the cell phone and identify the most important design features and design factors. In our survey study, we asked 1,006 college students using a 7-point Likert scale structured questionnaire to evaluate their preference of the design features and overall satisfaction of their current cell phone. Nine design factors were derived. Ten cell phone design features and five design factors that significantly impact a user's satisfaction were identified. The most important design features are: the physical appearance, size and menu organisation, which together account for 42% of the total variance of a user's overall satisfaction.
The role of presence awareness in organizational communication: An exploratory field experiment
Authors: Bret Shaw, Dietram A. Scheufele, Susan Catalano
Venue: Behaviour & Information Technology (2007)

Millions of adults currently use instant messaging (IM) in the workplace, and yet there is very little research examining how use and perceptions of this new medium affect intra-organizational communication. While one of the characteristics of instant messaging is the ability to exchange real-time communication, what truly distinguishes instant messaging from other widely adopted forms of mediated communication is the integration of presence technology, which allows parties to detect if others are online and available to communicate. In this paper, we propose a theory of productivity benefits of presence-aware communication technology, building upon past research. Based on this model, we use a quasi-experimental longitudinal research design to test how providing instant messaging to selected workgroups at a Fortune 500 company impacts employees' attitudes and work behavior. Results suggest that IM use had a positive effect on improving productivity with participants citing reductions in voice mail and phone tag, improvements to how easy it was to see if colleagues were online and available to communicate as well as increased productivity served by back-channel communications conducted via IM. Results and future research directions are discussed.
Defending On-Line Web Application Security with User-Behavior Surveillance
Authors: Yu-Chin Cheng, Chi-Sung Laih, Gu-Hsin Lai, Chia-Mei Chen, Tsuhan Chen
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

With the incoming of information era, web-based service has been developed rapidly and offered more and more business. These “open”, and widely “web enabled” applications are subject to greater and greater levels and types of attacks as hackers exploit vulnerabilities within the software like SQL Injection and Cross Site Scripts (XSS) attack. In this paper, we proposed a type of novel Embedded Markov Model (EMM) to detect different web application attacks, monitor the on-line user behavior and defend the malevolent user promptly. Comparing to previous web application attacks detecting approaches, our EMM approach can not only detect user’s invalidated input errors but also find out the unreasonable page transition behavior. By detecting unreasonable page transition, we can immediately defend the malevolent or silly user behavior to avoid the further web system failures and sensitive information disclosure. Furthermore, we implement an on-line user behavior surveillance system and use the real web traffic to evaluate the performance of our system. The experiment results show that our proposed EMM method can discover the abnormal behavior of malevolent user and detect the invalidated input attacks like SQL injection, XSS and string buffer overflow attacks.
Rapid rumor ramification: approximating the minimum broadcast time
Authors: R. Ravi
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

Given an undirected graph representing a network of processors, and a source node containing a message that must be broadcast to all the nodes, find a scheme that accomplishes the broadcast in the minimum number of time steps. At each time step, any processor that has received the message is allowed to communicate the message to at most one of its neighbors in the network, i.e. can communicate via a telephone call to a neighbor. This has been termed the minimum broadcast time problem under the telephone model and is known to be NP-complete. The minimum broadcast time in a graph is closely related to the poise of the graph. The poise of a tree is defined to be the quantity (maximum degree of any node in the tree+diameter of the tree). The poise of a graph is the minimum poise of any of its spanning trees. Computing the poise of a graph is shown to be NP-hard and an algorithm for computing a spanning tree of approximately minimum poise is derived. This algorithm is then used to derive an O(log/sup 2/n/log log n)-approximation for the minimum broadcast time problem on an n-node graph. Our algorithm extends to many generalizations of the problem such as the multicast problem, a telephone model allowing conference calls, and to the closely related minimum gossip time problem.
Water entrainment due to spillway surface jets
Authors: C. Turan, M. S. Politano, P. M. Carrica, L. Weber
Venue: International Journal of Computational Fluid Dynamics (2007)

Strong flow entrainment has been observed downstream of spillways constructed with flow deflectors. This water entrainment has important environmental and ecological impacts because it improves the mixing of powerhouse and spillway flows, but may negatively impact fish migration or create adverse flow conditions. Most studies found in the literature attempt to explain this entrainment with turbulent mixing. Both reduced-scale hydraulic models and single-phase, isotropic RANS models grossly under-predict the degree of entrainment observed in prototypes. In this paper, an anisotropic model that accounts for the bubble volume fraction and attenuation of the normal velocity fluctuations at the free surface is presented. The model adequately predicts the main mechanisms causing water entrainment and compares well against experimental data for a round surface jet and for Brownlee Dam at model scale. It is shown that appropriate entrainment can only be captured if the turbulence anisotropy and the two-phase nature of the flow are modelled.
Quality of a Bit (QoB): A New Concept in Dependable SRAM
Authors: Hidehiro Fujiwara, Shunsuke Okumura, Yusuke Iguchi, Hiroki Noguchi, Yasuhiro Morita, Hiroshi Kawaguchi, Masahiko Yosimoto
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

We propose a novel dependable SRAM with 7T memory cells, and introduce a new concept, “quality of a bit (QoB)” for it. The proposed SRAM has three modes: a typical mode, high-speed mode, and dependable mode, in which the QoB is scalable. That is, the area, speed, reliability, and/or power of one-bit information can be controlled. In the typical mode, assignment of information is as usual as one memory cell has one bit. On the other hand, in the high-speed or dependable mode, one-bit information is stored in two memory cells, which boosts the speed or increases the reliability. By carrying out Monte Carlo simulation of dynamic cell stability in a 90-nm process technology, we confirmed the advantage of the proposed SRAM.
A Behavioral Model of Ideologically-motivated "Snowball Attacks
Authors: Natalia Stakhanova, Oleg Stakhanov, Ali Ghorbani
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

As our daily life depends more and more on Internet technology, it also becomes increasingly susceptible to new types of cyber threats. These threats often take a form of innovative malicious behavior and commonly emerge in a pace that exceeds the capability of security experts to develop timely solutions to counter such threats. In this context it becomes particularly important to develop a good understanding of the complete cycle of malicious behavior including its evolution and the factors contributing to its spread so that these types of threats are addressed in proactive manner. In this paper we describe and define the new type of recently emerged threat - the ideologically-motivated “snowball” attack. We develop a conceptual model for explaining the evolution of ideologically motivated attacks and discuss a set of methods that can be used to detect and respond to this type of threat at all stages of its development. Finally, we use the recent case of ideologically motivated attack - the attack on Estonia’s cyber infrastructure to evaluate our conceptual model.
A self-organised middleware architecture for Wireless Sensor Network management
Authors: Mengjie Yu, Hala Mokhtar, Madjid Merabti
Venue: International Journal of Ad Hoc and Ubiquitous Computing (2008)

In this paper, we propose a lightweight middleware system that supports Wireless Sensor Networks (WSNs) to handle real-time network management using a hierarchical framework. The primary objective of this middleware is to provide standard management services for sensor applications to maintain network service quality with minimal human intervention. Middleware of sensor node also reconfigures its functionality autonomously to reflect changes of node resources expenditure or network environment. In addition, we propose an alternate power management solution to achieve energy efficiency of sensor networks via controlling management performance of sensor nodes. This approach reduces node energy consumption without frequent reconfiguration of network management structure.
Effective condition number of the Hermite finite element methods for biharmonic equations
Authors: Zi Cai Li, Hung-Tsai Huang, Jin Huang
Venue: Applied Numerical Mathematics (2008)

For biharmonic equations, the Hermite finite element methods (FEM) are chosen, to seek their approximate solutions. The linear algebraic equations Ax=b are obtained from the Hermite FEM, where the matrix A is symmetric and positive definite, and x and b are the unknown and known vectors, respectively. It is well known that Cond=@l"m"a"x@l"m"i"n, and @l"m"a"x and @l"m"i"n are the maximal and minimal eigenvalues of the stiffness matrix A, respectively. The bounds of Cond are derived to be O(h^-^4). Note that when h is small, the values of Cond (=O(h^-^4)) are huge, to indicate a severe instability, compared with Cond =O(h^-^2) for Poisson's equation by the FEM. In fact, for specific application problems, the instability is not so severe, a new effective condition number is defined by Cond_eff =@?b@?@?x@?@l"m"i"n in [Z.C. Li, C.S. Chien, H.T. Huang, Effective condition number for finite difference method, Comput. Appl. Math. 198 (2007) 208-235], to provide a better upper bound of perturbation errors. It is proven that Cond_eff =O(h^-^3^.^5) for general cases, which is smaller than the traditional Cond. However, for special cases, the Cond_eff could be much smaller. For instant, for the homogeneous boundary conditions of biharmonic equations, Cond_eff =O(1), can be reached as h diminishes. This is astonishing, against our intuition from the knowledge of the Cond. From the analysis in this paper, the traditional Cond may mislead the stability analysis for practical computation of engineering problems.
Dynamic coresets
Authors: Timothy M. Chan
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

We give a dynamic data structure that can maintain an μ-coreset of n points, with respect to the extent measure, in O(log n) time for any constant μ > 0 and any constant dimension. The previous method by Agarwal, Har-Peled, and Varadarajan requires polylogarithmic update time. For points with integer coordinates bounded by U, we alternatively get O(log log U) time. Numerous applications follow, for example, on dynamically approximating the width, smallest enclosing cylinder, minimum bounding box, or minimum-width annulus. We can also use the same approach to maintain approximate k-centers in O(min log n, log log U) randomized amortized time for any constant k and any constant dimension. For the smallest enclosing cylinder problem, we also show that a constant-factor approximation can be maintained in O(1) randomized amortized time on the word RAM.
NAGA: harvesting, searching and ranking knowledge
Authors: Gjergji Kasneci, Fabian M. Suchanek, Georgiana Ifrim, Shady Elbassuoni, Maya Ramanath, Gerhard Weikum
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

The presence of encyclopedic Web sources, such as Wikipedia, the Internet Movie Database (IMDB), World Factbook, etc. calls for new querying techniques that are simple and yet more expressive than those provided by standard keyword-based search engines. Searching for explicit knowledge needs to consider inherent semantic structures involving entities and relationships. In this demonstration proposal, we describe a semantic search system named NAGA. NAGA operates on a knowledge graph, which contains millions of entities and relationships derived from various encyclopedic Web sources, such as the ones above. NAGA's graph-based query language is geared towards expressing queries with additional semantic information. Its scoring model is based on the principles of generative language models, and formalizes several desiderata such as confidence, informativeness and compactness of answers. We propose a demonstration of NAGA which will allow users to browse the knowledge base through a user interface, enter queries in NAGA's query language and tune the ranking parameters to test various ranking aspects.
INFORM: integrated flow orchestration and meta-scheduling for managed grid systems
Authors: Gargi B. Dasgupta, Balaji Viswanathan
Venue: Proceedings of the 2007 ACM/IFIP/USENIX international conference on Middleware companion (2007)

The execution of workflow applications is a reality today in enterprise and scientific grid domains. The core middleware technologies for grids (e.g. meta-schedulers) contain sophisticated resource matching logic, but lack control flow orchestration capability. Workflow orchestrators, on the other hand, suitably control business logic but are unaware of execution requirements of tasks. Marriage of the scheduling technology with workflow management is thereby essential in the design of middleware for geographically distributed grids spanning organizational domains. However, existing endeavors use ad hoc, non-standard solutions, and also lack support for efficient data modeling and handling. In this paper, we present INFORM, an end-to-end middleware solution for grid environments, that integrates workflow orchestration and meta-scheduling. Specific issues explored are job flow modeling, transparent workflow adaptation, and data handling in job flows, through creation of assets using standardized technologies. An implementation of INFORM based on a set of industrial products from IBM is presented and validated using a Montage application. Our results demonstrate significant benefits that can be potentially achieved from such an integrated workflow management approach, when compared to competitive methodologies.
A constrained random perturbation vector-based pairwise key establishment scheme for wireless sensor networks
Authors: Chia-Mu Yu, Ting-Yun Chi, Chun-Shien Lu, Sy-Yen Kuo
Venue: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing (2008)

This paper presents a Constrained Random Perturbation Vector-based (CRPV) pairwise key establishment scheme and its variant, CRPV+ scheme, for wireless sensor networks (WSNs). Compared to all existing schemes which satisfy only some requirements in a so-called versatileness criteria, the CRPV+ scheme meets all requirements. In particular, the performance improvement of our schemes does not rely on tradeoffs among different requirements, but comes from the use of our constrained random vector strategy.
Integration of EBDW of one entire metal layer as substitution for optical lithography in 220nm node microcontrollers
Authors: J. Kretz, H. Roeper, C. Arndt, T. Bischoff, K. -H. Choi, G. Goldbeck, M. Gunia, C. Hohle, T. Lutz, U. Schubert, I. Schwerdtfeger, F. Thrum, M. Vennekamp
Venue: Microelectronic Engineering (2008)

Electron beam direct write (EBDW) with a variable shaped beam writer can be applied for very low volume applications like prototyping and personalization. Together with Infineon Technologies, the Center of Competence E-Beam Lithography of Qimonda in Dresden has demonstrated the integration of an E-Beam written back end of line metal layer into a productive 220nm node microcontroller fabrication process. For this purpose an electron beam lithography unit process was developed, and all necessary steps like data prep, proximity correction, alignment and overlay processes and etching processes were reviewed. Several test wafers have been completed in fabrication and measured electrically. At first go, full electrical functionality with a yield >70% could be demonstrated.
Dog Detective - An Experience of Game-Based Ubiquitous Learning in Elementary School Science Experiment Class
Authors: Sheng-Hui Hsu, Po-Han Wu, Yueh-Min Huang
Venue: Proceedings of the Fifth IEEE International Conference on Wireless, Mobile, and Ubiquitous Technology in Education (2008)

In this paper, we use the concept of game-based learning and ubiquitous learning to help science experiment learning in elementary school. After the experiment we found the scores of two groups are almost the same but the behavior and attitude toward the science experiment are quite different. Student who learning in the formal ubiquitous learning environment thinks experiment progress is an extension of learning but experiment set think it is part of game. We discuss these phenomenons happened in the experiment and conclude some issues for future researches
The nearest polynomial with a zero in a given domain from a geometrical viewpoint
Authors: Hiroshi Sekigawa
Venue: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (2008)

For a real univariate polynomial f and a closed complex domain D, whose boundary C is a simple curve parameterized by a univariate piecewise rational function, a rigorous method is given for finding a real univariate polynomial f such that f has a zero in D and |f - ~f|∞ is minimal. First, it is proved that the minimum distance between f and polynomials having a zero at α in C is a piecewise rational function of the real and imaginary parts of α. Thus, on C, the minimum distance is a piecewise rational function of a parameter obtained through the parameterization of C. Therefore, by using the property that ~f has a zero on C and computing the minimum distance on C, ~f can be constructed.
CDMA Radio with Repeaters, 1 edition
Authors: Joseph Shapira, Shmuel Y. Miller
Venue:  (2007)

The book addresses the role of repeaters in the CDMA network, their interaction with the network and the needed integrative design and optimization of the repeater-embedded network. The approach of the book is to develop functional comprehension of the complex radio network, and affinity to the factors dominating the Radio Resource Utilization. Simple models are developed, recognizing that over-complex models and simulations lack the clarity of the underlying processes while failing to match the measured performance anyhow. Field-measured case studies complement the analysis, and methodology for use of dynamically measured network parameters in tuning and optimizing the network is laid out.
Pervasive Layered Verification of a Distributed Real-Time System
Authors: Steffen Knapp
Venue: Proceedings of the Third International Conference on Systems (2008)

We deal with a distributed time-triggered system consisting of several electronic control units (ECUs). Each ECU contains a processor and a FlexRay-like interface that is connected to a bus. An OSEKtime-like operating system is running on all ECUs. We develop a detailed model of this system and prove its correctness. To do so we formally argue about operating system and driver correctness, termination of applications, and the communication behavior.
An End-to-End Security Solution for SCTP
Authors: Stefan Lindskog, Anna Brunstrom
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

The stream control transmission protocol (SCTP) is a fairly new transport protocol that was initially designed for carrying signaling traffic in IP networks. SCTP offers a reliable end-to-end (E2E) transport. Compared to TCP, SCTP provides a much richer set of transport features such as message oriented transfer, multistreaming to handle head-of-line blocking, and multihoming for enhanced failover. These are all very attractive features, but at the same time proven hard and complex to secure for E2E transports. All existing security solutions have limitations. In this paper, a survey of existing solutions is first given. Then, an alternative solution is proposed. The proposed solution uses the new authenticated chunks for SCTP for integrity protection, TLS for key exchange and authentication, and symmetric encryption implemented at the socket layer for confidentiality protection. A qualitative comparison of the described E2E security solutions is also given.
Effects of surface roughness on dynamic squeeze behavior of partial journal bearings with finite width
Authors: K. Y. Kung, C. H. Hsu, P. C. Chen, J. R. Lin
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

The surface roughness effects on the dynamic squeezing behavior of a finite length partial journal bearing under a time dependent oscillating load is studied. Use Christensen's stochastic models to develop the stochastic Reynolds' equation of the longitudinal, transverse and uniform isotropic roughness. According to the results obtained, the roughness pattern, the height of roughness and have significant effects upon the mean oscillating squeeze-film characteristics of partial bearing. The value of the maximum eccentricity ratio is seen to decrease obviously with increasing value of roughness parameter for longitudinal roughness and to decrease slightly for transverse roughness, but to increase for uniform isotropic roughness, and to decrease with increasing Sommerfeld number. Transverse roughness bearing with higher surface roughness hampers the maximum eccentricity ratio, but longitudinal roughness and uniform isotropic roughness bearing reverse the effect.