A scanline-based algorithm for the 2D free-form bin packing problem

Abstract: This paper describes a heuristic algorithm for the 2D free-form bin packing (2D-FBP) problem. Given a set of 2D free-form bins and a set of 2D free-form items, the 2D-FBP problem is to lay out items inside one or more bins in such a way that the number of bins used is minimized, and for each bin, the yield is maximized. The proposed algorithm handles the problem as a variant of the 1D problem; i.e., items and bins are approximated as sets of scanlines, and scanlines are packed. The details of the algorithm are given, and its application to a nesting problem in a shipbuilding company is reported. The proposed algorithm consists of the basic and the group placement algorithms. The basic placement algorithm is a variant of the first-fit decreasing algorithm which is simply extended from the 1D case to the 2D case by a novel scanline approximation. A numerical study with real instances shows that the basic placement algorithm has sufficient performance for most of the instances, however, the group placement algorithm is required when items must be aligned in columns. The qualities of the resulting layouts are good enough for practical use, and the processing times are good

a scanline-bas algorithm for the 2d free-form bin pack problem
 thi paper describ a heurist algorithm for the 2d free-form bin pack ( 2d-fbp ) problem . given a set of 2d free-form bin and a set of 2d free-form item , the 2d-fbp problem is to lay out item insid one or more bin in such a way that the number of bin use is minim , and for each bin , the yield is maxim . the propos algorithm handl the problem as a variant of the 1d problem ; i.e. , item and bin are approxim as set of scanlin , and scanlin are pack . the detail of the algorithm are given , and it applic to a nest problem in a shipbuild compani is report . the propos algorithm consist of the basic and the group placement algorithm . the basic placement algorithm is a variant of the first-fit decreas algorithm which is simpli extend from the 1d case to the 2d case by a novel scanlin approxim . a numer studi with real instanc show that the basic placement algorithm ha suffici perform for most of the instanc , howev , the group placement algorithm is requir when item must be align in column . the qualiti of the result layout are good enough for practic use , and the process time are good

scanline-based algorithm
2D free-form bin packing problem
heuristic algorithm
2D-FBP problem
minimization
nesting problem
shipbuilding company
group placement algorithm
first-fit decreasing algorithm
irregular cutting
irregular packing
yield maximization


The free lunch is over: online content subscriptions on the rise

Abstract: High need, rather than high use, may be what really determines a user's willingness to pay. Retooling and targeting content may be a sharper strategy than trying to re-educate users that it is time to pay up for material that has been free. Waiting for a paradigm shift in general user attitudes about paying for online content Could be a fool's errand

the free lunch is over : onlin content subscript on the rise
 high need , rather than high use , may be what realli determin a user 's willing to pay . retool and target content may be a sharper strategi than tri to re-educ user that it is time to pay up for materi that ha been free . wait for a paradigm shift in gener user attitud about pay for onlin content could be a fool 's errand

online content subscriptions
content retooling
content targeting
pay-to-play business models


Prediction and compensation of dynamic errors for coordinate measuring machines

Abstract: Coordinate measuring machines (CMMs) are already widely utilized as measuring tools in the modem manufacturing industry. Rapidly approaching now is the trend for next-generation CMMs. However, the increases in measuring velocity of CMM applications are limited by dynamic errors that occur in CMMs. In this paper a systematic approach for modeling the dynamic errors of a touch-trigger probe CMM is developed through theoretical analysis and experimental study. An overall analysis of the dynamic errors of CMMs is conducted, with weak components of the CMM identified by a laser interferometer. The probing process, as conducted with a touch-trigger probe, is analyzed. The dynamic errors are measured, modeled, and predicted using neural networks. The results indicate that, using this mode, it is possible to compensate for the dynamic errors of CMMs

predict and compens of dynam error for coordin measur machin
 coordin measur machin ( cmm ) are alreadi wide util as measur tool in the modem manufactur industri . rapidli approach now is the trend for next-gener cmm . howev , the increas in measur veloc of cmm applic are limit by dynam error that occur in cmm . in thi paper a systemat approach for model the dynam error of a touch-trigg probe cmm is develop through theoret analysi and experiment studi . an overal analysi of the dynam error of cmm is conduct , with weak compon of the cmm identifi by a laser interferomet . the probe process , as conduct with a touch-trigg probe , is analyz . the dynam error are measur , model , and predict use neural network . the result indic that , use thi mode , it is possibl to compens for the dynam error of cmm

compensation
dynamic errors
coordinate measuring machines
manufacturing industry
touch-trigger probe
laser interferometer
neural networks
inertial forces


Structure of weakly invertible semi-input-memory finite automata with delay 1

Abstract: Semi-input-memory finite automata, a kind of finite automata introduced by the first author of this paper for studying error propagation, are a generalization of input memory finite automata by appending an autonomous finite automaton component. In this paper, we give a characterization of the structure of weakly invertible semi-input-memory finite automata with delay 1, in which the state graph of each autonomous finite automaton is a cycle. From a result on mutual invertibility of finite automata obtained by the authors recently, it leads to a characterization of the structure of feedforward inverse finite automata with delay 1

structur of weakli invert semi-input-memori finit automata with delay 1
 semi-input-memori finit automata , a kind of finit automata introduc by the first author of thi paper for studi error propag , are a gener of input memori finit automata by append an autonom finit automaton compon . in thi paper , we give a character of the structur of weakli invert semi-input-memori finit automata with delay 1 , in which the state graph of each autonom finit automaton is a cycl . from a result on mutual invert of finit automata obtain by the author recent , it lead to a character of the structur of feedforward invers finit automata with delay 1

weakly invertible
invertibility
semi-input-memory
semi-input-memory finite automata
finite automata
delay 1
state graph
feedforward inverse finite automata


Monoids all polygons over which are omega -stable: proof of the Mustafin-Poizat conjecture

Abstract: A monoid S is called an omega -stabilizer (superstabilizer, or stabilizer) if every S-polygon has an omega -stable (superstable, or stable) theory. It is proved that every omega -stabilizer is a regular monoid. This confirms the Mustafin-Poizat conjecture and allows us to end up the description of omega -stabilizers

monoid all polygon over which are omega -stabl : proof of the mustafin-poizat conjectur
 a monoid s is call an omega -stabil ( superstabil , or stabil ) if everi s-polygon ha an omega -stabl ( superst , or stabl ) theori . it is prove that everi omega -stabil is a regular monoid . thi confirm the mustafin-poizat conjectur and allow us to end up the descript of omega -stabil

monoids all polygons
Mustafin-Poizat conjecture
omega -stabilizer
S-polygon
regular monoid


JPEG2000: standard for interactive imaging

Abstract: JPEG2000 is the latest image compression standard to emerge from the Joint Photographic Experts Group (JPEG) working under the auspices of the International Standards Organization. Although the new standard does offer superior compression performance to JPEG, JPEG2000 provides a whole new way of interacting with compressed imagery in a scalable and interoperable fashion. This paper provides a tutorial-style review of the new standard, explaining the technology on which it is based and drawing comparisons with JPEG and other compression standards. The paper also describes new work, exploiting the capabilities of JPEG2000 in client-server systems for efficient interactive browsing of images over the Internet

jpeg2000 : standard for interact imag
 jpeg2000 is the latest imag compress standard to emerg from the joint photograph expert group ( jpeg ) work under the auspic of the intern standard organ . although the new standard doe offer superior compress perform to jpeg , jpeg2000 provid a whole new way of interact with compress imageri in a scalabl and interoper fashion . thi paper provid a tutorial-styl review of the new standard , explain the technolog on which it is base and draw comparison with jpeg and other compress standard . the paper also describ new work , exploit the capabl of jpeg2000 in client-serv system for effici interact brows of imag over the internet

JPEG2000
interactive imaging
image compression
Joint Photographic Experts Group
International Standards Organization
review
client-server systems
scalable compression
interoperable compression


An approximation to the F distribution using the chi-square distribution

Abstract: For the cumulative distribution function (c.d.f.) of the F distribution, F(x; k, n), with associated degrees of freedom, k and n, a shrinking factor approximation (SFA), G( lambda kx; k), is proposed for large n and any fixed k, where G(x; k) is the chi-square c.d.f. with degrees of freedom, k, and lambda = lambda (kx; n) is the shrinking factor. Numerical analysis indicates that for n/k >or= 3, approximation accuracy of the SFA is to the fourth decimal place for most small values of k. This is a substantial improvement on the accuracy that is achievable using the normal, ordinary chi-square, and Scheffe-Tukey approximations. In addition, it is shown that the theoretical approximation error of the SFA, |F(x; k,n)-G( lambda kx; k)|, is O(1/n/sup 2/) uniformly over x

an approxim to the f distribut use the chi-squar distribut
 for the cumul distribut function ( c.d.f . ) of the f distribut , f(x ; k , n ) , with associ degre of freedom , k and n , a shrink factor approxim ( sfa ) , g ( lambda kx ; k ) , is propos for larg n and ani fix k , where g(x ; k ) is the chi-squar c.d.f . with degre of freedom , k , and lambda = lambda ( kx ; n ) is the shrink factor . numer analysi indic that for n / k > or= 3 , approxim accuraci of the sfa is to the fourth decim place for most small valu of k. thi is a substanti improv on the accuraci that is achiev use the normal , ordinari chi-squar , and scheffe-tukey approxim . in addit , it is shown that the theoret approxim error of the sfa , |f(x ; k , n)-g ( lambda kx ; k)| , is o(1 / n / sup 2/ ) uniformli over x

F distribution
chi-square distribution
cumulative distribution function
degrees of freedom
shrinking factor approximation
numerical analysis


Expert advice - how can my organisation take advantage of reverse auctions without jeopardising existing supplier relationships?

Abstract: In a recent survey, AMR Research found that companies that use reverse auctions to negotiate prices with suppliers typically achieve savings of between 10% and 15% on direct goods and between 20% and 25% on indirect goods, and can slash sourcing cycle times from months to weeks. Suppliers, however, are less enthusiastic. They believe that these savings are achieved only by stripping the human element out of negotiations and evaluating bids on price alone, which drives down their profit margins. As a result, reverse auctions carry the risk of jeopardising long-term and trusted relationships. Suppliers that have not been involved in a reverse auction before typically fear the bidding event itself - arguably the most theatrical and, therefore, most hyped-up part of the process. Although it may only last one hour, weeks of preparation go into setting up a successful bidding event

expert advic - how can my organis take advantag of revers auction without jeopardis exist supplier relationship ?
 in a recent survey , amr research found that compani that use revers auction to negoti price with supplier typic achiev save of between 10 % and 15 % on direct good and between 20 % and 25 % on indirect good , and can slash sourc cycl time from month to week . supplier , howev , are less enthusiast . they believ that these save are achiev onli by strip the human element out of negoti and evalu bid on price alon , which drive down their profit margin . as a result , revers auction carri the risk of jeopardis long-term and trust relationship . supplier that have not been involv in a revers auction befor typic fear the bid event itself - arguabl the most theatric and , therefor , most hyped-up part of the process . although it may onli last one hour , week of prepar go into set up a success bid event

reverse auctions
supplier relationships
preparation
Request For Quotation


Formalization of weighted factors analysis

Abstract: Weighted factors analysis (WeFA) has been proposed as a new approach for elicitation, representation, and manipulation of knowledge about a given problem, generally at a high and strategic level. Central to this proposal is that a group of experts in the area of the problem can identify a hierarchy of factors with positive or negative influences on the problem outcome. The tangible output of WeFA is a directed weighted graph called a WeFA graph. This is a set of nodes denoting factors that can directly or indirectly influence an overall aim of the graph. The aim is also represented by a node. Each directed arc is a direct influence of one factor on another. A chain of directed arcs indicates an indirect influence. The influences may be identified as either positive or negative. For example, sales and costs are two factors that influence the aim of profitability in an organization. Sales has a positive influence on profitability and costs has a negative influence on profitability. In addition, the relative significance of each influence is represented by a weight. We develop Binary WeFA which is a variant of WeFA where the factors in the graph are restricted to being either true or false. Imposing this restriction on a WeFA graph allows us to be more precise about the meaning of the graph and of reasoning in it. Binary WeFA is a new proposal that provides a formal yet sufficiently simple language for logic-based argumentation for use by business people in decision-support and knowledge management. Whilst Binary WeFA is expressively simpler than other logic-based argumentation formalisms, it does incorporate a novel formalization of the notion of significance

formal of weight factor analysi
 weight factor analysi ( wefa ) ha been propos as a new approach for elicit , represent , and manipul of knowledg about a given problem , gener at a high and strateg level . central to thi propos is that a group of expert in the area of the problem can identifi a hierarchi of factor with posit or neg influenc on the problem outcom . the tangibl output of wefa is a direct weight graph call a wefa graph . thi is a set of node denot factor that can directli or indirectli influenc an overal aim of the graph . the aim is also repres by a node . each direct arc is a direct influenc of one factor on anoth . a chain of direct arc indic an indirect influenc . the influenc may be identifi as either posit or neg . for exampl , sale and cost are two factor that influenc the aim of profit in an organ . sale ha a posit influenc on profit and cost ha a neg influenc on profit . in addit , the rel signific of each influenc is repres by a weight . we develop binari wefa which is a variant of wefa where the factor in the graph are restrict to be either true or fals . impos thi restrict on a wefa graph allow us to be more precis about the mean of the graph and of reason in it . binari wefa is a new propos that provid a formal yet suffici simpl languag for logic-bas argument for use by busi peopl in decision-support and knowledg manag . whilst binari wefa is express simpler than other logic-bas argument formal , it doe incorpor a novel formal of the notion of signific

weighted factors analysis
directed weighted graph
WeFA graph
directed arc
profitability
organization
significance
Binary WeFA
reasoning
logic-based argumentation
decision-support
knowledge management
knowledge elicitation
knowledge representation
knowledge manipulation


Topology-adaptive modeling of objects using surface evolutions based on 3D mathematical morphology

Abstract: Level set methods were proposed mainly by mathematicians for constructing a model of a 3D object of arbitrary topology. However, those methods are computationally inefficient due to repeated distance transformations and increased dimensions. In the paper, we propose a new method of modeling fast objects of arbitrary topology by using a surface evolution approach based on mathematical morphology. Given sensor data covering the whole object surface, the method begins with an initial approximation of the object by evolving a closed surface into a model topologically equivalent to the real object. The refined approximation is then performed using energy minimization. The method has been applied in several experiments using range data, and the results are reported in the paper

topology-adapt model of object use surfac evolut base on 3d mathemat morpholog
 level set method were propos mainli by mathematician for construct a model of a 3d object of arbitrari topolog . howev , those method are comput ineffici due to repeat distanc transform and increas dimens . in the paper , we propos a new method of model fast object of arbitrari topolog by use a surfac evolut approach base on mathemat morpholog . given sensor data cover the whole object surfac , the method begin with an initi approxim of the object by evolv a close surfac into a model topolog equival to the real object . the refin approxim is then perform use energi minim . the method ha been appli in sever experi use rang data , and the result are report in the paper

topology-adaptive modeling
surface evolutions
3D mathematical morphology
level set methods
3D object
arbitrary topology
repeated distance transformations
initial approximation
refined approximation
energy minimization
range data
pseudo curvature flow


A brief history of electronic reserves

Abstract: Electronic reserves has existed as a library service for barely ten years, yet its history, however brief, is important as an indicator of the direction being taken by the profession of Librarianship as a whole. Recent improvements in technology and a desire to provide better service to students and faculty have resulted in the implementation of e-reserves by ever greater numbers of academic libraries. Yet a great deal of confusion still surrounds the issue of copyright compliance. Negotiation, litigation, and legislation in particular have framed the debate over the application of fair use to an e-reserves environment, and the question of whether or not permission fees should be paid to rights holders, but as of yet no definitive answers or standards have emerged

a brief histori of electron reserv
 electron reserv ha exist as a librari servic for bare ten year , yet it histori , howev brief , is import as an indic of the direct be taken by the profess of librarianship as a whole . recent improv in technolog and a desir to provid better servic to student and faculti have result in the implement of e-reserv by ever greater number of academ librari . yet a great deal of confus still surround the issu of copyright complianc . negoti , litig , and legisl in particular have frame the debat over the applic of fair use to an e-reserv environ , and the question of whether or not permiss fee should be paid to right holder , but as of yet no definit answer or standard have emerg

electronic reserves
library service
librarianship
students
faculty
academic libraries
copyright compliance
negotiation
litigation
legislation
e-reserves environment
permission fees


A gendered view of computer professionals: preliminary results of a survey

Abstract: The under-representation of women in the computing profession in many parts the western world has received our attention through numerous publications, the noticeable low representation of women at computer science conferences and in the lecture halls. Over the past two decades, the situation had become worse. This paper seeks to add to the dialogue by presenting preliminary findings from a research project conducted in four countries. The aim of this research was to gain an insight into the perceptions future computer professionals hold on the category of employment loosely defined under the term of "a computer professional." One goal was to get insight into whether or not there is a difference between female and mate students regarding their view of computer professionals. Other goals were to determine if there was any difference between female and male students in different parts of the world, as well as who or what most influences the students to undertake their courses in computing

a gender view of comput profession : preliminari result of a survey
 the under-represent of women in the comput profess in mani part the western world ha receiv our attent through numer public , the notic low represent of women at comput scienc confer and in the lectur hall . over the past two decad , the situat had becom wors . thi paper seek to add to the dialogu by present preliminari find from a research project conduct in four countri . the aim of thi research wa to gain an insight into the percept futur comput profession hold on the categori of employ loos defin under the term of " a comput profession . " one goal wa to get insight into whether or not there is a differ between femal and mate student regard their view of comput profession . other goal were to determin if there wa ani differ between femal and male student in differ part of the world , as well as who or what most influenc the student to undertak their cours in comput

future computer professional perceptions


Car-caravan snaking. 2 Active caravan braking

Abstract: For part 1, see ibid., p.707-22. Founded on the review and results of Part 1, Part 2 contains a description of the virtual design of an active braking system for caravans or other types of trailer, to suppress snaking vibrations, while being simple from a practical viewpoint. The design process and the design itself are explained. The performance is examined by simulations and it is concluded that the system is effective, robust and realizable with modest and available components

car-caravan snake . 2 activ caravan brake
 for part 1 , see ibid . , p.707 - 22 . found on the review and result of part 1 , part 2 contain a descript of the virtual design of an activ brake system for caravan or other type of trailer , to suppress snake vibrat , while be simpl from a practic viewpoint . the design process and the design itself are explain . the perform is examin by simul and it is conclud that the system is effect , robust and realiz with modest and avail compon

car-caravan snaking
active caravan braking
virtual design
trailer
snaking vibrations suppression
dynamics


From information gateway to digital library management system: a case analysis

Abstract: This paper discusses the design, implementation and evolution of the Cornell University Library Gateway using the case analysis method. It diagnoses the Gateway within the conceptual framework of definitions and best practices associated with information gateways, portals, and emerging digital library management systems, in particular the product ENCompass

from inform gateway to digit librari manag system : a case analysi
 thi paper discuss the design , implement and evolut of the cornel univers librari gateway use the case analysi method . it diagnos the gateway within the conceptu framework of definit and best practic associ with inform gateway , portal , and emerg digit librari manag system , in particular the product encompass

information gateways
digital library management system
Cornell University Library Gateway
portals
ENCompass
metadata


Survey says! [online world of polls and surveys]

Abstract: Many content managers miss the fundamental interactivity of the Web by not using polls and surveys. Using interactive features-like a poll or quiz-offers your readers an opportunity to become more engaged in your content. Using a survey to gather feedback about your content provides cost-effective data to help make modifications or plot the appropriate course of action. The Web has allowed us to take traditional market research and turn it on its ear. Surveys and polls can be conducted faster and cheaper than with telephone and mail. But if you are running a Web site, should you care about polls and surveys? Do you know the difference between the two in Web-speak?

survey say ! [ onlin world of poll and survey ]
 mani content manag miss the fundament interact of the web by not use poll and survey . use interact features-lik a poll or quiz-off your reader an opportun to becom more engag in your content . use a survey to gather feedback about your content provid cost-effect data to help make modif or plot the appropri cours of action . the web ha allow us to take tradit market research and turn it on it ear . survey and poll can be conduct faster and cheaper than with telephon and mail . but if you are run a web site , should you care about poll and survey ? do you know the differ between the two in web-speak ?

surveys
polls
content managers
site owners
World Wide Web
site feedback


Edge-colorings with no large polychromatic stars

Abstract: Given a graph G and a positive integer r, let f/sub r/(G) denote the largest number of colors that can be used in a coloring of E(G) such that each vertex is incident to at most r colors. For all positive integers n and r, we determine f/sub r/(K/sub n,n/) exactly and f/sub r/(K/sub n/) within 1. In doing so, we disprove a conjecture by Y. Manoussakis et al. (1996)

edge-color with no larg polychromat star
 given a graph g and a posit integ r , let f / sub r/(g ) denot the largest number of color that can be use in a color of e(g ) such that each vertex is incid to at most r color . for all posit integ n and r , we determin f / sub r/(k / sub n , n/ ) exactli and f / sub r/(k / sub n/ ) within 1 . in do so , we disprov a conjectur by y. manoussaki et al . ( 1996 )

polychromatic stars
positive integer
positive integer
edge colorings
positive integers


The rise and fall and rise again of customer care

Abstract: Taking care of customers has never gone out of style, but as the recession fades, interest is picking up in a significant retooling of the CRM solutions banks have been using. The goal: usable knowledge to help improve service

the rise and fall and rise again of custom care
 take care of custom ha never gone out of style , but as the recess fade , interest is pick up in a signific retool of the crm solut bank have been use . the goal : usabl knowledg to help improv servic

banks
usable knowledge
customer relationship management


An augmented spatial digital tree algorithm for contact detection in computational mechanics

Abstract: Based on the understanding of existing spatial digital tree-based contact detection approaches, and the alternating digital tree (ADT) algorithm in particular, a more efficient algorithm, termed the augmented spatial digital tree (ASDT) algorithm, is proposed in the present work. The ASDT algorithm adopts a different point representation scheme that uses only the lower comer vertex to represent a (hyper-)rectangle, with the upper comer vertex serving as the augmented information. Consequently, the ASDT algorithm can keep the working space the same as the original n-dimensional space and, in general, a much better balanced tree can be expected. This, together with the introduction of an additional bounding subregion for the rectangles associated with each tree node, makes it possible to significantly reduce the number of node visits in the region search, although each node visit may be slightly more expensive. Three examples arising in computational mechanics are presented to provide an assessment of the performance of the ASDT. The numerical results indicate that the ASDT is, at least, over 3.9 times faster than the ADT

an augment spatial digit tree algorithm for contact detect in comput mechan
 base on the understand of exist spatial digit tree-bas contact detect approach , and the altern digit tree ( adt ) algorithm in particular , a more effici algorithm , term the augment spatial digit tree ( asdt ) algorithm , is propos in the present work . the asdt algorithm adopt a differ point represent scheme that use onli the lower comer vertex to repres a ( hyper-)rectangl , with the upper comer vertex serv as the augment inform . consequ , the asdt algorithm can keep the work space the same as the origin n-dimension space and , in gener , a much better balanc tree can be expect . thi , togeth with the introduct of an addit bound subregion for the rectangl associ with each tree node , make it possibl to significantli reduc the number of node visit in the region search , although each node visit may be slightli more expens . three exampl aris in comput mechan are present to provid an assess of the perform of the asdt . the numer result indic that the asdt is , at least , over 3.9 time faster than the adt

spatial binary tree-based contact detection approaches


The analysis and control of longitudinal vibrations from wave viewpoint

Abstract: The analysis and control of longitudinal vibrations in a rod from feedback wave viewpoint are synthesized. Both collocated and noncollocated feedback wave control strategies are explored. The control design is based on the local properties of wave transmission and reflection in the vicinity of the control force applied area, hence there is no complex closed form solution involved. The controller is designed to achieve various goals, such as absorbing the incoming vibration energy, creating a vibration free zone and eliminating standing waves in the structure. The findings appear to be very useful in practice due to the simplicity in the implementation of the controllers

the analysi and control of longitudin vibrat from wave viewpoint
 the analysi and control of longitudin vibrat in a rod from feedback wave viewpoint are synthes . both colloc and noncolloc feedback wave control strategi are explor . the control design is base on the local properti of wave transmiss and reflect in the vicin of the control forc appli area , henc there is no complex close form solut involv . the control is design to achiev variou goal , such as absorb the incom vibrat energi , creat a vibrat free zone and elimin stand wave in the structur . the find appear to be veri use in practic due to the simplic in the implement of the control

feedback waves
noncollocated feedback wave control
control design
wave transmission
control force
complex closed form solution
vibration energy
vibration free zone
standing waves
longitudinal vibration control
collocated feedback wave control
wave reflection


CRONE control: principles and extension to time-variant plants with asymptotically constant coefficients

Abstract: The principles of CRONE control, a frequency-domain robust control design methodology based on fractional differentiation, are presented. Continuous time-variant plants with asymptotically constant coefficients are analysed in the frequency domain, through their representation using time-variant frequency responses. A stability theorem for feedback systems including time-variant plants with asymptotically constant coefficients is proposed. Finally, CRONE control is extended to robust control of these plants

crone control : principl and extens to time-vari plant with asymptot constant coeffici
 the principl of crone control , a frequency-domain robust control design methodolog base on fraction differenti , are present . continu time-vari plant with asymptot constant coeffici are analys in the frequenc domain , through their represent use time-vari frequenc respons . a stabil theorem for feedback system includ time-vari plant with asymptot constant coeffici is propos . final , crone control is extend to robust control of these plant

CRONE control
time-variant plants
asymptotically constant coefficients
frequency-domain robust control design
robust control
fractional differentiation
time-variant frequency responses
stability theorem
feedback systems
automatic control


The average-case identifiability and controllability of large scale systems

Abstract: Needs for increased product quality, reduced pollution, and reduced energy and material consumption are driving enhanced process integration. This increases the number of manipulated and measured variables required by the control system to achieve its objectives. This paper addresses the question of whether processes tend to become increasingly more difficult to identify and control as the process dimension increases. Tools and results of multivariable statistics are used to show that, under a variety of assumed distributions on the elements, square processes of higher dimension tend to be more difficult to identify and control, whereas the expected controllability and identifiability of nonsquare processes depends on the relative numbers of measured and manipulated variables. These results suggest that the procedure of simplifying the control problem so that only a square process is considered is a poor practice for large scale systems

the average-cas identifi and control of larg scale system
 need for increas product qualiti , reduc pollut , and reduc energi and materi consumpt are drive enhanc process integr . thi increas the number of manipul and measur variabl requir by the control system to achiev it object . thi paper address the question of whether process tend to becom increasingli more difficult to identifi and control as the process dimens increas . tool and result of multivari statist are use to show that , under a varieti of assum distribut on the element , squar process of higher dimens tend to be more difficult to identifi and control , wherea the expect control and identifi of nonsquar process depend on the rel number of measur and manipul variabl . these result suggest that the procedur of simplifi the control problem so that onli a squar process is consid is a poor practic for larg scale system

average-case identifiability
large scale systems
enhanced process integration
measured variables
multivariable statistics
nonsquare processes
manipulated variables
average-case controllability
process control
high dimension square processes
process identification
Monte Carlo simulations
chemical engineering


Towards strong stability of concurrent repetitive processes sharing resources

Abstract: The paper presents a method for design of stability conditions of concurrent, repetitive processes sharing common resources. Steady-state behaviour of the system with m cyclic processes utilising a resource with the mutual exclusion is considered. Based on a recurrent equations framework necessary and sufficient conditions for the existence of maximal performance steady-state are presented. It was shown that if the conditions hold then the m-process system is marginally stable, i.e., a steady-state of the system depends on the perturbations. The problem of finding the relative positions of the processes leading to waiting-free (maximal efficiency) steady-states of the system is formulated as a constraint logic programming problem. An example illustrating the solving of the problem for a 3-process system using object-oriented, constraint logic programming language Oz is presented. A condition sufficient for strong stability of the m-process system is given. When the condition holds then for any initial phases of the processes a waiting-free steady-state will be reached

toward strong stabil of concurr repetit process share resourc
 the paper present a method for design of stabil condit of concurr , repetit process share common resourc . steady-st behaviour of the system with m cyclic process utilis a resourc with the mutual exclus is consid . base on a recurr equat framework necessari and suffici condit for the exist of maxim perform steady-st are present . it wa shown that if the condit hold then the m-process system is margin stabl , i.e. , a steady-st of the system depend on the perturb . the problem of find the rel posit of the process lead to waiting-fre ( maxim effici ) steady-st of the system is formul as a constraint logic program problem . an exampl illustr the solv of the problem for a 3-process system use object-ori , constraint logic program languag oz is present . a condit suffici for strong stabil of the m-process system is given . when the condit hold then for ani initi phase of the process a waiting-fre steady-st will be reach

strong stability
concurrent repetitive processes
common resources
steady-state behaviour
cyclic processes
mutual exclusion
recurrent equations framework
necessary and sufficient conditions
maximal performance steady-state
constraint logic programming
3-process system
waiting-free steady-states
Oz language


Online coverage of the Olympic Games

Abstract: In 1956 a new medium was evolving which helped shape not only the presentation of the Games to a worldwide audience, but created entirely new avenues for marketing and sponsorship which changed the entire economic relevance of the Games. The medium in 1956 was television, and the medium now, of course, is the Internet. Not since 1956 has Olympic coverage been so impacted by the onset of new technology as the current Olympiad has been. But now the IOC finds itself in another set of circumstances not altogether different from 1956

onlin coverag of the olymp game
 in 1956 a new medium wa evolv which help shape not onli the present of the game to a worldwid audienc , but creat entir new avenu for market and sponsorship which chang the entir econom relev of the game . the medium in 1956 wa televis , and the medium now , of cours , is the internet . not sinc 1956 ha olymp coverag been so impact by the onset of new technolog as the current olympiad ha been . but now the ioc find itself in anoth set of circumst not altogeth differ from 1956

online coverage
Olympic Games
marketing
sponsorship
economic relevance
Olympiad
IOC
online rights
e-broadcast


STEM: Secure Telephony Enabled Middlebox

Abstract: Dynamic applications, including IP telephony, have not seen wide acceptance within enterprises because of problems caused by the existing network infrastructure. Static elements, including firewalls and network address translation devices, are not capable of allowing dynamic applications to operate properly. The Secure Telephony Enabled Middlebox (STEM) architecture is an enhancement of the existing network design to remove the issues surrounding static devices. The architecture incorporates an improved firewall that can interpret and utilize information in the application layer of packets to ensure proper functionality. In addition to allowing dynamic applications to function normally, the STEM architecture also incorporates several detection and response mechanisms for well-known network-based vulnerabilities. This article describes the key components of the architecture with respect to the SIP protocol

stem : secur telephoni enabl middlebox
 dynam applic , includ ip telephoni , have not seen wide accept within enterpris becaus of problem caus by the exist network infrastructur . static element , includ firewal and network address translat devic , are not capabl of allow dynam applic to oper properli . the secur telephoni enabl middlebox ( stem ) architectur is an enhanc of the exist network design to remov the issu surround static devic . the architectur incorpor an improv firewal that can interpret and util inform in the applic layer of packet to ensur proper function . in addit to allow dynam applic to function normal , the stem architectur also incorpor sever detect and respons mechan for well-known network-bas vulner . thi articl describ the key compon of the architectur with respect to the sip protocol

STEM
Secure Telephony Enabled Middlebox
dynamic applications
IP telephony
network infrastructure
firewalls
network address translation devices
network design
static devices
application layer
STEM architecture
response mechanisms
network-based vulnerabilities
SIP protocol
detection mechanisms


Center-crossing recurrent neural networks for the evolution of rhythmic behavior

Abstract: A center-crossing recurrent neural network is one in which the null(hyper)surfaces of each neuron intersect at their exact centers of symmetry, ensuring that each neuron's activation function is centered over the range of net inputs that it receives. We demonstrate that relative to a random initial population, seeding the initial population of an evolutionary search with center-crossing networks significantly improves both the frequency and the speed with which high-fitness oscillatory circuits evolve on a simple walking task. The improvement is especially striking at low mutation variances. Our results suggest that seeding with center-crossing networks may often be beneficial, since a wider range of dynamics is more likely to be easily accessible from a population of center-crossing networks than from a population of random networks

center-cross recurr neural network for the evolut of rhythmic behavior
 a center-cross recurr neural network is one in which the null(hyper)surfac of each neuron intersect at their exact center of symmetri , ensur that each neuron 's activ function is center over the rang of net input that it receiv . we demonstr that rel to a random initi popul , seed the initi popul of an evolutionari search with center-cross network significantli improv both the frequenc and the speed with which high-fit oscillatori circuit evolv on a simpl walk task . the improv is especi strike at low mutat varianc . our result suggest that seed with center-cross network may often be benefici , sinc a wider rang of dynam is more like to be easili access from a popul of center-cross network than from a popul of random network

center-crossing recurrent neural networks


A new method of regression on latent variables. Application to spectral data

Abstract: Several applications are based on the assessment of a linear model linking a set of variables Y to a set of predictors X. In the presence of strong colinearity among predictors, as in the case with spectral data, several alternative procedures to ordinary least squares (OLS) are proposed, We discuss a new alternative approach which we refer to as regression models through constrained principal components analysis (RM-CPCA). This method basically shares certain common characteristics with PLS regression as the dependent variables play a central role in determining the latent variables to be used as predictors. Unlike PLS, however, the approach discussed leads to straightforward models. This method also bears some similarity to latent root regression analysis (LRR) that was discussed by several authors. Moreover, a tuning parameter that ranges between 0 and 1 is introduced and the family of models thus formed includes several other methods as particular cases

a new method of regress on latent variabl . applic to spectral data
 sever applic are base on the assess of a linear model link a set of variabl y to a set of predictor x. in the presenc of strong colinear among predictor , as in the case with spectral data , sever altern procedur to ordinari least squar ( ol ) are propos , we discuss a new altern approach which we refer to as regress model through constrain princip compon analysi ( rm-cpca ) . thi method basic share certain common characterist with pl regress as the depend variabl play a central role in determin the latent variabl to be use as predictor . unlik pl , howev , the approach discuss lead to straightforward model . thi method also bear some similar to latent root regress analysi ( lrr ) that wa discuss by sever author . moreov , a tune paramet that rang between 0 and 1 is introduc and the famili of model thu form includ sever other method as particular case


Embeddings of planar graphs that minimize the number of long-face cycles

Abstract: We consider the problem of finding embeddings of planar graphs that minimize the number of long-face cycles. We prove that for any k >or= 4, it is NP-complete to find an embedding that minimizes the number of face cycles of length at least k

embed of planar graph that minim the number of long-fac cycl
 we consid the problem of find embed of planar graph that minim the number of long-fac cycl . we prove that for ani k > or= 4 , it is np-complet to find an embed that minim the number of face cycl of length at least k

embeddings
planar graphs
long-face cycles
NP-complete problem
graph drawing


High-speed CMOS circuits with parallel dynamic logic and speed-enhanced skewed static logic

Abstract: In this paper, we describe parallel dynamic logic (PDL) which exhibits high speed without charge sharing problem. PDL uses only parallel-connected transistors for fast logic evaluation and is a good candidate for high-speed low-voltage operation. It has less back-bias effect compared to other logic styles, which use stacked transistors. Furthermore, PDL needs no signal ordering or tapering. PDL with speed-enhanced skewed static logic renders straightforward logic synthesis without the usual area penalty due to logic duplication. Our experimental results on two 32-bit carry lookahead adders using 0.25- mu m CMOS technology show that PDL with speed-enhanced skewed static (SSS) look reduces the delay over clock-delayed(CD)-domino by 15%-27% and the power-delay product by 20%-37%

high-spe cmo circuit with parallel dynam logic and speed-enhanc skew static logic
 in thi paper , we describ parallel dynam logic ( pdl ) which exhibit high speed without charg share problem . pdl use onli parallel-connect transistor for fast logic evalu and is a good candid for high-spe low-voltag oper . it ha less back-bia effect compar to other logic style , which use stack transistor . furthermor , pdl need no signal order or taper . pdl with speed-enhanc skew static logic render straightforward logic synthesi without the usual area penalti due to logic duplic . our experiment result on two 32-bit carri lookahead adder use 0.25- mu m cmo technolog show that pdl with speed-enhanc skew static ( sss ) look reduc the delay over clock-delayed(cd)-domino by 15%-27 % and the power-delay product by 20%-37 %

high-speed CMOS circuits
parallel dynamic logic
speed-enhanced skewed static logic
parallel-connected transistors
low-voltage operation
back-bias effect
stacked transistors
logic synthesis
carry lookahead adders
delay
power-delay product
32 bit
0.25 micron


On the relationship between parametric variation and state feedback in chaos control

Abstract: In this Letter, we study the popular parametric variation chaos control and state-feedback methodologies in chaos control, and point out for the first time that they are actually equivalent in the sense that there exist diffeomorphisms that can convert one to the other for most smooth chaotic systems. Detailed conversions are worked out for typical discrete chaotic maps (logistic, Henon) and continuous flows (Rossler, Lorenz) for illustration. This unifies the two seemingly different approaches from the physics and the engineering communities on chaos control. This new perspective reveals some new potential applications such as chaos synchronization and normal form analysis from a unified mathematical point of view

on the relationship between parametr variat and state feedback in chao control
 in thi letter , we studi the popular parametr variat chao control and state-feedback methodolog in chao control , and point out for the first time that they are actual equival in the sens that there exist diffeomorph that can convert one to the other for most smooth chaotic system . detail convers are work out for typic discret chaotic map ( logist , henon ) and continu flow ( rossler , lorenz ) for illustr . thi unifi the two seemingli differ approach from the physic and the engin commun on chao control . thi new perspect reveal some new potenti applic such as chao synchron and normal form analysi from a unifi mathemat point of view

parametric variation
chaos control
state-feedback
diffeomorphisms
logistic
continuous flows
Henon map
Rossler system
Lorenz system


Smart collision information processing sensors for fast moving objects

Abstract: In this technical note we survey the area of smart collision information processing sensors. We review the existing technologies to detect collision or overlap between fast moving physical objects or objects in virtual environments, physical environments or a combination of physical and virtual objects. We report developments in the collision detection of fast moving objects at discrete time steps such as two consecutive time frames, as well as continuous time intervals such as in an interframe collision detection system. Our discussion of computational techniques in this paper is limited to convex objects. Techniques exist however to efficiently decompose non-convex objects into convex objects. We also discuss the tracking technologies for objects from the standpoint of collision detection or avoidance

smart collis inform process sensor for fast move object
 in thi technic note we survey the area of smart collis inform process sensor . we review the exist technolog to detect collis or overlap between fast move physic object or object in virtual environ , physic environ or a combin of physic and virtual object . we report develop in the collis detect of fast move object at discret time step such as two consecut time frame , as well as continu time interv such as in an interfram collis detect system . our discuss of comput techniqu in thi paper is limit to convex object . techniqu exist howev to effici decompos non-convex object into convex object . we also discuss the track technolog for object from the standpoint of collis detect or avoid

collision information processing
fast moving objects
virtual environments
physical environments
collision detection
discrete time steps
consecutive time frames
continuous time intervals
interframe collision detection
convex objects
tracking
nonconvex objects
air traffic control
smart sensors
military training
high speed machining


Reaching strong consensus in a general network

Abstract: The strong consensus (SC) problem is a variant of the conventional distributed consensus problem (also known as the Byzantine agreement problem). The SC problem requires that the agreed value among fault-free processors be one of the fault-free processor's initial values. Originally, the problem was studied in a fully connected network with malicious faulty processors. In this paper, the SC problem is re-examined in a general network, in which the components (processors and communication links) may be subjected to different faulty types simultaneously (also called the hybrid fault model or mixed faulty types) and the network topology does not have to be fully connected. The proposed protocol can tolerate the maximum number of tolerable faulty components such that each fault-free processor obtains a common value for the SC problem in a general network

reach strong consensu in a gener network
 the strong consensu ( sc ) problem is a variant of the convent distribut consensu problem ( also known as the byzantin agreement problem ) . the sc problem requir that the agre valu among fault-fre processor be one of the fault-fre processor 's initi valu . origin , the problem wa studi in a fulli connect network with malici faulti processor . in thi paper , the sc problem is re-examin in a gener network , in which the compon ( processor and commun link ) may be subject to differ faulti type simultan ( also call the hybrid fault model or mix faulti type ) and the network topolog doe not have to be fulli connect . the propos protocol can toler the maximum number of toler faulti compon such that each fault-fre processor obtain a common valu for the sc problem in a gener network

strong consensus
distributed consensus problem
Byzantine agreement
fault-free processors
fully connected network
hybrid fault model
strong consensus problem
fault-tolerant distributed system


Chemical production in the superlative [formaldehyde plant process control system and remote I/O system]

Abstract: BASF commissioned the largest formaldehyde production plant in the world, in December 2000, with an annual capacity of 180000 t. The new plant, built to meet the growing demand for formaldehyde, sets new standards. Its size, technology and above all its cost-effectiveness give it a leading position internationally. To maintain such high standards by the automation technology, in addition to the trail-blazing Simatic PCS 7 process control system from Siemens, BASF selected the innovative remote I/O system I.S.1 from R. STAHL Schaltgerate GmbH to record and to output field signals in hazardous areas Zone 1 and 2. This combination completely satisfied all technical requirements and also had the best price-performance ratio of all the solutions. 25 remote I/O field stations were designed and matched to the needs of the formaldehyde plant

chemic product in the superl [ formaldehyd plant process control system and remot i / o system ]
 basf commiss the largest formaldehyd product plant in the world , in decemb 2000 , with an annual capac of 180000 t. the new plant , built to meet the grow demand for formaldehyd , set new standard . it size , technolog and abov all it cost-effect give it a lead posit intern . to maintain such high standard by the autom technolog , in addit to the trail-blaz simat pc 7 process control system from siemen , basf select the innov remot i / o system i.s.1 from r. stahl schaltger gmbh to record and to output field signal in hazard area zone 1 and 2 . thi combin complet satisfi all technic requir and also had the best price-perform ratio of all the solut . 25 remot i / o field station were design and match to the need of the formaldehyd plant

formaldehyde production plant construction


Knowledge organisation of product design blackboard systems via graph decomposition

Abstract: Knowledge organisation plays an important role in building a knowledge-based product design blackboard system. Well-organised knowledge sources will facilitate the effectiveness and efficiency of communication and data exchange in a blackboard system. In a previous investigation, an approach for constructing blackboard systems for product design using a non-directed graph decomposition algorithm was proposed. In this paper, the relationship between graph decomposition and the resultant blackboard system is further studied. A case study of a number of hypothetical blackboard systems that comprise different knowledge organisations is provided

knowledg organis of product design blackboard system via graph decomposit
 knowledg organis play an import role in build a knowledge-bas product design blackboard system . well-organis knowledg sourc will facilit the effect and effici of commun and data exchang in a blackboard system . in a previou investig , an approach for construct blackboard system for product design use a non-direct graph decomposit algorithm wa propos . in thi paper , the relationship between graph decomposit and the result blackboard system is further studi . a case studi of a number of hypothet blackboard system that compris differ knowledg organis is provid

knowledge organisation
product design blackboard systems
graph decomposition
knowledge-based product design
data exchange
case study


Run-time data-flow analysis

Abstract: Parallelizing compilers have made great progress in recent years. However, there still remains a gap between the current ability of parallelizing compilers and their final goals. In order to achieve the maximum parallelism, run-time techniques were used in parallelizing compilers during last few years. First, this paper presents a basic run-time privatization method. The definition of run-time dead code is given and its side effect is discussed. To eliminate the imprecision caused by the run-time dead code, backward data-flow information must be used. Proteus Test, which can use backward information in run-time, is then presented to exploit more dynamic parallelism. Also, a variation of Proteus Test, the Advanced Proteus Test, is offered to achieve partial parallelism. Proteus Test was implemented on the parallelizing compiler AFT. In the end of this paper the program fpppp.f of Spec95fp Benchmark is taken as an example, to show the effectiveness of Proteus Test

run-tim data-flow analysi
 parallel compil have made great progress in recent year . howev , there still remain a gap between the current abil of parallel compil and their final goal . in order to achiev the maximum parallel , run-tim techniqu were use in parallel compil dure last few year . first , thi paper present a basic run-tim privat method . the definit of run-tim dead code is given and it side effect is discuss . to elimin the imprecis caus by the run-tim dead code , backward data-flow inform must be use . proteu test , which can use backward inform in run-tim , is then present to exploit more dynam parallel . also , a variat of proteu test , the advanc proteu test , is offer to achiev partial parallel . proteu test wa implement on the parallel compil aft . in the end of thi paper the program fpppp.f of spec95fp benchmark is taken as an exampl , to show the effect of proteu test

parallelizing compilers
run-time privatization method
run-time dead code
backward data-flow information
Proteus Test
dynamic parallelism
run-time data flow analysis


Estimating the intrinsic dimension of data with a fractal-based method

Abstract: In this paper, the problem of estimating the intrinsic dimension of a data set is investigated. A fractal-based approach using the Grassberger-Procaccia algorithm is proposed. Since the Grassberger-Procaccia algorithm (1983) performs badly on sets of high dimensionality, an empirical procedure that improves the original algorithm has been developed. The procedure has been tested on data sets of known dimensionality and on time series of Santa Fe competition

estim the intrins dimens of data with a fractal-bas method
 in thi paper , the problem of estim the intrins dimens of a data set is investig . a fractal-bas approach use the grassberger-procaccia algorithm is propos . sinc the grassberger-procaccia algorithm ( 1983 ) perform badli on set of high dimension , an empir procedur that improv the origin algorithm ha been develop . the procedur ha been test on data set of known dimension and on time seri of santa fe competit

fractal-based method
time series
Santa Fe competition
data intrinsic dimension estimation
pattern recognition


Scalable hybrid computation with spikes

Abstract: We outline a hybrid analog-digital scheme for computing with three important features that enable it to scale to systems of large complexity: First, like digital computation, which uses several one-bit precise logical units to collectively compute a precise answer to a computation, the hybrid scheme uses several moderate-precision analog units to collectively compute a precise answer to a computation. Second, frequent discrete signal restoration of the analog information prevents analog noise and offset from degrading the computation. Third, a state machine enables complex computations to be created using a sequence of elementary computations. A natural choice for implementing this hybrid scheme is one based on spikes because spike-count codes are digital, while spike-time codes are analog. We illustrate how spikes afford easy ways to implement all three components of scalable hybrid computation. First, as an important example of distributed analog computation, we show how spikes can create a distributed modular representation of an analog number by implementing digital carry interactions between spiking analog neurons. Second, we show how signal restoration may be performed by recursive spike-count quantization of spike-time codes. Third, we use spikes from an analog dynamical system to trigger state transitions in a digital dynamical system, which reconfigures the analog dynamical system using a binary control vector; such feedback interactions between analog and digital dynamical systems create a hybrid state machine (HSM). The HSM extends and expands the concept of a digital finite-state-machine to the hybrid domain. We present experimental data from a two-neuron HSM on a chip that implements error-correcting analog-to-digital conversion with the concurrent use of spike-time and spike-count codes. We also present experimental data from silicon circuits that implement HSM-based pattern recognition using spike-time synchrony. We outline how HSMs may be used to perform learning, vector quantization, spike pattern recognition and generation, and how they may be reconfigured

scalabl hybrid comput with spike
 we outlin a hybrid analog-digit scheme for comput with three import featur that enabl it to scale to system of larg complex : first , like digit comput , which use sever one-bit precis logic unit to collect comput a precis answer to a comput , the hybrid scheme use sever moderate-precis analog unit to collect comput a precis answer to a comput . second , frequent discret signal restor of the analog inform prevent analog nois and offset from degrad the comput . third , a state machin enabl complex comput to be creat use a sequenc of elementari comput . a natur choic for implement thi hybrid scheme is one base on spike becaus spike-count code are digit , while spike-tim code are analog . we illustr how spike afford easi way to implement all three compon of scalabl hybrid comput . first , as an import exampl of distribut analog comput , we show how spike can creat a distribut modular represent of an analog number by implement digit carri interact between spike analog neuron . second , we show how signal restor may be perform by recurs spike-count quantiz of spike-tim code . third , we use spike from an analog dynam system to trigger state transit in a digit dynam system , which reconfigur the analog dynam system use a binari control vector ; such feedback interact between analog and digit dynam system creat a hybrid state machin ( hsm ) . the hsm extend and expand the concept of a digit finite-state-machin to the hybrid domain . we present experiment data from a two-neuron hsm on a chip that implement error-correct analog-to-digit convers with the concurr use of spike-tim and spike-count code . we also present experiment data from silicon circuit that implement hsm-base pattern recognit use spike-tim synchroni . we outlin how hsm may be use to perform learn , vector quantiz , spike pattern recognit and gener , and how they may be reconfigur


In medias res [DVD formats]

Abstract: Four years in the making, the DVD format war rages on, no winner insight. meanwhile, the spoils of war abound, and DVD media manufacturers stand poised to profit

in media re [ dvd format ]
 four year in the make , the dvd format war rage on , no winner insight . meanwhil , the spoil of war abound , and dvd media manufactur stand pois to profit

DVD format war
DVD media manufacturers
DVD-RAM
DVD+RW
DVD+R
DVD-RW
DVD-R
compatibility
writable DVD


Algorithmic results for ordered median problems

Abstract: In a series of papers a new type of objective function in location theory, called ordered median function, has been introduced and analyzed. This objective function unifies and generalizes most common objective functions used in location theory. In this paper we identify finite dominating sets for these models and develop polynomial time algorithms together with a detailed complexity analysis

algorithm result for order median problem
 in a seri of paper a new type of object function in locat theori , call order median function , ha been introduc and analyz . thi object function unifi and gener most common object function use in locat theori . in thi paper we identifi finit domin set for these model and develop polynomi time algorithm togeth with a detail complex analysi

algorithmic results
ordered median problems
objective function
location theory
ordered median function
finite dominating sets
polynomial time algorithms
detailed complexity analysis


Girls, boys, and computers

Abstract: Today North American girls, boys, teachers, and parents frequently regard computer science and programming as something boys are better at. The author considers how many of the factors that contribute to the low participation of women in computing occur first, and perhaps most forcefully, in childhood. She presents four recommendations to address the situation

girl , boy , and comput
 today north american girl , boy , teacher , and parent frequent regard comput scienc and program as someth boy are better at . the author consid how mani of the factor that contribut to the low particip of women in comput occur first , and perhap most forc , in childhood . she present four recommend to address the situat

girls
boys
teachers
computer science
programming
women
childhood
gender issues


Chaotic phenomena and fractional-order dynamics in the trajectory control of redundant manipulators

Abstract: Redundant manipulators have some advantages when compared with classical arms because they allow the trajectory optimization, both on the free space and on the presence of obstacles, and the resolution of singularities. For this type of arms the proposed kinematic control algorithms adopt generalized inverse matrices but, in general, the corresponding trajectory planning schemes show important limitations. Motivated by these problems this paper studies the chaos revealed by the pseudoinverse-based trajectory planning algorithms, using the theory of fractional calculus

chaotic phenomena and fractional-ord dynam in the trajectori control of redund manipul
 redund manipul have some advantag when compar with classic arm becaus they allow the trajectori optim , both on the free space and on the presenc of obstacl , and the resolut of singular . for thi type of arm the propos kinemat control algorithm adopt gener invers matric but , in gener , the correspond trajectori plan scheme show import limit . motiv by these problem thi paper studi the chao reveal by the pseudoinverse-bas trajectori plan algorithm , use the theori of fraction calculu

chaotic phenomena
fractional-order dynamics
trajectory control
redundant manipulators
classical arms
trajectory optimization
kinematic control algorithms
generalized inverse matrices
trajectory planning schemes
fractional calculus


Conditions for decentralized integral controllability

Abstract: The term decentralized integral controllability (DIC) pertains to the existence of stable decentralized controllers with integral action that have closed-loop properties such as stable independent detuning. It is especially useful to select control structures systematically at the early stage of control system design because the only information needed for DIC is the steady-state process gain matrix. Here, a necessary and sufficient condition conjectured in the literature is proved. The real structured singular value which can exploit realness of the controller gain is used to describe computable conditions for DIC. The primary usage of DIC is to eliminate unworkable pairings. For this, two other simple necessary conditions are proposed. Examples are given to illustrate the effectiveness of the proposed conditions for DIC

condit for decentr integr control
 the term decentr integr control ( dic ) pertain to the exist of stabl decentr control with integr action that have closed-loop properti such as stabl independ detun . it is especi use to select control structur systemat at the earli stage of control system design becaus the onli inform need for dic is the steady-st process gain matrix . here , a necessari and suffici condit conjectur in the literatur is prove . the real structur singular valu which can exploit real of the control gain is use to describ comput condit for dic . the primari usag of dic is to elimin unwork pair . for thi , two other simpl necessari condit are propos . exampl are given to illustr the effect of the propos condit for dic

decentralized integral controllability
stable decentralized controllers
integral action
closed-loop properties
stable independent detuning
control system design
steady-state process gain matrix
real structured singular value
necessary sufficient conditions
systematic control structure selection
controller gain realness
unworkable pairing elimination
Schur complement


Assignment of periods and priorities of messages and tasks in distributed control systems

Abstract: Presents a task and message-based scheduling method to guarantee the given end-to-end constraints including precedence constraints, time constraints, and period and priority of task and message. The method is an integrated one considering both tasks executed in each node and messages transmitted via the network and is designed to apply to a general distributed control system that has multiple loops and a single loop has sensor nodes with multiple sensors, actuator nodes with multiple actuators, controller nodes with multiple tasks, and several types of constraints. The assigning method of the optimal period and priority of task and message is proposed, using the presented task and message-based scheduling method

assign of period and prioriti of messag and task in distribut control system
 present a task and message-bas schedul method to guarante the given end-to-end constraint includ preced constraint , time constraint , and period and prioriti of task and messag . the method is an integr one consid both task execut in each node and messag transmit via the network and is design to appli to a gener distribut control system that ha multipl loop and a singl loop ha sensor node with multipl sensor , actuat node with multipl actuat , control node with multipl task , and sever type of constraint . the assign method of the optim period and prioriti of task and messag is propos , use the present task and message-bas schedul method

distributed control systems
message-based scheduling method
end-to-end constraints
precedence constraints
time constraints
periods assignment
priorities assignment
task-based scheduling method


Discreteness and relevance: a reply to Roman Poznanski

Abstract: In reply to Poznanski (see ibid., p.435, 2002) on discreteness and relevance, Eliasmith claims that all of the concerns voiced by Poznanski in his reply fail to offer a serious challenge to the idea that continuity is irrelevant to a good understanding of cognitive systems. Eliasmith hopes that it is evident that he does not claim that the process in neural systems is discrete, but rather that a complete characterization of the process can be discrete; these of course are significantly different claims

discret and relev : a repli to roman poznanski
 in repli to poznanski ( see ibid . , p.435 , 2002 ) on discret and relev , eliasmith claim that all of the concern voic by poznanski in hi repli fail to offer a seriou challeng to the idea that continu is irrelev to a good understand of cognit system . eliasmith hope that it is evid that he doe not claim that the process in neural system is discret , but rather that a complet character of the process can be discret ; these of cours are significantli differ claim

discreteness
relevance
continuity
cognitive systems
neural systems


A framework for rapid local area modeling for construction automation

Abstract: Rapid 3D positioning and modeling in construction can be used to more effectively plan, visualize, and communicate operations before execution. It can also help to optimize equipment operations, significantly improve safety, and enhance a remote operator's spatial perception of the workspace. A new framework for rapid local area sensing and 3D modeling for better planning and control of construction equipment operation is described and demonstrated. By combining human-assisted graphical workspace modeling with pre-stored Computer-Aided Design (CAD) models and simple sensors (such as single-axis laser rangefinders and remote video cameras), modeling time can be significantly reduced while potentially increasing modeling accuracy

a framework for rapid local area model for construct autom
 rapid 3d posit and model in construct can be use to more effect plan , visual , and commun oper befor execut . it can also help to optim equip oper , significantli improv safeti , and enhanc a remot oper 's spatial percept of the workspac . a new framework for rapid local area sens and 3d model for better plan and control of construct equip oper is describ and demonstr . by combin human-assist graphic workspac model with pre-stor computer-aid design ( cad ) model and simpl sensor ( such as single-axi laser rangefind and remot video camera ) , model time can be significantli reduc while potenti increas model accuraci


End-user perspectives on the uptake of computer supported cooperative working

Abstract: Researchers in information systems have produced a rich collection of meta-analyses and models to further understanding of factors influencing the uptake of information technologies. In the domain of CSCW, however, these models have largely been neglected, and while there are many case studies, no systematic account of uptake has been produced. We use findings from information systems research to structure a meta-analysis of uptake issues as reported in CSCW case studies, supplemented by a detailed re-examination of one of our own case studies from this perspective. This shows that while there are some factors which seem to be largely specific to CSCW introductions, many of the case study results are very similar to standard IS findings. We conclude by suggesting how the two communities of researchers might build on each other's work, and finally propose activity theory as a means of integrating the two perspectives

end-us perspect on the uptak of comput support cooper work
 research in inform system have produc a rich collect of meta-analys and model to further understand of factor influenc the uptak of inform technolog . in the domain of cscw , howev , these model have larg been neglect , and while there are mani case studi , no systemat account of uptak ha been produc . we use find from inform system research to structur a meta-analysi of uptak issu as report in cscw case studi , supplement by a detail re-examin of one of our own case studi from thi perspect . thi show that while there are some factor which seem to be larg specif to cscw introduct , mani of the case studi result are veri similar to standard is find . we conclud by suggest how the two commun of research might build on each other 's work , and final propos activ theori as a mean of integr the two perspect

end-user perspectives
computer supported cooperative work
information systems
meta-analyses
information technology
CSCW
activity theory


A new architecture for implementing pipelined FIR ADF based on classification of coefficients

Abstract: In this paper, we propose a new method for implementing pipelined finite-impulse response (FIR) adaptive digital filter (ADF), with an aim of reducing the maximum delay of the filtering portion of conventional delayed least mean square (DLMS) pipelined ADF. We achieve a filtering section with a maximum delay of one by simplifying a pre-upsampled and a post-downsampled FIR filter using the concept of classification of coefficients. This reduction is independent of the order of the filter, which is an advantage when the order of the filter is very large, and as a result the method can also be applied to infinite impulse response (IIR) filters. Furthermore, when the proposed method is compared with the transpose ADF, which has a filtering section with zero delay, it is realized that it significantly reduces the maximum delay associated with updating the coefficients of FIR ADF. The effect of this is that, the proposed method exhibits a higher convergence speed in comparison to the transpose FIR ADF

a new architectur for implement pipelin fir adf base on classif of coeffici
 in thi paper , we propos a new method for implement pipelin finite-impuls respons ( fir ) adapt digit filter ( adf ) , with an aim of reduc the maximum delay of the filter portion of convent delay least mean squar ( dlm ) pipelin adf . we achiev a filter section with a maximum delay of one by simplifi a pre-upsampl and a post-downsampl fir filter use the concept of classif of coeffici . thi reduct is independ of the order of the filter , which is an advantag when the order of the filter is veri larg , and as a result the method can also be appli to infinit impuls respons ( iir ) filter . furthermor , when the propos method is compar with the transpos adf , which ha a filter section with zero delay , it is realiz that it significantli reduc the maximum delay associ with updat the coeffici of fir adf . the effect of thi is that , the propos method exhibit a higher converg speed in comparison to the transpos fir adf

pipelined FIR ADF
adaptive digital filter
maximum delay
convergence speed
coefficient classification
delayed least mean square filter
pre-upsampled filter
post-downsampled filter


Sliding mode control of chaos in the cubic Chua's circuit system

Abstract: In this paper, a sliding mode controller is applied to control the cubic Chua's circuit system. The sliding surface of this paper used is one dimension higher than the traditional surface and guarantees its passage through the initial states of the controlled system. Therefore, using the characteristic of this sliding mode we aim to design a controller that can meet the desired specification and use less control energy by comparing with the result in the current existing literature. The results show that the proposed controller can steer Chua's circuit system to the desired state without the chattering phenomenon and abrupt state change

slide mode control of chao in the cubic chua 's circuit system
 in thi paper , a slide mode control is appli to control the cubic chua 's circuit system . the slide surfac of thi paper use is one dimens higher than the tradit surfac and guarante it passag through the initi state of the control system . therefor , use the characterist of thi slide mode we aim to design a control that can meet the desir specif and use less control energi by compar with the result in the current exist literatur . the result show that the propos control can steer chua 's circuit system to the desir state without the chatter phenomenon and abrupt state chang

sliding mode control
chaos
sliding surface
chattering
state change
cubic Chua circuit system
match disturbance
mismatch disturbance


Three-dimensional periodic Voronoi grain models and micromechanical FE-simulations of a two-phase steel

Abstract: A three-dimensional model is proposed for modeling of microstructures. The model is based on the finite element method with periodic boundary conditions. The Voronoi algorithm is used to generate the geometrical model, which has a periodic grain structure that follows the original boundaries of the Voronoi cells. As an application, the model is used to model a two-phase ferrite/pearlite steel. It is shown that periodic cells with only five grains generate representative stress-strain curves

three-dimension period voronoi grain model and micromechan fe-simul of a two-phas steel
 a three-dimension model is propos for model of microstructur . the model is base on the finit element method with period boundari condit . the voronoi algorithm is use to gener the geometr model , which ha a period grain structur that follow the origin boundari of the voronoi cell . as an applic , the model is use to model a two-phas ferrit / pearlit steel . it is shown that period cell with onli five grain gener repres stress-strain curv

periodic Voronoi grain models
two-phase steel
three-dimensional model
periodic boundary conditions
Voronoi algorithm
geometrical model
stress-strain curves
micromechanical FEM simulations
microstructures modeling
ferrite-pearlite steel
Voronoi tessellation
adaptive mesh generator
quadtree/octree-based algorithm
kinematic constraints
computational time


FLID-DL: congestion control for layered multicast

Abstract: We describe fair layered increase/decrease with dynamic layering (FLID-DL): a new multirate congestion control algorithm for layered multicast sessions. FLID-DL generalizes the receiver-driven layered congestion control protocol (RLC) introduced by Vicisano et al. (Proc. IEEE INFOCOM, San Francisco, CA, , p.996-1003, Mar. 1998)ameliorating the problems associated with large Internet group management protocol (IGMP) leave latencies and abrupt rate increases. Like RLC, FLID-DL, is a scalable, receiver-driven congestion control mechanism in which receivers add layers at sender-initiated synchronization points and leave layers when they experience congestion. FLID-DL congestion control coexists with transmission control protocol (TCP) flows as well as other FLID-DL sessions and supports general rates on the different multicast layers. We demonstrate via simulations that our congestion control scheme exhibits better fairness properties and provides better throughput than previous methods. A key contribution that enables FLID-DL and may be useful elsewhere is dynamic layering (DL), which mitigates the negative impact of long IGMP leave latencies and eliminates the need for probe intervals present in RLC. We use DL to respond to congestion much faster than IGMP leave operations, which have proven to be a bottleneck in practice for prior work

flid-dl : congest control for layer multicast
 we describ fair layer increas / decreas with dynam layer ( flid-dl ): a new multir congest control algorithm for layer multicast session . flid-dl gener the receiver-driven layer congest control protocol ( rlc ) introduc by vicisano et al . ( proc . ieee infocom , san francisco , ca , , p.996 - 1003 , mar. 1998)amelior the problem associ with larg internet group manag protocol ( igmp ) leav latenc and abrupt rate increas . like rlc , flid-dl , is a scalabl , receiver-driven congest control mechan in which receiv add layer at sender-initi synchron point and leav layer when they experi congest . flid-dl congest control coexist with transmiss control protocol ( tcp ) flow as well as other flid-dl session and support gener rate on the differ multicast layer . we demonstr via simul that our congest control scheme exhibit better fair properti and provid better throughput than previou method . a key contribut that enabl flid-dl and may be use elsewher is dynam layer ( dl ) , which mitig the neg impact of long igmp leav latenc and elimin the need for probe interv present in rlc . we use dl to respond to congest much faster than igmp leav oper , which have proven to be a bottleneck in practic for prior work


The Information Age interview - Capital One

Abstract: Credit card company Capital One attributes its rapid customer growth to the innovative use of cutting-edge technology. European CIO Catherine Doran talks about the systems that have fuelled that runaway success

the inform age interview - capit one
 credit card compani capit one attribut it rapid custom growth to the innov use of cutting-edg technolog . european cio catherin doran talk about the system that have fuell that runaway success

Capital One
credit card company
customer growth
cutting-edge technology


Temp IT chief rallies troops [Mori]

Abstract: The appointment of a highly qualified interim IT manager enabled market research company Mori to rapidly restructure its IT department. Now the resulting improvements are allowing it to support an increasing role for technology in the assimilation and analysis of market research

temp it chief ralli troop [ mori ]
 the appoint of a highli qualifi interim it manag enabl market research compani mori to rapidli restructur it it depart . now the result improv are allow it to support an increas role for technolog in the assimil and analysi of market research

Mori
interim IT manager
market research company


Super high definition image (WHD: Wide/Double HD) transmission system

Abstract: This paper describes a WHD image transmission system constructed from a display projector, CODECs, and a camera system imaging a super high definition image (WHD: Wide/Double HD) corresponding to two screen portions of common high-vision images. This system was developed as a transmission system to communicate with or transmit information giving a reality-enhanced feeling to a remote location by using images of super high definition. In addition, the correction processing for the distortions of images occurring due to the structure of the camera system, an outline of the transmission experiments using the proposed system, and subjective evaluation experiments using WHD images are presented

super high definit imag ( whd : wide / doubl hd ) transmiss system
 thi paper describ a whd imag transmiss system construct from a display projector , codec , and a camera system imag a super high definit imag ( whd : wide / doubl hd ) correspond to two screen portion of common high-vis imag . thi system wa develop as a transmiss system to commun with or transmit inform give a reality-enhanc feel to a remot locat by use imag of super high definit . in addit , the correct process for the distort of imag occur due to the structur of the camera system , an outlin of the transmiss experi use the propos system , and subject evalu experi use whd imag are present

super high definition image transmission system


Efficient combinational verification using overlapping local BDDs and a hash table

Abstract: We propose a novel methodology that combines local BDDs (binary decision diagrams) with a hash table for very efficient verification of combinational circuits. The main purpose of this technique is to remove the considerable overhead associated with case-by-case verification of internal node pairs in typical internal correspondence based verification methods. Two heuristics based on the number of structural levels of circuitry looked at and the total number of nodes in the BDD manager are used to control the BDD sizes and introduce new cutsets based on already found equivalent nodes. We verify the ISCAS85 benchmark circuits and demonstrate significant speedup over existing methods. We also verify several hard industrial circuits and show our superiority in extracting internal equivalences

effici combin verif use overlap local bdd and a hash tabl
 we propos a novel methodolog that combin local bdd ( binari decis diagram ) with a hash tabl for veri effici verif of combin circuit . the main purpos of thi techniqu is to remov the consider overhead associ with case-by-cas verif of intern node pair in typic intern correspond base verif method . two heurist base on the number of structur level of circuitri look at and the total number of node in the bdd manag are use to control the bdd size and introduc new cutset base on alreadi found equival node . we verifi the iscas85 benchmark circuit and demonstr signific speedup over exist method . we also verifi sever hard industri circuit and show our superior in extract intern equival


Characterization of sheet buckling subjected to controlled boundary constraints

Abstract: A wedge strip test is designed to study the onset and post-buckling behavior of a sheet under various boundary constraints. The device can be easily incorporated into a conventional tensile test machine, and material resistance to buckling is measured as the buckling height versus the in-plane strain state. The design yields different but consistent buckling modes with easy changes of boundary conditions (either clamped or freed) and sample geometry. Experimental results are then used to verify a hybrid approach to buckling prediction, i.e., the combination of the FEM analysis and an energy-based analytical wrinkling criterion. The FEM analysis is used to obtain the stress field and deformed geometry in a complex forming condition, while the analytical solution is to provide the predictions less sensitive to artificial numerical parameters. A good agreement between experimental data and numerical predictions is obtained

character of sheet buckl subject to control boundari constraint
 a wedg strip test is design to studi the onset and post-buckl behavior of a sheet under variou boundari constraint . the devic can be easili incorpor into a convent tensil test machin , and materi resist to buckl is measur as the buckl height versu the in-plan strain state . the design yield differ but consist buckl mode with easi chang of boundari condit ( either clamp or freed ) and sampl geometri . experiment result are then use to verifi a hybrid approach to buckl predict , i.e. , the combin of the fem analysi and an energy-bas analyt wrinkl criterion . the fem analysi is use to obtain the stress field and deform geometri in a complex form condit , while the analyt solut is to provid the predict less sensit to artifici numer paramet . a good agreement between experiment data and numer predict is obtain


Repeated games with lack of information on one side: the dual differential approach

Abstract: We introduce the dual differential game of a repeated game with lack of information on one side as the natural continuous time version of the dual game introduced by De Meyer (1996). A traditional way to study the value of differential games is through discrete time approximations. Here, we follow the opposite approach: We identify the limit value of a repeated game in discrete time as the value of a differential game. Namely, we use the recursive structure for the finitely repeated version of the dual game to construct a differential game for which the upper values of the uniform discretization satisfy precisely the same property. The value of the dual differential game exists and is the unique viscosity solution of a first-order derivative equation with a limit condition. We identify the solution by translating viscosity properties in the primal

repeat game with lack of inform on one side : the dual differenti approach
 we introduc the dual differenti game of a repeat game with lack of inform on one side as the natur continu time version of the dual game introduc by de meyer ( 1996 ) . a tradit way to studi the valu of differenti game is through discret time approxim . here , we follow the opposit approach : we identifi the limit valu of a repeat game in discret time as the valu of a differenti game . name , we use the recurs structur for the finit repeat version of the dual game to construct a differenti game for which the upper valu of the uniform discret satisfi precis the same properti . the valu of the dual differenti game exist and is the uniqu viscos solut of a first-ord deriv equat with a limit condit . we identifi the solut by translat viscos properti in the primal

repeated games
repeated games
dual differential game
discrete time approximations
discrete time
limit value
viscosity solution
limit condition
repeated game


Recognition of finite simple groups S/sub 4/(q) by their element orders

Abstract: It is proved that among simple groups S/sub 4/(q) in the class of finite-groups, only the groups S/sub 4/(3/sup n/), where n is an odd number greater than unity, are recognizable by a set of their element orders. It is also shown that simple groups U/sub 3/(9), /sup 3/D/sub 4/(2), G/sub 2/(4), S/sub 6/(3), F/sub 4/(2), and /sup 2/E/sub 6/(2) are recognizable, but L/sub 3/(3) is not

recognit of finit simpl group s / sub 4/(q ) by their element order
 it is prove that among simpl group s / sub 4/(q ) in the class of finite-group , onli the group s / sub 4/(3 / sup n/ ) , where n is an odd number greater than uniti , are recogniz by a set of their element order . it is also shown that simpl group u / sub 3/(9 ) , /sup 3 / d / sub 4/(2 ) , g / sub 2/(4 ) , s / sub 6/(3 ) , f / sub 4/(2 ) , and /sup 2 / e / sub 6/(2 ) are recogniz , but l / sub 3/(3 ) is not

element orders
finite simple groups recognition
divisibility relation


Advancements during the past quarter century in on-line monitoring of motor and generator winding insulation

Abstract: Electrical insulation plays a critical role in the operation of motor and generator rotor and stator windings. Premature failure of the insulation can cost millions of dollars per day. With advancements in electronics, sensors, computers and software, tremendous progress has been made in the past 25 yr which has transformed on-line insulation monitoring from a rarely used and expensive tool, to the point where 50% of large utility generators in North America are now equipped for such monitoring. This review paper outlines the motivation for online monitoring, discusses the transition to today's technology, and describes the variety of methods now in use for rotor winding and stator winding monitoring

advanc dure the past quarter centuri in on-lin monitor of motor and gener wind insul
 electr insul play a critic role in the oper of motor and gener rotor and stator wind . prematur failur of the insul can cost million of dollar per day . with advanc in electron , sensor , comput and softwar , tremend progress ha been made in the past 25 yr which ha transform on-lin insul monitor from a rare use and expens tool , to the point where 50 % of larg util gener in north america are now equip for such monitor . thi review paper outlin the motiv for onlin monitor , discuss the transit to today 's technolog , and describ the varieti of method now in use for rotor wind and stator wind monitor

generator winding insulation
electrical insulation
stator windings
electronics
sensors
computers
software
rotor windings
motor generator winding insulation
winding insulation on-line monitoring
premature insulation failure
temperature monitoring
condition monitors
tagging compounds
ozone monitoring
PD monitoring
magnetic flux monitoring
partial discharge monitoring
endwinding vibration monitoring


Semantic data broadcast for a mobile environment based on dynamic and adaptive chunking

Abstract: Database broadcast is an effective and scalable approach to disseminate information of high affinity to a large collection of mobile clients. A common problem of existing broadcast approaches is the lack of knowledge for a client to determine if all data items satisfying its query could be obtained from the broadcast. We therefore propose a semantic-based broadcast approach. A semantic descriptor is attached to each broadcast unit, called a data chunk. This semantic descriptor allows a client to determine if a query can be answered entirely based on broadcast items and, if needed, identify the precise definition of the remaining items in the form of a "supplementary" query. Data chunks can be of static or dynamic sizes and organized hierarchically. Their boundary can be determined on-the-fly, adaptive to the nature of client queries. We investigate different ways of organizing the data chunks over a broadcast channel to improve access performance. We introduce the data affinity index metric, which more accurately reflects client-perceived performance. A simulation model is built to evaluate our semantic-based broadcast schemes

semant data broadcast for a mobil environ base on dynam and adapt chunk
 databas broadcast is an effect and scalabl approach to dissemin inform of high affin to a larg collect of mobil client . a common problem of exist broadcast approach is the lack of knowledg for a client to determin if all data item satisfi it queri could be obtain from the broadcast . we therefor propos a semantic-bas broadcast approach . a semant descriptor is attach to each broadcast unit , call a data chunk . thi semant descriptor allow a client to determin if a queri can be answer entir base on broadcast item and , if need , identifi the precis definit of the remain item in the form of a " supplementari " queri . data chunk can be of static or dynam size and organ hierarch . their boundari can be determin on-the-fli , adapt to the natur of client queri . we investig differ way of organ the data chunk over a broadcast channel to improv access perform . we introduc the data affin index metric , which more accur reflect client-perceiv perform . a simul model is built to evalu our semantic-bas broadcast scheme

semantic data broadcast
adaptive chunking
mobile clients
semantic descriptor
data chunking
answerability
data affinity index
mobile databases
mobile computing
query processing


A model for choosing an electronic reserves system: a pre-implementation study at the library of Long Island University's Brooklyn campus

Abstract: This study explores the nature of electronic reserves (e-reserves) and investigates the possibilities of implementing the e-reserves at the Long Island University/Brooklyn Campus Library (LIU/BCL)

a model for choos an electron reserv system : a pre-implement studi at the librari of long island univers 's brooklyn campu
 thi studi explor the natur of electron reserv ( e-reserv ) and investig the possibl of implement the e-reserv at the long island univers / brooklyn campu librari ( liu / bcl )

Long Island University Brooklyn Campus Library


Gender, software design, and occupational equity

Abstract: After reviewing the work on gender bias in software design, a model of gender-role influenced achievement choice taken from Eccles (1994) is presented. The paper concludes that (1) though laudable, reduction of gender bias in software design is not the most straightforward way to reduce gender inequity in the choice of computing as a career, (2) the model itself makes more clear some of the ethical issues involved in attempting to achieve gender equity on computing, and (3) efforts to reduce gender inequity in the choice of computing as a career need to be evaluated in the light of this model

gender , softwar design , and occup equiti
 after review the work on gender bia in softwar design , a model of gender-rol influenc achiev choic taken from eccl ( 1994 ) is present . the paper conclud that ( 1 ) though laudabl , reduct of gender bia in softwar design is not the most straightforward way to reduc gender inequ in the choic of comput as a career , ( 2 ) the model itself make more clear some of the ethic issu involv in attempt to achiev gender equiti on comput , and ( 3 ) effort to reduc gender inequ in the choic of comput as a career need to be evalu in the light of thi model

gender-role influenced achievement choice model